HomeSort by: relevance | last modified time | path
    Searched refs:IfFalseBB (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
GuardUtils.h 45 BasicBlock *&IfFalseBB);
50 BasicBlock *&IfFalseBB);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
GuardUtils.cpp 46 BasicBlock *&IfTrueBB, BasicBlock *&IfFalseBB) {
49 if (parseWidenableBranch(const_cast<User*>(U), C, WC, IfTrueBB, IfFalseBB)) {
61 BasicBlock *&IfTrueBB, BasicBlock *&IfFalseBB) {
71 IfFalseBB = BI->getSuccessor(1);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
GuardUtils.cpp 91 BasicBlock *IfTrueBB, *IfFalseBB;
92 parseWidenableBranch(WidenableBR, C, WC, IfTrueBB, IfFalseBB);
112 BasicBlock *IfTrueBB, *IfFalseBB;
113 parseWidenableBranch(WidenableBR, C, WC, IfTrueBB, IfFalseBB);
SimplifyCFG.cpp 3618 // 1) We can allow phi nodes in IfFalseBB and simply reuse all the input
3624 BasicBlock *IfTrueBB, *IfFalseBB;
3625 if (!parseWidenableBranch(PBI, CondWB, WC, IfTrueBB, IfFalseBB) ||
3628 if (!IfFalseBB->phis().empty())
3636 if (BI->getSuccessor(1) != IfFalseBB && // no inf looping
3641 BI->setSuccessor(1, IfFalseBB);
3644 {{DominatorTree::Insert, BI->getParent(), IfFalseBB},
3648 if (BI->getSuccessor(0) != IfFalseBB && // no inf looping
3653 BI->setSuccessor(0, IfFalseBB);
3656 {{DominatorTree::Insert, BI->getParent(), IfFalseBB},
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopPredication.cpp 993 BasicBlock *IfTrueBB, *IfFalseBB;
994 if (parseWidenableBranch(Term, Cond, WC, IfTrueBB, IfFalseBB) &&
1086 BasicBlock *IfTrueBB, *IfFalseBB;
1087 if (parseWidenableBranch(BI, Cond, WC, IfTrueBB, IfFalseBB) &&
GuardWidening.cpp 88 BasicBlock *IfTrueBB, *IfFalseBB;
89 if (parseWidenableBranch(I, Cond, WC, IfTrueBB, IfFalseBB))

Completed in 22 milliseconds