/art/compiler/optimizing/ |
D | escape.cc | 63 (user->IsInstanceFieldSet() && (reference == user->InputAt(1))) || in CalculateEscape() 64 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(1))) || in CalculateEscape() 65 (user->IsStaticFieldSet() && (reference == user->InputAt(1))) || in CalculateEscape() 66 (user->IsUnresolvedStaticFieldSet() && (reference == user->InputAt(0))) || in CalculateEscape() 67 (user->IsArraySet() && (reference == user->InputAt(2)))) { in CalculateEscape() 74 } else if ((user->IsUnresolvedInstanceFieldGet() && (reference == user->InputAt(0))) || in CalculateEscape() 75 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(0)))) { in CalculateEscape()
|
D | induction_var_analysis.cc | 125 HInstruction* if_expr = ifs->InputAt(0); in IsGuardedBy() 130 if (if_expr->InputAt(0) == a && if_expr->InputAt(1) == b) { in IsGuardedBy() 132 } else if (if_expr->InputAt(1) == a && if_expr->InputAt(0) == b) { in IsGuardedBy() 150 use.GetUser()->InputAt(1) == instruction) { in FindFirstLoopHeaderPhiUse() 361 info = TransferAddSub(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial() 362 LookupInfo(loop, instruction->InputAt(1)), kAdd); in ClassifyTrivial() 364 info = TransferAddSub(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial() 365 LookupInfo(loop, instruction->InputAt(1)), kSub); in ClassifyTrivial() 367 info = TransferNeg(LookupInfo(loop, instruction->InputAt(0))); in ClassifyTrivial() 369 info = TransferMul(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial() [all …]
|
D | dead_code_elimination.cc | 48 HInstruction* condition = if_instruction->InputAt(0); in MarkReachableBlocks() 61 HInstruction* switch_input = switch_instruction->InputAt(0); in MarkReachableBlocks() 104 return (instruction->InputAt(0) == input) || in HasInput() 105 (instruction->InputAt(1) == input); in HasInput() 165 HInstruction* cond = ifs->InputAt(0); in RemoveNonNullControlDependences() 175 HInstruction* obj = cond->InputAt(1); in RemoveNonNullControlDependences() 177 obj = cond->InputAt(0); in RemoveNonNullControlDependences() 178 } else if (!cond->InputAt(0)->IsNullConstant()) { in RemoveNonNullControlDependences() 332 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs() 338 (last->InputAt(0) == first) && in SimplifyIfs() [all …]
|
D | x86_memory_gen.cc | 36 HArrayLength* array_len = check->InputAt(1)->AsArrayLength(); in VisitBoundsCheck() 43 HInstruction* array = array_len->InputAt(0); in VisitBoundsCheck() 47 if (array->IsConstant() || (array->IsNullCheck() && array->InputAt(0)->IsConstant())) { in VisitBoundsCheck()
|
D | instruction_simplifier_shared.h | 35 return (instruction->IsShl() && instruction->AsShl()->InputAt(1)->IsIntConstant()) || in CanFitInShifterOperand() 36 (instruction->IsShr() && instruction->AsShr()->InputAt(1)->IsIntConstant()) || in CanFitInShifterOperand() 37 (instruction->IsUShr() && instruction->AsUShr()->InputAt(1)->IsIntConstant()); in CanFitInShifterOperand()
|
D | instruction_simplifier.cc | 231 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring() 232 HInstruction* src_right = right->InputAt(0); in TryDeMorganNegationFactoring() 406 DataType::Type source_type = shift_amount->InputAt(0)->GetType(); in VisitShift() 521 if (neg->InputAt(0) == (neg_is_left ? ushr->GetRight() : shl->GetRight())) { in TryReplaceWithRotateRegisterNegPattern() 559 HInstruction* obj = null_check->InputAt(0); in VisitNullCheck() 621 HInstruction* object = check_cast->InputAt(0); in VisitCheckCast() 662 HInstruction* object = instruction->InputAt(0); in VisitInstanceOf() 727 HInstruction *lhs = cond->InputAt(0); in GetOppositeConditionSwapOps() 728 HInstruction *rhs = cond->InputAt(1); in GetOppositeConditionSwapOps() 821 HInstruction* input = bool_not->InputAt(0); in VisitBooleanNot() [all …]
|
D | induction_var_range_test.cc | 762 HInstruction* phi = condition_->InputAt(0); in TEST_F() 790 ExpectInt(1000, last->InputAt(0)); in TEST_F() 791 ExpectInt(0, last->InputAt(1)); in TEST_F() 814 HInstruction* phi = condition_->InputAt(0); in TEST_F() 842 ExpectInt(1000, last->InputAt(0)); in TEST_F() 843 ASSERT_TRUE(last->InputAt(1)->IsNeg()); in TEST_F() 844 last = last->InputAt(1)->InputAt(0); in TEST_F() 846 ExpectInt(0, last->InputAt(0)); in TEST_F() 847 ExpectInt(1000, last->InputAt(1)); in TEST_F() 859 last = tce->InputAt(0); in TEST_F() [all …]
|
D | load_store_analysis.h | 227 ref = ref->InputAt(0); in HuntForOriginalReference() 256 HInstruction* array = instruction->InputAt(0); in GetArrayHeapLocation() 257 HInstruction* index = instruction->InputAt(1); in GetArrayHeapLocation() 496 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitInstanceFieldGet() 501 HeapLocation* location = VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitInstanceFieldSet() 527 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitStaticFieldGet() 532 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitStaticFieldSet() 540 HInstruction* array = instruction->InputAt(0); in VisitArrayGet() 541 HInstruction* index = instruction->InputAt(1); in VisitArrayGet() 548 HInstruction* array = instruction->InputAt(0); in VisitArraySet() [all …]
|
D | select_generator.cc | 82 if (phi->InputAt(index1) != phi->InputAt(index2)) { in GetSingleChangedPhi() 147 true_value = true_block->GetFirstInstruction()->InputAt(0); in Run() 148 false_value = false_block->GetFirstInstruction()->InputAt(0); in Run() 150 true_value = phi->InputAt(predecessor_index_true); in Run() 151 false_value = phi->InputAt(predecessor_index_false); in Run() 158 HInstruction* condition = if_instruction->InputAt(0); in Run()
|
D | constructor_fence_redundancy_elimination.cc | 50 candidate_fence_targets_.insert(constructor_fence->InputAt(input_idx)); in VisitConstructorFence() 67 HInstruction* value = instruction->InputAt(1); in VisitInstanceFieldSet() 72 HInstruction* value = instruction->InputAt(1); in VisitStaticFieldSet() 77 HInstruction* value = instruction->InputAt(2); in VisitArraySet() 177 if (IsInterestingPublishTarget(inst->InputAt(input_count))) { in HasInterestingPublishTargetAsInput()
|
D | instruction_simplifier_arm64.cc | 104 left = use->InputAt(0); in TryMergeIntoShifterOperand() 105 right = use->InputAt(1); in TryMergeIntoShifterOperand() 108 right = use->AsNeg()->InputAt(0); in TryMergeIntoShifterOperand() 144 bitfield_op->InputAt(0), in TryMergeIntoShifterOperand() 231 if (instruction->InputAt(1)->IsConstant()) { in VisitShl() 237 if (instruction->InputAt(1)->IsConstant()) { in VisitShr() 257 if (instruction->InputAt(1)->IsConstant()) { in VisitUShr()
|
D | reference_type_propagation.cc | 183 DCHECK(instr->GetReferenceTypeInfo().IsEqual(instr->InputAt(0)->GetReferenceTypeInfo())) in ValidateTypes() 185 << "Input(0) " << instr->InputAt(0)->GetReferenceTypeInfo(); in ValidateTypes() 297 BoundTypeIn(receiver->InputAt(0), start_block, start_instruction, class_rti); in BoundTypeIn() 308 HInstruction* compare = check->InputAt(0); in BoundTypeForClassCheck() 312 HInstruction* input_one = compare->InputAt(0); in BoundTypeForClassCheck() 313 HInstruction* input_two = compare->InputAt(1); in BoundTypeForClassCheck() 333 HInstruction* receiver = field_get->InputAt(0); in BoundTypeForClassCheck() 401 HInstruction* ifInput = ifInstruction->InputAt(0); in BoundTypeForIfNotNull() 405 HInstruction* input0 = ifInput->InputAt(0); in BoundTypeForIfNotNull() 406 HInstruction* input1 = ifInput->InputAt(1); in BoundTypeForIfNotNull() [all …]
|
D | loop_optimization.cc | 133 HInstruction* conv = instruction->InputAt(0); in IsSignExtensionAndGet() 148 IsZeroExtensionAndGet(instruction->InputAt(0), type, /*out*/ operand); in IsSignExtensionAndGet() 198 HInstruction* conv = instruction->InputAt(0); in IsZeroExtensionAndGet() 211 IsSignExtensionAndGet(instruction->InputAt(0), type, /*out*/ operand); in IsZeroExtensionAndGet() 282 return IsAddConst(instruction->InputAt(0), a, b, c, depth - 1) && in IsAddConst() 283 IsAddConst(instruction->InputAt(1), a, b, c, depth - 1); in IsAddConst() 285 IsInt64AndGet(instruction->InputAt(1), &value)) { in IsAddConst() 287 return IsAddConst(instruction->InputAt(0), a, b, c, depth - 1); in IsAddConst() 328 *a = instruction->InputAt(0); in IsSubConst2() 329 *b = instruction->InputAt(1); in IsSubConst2() [all …]
|
D | instruction_simplifier_arm.cc | 95 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand() 96 HInstruction* right = use->InputAt(1); in TryMergeIntoShifterOperand() 140 bitfield_op->InputAt(0), in TryMergeIntoShifterOperand() 260 if (instruction->InputAt(1)->IsConstant()) { in VisitShl() 266 if (instruction->InputAt(1)->IsConstant()) { in VisitShr() 286 if (instruction->InputAt(1)->IsConstant()) { in VisitUShr()
|
D | induction_var_analysis_test.cc | 264 EXPECT_STREQ("((1) * i + (0)):Int32", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F() 268 EXPECT_FALSE(HaveSameInduction(store->InputAt(1), increment_[0])); in TEST_F() 328 GetInductionInfo(store1->InputAt(1), 0).c_str()); in TEST_F() 330 GetInductionInfo(store2->InputAt(1), 0).c_str()); in TEST_F() 363 EXPECT_STREQ("((1) * i + (1)):Int32", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F() 366 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F() 367 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F() 394 EXPECT_STREQ("((1) * i + (1)):Int32", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F() 397 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F() 398 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F() [all …]
|
D | intrinsics.cc | 197 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfLocations() 198 int32_t value = invoke->InputAt(0)->AsIntConstant()->GetValue(); in ComputeIntegerValueOfLocations() 225 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfLocations() 226 int32_t value = invoke->InputAt(0)->AsIntConstant()->GetValue(); in ComputeIntegerValueOfLocations() 248 locations->SetInAt(0, Location::RegisterOrConstant(invoke->InputAt(0))); in ComputeIntegerValueOfLocations() 252 locations->SetInAt(0, Location::ConstantLocation(invoke->InputAt(0)->AsConstant())); in ComputeIntegerValueOfLocations() 309 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfInfo() 310 int32_t input_value = invoke->InputAt(0)->AsIntConstant()->GetValue(); in ComputeIntegerValueOfInfo() 345 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfInfo() 346 int32_t input_value = invoke->InputAt(0)->AsIntConstant()->GetValue(); in ComputeIntegerValueOfInfo()
|
D | code_sinking.cc | 92 if (!instruction->InputAt(0)->IsNewInstance()) { in IsInterestingInstruction() 98 if (!instruction->InputAt(0)->IsNewArray()) { in IsInterestingInstruction() 161 (user->InputAt(0) == instruction) && in ShouldFilterUse() 165 (user->InputAt(0) == instruction) && in ShouldFilterUse() 245 HInstruction* if_input = insert_pos->AsIf()->InputAt(0); in FindIdealPosition() 408 if (!instructions_that_can_move.IsBitSet(instruction->InputAt(0)->GetId())) { in SinkCodeToUncommonBranch() 417 position = FindIdealPosition(instruction->InputAt(0), post_dominated, /* filter= */ true); in SinkCodeToUncommonBranch()
|
D | prepare_for_register_allocation.cc | 53 check->ReplaceWith(check->InputAt(0)); in VisitNullCheck() 63 if (next->CanDoImplicitNullCheckOn(check->InputAt(0))) { in VisitNullCheck() 70 check->ReplaceWith(check->InputAt(0)); in VisitDivZeroCheck() 82 check->ReplaceWith(check->InputAt(0)); in VisitBoundsCheck() 100 bound_type->ReplaceWith(bound_type->InputAt(0)); in VisitBoundType()
|
D | constant_folding_test.cc | 125 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 186 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 247 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 326 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 397 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 460 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 524 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F() 624 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0); in TEST_F() 709 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
|
D | nodes_mips.h | 111 HInstruction* GetIndex() const { return InputAt(0); } in GetIndex() 112 HInstruction* GetShift() const { return InputAt(1); } in GetShift()
|
D | pc_relative_fixups_x86.cc | 65 HConstant* value = ret->InputAt(0)->AsConstant(); in VisitReturn() 98 HConstant* rhs = bin->InputAt(1)->AsConstant(); in BinaryFP() 136 neg->InputAt(0), in VisitNeg() 156 switch_insn->InputAt(0), in VisitPackedSwitch()
|
D | nodes_x86.h | 55 return InputAt(0)->AsX86ComputeBaseMethodAddress(); in GetBaseMethodAddress() 59 return InputAt(1)->AsConstant(); in GetConstant() 82 return InputAt(1)->AsX86ComputeBaseMethodAddress(); in GetBaseMethodAddress() 113 return InputAt(1)->AsX86ComputeBaseMethodAddress(); in GetBaseMethodAddress()
|
D | bounds_check_elimination.cc | 825 HInstruction* index = bounds_check->InputAt(0); in VisitBoundsCheck() 826 HInstruction* array_length = bounds_check->InputAt(1); in VisitBoundsCheck() 954 HInstruction* instruction = phi->InputAt(1); in VisitPhi() 959 HInstruction* initial_value = phi->InputAt(0); in VisitPhi() 998 if (instruction->InputAt(0)->IsCondition()) { in VisitIf() 999 HCondition* cond = instruction->InputAt(0)->AsCondition(); in VisitIf() 1186 right = right->AsDivZeroCheck()->InputAt(0); in VisitRem() 1248 if (loop->IsDefinedOutOfTheLoop(array_get->InputAt(0)) && in VisitArrayGet() 1249 loop->IsDefinedOutOfTheLoop(array_get->InputAt(1))) { in VisitArrayGet() 1301 HInstruction* index = bounds_check->InputAt(0); in AddComparesWithDeoptimization() [all …]
|
D | common_arm.h | 118 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputSRegisterAt() 124 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputDRegisterAt() 130 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputVRegisterAt() 150 instr->InputAt(input_index)->GetType()); in InputRegisterAt() 209 instr->InputAt(input_index)->GetType()); in InputOperandAt()
|
D | load_store_elimination.cc | 521 if ((prev != nullptr) && prev->IsNullCheck() && (prev == instruction->InputAt(0))) { in TryRemovingNullCheck() 523 prev->ReplaceWith(prev->InputAt(0)); in TryRemovingNullCheck() 660 HInstruction* object = instruction->InputAt(0); in VisitInstanceFieldGet() 666 HInstruction* object = instruction->InputAt(0); in VisitInstanceFieldSet() 668 HInstruction* value = instruction->InputAt(1); in VisitInstanceFieldSet() 674 HInstruction* cls = instruction->InputAt(0); in VisitStaticFieldGet() 680 HInstruction* cls = instruction->InputAt(0); in VisitStaticFieldSet() 683 VisitSetLocation(instruction, idx, instruction->InputAt(1)); in VisitStaticFieldSet() 692 VisitSetLocation(instruction, idx, instruction->InputAt(2)); in VisitArraySet() 707 HInstruction* reference = heap_value->InputAt(0); in VisitDeoptimize()
|