HomeSort by relevance Sort by last modified time
    Searched full:phi (Results 76 - 100 of 1352) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/llvm/test/CodeGen/X86/
2009-03-16-PHIElimInLPad.ll 6 define i32 @phi(i32 %x) {
19 %v = phi i32 [ %x, %entry ], [ %a, %cont ] ; <i32> [#uses=1]
  /external/llvm/test/ExecutionEngine/
2003-01-04-LoopTest.ll 12 %reg112 = phi i32 [ 10, %bb2 ], [ 1, %bb0 ] ; <i32> [#uses=1]
13 %cann-indvar = phi i32 [ %cann-indvar, %bb2 ], [ 0, %bb0 ] ; <i32> [#uses=1]
2003-06-04-bzip2-bug.ll 11 %h.0 = phi i32 [ %tmp.2, %loopentry.0 ], [ -1, %entry ] ; <i32> [#uses=1]
16 %h.1 = phi i32 [ %tmp.2, %loopentry.0 ] ; <i32> [#uses=1]
  /external/llvm/test/Other/
2002-02-24-InlineBrokePHINodes.ll 1 ; Inlining used to break PHI nodes. This tests that they are correctly updated
21 %X = phi i64 [ 1, %0 ], [ 2, %RecurseCase ] ; <i64> [#uses=1]
  /external/llvm/test/Transforms/GlobalOpt/
phi-select.ll 1 ; Test that PHI nodes and select instructions do not necessarily make stuff
23 %P = phi i32* [ @X, %0 ], [ @Y, %T ] ; <i32*> [#uses=1]
  /external/llvm/test/Transforms/IndVarSimplify/
2003-12-10-RemoveInstrCrash.ll 9 %j.0.pn = phi i32 [ %inc.3, %no_exit ], [ %inc.2, %entry ] ; <i32> [#uses=1]
10 %k.0.pn = phi i32 [ %inc.4, %no_exit ], [ 1, %entry ] ; <i32> [#uses=1]
2006-03-31-NegativeStride.ll 12 %a.0.0 = phi i32 [ 10, %entry ], [ %tmp4, %cond_true ] ; <i32> [#uses=2]
13 %b.0.0 = phi i32 [ 0, %entry ], [ %tmp2, %cond_true ] ; <i32> [#uses=1]
2008-06-15-SCEVExpanderBug.ll 10 %PL_savestack_ix.tmp.0 = phi i32 [ %tmp61, %entry ], [ %tmp127, %bb ] ; <i32> [#uses=2]
11 %indvar10 = phi i32 [ 0, %entry ], [ %indvar.next11, %bb ] ; <i32> [#uses=2]
loop_evaluate_1.ll 10 %indvar1 = phi i32 [ 0, %entry ], [ %indvar.next2, %loopentry ] ; <i32> [#uses=1]
11 %h.0 = phi i32 [ %tmp.2, %loopentry ], [ 4, %entry ] ; <i32> [#uses=1]
loop_evaluate_3.ll 9 %i.01.0 = phi i32 [ 0, %entry ], [ %tmp2, %bb5 ] ; <i32> [#uses=1]
10 %x.03.0 = phi i32 [ 0, %entry ], [ %tmp4, %bb5 ] ; <i32> [#uses=1]
loop_evaluate_4.ll 9 %v.01.0 = phi i32 [ 0, %entry ], [ %tmp4, %bb7 ] ; <i32> [#uses=1]
10 %i.03.0 = phi i32 [ 0, %entry ], [ %tmp6, %bb7 ] ; <i32> [#uses=2]
2008-10-03-CouldNotCompute.ll 16 %.in = phi i32 [ %2, %bb ], [ %n, %bb.nph ] ; <i32> [#uses=1]
17 %val.02 = phi i64 [ %5, %bb ], [ 0, %bb.nph ] ; <i64> [#uses=2]
18 %result.01 = phi i64 [ %4, %bb ], [ 0, %bb.nph ] ; <i64> [#uses=1]
27 %.lcssa = phi i64 [ %4, %bb ] ; <i64> [#uses=0]
2008-11-25-APFloatAssert.ll 8 %result.0.i89 = phi ppc_fp128 [ 0xM00000000000000000000000000000000, %entry ], [ %0, %bb23.i91 ] ; <ppc_fp128> [#uses=2]
  /external/llvm/test/Transforms/LCSSA/
unused-phis.ll 9 ; Test to ensure that when there are multiple exit blocks, PHI nodes are
20 %i = phi i32 [0, %entry], [1, %then2]
  /external/llvm/test/Transforms/LoopStrengthReduce/
pr2537.ll 9 %y.0 = phi i128 [ 0, %entry ], [ %add, %dobody ]
10 %x.0 = phi i128 [ 0, %entry ], [ %add2, %dobody ]
remove_indvar.ll 10 %i = phi i32 [ 0, %0 ], [ %i.next, %Loop ]
11 %INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=2]
  /external/llvm/test/Transforms/LoopUnroll/
2007-04-16-PhiUpdate.ll 9 %indvar = phi i8 [ 0, %entry ], [ %indvar.next, %cond_next ] ; <i8> [#uses=1]
14 %tmp282911.lcssa = phi i32 [ %tmp282911, %cond_next ] ; <i32> [#uses=0]
basic.ll 9 ; CHECK-NEXT: phi i32
17 %x.0 = phi i32 [ 0, %entry ], [ %inc, %l1 ]
  /external/llvm/test/Transforms/TailDup/
PHIUpdateTest.ll 1 ; This test checks to make sure phi nodes are updated properly
13 %V = phi i32 [ %A, %L ], [ 0, %F ] ; <i32> [#uses=1]
  /external/llvm/lib/CodeGen/
OptimizePHIs.cpp 15 #define DEBUG_TYPE "phi-opt"
26 STATISTIC(NumPHICycles, "Number of PHI cycles replaced");
27 STATISTIC(NumDeadPHICycles, "Number of dead PHI cycles");
68 // Find dead PHI cycles and PHI cycles that can be replaced by a single
79 /// IsSingleValuePHICycle - Check if MI is a PHI where all the source operands
87 assert(MI->isPHI() && "IsSingleValuePHICycle expects a PHI instruction");
98 // Scan the PHI operands.
118 // Fail if there is more than one non-phi/non-move register.
127 /// IsDeadPHICycle - Check if the register defined by a PHI is only used b
    [all...]
  /external/llvm/test/CodeGen/ARM/
2010-04-14-SplitVector.ll 14 %0 = phi i32 [ %tmp64, %bb9 ], [ undef, %bb ]
  /external/llvm/test/CodeGen/Generic/
2003-05-30-BadPreselectPhi.ll 7 ;; Error: PreSelection puts the arguments of the Phi just before
8 ;; the Phi instead of in predecessor blocks. This later
10 ;; for the phi arguments.
26 %mem_tmp.0 = phi i32* [ @v2, %cond_false ], [ @v1, %entry ] ; <i32*> [#uses=1]
  /external/llvm/test/CodeGen/MBlaze/
loop.ll 17 %outer.0 = phi i32 [ 0, %entry ], [ %outer.2, %loop_outer_finish ]
21 %inner.0 = phi i32 [ %a, %loop_outer ], [ %inner.3, %loop_inner_finish ]
22 %inner.1 = phi i32 [ %b, %loop_outer ], [ %inner.4, %loop_inner_finish ]
23 %inner.2 = phi i32 [ 0, %loop_outer ], [ %inner.5, %loop_inner_finish ]
  /external/llvm/test/CodeGen/MSP430/
indirectbr2.ll 15 %res.0 = phi i16 [ 385, %L5 ], [ 35, %entry ] ; <i16> [#uses=1]
19 %res.1 = phi i16 [ %res.0, %L4 ], [ 5, %entry ] ; <i16> [#uses=1]
23 %res.2 = phi i16 [ %res.1, %L3 ], [ 1, %entry ] ; <i16> [#uses=1]
27 %res.3 = phi i16 [ %res.2, %L2 ], [ 2, %entry ] ; <i16> [#uses=1]
  /external/llvm/test/Transforms/GVN/
rle-semidominated.ll 1 ; RUN: opt < %s -basicaa -gvn -S | grep {DEAD = phi i32 }

Completed in 242 milliseconds

1 2 34 5 6 7 8 91011>>