File: unused-phis.ll

package info (click to toggle)
llvm-3.0 3.0-10
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 75,412 kB
  • sloc: cpp: 468,043; asm: 109,345; ansic: 13,782; sh: 12,935; ml: 4,716; python: 4,351; perl: 2,096; makefile: 1,905; pascal: 1,578; exp: 389; xml: 283; lisp: 187; csh: 117
file content (38 lines) | stat: -rw-r--r-- 675 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
; RUN: opt < %s -lcssa -S | FileCheck %s
; CHECK: exit1:
; CHECK: .lcssa =
; CHECK: exit2:
; CHECK: .lcssa2 =
; CHECK: exit3:
; CHECK-NOT: .lcssa1 =

; Test to ensure that when there are multiple exit blocks, PHI nodes are
; only inserted by LCSSA when there is a use dominated by a given exit
; block.

declare void @printf(i32 %i)

define i32 @unused_phis() nounwind {
entry:
  br label %loop

loop:
  %i = phi i32 [0, %entry], [1, %then2]
  br i1 undef, label %exit1, label %then1

then1:
  br i1 undef, label %exit2, label %then2

then2:
  br i1 undef, label %exit3, label %loop

exit1:
  call void @printf(i32 %i)
  ret i32 %i

exit2:
  ret i32 %i

exit3:
  ret i32 0
}