174 static void AddInputs(HBasicBlock* block,  in AddInputs()  argument
178   for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {  in AddInputs()
181   for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {  in AddInputs()
216       HBasicBlock* block = user->GetBlock();  in FindIdealPosition()  local
220         block = user->AsPhi()->IsCatchPhi()  in FindIdealPosition()
221             ? block->GetDominator()  in FindIdealPosition()
222             : block->GetPredecessors()[use.GetIndex()];  in FindIdealPosition()
224       finder.Update(block);  in FindIdealPosition()
346   for (HBasicBlock* block : graph_->GetPostOrder()) {  in SinkCodeToUncommonBranch()
347     if (block == end_block) {  in SinkCodeToUncommonBranch()
349       post_dominated.SetBit(block->GetBlockId());  in SinkCodeToUncommonBranch()
352       DCHECK_NE(block, graph_->GetExitBlock())  in SinkCodeToUncommonBranch()
381           block->EndsWithTryBoundary() && block->GetLastInstruction()->AsTryBoundary()->IsEntry();  in SinkCodeToUncommonBranch()
383           ends_with_try_boundary_entry ? block->GetNormalSuccessors() :  in SinkCodeToUncommonBranch()
384                                          ArrayRef<HBasicBlock* const>(block->GetSuccessors());  in SinkCodeToUncommonBranch()
392         post_dominated.SetBit(block->GetBlockId());  in SinkCodeToUncommonBranch()
503   for (HBasicBlock* block : graph_->GetPostOrder()) {  in SinkCodeToUncommonBranch()
504     const int block_id = block->GetBlockId();  in SinkCodeToUncommonBranch()
509               [&block](HInstruction* a, HInstruction* b) {  in SinkCodeToUncommonBranch()
510                 return block->GetInstructions().FoundBefore(b, a);  in SinkCodeToUncommonBranch()