348         HArrayLength* array_length = length_value->AsArrayLength();  in Run()  local
350         HInstruction* array = array_length->InputAt(0);  in Run()
359         if (found_array_length_ != nullptr && found_array_length_ != array_length) {  in Run()
384         found_array_length_ = array_length;  in Run()
871                                        HArrayLength* array_length,  in CanAddDeoptimizationArrayLength()  argument
880     if (array_length->GetBlock() == header) {  in CanAddDeoptimizationArrayLength()
904     if (value == array_length) {  in CanAddDeoptimizationArrayLength()
921                                     HArrayLength* array_length,  in AddDeoptimizationArrayLength()  argument
937     if (!array_length->GetBlock()->Dominates(deopt_block)) {  in AddDeoptimizationArrayLength()
939       DCHECK(header->GetLoopInformation()->Contains(*array_length->GetBlock()));  in AddDeoptimizationArrayLength()
940       DCHECK(array_length->GetBlock() != header);  in AddDeoptimizationArrayLength()
942       HInstruction* array = array_length->InputAt(0);  in AddDeoptimizationArrayLength()
982         array_length->ReplaceWith(phi);  in AddDeoptimizationArrayLength()
993         array_length->ReplaceWith(new_array_length);  in AddDeoptimizationArrayLength()
996       array_length->GetBlock()->RemoveInstruction(array_length);  in AddDeoptimizationArrayLength()
998       array_length = new_array_length;  in AddDeoptimizationArrayLength()
1001     HInstruction* added = array_length;  in AddDeoptimizationArrayLength()
1004       added = new (graph->GetArena()) HAdd(Primitive::kPrimInt, array_length, offset_instr);  in AddDeoptimizationArrayLength()
1021     HArrayLength* array_length = finder.GetFoundArrayLength();  in AddDeoptimization()  local
1056                                         array_length,  in AddDeoptimization()
1075                                      array_length,  in AddDeoptimization()
1381     HInstruction* array_length = bounds_check->InputAt(1);  in VisitBoundsCheck()  local
1382     DCHECK(array_length->IsIntConstant() ||  in VisitBoundsCheck()
1383            array_length->IsArrayLength() ||  in VisitBoundsCheck()
1384            array_length->IsPhi());  in VisitBoundsCheck()
1386     if (array_length->IsPhi()) {  in VisitBoundsCheck()
1390       array_length = array_length->AsPhi()->InputAt(1)->AsArrayLength();  in VisitBoundsCheck()
1397         ValueBound upper = ValueBound(array_length, -1);  // array_length - 1  in VisitBoundsCheck()
1411       if (array_length->IsIntConstant()) {  in VisitBoundsCheck()
1412         if (constant < array_length->AsIntConstant()->GetValue()) {  in VisitBoundsCheck()
1418       DCHECK(array_length->IsArrayLength());  in VisitBoundsCheck()
1419       ValueRange* existing_range = LookupValueRange(array_length, block);  in VisitBoundsCheck()
1433       if (first_constant_index_bounds_check_map_.find(array_length->GetId()) ==  in VisitBoundsCheck()
1439         first_constant_index_bounds_check_map_.Put(array_length->GetId(), bounds_check);  in VisitBoundsCheck()
1457       GetValueRangeMap(block)->Overwrite(array_length->GetId(), range);  in VisitBoundsCheck()
1615       HInstruction* array_length = left->AsArrayLength();  in VisitSub()  local
1623           if (ValueBound::Equal(array_length, upper_inst)) {  in VisitSub()
1636                     ValueBound(array_length, right_const - lower.GetConstant()));  in VisitSub()
1756   void AddCompareWithDeoptimization(HInstruction* array_length,  in AddCompareWithDeoptimization()  argument
1759     DCHECK(array_length->IsArrayLength());  in AddCompareWithDeoptimization()
1760     ValueRange* range = LookupValueRange(array_length, block);  in AddCompareWithDeoptimization()
1770         array_length->GetId())->AsBoundsCheck();  in AddCompareWithDeoptimization()
1771     HCondition* cond = new (GetGraph()->GetArena()) HLessThanOrEqual(array_length, const_instr);  in AddCompareWithDeoptimization()
1785       HInstruction* array_length = bounds_check->InputAt(1);  in AddComparesWithDeoptimization()  local
1786       if (!array_length->IsArrayLength()) {  in AddComparesWithDeoptimization()
1789         DCHECK(array_length->IsPhi()) << array_length->DebugName();  in AddComparesWithDeoptimization()
1797       for (HUseIterator<HInstruction*> it2(array_length->GetUses());  in AddComparesWithDeoptimization()
1804           DCHECK_EQ(array_length, user->AsBoundsCheck()->InputAt(1));  in AddComparesWithDeoptimization()
1815         AddCompareWithDeoptimization(array_length, lower_bound_const_instr, block);  in AddComparesWithDeoptimization()