File: 2002-08-22-DominanceProblem.ll

package info (click to toggle)
llvm-toolchain-14 1%3A14.0.6-12
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,496,180 kB
  • sloc: cpp: 5,593,972; ansic: 986,872; asm: 585,869; python: 184,223; objc: 72,530; lisp: 31,119; f90: 27,793; javascript: 9,780; pascal: 9,762; sh: 9,482; perl: 7,468; ml: 5,432; awk: 3,523; makefile: 2,538; xml: 953; cs: 573; fortran: 567
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
}