File: 2002-08-22-DominanceProblem.ll

package info (click to toggle)
llvm-toolchain-9 1%3A9.0.1-16
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 882,436 kB
  • sloc: cpp: 4,167,636; ansic: 714,256; asm: 457,610; python: 155,927; objc: 65,094; sh: 42,856; lisp: 26,908; perl: 7,786; pascal: 7,722; makefile: 6,881; ml: 5,581; awk: 3,648; cs: 2,027; xml: 888; javascript: 381; ruby: 156
file content (18 lines) | stat: -rw-r--r-- 486 bytes parent folder | download | duplicates (34) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 
; RUN: llvm-as %s -o /dev/null
; RUN: verify-uselistorder %s

; Dominance relationships is not calculated correctly for unreachable blocks,
; which causes the verifier to barf on this input.

define i32 @test(i1 %b) {
BB0:
        ret i32 7 ; Loop is unreachable

Loop:           ; preds = %L2, %Loop
        %B = phi i32 [ %B, %L2 ], [ %B, %Loop ]         ;PHI has same value always. 
        br i1 %b, label %L2, label %Loop

L2:             ; preds = %Loop
        br label %Loop
}