Searched defs:BB1 (Results 1 - 10 of 10) sorted by relevance
/external/clang/test/SemaCXX/ |
H A D | warn-reorder-ctor-initialization.cpp | 5 struct BB1 {}; struct 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/Analysis/ |
H A D | 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); 122 loopContainsBoth(const LoopInfo *LI, const BasicBlock *BB1, const BasicBlock *BB2) argument
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsMCInstLower.cpp | 154 MCOperand MipsMCInstLower::createSub(MachineBasicBlock *BB1, argument 157 const MCSymbolRefExpr *Sym1 = MCSymbolRefExpr::Create(BB1->getSymbol(), *Ctx);
|
/external/llvm/unittests/IR/ |
H A D | DominatorTreeTest.cpp | 40 BasicBlock *BB1 = FI++; local 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, BB [all...] |
H A D | InstructionsTest.cpp | 88 BasicBlock *BB1 = BasicBlock::Create(Ctx, "", F); local 94 std::unique_ptr<InvokeInst> Invoke(InvokeInst::Create(F, BB1, BB2, Args));
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | ConstantHoisting.cpp | 249 BasicBlock *BB, *BB1, *BB2; local 250 BB1 = *BBs.begin(); 252 BB = DT->findNearestCommonDominator(BB1, BB2); 255 BBs.erase(BB1);
|
H A D | 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 626 findEquivalencesFor( BasicBlock *BB1, SmallVector<BasicBlock *, 8> Descendants, DominatorTreeBase<BasicBlock> *DomTree) argument 668 BasicBlock *BB1 = B; local [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | IntegerDivision.cpp | 228 BasicBlock *BB1 = BasicBlock::Create(Builder.getContext(), local 263 Builder.CreateCondBr(EarlyRet, End, BB1); 271 Builder.SetInsertPoint(BB1); 357 Carry_2->addIncoming(Zero, BB1); 360 Q_3->addIncoming(Q, BB1);
|
H A D | SimplifyCFG.cpp | 982 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, argument 984 for (succ_iterator SI = succ_begin(BB1), E = succ_end(BB1); SI != E; ++SI) { 988 Value *BB1V = PN->getIncomingValueForBlock(BB1); 998 /// HoistThenElseCodeToIf - Given a conditional branch that goes to BB1 and 1000 /// caller of this function guarantees that BI's block dominates BB1 and BB2. 1004 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As 1007 BasicBlock *BB1 = BI->getSuccessor(0); // The true destination. local 1010 BasicBlock::iterator BB1_Itr = BB1->begin(); 1024 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB 1134 BasicBlock *BB1 = BI1->getParent(); local [all...] |
/external/clang/lib/Analysis/ |
H A D | ThreadSafetyCommon.cpp | 734 til::BasicBlock *BB1 = *It ? lookupBlock(*It) : nullptr; local 737 unsigned Idx1 = BB1 ? BB1->findPredecessorIndex(CurrentBB) : 0; 739 til::SExpr *Tm = new (Arena) til::Branch(C, BB1, BB2, Idx1, Idx2);
|
Completed in 275 milliseconds