| /external/llvm/unittests/IR/ |
| D | DominatorTreeTest.cpp | 42 BasicBlock *BB1 = &*FI++; in runOnFunction() local
43 BBI = BB1->begin(); in runOnFunction()
62 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); in runOnFunction()
69 EXPECT_TRUE(DT->dominates(BB0, BB1)); in runOnFunction()
74 EXPECT_FALSE(DT->dominates(BB1, BB0)); in runOnFunction()
75 EXPECT_TRUE(DT->dominates(BB1, BB1)); in runOnFunction()
76 EXPECT_FALSE(DT->dominates(BB1, BB2)); in runOnFunction()
77 EXPECT_TRUE(DT->dominates(BB1, BB3)); in runOnFunction()
78 EXPECT_FALSE(DT->dominates(BB1, BB4)); in runOnFunction()
81 EXPECT_FALSE(DT->dominates(BB2, BB1)); in runOnFunction()
[all …]
|
| /external/llvm/test/Transforms/InstCombine/ |
| D | 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/ |
| D | 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]
|
| D | basictest.ll | 5 BB1:
15 BB4: ; preds = %BB1
16 %X = phi i32 [ %A, %BB1 ] ; <i32> [#uses=1]
|
| /external/llvm/test/Transforms/SCCP/ |
| D | sccptest.ll | 7 br i1 %B, label %BB1, label %BB2
8 BB1: ; preds = %0
13 BB3: ; preds = %BB2, %BB1
14 %Ret = phi i32 [ %Val, %BB1 ], [ 1, %BB2 ] ; <i32> [#uses=1]
18 ; CHECK: %Ret = phi i32 [ 0, %BB1 ], [ 1, %BB2 ]
26 BB1:
29 %j2 = phi i32 [ %j4, %BB7 ], [ 1, %BB1 ]
30 %k2 = phi i32 [ %k4, %BB7 ], [ 0, %BB1 ]
|
| D | apint-basictest.ll | 7 br i1 %B, label %BB1, label %BB2
8 BB1:
14 %Ret = phi i128 [%Val, %BB1], [2, %BB2]
|
| D | apint-basictest2.ll | 8 br i1 %B, label %BB1, label %BB2
9 BB1:
15 %Ret = phi i128 [%Val, %BB1], [1, %BB2]
|
| D | apint-ipsccp1.ll | 5 br i1 %B, label %BB1, label %BB2
6 BB1:
12 %Ret = phi i512 [%Val, %BB1], [2, %BB2]
|
| D | apint-basictest3.ll | 9 br i1 %B, label %BB1, label %BB2
10 BB1:
21 %Ret = phi i128 [%t3, %BB1], [%f3, %BB2]
|
| D | apint-basictest4.ll | 12 br i1 %C, label %BB1, label %BB2
13 BB1:
23 %Ret = phi i100 [%t4, %BB1], [%f3, %BB2]
|
| /external/llvm/test/CodeGen/Mips/ |
| D | longbranch.ll | 62 ; O32-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]]))
63 ; O32-NEXT: bal $[[BB1]]
64 ; O32-NEXT: addiu $1, $1, %lo(($[[BB2]])-($[[BB1]]))
65 ; O32-NEXT: $[[BB1]]:
93 ; N64-NEXT: daddiu $1, $zero, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]]))
95 ; N64-NEXT: bal $[[BB1]]
96 ; N64-NEXT: daddiu $1, $1, %lo(($[[BB2]])-($[[BB1]]))
97 ; N64-NEXT: $[[BB1]]:
128 ; MICROMIPS-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]]))
129 ; MICROMIPS-NEXT: bal $[[BB1]]
[all …]
|
| /external/llvm/test/CodeGen/XCore/ |
| D | 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/LoopSimplify/ |
| D | basictest.ll | 5 ; to by BB1 & BB2
9 br i1 true, label %BB1, label %BB2
10 BB1: ; preds = %0
14 BB3: ; preds = %BB3, %BB2, %BB1
|
| /external/llvm/test/Transforms/ConstProp/ |
| D | 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]
|
| D | basictest.ll | 9 br i1 %B, label %BB1, label %BB2
11 BB1:
20 ; CHECK: %Ret = phi i32 [ 0, %BB1 ], [ 1, %BB2 ]
21 %Ret = phi i32 [ %Val, %BB1 ], [ 1, %BB2 ]
|
| /external/llvm/test/Transforms/LoopRotate/ |
| D | preserve-scev.ll | 5 br label %BB1
7 BB1: ; preds = %BB19, %BB
14 BB4: ; preds = %BB3, %BB1
15 %tmp5 = phi i32 [ undef, %BB1 ], [ %tmp, %BB2 ] ; <i32> [#uses=1]
46 br label %BB1
|
| /external/llvm/test/Feature/ |
| D | terminators.ll | 28 @Addr = global i8* blockaddress(@indbrtest, %BB1)
33 indirectbr i8* %P, [label %BB1, label %BB2, label %BB3]
34 BB1:
38 indirectbr i8* %R, [label %BB1, label %BB2, label %BB3]
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | 2009-01-18-PHIPropCrash.ll | 7 br i1 true, label %BB2, label %BB1
9 BB1: ; preds = %BB
12 BB2: ; preds = %BB1, %BB
13 %tmp3 = phi i1 [ true, %BB ], [ false, %BB1 ] ; <i1> [#uses=1]
|
| D | branch-fold-dbg.ll | 10 br i1 %1, label %BB5, label %BB1, !dbg !5
12 BB1: ; preds = %Entry
16 BB2: ; preds = %BB1
36 BB5: ; preds = %BB3, %BB2, %BB1, %Entry
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | CodeMoverUtils.cpp | 39 bool llvm::isControlFlowEquivalent(const BasicBlock &BB0, const BasicBlock &BB1, in isControlFlowEquivalent() argument
42 if (&BB0 == &BB1) in isControlFlowEquivalent()
45 return ((DT.dominates(&BB0, &BB1) && PDT.dominates(&BB1, &BB0)) || in isControlFlowEquivalent()
46 (PDT.dominates(&BB0, &BB1) && DT.dominates(&BB1, &BB0))); in isControlFlowEquivalent()
|
| /external/llvm/unittests/Analysis/ |
| D | BlockFrequencyInfoTest.cpp | 66 BasicBlock *BB1 = BB0.getTerminator()->getSuccessor(0); in TEST_F() local
68 BasicBlock *BB3 = BB1->getSingleSuccessor(); in TEST_F()
71 uint64_t BB1Freq = BFI.getBlockFreq(BB1).getFrequency(); in TEST_F()
81 EXPECT_EQ(BFI.getBlockProfileCount(BB1).getValue(), 100 * BB1Freq / BB0Freq); in TEST_F()
|
| /external/llvm/test/Transforms/LoopDeletion/ |
| D | dcetest.ll | 7 BB1:
10 BB2: ; preds = %BB7, %BB1
11 %j2 = phi i32 [ %j4, %BB7 ], [ 1, %BB1 ] ; <i32> [#uses=2]
12 %k2 = phi i32 [ %k4, %BB7 ], [ 0, %BB1 ] ; <i32> [#uses=4]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | PostDominators.cpp | 58 const BasicBlock *BB1 = I1->getParent(); in dominates() local
61 if (BB1 != BB2) in dominates()
62 return Base::dominates(BB1, BB2); in dominates()
69 BasicBlock::const_iterator I = BB1->begin(); in dominates()
|
| /external/llvm/test/Assembler/ |
| D | 2002-08-15-ConstantExprProblem.ll | 8 br label %BB1
10 BB1: ; preds = %BB2, %0
15 br label %BB1
|
| /external/llvm/test/CodeGen/AArch64/ |
| D | large_shift.ll | 13 br i1 %t1, label %BB1, label %BB0
17 br label %BB1
19 BB1:
|