| /external/llvm/test/Transforms/Mem2Reg/ |
| 2003-10-05-DeadPHIInsertion.ll | 1 ; Mem2reg should not insert dead PHI nodes! The naive algorithm inserts a PHI
4 ; RUN: opt < %s -mem2reg -S | not grep phi
|
| /external/llvm/test/Transforms/SCCP/ |
| 2002-05-20-MissedIncomingValue.ll | 1 ; This test shows a case where SCCP is incorrectly eliminating the PHI node
4 ; RUN: opt < %s -sccp -S | grep phi
10 %V = phi i32 [ 0, %bb1 ], [ %A, %BB4 ] ; <i32> [#uses=1]
|
| apint-phi.ll | 1 ; RUN: opt < %s -sccp -S | not grep phi
7 %V = phi i999 [2, %bb1], [%A, %BB4]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| PhiBlockMerge2.ll | 1 ; Test merging of blocks that only have PHI nodes in them. This tests the case
2 ; where the mergedinto block doesn't have any PHI nodes, and is in fact
19 %W = phi i32 [0, %0], [1, %Q], [2, %P]
|
| EqualPHIEdgeBlockMerge.ll | 1 ; Test merging of blocks with phi nodes.
14 %W = phi i32 [ 2, %N ], [ 2, %Q ] ; <i32> [#uses=1]
|
| /external/llvm/test/CodeGen/X86/ |
| 2007-03-26-CoalescerBug.ll | 26 %t1025 = phi i64 [ 0, %bb268 ], [ %t102.0, %bb234 ]
27 %t1028 = phi i64 [ 0, %bb268 ], [ %t1066, %bb234 ]
28 %t1031 = phi i64 [ 0, %bb268 ], [ %t103.0, %bb234 ]
29 %t1034 = phi i64 [ 0, %bb268 ], [ %t1066, %bb234 ]
34 %t108.0 = phi i64 [ %t102.0, %bb85 ], [ %t1139, %bb248 ]
35 %t110.0 = phi i64 [ %t103.0, %bb85 ], [ %t1142, %bb248 ]
|
| 2010-02-23-SingleDefPhiJoin.ll | 4 ; This test case creates a phi join register with a single definition. The other
7 ; If LiveIntervalAnalysis fails to recognize this as a phi join, the coalescer
72 %ooffset.2.lcssa.phi.SV.phi203 = phi i32 [ 0, %meshBB122 ], [ %ooffset.2.lcssa.phi.SV.phi233, %meshBB ] ; <i32> [#uses=1]
94 ret i32 %ooffset.2.lcssa.phi.SV.phi250
100 %ooffset.2.lcssa.phi.SV.phi233 = phi i32 [ undef, %bb3 ], [ %ooffset.2.lcssa.phi.SV.phi209, %bb1.i.fragment ] ; <i32> [#uses=1]
107 %ooffset.2.lcssa.phi.SV.phi239 = phi i32 [ %ooffset.2.lcssa.phi.SV.phi209, %bb1.i.fragment ], [ %ooffset.2.lcssa.phi.SV (…)
[all...] |
| 2009-10-25-RewriterBug.ll | 45 %2 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=2]
46 %3 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=2]
47 %4 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=2]
48 %5 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=1]
49 %6 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=1]
50 %7 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=1]
51 %8 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=1]
52 %9 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=1]
53 %10 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses=1]
54 %11 = phi %struct.StorablePicture* [ null, %bb36.i ], [ undef, %bb30.i ] ; <%struct.StorablePicture*> [#uses (…)
[all...] |
| 2009-03-13-PHIElimBug.ll | 9 define i32 @phi() {
16 %x = phi i32 [ %b, %entry ] ; <i32> [#uses=0]
22 %xx = phi i32 [ %bb, %cont ] ; <i32> [#uses=1]
26 %y = phi i32 [ %a, %entry ], [ %aa, %cont ] ; <i32> [#uses=1]
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-06-12-BinomialInt64.ll | 9 %accum.03 = phi i64 [ %tmp14, %bb10 ], [ 0, %entry ] ; <i64> [#uses=1]
10 %i.02 = phi i32 [ %tmp16, %bb10 ], [ 0, %entry ] ; <i32> [#uses=1]
11 %d.1.01 = phi i64 [ %tmp5.i, %bb10 ], [ 0, %entry ] ; <i64> [#uses=1]
19 %accum.0.lcssa = phi i64 [ 0, %entry ], [ %tmp14, %bb10 ] ; <i64> [#uses=0]
29 %accum.03 = phi i64 [ %tmp12, %bb9 ], [ 0, %entry ] ; <i64> [#uses=1]
30 %i.02 = phi i32 [ %tmp14, %bb9 ], [ 0, %entry ] ; <i32> [#uses=1]
31 %d.1.01 = phi i64 [ %tmp4.i, %bb9 ], [ 0, %entry ] ; <i64> [#uses=1]
39 %accum.0.lcssa = phi i64 [ 0, %entry ], [ %tmp12, %bb9 ] ; <i64> [#uses=0]
|
| 2008-08-04-LongAddRec.ll | 31 %x2.0 = phi i16 [ 0, %entry ], [ %15, %bb ] ; <i16> [#uses=1]
32 %x3.0 = phi i16 [ 0, %entry ], [ %14, %bb ] ; <i16> [#uses=1]
33 %x4.0 = phi i16 [ 0, %entry ], [ %13, %bb ] ; <i16> [#uses=1]
34 %x5.0 = phi i16 [ 0, %entry ], [ %12, %bb ] ; <i16> [#uses=1]
35 %x6.0 = phi i16 [ 0, %entry ], [ %11, %bb ] ; <i16> [#uses=1]
36 %x7.0 = phi i16 [ 0, %entry ], [ %10, %bb ] ; <i16> [#uses=1]
37 %x8.0 = phi i16 [ 0, %entry ], [ %9, %bb ] ; <i16> [#uses=1]
38 %x9.0 = phi i16 [ 0, %entry ], [ %8, %bb ] ; <i16> [#uses=1]
39 %x10.0 = phi i16 [ 0, %entry ], [ %7, %bb ] ; <i16> [#uses=1]
40 %x11.0 = phi i16 [ 0, %entry ], [ %6, %bb ] ; <i16> [#uses=1
[all...] |
| 2008-07-12-UnneededSelect2.ll | 13 %z.02 = phi i32 [ %1, %bb1 ], [ 1, %bb.nph ] ; <i32> [#uses=1]
14 %i.01 = phi i32 [ %2, %bb1 ], [ 1, %bb.nph ] ; <i32> [#uses=2]
24 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1]
28 %z.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ 1, %entry ] ; <i32> [#uses=1]
|
| /external/llvm/test/Assembler/ |
| 2002-08-22-DominanceProblem.ll | 11 %B = phi i32 [ %B, %L2 ], [ %B, %Loop ] ;PHI has same value always.
|
| /external/llvm/test/Transforms/ADCE/ |
| 2002-05-22-PHITest.ll | 1 ; It is illegal to remove BB1 because it will mess up the PHI node!
13 %R = phi i32 [ %A, %0 ], [ %B, %BB1 ] ; <i32> [#uses=1]
|
| basictest.ll | 11 %ret = phi i32 [ %X, %BB4 ], [ %B, %BB2 ] ; <i32> [#uses=1]
15 %X = phi i32 [ %A, %BB1 ] ; <i32> [#uses=1]
|
| 2002-01-31-UseStuckAround.ll | 6 %retval = phi i32 [ %argc, %2 ] ; <i32> [#uses=2]
|
| /external/llvm/test/Transforms/ConstProp/ |
| phi.ll | 4 ; RUN: opt < %s -constprop -die -S | not grep phi
14 %Ret = phi i32 [ 1, %BB0 ], [ 1, %BB1 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/Inline/ |
| 2003-10-26-InlineInvokeExceptionDestPhi.ll | 1 ; The inliner is breaking inlining invoke instructions where there is a PHI
17 %A = phi i32 [ 0, %BB1 ], [ 0, %BB1 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/JumpThreading/ |
| branch-no-const.ll | 1 ; RUN: opt < %s -jump-threading -S | not grep phi
14 %x = phi i8 [%a, %bb1], [%b, %bb2]
|
| /external/llvm/test/Transforms/LICM/ |
| 2003-02-27-StoreSinkPHIs.ll | 1 ; LICM is adding stores before phi nodes. bad.
12 %X = phi i1 [ %c, %0 ], [ true, %Loop ] ; <i1> [#uses=1]
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 271 /// dominating definitions for non-PHI blocks.
281 // If this block already needs a PHI, there is nothing to do here.
289 // Need a PHI here.
304 /// FindAvailableVal - If this block requires a PHI, first check if an
305 /// existing PHI matches the PHI placement and reaching definitions computed
306 /// earlier, and if not, create a new PHI. Visit all the block's
308 /// the incoming values for a new PHI.
316 // Check if there needs to be a PHI in BB.
320 // Look for an existing PHI
[all...] |
| /dalvik/dx/tests/083-ssa-phi-placement/ |
| info.txt | 1 This is a test case for the phi placement algorthim used in the conversion to SSA form.
|
| /external/llvm/test/DebugInfo/ |
| 2009-10-16-Phi.ll | 9 %0 = phi i32 [ 0, %E ], [ 1, %B1 ], !dbg !0
|
| /external/llvm/test/ExecutionEngine/ |
| 2003-01-04-PhiTest.ll | 7 %X = phi i32 [ 0, %0 ], [ 1, %Loop ] ; <i32> [#uses=1]
|
| test-phi.ll | 3 ; test phi node
10 phi i32* [ %X, %0 ], [ @Y, %Dead ] ; <i32*>:1 [#uses=0]
20 %X = phi i32 [ 123, %0 ], [ 123, %0 ] ; <i32> [#uses=1]
28 %X = phi i32 [ 0, %0 ], [ %Y, %Dead ] ; <i32> [#uses=1]
|
