File: 2003-08-12-AllocaNonNull.ll

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (21 lines) | stat: -rw-r--r-- 699 bytes parent folder | download | duplicates (7) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
; This testcase can be simplified by "realizing" that alloca can never return
; null.
; RUN: opt < %s -instcombine -simplifycfg -simplifycfg-require-and-preserve-domtree=1 -S | FileCheck %s
; CHECK-NOT: br

declare i32 @bitmap_clear(...)

define i32 @oof() {
entry:
        %live_head = alloca i32         ; <i32*> [#uses=2]
        %tmp.1 = icmp ne i32* %live_head, null          ; <i1> [#uses=1]
        br i1 %tmp.1, label %then, label %UnifiedExitNode

then:           ; preds = %entry
        %tmp.4 = call i32 (...) @bitmap_clear( i32* %live_head )               ; <i32> [#uses=0]
        br label %UnifiedExitNode

UnifiedExitNode:                ; preds = %then, %entry
        ret i32 0
}