/external/llvm/unittests/IR/ |
D | DominatorTreeTest.cpp | 44 BasicBlock *BB2 = FI++; in runOnFunction() local 45 BBI = BB2->begin(); in runOnFunction() 61 EXPECT_TRUE(DT->isReachableFromEntry(BB2)); in runOnFunction() 68 EXPECT_TRUE(DT->dominates(BB0, BB2)); in runOnFunction() 74 EXPECT_FALSE(DT->dominates(BB1, BB2)); in runOnFunction() 78 EXPECT_FALSE(DT->dominates(BB2, BB0)); in runOnFunction() 79 EXPECT_FALSE(DT->dominates(BB2, BB1)); in runOnFunction() 80 EXPECT_TRUE(DT->dominates(BB2, BB2)); in runOnFunction() 81 EXPECT_TRUE(DT->dominates(BB2, BB3)); in runOnFunction() 82 EXPECT_FALSE(DT->dominates(BB2, BB4)); in runOnFunction() [all …]
|
/external/llvm/test/Transforms/SCCP/ |
D | sccptest.ll | 7 br i1 %B, label %BB1, label %BB2 11 BB2: ; 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 ] 27 br label %BB2 28 BB2: 53 br label %BB2 56 ; CHECK-NEXT: br label %BB2
|
D | 2002-05-20-MissedIncomingValue.ll | 8 br label %BB2 9 BB2: ; preds = %BB4, %bb1 12 BB3: ; preds = %BB2 15 br label %BB2
|
D | apint-phi.ll | 5 br label %BB2 6 BB2: 15 br label %BB2
|
D | apint-basictest.ll | 7 br i1 %B, label %BB1, label %BB2 11 BB2: 14 %Ret = phi i128 [%Val, %BB1], [2, %BB2]
|
D | apint-basictest2.ll | 8 br i1 %B, label %BB1, label %BB2 12 BB2: 15 %Ret = phi i128 [%Val, %BB1], [1, %BB2]
|
D | apint-ipsccp1.ll | 5 br i1 %B, label %BB1, label %BB2 9 BB2: 12 %Ret = phi i512 [%Val, %BB1], [2, %BB2]
|
D | apint-basictest3.ll | 9 br i1 %B, label %BB1, label %BB2 15 BB2: 21 %Ret = phi i128 [%t3, %BB1], [%f3, %BB2]
|
D | 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/ |
D | 2009-01-18-PHIPropCrash.ll | 7 br i1 true, label %BB2, label %BB1 10 br label %BB2 12 BB2: ; preds = %BB1, %BB 16 BB9: ; preds = %BB11, %BB2 17 %tmp10 = phi i32 [ 0, %BB2 ], [ %tmp12, %BB11 ] ; <i32> [#uses=1]
|
D | branch-fold-dbg.ll | 14 br i1 %2, label %BB5, label %BB2, !dbg !5 16 BB2: ; preds = %BB1 26 BB3: ; preds = %BB2 36 BB5: ; preds = %BB3, %BB2, %BB1, %Entry
|
/external/llvm/test/Transforms/LoopSimplify/ |
D | basictest.ll | 4 ; to by BB1 & BB2 8 br i1 true, label %BB1, label %BB2 11 BB2: ; preds = %0 13 BB3: ; preds = %BB3, %BB2, %BB1
|
/external/llvm/test/Transforms/LoopDeletion/ |
D | dcetest.ll | 8 br label %BB2 10 BB2: ; preds = %BB7, %BB1 16 BB3: ; preds = %BB2 20 BB4: ; preds = %BB2 34 br label %BB2
|
/external/llvm/test/CodeGen/Mips/ |
D | longbranch.ll | 58 ; O32-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]])) 60 ; O32-NEXT: addiu $1, $1, %lo(($[[BB2]])-($[[BB1]])) 71 ; O32: $[[BB2]]: 85 ; N64-NEXT: daddiu $1, $zero, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]])) 88 ; N64-NEXT: daddiu $1, $1, %lo(($[[BB2]])-($[[BB1]])) 100 ; N64: $[[BB2]]: 115 ; MICROMIPS-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]])) 117 ; MICROMIPS-NEXT: addiu $1, $1, %lo(($[[BB2]])-($[[BB1]])) 128 ; MICROMIPS: $[[BB2]]: 145 ; NACL-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]])) [all …]
|
/external/llvm/test/CodeGen/XCore/ |
D | zextfree.ll | 11 br i1 %bool, label %BB1, label %BB2 12 BB2: 13 br i1 %bool, label %BB1, label %BB2
|
/external/llvm/test/Assembler/ |
D | 2002-08-15-ConstantExprProblem.ll | 9 BB1: ; preds = %BB2, %0 10 …%ret = phi i8* [ getelementptr ([12 x i8]* @.LC0, i64 0, i64 0), %0 ], [ null, %BB2 ] ; <… 13 BB2: ; No predecessors!
|
/external/llvm/test/Transforms/ADCE/ |
D | basictest.ll | 7 BB2: ; No predecessors! 10 BB3: ; preds = %BB4, %BB2 11 %ret = phi i32 [ %X, %BB4 ], [ %B, %BB2 ] ; <i32> [#uses=1]
|
D | 2002-05-22-PHITest.ll | 7 br i1 %C, label %BB1, label %BB2 10 br label %BB2 12 BB2: ; preds = %BB1, %0
|
/external/llvm/test/Transforms/InstCombine/ |
D | 2010-01-28-NegativeSRem.ll | 13 br i1 %t, label %BB2, label %BB1 16 BB2: ; preds = %BB1 17 ; CHECK: BB2:
|
D | phi.ll | 9 br i1 %b, label %BB1, label %BB2 16 BB2: 25 br i1 %b, label %BB1, label %BB2 28 br label %BB2 30 BB2: 35 ; CHECK: BB2: 93 br i1 %b, label %BB1, label %BB2 97 br label %BB2 99 BB2: 104 ; CHECK: BB2: [all …]
|
/external/llvm/test/Transforms/ConstProp/ |
D | basictest.ll | 9 br i1 %B, label %BB1, label %BB2 15 BB2: 20 ; CHECK: %Ret = phi i32 [ 0, %BB1 ], [ 1, %BB2 ] 21 %Ret = phi i32 [ %Val, %BB1 ], [ 1, %BB2 ]
|
/external/llvm/test/Feature/ |
D | 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/LoopRotate/ |
D | preserve-scev.ll | 10 BB2: ; preds = %BB4 15 %tmp5 = phi i32 [ undef, %BB1 ], [ %tmp, %BB2 ] ; <i32> [#uses=1] 16 br i1 false, label %BB8, label %BB2
|
/external/llvm/test/CodeGen/X86/ |
D | fast-isel-call.ll | 8 br i1 %tmp, label %BB1, label %BB2 11 BB2:
|
/external/llvm/lib/Transforms/Scalar/ |
D | SampleProfile.cpp | 632 BasicBlock *BB2 = *I; in findEquivalencesFor() local 633 bool IsDomParent = DomTree->dominates(BB2, BB1); in findEquivalencesFor() 634 bool IsInSameLoop = LI->getLoopFor(BB1) == LI->getLoopFor(BB2); in findEquivalencesFor() 635 if (BB1 != BB2 && VisitedBlocks.insert(BB2) && IsDomParent && in findEquivalencesFor() 637 EquivalenceClass[BB2] = BB1; in findEquivalencesFor() 648 unsigned &BB2Weight = BlockWeights[BB2]; in findEquivalencesFor()
|