| /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]
|
| /external/llvm/test/ExecutionEngine/MCJIT/ |
| 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]
|
| /external/llvm/test/Transforms/ADCE/ |
| 2002-01-31-UseStuckAround.ll | 6 %retval = phi i32 [ %argc, %2 ] ; <i32> [#uses=2]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2012-10-19-congruent-constant.ll | 9 %phi1 = phi i1 [ false, %entry ], [ %cmpa, %for.body ]
10 %phi2 = phi i1 [ false, %entry ], [ %cmpb, %for.body ]
11 %i.07 = phi i32 [ 0, %entry ], [ %inc, %for.body ]
23 ; CHECK-NOT: phi i1
|
| iv-widen.ll | 7 ; Only one phi now.
8 ; CHECK: phi
9 ; CHECK-NOT: phi
20 %.02 = phi i32 [ 0, %Prologue ], [ %tmp33, %B24 ]
|
| pr18223.ll | 3 ; indvars should transform the phi node pair from the for-loop
5 ; CHECK: ret = phi i32 [ 0, %entry ], [ 0, {{.*}} ]
16 %inc2 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
28 %ret = phi i32 [ 0, %entry ], [ %conv, %for.inc ]
|
| /external/llvm/test/Transforms/LoopRotate/ |
| alloca.ll | 21 %n.phi = phi i16 [ %n, %loop.fin ], [ 0, %entry ]
23 %cond = icmp eq i16 %n.phi, %end
27 %n = add i16 %n.phi, 1
|
| /external/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| 2011-07-20-DoubleIV.ll | 9 ; CHECK-NOT: phi
17 %i.01 = phi i32 [ -39, %entry ], [ %inc, %loop ]
28 ; CHECK: phi double [ -3.900000e+01, %entry ]
35 %i.01 = phi i32 [ -39, %entry ], [ %inc, %loop ]
|
| /external/llvm/test/Transforms/LoopVectorize/ARM/ |
| arm-unroll.ll | 21 %i.02 = phi i32 [ %5, %.lr.ph ], [ 0, %0 ]
22 %sum.01 = phi i32 [ %4, %.lr.ph ], [ 0, %0 ]
31 %sum.0.lcssa = phi i32 [ 0, %0 ], [ %4, %.lr.ph ]
44 %i.02 = phi i32 [ %5, %.lr.ph ], [ 0, %0 ]
45 %sum.01 = phi i32 [ %4, %.lr.ph ], [ 0, %0 ]
46 %sum.02 = phi i32 [ %6, %.lr.ph ], [ 0, %0 ]
47 %sum.03 = phi i32 [ %7, %.lr.ph ], [ 0, %0 ]
48 %sum.04 = phi i32 [ %8, %.lr.ph ], [ 0, %0 ]
49 %sum.05 = phi i32 [ %9, %.lr.ph ], [ 0, %0 ]
50 %sum.06 = phi i32 [ %10, %.lr.ph ], [ 0, %0
[all...] |
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2008-12-06-SingleEntryPhi.ll | 6 %C = phi i1 [false, %entry]
|
| 2009-01-18-PHIPropCrash.ll | 13 %tmp3 = phi i1 [ true, %BB ], [ false, %BB1 ] ; <i1> [#uses=1]
17 %tmp10 = phi i32 [ 0, %BB2 ], [ %tmp12, %BB11 ] ; <i32> [#uses=1]
21 %tmp12 = phi i32 [ 0, %BB13 ], [ %tmp10, %BB9 ] ; <i32> [#uses=2]
25 %tmp14 = phi i32 [ 0, %BB9 ], [ %tmp14, %BB13 ] ; <i32> [#uses=1]
|
| PR16069.ll | 13 %cond.i = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb2 ]
14 ; CHECK: phi i32 {{.*}} srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb2
25 %cond = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb0 ]
26 ; CHECK: %cond = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb0 ]
|
| 2008-10-03-SpeculativelyExecuteBeforePHI.ll | 9 %__c2.2 = phi i32 [ undef, %entry ], [ %__c2.1, %bb7 ], [ %__c2.1, %bb9 ] ; <i32> [#uses=2]
10 %s.0 = phi i32 [ 0, %entry ], [ 0, %bb7 ], [ %2, %bb9 ] ; <i32> [#uses=1]
25 %__c2.0 = phi i32 [ 0, %bb3 ], [ %__c2.2, %bb1 ] ; <i32> [#uses=1]
29 %__c2.1 = phi i32 [ 0, %bb5 ], [ %__c2.0, %bb6 ] ; <i32> [#uses=2]
30 %iftmp.1.0 = phi i1 [ false, %bb5 ], [ true, %bb6 ] ; <i1> [#uses=1]
|
| 2008-05-16-PHIBlockMerge.ll | 16 ; This phi has a conflicting value (0) with below phi (2), so blocks
18 %a = phi i32 [ 1, %entry ], [ 0, %Common ] ; <i32> [#uses=1]
22 %b = phi i32 [ %a, %BB.nomerge ], [ 2, %Common ] ; <i32> [#uses=0]
43 ; This phi has confliction values for Common and (through BB) Common,
45 %b = phi i32 [ 1, %BB.nomerge ], [ 2, %Common ] ; <i32> [#uses=0]
66 ; This phi has identical values for Common and (through BB) Common,
68 %b = phi i32 [ 1, %BB.tomerge ], [ 1, %Common ], [ 2, %Pre-Exit ]
77 ; This adds a backedge, so the %b phi node gets a third branch and is
92 ; This phi has a matching value (0) with below phi (0), so block
[all...] |
| /external/llvm/test/Verifier/ |
| SelfReferential.ll | 2 ; CHECK: Only PHI nodes may reference their own value
|
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 75 bool isElse(PHINode *Phi);
77 void eraseIfUnused(PHINode *Phi);
166 /// \brief Can the condition represented by this PHI node treated like
168 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
169 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
170 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
171 if (Phi->getIncomingBlock(i) == IDom) {
173 if (Phi->getIncomingValue(i) != BoolTrue)
177 if (Phi->getIncomingValue(i) != BoolFalse)
185 // \brief Erase "Phi" if it is not used any mor
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| 2008-02-27-PEICrash.ll | 11 %tmp36.pn = phi float [ 0.000000e+00, %bb33 ], [ 0.000000e+00, %entry ] ; <float> [#uses=1]
12 %b.pn509 = phi float [ %b, %bb33 ], [ %a, %entry ] ; <float> [#uses=1]
13 %a.pn = phi float [ %a, %bb33 ], [ %b, %entry ] ; <float> [#uses=1]
14 %tmp41.pn508 = phi float [ 0.000000e+00, %bb33 ], [ 0.000000e+00, %entry ] ; <float> [#uses=1]
15 %tmp51.pn = phi float [ 0.000000e+00, %bb33 ], [ %a, %entry ] ; <float> [#uses=1]
29 %x.1 = phi float [ %tmp102, %bb98 ], [ %x.0, %bb56 ] ; <float> [#uses=0]
30 %y.1 = phi float [ %tmp106, %bb98 ], [ %y.0, %bb56 ] ; <float> [#uses=1]
|
| /external/llvm/test/Transforms/SCCP/ |
| sccptest.ll | 14 %Ret = phi i32 [ %Val, %BB1 ], [ 1, %BB2 ] ; <i32> [#uses=1]
18 ; CHECK: %Ret = phi i32 [ 0, %BB1 ], [ 1, %BB2 ]
29 %j2 = phi i32 [ %j4, %BB7 ], [ 1, %BB1 ]
30 %k2 = phi i32 [ %k4, %BB7 ], [ 0, %BB1 ]
51 %j4 = phi i32 [ 1, %BB5 ], [ %k2, %BB6 ]
52 %k4 = phi i32 [ %k3, %BB5 ], [ %k5, %BB6 ]
55 ; CHECK-NEXT: %k4 = phi i32 [ %k3, %BB5 ], [ undef, %BB6 ]
|
| /external/llvm/test/Analysis/BasicAA/ |
| must-and-partial.ll | 9 ; CHECK: PartialAlias: i16* %bigbase0, i8* %phi
17 %phi = phi i8* [ %baseplusone, %red ], [ %base, %entry ]
18 store i8 0, i8* %phi
23 %loaded = load i8* %phi
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| dont_insert_redundant_ops.ll | 4 ; CHECK: phi
5 ; CHECK: phi
6 ; CHECK-NOT: phi
14 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
30 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=3]
|
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 51 /// updates. ProtoValue is the value used to name PHI nodes.
110 /// InsertNewDef - Insert an empty PHI or IMPLICIT_DEF instruction which define
139 /// a block. Because of this, we need to insert a new PHI node in SomeBB to
181 // If an identical PHI is already in BB, just reuse it.
186 // Otherwise, we do need a PHI: insert one now.
188 MachineInstrBuilder InsertedPHI = InsertNewDef(TargetOpcode::PHI, BB,
191 // Fill in all the predecessors of the PHI.
195 // See if the PHI node can be merged to a single value. This can happen in
196 // loop cases when we get a PHI of itself and one other value.
205 DEBUG(dbgs() << " Inserted PHI: " << *InsertedPHI << "\n")
[all...] |
| /external/llvm/test/Transforms/LoopIdiom/X86/ |
| popcnt.ll | 22 %c.05 = phi i32 [ %inc, %while.body ], [ 0, %entry ]
23 %a.addr.04 = phi i64 [ %and, %while.body ], [ %a, %entry ]
31 %c.0.lcssa = phi i32 [ 0, %entry ], [ %inc, %while.body ]
55 %c.013 = phi i32 [ %inc, %while.body ], [ 0, %entry ]
56 %mydata2.addr.012 = phi i32 [ %mul1, %while.body ], [ %mydata2, %entry ]
57 %mydata1.addr.011 = phi i32 [ %mul, %while.body ], [ %mydata1, %entry ]
58 %a.addr.010 = phi i64 [ %and, %while.body ], [ %a, %entry ]
69 %c.0.lcssa = phi i32 [ 0, %entry ], [ %inc, %while.body ]
70 %mydata2.addr.0.lcssa = phi i32 [ %mydata2, %entry ], [ %mul1, %while.body ]
71 %mydata1.addr.0.lcssa = phi i32 [ %mydata1, %entry ], [ %mul, %while.body
[all...] |
