File: 2003-08-12-AllocaNonNull.ll

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (21 lines) | stat: -rw-r--r-- 702 bytes parent folder | download | duplicates (12) 
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 -passes=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         ; <ptr> [#uses=2]
        %tmp.1 = icmp ne ptr %live_head, null          ; <i1> [#uses=1]
        br i1 %tmp.1, label %then, label %UnifiedExitNode

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

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