File: PhiNoEliminate.ll

package info (click to toggle)
llvm-2.7 2.7-6
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 59,992 kB
  • ctags: 49,499
  • sloc: cpp: 373,792; ansic: 16,885; sh: 12,614; asm: 6,809; ada: 3,083; ml: 2,942; python: 2,671; perl: 2,404; makefile: 1,691; pascal: 1,235; exp: 399; objc: 291; lisp: 184; csh: 117; xml: 38; f90: 36
file content (27 lines) | stat: -rw-r--r-- 1,096 bytes parent folder | download | duplicates (22) 
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
 
; RUN: opt < %s -simplifycfg -S | \
; RUN:   not grep select

;; The PHI node in this example should not be turned into a select, as we are
;; not able to ifcvt the entire block.  As such, converting to a select just 
;; introduces inefficiency without saving copies.

define i32 @bar(i1 %C) {
entry:
        br i1 %C, label %then, label %endif
then:           ; preds = %entry
        %tmp.3 = call i32 @qux( )               ; <i32> [#uses=0]
        br label %endif
endif:          ; preds = %then, %entry
        %R = phi i32 [ 123, %entry ], [ 12312, %then ]          ; <i32> [#uses=1]
        ;; stuff to disable tail duplication
        call i32 @qux( )                ; <i32>:0 [#uses=0]
        call i32 @qux( )                ; <i32>:1 [#uses=0]
        call i32 @qux( )                ; <i32>:2 [#uses=0]
        call i32 @qux( )                ; <i32>:3 [#uses=0]
        call i32 @qux( )                ; <i32>:4 [#uses=0]
        call i32 @qux( )                ; <i32>:5 [#uses=0]
        call i32 @qux( )                ; <i32>:6 [#uses=0]
        ret i32 %R
}

declare i32 @qux()