| /external/llvm/test/Transforms/SCCP/ |
| apint-basictest4.ll | 12 br i1 %C, label %BB1, label %BB2
13 BB1:
23 %Ret = phi i100 [%t4, %BB1], [%f3, %BB2]
|
| /external/llvm/test/Transforms/SimplifyCFG/SPARC/ |
| switch_to_lookup_table.ll | 10 i32 43, label %sw.bb1
18 sw.bb1: br label %return
26 %retval.0 = phi i32 [ 15, %sw.default ], [ 1, %sw.bb6 ], [ 62, %sw.bb5 ], [ 27, %sw.bb4 ], [ -1, %sw.bb3 ], [ 0, %sw.bb2 ], [ 123, %sw.bb1 ], [ 55, %entry ]
|
| /sdk/emulator/qtools/ |
| bbprof.cpp | 23 MyStaticRec *bb1, *bb2; local
25 bb1 = *(MyStaticRec**)a;
27 if (bb1->bb.bb_addr < bb2->bb.bb_addr)
29 if (bb1->bb.bb_addr > bb2->bb.bb_addr)
31 return bb1->bb.bb_num - bb2->bb.bb_num;
37 MyStaticRec *bb1, *bb2; local
39 bb1 = *(MyStaticRec**)a;
41 if (bb1->elapsed < bb2->elapsed)
43 if (bb1->elapsed > bb2->elapsed)
45 return bb1->bb.bb_num - bb2->bb.bb_num
51 MyStaticRec *bb1, *bb2; local
[all...] |
| /external/clang/test/SemaCXX/ |
| warn-reorder-ctor-initialization.cpp | 5 struct BB1 {};
7 class complex : public BB, BB1 {
12 s3(3), // expected-warning {{field 's3' will be initialized after base 'BB1'}}
13 BB1(), // expected-warning {{base class 'BB1' will be initialized after base 'BB'}}
|
| /external/llvm/test/CodeGen/X86/ |
| 2009-03-12-CPAlignBug.ll | 12 br label %bb1
14 bb1.ret.exitStub: ; preds = %bb1
17 bb1: ; preds = %newFuncRoot
36 br label %bb1.ret.exitStub
|
| lsr-i386.ll | 20 br label %bb1
22 bb1: ; preds = %bb6, %bb
33 %indvar = phi i32 [ 0, %bb1 ], [ %indvar.next, %bb2 ] ; <i32> [#uses=2]
41 bb6: ; preds = %bb2, %bb1
43 br label %bb1
|
| avoid-loop-align-2.ll | 23 br label %bb1.us
25 bb1.us: ; preds = %bb1.us, %bb2.preheader.us
26 %indvar = phi i32 [ 0, %bb2.preheader.us ], [ %indvar.next, %bb1.us ] ; <i32> [#uses=2]
33 br i1 %exitcond, label %bb2.bb3_crit_edge.us, label %bb1.us
35 bb2.bb3_crit_edge.us: ; preds = %bb1.us
|
| testl-commute.ll | 20 br i1 %3, label %bb1, label %bb
26 bb1: ; preds = %entry
41 br i1 %3, label %bb1, label %bb
47 bb1: ; preds = %entry
62 br i1 %3, label %bb1, label %bb
68 bb1: ; preds = %entry
|
| /external/llvm/test/Transforms/GVN/ |
| lpre-call-wrap-2.ll | 3 ; The partially redundant load in bb1 should be hoisted to "bb". This comes
24 br i1 %3, label %bb, label %bb1
28 br label %bb1
30 bb1: ; preds = %bb, %entry
31 ; CHECK: bb1:
|
| calls-readonly.ll | 11 br i1 %1, label %bb, label %bb1
15 br label %bb1
17 bb1: ; preds = %bb, %entry
|
| /external/llvm/test/Transforms/GlobalOpt/ |
| 2009-01-13-phi-user.ll | 12 br label %bb1
14 bb: ; preds = %bb1
18 br label %bb1
20 bb1: ; preds = %bb, %entry
27 bb2: ; preds = %bb1
|
| /external/llvm/test/Transforms/InstCombine/ |
| sink_instruction.ll | 36 br i1 %2, label %bb1, label %bb2
38 bb1: ; preds = %bb
39 ; CHECK: bb1:
46 bb2: ; preds = %bb, %bb1
47 %x_addr.0 = phi i32 [ %1, %bb1 ], [ %x_addr.17, %bb ] ; <i32> [#uses=2]
|
| /external/llvm/test/CodeGen/ARM/ |
| code-placement.ll | 42 bb1: ; preds = %bb2.preheader, %bb1
43 ; CHECK: LBB1_[[BB1:.]]: @ %bb1
44 ; CHECK: bne LBB1_[[BB1]]
45 %indvar = phi i32 [ %indvar.next, %bb1 ], [ 0, %bb2.preheader ] ; <i32> [#uses=2]
46 %sum.08 = phi i32 [ %2, %bb1 ], [ %sum.110, %bb2.preheader ] ; <i32> [#uses=1]
53 br i1 %exitcond, label %bb3, label %bb1
55 bb3: ; preds = %bb1, %bb2.preheader
59 %sum.0.lcssa = phi i32 [ %sum.110, %bb2.preheader ], [ %2, %bb1 ] ; <i32> [#uses=2
[all...] |
| 2009-06-15-RegScavengerAssert.ll | 9 br i1 undef, label %bb, label %bb1
14 bb1: ; preds = %entry
70 br i1 undef, label %bb1.i.i.i80, label %cc_Init.exit
72 bb1.i.i.i80: ; preds = %subs_Init.exit
109 br label %bb1.i3.i
111 bb1.i3.i: ; preds = %bb1.i3.i, %bb27.i142
112 br i1 undef, label %opts_FreeLongOptsArray.exit.i, label %bb1.i3.i
114 opts_FreeLongOptsArray.exit.i: ; preds = %bb1.i3.i
130 br i1 undef, label %bb1.i81.i.preheader, label %bb.i17
[all...] |
| 2010-09-21-OptCmpBug.ll | 26 i32 5120, label %bb1.i13
27 i32 5121, label %bb1.i13
32 br label %bb1.i13
37 bb1.i13: ; preds = %bb9.i.i6, %bb19, %bb19
40 bb2.i16: ; preds = %bb1.i13
43 bb3.i17: ; preds = %bb1.i13
|
| thumb1-varalloc.ll | 15 br i1 %1, label %bb1, label %bb3
18 bb1:
34 %.0 = phi i8* [ %0, %entry ], [ %6, %bb2 ], [ %3, %bb1 ]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| loop_evaluate9.ll | 20 br label %bb1.i
22 bb1.i: ; preds = %bb2.i, %entry
28 br i1 %tmp1, label %bb.i.i, label %bb1.i.i
30 bb.i.i: ; preds = %bb1.i
34 bb1.i.i: ; preds = %bb1.i
41 bb2.i.i: ; preds = %bb1.i.i
45 cc70a02__complex_integers__Oadd.153.exit.i: ; preds = %bb1.i.i
57 br label %bb1.i
63 br i1 %or.cond, label %return, label %bb1
[all...] |
| /external/llvm/test/CodeGen/Generic/ |
| 2009-11-16-BadKillsCrash.ll | 34 bb1.i100: ; preds = %invcont38
36 br i1 undef, label %bb.i97, label %bb1.i
38 bb.i97: ; preds = %bb1.i100
41 bb1.i: ; preds = %bb1.i100
59 invcont38: ; preds = %invcont25, %bb1.i, %bb.i97, %bb26.preheader
60 %__extracted.0 = phi i32 [ 0, %bb26.preheader ], [ undef, %invcont25 ], [ %2, %bb.i97 ], [ %2, %bb1.i ] ; <i32> [#uses=1]
61 br i1 false, label %bb1.i100, label %invcont24
63 lpad: ; preds = %bb.i93, %invcont24, %bb1.i, %invcont8
64 %__extracted.1 = phi i32 [ 0, %invcont8 ], [ %2, %bb1.i ], [ undef, %bb.i93 ], [ undef, %invcont24 ] ; <i32> [#uses=0
[all...] |
| edge-bundles-blockIDs.ll | 7 br i1 undef, label %bb5.i1632, label %bb1.i1605
9 bb1.i1605: ; preds = %entry
12 bb3.i68.i: ; preds = %bb1.i1605
15 bb5.i73.i: ; preds = %bb1.i1605
28 br i1 undef, label %bb1.i.dis.preheader_crit_edge.i, label %bb.i.i1608
30 bb1.i.dis.preheader_crit_edge.i: ; preds = %bb.i.i1608
70 dis.i: ; preds = %getfloder.exit.i, %bb1.i.dis.preheader_crit_edge.i
71 br i1 undef, label %bb.i96.i, label %bb1.i102.i
76 bb1.i102.i: ; preds = %dis.i
79 getfloder.exit.i: ; preds = %bb1.i102.i, %bb.i96.
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| tst_badblocks.c | 270 badblocks_list bb1, bb2, bb3, bb4, bb5; local
276 bb1 = bb2 = bb3 = bb4 = bb5 = 0;
279 retval = create_test_list(test1, &bb1);
281 print_list(bb1, 1);
317 if (bb1 && bb2 && bb3 && bb4 && bb5) {
319 equal = ext2fs_badblocks_equal(bb1, bb2);
320 printf("bb1 and bb2 are %sequal.\n", equal ? "" : "NOT ");
324 equal = ext2fs_badblocks_equal(bb1, bb3);
325 printf("bb1 and bb3 are %sequal.\n", equal ? "" : "NOT ");
329 equal = ext2fs_badblocks_equal(bb1, bb4)
[all...] |
| /external/llvm/test/Analysis/ScalarEvolution/ |
| sext-iv-2.ll | 4 ; CHECK: --> (sext i8 {0,+,1}<%bb1> to i32) Exits: -1
6 ; CHECK: --> ((sext i8 {0,+,1}<%bb1> to i32) * {0,+,1}<%bb>) Exits: {0,+,-1}<%bb>
26 br label %bb1
28 bb1: ; preds = %bb2, %bb.nph
40 bb2: ; preds = %bb1
42 br i1 %phitmp1, label %bb2.bb3_crit_edge, label %bb1
|
| /external/llvm/test/Transforms/TailCallElim/ |
| accum_recursion.ll | 47 ; CHECK: %accumulator.tr = phi i64 [ %n, %entry ], [ %3, %bb1 ]
48 ; CHECK: %n.tr = phi i64 [ %n, %entry ], [ %2, %bb1 ]
49 switch i64 %n, label %bb1 [
50 ; CHECK: switch i64 %n.tr, label %bb1 [
55 bb1:
56 ; CHECK: bb1:
|
| /external/llvm/test/CodeGen/MSP430/ |
| jumptable.ll | 19 i16 1, label %sw.bb1
28 sw.bb1: ; preds = %entry
44 return: ; preds = %sw.default, %sw.bb3, %sw.bb2, %sw.bb1, %sw.bb
|
| /external/llvm/test/Transforms/JumpThreading/ |
| no-irreducible-loops.ll | 17 br i1 %0, label %bb1, label %bb2
19 bb1: ; preds = %bb
27 bb3: ; preds = %bb2, %bb1
|
| /external/llvm/test/Transforms/LoopUnswitch/ |
| 2008-11-03-Invariant.ll | 15 br i1 %1, label %bb2, label %bb1
17 bb1: ; preds = %bb
21 bb2: ; preds = %bb, %bb1
|
