Transforms/Utils/SimplifyCFG.cpp

568     // predecessors unless there is only one predecessor.
860 /// See if any of the predecessors of the terminator block are value comparisons
1237 /// check whether BBEnd has only two predecessors and the other predecessor
1239 /// in the two predecessors to BBEnd.
1245   // Check that BBEnd has two predecessors and the other predecessor ends with
1252   if (PI != PE) // More than two predecessors.
1762     // The dest block might have PHI nodes, other predecessors and other
2444   for (BasicBlock *PredBB : predecessors(Succ))
2692     // Otherwise, if there are multiple predecessors, insert a PHI that merges
2746   // predecessors are a conditional branch to one of our destinations,
2826   // BI may have other predecessors.  Because of this, we leave
3333     // predecessors.
3338   // Delete the resume block if all its predecessors have been removed.
3398   // be certain that UnwindDest and BB have no common predecessors (since they
3419       // predecessors must unwind to these blocks, and since no instruction
3440         // predecessors with this value.
3441         for (auto *pred : predecessors(BB)) {
3461       // Any predecessors to UnwindDest which are not already represented
3464       for (auto *pred : predecessors(UnwindDest))
3491   // Find predecessors that end with branches.
3514     // If we eliminated all predecessors of the block, delete the block now.
3579       // all the predecessors of this block will be the unwind edges of Invokes,
3591   // at all of the predecessors of this instruction, and simplify them.
3653           SmallVector<BasicBlock *, 8> EHPreds(predecessors(CatchSwitchBB));
4964   for (BasicBlock *OtherPred : predecessors(Succ)) {
5054   for (auto *P : predecessors(BB)) {
5230   // Remove basic blocks that have no predecessors (except the entry block)...