Home
last modified time | relevance | path

Searched refs:GetInputCount (Results 1 – 12 of 12) sorted by relevance

/art/compiler/optimizing/
Dlocations.h519 size_t GetInputCount() const { in GetInputCount() function
Dgraph_visualizer.cc593 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in PrintInstruction()
Dregister_allocator_linear_scan.cc288 for (size_t i = 0; i < locations->GetInputCount(); ++i) { in ProcessInstruction()
Dintrinsics_x86.cc371 if (locations->GetInputCount() == 2 && locations->InAt(1).IsValid()) { in MathAbsFP()
565 if (locations->GetInputCount() == 3 && locations->InAt(2).IsValid()) { in GenMinMaxFP()
918 if (locations->GetInputCount() == 2 && locations->InAt(1).IsValid()) { in VisitMathRoundFloat()
Dregister_allocator_graph_color.cc857 for (size_t i = 0; i < locations->GetInputCount(); ++i) { in CheckForFixedInputs()
Dcode_generator_arm64.cc5413 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()
Dcode_generator_mips64.cc5600 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()
Dcode_generator_x86_64.cc4209 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()
Dcode_generator_x86.cc4456 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()
Dcode_generator_arm.cc5023 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()
Dcode_generator_arm_vixl.cc5019 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()
Dcode_generator_mips.cc7703 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in VisitPhi()