mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-28 14:32:51 +01:00
b1f34a989b
nodes unless we KNOW that we are able to promote all of them. In this case promoting the phi to a select is silly because we will always have to do the call conditionally. As such, select promotion is actually a pessimization. llvm-svn: 16972
30 lines
713 B
LLVM
30 lines
713 B
LLVM
; RUN: llvm-as < %s | opt -simplifycfg | llvm-dis | 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.
|
|
|
|
int %bar(bool %C) {
|
|
entry:
|
|
br bool %C, label %then, label %endif
|
|
|
|
then:
|
|
%tmp.3 = call int %qux()
|
|
br label %endif
|
|
|
|
endif:
|
|
%R = phi int [123, %entry], [12312, %then]
|
|
;; stuff to disable tail duplication
|
|
call int %qux()
|
|
call int %qux()
|
|
call int %qux()
|
|
call int %qux()
|
|
call int %qux()
|
|
call int %qux()
|
|
call int %qux()
|
|
ret int %R
|
|
}
|
|
|
|
declare int %qux()
|
|
|