Home
last modified time | relevance | path

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

123

/art/compiler/optimizing/
Descape.cc55 (user->IsInstanceFieldSet() && (reference == user->InputAt(1))) || in CalculateEscape()
56 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(1))) || in CalculateEscape()
57 (user->IsStaticFieldSet() && (reference == user->InputAt(1))) || in CalculateEscape()
58 (user->IsUnresolvedStaticFieldSet() && (reference == user->InputAt(0))) || in CalculateEscape()
59 (user->IsArraySet() && (reference == user->InputAt(2)))) { in CalculateEscape()
66 } else if ((user->IsUnresolvedInstanceFieldGet() && (reference == user->InputAt(0))) || in CalculateEscape()
67 (user->IsUnresolvedInstanceFieldSet() && (reference == user->InputAt(0)))) { in CalculateEscape()
Dinstruction_simplifier_arm64.cc49 left = use->InputAt(0); in TryMergeIntoShifterOperand()
50 right = use->InputAt(1); in TryMergeIntoShifterOperand()
53 right = use->AsNeg()->InputAt(0); in TryMergeIntoShifterOperand()
89 bitfield_op->InputAt(0), in TryMergeIntoShifterOperand()
176 if (instruction->InputAt(1)->IsConstant()) { in VisitShl()
182 if (instruction->InputAt(1)->IsConstant()) { in VisitShr()
202 if (instruction->InputAt(1)->IsConstant()) { in VisitUShr()
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()
Dinduction_var_analysis.cc224 info = TransferAddSub(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
225 LookupInfo(loop, instruction->InputAt(1)), kAdd); in ClassifyTrivial()
227 info = TransferAddSub(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
228 LookupInfo(loop, instruction->InputAt(1)), kSub); in ClassifyTrivial()
230 info = TransferNeg(LookupInfo(loop, instruction->InputAt(0))); in ClassifyTrivial()
232 info = TransferMul(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
233 LookupInfo(loop, instruction->InputAt(1))); in ClassifyTrivial()
237 info = TransferMul(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
243 info = TransferConversion(LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
247 info = LookupInfo(loop, instruction->InputAt(0)); // Pass-through. in ClassifyTrivial()
[all …]
Dnodes_x86.h48 return InputAt(0)->AsX86ComputeBaseMethodAddress(); in GetBaseMethodAddress()
52 return InputAt(1)->AsConstant(); in GetConstant()
75 return InputAt(1)->AsX86ComputeBaseMethodAddress(); in GetBaseMethodAddress()
106 return InputAt(1)->AsX86ComputeBaseMethodAddress(); in GetBaseMethodAddress()
Ddead_code_elimination.cc43 HInstruction* condition = if_instruction->InputAt(0); in MarkReachableBlocks()
56 HInstruction* switch_input = switch_instruction->InputAt(0); in MarkReachableBlocks()
99 return (instruction->InputAt(0) == input) || in HasInput()
100 (instruction->InputAt(1) == input); in HasInput()
192 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
198 (last->InputAt(0) == first) && in SimplifyIfs()
204 bool phi_input_is_left = (first->InputAt(0) == phi); in SimplifyIfs()
210 HInstruction* input = phi->InputAt(i); in SimplifyIfs()
219 value_to_check = Evaluate(first->AsCondition(), input, first->InputAt(1)); in SimplifyIfs()
221 value_to_check = Evaluate(first->AsCondition(), first->InputAt(0), input); in SimplifyIfs()
[all …]
Dselect_generator.cc62 if (phi->InputAt(index1) != phi->InputAt(index2)) { in GetSingleChangedPhi()
115 HInstruction* true_value = phi->InputAt(predecessor_index_true); in Run()
116 HInstruction* false_value = phi->InputAt(predecessor_index_false); in Run()
119 HSelect* select = new (graph_->GetArena()) HSelect(if_instruction->InputAt(0), in Run()
Dinduction_var_range_test.cc737 HInstruction* phi = condition_->InputAt(0); in TEST_F()
765 ExpectInt(1000, last->InputAt(0)); in TEST_F()
766 ExpectInt(0, last->InputAt(1)); in TEST_F()
789 HInstruction* phi = condition_->InputAt(0); in TEST_F()
817 ExpectInt(1000, last->InputAt(0)); in TEST_F()
818 ASSERT_TRUE(last->InputAt(1)->IsNeg()); in TEST_F()
819 last = last->InputAt(1)->InputAt(0); in TEST_F()
821 ExpectInt(0, last->InputAt(0)); in TEST_F()
822 ExpectInt(1000, last->InputAt(1)); in TEST_F()
834 last = tce->InputAt(0); in TEST_F()
[all …]
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()
Dinstruction_simplifier_arm.cc47 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand()
48 HInstruction* right = use->InputAt(1); in TryMergeIntoShifterOperand()
92 bitfield_op->InputAt(0), in TryMergeIntoShifterOperand()
207 if (instruction->InputAt(1)->IsConstant()) { in VisitShl()
213 if (instruction->InputAt(1)->IsConstant()) { in VisitShr()
233 if (instruction->InputAt(1)->IsConstant()) { in VisitUShr()
Dinstruction_simplifier.cc218 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring()
219 HInstruction* src_right = right->InputAt(0); in TryDeMorganNegationFactoring()
408 if (neg->InputAt(0) == (neg_is_left ? ushr->GetRight() : shl->GetRight())) { in TryReplaceWithRotateRegisterNegPattern()
446 HInstruction* obj = null_check->InputAt(0); in VisitNullCheck()
507 HInstruction* object = check_cast->InputAt(0); in VisitCheckCast()
508 HLoadClass* load_class = check_cast->InputAt(1)->AsLoadClass(); in VisitCheckCast()
545 HInstruction* object = instruction->InputAt(0); in VisitInstanceOf()
546 HLoadClass* load_class = instruction->InputAt(1)->AsLoadClass(); in VisitInstanceOf()
607 HInstruction *lhs = cond->InputAt(0); in GetOppositeConditionSwapOps()
608 HInstruction *rhs = cond->InputAt(1); in GetOppositeConditionSwapOps()
[all …]
Dreference_type_propagation.cc146 DCHECK(instr->GetReferenceTypeInfo().IsEqual(instr->InputAt(0)->GetReferenceTypeInfo())) in ValidateTypes()
148 << "Input(0) " << instr->InputAt(0)->GetReferenceTypeInfo(); in ValidateTypes()
255 BoundTypeIn(receiver->InputAt(0), start_block, start_instruction, class_rti); in BoundTypeIn()
266 HInstruction* compare = check->InputAt(0); in BoundTypeForClassCheck()
270 HInstruction* input_one = compare->InputAt(0); in BoundTypeForClassCheck()
271 HInstruction* input_two = compare->InputAt(1); in BoundTypeForClassCheck()
291 HInstruction* receiver = field_get->InputAt(0); in BoundTypeForClassCheck()
365 HInstruction* ifInput = ifInstruction->InputAt(0); in BoundTypeForIfNotNull()
369 HInstruction* input0 = ifInput->InputAt(0); in BoundTypeForIfNotNull()
370 HInstruction* input1 = ifInput->InputAt(1); in BoundTypeForIfNotNull()
[all …]
Dload_store_elimination.cc260 if ((prev != nullptr) && prev->IsNullCheck() && (prev == instruction->InputAt(0))) { in TryRemovingNullCheck()
262 prev->ReplaceWith(prev->InputAt(0)); in TryRemovingNullCheck()
316 heap_value = heap_value->IsInstanceFieldSet() ? store->InputAt(1) : store->InputAt(2); in VisitGetLocation()
440 HInstruction* obj = instruction->InputAt(0); in VisitInstanceFieldGet()
447 HInstruction* obj = instruction->InputAt(0); in VisitInstanceFieldSet()
450 HInstruction* value = instruction->InputAt(1); in VisitInstanceFieldSet()
455 HInstruction* cls = instruction->InputAt(0); in VisitStaticFieldGet()
462 HInstruction* cls = instruction->InputAt(0); in VisitStaticFieldSet()
465 HInstruction* value = instruction->InputAt(1); in VisitStaticFieldSet()
470 HInstruction* array = instruction->InputAt(0); in VisitArrayGet()
[all …]
Dload_store_analysis.h201 ref = ref->InputAt(0); in HuntForOriginalReference()
411 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitInstanceFieldGet()
416 HeapLocation* location = VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitInstanceFieldSet()
442 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitStaticFieldGet()
447 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitStaticFieldSet()
455 VisitArrayAccess(instruction->InputAt(0), instruction->InputAt(1)); in VisitArrayGet()
460 VisitArrayAccess(instruction->InputAt(0), instruction->InputAt(1)); in VisitArraySet()
Dinduction_var_analysis_test.cc268 EXPECT_STREQ("((1) * i + (0)):PrimInt", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
272 EXPECT_FALSE(HaveSameInduction(store->InputAt(1), increment_[0])); in TEST_F()
332 GetInductionInfo(store1->InputAt(1), 0).c_str()); in TEST_F()
334 GetInductionInfo(store2->InputAt(1), 0).c_str()); in TEST_F()
367 EXPECT_STREQ("((1) * i + (1)):PrimInt", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
370 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F()
371 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F()
398 EXPECT_STREQ("((1) * i + (1)):PrimInt", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
401 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F()
402 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F()
[all …]
Dcode_sinking.cc80 if (!instruction->InputAt(0)->IsNewInstance()) { in IsInterestingInstruction()
86 if (!instruction->InputAt(0)->IsNewArray()) { in IsInterestingInstruction()
149 (user->InputAt(0) == instruction) && in ShouldFilterUse()
153 (user->InputAt(0) == instruction) && in ShouldFilterUse()
228 HInstruction* if_input = insert_pos->AsIf()->InputAt(0); in FindIdealPosition()
389 if (!instructions_that_can_move.IsBitSet(instruction->InputAt(0)->GetId())) { in SinkCodeToUncommonBranch()
398 position = FindIdealPosition(instruction->InputAt(0), post_dominated, /* filter */ true); in SinkCodeToUncommonBranch()
Dloop_optimization.cc160 HInstruction* a = instruction->InputAt(0); in IsZeroExtensionAndGet()
161 HInstruction* b = instruction->InputAt(1); in IsZeroExtensionAndGet()
224 return IsAddConstHelper(instruction->InputAt(0), a, b, c, depth + 1) && in IsAddConstHelper()
225 IsAddConstHelper(instruction->InputAt(1), a, b, c, depth + 1); in IsAddConstHelper()
243 if (IsAddConstHelper(instruction->InputAt(0), a, b, c, /*depth*/ 0) && in IsAddConst()
244 IsAddConstHelper(instruction->InputAt(1), a, b, c, /*depth*/ 0) && in IsAddConst()
249 *a = instruction->InputAt(0); in IsAddConst()
250 *b = instruction->InputAt(1); in IsAddConst()
536 phi->ReplaceWith(phi->InputAt(0)); in OptimizeInnerLoop()
842 HInstruction* base = instruction->InputAt(0); in VectorizeDef()
[all …]
Dnodes_shared.h144 HInstruction* GetBaseAddress() const { return InputAt(0); } in GetBaseAddress()
145 HInstruction* GetOffset() const { return InputAt(1); } in GetOffset()
186 HInstruction* GetIndex() const { return InputAt(0); } in GetIndex()
187 HInstruction* GetOffset() const { return InputAt(1); } in GetOffset()
188 HInstruction* GetShift() const { return InputAt(2); } in GetShift()
Dconstant_folding_test.cc134 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
195 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
256 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
335 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
406 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
469 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
533 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
633 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0); in TEST_F()
718 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
Dbounds_check_elimination.cc817 HInstruction* index = bounds_check->InputAt(0); in VisitBoundsCheck()
818 HInstruction* array_length = bounds_check->InputAt(1); in VisitBoundsCheck()
931 HInstruction* instruction = phi->InputAt(1); in VisitPhi()
936 HInstruction* initial_value = phi->InputAt(0); in VisitPhi()
975 if (instruction->InputAt(0)->IsCondition()) { in VisitIf()
976 HCondition* cond = instruction->InputAt(0)->AsCondition(); in VisitIf()
1166 if (loop->IsDefinedOutOfTheLoop(array_get->InputAt(0)) && in VisitArrayGet()
1167 loop->IsDefinedOutOfTheLoop(array_get->InputAt(1))) { in VisitArrayGet()
1218 HInstruction* index = bounds_check->InputAt(0); in AddComparesWithDeoptimization()
1219 HInstruction* array_length = bounds_check->InputAt(1); in AddComparesWithDeoptimization()
[all …]
Dprepare_for_register_allocation.cc36 check->ReplaceWith(check->InputAt(0)); in VisitNullCheck()
40 check->ReplaceWith(check->InputAt(0)); in VisitDivZeroCheck()
52 check->ReplaceWith(check->InputAt(0)); in VisitBoundsCheck()
68 bound_type->ReplaceWith(bound_type->InputAt(0)); in VisitBoundType()
Dpc_relative_fixups_x86.cc65 HConstant* value = ret->InputAt(0)->AsConstant(); in VisitReturn()
102 HConstant* rhs = bin->InputAt(1)->AsConstant(); in BinaryFP()
140 neg->InputAt(0), in VisitNeg()
160 switch_insn->InputAt(0), in VisitPackedSwitch()
Dcommon_arm.h118 Primitive::Type type = instr->InputAt(input_index)->GetType(); in InputSRegisterAt()
124 Primitive::Type type = instr->InputAt(input_index)->GetType(); in InputDRegisterAt()
130 Primitive::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()
Dcommon_arm64.h87 instr->InputAt(input_index)->GetType()); in InputRegisterAt()
121 instr->InputAt(input_index)->GetType()); in InputFPRegisterAt()
137 return Primitive::IsFloatingPointType(instr->InputAt(index)->GetType()) in InputCPURegisterAt()
144 HInstruction* input = instr->InputAt(index); in InputCPURegisterOrZeroRegAt()
176 instr->InputAt(input_index)->GetType()); in InputOperandAt()
Dscheduler.cc80 size_t node_heap_loc = ArrayAccessHeapLocation(node->InputAt(0), node->InputAt(1)); in ArrayAccessMayAlias()
81 size_t other_heap_loc = ArrayAccessHeapLocation(other->InputAt(0), other->InputAt(1)); in ArrayAccessMayAlias()
184 size_t node_loc = FieldAccessHeapLocation(node->InputAt(0), node_field); in FieldAccessMayAlias()
185 size_t other_loc = FieldAccessHeapLocation(other->InputAt(0), other_field); in FieldAccessMayAlias()
497 condition = instruction->AsIf()->InputAt(0)->AsCondition(); in SelectMaterializedCondition()

123