70       for (size_t j = 0; j < block->GetSuccessors().Size(); ++j) {  in RemoveDeadBlocks()
71         block->GetSuccessors().Get(j)->RemovePredecessor(block);  in RemoveDeadBlocks()
88   for (size_t i = 0; i < block->GetSuccessors().Size(); i++) {  in VisitBlockForBackEdges()
89     HBasicBlock* successor = block->GetSuccessors().Get(i);  in VisitBlockForBackEdges()
140   for (size_t i = 0; i < entry_block_->GetSuccessors().Size(); i++) {  in ComputeDominanceInformation()
141     VisitBlockForDominatorTree(entry_block_->GetSuccessors().Get(i), entry_block_, &visits);  in ComputeDominanceInformation()
179     for (size_t i = 0; i < block->GetSuccessors().Size(); i++) {  in VisitBlockForDominatorTree()
180       VisitBlockForDominatorTree(block->GetSuccessors().Get(i), block, visits);  in VisitBlockForDominatorTree()
265     if (block->GetSuccessors().Size() > 1) {  in SimplifyCFG()
266       for (size_t j = 0; j < block->GetSuccessors().Size(); ++j) {  in SimplifyCFG()
267         HBasicBlock* successor = block->GetSuccessors().Get(j);  in SimplifyCFG()
939   for (size_t i = 0, e = GetSuccessors().Size(); i < e; ++i) {  in SplitAfter()
940     HBasicBlock* successor = GetSuccessors().Get(i);  in SplitAfter()
1043     if (predecessor->GetSuccessors().Size() == 1u) {  in DisconnectAndDelete()
1050       DCHECK_EQ(predecessor->GetSuccessors().Size(), 0u);  in DisconnectAndDelete()
1096   DCHECK_EQ(GetSuccessors().Size(), 1u);  in MergeWith()
1097   DCHECK_EQ(GetSuccessors().Get(0), other);  in MergeWith()
1146   DCHECK(GetSuccessors().IsEmpty());  in MergeWithInlined()
1180   while (!GetSuccessors().IsEmpty()) {  in ReplaceWith()
1181     HBasicBlock* successor = GetSuccessors().Get(0);  in ReplaceWith()
1208   DCHECK(block->GetSuccessors().IsEmpty());  in DeleteDeadBlock()
1254     HBasicBlock* first = entry_block_->GetSuccessors().Get(0);  in InlineInto()