378   for (BasicBlock *Succ : successors(BB)) {  in removeNonFeasibleEdges()
379     if (Solver.isEdgeFeasible(BB, Succ))  in removeNonFeasibleEdges()
380       FeasibleSuccessors.insert(Succ);  in removeNonFeasibleEdges()
399     for (BasicBlock *Succ : successors(BB)) {  in removeNonFeasibleEdges()
400       Succ->removePredecessor(BB);  in removeNonFeasibleEdges()
401       if (SeenSuccs.insert(Succ).second)  in removeNonFeasibleEdges()
402         Updates.push_back({DominatorTree::Delete, BB, Succ});  in removeNonFeasibleEdges()
412     for (BasicBlock *Succ : successors(BB)) {  in removeNonFeasibleEdges()
413       if (Succ == OnlyFeasibleSuccessor && !HaveSeenOnlyFeasibleSuccessor) {  in removeNonFeasibleEdges()
420       Succ->removePredecessor(BB);  in removeNonFeasibleEdges()
421       Updates.push_back({DominatorTree::Delete, BB, Succ});  in removeNonFeasibleEdges()
453       BasicBlock *Succ = CI->getCaseSuccessor();  in removeNonFeasibleEdges()  local
454       Succ->removePredecessor(BB);  in removeNonFeasibleEdges()
455       Updates.push_back({DominatorTree::Delete, BB, Succ});  in removeNonFeasibleEdges()