Home
last modified time | relevance | path

Searched refs:bb0 (Results 1 – 25 of 48) sorted by relevance

12

/external/llvm/unittests/Transforms/Utils/
DLocal.cpp25 BasicBlock *bb0 = BasicBlock::Create(C); in TEST() local
28 builder.SetInsertPoint(bb0); in TEST()
30 BranchInst *br0 = builder.CreateCondBr(builder.getTrue(), bb0, bb1); in TEST()
33 BranchInst *br1 = builder.CreateBr(bb0); in TEST()
35 phi->addIncoming(phi, bb0); in TEST()
42 EXPECT_EQ(&bb0->front(), br0); in TEST()
45 builder.SetInsertPoint(bb0); in TEST()
50 builder.SetInsertPoint(bb0); in TEST()
56 bb0->dropAllReferences(); in TEST()
58 delete bb0; in TEST()
/external/llvm/test/Transforms/InstCombine/
Dfold-phi.ll9 %sum.057 = phi float [ 0.000000e+00, %entry ], [ %add5, %bb0 ]
11 br i1 undef, label %bb0, label %end
13 bb0:
28 %sum.057 = phi float [ 0.000000e+00, %entry ], [ %add5, %bb0 ]
30 br i1 undef, label %bb0, label %end
32 ; CHECK: bb0:
33 bb0:
/external/llvm/test/Transforms/GVN/
Dedge.ll5 bb0:
11 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ]
20 bb0:
26 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ]
35 bb0:
40 %cond = phi i32 [ %x, %bb0 ], [ 0, %bb1 ]
50 bb0:
/external/llvm/test/Verifier/
Ddominates.ll14 bb0:
19 %y2 = phi i32 [%y1, %bb0]
26 ; CHECK-NEXT: %y2 = phi i32 [ %y1, %bb0 ]
30 bb0:
48 bb0:
51 %y3 = phi i32 [%y1, %bb0]
56 ; CHECK-NEXT: %y3 = phi i32 [ %y1, %bb0 ]
/external/llvm/test/Analysis/PostDominators/
Dpr1098.ll7 br i1 %x, label %bb1, label %bb0
8 bb0: ; preds = %entry, bb0
9 br label %bb0
/external/llvm/test/ExecutionEngine/MCJIT/
D2003-01-04-LoopTest.ll9 bb0:
11 bb2: ; preds = %bb2, %bb0
12 %reg112 = phi i32 [ 10, %bb2 ], [ 1, %bb0 ] ; <i32> [#uses=1]
13 %cann-indvar = phi i32 [ %cann-indvar, %bb2 ], [ 0, %bb0 ] ; <i32> [#uses=1]
D2002-12-16-ArgTest.ll8 bb0:
15 bb0:
22 bb2: ; preds = %bb2, %bb0
23 %cann-indvar = phi i32 [ 0, %bb0 ], [ %add1-indvar, %bb2 ] ; <i32> [#uses=2]
33 bb3: ; preds = %bb2, %bb0
/external/llvm/test/Transforms/SimplifyCFG/
DEmptyBlockMerge.ll8 bb0:
12 bb2: ; preds = %bb0
16 bb3: ; preds = %bb2, %bb0
17 %reg117 = phi i32 [ 110, %bb2 ], [ %reg108, %bb0 ] ; <i32> [#uses=1]
Dlifetime.ll7 ; CHECK-NOT: bb0:
14 br i1 %x, label %bb0, label %bb1
16 bb0:
DForwardSwitchConditionToPHI.ll12 i32 0, label %sw.bb0
18 sw.bb0: ; preds = %entry
34 %retval.0 = phi i32 [ 4, %sw.bb4 ], [ 3, %sw.bb3 ], [ 2, %sw.bb2 ], [ 1, %sw.bb1 ], [ 0, %sw.bb0 ]
DPR16069.ll20 bb0:
25 …nd = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb0 ]
26 …nd = phi i32 [ 0, %bb1 ], [ srem (i32 1, i32 zext (i1 icmp eq (i32* @b, i32* null) to i32)), %bb0 ]
/external/llvm/test/ExecutionEngine/
D2003-01-04-LoopTest.ll10 bb0:
12 bb2: ; preds = %bb2, %bb0
13 %reg112 = phi i32 [ 10, %bb2 ], [ 1, %bb0 ] ; <i32> [#uses=1]
14 %cann-indvar = phi i32 [ %cann-indvar, %bb2 ], [ 0, %bb0 ] ; <i32> [#uses=1]
D2002-12-16-ArgTest.ll9 bb0:
16 bb0:
23 bb2: ; preds = %bb2, %bb0
24 %cann-indvar = phi i32 [ 0, %bb0 ], [ %add1-indvar, %bb2 ] ; <i32> [#uses=2]
34 bb3: ; preds = %bb2, %bb0
/external/llvm/test/Transforms/SROA/
Dvectors-of-pointers.ll11 br i1 undef, label %bb0.exit158, label %if.then.i.i.i.i.i138
16 bb0.exit158:
17 br i1 undef, label %bb0.exit257, label %if.then.i.i.i.i.i237
22 bb0.exit257:
/external/llvm/test/Transforms/LICM/
D2003-02-27-PreheaderExitNodeUpdate.ll7 bb0:
9 bb5: ; preds = %bb5, %bb0
11 bb7: ; preds = %bb7, %bb5, %bb0
D2003-02-27-NestedLoopExitBlocks.ll6 bb0:
8 bb19: ; preds = %bb28, %bb0
14 UnifiedExitNode: ; preds = %bb32, %bb19, %bb0
/external/compiler-rt/test/asan/TestCases/Linux/
Dcoverage-sandboxing.cc32 #define bb0(n) \ macro
37 #define bb1(n) bb0(n) bb0(n + 1)
/external/llvm/test/CodeGen/X86/
Dpr14098.ll7 bb0:
15 %a6 = phi i8 [ 3, %bb0 ], [ %a5, %bb1 ]
16 %a7 = phi i8 [ 9, %bb0 ], [ %a3, %bb1 ]
Dtail-threshold.ll16 i32 0, label %bb0
22 bb0:
/external/llvm/test/Transforms/SCCP/
Dundef-resolve.ll46 bb0.us: ; preds = %control.us
49 ; CHECK: control.us: ; preds = %bb0.us, %control.outer.us
52 control.us: ; preds = %bb0.us, %control.outer.us
53 …%switchCond.0.us = phi i32 [ %A.0.ph.us, %bb0.us ], [ %switchCond.0.ph.us, %control.outer.us ] ; <…
55 i32 0, label %bb0.us
75 control: ; preds = %bb0, %control.outer
76 %switchCond.0 = phi i32 [ %A.0.ph, %bb0 ], [ %switchCond.0.ph, %control.outer ] ; <i32> [#uses=2]
78 i32 0, label %bb0
98 bb0: ; preds = %control
/external/llvm/test/Transforms/Reassociate/
Dlooptest.ll23 bb0:
26 bb2: ; preds = %bb6, %bb0
27 %reg115 = phi i32 [ %reg120, %bb6 ], [ 0, %bb0 ] ; <i32> [#uses=2]
49 bb7: ; preds = %bb6, %bb0
/external/llvm/test/Transforms/LoopStrengthReduce/
Duglygep.ll63 ; CHECK-NEXT: br i1 false, label %loop0, label %bb0
67 br i1 false, label %loop0, label %bb0
69 bb0: ; preds = %loop0
73 ; CHECK-NEXT: %i1 = phi i32 [ 0, %bb0 ], [ %i1.next, %bb5 ]
78 loop1: ; preds = %bb5, %bb0
79 %i1 = phi i32 [ 0, %bb0 ], [ %i1.next, %bb5 ] ; <i32> [#uses=4]
/external/llvm/test/Transforms/ADCE/
D2002-07-17-PHIAssertion.ll9 bb0:
12 bb2: ; preds = %bb6, %bb0
13 %reg128 = phi i32 [ %reg130, %bb6 ], [ 0, %bb0 ] ; <i32> [#uses=2]
/external/llvm/test/CodeGen/XCore/
Dswitch.ll6 i32 0, label %bb0
14 bb0:
/external/llvm/test/Transforms/LoopIdiom/
Dcrash.ll8 bb0:
14 %storemerge4226 = phi i64 [ 0, %bb0 ], [ %inc139, %bb1 ]

12