272   static bool EarlyExit(HBasicBlock* block, HLoopInformation* loop_info) {  in EarlyExit()  argument
273     DCHECK(loop_info->Contains(*block));  in EarlyExit()
274     if (block == loop_info->GetHeader()) {  in EarlyExit()
278     const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors();  in EarlyExit()
288   static bool DominatesAllBackEdges(HBasicBlock* block, HLoopInformation* loop_info) {  in DominatesAllBackEdges()  argument
291       if (!block->Dominates(back_edge)) {  in DominatesAllBackEdges()
301     HBasicBlock* block = it_loop.Current();  in Run()  local
302     DCHECK(block == induction_variable_->GetBlock());  in Run()
307       block = it_loop.Current();  in Run()
308       DCHECK(block->IsInLoop());  in Run()
309       if (!DominatesAllBackEdges(block, loop_info)) {  in Run()
316       if (EarlyExit(block, loop_info)) {  in Run()
325       for (HInstruction* instruction = block->GetFirstInstruction();  in Run()
1108   bool IsAddedBlock(HBasicBlock* block) const {  in IsAddedBlock()
1109     return block->GetBlockId() >= initial_block_size_;  in IsAddedBlock()
1116   void VisitBasicBlock(HBasicBlock* block) OVERRIDE {  in VisitBasicBlock()  argument
1117     DCHECK(!IsAddedBlock(block));  in VisitBasicBlock()
1119     HGraphVisitor::VisitBasicBlock(block);  in VisitBasicBlock()
1121       AddComparesWithDeoptimization(block);  in VisitBasicBlock()
1124       GetValueRangeMap(block)->clear();  in VisitBasicBlock()
1125       HGraphVisitor::VisitBasicBlock(block);  in VisitBasicBlock()
1255     HBasicBlock* block = instruction->GetBlock();  in HandleIf()  local
1265     ValueRange* left_range = LookupValueRange(left, block);  in HandleIf()
1288       ValueRange* right_range = LookupValueRange(right, block);  in HandleIf()
1312             block == left_monotonic_range->GetLoopHeader() &&  in HandleIf()
1313             instruction->IfFalseSuccessor()->GetLoopInformation() == block->GetLoopInformation()) {  in HandleIf()
1327         ApplyRangeFromComparison(left, block, true_successor, new_range);  in HandleIf()
1339         ApplyRangeFromComparison(left, block, false_successor, new_range);  in HandleIf()
1346             block == left_monotonic_range->GetLoopHeader() &&  in HandleIf()
1347             instruction->IfFalseSuccessor()->GetLoopInformation() == block->GetLoopInformation()) {  in HandleIf()
1362         ApplyRangeFromComparison(left, block, true_successor, new_range);  in HandleIf()
1373         ApplyRangeFromComparison(left, block, false_successor, new_range);  in HandleIf()
1379     HBasicBlock* block = bounds_check->GetBlock();  in VisitBoundsCheck()  local
1394       ValueRange* index_range = LookupValueRange(index, block);  in VisitBoundsCheck()
1419       ValueRange* existing_range = LookupValueRange(array_length, block);  in VisitBoundsCheck()
1457       GetValueRangeMap(block)->Overwrite(array_length->GetId(), range);  in VisitBoundsCheck()
1539         HBasicBlock* block = instruction->GetBlock();  in VisitIf()  local
1540         ValueRange* left_range = LookupValueRange(left, block);  in VisitIf()
1546             block == left_range->AsMonotonicValueRange()->GetLoopHeader()) {  in VisitIf()
1758                                     HBasicBlock* block) {  in AddCompareWithDeoptimization()  argument
1760     ValueRange* range = LookupValueRange(array_length, block);  in AddCompareWithDeoptimization()
1774     block->InsertInstructionBefore(cond, bounds_check);  in AddCompareWithDeoptimization()
1775     block->InsertInstructionBefore(deoptimize, bounds_check);  in AddCompareWithDeoptimization()
1779   void AddComparesWithDeoptimization(HBasicBlock* block) {  in AddComparesWithDeoptimization()  argument
1801         if (user->GetBlock() == block &&  in AddComparesWithDeoptimization()
1815         AddCompareWithDeoptimization(array_length, lower_bound_const_instr, block);  in AddComparesWithDeoptimization()