Searched defs:BB2 (Results 1 - 10 of 10) sorted by relevance

/external/llvm/unittests/IR/
H A DValueTest.cpp197 BasicBlock *BB2 = &*++F->begin(); local
198 ASSERT_TRUE(BB2);
210 EXPECT_EQ(MST.getLocalSlot(BB2), 2);
230 BasicBlock *BB2 = &*++F->begin(); local
231 ASSERT_TRUE(BB2);
234 EXPECT_DEATH(MST.getLocalSlot(BB2), "No function incorporated");
H A DDominatorTreeTest.cpp45 BasicBlock *BB2 = &*FI++; variable
46 BBI = BB2->begin();
62 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
69 EXPECT_TRUE(DT->dominates(BB0, BB2));
75 EXPECT_FALSE(DT->dominates(BB1, BB2));
79 EXPECT_FALSE(DT->dominates(BB2, BB0));
80 EXPECT_FALSE(DT->dominates(BB2, BB1));
81 EXPECT_TRUE(DT->dominates(BB2, BB2));
82 EXPECT_TRUE(DT->dominates(BB2, BB
[all...]
H A DIRBuilderTest.cpp393 auto BB2 = BasicBlock::Create(Ctx, "bb2", F); local
394 auto Br = BranchInst::Create(BB2, BB);
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/Analysis/
H A DCFG.cpp122 // True if there is a loop which contains both BB1 and BB2.
124 const BasicBlock *BB1, const BasicBlock *BB2) {
126 const Loop *L2 = getOutermostLoop(LI, BB2);
123 loopContainsBoth(const LoopInfo *LI, const BasicBlock *BB1, const BasicBlock *BB2) argument
/external/llvm/lib/Target/Mips/
H A DMipsMCInstLower.cpp162 MachineBasicBlock *BB2,
165 const MCSymbolRefExpr *Sym2 = MCSymbolRefExpr::create(BB2->getSymbol(), *Ctx);
161 createSub(MachineBasicBlock *BB1, MachineBasicBlock *BB2, MCSymbolRefExpr::VariantKind Kind) const argument
/external/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h54 // Union BB1 and BB2 into the same group and return true.
55 // Returns false if BB1 and BB2 are already in the same group.
56 bool unionGroups(const BasicBlock *BB1, const BasicBlock *BB2) { argument
58 BBInfo *BB2G = findAndCompressGroup(&getBBInfo(BB2));
/external/llvm/lib/Transforms/Scalar/
H A DConstantHoisting.cpp253 BasicBlock *BB, *BB1, *BB2; local
255 BB2 = *std::next(BBs.begin());
256 BB = DT->findNearestCommonDominator(BB1, BB2);
260 BBs.erase(BB2);
/external/clang/lib/Analysis/
H A DThreadSafetyCommon.cpp895 til::BasicBlock *BB2 = *It ? lookupBlock(*It) : nullptr; local
897 auto *Tm = new (Arena) til::Branch(C, BB1, BB2);
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp1056 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, argument
1063 Value *BB2V = PN->getIncomingValueForBlock(BB2);
1074 /// Given a conditional branch that goes to BB1 and BB2, hoist any common code
1076 /// guarantees that BI's block dominates BB1 and BB2.
1081 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
1085 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination local
1088 BasicBlock::iterator BB2_Itr = BB2->begin();
1101 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
1150 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))
1158 Value *BB2V = PN->getIncomingValueForBlock(BB2);
2370 findUniqueStoreInBlocks(BasicBlock *BB1, BasicBlock *BB2) argument
[all...]

Completed in 1057 milliseconds