43   HBasicBlock* exit = graph_->GetExitBlock();  in UncommonBranchSinking()  local
44   DCHECK(exit != nullptr);  in UncommonBranchSinking()
47   for (HBasicBlock* exit_predecessor : exit->GetPredecessors()) {  in UncommonBranchSinking()
542   HBasicBlock* exit = graph_->GetExitBlock();  in ReturnSinking()  local
543   DCHECK(exit != nullptr);  in ReturnSinking()
547   for (HBasicBlock* pred : exit->GetPredecessors()) {  in ReturnSinking()
564   HBasicBlock* new_block = new (graph_->GetAllocator()) HBasicBlock(graph_, exit->GetDexPc());  in ReturnSinking()
567     for (size_t i = 0; i < exit->GetPredecessors().size(); /*++i in loop*/) {  in ReturnSinking()
568       HBasicBlock* pred = exit->GetPredecessors()[i];  in ReturnSinking()
587       pred->ReplaceSuccessor(exit, new_block);  in ReturnSinking()
590     new_block->AddInstruction(new (graph_->GetAllocator()) HReturn(new_phi, exit->GetDexPc()));  in ReturnSinking()
592     for (size_t i = 0; i < exit->GetPredecessors().size(); /*++i in loop*/) {  in ReturnSinking()
593       HBasicBlock* pred = exit->GetPredecessors()[i];  in ReturnSinking()
602       pred->ReplaceSuccessor(exit, new_block);  in ReturnSinking()
605     new_block->AddInstruction(new (graph_->GetAllocator()) HReturnVoid(exit->GetDexPc()));  in ReturnSinking()
608   new_block->AddSuccessor(exit);  in ReturnSinking()