Searched refs:BB2 (Results 1 - 9 of 9) sorted by relevance

/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp44 BasicBlock *BB2 = FI++; local
45 BBI = BB2->begin();
61 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
68 EXPECT_TRUE(DT->dominates(BB0, BB2));
74 EXPECT_FALSE(DT->dominates(BB1, BB2));
78 EXPECT_FALSE(DT->dominates(BB2, BB0));
79 EXPECT_FALSE(DT->dominates(BB2, BB1));
80 EXPECT_TRUE(DT->dominates(BB2, BB2));
81 EXPECT_TRUE(DT->dominates(BB2, BB
[all...]
H A DInstructionsTest.cpp89 BasicBlock *BB2 = BasicBlock::Create(Ctx, "", F); local
94 std::unique_ptr<InvokeInst> Invoke(InvokeInst::Create(F, BB1, BB2, Args));
/external/llvm/lib/Target/Mips/
H A DMipsMCInstLower.h40 MCOperand createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2,
H A DMipsMCInstLower.cpp155 MachineBasicBlock *BB2,
158 const MCSymbolRefExpr *Sym2 = MCSymbolRefExpr::Create(BB2->getSymbol(), *Ctx);
154 createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2, MCSymbolRefExpr::VariantKind Kind) const argument
/external/llvm/lib/Transforms/Scalar/
H A DSampleProfile.cpp196 /// Two blocks BB1 and BB2 are in the same equivalence class if they
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
616 /// 2- Both BB2 and \p BB1 must be in the same loop.
618 /// For every block BB2 that meets those two requirements, we set BB2's
632 BasicBlock *BB2 = *I; local
633 bool IsDomParent = DomTree->dominates(BB2, BB
[all...]
H A DConstantHoisting.cpp249 BasicBlock *BB, *BB1, *BB2; local
251 BB2 = *std::next(BBs.begin());
252 BB = DT->findNearestCommonDominator(BB1, BB2);
256 BBs.erase(BB2);
/external/llvm/lib/Analysis/
H A DCFG.cpp121 // True if there is a loop which contains both BB1 and BB2.
123 const BasicBlock *BB1, const BasicBlock *BB2) {
125 const Loop *L2 = getOutermostLoop(LI, BB2);
122 loopContainsBoth(const LoopInfo *LI, const BasicBlock *BB1, const BasicBlock *BB2) argument
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp982 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, argument
989 Value *BB2V = PN->getIncomingValueForBlock(BB2);
999 /// BB2, hoist any common code in the two blocks up into the branch block. The
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
1008 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination local
1011 BasicBlock::iterator BB2_Itr = BB2->begin();
1024 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
1063 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))
1071 Value *BB2V = PN->getIncomingValueForBlock(BB2);
[all...]
/external/clang/lib/Analysis/
H A DThreadSafetyCommon.cpp736 til::BasicBlock *BB2 = *It ? lookupBlock(*It) : nullptr; local
738 unsigned Idx2 = BB2 ? BB2->findPredecessorIndex(CurrentBB) : 0;
739 til::SExpr *Tm = new (Arena) til::Branch(C, BB1, BB2, Idx1, Idx2);

Completed in 525 milliseconds