| /external/llvm/test/Transforms/LoopUnswitch/ |
| 2006-06-13-SingleEntryPHI.ll | 16 %Local_Turb.0.ph24.lcssa = phi %struct.TURB* [ %Local_Turb.0.ph24, %cond_true1099 ] ; <%struct.TURB*> [#uses=1]
19 %Local_Turb.0.ph22 = phi %struct.TURB* [ undef, %entry ], [ %Local_Turb.0.ph24.lcssa, %bb1096.outer20.loopexit ] ; <%struct.TURB*> [#uses=1]
23 %Local_Turb.0.ph24 = phi %struct.TURB* [ %Local_Turb.0.ph22, %bb1096.outer20 ], [ null, %bb671 ] ; <%struct.TURB*> [#uses=2]
33 %Local_Turb.0.ph24.lcssa1 = phi %struct.TURB* [ %Local_Turb.0.ph24, %bb1096 ] ; <%struct.TURB*> [#uses=0]
|
| /external/llvm/test/Transforms/LowerInvoke/ |
| 2004-02-29-PHICrash.ll | 10 %UnifiedRetVal = phi i32* [ null, %entry ], [ null, %then ], [ null, %then ] ; <i32*> [#uses=0]
|
| 2005-08-03-InvokeWithPHI.ll | 12 %w_2690 = phi { i32, i32 }* [ null, %block0 ] ; <{ i32, i32 }*> [#uses=1]
|
| 2005-08-03-InvokeWithPHIUse.ll | 12 %i_2689 = phi i32 [ %v2679, %block0 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/Mem2Reg/ |
| 2003-04-24-MultipleIdenticalSuccessors.ll | 1 ; Mem2reg used to only add one incoming value to a PHI node, even if it had
|
| UndefValuesMerge.ll | 1 ; RUN: opt < %s -mem2reg -S | not grep phi
|
| /external/llvm/test/Transforms/ObjCARC/ |
| contract-testcases.ll | 41 %tmp7 = phi %4* [ undef, %bb5 ], [ undef, %bb4 ], [ undef, %bb3 ], [ undef, %bb4 ]
45 ; When rewriting operands for a phi which has multiple operands
52 ; CHECK: %tmp8 = phi %0* [ %0, %bb ], [ %0, %bb ]
61 %tmp8 = phi %0* [ %tmp, %bb ], [ %tmp, %bb ]
|
| /external/llvm/test/Transforms/SCCP/ |
| 2003-06-24-OverdefinedPHIValue.ll | 10 %j.0 = phi i32 [ %j.0, %endif ], [ %i.0, %then ], [ 1, %entry ] ; <i32> [#uses=3]
11 %i.0 = phi i32 [ %inc, %endif ], [ %inc1, %then ], [ 1, %entry ] ; <i32> [#uses=4]
23 %j.1 = phi i32 [ 1, %entry ], [ %j.0, %endif ], [ %i.0, %then ] ; <i32> [#uses=1]
24 %i.1 = phi i32 [ 1, %entry ], [ %inc, %endif ], [ %inc1, %then ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2002-05-21-PHIElimination.ll | 13 %V = phi i32 [ 0, %0 ], [ %V1, %Loop ] ; <i32> [#uses=1]
|
| 2002-09-24-PHIAssertion.ll | 8 %Q = phi i32 [ %C, %J ], [ %C, %J ] ; <i32> [#uses=1]
|
| 2003-03-07-DominateProblem.ll | 9 %reg330 = phi i32* [ null, %bb10 ], [ %ldo, %bb9 ] ; <i32*> [#uses=1]
|
| 2008-09-17-SpeculativeHoist.ll | 14 %andandtmp.0 = phi i1 [ %tmp, %start ], [ %tmpnew, %brtrue ] ; <i1> [#uses=0]
|
| PR9946.ll | 16 %storemerge = phi i32 [ 1, %if.end ], [ 0, %if.then ]
|
| two-entry-phi-return.ll | 13 %result = phi i1 [ 0, %entry ], [ %tmp15, %bb ]
|
| /external/llvm/test/Transforms/TailDup/ |
| 2003-06-24-Simpleloop.ll | 7 %i.1 = phi i32 [ %inc, %no_exit ], [ 0, %entry ] ; <i32> [#uses=1]
|
| /external/llvm/test/Verifier/ |
| 2009-05-29-InvokeResult3.ll | 14 %p = phi i32 [ %s, %c ], [ %s, %u ] ; <i32> [#uses=1]
|
| /external/llvm/lib/Transforms/Utils/ |
| LCSSA.cpp | 10 // This pass transforms loops by placing phi nodes at the end of the loops for
19 // X3 = phi(X1, X2) X3 = phi(X1, X2)
20 // ... = X3 + 4 X4 = phi(X3)
23 // This is still valid LLVM; the extra phi nodes are purely redundant, and will
176 /// has any uses that are outside the current loop. If so, insert LCSSA PHI
215 // Insert the LCSSA phi's into all of the exit blocks dominated by the
216 // value, and add them to the Phi's map.
230 // Add inputs from inside the loop for this PHI.
236 // rewritten in terms of a different LCSSA PHI
[all...] |
| DemoteRegToStack.cpp | 55 // If this is a PHI node, we can't insert a load of the value before the
59 // Note that if there are multiple edges from a basic block to this PHI
61 // PHI node will have multiple values (from each load) coming in from the
101 /* empty */; // Don't insert before any PHI nodes.
108 /// DemotePHIToStack - This function takes a virtual register computed by a phi
110 /// The phi node is deleted and it returns the pointer to the alloca inserted.
138 // Insert load in place of the phi and replace all uses.
142 // Delete phi.
|
| /external/llvm/test/CodeGen/X86/ |
| 2007-03-01-SpillerCrash.ll | 42 phi i32 [ 5, %18 ], [ 3, %13 ], [ 1, %test.exit ], [ 2, %12 ], [ 4, %17 ] ; <i32>:20 [#uses=0]
43 phi float [ 0.000000e+00, %18 ], [ %16, %13 ], [ 0.000000e+00, %test.exit ], [ 0.000000e+00, %12 ], [ 0.000000e+00, %17 ] ; <float>:21 [#uses=1]
44 phi float [ 0.000000e+00, %18 ], [ %tmp155, %13 ], [ 0.000000e+00, %test.exit ], [ 0.000000e+00, %12 ], [ 0.000000e+00, %17 ] ; <float>:22 [#uses=1]
45 phi float [ 0.000000e+00, %18 ], [ %15, %13 ], [ 0.000000e+00, %test.exit ], [ 0.000000e+00, %12 ], [ 0.000000e+00, %17 ] ; <float>:23 [#uses=1]
46 phi float [ 0.000000e+00, %18 ], [ %tmp207, %13 ], [ 0.000000e+00, %test.exit ], [ 0.000000e+00, %12 ], [ 0.000000e+00, %17 ] ; <float>:24 [#uses=1]
47 phi float [ 0.000000e+00, %18 ], [ %10, %13 ], [ %9, %test.exit ], [ %10, %12 ], [ 0.000000e+00, %17 ] ; <float>:25 [#uses=2]
48 phi float [ 0.000000e+00, %18 ], [ %14, %13 ], [ 0.000000e+00, %test.exit ], [ 0.000000e+00, %12 ], [ 0.000000e+00, %17 ] ; <float>:26 [#uses=1]
49 phi float [ 0.000000e+00, %18 ], [ 0.000000e+00, %13 ], [ 0.000000e+00, %test.exit ], [ 0.000000e+00, %12 ], [ 0.000000e+00, %17 ] ; <float>:27 [#uses=1]
81 phi float [ 0.000000e+00, %44 ], [ %47, %46 ], [ 0.000000e+00, %19 ] ; <float>:48 [#uses=0]
82 phi float [ %43, %44 ], [ %43, %46 ], [ 0.000000e+00, %19 ] ; <float>:49 [#uses=0
[all...] |
| /external/llvm/test/Transforms/IndVarSimplify/ |
| tripcount_compute.ll | 16 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
33 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
50 %i = phi i32 [ 1024, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
67 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
84 %i = phi i32 [ 7, %entry ], [ %i.next, %loop ] ; <i32> [#uses=4]
102 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
111 %j = phi i32 [ %i, %loopexit ], [ %j.next, %loop2 ] ; <i32> [#uses=3]
128 %i = phi i32 [ 0, %entry ], [ %i.next, %loop ] ; <i32> [#uses=3]
137 %j = phi i32 [ %i.next, %loopexit ], [ %j.next, %loop2 ] ; <i32> [#uses=3]
146 %k = phi i32 [ %j.next, %loopexit2 ], [ %k.next, %loop8 ] ; <i32> [#uses=3
[all...] |
| /dalvik/vm/compiler/ |
| SSATransformation.cpp | 150 * TODO - evaluate whether phi will ever need to be inserted into exit
381 * The calculated result is used for phi-node pruning - where we only need to
382 * insert a phi node if the variable is live-in to the block.
420 /* Insert phi nodes to for each variable to the dominance frontiers */
447 /* Calculate the phi blocks for each Dalvik register */
477 * Insert a phi node for dalvikReg in the phiBlocks if the Dalvik
486 /* Variable will be clobbered before being used - no need for phi */
488 MIR *phi = (MIR *) dvmCompilerNew(sizeof(MIR), true); local
489 phi->dalvikInsn.opcode = (Opcode)kMirOpPhi;
490 phi->dalvikInsn.vA = dalvikReg
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2007-08-06-Unsigned.ll | 13 %x_addr.0 = phi i32 [ %tmp2, %bb3 ], [ %x, %bb.preheader ] ; <i32> [#uses=1]
25 %x_addr.1 = phi i32 [ %x, %entry ], [ %tmp2, %bb8.loopexit ] ; <i32> [#uses=1]
|
| 2008-07-29-SGTTripCount.ll | 14 %i.01 = phi i32 [ %1, %bb ], [ 0, %bb.preheader ] ; <i32> [#uses=1]
23 %i.0.lcssa = phi i32 [ 0, %entry ], [ %1, %return.loopexit ] ; <i32> [#uses=1]
|
| 2008-07-29-SMinExpr.ll | 13 %j.01 = phi i32 [ %dec, %forinc ], [ -2147483632, %entry ]
21 %j.0.lcssa = phi i32 [ -2147483632, %entry ], [ %dec, %forinc ]
|
| 2008-12-11-SMaxOverflow.ll | 14 %k.019 = phi i32 [ %k.0, %bb18 ], [ %k.018, %bb2 ] ; <i32> [#uses=5]
15 %x = phi i32 [ 0, %bb2 ], [ %x.1, %bb18]
|
