Home
last modified time | relevance | path

Searched refs:InputAt (Results 1 – 25 of 70) sorted by relevance

123

/aosp12/art/compiler/optimizing/
H A Dinduction_var_analysis.cc125 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()
446 loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kAdd, true); in ClassifyNonTrivial()
449 loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kSub, true); in ClassifyNonTrivial()
452 loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kMul); in ClassifyNonTrivial()
455 loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kDiv); in ClassifyNonTrivial()
458 loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kRem); in ClassifyNonTrivial()
471 loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kXor); in ClassifyNonTrivial()
711 if (phi->InputAt(1) == entry_phi) { in SolvePhiAllInputs()
[all …]
H A Dload_store_elimination_test.cc413 ins->InputAt(0)->InputAt(0)) in CheckFinalInstruction()
2692 EXPECT_INS_EQ(pred2->GetTarget()->InputAt(0)->InputAt(0), mat2); in TEST_P()
4023 EXPECT_INS_EQ(add_two->InputAt(0)->InputAt(0), c5); in TEST_F()
4024 EXPECT_INS_EQ(add_two->InputAt(0)->InputAt(1), c0); in TEST_F()
5051 EXPECT_INS_EQ(partial_set->InputAt(0), init_set->InputAt(0)); in TEST_P()
5181 EXPECT_INS_EQ(write_partial->InputAt(0)->AsPhi()->InputAt(0), init_set->InputAt(0)); in TEST_P()
5772 p->InputAt(0)->InputAt(0) == cls1; in TEST_F()
5777 p->InputAt(0)->InputAt(0) == cls2; in TEST_F()
6344 EXPECT_INS_EQ(final_read->InputAt(0)->InputAt(0), moved_ni); in TEST_F()
6469 EXPECT_INS_EQ(merge_alloc->InputAt(0)->InputAt(0), cls) in TEST_F()
[all …]
H A Descape.cc54 (user->IsInstanceFieldSet() && (reference == user->InputAt(1))) || in VisitEscapes()
55 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(1))) || in VisitEscapes()
56 (user->IsStaticFieldSet() && (reference == user->InputAt(1))) || in VisitEscapes()
57 (user->IsUnresolvedStaticFieldSet() && (reference == user->InputAt(0))) || in VisitEscapes()
58 (user->IsArraySet() && (reference == user->InputAt(2)))) { in VisitEscapes()
64 } else if ((user->IsUnresolvedInstanceFieldGet() && (reference == user->InputAt(0))) || in VisitEscapes()
65 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(0)))) { in VisitEscapes()
H A Dinstruction_simplifier.cc751 HInstruction *lhs = cond->InputAt(0); in GetOppositeConditionSwapOps()
752 HInstruction *rhs = cond->InputAt(1); in GetOppositeConditionSwapOps()
858 replace_with = input->InputAt(0); in VisitBooleanNot()
907 a = a->InputAt(0); in AreLowerPrecisionArgs()
910 b = b->InputAt(0); in AreLowerPrecisionArgs()
1015 condition = condition->InputAt(0); in VisitSelect()
1072 HInstruction* the_negated = negLeft ? true_value->InputAt(0) : false_value->InputAt(0); in VisitSelect()
2184 if (left->InputAt(1) == right) { in VisitSub()
2417 HInstruction* x = invoke->InputAt(0); in SimplifyFP2Int()
2446 HInstruction* str = invoke->InputAt(0); in SimplifyStringCharAt()
[all …]
H A Ddead_code_elimination.cc48 HInstruction* condition = if_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()
338 (last->InputAt(0) == first) && in SimplifyIfs()
344 bool phi_input_is_left = (first->InputAt(0) == phi); in SimplifyIfs()
350 HInstruction* input = phi->InputAt(i); in SimplifyIfs()
[all …]
H A Dinduction_var_range_test.cc791 ExpectInt(0, last->InputAt(1)); in TEST_F()
844 last = last->InputAt(1)->InputAt(0); in TEST_F()
846 ExpectInt(0, last->InputAt(0)); in TEST_F()
859 last = tce->InputAt(0); in TEST_F()
913 EXPECT_TRUE(upper->InputAt(0)->InputAt(0)->IsParameterValue()); in TEST_F()
914 ExpectInt(1, upper->InputAt(0)->InputAt(1)); in TEST_F()
942 ExpectInt(0, tce->InputAt(0)); in TEST_F()
989 lower = lower->InputAt(1); in TEST_F()
992 lower = lower->InputAt(0); in TEST_F()
1027 ExpectInt(0, tce->InputAt(0)); in TEST_F()
[all …]
H A Dinstruction_simplifier_arm64.cc106 left = use->InputAt(0); in TryMergeIntoShifterOperand()
107 right = use->InputAt(1); in TryMergeIntoShifterOperand()
110 right = use->AsNeg()->InputAt(0); in TryMergeIntoShifterOperand()
146 bitfield_op->InputAt(0), in TryMergeIntoShifterOperand()
233 if (instruction->InputAt(1)->IsConstant()) { in VisitShl()
239 if (instruction->InputAt(1)->IsConstant()) { in VisitShr()
246 HInstruction* shl = instruction->GetRight()->InputAt(0); in VisitSub()
247 if (shl->InputAt(1)->IsConstant() && TryReplaceSubSubWithSubAdd(instruction)) { in VisitSub()
268 if (instruction->InputAt(1)->IsConstant()) { in VisitUShr()
H A Dload_store_analysis.h298 ref = ref->InputAt(0); in HuntForOriginalReference()
327 HInstruction* array = instruction->InputAt(0); in GetArrayHeapLocation()
328 HInstruction* index = instruction->InputAt(1); in GetArrayHeapLocation()
597 HInstruction* array = instruction->InputAt(0); in VisitArrayGet()
598 HInstruction* index = instruction->InputAt(1); in VisitArrayGet()
605 HInstruction* array = instruction->InputAt(0); in VisitArraySet()
606 HInstruction* index = instruction->InputAt(1); in VisitArraySet()
613 HInstruction* array = instruction->InputAt(0); in VisitVecLoad()
614 HInstruction* index = instruction->InputAt(1); in VisitVecLoad()
621 HInstruction* array = instruction->InputAt(0); in VisitVecStore()
[all …]
H A Dinstruction_simplifier_arm.cc97 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand()
98 HInstruction* right = use->InputAt(1); in TryMergeIntoShifterOperand()
142 bitfield_op->InputAt(0), in TryMergeIntoShifterOperand()
262 if (instruction->InputAt(1)->IsConstant()) { in VisitShl()
268 if (instruction->InputAt(1)->IsConstant()) { in VisitShr()
275 HInstruction* shl = instruction->GetRight()->InputAt(0); in VisitSub()
276 if (shl->InputAt(1)->IsConstant() && TryReplaceSubSubWithSubAdd(instruction)) { in VisitSub()
297 if (instruction->InputAt(1)->IsConstant()) { in VisitUShr()
H A Dreference_type_propagation.cc298 HInstruction* compare = check->InputAt(0); in BoundTypeForClassCheck()
302 HInstruction* input_one = compare->InputAt(0); in BoundTypeForClassCheck()
303 HInstruction* input_two = compare->InputAt(1); in BoundTypeForClassCheck()
321 HInstruction* receiver = field_get->InputAt(0); in BoundTypeForClassCheck()
393 HInstruction* input0 = ifInput->InputAt(0); in BoundTypeForIfNotNull()
394 HInstruction* input1 = ifInput->InputAt(1); in BoundTypeForIfNotNull()
480 HInstruction* not_input = input->InputAt(0); in MatchIfInstanceOf()
515 HInstruction* obj = instanceOf->InputAt(0); in BoundTypeForIfInstanceOf()
717 HInstruction* obj = instr->InputAt(0); in VisitBoundType()
754 DCHECK_EQ(bound_type->InputAt(0), check_cast->InputAt(0)); in VisitCheckCast()
[all …]
H A Dselect_generator.cc80 if (phi->InputAt(index1) != phi->InputAt(index2)) { in GetSingleChangedPhi()
145 true_value = true_block->GetFirstInstruction()->InputAt(0); in Run()
146 false_value = false_block->GetFirstInstruction()->InputAt(0); in Run()
148 true_value = phi->InputAt(predecessor_index_true); in Run()
149 false_value = phi->InputAt(predecessor_index_false); in Run()
156 HInstruction* condition = if_instruction->InputAt(0); in Run()
H A Dloop_optimization.cc328 *a = instruction->InputAt(0); in IsSubConst2()
329 *b = instruction->InputAt(1); in IsSubConst2()
344 return (reduction->InputAt(0) == phi && reduction->InputAt(1) != phi) || in HasReductionFormat()
345 (reduction->InputAt(0) != phi && reduction->InputAt(1) == phi); in HasReductionFormat()
347 return (reduction->InputAt(0) == phi && reduction->InputAt(1) != phi); in HasReductionFormat()
447 type = a->InputAt(0)->GetType(); in GetNarrowerType()
451 type = b->InputAt(0)->GetType(); in GetNarrowerType()
1808 HInstruction* base = org->InputAt(0); in GenerateVecMem()
2106 r = instruction->InputAt(0); in VectorizeHalvingAddIdiom()
2107 s = instruction->InputAt(1); in VectorizeHalvingAddIdiom()
[all …]
H A Dinduction_var_analysis_test.cc328 GetInductionInfo(store1->InputAt(1), 0).c_str()); in TEST_F()
330 GetInductionInfo(store2->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()
397 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F()
398 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F()
737 GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
1101 EXPECT_TRUE(IsNarrowingLinear(store1->InputAt(1))); in TEST_F()
1102 EXPECT_FALSE(IsNarrowingLinear(store2->InputAt(1))); in TEST_F()
1105 EXPECT_FALSE(HaveSameInduction(store1->InputAt(1), store2->InputAt(1))); in TEST_F()
[all …]
H A Dconstructor_fence_redundancy_elimination.cc50 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()
H A Dx86_memory_gen.cc36 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()
H A Dintrinsics.cc211 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfLocations()
212 int32_t value = invoke->InputAt(0)->AsIntConstant()->GetValue(); in ComputeIntegerValueOfLocations()
236 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfLocations()
237 int32_t value = invoke->InputAt(0)->AsIntConstant()->GetValue(); in ComputeIntegerValueOfLocations()
259 locations->SetInAt(0, Location::RegisterOrConstant(invoke->InputAt(0))); in ComputeIntegerValueOfLocations()
263 locations->SetInAt(0, Location::ConstantLocation(invoke->InputAt(0)->AsConstant())); in ComputeIntegerValueOfLocations()
310 if (invoke->InputAt(0)->IsIntConstant()) { in ComputeIntegerValueOfInfo()
311 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()
H A Dinstruction_simplifier_shared.h35 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()
H A Dcode_sinking.cc92 if (!instruction->InputAt(0)->IsNewInstance()) { in IsInterestingInstruction()
98 if (!instruction->InputAt(0)->IsNewArray()) { in IsInterestingInstruction()
162 (user->InputAt(0) == instruction) && in ShouldFilterUse()
166 (user->InputAt(0) == instruction) && in ShouldFilterUse()
246 HInstruction* if_input = insert_pos->AsIf()->InputAt(0); in FindIdealPosition()
409 if (!instructions_that_can_move.IsBitSet(instruction->InputAt(0)->GetId())) { in SinkCodeToUncommonBranch()
418 position = FindIdealPosition(instruction->InputAt(0), post_dominated, /* filter= */ true); in SinkCodeToUncommonBranch()
H A Dbounds_check_elimination.cc825 HInstruction* index = bounds_check->InputAt(0); 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()
1287 right = right->AsDivZeroCheck()->InputAt(0); in VisitRem()
1402 HInstruction* index = bounds_check->InputAt(0); in AddComparesWithDeoptimization()
1496 HInstruction* index = context->InputAt(0); in InductionRangeFitsIn()
1525 HInstruction* index = bounds_check->InputAt(0); in TransformLoopForDynamicBCE()
1733 HInstruction* array = check->InputAt(0); in CanHandleNullCheck()
1771 if (index == condition->InputAt(0) || in CanHandleInfiniteLoop()
[all …]
H A Dconstant_folding_test.cc125 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()
H A Dprepare_for_register_allocation.cc53 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()
H A Dcommon_arm.h109 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputSRegisterAt()
115 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputDRegisterAt()
121 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputVRegisterAt()
141 instr->InputAt(input_index)->GetType()); in InputRegisterAt()
200 instr->InputAt(input_index)->GetType()); in InputOperandAt()
H A Dnodes_x86.h55 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()
H A Dpc_relative_fixups_x86.cc65 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()
H A Dcode_generator_utils.cc137 cond->GetBlock()->GetLastInstruction()->InputAt(0) != cond) { in IsComparedValueNonNegativeInBlock()
245 return analyzer.IsNonNegativeUse(instr, instr->InputAt(i)); in HasNonNegativeInputAt()
249 HInstruction* input = instr->InputAt(i); in HasNonNegativeOrMinIntInputAt()

123