Home
last modified time | relevance | path

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

123

/art/compiler/optimizing/
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()
Dload_store_elimination_test.cc436 EXPECT_TRUE(ins->InputAt(1)->IsEqual()) << ins->DumpWithArgs(); in CheckFinalInstruction()
440 EXPECT_TRUE(ins->InputAt(1)->IsNotEqual()) << ins->DumpWithArgs(); in CheckFinalInstruction()
443 ASSERT_TRUE(ins->InputAt(0)->IsNotEqual()) << ins->DumpWithArgs(); in CheckFinalInstruction()
444 EXPECT_TRUE(ins->InputAt(0)->InputAt(0)->IsPhi()) << ins->DumpWithArgs(); in CheckFinalInstruction()
445 EXPECT_TRUE(ins->InputAt(0)->InputAt(1)->IsNullConstant()) << ins->DumpWithArgs(); in CheckFinalInstruction()
447 EXPECT_INS_EQ(ins->InputAt(1)->InputAt(kind.position_ == Position::kLeft ? 0 : 1), in CheckFinalInstruction()
448 ins->InputAt(0)->InputAt(0)) in CheckFinalInstruction()
778 HInstruction* vdata = vstore1->InputAt(2); in TEST_F()
878 HInstruction* vstore3 = AddVecStore(loop_, array_a, phi_, vstore1->InputAt(2)); in TEST_F()
1219 EXPECT_INS_EQ(cls, return_val->InputAt(0)); in TEST_F()
[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()
Dinduction_var_analysis.cc93 HInstruction* if_expr = ifs->InputAt(0); in IsGuardedBy()
98 if (if_expr->InputAt(0) == a && if_expr->InputAt(1) == b) { in IsGuardedBy()
100 } else if (if_expr->InputAt(1) == a && if_expr->InputAt(0) == b) { in IsGuardedBy()
118 use.GetUser()->InputAt(1) == instruction) { in FindFirstLoopHeaderPhiUse()
407 LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
408 LookupInfo(loop, instruction->InputAt(1)), in ClassifyTrivial()
414 LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
415 LookupInfo(loop, instruction->InputAt(1)), in ClassifyTrivial()
419 info = TransferNeg(context, loop, LookupInfo(loop, instruction->InputAt(0)), type); in ClassifyTrivial()
423 LookupInfo(loop, instruction->InputAt(0)), in ClassifyTrivial()
[all …]
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()
Dinstruction_simplifier.cc244 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring()
245 HInstruction* src_right = right->InputAt(0); in TryDeMorganNegationFactoring()
424 DataType::Type source_type = shift_amount->InputAt(0)->GetType(); in VisitShift()
539 if (neg->InputAt(0) == (neg_is_left ? ushr->GetRight() : shl->GetRight())) { in TryReplaceWithRotateRegisterNegPattern()
577 HInstruction* obj = null_check->InputAt(0); in VisitNullCheck()
648 HInstruction* object = check_cast->InputAt(0); in VisitCheckCast()
689 HInstruction* object = instruction->InputAt(0); in VisitInstanceOf()
755 HInstruction *lhs = cond->InputAt(0); in GetOppositeConditionSwapOps()
756 HInstruction *rhs = cond->InputAt(1); in GetOppositeConditionSwapOps()
849 HInstruction* input = bool_not->InputAt(0); in VisitBooleanNot()
[all …]
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()
Dinstruction_simplifier_shared.h36 return (instruction->IsShl() && instruction->AsShl()->InputAt(1)->IsIntConstant()) || in CanFitInShifterOperand()
37 (instruction->IsShr() && instruction->AsShr()->InputAt(1)->IsIntConstant()) || in CanFitInShifterOperand()
38 (instruction->IsUShr() && instruction->AsUShr()->InputAt(1)->IsIntConstant()); in CanFitInShifterOperand()
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()
167 if (IsInterestingPublishTarget(inst->InputAt(input_count))) { in HasInterestingPublishTargetAsInput()
Dload_store_analysis.h301 ref = ref->InputAt(0); in HuntForOriginalReference()
331 HInstruction* array = instruction->InputAt(0); in GetArrayHeapLocation()
332 HInstruction* index = instruction->InputAt(1); in GetArrayHeapLocation()
574 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitInstanceFieldGet()
579 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitInstanceFieldSet()
584 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitStaticFieldGet()
589 VisitFieldAccess(instruction->InputAt(0), instruction->GetFieldInfo()); in VisitStaticFieldSet()
597 HInstruction* array = instruction->InputAt(0); in VisitArrayGet()
598 HInstruction* index = instruction->InputAt(1); in VisitArrayGet()
605 HInstruction* array = instruction->InputAt(0); in VisitArraySet()
[all …]
Ddead_code_elimination.cc51 HInstruction* condition = if_instruction->InputAt(0); in MarkReachableBlocks()
64 HInstruction* switch_input = switch_instruction->InputAt(0); in MarkReachableBlocks()
107 return (instruction->InputAt(0) == input) || in HasInput()
108 (instruction->InputAt(1) == input); in HasInput()
168 HInstruction* cond = ifs->InputAt(0); in RemoveNonNullControlDependences()
178 HInstruction* obj = cond->InputAt(1); in RemoveNonNullControlDependences()
180 obj = cond->InputAt(0); in RemoveNonNullControlDependences()
181 } else if (!cond->InputAt(0)->IsNullConstant()) { in RemoveNonNullControlDependences()
361 bool has_only_phi_and_if = (last == first) && (last->InputAt(0) == block->GetFirstPhi()); in SimplifyIfs()
367 (last->InputAt(0) == first) && in SimplifyIfs()
[all …]
Dreference_type_propagation.cc238 BoundTypeIn(receiver->InputAt(0), start_block, start_instruction, class_rti); in BoundTypeIn()
249 HInstruction* compare = check->InputAt(0); in BoundTypeForClassCheck()
253 HInstruction* input_one = compare->InputAt(0); in BoundTypeForClassCheck()
254 HInstruction* input_two = compare->InputAt(1); in BoundTypeForClassCheck()
272 HInstruction* receiver = field_get->InputAt(0); in BoundTypeForClassCheck()
342 HInstruction* ifInput = ifInstruction->InputAt(0); in BoundTypeForIfNotNull()
346 HInstruction* input0 = ifInput->InputAt(0); in BoundTypeForIfNotNull()
347 HInstruction* input1 = ifInput->InputAt(1); in BoundTypeForIfNotNull()
391 HInstruction* input = ifInstruction->InputAt(0); in MatchIfInstanceOf()
439 HInstruction* not_input = input->InputAt(0); in MatchIfInstanceOf()
[all …]
Dloop_optimization.cc132 HInstruction* conv = instruction->InputAt(0); in IsSignExtensionAndGet()
147 IsZeroExtensionAndGet(instruction->InputAt(0), type, /*out*/ operand); in IsSignExtensionAndGet()
197 HInstruction* conv = instruction->InputAt(0); in IsZeroExtensionAndGet()
210 IsSignExtensionAndGet(instruction->InputAt(0), type, /*out*/ operand); in IsZeroExtensionAndGet()
281 return IsAddConst(instruction->InputAt(0), a, b, c, depth - 1) && in IsAddConst()
282 IsAddConst(instruction->InputAt(1), a, b, c, depth - 1); in IsAddConst()
284 IsInt64AndGet(instruction->InputAt(1), &value)) { in IsAddConst()
286 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 …]
Dselect_generator.cc141 true_value = true_block->GetFirstInstruction()->InputAt(0); in TryGenerateSelectSimpleDiamondPattern()
142 false_value = false_block->GetFirstInstruction()->InputAt(0); in TryGenerateSelectSimpleDiamondPattern()
144 true_value = phi->InputAt(predecessor_index_true); in TryGenerateSelectSimpleDiamondPattern()
145 false_value = phi->InputAt(predecessor_index_false); in TryGenerateSelectSimpleDiamondPattern()
152 HInstruction* condition = if_instruction->InputAt(0); in TryGenerateSelectSimpleDiamondPattern()
235 inner_if_block->GetLastInstruction()->AsIf()->InputAt(0) != in TryFixupDoubleDiamondPattern()
291 first_phi->AddInput(second_phi->InputAt(index)); in TryFixupDoubleDiamondPattern()
Dinduction_var_range_test.cc983 HInstruction* phi = condition_->InputAt(0); in TEST_F()
1013 ExpectInt(1000, last->InputAt(0)); in TEST_F()
1014 ExpectInt(0, last->InputAt(1)); in TEST_F()
1037 HInstruction* phi = condition_->InputAt(0); in TEST_F()
1067 ExpectInt(1000, last->InputAt(0)); in TEST_F()
1068 ExpectInt(1000, last->InputAt(1)); in TEST_F()
1080 last = tce->InputAt(0); in TEST_F()
1082 ExpectInt(0, last->InputAt(0)); in TEST_F()
1083 ExpectInt(1000, last->InputAt(1)); in TEST_F()
1094 HInstruction* phi = condition_->InputAt(0); in TEST_F()
[all …]
Dinduction_var_analysis_test.cc265 EXPECT_STREQ("((1) * i + (0)):Int32", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
269 EXPECT_FALSE(HaveSameInduction(store->InputAt(1), increment_[0])); in TEST_F()
329 GetInductionInfo(store1->InputAt(1), 0).c_str()); in TEST_F()
331 GetInductionInfo(store2->InputAt(1), 0).c_str()); in TEST_F()
364 EXPECT_STREQ("((1) * i + (1)):Int32", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
367 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F()
368 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F()
395 EXPECT_STREQ("((1) * i + (1)):Int32", GetInductionInfo(store->InputAt(1), 0).c_str()); in TEST_F()
398 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc1)); in TEST_F()
399 EXPECT_TRUE(HaveSameInduction(store->InputAt(1), inc2)); in TEST_F()
[all …]
Dwrite_barrier_elimination.cc51 HInstruction* obj = HuntForOriginalReference(instruction->InputAt(0)); in VisitInstanceFieldSet()
78 HInstruction* cls = HuntForOriginalReference(instruction->InputAt(0)); in VisitStaticFieldSet()
105 HInstruction* arr = HuntForOriginalReference(instruction->InputAt(0)); in VisitArraySet()
139 ref = ref->InputAt(0); in HuntForOriginalReference()
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()
Dcode_sinking.cc119 if (!instruction->InputAt(0)->IsNewInstance()) { in IsInterestingInstruction()
125 if (!instruction->InputAt(0)->IsNewArray()) { in IsInterestingInstruction()
189 (user->InputAt(0) == instruction) && in ShouldFilterUse()
193 (user->InputAt(0) == instruction) && in ShouldFilterUse()
317 HInstruction* if_input = insert_pos->AsIf()->InputAt(0); in FindIdealPosition()
508 if (!instructions_that_can_move.IsBitSet(instruction->InputAt(0)->GetId())) { in SinkCodeToUncommonBranch()
517 position = FindIdealPosition(instruction->InputAt(0), post_dominated, /* filter= */ true); in SinkCodeToUncommonBranch()
581 ret->InputAt(0)->GetType()); in ReturnSinking()
584 new_phi->AddInput(ret->InputAt(0)); in ReturnSinking()
Dconstant_folding_test.cc129 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
190 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
251 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
330 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
401 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
464 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
528 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
628 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0); in TEST_F()
713 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()
Dcommon_arm.h110 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputSRegisterAt()
116 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputDRegisterAt()
122 DataType::Type type = instr->InputAt(input_index)->GetType(); in InputVRegisterAt()
142 instr->InputAt(input_index)->GetType()); in InputRegisterAt()
201 instr->InputAt(input_index)->GetType()); in InputOperandAt()
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()
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()
Dbounds_check_elimination.cc838 HInstruction* index = bounds_check->InputAt(0); in VisitBoundsCheck()
839 HInstruction* array_length = bounds_check->InputAt(1); in VisitBoundsCheck()
967 HInstruction* instruction = phi->InputAt(1); in VisitPhi()
972 HInstruction* initial_value = phi->InputAt(0); in VisitPhi()
1011 if (instruction->InputAt(0)->IsCondition()) { in VisitIf()
1012 HCondition* cond = instruction->InputAt(0)->AsCondition(); in VisitIf()
1300 right = right->AsDivZeroCheck()->InputAt(0); in VisitRem()
1362 if (loop->IsDefinedOutOfTheLoop(array_get->InputAt(0)) && in VisitArrayGet()
1363 loop->IsDefinedOutOfTheLoop(array_get->InputAt(1))) { in VisitArrayGet()
1415 HInstruction* index = bounds_check->InputAt(0); in AddComparesWithDeoptimization()
[all …]

123