56       HBasicBlock* block = blocks_.Get(i);  in RemoveInstructionsAsUsersFromDeadBlocks()
68       HBasicBlock* block = blocks_.Get(i);  in RemoveDeadBlocks()
71         block->GetSuccessors().Get(j)->RemovePredecessor(block);  in RemoveDeadBlocks()
89     HBasicBlock* successor = block->GetSuccessors().Get(i);  in VisitBlockForBackEdges()
141     VisitBlockForDominatorTree(entry_block_->GetSuccessors().Get(i), entry_block_, &visits);  in ComputeDominanceInformation()
175   if (visits->Get(block->GetBlockId()) ==  in VisitBlockForDominatorTree()
180       VisitBlockForDominatorTree(block->GetSuccessors().Get(i), block, visits);  in VisitBlockForDominatorTree()
223       HBasicBlock* predecessor = header->GetPredecessors().Get(pred);  in SimplifyLoop()
233   if (info->IsBackEdge(*header->GetPredecessors().Get(0))) {  in SimplifyLoop()
234     HBasicBlock* to_swap = header->GetPredecessors().Get(0);  in SimplifyLoop()
236       HBasicBlock* predecessor = header->GetPredecessors().Get(pred);  in SimplifyLoop()
263     HBasicBlock* block = blocks_.Get(i);  in SimplifyCFG()
267         HBasicBlock* successor = block->GetSuccessors().Get(j);  in SimplifyCFG()
365     PopulateRecursive(block->GetPredecessors().Get(i));  in PopulateRecursive()
372     HBasicBlock* back_edge = GetBackEdges().Get(i);  in Populate()
393     HBasicBlock* block = graph->GetBlocks().Get(id);  in Update()
414         DCHECK(header_->Dominates(back_edges_.Get(i)));  in Update()
438     last_position = std::max(back_edges_.Get(i)->GetLifetimeEnd(), last_position);  in GetLifetimeEnd()
561     HInstruction* instruction = locals.Get(i);  in CopyFrom()
602   const HUserRecord<HEnvironment*> user_record = vregs_.Get(index);  in RemoveAsUserOfInput()
795     HBasicBlock* block = blocks.Get(i);  in FOR_EACH_INSTRUCTION()
940     HBasicBlock* successor = GetSuccessors().Get(i);  in SplitAfter()
947     HBasicBlock* dominated = GetDominatedBlocks().Get(i);  in SplitAfter()
1039     HBasicBlock* predecessor = predecessors_.Get(i);  in DisconnectAndDelete()
1057     HBasicBlock* successor = successors_.Get(i);  in DisconnectAndDelete()
1097   DCHECK_EQ(GetSuccessors().Get(0), other);  in MergeWith()
1099   DCHECK_EQ(other->GetPredecessors().Get(0), this);  in MergeWith()
1121     HBasicBlock* successor = other->successors_.Get(0);  in MergeWith()
1128     HBasicBlock* dominated = other->GetDominatedBlocks().Get(i);  in MergeWith()
1149   DCHECK(other->GetPredecessors().Get(0)->IsEntryBlock());  in MergeWithInlined()
1160     HBasicBlock* successor = other->successors_.Get(0);  in MergeWithInlined()
1166     HBasicBlock* dominated = other->GetDominatedBlocks().Get(i);  in MergeWithInlined()
1177     HBasicBlock* predecessor = GetPredecessors().Get(0);  in ReplaceWith()
1181     HBasicBlock* successor = GetSuccessors().Get(0);  in ReplaceWith()
1185     other->AddDominatedBlock(dominated_blocks_.Get(i));  in ReplaceWith()
1202     blocks->Put(j, blocks->Get(i));  in MakeRoomFor()
1228     HBasicBlock* body = GetBlocks().Get(1);  in InlineInto()
1229     DCHECK(GetBlocks().Get(0)->IsEntryBlock());  in InlineInto()
1230     DCHECK(GetBlocks().Get(2)->IsExitBlock());  in InlineInto()
1254     HBasicBlock* first = entry_block_->GetSuccessors().Get(0);  in InlineInto()
1262     bool returns_void = to->GetPredecessors().Get(0)->GetLastInstruction()->IsReturnVoid();  in InlineInto()
1264       HBasicBlock* predecessor = to->GetPredecessors().Get(0);  in InlineInto()
1279         HBasicBlock* predecessor = to->GetPredecessors().Get(i);  in InlineInto()
1310     while (outer_graph->reverse_post_order_.Get(index_of_at) != at) {  in InlineInto()
1444   while (reverse_post_order_.Get(index_of_header) != header) {  in TransformLoopHeaderForBCE()
1474      << " type=" << (rhs.IsTop() ? "?" : PrettyClass(rhs.GetTypeHandle().Get()))  in operator <<()