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

/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp41 BasicBlock *BB2 = FI++; local
42 BBI = BB2->begin();
58 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
65 EXPECT_TRUE(DT->dominates(BB0, BB2));
71 EXPECT_FALSE(DT->dominates(BB1, BB2));
75 EXPECT_FALSE(DT->dominates(BB2, BB0));
76 EXPECT_FALSE(DT->dominates(BB2, BB1));
77 EXPECT_TRUE(DT->dominates(BB2, BB2));
78 EXPECT_TRUE(DT->dominates(BB2, BB
[all...]
/external/llvm/lib/Analysis/
H A DCFG.cpp128 // True if there is a loop which contains both BB1 and BB2.
130 const BasicBlock *BB1, const BasicBlock *BB2) {
132 const Loop *L2 = getOutermostLoop(LI, BB2);
129 loopContainsBoth(LoopInfo *LI, const BasicBlock *BB1, const BasicBlock *BB2) argument
/external/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp176 bool compare(const BasicBlock *BB1, const BasicBlock *BB2);
424 bool FunctionComparator::compare(const BasicBlock *BB1, const BasicBlock *BB2) { argument
426 BasicBlock::const_iterator F2I = BB2->begin(), F2E = BB2->end();
/external/llvm/lib/Transforms/Utils/
H A DSimplifyCFG.cpp977 static bool isSafeToHoistInvoke(BasicBlock *BB1, BasicBlock *BB2, argument
984 Value *BB2V = PN->getIncomingValueForBlock(BB2);
994 /// BB2, hoist any common code in the two blocks up into the branch block. The
995 /// caller of this function guarantees that BI's block dominates BB1 and BB2.
999 // O(M*N) situations here where M and N are the sizes of BB1 and BB2. As
1003 BasicBlock *BB2 = BI->getSuccessor(1); // The false destination local
1006 BasicBlock::iterator BB2_Itr = BB2->begin();
1019 (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2)))
1058 if (isa<InvokeInst>(I1) && !isSafeToHoistInvoke(BB1, BB2, I1, I2))
1066 Value *BB2V = PN->getIncomingValueForBlock(BB2);
[all...]

Completed in 83 milliseconds