File: PhiNoEliminate.ll

package info (click to toggle)
llvm-toolchain-9 1%3A9.0.1-16.1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 882,388 kB
  • sloc: cpp: 4,167,636; ansic: 714,256; asm: 457,610; python: 155,927; objc: 65,094; sh: 42,856; lisp: 26,908; perl: 7,786; pascal: 7,722; makefile: 6,881; ml: 5,581; awk: 3,648; cs: 2,027; xml: 888; javascript: 381; ruby: 156
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()