RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-01 16:33:37 +01:00
Code Issues Projects Releases Wiki Activity
348c3f8197
llvm-mirror/test/Transforms/SimplifyCFG/PhiNoEliminate.ll

28 lines
1.1 KiB
LLVM
Raw Normal View History

Change tests from "opt %s" to "opt < %s" so that opt doesn't see the input filename so that opt doesn't print the input filename in the output so that grep lines in the tests don't unintentionally match strings in the input filename. llvm-svn: 81537
2009-09-11 20:01:28 +02:00
; RUN: opt < %s -simplifycfg -S | \
For PR1319: Upgrade to use new Tcl exec based test harness. This exposes 3 bugs that were previously not being reported: test/Transforms/GlobalDCE/2002-08-17-FunctionDGE.ll test/Transforms/GlobalOpt/memset.ll test/Transforms/IndVarsSimplify/exit_value_tests.llx llvm-svn: 36065
2007-04-15 11:21:47 +02:00
; RUN: not grep select
When converting phi nodes into select instructions, we shouldn't promote PHI 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
2004-10-14 07:12:50 +02:00
;; 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.
Upgrade tests to not use llvm-upgrade. llvm-svn: 48483
2008-03-18 04:45:45 +01:00
define i32 @bar(i1 %C) {
When converting phi nodes into select instructions, we shouldn't promote PHI 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
2004-10-14 07:12:50 +02:00
entry:
Upgrade tests to not use llvm-upgrade. llvm-svn: 48483
2008-03-18 04:45:45 +01:00
br i1 %C, label %then, label %endif
then: ; preds = %entry
%tmp.3 = call i32 @qux( ) ; <i32> [#uses=0]
When converting phi nodes into select instructions, we shouldn't promote PHI 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
2004-10-14 07:12:50 +02:00
br label %endif
Upgrade tests to not use llvm-upgrade. llvm-svn: 48483
2008-03-18 04:45:45 +01:00
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
When converting phi nodes into select instructions, we shouldn't promote PHI 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
2004-10-14 07:12:50 +02:00
}
Upgrade tests to not use llvm-upgrade. llvm-svn: 48483
2008-03-18 04:45:45 +01:00
declare i32 @qux()
Reference in New Issue Copy Permalink