Home
last modified time | relevance | path

Searched refs:BB1 (Results 1 – 25 of 63) sorted by relevance

123

/external/llvm/unittests/IR/
DDominatorTreeTest.cpp41 BasicBlock *BB1 = &*FI++; in runOnFunction() local
42 BBI = BB1->begin(); in runOnFunction()
61 EXPECT_TRUE(DT->isReachableFromEntry(BB1)); in runOnFunction()
68 EXPECT_TRUE(DT->dominates(BB0, BB1)); in runOnFunction()
73 EXPECT_FALSE(DT->dominates(BB1, BB0)); in runOnFunction()
74 EXPECT_TRUE(DT->dominates(BB1, BB1)); in runOnFunction()
75 EXPECT_FALSE(DT->dominates(BB1, BB2)); in runOnFunction()
76 EXPECT_TRUE(DT->dominates(BB1, BB3)); in runOnFunction()
77 EXPECT_FALSE(DT->dominates(BB1, BB4)); in runOnFunction()
80 EXPECT_FALSE(DT->dominates(BB2, BB1)); in runOnFunction()
[all …]
/external/llvm/test/Transforms/InstCombine/
D2010-01-28-NegativeSRem.ll6 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/
D2002-05-22-PHITest.ll1 ; 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]
Dbasictest.ll5 BB1:
15 BB4: ; preds = %BB1
16 %X = phi i32 [ %A, %BB1 ] ; <i32> [#uses=1]
/external/llvm/test/CodeGen/Mips/
Dlongbranch.ll58 ; O32-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]]))
59 ; O32-NEXT: bal $[[BB1]]
60 ; O32-NEXT: addiu $1, $1, %lo(($[[BB2]])-($[[BB1]]))
61 ; O32-NEXT: $[[BB1]]:
85 ; N64-NEXT: daddiu $1, $zero, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]]))
87 ; N64-NEXT: bal $[[BB1]]
88 ; N64-NEXT: daddiu $1, $1, %lo(($[[BB2]])-($[[BB1]]))
89 ; N64-NEXT: $[[BB1]]:
115 ; MICROMIPS-NEXT: lui $1, %hi(($[[BB2:BB[0-9_]+]])-($[[BB1:BB[0-9_]+]]))
116 ; MICROMIPS-NEXT: bal $[[BB1]]
[all …]
/external/llvm/test/Transforms/SCCP/
Dsccptest.ll7 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 ]
Dapint-basictest.ll7 br i1 %B, label %BB1, label %BB2
8 BB1:
14 %Ret = phi i128 [%Val, %BB1], [2, %BB2]
Dapint-basictest2.ll8 br i1 %B, label %BB1, label %BB2
9 BB1:
15 %Ret = phi i128 [%Val, %BB1], [1, %BB2]
Dapint-ipsccp1.ll5 br i1 %B, label %BB1, label %BB2
6 BB1:
12 %Ret = phi i512 [%Val, %BB1], [2, %BB2]
Dapint-basictest3.ll9 br i1 %B, label %BB1, label %BB2
10 BB1:
21 %Ret = phi i128 [%t3, %BB1], [%f3, %BB2]
Dapint-basictest4.ll12 br i1 %C, label %BB1, label %BB2
13 BB1:
23 %Ret = phi i100 [%t4, %BB1], [%f3, %BB2]
/external/llvm/test/Transforms/LoopSimplify/
Dbasictest.ll4 ; to by BB1 & BB2
8 br i1 true, label %BB1, label %BB2
9 BB1: ; preds = %0
13 BB3: ; preds = %BB3, %BB2, %BB1
/external/llvm/test/CodeGen/XCore/
Dzextfree.ll9 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/ConstProp/
Dphi.ll8 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]
Dbasictest.ll9 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/
Dpreserve-scev.ll5 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/
Dterminators.ll28 @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/
D2009-01-18-PHIPropCrash.ll7 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]
Dbranch-fold-dbg.ll10 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/llvm/test/Transforms/LoopDeletion/
Ddcetest.ll7 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/llvm/test/Assembler/
D2002-08-15-ConstantExprProblem.ll8 br label %BB1
10 BB1: ; preds = %BB2, %0
15 br label %BB1
/external/llvm/test/CodeGen/AArch64/
Dlarge_shift.ll13 br i1 %t1, label %BB1, label %BB0
17 br label %BB1
19 BB1:
/external/clang/test/SemaCXX/
Dwarn-reorder-ctor-initialization.cpp5 struct BB1 {}; struct
7 class complex : public BB, BB1 {
13 BB1(), // expected-warning {{base class 'BB1' will be initialized after base 'BB'}} in complex()
/external/llvm/lib/Transforms/Scalar/
DMergedLoadStoreMotion.cpp257 LoadInst *MergedLoadStoreMotion::canHoistFromBlock(BasicBlock *BB1, in canHoistFromBlock() argument
260 for (BasicBlock::iterator BBI = BB1->begin(), BBE = BB1->end(); BBI != BBE; in canHoistFromBlock()
265 if (!isa<LoadInst>(Inst) || Inst->isUsedOutsideOfBlock(BB1)) in canHoistFromBlock()
274 !isLoadHoistBarrierInRange(BB1->front(), *Load1, Load1) && in canHoistFromBlock()
410 StoreInst *MergedLoadStoreMotion::canSinkFromBlock(BasicBlock *BB1, in canSinkFromBlock() argument
414 for (BasicBlock::reverse_iterator RBI = BB1->rbegin(), RBE = BB1->rend(); in canSinkFromBlock()
427 BB1->back(), Loc1) && in canSinkFromBlock()
/external/llvm/lib/Transforms/IPO/
DSampleProfile.cpp142 void findEquivalencesFor(BasicBlock *BB1,
734 BasicBlock *BB1, SmallVector<BasicBlock *, 8> Descendants, in findEquivalencesFor() argument
736 const BasicBlock *EC = EquivalenceClass[BB1]; in findEquivalencesFor()
739 bool IsDomParent = DomTree->dominates(BB2, BB1); in findEquivalencesFor()
740 bool IsInSameLoop = LI->getLoopFor(BB1) == LI->getLoopFor(BB2); in findEquivalencesFor()
741 if (BB1 != BB2 && IsDomParent && IsInSameLoop) { in findEquivalencesFor()
772 BasicBlock *BB1 = &BB; in findEquivalenceClasses() local
775 if (EquivalenceClass.count(BB1)) { in findEquivalenceClasses()
776 DEBUG(printBlockEquivalence(dbgs(), BB1)); in findEquivalenceClasses()
781 EquivalenceClass[BB1] = BB1; in findEquivalenceClasses()
[all …]

123