73     if (successors_visited[current_id] == current->GetSuccessors().size()) {  in FindBackEdges()
77       HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];  in FindBackEdges()
130       for (HBasicBlock* successor : block->GetSuccessors()) {  in RemoveDeadBlocks()
212   DCHECK(ContainsElement(block->GetSuccessors(), successor));  in UpdateDominatorOfSuccessor()
247     if (successors_visited[current_id] == current->GetSuccessors().size()) {  in ComputeDominanceInformation()
250       HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];  in ComputeDominanceInformation()
283         for (HBasicBlock* successor : block->GetSuccessors()) {  in ComputeDominanceInformation()
295       for (HBasicBlock* successor : block->GetSuccessors()) {  in ComputeDominanceInformation()
414     if (block->GetSuccessors().size() > 1) {  in SimplifyCFG()
1449   for (HBasicBlock* successor : GetSuccessors()) {  in SplitBefore()
1494   for (HBasicBlock* successor : GetSuccessors()) {  in SplitBeforeForInlining()
1521   for (HBasicBlock* successor : GetSuccessors()) {  in SplitAfterForInlining()
1787       while (predecessor->GetSuccessors().size() > 1) {  in DisconnectAndDelete()
1788         HBasicBlock* handler = predecessor->GetSuccessors()[1];  in DisconnectAndDelete()
1796     uint32_t num_pred_successors = predecessor->GetSuccessors().size();  in DisconnectAndDelete()
1871     HBasicBlock* successor = other->GetSuccessors()[0];  in MergeWith()
1895   DCHECK(GetSuccessors().empty());  in MergeWithInlined()
1908     HBasicBlock* successor = other->GetSuccessors()[0];  in MergeWithInlined()
1927   while (!GetSuccessors().empty()) {  in ReplaceWith()
1928     HBasicBlock* successor = GetSuccessors()[0];  in ReplaceWith()
1942   DCHECK(block->GetSuccessors().empty());  in DeleteDeadEmptyBlock()
2053     HBasicBlock* first = entry_block_->GetSuccessors()[0];  in InlineInto()