/external/llvm/test/Transforms/IndVarSimplify/ |
2003-04-16-ExprAnalysis.ll | 13 %IV = phi i32 [ %A, %0 ], [ %IVNext, %Loop ] ; <i32> [#uses=1]
|
2009-04-27-Floating.ll | 10 %i = phi float [ %nexti, %loop_body ], [ 0.0, %entry ]
|
2011-11-15-multiexit.ll | 13 ; CHECK: phi i32* [ %first.lcssa, %early.exit ] 22 %firstIV = phi i32* [ %incdec.ptr2, %if.else ], [ %first, %if.then ] 33 %first.lcssa = phi i32* [ %firstIV, %do.body ] 37 %tmp = phi i32* [ %first.lcssa, %early.exit ], [ %first, %if.then ], [ %first, %entry ], [ undef, %if.else ]
|
eliminate-max.ll | 17 %t = phi i32 [ 0, %bb ], [ %t19, %bb14 ] ; <i32> [#uses=5] 18 %t2 = phi i32 [ 0, %bb ], [ %t18, %bb14 ] ; <i32> [#uses=1] 28 %t8 = phi i32 [ %t6, %bb4 ], [ 0, %bb1 ] ; <i32> [#uses=1] 39 %t15 = phi i32 [ %t13, %bb11 ], [ 0, %bb7 ] ; <i32> [#uses=1]
|
polynomial-expand.ll | 12 %tmp25 = phi i32 [ %tmp43, %bb40 ], [ %tmp21, %bb20 ] ; <i32> [#uses=4] 13 %tmp26 = phi i32 [ %tmp41, %bb40 ], [ undef, %bb20 ] ; <i32> [#uses=2] 20 %tmp31 = phi i32 [ %tmp39, %bb30 ], [ %tmp28, %bb24 ] ; <i32> [#uses=2] 21 %tmp32 = phi i32 [ %tmp37, %bb30 ], [ %tmp27, %bb24 ] ; <i32> [#uses=2]
|
shrunk-constant.ll | 9 %i = phi i32 [ 0, %entry ], [ %t2, %loop ]
|
/external/llvm/test/Transforms/Inline/ |
2003-09-22-PHINodesInNormalInvokeDest.ll | 9 %i.2 = phi i32 [ 36, %entry ], [ %i.2, %LJDecisionBB ] ; <i32> [#uses=1]
|
/external/llvm/test/Transforms/InstCombine/ |
2010-01-28-NegativeSRem.ll | 10 %x = phi i32 [ -29, %entry ], [ 0, %BB1 ] ; <i32> [#uses=2]
|
hoist_instr.ll | 14 %X = phi i32 [ %A, %then ], [ 15, %entry ] ; <i32> [#uses=1]
|
sink_instruction.ll | 23 ;; PHI use, sink divide before call. 31 %x_addr.17 = phi i32 [ %x, %entry ], [ %x_addr.0, %bb2 ] ; <i32> [#uses=4] 32 %i.06 = phi i32 [ 0, %entry ], [ %4, %bb2 ] ; <i32> [#uses=1] 47 %x_addr.0 = phi i32 [ %1, %bb1 ], [ %x_addr.17, %bb ] ; <i32> [#uses=2]
|
/external/llvm/test/Transforms/InstSimplify/ |
phi.ll | 17 %cc = phi i32 [ %bb, %b ], [%aa, %a ]
|
/external/llvm/test/Transforms/LICM/ |
2003-12-11-SinkingToPHI.ll | 12 %V = phi i32 [ 2, %Loop ], [ %X, %LoopCont ] ; <i32> [#uses=1]
|
2011-04-09-RAUW-AST.ll | 17 %g.0 = phi i32* [ %g.0, %for.inc10 ], [ @g_3, %entry ], [ null, %if.then ] 18 %x.0 = phi i32 [ %inc12, %for.inc10 ], [ 0, %entry ], [ 0, %if.then ] 23 %y.0 = phi i32 [ %inc, %for.body7 ], [ 0, %for.cond ] 28 ; CHECK-NEXT: phi
|
basictest.ll | 7 %j = phi i32 [ 0, %0 ], [ %Next, %Loop ] ; <i32> [#uses=1]
|
/external/llvm/test/Transforms/LoopSimplify/ |
hardertest.ll | 10 %Val = phi i32 [ 0, %T ], [ 1, %F ], [ 2, %Loop ], [ 3, %L2 ] ; <i32> [#uses=0]
|
phi-node-simplify.ll | 1 ; Loop Simplify should turn phi nodes like X = phi [X, Y] into just Y, eliminating them. 2 ; RUN: opt < %s -loop-simplify -S | grep phi | count 6 14 %indvar20 = phi i32 [ 0, %entry ], [ %indvar.next21, %loopexit.1 ] ; <i32> [#uses=1] 15 %a.1 = phi i32* [ getelementptr ([3000000 x i32]* @A, i32 0, i32 0), %entry ], [ %inc.0, %loopexit.1 ] ; <i32*> [#uses=1] 18 %a.0.4.ph = phi i32* [ %a.1, %loopentry.1 ], [ %inc.0, %loopexit.2 ], [ %a.0.4.ph, %no_exit.2 ] ; <i32*> [#uses=3] 19 %b.1.4.ph = phi i32* [ getelementptr ([20000 x i32]* @B, i32 0, i32 0), %loopentry.1 ], [ %inc.1, %loopexit.2 ], [ %b.1.4.ph, %no_exit.2 ] ; <i32*> [#uses=3] 20 %indvar17 = phi i32 [ 0, %loopentry.1 ], [ %indvar.next18, %loopexit.2 ], [ %indvar17, %no_exit.2 ] ; <i32> [#uses=2] 21 %indvar = phi i32 [ %indvar.next, %no_exit.2 ], [ 0, %loopexit.2 ], [ 0, %loopentry.1 ] ; <i32> [#uses=5]
|
/external/llvm/test/Transforms/LoopStrengthReduce/ |
pr12048.ll | 10 %indvars.iv194 = phi i8* [ null, %while.cond40.preheader ], [ %scevgep, %while.body51 ] 11 %tmp.1 = phi i8* [ undef, %while.cond40.preheader ], [ %incdec.ptr, %while.body51 ] 25 %tmp.4 = phi i8* [ %incdec.ptr88.tmp.2, %if.then64 ], [ undef, %if.then59 ] 36 %start_of_var.0177 = phi i8* [ %tmp.1, %while.body139.lr.ph ], [ null, %while.body139 ]
|
/external/llvm/test/Transforms/LoopUnroll/ |
2004-05-13-DontUnrollTooMuch.ll | 7 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %no_exit ] ; <i32> [#uses=1]
|
2007-05-09-UnknownTripCount.ll | 8 %indvar1.ph = phi i32 [ 0, %entry ], [ %indvar.next2, %bb72 ]
|
scevunroll.ll | 11 ; CHECK-NOT: phi 19 %iv = phi i64 [ 10, %entry ], [ %iv.next, %while.body ] 20 %sum = phi i32 [ 0, %entry ], [ %sum.next, %while.body ] 47 %iv = phi i64 [ 0, %entry ], [ %inc, %tail ] 48 %s = phi i64 [ 0, %entry ], [ %s.next, %tail ] 83 %iv1 = phi i32 [ 0, %entry ], [ %inc1, %l2 ] 84 %iv2 = phi i32 [ 0, %entry ], [ %inc2, %l2 ] 114 %iv1 = phi i32 [ 0, %entry ], [ %inc1, %l3 ] 115 %iv2 = phi i32 [ 0, %entry ], [ %inc2, %l3 ] 154 %i.113 = phi i32 [ %inc76, %for.inc74 ], [ 0, %for.body38.preheader [all...] |
/external/llvm/test/Transforms/LoopUnroll/PowerPC/ |
a2-unrolling.ll | 7 %iv = phi i32 [ 0, %entry ], [ %inc, %loop ] 28 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ] 29 %sum.02 = phi i32 [ %add, %for.body ], [ 0, %entry ] 39 %sum.0.lcssa = phi i32 [ 0, %entry ], [ %add, %for.body ]
|
/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/LoopVectorize/ |
multi-use-reduction-bug.ll | 26 %inc107 = phi i32 [ undef, %entry ], [ %inc10, %for.body ] 27 %inc6 = phi i32 [ %nf.promoted, %entry ], [ undef, %for.body ] 28 %add55 = phi i32 [ %n.promoted, %entry ], [ %add5, %for.body ] 39 %add5.lcssa = phi i32 [ %add5, %for.body ]
|
/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
|