HomeSort by relevance Sort by last modified time
    Searched full:preheader (Results 26 - 50 of 289) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/llvm/test/Transforms/IndVarSimplify/
2011-11-01-lftrptr.ll 20 br i1 %guard, label %preheader, label %exit
22 preheader:
26 %p.01.us.us = phi i8* [ null, %preheader ], [ %gep, %loop ]
27 %s = phi i8 [0, %preheader], [%snext, %loop]
45 br i1 %guard, label %preheader, label %exit
47 preheader:
51 %p.01.us.us = phi i8* [ %buf, %preheader ], [ %gep, %loop ]
52 %s = phi i8 [0, %preheader], [%snext, %loop]
73 br i1 %guard, label %preheader, label %exit
75 preheader
    [all...]
2003-12-15-Crash.ll 11 br i1 undef, label %no_exit.15.preheader, label %loopexit.15
13 no_exit.15.preheader: ; preds = %loopexit.14
16 no_exit.15: ; preds = %no_exit.15, %no_exit.15.preheader
17 %highC.0 = phi i32 [ %tmp.738, %no_exit.15.preheader ], [ %dec.0, %no_exit.15 ] ; <i32> [#uses=1]
indirectbr.ll 26 bb7.preheader: ; preds = %entry
29 bb14: ; preds = %bb14, %bb7.preheader
32 bb16: ; preds = %bb16, %bb14, %bb7.preheader
33 %S.31.0 = phi i64 [ %3, %bb16 ], [ 1, %bb7.preheader ], [ 1, %bb14 ] ; <i64> [#uses=2]
masked-iv.ll 11 br i1 %t0, label %bb.preheader, label %return
13 bb.preheader: ; preds = %entry
16 bb: ; preds = %bb, %bb.preheader
17 %i.01 = phi i64 [ %t6, %bb ], [ %a, %bb.preheader ] ; <i64> [#uses=3]
2009-05-24-useafterfree.ll 7 br i1 false, label %bb.nph1.preheader, label %.outer._crit_edge
9 bb.nph1.preheader: ; preds = %4
14 bb.nph1: ; preds = %.outer, %bb.nph1.preheader
15 br i1 undef, label %bb.nph3.preheader, label %.outer
17 bb.nph3.preheader: ; preds = %bb.nph1
20 bb.nph3: ; preds = %bb.nph3, %bb.nph3.preheader
21 %indvar7 = phi i32 [ %indvar.next8, %bb.nph3 ], [ 0, %bb.nph3.preheader ] ; <i32> [#uses=3]
  /external/llvm/test/Analysis/ScalarEvolution/
2007-08-06-Unsigned.ll 7 br i1 %tmp63, label %bb.preheader, label %bb8
9 bb.preheader: ; preds = %entry
12 bb: ; preds = %bb3, %bb.preheader
13 %x_addr.0 = phi i32 [ %tmp2, %bb3 ], [ %x, %bb.preheader ] ; <i32> [#uses=1]
2008-07-29-SGTTripCount.ll 8 br i1 %0, label %bb.preheader, label %return
10 bb.preheader: ; preds = %entry
13 bb: ; preds = %bb, %bb.preheader
14 %i.01 = phi i32 [ %1, %bb ], [ 0, %bb.preheader ] ; <i32> [#uses=1]
2008-12-11-SMaxOverflow.ll 4 ; CHECK: Loop %bb16.preheader: backedge-taken count is (-1 + %c.idx.val)
11 br i1 %a14, label %bb19, label %bb16.preheader
13 bb16.preheader:
22 br i1 %a107, label %bb18.bb19_crit_edge, label %bb16.preheader
2011-03-09-ExactNoMaxBECount.ll 14 br label %"5.preheader"
16 "4": ; preds = %"5.preheader", %"4"
17 %0 = phi i32 [ 0, %"5.preheader" ], [ %1, %"4" ]
26 br i1 %5, label %"5.preheader", label %return
28 "5.preheader": ; preds = %"9", %entry
trip-count12.ll 10 br i1 %cmp2, label %for.body.preheader, label %for.end
12 for.body.preheader: ; preds = %entry
15 for.body: ; preds = %for.body, %for.body.preheader
16 %p.addr.05 = phi i16* [ %incdec.ptr, %for.body ], [ %p, %for.body.preheader ]
17 %len.addr.04 = phi i32 [ %sub, %for.body ], [ %len, %for.body.preheader ]
18 %res.03 = phi i32 [ %add, %for.body ], [ 0, %for.body.preheader ]
  /external/llvm/test/CodeGen/X86/
2008-05-09-PHIElimBug.ll 7 br i1 false, label %bb23816.preheader, label %bb23821
9 bb23816.preheader: ; preds = %entry
20 bb23830: ; preds = %bb23827, %bb23821, %bb23816.preheader
21 %scaledInDst.2.reg2mem.5 = phi i8 [ undef, %bb23827 ], [ undef, %bb23821 ], [ undef, %bb23816.preheader ] ; <i8> [#uses=1]
2005-05-08-FPStackifierPHI.ll 6 br i1 false, label %no_exit.16.preheader, label %loopentry.0
9 no_exit.16.preheader: ; preds = %entry
11 no_exit.16: ; preds = %no_exit.16, %no_exit.16.preheader
17 br i1 false, label %loopexit.19, label %no_exit.19.preheader
18 no_exit.19.preheader: ; preds = %no_exit.18
27 br i1 false, label %loopexit.21, label %no_exit.21.preheader
28 no_exit.21.preheader: ; preds = %no_exit.20
change-compare-stride-trickiness-2.ll 14 br label %for.cond.i.preheader
16 for.cond.i.preheader: ; preds = %if.end52, %if.end
25 land.lhs.true.i: ; preds = %for.cond.i.preheader
29 if.end52: ; preds = %for.cond.i.preheader
32 br i1 %phitmp654, label %for.cond.i.preheader, label %if.end
40 br label %for.cond.i.preheader
42 for.cond.i.preheader: ; preds = %if.end52, %if.end
50 land.lhs.true.i: ; preds = %for.cond.i.preheader
54 if.end52: ; preds = %for.cond.i.preheader
57 br i1 %phitmp654, label %for.cond.i.preheader, label %if.en
    [all...]
2009-10-25-RewriterBug.ll 14 br i1 undef, label %bb3.i, label %bb14.preheader.i
19 bb14.preheader.i: ; preds = %bb.i
20 br i1 undef, label %bb9.i, label %bb20.preheader.i
22 bb9.i: ; preds = %bb9.i, %bb14.preheader.i
23 br i1 undef, label %bb9.i, label %bb20.preheader.i
25 bb20.preheader.i: ; preds = %bb9.i, %bb14.preheader.i
26 br i1 undef, label %bb18.i, label %bb29.preheader.i
28 bb18.i: ; preds = %bb20.preheader.i
31 bb29.preheader.i: ; preds = %bb20.preheader.
    [all...]
2007-05-14-LiveIntervalAssert.ll 12 br i1 false, label %cond_true109, label %bb83.preheader
14 bb83.preheader: ; preds = %entry
br-fold.ll 13 label %bb8.i329, label %bb4.i.i318.preheader
15 bb4.i.i318.preheader: ; preds = %bb6
  /external/llvm/test/Analysis/PostDominators/
pr6047_c.ll 24 bb32.preheader:
66 bb14.preheader:
72 bb8.us.preheader:
75 bb8.preheader:
108 bb29.preheader:
114 bb23.us.preheader:
117 bb23.preheader:
  /external/llvm/test/Transforms/LICM/
2006-09-12-DeadUserOfSunkInstr.ll 13 br i1 false, label %bb222.preheader, label %bb241
18 bb83.preheader: ; preds = %cond_true226
19 br i1 false, label %bb83.us.preheader, label %bb83.preheader1
20 bb83.us.preheader: ; preds = %bb83.preheader
22 bb83.us: ; preds = %cond_next80.us, %bb83.us.preheader
38 bb83.preheader1: ; preds = %bb83.preheader
53 br i1 false, label %cond_true249.i.preheader, label %_encodepart.exit
55 br i1 false, label %bb60.i.preheader, label %cond_next97.i
56 bb60.i.preheader: ; preds = %cond_true.
    [all...]
  /external/llvm/test/Transforms/LoopSimplify/
2012-03-20-indirectbr.ll 3 ; Make sure the preheader exists.
20 while.cond112: ; preds = %for.body, %for.cond.preheader, %sw.bb103
21 %pc.0 = phi i8 [ -1, %sw.bb103 ], [ 0, %for.body ], [ %pc.0, %for.cond.preheader ]
25 indirectbr i8* blockaddress(@build_regex_nfa, %for.cond.preheader), [label %Lerror.loopexit, label %for.cond.preheader]
27 for.cond.preheader: ; preds = %sw.bb118
30 for.body: ; preds = %for.body, %for.cond.preheader
  /external/llvm/test/Transforms/LoopUnroll/
pr11361.ll 11 br label %for.cond8.preheader
13 for.cond8.preheader: ; preds = %for.inc15, %entry
18 for.body9: ; preds = %for.body9, %for.cond8.preheader
19 %l_1330.0.12 = phi i80 [ %l_1330.0.03, %for.cond8.preheader ], [ %ins, %for.body9 ]
20 %storemerge1 = phi i32 [ 7, %for.cond8.preheader ], [ %sub, %for.body9 ]
38 br i1 %cmp, label %for.cond8.preheader, label %for.end16
  /external/llvm/test/Analysis/DependenceAnalysis/
Banerjee.ll 15 br label %for.cond1.preheader
24 for.cond1.preheader: ; preds = %entry, %for.inc7
29 for.body3: ; preds = %for.cond1.preheader, %for.body3
30 %j.02 = phi i64 [ 1, %for.cond1.preheader ], [ %inc, %for.body3 ]
31 %B.addr.11 = phi i64* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
51 br i1 %exitcond5, label %for.cond1.preheader, label %for.end9
66 br i1 %cmp4, label %for.cond1.preheader.preheader, label %for.end9
75 for.cond1.preheader.preheader: ; preds = %entr
    [all...]
Propagating.ll 15 br label %for.cond1.preheader
24 for.cond1.preheader: ; preds = %entry, %for.inc9
29 for.body3: ; preds = %for.cond1.preheader, %for.body3
30 %j.02 = phi i64 [ 0, %for.cond1.preheader ], [ %inc, %for.body3 ]
31 %B.addr.11 = phi i32* [ %B.addr.04, %for.cond1.preheader ], [ %incdec.ptr, %for.body3 ]
50 br i1 %exitcond5, label %for.cond1.preheader, label %for.end11
65 br label %for.cond1.preheader
74 for.cond1.preheader: ; preds = %entry, %for.inc18
77 br label %for.cond4.preheader
79 for.cond4.preheader: ; preds = %for.cond1.preheader, %for.inc1
    [all...]
  /external/llvm/test/Other/
2007-04-24-eliminate-mostly-empty-blocks.ll 20 br i1 false, label %cond_true93, label %bb.preheader
23 br label %bb.preheader
25 bb.preheader: ; preds = %cond_true93, %cond_next78
29 bb: ; preds = %cond_next499, %bb.preheader
30 %n.1 = phi i16 [ %iftmp.11.0.ph.ph, %cond_next499 ], [ 0, %bb.preheader ] ; <i16> [#uses=0]
31 br i1 false, label %bb148.preheader, label %bb493
33 bb148.preheader: ; preds = %bb
36 bb148: ; preds = %cond_next475, %bb148.preheader
46 br i1 false, label %bb420.preheader, label %cond_true198
48 bb420.preheader: ; preds = %bb18
    [all...]
  /external/llvm/test/CodeGen/ARM/
2008-05-19-ScavengerAssert.ll 14 br i1 false, label %cond_true166, label %bb190.preheader
16 bb190.preheader: ; preds = %entry
  /external/llvm/test/CodeGen/PowerPC/
2009-11-15-ProcImpDefsBug.ll 32 br i1 undef, label %bb78.preheader, label %rewrite
34 bb78.preheader: ; preds = %bb60
37 bb62: ; preds = %bb78.preheader
46 read_mismatch: ; preds = %bb98, %bb119.preheader, %bb72, %bb71, %bb65, %bb64, %bb62
64 bb80: ; preds = %bb78.preheader
71 br i1 undef, label %bb94, label %bb119.preheader
76 bb119.preheader: ; preds = %rewrite
79 bb98: ; preds = %bb119.preheader

Completed in 2139 milliseconds

12 3 4 5 6 7 8 91011>>