File: PhiEliminate.ll

package info (click to toggle)
llvm-3.1 3.1-1
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 80,224 kB
  • sloc: cpp: 491,014; asm: 110,971; ansic: 14,579; sh: 13,120; python: 6,152; ml: 4,719; makefile: 1,830; pascal: 1,553; perl: 874; xml: 283; lisp: 187; csh: 117; exp: 4
file content (27 lines) | stat: -rw-r--r-- 827 bytes parent folder | download | duplicates (21)
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
; Test a bunch of cases where the cfg simplification code should
; be able to fold PHI nodes into computation in common cases.  Folding the PHI
; nodes away allows the branches to be eliminated, performing a simple form of
; 'if conversion'.

; RUN: opt < %s -simplifycfg -S > %t.xform
; RUN:   not grep phi %t.xform 
; RUN:   grep ret %t.xform

declare void @use(i1)

declare void @use.upgrd.1(i32)


define void @test(i1 %c, i32 %V, i32 %V2) {
; <label>:0
        br i1 %c, label %T, label %F
T:              ; preds = %0
        br label %F
F:              ; preds = %T, %0
        %B1 = phi i1 [ true, %0 ], [ false, %T ]                ; <i1> [#uses=1]
        %I6 = phi i32 [ %V, %0 ], [ 0, %T ]             ; <i32> [#uses=1]
        call void @use( i1 %B1 )
        call void @use.upgrd.1( i32 %I6 )
        ret void
}