HomeSort by relevance Sort by last modified time
    Searched full:bb1 (Results 1 - 25 of 474) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/test/Transforms/LoopSimplify/
indirectbr-backedge.ll 5 ; CHECK: bb1: ; preds = %bb5, %bb
8 ; CHECK: bb5: ; preds = %bb1
9 ; CHECK-NEXT: br label %bb1{{$}}
13 br label %bb1
15 bb1: ; preds = %bb5, %bb1, %bb
16 indirectbr i8* %p, [label %bb6, label %bb7, label %bb1, label %bb2, label %bb3, label %bb5, label %bb4]
18 bb2: ; preds = %bb1
21 bb3: ; preds = %bb1
24 bb4: ; preds = %bb1
    [all...]
basictest.ll 4 ; to by BB1 & BB2
8 br i1 true, label %BB1, label %BB2
9 BB1: ; preds = %0
13 BB3: ; preds = %BB3, %BB2, %BB1
2010-07-15-IncorrectDomFrontierUpdate.ll 6 br i1 undef, label %bb37, label %bb1.i
8 bb1.i: ; preds = %bb1.i, %bb
9 %indvar = phi i64 [ %indvar.next, %bb1.i ], [ 0, %entry ] ; <i64> [#uses=1]
12 br i1 %exitcond, label %bb37, label %bb1.i
14 bb37: ; preds = %bb1.i, %bb
  /external/llvm/test/Transforms/InstCombine/
2010-01-28-NegativeSRem.ll 6 br label %BB1
8 BB1: ; preds = %BB1, %entry
9 ; CHECK: BB1:
10 %x = phi i32 [ -29, %entry ], [ 0, %BB1 ] ; <i32> [#uses=2]
13 br i1 %t, label %BB2, label %BB1
16 BB2: ; preds = %BB1
  /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!
3 ; RUN: opt < %s -adce -S | grep BB1
7 br i1 %C, label %BB1, label %BB2
9 BB1: ; preds = %0
12 BB2: ; preds = %BB1, %0
13 %R = phi i32 [ %A, %0 ], [ %B, %BB1 ] ; <i32> [#uses=1]
  /external/llvm/test/CodeGen/XCore/
zextfree.ll 9 br label %BB1
10 BB1:
11 br i1 %bool, label %BB1, label %BB2
13 br i1 %bool, label %BB1, label %BB2
  /external/llvm/test/Transforms/LoopVectorize/
phi-hang.ll 6 br label %bb1
8 bb1: ; preds = %bb5, %bb
13 bb3: ; preds = %bb1
19 bb5: ; preds = %bb4, %bb1
20 %tmp6 = phi i32 [ 0, %bb4 ], [ %tmp, %bb1 ]
21 %tmp7 = phi i32 [ 0, %bb4 ], [ %tmp6, %bb1 ]
22 %tmp8 = phi i32 [ 0, %bb4 ], [ %tmp, %bb1 ]
25 br i1 %tmp10, label %bb11, label %bb1
34 br label %bb1
36 bb1: ; preds = %bb1, %b
    [all...]
  /external/llvm/test/Analysis/PostDominators/
pr1098.ll 7 br i1 %x, label %bb1, label %bb0
10 bb1: ; preds = %entry
12 bb2: ; preds = %bb1
  /external/llvm/test/Transforms/SCCP/
apint-basictest.ll 7 br i1 %B, label %BB1, label %BB2
8 BB1:
14 %Ret = phi i128 [%Val, %BB1], [2, %BB2]
  /external/llvm/test/CodeGen/X86/
twoaddr-coalesce.ll 7 bb1.thread:
8 br label %bb1
10 bb1: ; preds = %bb1, %bb1.thread
11 %i.0.reg2mem.0 = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]
18 br i1 %exitcond, label %bb2, label %bb1
20 bb2: ; preds = %bb1
fast-isel-cmp-branch3.ll 8 br i1 %1, label %bb1, label %bb2
11 bb1:
22 br i1 %1, label %bb1, label %bb2
25 bb1:
34 br i1 %1, label %bb1, label %bb2
37 bb1:
47 br i1 %1, label %bb1, label %bb2
50 bb1:
59 br i1 %1, label %bb1, label %bb2
62 bb1
    [all...]
2010-09-30-CMOV-JumpTable-PHI.ll 25 i32 3, label %bb1.i
26 i32 4, label %bb1.i1237
27 i32 5, label %bb1.i1266
28 i32 6, label %bb1.i1275
29 i32 2, label %bb1.i1434
30 i32 8, label %bb1.i1523
31 i32 7, label %bb1.i1537
34 bb1.i: ; preds = %bb.i
37 bb1.i1237: ; preds = %bb.i
38 br i1 undef, label %bb.i1820, label %bb1.i124
    [all...]
  /external/llvm/test/Transforms/ConstProp/
phi.ll 8 br i1 %B, label %BB1, label %BB3
10 BB1: ; preds = %BB0
13 BB3: ; preds = %BB1, %BB0
14 %Ret = phi i32 [ 1, %BB0 ], [ 1, %BB1 ] ; <i32> [#uses=1]
  /external/llvm/test/Transforms/IndVarSimplify/
loop_evaluate_6.ll 11 bb: ; preds = %bb1, %bb.nph
12 %x_offs_addr.01 = phi i32 [ %1, %bb1 ], [ %x_offs, %bb.nph ] ; <i32> [#uses=1]
14 br label %bb1
16 bb1: ; preds = %bb
18 br i1 %2, label %bb, label %bb1.bb2_crit_edge
20 bb1.bb2_crit_edge: ; preds = %bb1
23 bb2: ; preds = %bb1.bb2_crit_edge, %entry
24 %x_offs_addr.0.lcssa = phi i32 [ %1, %bb1.bb2_crit_edge ], [ %x_offs, %entry ] ; <i32> [#uses=1]
  /external/llvm/test/Analysis/ScalarEvolution/
2008-07-12-UnneededSelect2.ll 15 bb: ; preds = %bb1, %bb.nph
16 %z.02 = phi i32 [ %1, %bb1 ], [ 1, %bb.nph ] ; <i32> [#uses=1]
17 %i.01 = phi i32 [ %2, %bb1 ], [ 1, %bb.nph ] ; <i32> [#uses=2]
20 br label %bb1
22 bb1: ; preds = %bb
24 br i1 %3, label %bb, label %bb1.bb2_crit_edge
26 bb1.bb2_crit_edge: ; preds = %bb1
27 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1]
30 bb2: ; preds = %bb1.bb2_crit_edge, %entr
    [all...]
2008-11-18-LessThanOrEqual.ll 13 bb: ; preds = %bb.nph, %bb1
14 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]
18 br label %bb1
20 bb1: ; preds = %bb
23 br i1 %phitmp, label %bb1.bb2_crit_edge, label %bb
25 bb1.bb2_crit_edge: ; preds = %bb1
28 bb2: ; preds = %bb1.bb2_crit_edge, %entry
sext-iv-1.ll 4 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
5 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
6 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
7 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
8 ; CHECK: --> (sext i{{.}} {{{.*}},+,{{.*}}}<%bb1> to i64)
18 bb1.thread:
19 br label %bb1
21 bb1: ; preds = %bb1, %bb1.threa
    [all...]
2008-12-15-DontUseSDiv.ll 7 br label %bb1
9 bb: ; preds = %bb1
12 br label %bb1
14 bb1: ; preds = %bb, %entry
20 return: ; preds = %bb1
2008-11-18-Stride1.ll 19 bb: ; preds = %bb.nph, %bb1
20 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]
24 br label %bb1
26 bb1: ; preds = %bb
29 br i1 %2, label %bb, label %bb1.bb2_crit_edge
31 bb1.bb2_crit_edge: ; preds = %bb1
32 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1]
35 bb2: ; preds = %bb1.bb2_crit_edge, %entry
36 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1
    [all...]
2008-11-18-Stride2.ll 18 bb: ; preds = %bb.nph, %bb1
19 %indvar = phi i32 [ 0, %bb.nph ], [ %indvar.next, %bb1 ] ; <i32> [#uses=2]
23 br label %bb1
25 bb1: ; preds = %bb
28 br i1 %2, label %bb1.bb2_crit_edge, label %bb
30 bb1.bb2_crit_edge: ; preds = %bb1
31 %.lcssa = phi i32 [ %1, %bb1 ] ; <i32> [#uses=1]
34 bb2: ; preds = %bb1.bb2_crit_edge, %entry
35 %x_addr.0.lcssa = phi i32 [ %.lcssa, %bb1.bb2_crit_edge ], [ %x, %entry ] ; <i32> [#uses=1
    [all...]
2008-12-08-FiniteSGE.ll 6 bb1.thread:
7 br label %bb1
9 bb1: ; preds = %bb1, %bb1.thread
10 %indvar = phi i32 [ 0, %bb1.thread ], [ %indvar.next, %bb1 ] ; <i32> [#uses=4]
19 br i1 %4, label %bb2, label %bb1
21 bb2: ; preds = %bb1
  /external/llvm/test/CodeGen/PowerPC/
2008-06-23-LiveVariablesCrash.ll 6 br i1 true, label %bb1, label %bb3
8 bb1:
14 %val1 = phi i32 [ 0, %bb1 ], [ %val2, %bb2 ]
18 i32 0, label %bb1
20 i32 2, label %bb1
  /external/llvm/test/CodeGen/AArch64/
fast-isel-tbz.ll 9 br i1 %2, label %bb1, label %bb2, !prof !0
10 bb1:
21 br i1 %2, label %bb1, label %bb2, !prof !0
22 bb1:
33 br i1 %2, label %bb1, label %bb2, !prof !0
34 bb1:
45 br i1 %2, label %bb1, label %bb2, !prof !0
46 bb1:
57 br i1 %2, label %bb1, label %bb2, !prof !0
58 bb1
    [all...]
  /external/llvm/test/Transforms/SimplifyCFG/
PR16069.ll 7 br i1 %y, label %bb1, label %bb2
8 bb1:
13 %cond.i = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb2 ]
21 br i1 %x, label %bb1, label %bb2
22 bb1:
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 ]
  /external/llvm/test/Transforms/GlobalOpt/
2008-12-16-HeapSRACrash.ll 19 bb1.thread:
22 br label %bb1
24 bb1: ; preds = %bb1, %bb1.thread
25 %tmp = phi %struct.foo* [ %tmpLD1, %bb1.thread ], [ %tmpLD1, %bb1 ] ; <%struct.foo*> [#uses=0]
26 br i1 false, label %bb2, label %bb1
28 bb2: ; preds = %bb1

Completed in 452 milliseconds

1 2 3 4 5 6 7 8 91011>>