Home
last modified time | relevance | path

Searched refs:InputCount (Results 1 – 25 of 26) sorted by relevance

12

/art/compiler/optimizing/
Dconstructor_fence_redundancy_elimination.cc49 for (size_t input_idx = 0; input_idx < constructor_fence->InputCount(); ++input_idx) { in VisitConstructorFence()
176 for (size_t input_count = 0; input_count < inst->InputCount(); ++input_count) { in HasInterestingPublishTargetAsInput()
203 << merge_target->InputCount(); in MergeCandidateFences()
Dloop_optimization_test.cc255 for (size_t i = 0, e = phi->InputCount(); i < e; i++) { in TEST_F()
330 EXPECT_EQ(new_preheader_phi->InputCount(), 2u); in TEST_F()
334 EXPECT_EQ(header_phi->InputCount(), 2u); in TEST_F()
Dlocations.cc33 : inputs_(instruction->InputCount(), allocator->Adapter(kArenaAllocLocationSummary)), in LocationSummary()
Dcommon_arm.h131 DCHECK_EQ(instr->InputCount(), 1u); in InputVRegister()
145 DCHECK_EQ(instr->InputCount(), 1u); in InputRegister()
Dsuperblock_cloner.cc65 for (size_t i = 1, e = phi->InputCount(); i < e; i++) { in ArePhiInputsTheSame()
118 for (size_t i = 0, e = copy_instr->InputCount(); i < e; i++) { in ReplaceInputsWithCopies()
187 phi_input_count = copy_phi->InputCount(); in RemapOrigInternalOrIncomingEdge()
190 DCHECK_EQ(phi_input_count, copy_phi->InputCount()); in RemapOrigInternalOrIncomingEdge()
428 for (size_t i = 0, e = phi->InputCount(); i < e; i++) { in ResolvePhi()
715 for (size_t i = 0, e = orig_instr->InputCount(); i < e; i++) { in CheckInstructionInputsRemapping()
Ddead_code_elimination.cc349 for (size_t i = 0; i < phi->InputCount();) { in SimplifyIfs()
385 if (phi->InputCount() == 1) { in SimplifyIfs()
Dprepare_for_register_allocation.cc223 DCHECK_EQ(1u, constructor_fence->InputCount()); in VisitConstructorFence()
Dssa_builder.cc437 HInstruction* str = invoke->InputAt(invoke->InputCount() - 1); in ReplaceUninitializedStringPhis()
448 invoke->RemoveInputAt(invoke->InputCount() - 1); in ReplaceUninitializedStringPhis()
Dsuperblock_cloner_test.cc190 EXPECT_EQ(orig_instr->InputCount(), copy_instr->InputCount()); in TEST_F()
193 for (size_t i = 0, e = orig_instr->InputCount(); i < e; i++) { in TEST_F()
Dinduction_var_analysis.cc708 if (phi->IsLoopHeaderPhi() && phi->InputCount() == 2) { in SolvePhiAllInputs()
750 if (x == entry_phi && entry_phi->InputCount() == 2 && instruction == entry_phi->InputAt(1)) { in SolveAddSub()
769 if (y == entry_phi && entry_phi->InputCount() == 2 && instruction == entry_phi->InputAt(1)) { in SolveAddSub()
792 if (entry_phi->InputCount() == 2 && instruction == entry_phi->InputAt(1)) { in SolveOp()
870 if (entry_phi->InputCount() == 2 && conversion == entry_phi->InputAt(1)) { in SolveConversion()
Dcode_sinking.cc72 DCHECK_NE(0u, ctor_fence->InputCount()); in IsInterestingInstruction()
Dnodes.cc491 input_pos < header_phi->InputCount(); in TransformLoopToSinglePreheaderFormat()
1384 DCHECK_EQ(0u, InputCount()); in RemoveAllInputs()
1440 if (ctor_fence->InputCount() == 0u) { in RemoveConstructorFences()
1471 for (size_t input_count = 0; input_count < haystack->InputCount(); ++input_count) { in Merge()
1480 for (size_t input_count = 0; input_count < other->InputCount(); ++input_count) { in Merge()
1507 if (InputCount() == 1u && InputAt(0) == new_instance_inst) { in GetAssociatedAllocation()
1789 DCHECK_EQ(InputCount(), 0u); in MoveBeforeFirstUserAndOutOfLoops()
2634 size_t last_input_index = invoke->InputCount() - 1; in InlineInto()
Dnodes_vector.h143 HInstruction* pred_input = InputAt(InputCount() - 1); in GetGoverningPredicate()
229 instruction->InputCount() == 2 && in ReturnsSIMDValue()
Dcode_generator.cc827 DCHECK_EQ(cls->InputCount(), 1u); in CreateLoadClassRuntimeCallLocationSummary()
853 DCHECK_EQ(method_handle->InputCount(), 1u); in CreateLoadMethodHandleRuntimeCallLocationSummary()
873 DCHECK_EQ(method_type->InputCount(), 1u); in CreateLoadMethodTypeRuntimeCallLocationSummary()
Dcode_generator_vector_arm_vixl.cc745 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
766 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
Dcode_generator_vector_x86_64.cc1062 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
1095 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
Dcode_generator_vector_x86.cc1079 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
1117 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
Dcode_generator_vector_arm64_sve.cc967 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
1000 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
Dcode_generator_vector_arm64_neon.cc967 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
1000 DCHECK_EQ(1u, instruction->InputCount()); // only one input currently implemented in VisitVecSetScalars()
Dgraph_checker.cc850 size_t input_count_next = next_phi->InputCount(); in VisitPhi()
Dnodes.h2154 size_t InputCount() const { return GetInputRecords().size(); } in InputCount() function
3379 return InputCount() == 2; in GuardsAnInput()
4769 DCHECK(InputCount() == GetCurrentMethodIndexUnchecked() || in HasCurrentMethodInput()
4789 size_t input_count = InputCount(); in HasSpecialInput()
7019 DCHECK_GE(InputCount(), 1u); in GetNumberOfArguments()
7020 return InputCount() - 1u; in GetNumberOfArguments()
Dinstruction_simplifier.cc2502 if (user->InputCount() == 0u || user->InputAt(0u) != sb) { in TryReplaceStringBuilderAppend()
2610 if (holder->InputCount() == 0 || holder->InputAt(0) != sb) { in TryReplaceStringBuilderAppend()
Dinliner.cc931 DCHECK_EQ(deopt_flag->InputCount(), 1u); in AddCHAGuard()
Dinstruction_builder.cc1054 size_t clinit_check_index = invoke->InputCount() - 1u; in BuildInvoke()
Dintrinsics_x86.cc2973 DCHECK_EQ(invoke->InputCount(), invoke->GetNumberOfArguments() + 1u); in VisitIntegerValueOf()

12