File: unused-phis.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (39 lines) | stat: -rw-r--r-- 720 bytes parent folder | download | duplicates (18) 
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
39
 
; RUN: opt < %s -lcssa -S | FileCheck %s
; RUN: opt < %s -passes=lcssa -S | FileCheck %s
; CHECK: exit1:
; CHECK: .lcssa =
; CHECK: exit2:
; CHECK: .lcssa1 =
; CHECK: exit3:
; CHECK-NOT: .lcssa

; 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
}