HomeSort by relevance Sort by last modified time
    Searched refs:BB1 (Results 1 - 11 of 11) sorted by null

  /external/llvm/unittests/IR/
DominatorTreeTest.cpp 40 BasicBlock *BB1 = FI++;
41 BBI = BB1->begin();
60 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
67 EXPECT_TRUE(DT->dominates(BB0, BB1));
72 EXPECT_FALSE(DT->dominates(BB1, BB0));
73 EXPECT_TRUE(DT->dominates(BB1, BB1));
74 EXPECT_FALSE(DT->dominates(BB1, BB2));
75 EXPECT_TRUE(DT->dominates(BB1, BB3));
76 EXPECT_FALSE(DT->dominates(BB1, BB4))
    [all...]
InstructionsTest.cpp 88 BasicBlock *BB1 = BasicBlock::Create(Ctx, "", F);
94 std::unique_ptr<InvokeInst> Invoke(InvokeInst::Create(F, BB1, BB2, Args));
110 BasicBlock* bb1 = BasicBlock::Create(C); local
131 BranchInst* b1 = BranchInst::Create(bb0, bb1, One);
150 EXPECT_EQ(bb1, *b);
151 EXPECT_EQ(bb1, b1->getOperand(1));
152 EXPECT_EQ(bb1, b1->getSuccessor(1));
168 delete bb1;
  /external/clang/test/SemaCXX/
warn-reorder-ctor-initialization.cpp 5 struct BB1 {};
7 class complex : public BB, BB1 {
12 s3(3), // expected-warning {{field 's3' will be initialized after base 'BB1'}}
13 BB1(), // expected-warning {{base class 'BB1' will be initialized after base 'BB'}}
  /external/llvm/lib/Transforms/Scalar/
SampleProfile.cpp 143 void findEquivalencesFor(BasicBlock *BB1,
196 /// Two blocks BB1 and BB2 are in the same equivalence class if they
606 /// number of times as \p BB1. To do this, it traverses all the the
607 /// descendants of \p BB1 in the dominator or post-dominator tree.
609 /// A block BB2 will be in the same equivalence class as \p BB1 if
612 /// 1- \p BB1 is a descendant of BB2 in the opposite tree. So, if BB2
613 /// is a descendant of \p BB1 in the dominator tree, then BB2 should
614 /// dominate BB1 in the post-dominator tree.
616 /// 2- Both BB2 and \p BB1 must be in the same loop.
619 /// equivalence class to \p BB1
    [all...]
ConstantHoisting.cpp 249 BasicBlock *BB, *BB1, *BB2;
250 BB1 = *BBs.begin();
252 BB = DT->findNearestCommonDominator(BB1, BB2);
255 BBs.erase(BB1);
  /external/llvm/lib/Target/Mips/
MipsMCInstLower.h 40 MCOperand createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2,
MipsMCInstLower.cpp 154 MCOperand MipsMCInstLower::createSub(MachineBasicBlock *BB1,
157 const MCSymbolRefExpr *Sym1 = MCSymbolRefExpr::Create(BB1->getSymbol(), *Ctx);
  /external/llvm/lib/Analysis/
CFG.cpp 121 // True if there is a loop which contains both BB1 and BB2.
123 const BasicBlock *BB1, const BasicBlock *BB2) {
124 const Loop *L1 = getOutermostLoop(LI, BB1);
  /external/llvm/lib/Transforms/Utils/
IntegerDivision.cpp 193 // | | bb1 |
228 BasicBlock *BB1 = BasicBlock::Create(Builder.getContext(),
229 "udiv-bb1", F, End);
250 // ; br i1 %earlyRet, label %end, label %bb1
263 Builder.CreateCondBr(EarlyRet, End, BB1);
265 // ; bb1: ; preds = %special-cases
271 Builder.SetInsertPoint(BB1);
278 // ; preheader: ; preds = %bb1
324 // ; loop-exit: ; preds = %do-while, %bb1
325 // ; %carry_2 = phi i32 [ 0, %bb1 ], [ %carry, %do-while
    [all...]
SimplifyCFG.cpp     [all...]
  /external/clang/lib/Analysis/
ThreadSafetyCommon.cpp 734 til::BasicBlock *BB1 = *It ? lookupBlock(*It) : nullptr;
737 unsigned Idx1 = BB1 ? BB1->findPredecessorIndex(CurrentBB) : 0;
739 til::SExpr *Tm = new (Arena) til::Branch(C, BB1, BB2, Idx1, Idx2);

Completed in 133 milliseconds