File: 2002-08-22-DominanceProblem.ll

package info (click to toggle)
llvm-toolchain-18 1%3A18.1.8-18
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,908,340 kB
  • sloc: cpp: 6,667,937; ansic: 1,440,452; asm: 883,619; python: 230,549; objc: 76,880; f90: 74,238; lisp: 35,989; pascal: 16,571; sh: 10,229; perl: 7,459; ml: 5,047; awk: 3,523; makefile: 2,987; javascript: 2,149; xml: 892; fortran: 649; cs: 573
file content (18 lines) | stat: -rw-r--r-- 486 bytes parent folder | download | duplicates (44) 
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
}