Home
last modified time | relevance | path

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

123

/art/compiler/optimizing/
Descape.cc63 (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()
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()
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 …]
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()
Ddead_code_elimination.cc48 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 …]
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()
Dinduction_var_range_test.cc762 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 …]
Dload_store_analysis.h227 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 …]
Dselect_generator.cc82 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()
Dinstruction_simplifier.cc232 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring()
233 HInstruction* src_right = right->InputAt(0); in TryDeMorganNegationFactoring()
396 DataType::Type source_type = shift_amount->InputAt(0)->GetType(); in VisitShift()
511 if (neg->InputAt(0) == (neg_is_left ? ushr->GetRight() : shl->GetRight())) { in TryReplaceWithRotateRegisterNegPattern()
549 HInstruction* obj = null_check->InputAt(0); in VisitNullCheck()
611 HInstruction* object = check_cast->InputAt(0); in VisitCheckCast()
652 HInstruction* object = instruction->InputAt(0); in VisitInstanceOf()
717 HInstruction *lhs = cond->InputAt(0); in GetOppositeConditionSwapOps()
718 HInstruction *rhs = cond->InputAt(1); in GetOppositeConditionSwapOps()
811 HInstruction* input = bool_not->InputAt(0); in VisitBooleanNot()
[all …]
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()
Dinstruction_simplifier_arm64.cc104 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()
Dloop_optimization.cc131 HInstruction* conv = instruction->InputAt(0); in IsSignExtensionAndGet()
146 IsZeroExtensionAndGet(instruction->InputAt(0), type, /*out*/ operand); in IsSignExtensionAndGet()
196 HInstruction* conv = instruction->InputAt(0); in IsZeroExtensionAndGet()
209 IsSignExtensionAndGet(instruction->InputAt(0), type, /*out*/ operand); in IsZeroExtensionAndGet()
280 return IsAddConst(instruction->InputAt(0), a, b, c, depth - 1) && in IsAddConst()
281 IsAddConst(instruction->InputAt(1), a, b, c, depth - 1); in IsAddConst()
283 IsInt64AndGet(instruction->InputAt(1), &value)) { in IsAddConst()
285 return IsAddConst(instruction->InputAt(0), a, b, c, depth - 1); in IsAddConst()
326 *a = instruction->InputAt(0); in IsSubConst2()
327 *b = instruction->InputAt(1); in IsSubConst2()
[all …]
Dreference_type_propagation.cc183 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 …]
Dinstruction_simplifier_arm.cc95 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()
Dintrinsics.cc197 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()
Dinduction_var_analysis_test.cc264 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 …]
Dcode_sinking.cc92 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()
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()
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()
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()
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()
Dbounds_check_elimination.cc825 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 …]
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()
Dloop_optimization_test.cc237 HInstruction* input = phi->InputAt(i); in TEST_F()
312 EXPECT_EQ(new_preheader_phi->InputAt(0), preheader0_add); in TEST_F()
313 EXPECT_EQ(new_preheader_phi->InputAt(1), preheader1_add); in TEST_F()
316 EXPECT_EQ(header_phi->InputAt(0), new_preheader_phi); in TEST_F()
317 EXPECT_EQ(header_phi->InputAt(1), body_add); in TEST_F()
Dscheduler_arm.cc211 HInstruction* right = condition->InputAt(1); in HandleGenerateLongTestConstant()
307 condition->InputAt(1)->IsConstant() in HandleGenerateTest()
321 HInstruction* right = condition->InputAt(1); in CanGenerateTest()
382 HInstruction* right = cond->InputAt(1); in HandleGenerateConditionLong()
439 HInstruction* right = cond->InputAt(1); in HandleGenerateConditionIntegralOrNonPrimitive()
516 DataType::Type type = instr->InputAt(0)->GetType(); in VisitCompare()
635 HInstruction* index = instruction->InputAt(1); in VisitArrayGet()
733 HInstruction* index = instruction->InputAt(1); in VisitArraySet()
758 if (instruction->InputAt(2)->IsNullConstant()) { in VisitArraySet()
981 CodeGenerator::StoreNeedsWriteBarrier(field_type, instruction->InputAt(1)); in HandleFieldSetLatencies()

123