HomeSort by relevance Sort by last modified time
    Searched defs:BB2 (Results 1 - 6 of 6) sorted by null

  /external/llvm/unittests/IR/
DominatorTreeTest.cpp 44 BasicBlock *BB2 = FI++;
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, BB3))
    [all...]
InstructionsTest.cpp 89 BasicBlock *BB2 = BasicBlock::Create(Ctx, "", F);
94 std::unique_ptr<InvokeInst> Invoke(InvokeInst::Create(F, BB1, BB2, Args));
  /external/llvm/lib/Transforms/Scalar/
ConstantHoisting.cpp 249 BasicBlock *BB, *BB1, *BB2;
251 BB2 = *std::next(BBs.begin());
252 BB = DT->findNearestCommonDominator(BB1, BB2);
256 BBs.erase(BB2);
SampleProfile.cpp 196 /// 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;
633 bool IsDomParent = DomTree->dominates(BB2, BB1)
    [all...]
  /external/clang/lib/Analysis/
ThreadSafetyCommon.cpp 736 til::BasicBlock *BB2 = *It ? lookupBlock(*It) : nullptr;
738 unsigned Idx2 = BB2 ? BB2->findPredecessorIndex(CurrentBB) : 0;
739 til::SExpr *Tm = new (Arena) til::Branch(C, BB1, BB2, Idx1, Idx2);
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp     [all...]

Completed in 272 milliseconds