| /external/llvm/test/CodeGen/Thumb2/ |
| 2011-12-16-T2SizeReduceAssert.ll | 15 br i1 %1, label %bb5, label %bb2
17 bb2: ; preds = %bb
21 bb3: ; preds = %bb2, %entry
22 %Scan.0 = phi %struct.LIST_NODE.0.16* [ %List, %entry ], [ %Scan.0.idx8.val, %bb2 ]
|
| ifcvt-neon.ll | 19 br label %bb2
23 br label %bb2
25 bb2: ; preds = %bb1, %bb
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| ForwardSwitchConditionToPHI.ll | 14 i32 2, label %sw.bb2
24 sw.bb2: ; preds = %entry
33 return: ; preds = %entry, %sw.bb4, %sw.bb3, %sw.bb2, %sw.bb1
34 %retval.0 = phi i32 [ 4, %sw.bb4 ], [ 3, %sw.bb3 ], [ 2, %sw.bb2 ], [ 1, %sw.bb1 ], [ 0, %sw.bb0 ]
|
| 2009-01-19-UnconditionalTrappingConstantExpr.ll | 14 br i1 %tmp25, label %bb2, label %bb1
18 br i1 %tmp26, label %bb6, label %bb2
19 bb2:
|
| /external/llvm/test/Analysis/BasicAA/ |
| 2009-10-13-GEP-BaseNoAlias.ll | 19 br label %bb2
22 br label %bb2
24 bb2:
|
| phi-aa.ll | 17 br label %bb2
20 br label %bb2
22 bb2:
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-07-12-UnneededSelect2.ll | 7 br i1 %0, label %bb.nph, label %bb2
25 br label %bb2
27 bb2: ; preds = %bb1.bb2_crit_edge, %entry
|
| 2008-11-18-LessThanOrEqual.ll | 7 br i1 %0, label %bb2, label %bb.nph
25 br label %bb2
27 bb2: ; preds = %bb1.bb2_crit_edge, %entry
|
| 2008-12-11-SMaxOverflow.ll | 8 bb2:
14 %k.019 = phi i32 [ %k.0, %bb18 ], [ %k.018, %bb2 ] ; <i32> [#uses=5]
15 %x = phi i32 [ 0, %bb2 ], [ %x.1, %bb18]
|
| /external/llvm/test/CodeGen/ARM/ |
| code-placement.ll | 12 br i1 %0, label %bb2, label %bb
25 br i1 %3, label %bb2, label %bb
27 bb2:
41 ; CHECK: LBB1_[[PREHDR:.]]: @ %bb2.preheader
42 bb1: ; preds = %bb2.preheader, %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]
55 bb3: ; preds = %bb1, %bb2.preheader
59 %sum.0.lcssa = phi i32 [ %sum.110, %bb2.preheader ], [ %2, %bb1 ] ; <i32> [#uses=2]
62 br i1 %exitcond18, label %bb5, label %bb2.preheade
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| 2006-10-19-SwitchUnnecessaryBranching.ll | 10 ; CHECK-NEXT: %bb2
14 i32 2, label %bb2
21 bb2: ; preds = %entry
|
| 2009-07-20-DAGCombineBug.ll | 15 br i1 false, label %bb2.i16, label %bb1.i15
20 bb2.i16: ; preds = %bb3.i9
23 bb3.i17: ; preds = %bb2.i16, %entry
|
| brcond.ll | 94 br i1 %3, label %bb2, label %bb1
103 br label %bb2
105 bb2: ; preds = %entry, %bb1
123 br i1 %one, label %bb1, label %bb2
129 bb2:
134 %e = phi <4 x float> [%c, %bb1], [%d, %bb2]
147 br i1 %one, label %bb1, label %bb2
153 bb2:
158 %e = phi <4 x float> [%c, %bb1], [%d, %bb2]
171 br i1 %one, label %bb1, label %bb2
[all...] |
| /external/llvm/test/Feature/ |
| recursivetype.ll | 49 br i1 %cond1000, label %bb3, label %bb2
51 bb2: ; preds = %bb2, %bb1
52 %reg117 = phi %list** [ %reg118, %bb2 ], [ %L, %bb1 ] ; <%list**> [#uses=1]
58 br i1 %cond1001, label %bb2, label %bb3
60 bb3: ; preds = %bb2, %bb1
61 %reg119 = phi %list** [ %reg118, %bb2 ], [ %L, %bb1 ] ; <%list**> [#uses=1]
78 br label %bb2
80 bb2: ; preds = %bb6, %bb1
86 bb3: ; preds = %bb2
[all...] |
| terminators.ll | 33 indirectbr i8* %P, [label %BB1, label %BB2, label %BB3]
36 BB2:
38 indirectbr i8* %R, [label %BB1, label %BB2, label %BB3]
|
| /external/llvm/test/Transforms/GVN/ |
| rle-phi-translate.ll | 17 br label %bb2
23 br label %bb2
25 bb2: ; preds = %bb1, %bb
46 br label %bb2
51 br label %bb2
53 bb2:
71 br label %bb2
76 br label %bb2
78 bb2:
97 br label %bb2
[all...] |
| /external/llvm/test/Transforms/GlobalOpt/ |
| cleanup-pointer-root-users.ll | 36 ; CHECK-NOT: bb2:
39 to label %bb1 unwind label %bb2
43 bb2:
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| loop_evaluate_6.ll | 11 br i1 %0, label %bb.nph, label %bb2
26 br label %bb2
28 bb2: ; preds = %bb1.bb2_crit_edge, %entry
|
| uglygep.ll | 22 br label %bb2
24 bb2: ; preds = %bb1, %bb
29 bb1: ; preds = %bb2
35 br label %bb2
37 bb3: ; preds = %bb2
|
| loop_evaluate10.ll | 2 ; RUN: | grep "%b.1 = phi i32 [ 2, %bb ], [ 1, %bb2 ]"
19 br label %bb2
21 bb2: ; preds = %bb, %entry
33 bb: ; preds = %bb2
36 br i1 %t1, label %bb3, label %bb2
38 bb3: ; preds = %bb, %bb2
39 %b.1 = phi i32 [ %t0, %bb ], [ %b.0, %bb2 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/InstCombine/ |
| idioms.ll | 13 br i1 %c, label %bb2, label %bb3
15 bb2:
26 %f = phi i32 [ %not2, %bb2 ], [ %e, %bb3 ]
|
| /external/llvm/test/Transforms/SCCP/ |
| apint-basictest4.ll | 12 br i1 %C, label %BB1, label %BB2
17 BB2:
23 %Ret = phi i100 [%t4, %BB1], [%f3, %BB2]
|
| /external/llvm/test/Transforms/SimplifyCFG/SPARC/ |
| switch_to_lookup_table.ll | 11 i32 44, label %sw.bb2
19 sw.bb2: 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
26 bb2 = *(MyStaticRec**)b;
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
40 bb2 = *(MyStaticRec**)b;
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...] |
| /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/javax/crypto/ |
| CipherSpiTest.java | 152 byte[] bb2 = new byte[10];
161 cSpi.engineUpdate(bb1, 1, 2, bb2, 7), 2);
164 2, cSpi.engineDoFinal(bb1, 1, 2, bb2, 0));
232 ByteBuffer bb2 = ByteBuffer.allocate(bb.length); local
235 bb1, bb2));
238 bb2.position(len - 2);
240 cSpi.engineUpdate(bb1, bb2);
242 .concat(Integer.toString(bb2.remaining())));
246 bb2.position(0);
248 bb2) > 0)
284 ByteBuffer bb2 = ByteBuffer.allocate(len); local
[all...] |
