1614       for (BasicBlock *PredBB : predecessors(BB)) {  in buildClonedLoops()
1617         if (!UnloopedBlockSet.erase(PredBB)) {  in buildClonedLoops()
1619               (BlocksInClonedLoop.count(PredBB) || ExitLoopMap.count(PredBB)) &&  in buildClonedLoops()
1627         bool Inserted = ExitLoopMap.insert({PredBB, ExitL}).second;  in buildClonedLoops()
1632         Worklist.push_back(PredBB);  in buildClonedLoops()
2024       for (BasicBlock *PredBB : predecessors(BB)) {  in rebuildLoopAfterUnswitch()
2027         if (!UnloopedBlocks.erase(PredBB)) {  in rebuildLoopAfterUnswitch()
2028           assert((NewExitLoopBlocks.count(PredBB) ||  in rebuildLoopAfterUnswitch()
2029                   ExitL.contains(LI.getLoopFor(PredBB))) &&  in rebuildLoopAfterUnswitch()
2037         bool Inserted = NewExitLoopBlocks.insert(PredBB).second;  in rebuildLoopAfterUnswitch()
2042         Worklist.push_back(PredBB);  in rebuildLoopAfterUnswitch()
2302         llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {  in unswitchNontrivialInvariants()  argument
2303           return PredBB == ParentBB || DT.dominates(SuccBB, PredBB);  in unswitchNontrivialInvariants()
3418           llvm::all_of(predecessors(SuccBB), [&](BasicBlock *PredBB) {  in findBestNonTrivialUnswitchCandidate()  argument
3419             return PredBB == &BB || DT.dominates(SuccBB, PredBB);  in findBestNonTrivialUnswitchCandidate()