826     HInstruction* array_length = bounds_check->InputAt(1);  in VisitBoundsCheck()  local
827     DCHECK(array_length->IsIntConstant() ||  in VisitBoundsCheck()
828            array_length->IsArrayLength() ||  in VisitBoundsCheck()
829            array_length->IsPhi());  in VisitBoundsCheck()
835       ValueBound upper = ValueBound(array_length, -1);  // array_length - 1  in VisitBoundsCheck()
846           ValueRange* existing_range = LookupValueRange(array_length, block);  in VisitBoundsCheck()
871       } else if (array_length->IsIntConstant()) {  in VisitBoundsCheck()
872         if (constant < array_length->AsIntConstant()->GetValue()) {  in VisitBoundsCheck()
878       DCHECK(array_length->IsArrayLength());  in VisitBoundsCheck()
879       ValueRange* existing_range = LookupValueRange(array_length, block);  in VisitBoundsCheck()
902         AssignRange(block, array_length, range);  in VisitBoundsCheck()
917           CanHandleLength(loop, array_length, needs_taken_test)) {  in VisitBoundsCheck()
923       if (first_index_bounds_check_map_.find(array_length->GetId()) ==  in VisitBoundsCheck()
928         first_index_bounds_check_map_.Put(array_length->GetId(), bounds_check);  in VisitBoundsCheck()
1147       HInstruction* array_length = left->AsArrayLength();  in VisitSub()  local
1155           if (ValueBound::Equal(array_length, upper_inst)) {  in VisitSub()
1168                     ValueBound(array_length, right_const - lower.GetConstant()));  in VisitSub()
1365                                     HInstruction* array_length,  in AddCompareWithDeoptimization()  argument
1369         first_index_bounds_check_map_.Get(array_length->GetId())->AsBoundsCheck();  in AddCompareWithDeoptimization()
1393         bounds_check, new (GetGraph()->GetAllocator()) HAboveOrEqual(upper, array_length));  in AddCompareWithDeoptimization()
1403       HInstruction* array_length = bounds_check->InputAt(1);  in AddComparesWithDeoptimization()  local
1404       if (!array_length->IsArrayLength()) {  in AddComparesWithDeoptimization()
1420       for (const HUseListNode<HInstruction*>& use : array_length->GetUses()) {  in AddComparesWithDeoptimization()
1429           if (array_length == other_array_length && base == other_value.GetInstruction()) {  in AddComparesWithDeoptimization()
1431             if (array_length == other_index) {  in AddComparesWithDeoptimization()
1473         AddCompareWithDeoptimization(block, array_length, base, min_c, max_c);  in AddComparesWithDeoptimization()
1526     HInstruction* array_length = bounds_check->InputAt(1);  in TransformLoopForDynamicBCE()  local
1527     DCHECK(loop->IsDefinedOutOfTheLoop(array_length));  // pre-checked  in TransformLoopForDynamicBCE()
1539     for (const HUseListNode<HInstruction*>& use : array_length->GetUses()) {  in TransformLoopForDynamicBCE()
1547         if (array_length == other_array_length && base == other_value.GetInstruction()) {  in TransformLoopForDynamicBCE()
1645           loop, block, new (GetGraph()->GetAllocator()) HAboveOrEqual(max_upper, array_length));  in TransformLoopForDynamicBCE()