HomeSort by relevance Sort by last modified time
    Searched refs:bounds_check (Results 1 - 5 of 5) sorted by null

  /art/compiler/optimizing/
bounds_check_elimination_test.cc 203 HBoundsCheck* bounds_check = new (&allocator_) local
206 null_check, bounds_check, constant_1, Primitive::kPrimInt, 0);
207 block3->AddInstruction(bounds_check);
221 ASSERT_FALSE(IsRemoved(bounds_check));
269 HBoundsCheck* bounds_check = new (&allocator_) local
272 null_check, bounds_check, constant_1, Primitive::kPrimInt, 0);
273 block3->AddInstruction(bounds_check);
287 ASSERT_FALSE(IsRemoved(bounds_check));
411 HInstruction* bounds_check = new (allocator) HBoundsCheck(phi, array_length, 0); local
413 null_check, bounds_check, constant_10, Primitive::kPrimInt, 0)
431 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, 0, 1); local
438 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, 1, 1); local
445 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, -1, 1); local
452 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, 0, 1, kCondGT); local
460 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, 0, 2); local
467 HInstruction* bounds_check = BuildSSAGraph1(graph_, &allocator_, 1, 2); local
528 HInstruction* bounds_check = new (allocator) HBoundsCheck(add, array_length, 0); local
548 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, 0); local
555 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, 1); local
562 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, -1); local
569 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, 0, -1, kCondLT); local
576 HInstruction* bounds_check = BuildSSAGraph2(graph_, &allocator_, 0, -2); local
637 HInstruction* bounds_check = new (allocator) HBoundsCheck(phi, array_length, 0); local
657 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 0, 1, kCondGE); local
665 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 1, 1, kCondGE); local
673 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 0, 1, kCondGT); local
681 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 1, 8, kCondGE); local
742 HInstruction* bounds_check = new (allocator) HBoundsCheck(add_minus_1, array_length, 0); local
763 HInstruction* bounds_check = BuildSSAGraph4(graph_, &allocator_, 0); local
770 HInstruction* bounds_check = BuildSSAGraph4(graph_, &allocator_, 1); local
777 HInstruction* bounds_check = BuildSSAGraph4(graph_, &allocator_, 0, kCondGT); local
    [all...]
bounds_check_elimination.cc 565 for (HBoundsCheck* bounds_check : dynamic_bce_standby_) {
566 if (bounds_check->IsInBlock()) {
567 TryDynamicBCE(bounds_check);
806 void VisitBoundsCheck(HBoundsCheck* bounds_check) OVERRIDE {
807 HBasicBlock* block = bounds_check->GetBlock();
808 HInstruction* index = bounds_check->InputAt(0);
809 HInstruction* array_length = bounds_check->InputAt(1);
824 ReplaceInstruction(bounds_check, index);
829 if (InductionRangeFitsIn(&array_range, bounds_check, index, &try_dynamic_bce)) {
830 ReplaceInstruction(bounds_check, index)
1172 HBoundsCheck* bounds_check = local
1198 HBoundsCheck* bounds_check = entry.second; local
    [all...]
  /external/v8/src/regexp/
jsregexp.cc 3252 bool bounds_check = *checked_up_to < cp_offset + j || read_backward(); local
    [all...]
  /external/v8/src/crankshaft/
hydrogen.cc 2590 HValue* bounds_check = negative_checker.If<HCompareNumericAndBranch>( local
8853 HValue* bounds_check = length_checker.If<HCompareNumericAndBranch>( local
    [all...]
hydrogen-instructions.h 4108 HBoundsCheck* bounds_check() { return HBoundsCheck::cast(OperandAt(1)); } function in class:final::final
    [all...]

Completed in 93 milliseconds