118   BasicBlock *DestBB = TI->getSuccessor(SuccNum);  in SplitKnownCriticalEdge()  local
122   if (DestBB->isEHPad()) return nullptr;  in SplitKnownCriticalEdge()
125       isa<UnreachableInst>(DestBB->getFirstNonPHIOrDbgOrLifetime()))  in SplitKnownCriticalEdge()
145       for (BasicBlock *P : predecessors(DestBB)) {  in SplitKnownCriticalEdge()
173                                                      DestBB->getName() +  in SplitKnownCriticalEdge()
176   BranchInst *NewBI = BranchInst::Create(DestBB, NewBB);  in SplitKnownCriticalEdge()
191     for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {  in SplitKnownCriticalEdge()
213       if (TI->getSuccessor(i) != DestBB) continue;  in SplitKnownCriticalEdge()
216       DestBB->removePredecessor(TIBB, Options.KeepOneInputPHIs);  in SplitKnownCriticalEdge()
229         DestBB, NewBB, {TIBB}, Options.MergeIdenticalEdges);  in SplitKnownCriticalEdge()
246     Updates.push_back({DominatorTree::Insert, NewBB, DestBB});  in SplitKnownCriticalEdge()
247     if (!llvm::is_contained(successors(TIBB), DestBB))  in SplitKnownCriticalEdge()
248       Updates.push_back({DominatorTree::Delete, TIBB, DestBB});  in SplitKnownCriticalEdge()
261       if (Loop *DestLoop = LI->getLoopFor(DestBB)) {  in SplitKnownCriticalEdge()
276           assert(DestLoop->getHeader() == DestBB &&  in SplitKnownCriticalEdge()
285       if (!TIL->contains(DestBB)) {  in SplitKnownCriticalEdge()
291           createPHIsForSplitLoopExit(TIBB, NewBB, DestBB);  in SplitKnownCriticalEdge()
295           assert(!DestBB->isEHPad() && "We don't split edges to EH pads!");  in SplitKnownCriticalEdge()
297               DestBB, LoopPreds, "split", DT, LI, MSSAU, Options.PreserveLCSSA);  in SplitKnownCriticalEdge()
299             createPHIsForSplitLoopExit(LoopPreds, NewExitBB, DestBB);  in SplitKnownCriticalEdge()