| /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]
|
| 2014-05-29-factorial.ll | 10 %result.06 = phi i64 [ %mul, %while.body ], [ 1, %entry ]
11 %x.addr.05 = phi i64 [ %dec, %while.body ], [ %x, %entry ]
18 %mul.lcssa = phi i64 [ %mul, %while.body ]
22 %result.0.lcssa = phi i64 [ %mul.lcssa, %while.end.loopexit ]
|
| /external/clang/test/CodeGenObjC/ |
| complex-double-abi.m | 12 // CHECK: [[R:%.*]] = phi double [ [[R1:%.*]], [[MSGCALL:%.*]] ], [ 0.000000e+00, [[NULLINIT:%.*]] ]
13 // CHECK-NEXT: [[I:%.*]] = phi double [ [[I1:%.*]], [[MSGCALL]] ], [ 0.000000e+00, [[NULLINIT]] ]
|
| /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...] |
| /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/CodeGen/Hexagon/ |
| hwloop-cleanup.ll | 20 %sum.03 = phi i32 [ %add, %for.body ], [ 0, %for.body.preheader ]
21 %arrayidx.phi = phi i32* [ %arrayidx.inc, %for.body ], [ %b, %for.body.preheader ]
22 %i.02 = phi i32 [ %inc, %for.body ], [ 0, %for.body.preheader ]
23 %0 = load i32* %arrayidx.phi, align 4
27 %arrayidx.inc = getelementptr i32* %arrayidx.phi, i32 1
34 %sum.0.lcssa = phi i32 [ 0, %entry ], [ %add, %for.end.loopexit ]
50 %sum.02 = phi i32 [ 0, %entry ], [ %add, %for.body ]
51 %arrayidx.phi = phi i32* [ %b, %entry ], [ %arrayidx.inc, %for.body
[all...] |
| /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]
|
| /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/IndVarSimplify/ |
| 2011-09-19-vectoriv.ll | 3 ; CHECK-NOT: phi
12 %storemerge35 = phi <4 x i32> [ %storemerge, %for_loop398 ], [ undef, %allocas ]
|
| /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/test/Transforms/LoopStrengthReduce/ |
| 2011-10-03-CritEdgeMerge.ll | 3 ; Test LSR's use of SplitCriticalEdge during phi rewriting.
10 ; CHECK: phi i8* [ %lsr.iv.next1, %bbA.bb89_crit_edge ], [ %lsr.iv.next1, %bbB.bb89_crit_edge ]{{$}}
17 %rec = phi i32 [ %next, %loop ], [ 0, %entry ]
38 %tmp75phi = phi i8* [ %tmp75, %bbA ], [ %tmp75, %bbA ], [ %tmp75, %bbA ], [ %tmp75, %bbB ], [ %tmp75, %bbB ], [ %tmp75, %bbB ]
48 ; CHECK: phi i8* [ %lsr.iv.next1, %bbA ], [ %lsr.iv.next1, %bbA ], [ %lsr.iv.next1, %bbA ]{{$}}
54 %rec = phi i32 [ %next, %loop ], [ 0, %entry ]
75 %tmp75phi = phi i8* [ %tmp75, %bbA ], [ %tmp75, %bbA ], [ %tmp75, %bbA ]
79 %result = phi i8* [ %tmp75phi, %bb89 ], [ %tmp75, %bbB ], [ %tmp75, %bbB ], [ %tmp75, %bbB ]
|
| 2011-10-06-ReusePhi.ll | 3 ; Test LSR's intelligence regarding phi reuse.
15 ; CHECK: phi
16 ; CHECK: phi
17 ; CHECK: phi
18 ; CHECK: phi
19 ; CHECK-NOT: phi
36 %A.addr.05 = phi float* [ %A, %while.body.lr.ph ], [ %add.ptr, %while.body ]
37 %B.addr.04 = phi float* [ %B, %while.body.lr.ph ], [ %add.ptr3, %while.body ]
38 %N.addr.03 = phi i32 [ %N, %while.body.lr.ph ], [ %sub, %while.body ]
39 %Sum0.02 = phi float [ 0.000000e+00, %while.body.lr.ph ], [ %add, %while.body
[all...] |
| /external/llvm/test/Transforms/SCCP/ |
| 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/ |
| PHINode.ll | 1 ; -simplifycfg is not folding blocks if there is a PHI node involved. This
11 %X = phi i32 [ 7, %0 ] ; <i32> [#uses=1]
|
| /external/chromium_org/v8/src/ |
| hydrogen-representation-changes.cc | 12 // Insert the representation change right before its use. For phi-uses we
118 HPhi* phi = phi_list->at(i); local
119 if (phi->representation().IsInteger32()) {
120 phi->SetFlag(HValue::kTruncatingToInt32);
121 } else if (phi->representation().IsSmi()) {
122 phi->SetFlag(HValue::kTruncatingToSmi);
123 phi->SetFlag(HValue::kTruncatingToInt32);
128 HPhi* phi = phi_list->at(i); local
130 if (phi->representation().IsSmiOrInteger32() &&
131 !phi->CheckUsesForFlag(HValue::kTruncatingToInt32, &value))
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| phi.ll | 12 ; Combine away one argument PHI nodes
13 %B = phi i32 [ %A, %BB0 ]
31 ; Combine away PHI nodes with same values
32 %B = phi i32 [ %A, %BB0 ], [ %A, %BB1 ]
44 ; PHI has same value always.
45 %B = phi i32 [ %A, %BB0 ], [ %B, %Loop ]
61 ; PHI has same value always.
62 %B = phi i32 [ %B, %L2 ], [ %B, %Loop ]
77 ; PHI has same value always.
78 %B = phi i32 [ %A, %BB0 ], [ undef, %Loop ]
[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/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 56 if (Phi* Ph = dyn_cast<Phi>(V->definition())) {
67 if (Phi* Ph = dyn_cast<Phi>(V->definition())) {
93 // Phi nodes to find the canonical definition.
111 if (Phi *Ph = dyn_cast<Phi>(D)) {
112 if (Ph->status() == Phi::PH_Incomplete)
115 if (Ph->status() == Phi::PH_SingleVal) {
126 // Trace the arguments of an incomplete Phi node to see if they have the sam
[all...] |
| /external/clang/test/CodeGen/ |
| branch-on-bool.c | 8 // CHECK-NOT: = phi
|
