| /art/compiler/optimizing/ |
| D | locations.cc | 26 : inputs_(instruction->GetBlock()->GetGraph()->GetArena(), instruction->InputCount()), in LocationSummary()
34 inputs_.SetSize(instruction->InputCount()); in LocationSummary()
35 for (size_t i = 0; i < instruction->InputCount(); ++i) { in LocationSummary()
|
| D | primitive_type_propagation.cc | 47 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in UpdateType()
58 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in UpdateType()
|
| D | graph_checker.cc | 189 if ((use_index >= use->InputCount()) || (use->InputAt(use_index) != instruction)) { in VisitInstruction()
212 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in VisitInstruction()
236 size_t last_input_index = invoke->InputCount() - 1; in VisitInvokeStaticOrDirect()
458 if (phi->InputCount() != predecessors.Size()) { in VisitPhi()
462 phi->GetId(), phi->GetBlock()->GetBlockId(), phi->InputCount(), in VisitPhi()
467 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in VisitPhi()
481 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in VisitPhi()
|
| D | ssa_phi_elimination.cc | 82 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in EliminateDeadPhis()
125 for (size_t i = 1; i < phi->InputCount(); ++i) { in Run()
|
| D | prepare_for_register_allocation.cc | 84 size_t last_input_index = invoke->InputCount() - 1; in VisitInvokeStaticOrDirect()
|
| D | pretty_printer.h | 42 if (instruction->InputCount() != 0) { in PrintPostInstruction()
|
| D | reference_type_propagation.cc | 283 for (size_t i = 1; i < instr->InputCount(); i++) { in UpdatePhi()
308 for (size_t i = 0; i < phi->InputCount(); i++) { in UpdateNullability()
|
| D | ssa_builder.cc | 63 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in UpdateType()
485 HPhi* new_phi = new (allocator) HPhi(allocator, phi->GetRegNumber(), phi->InputCount(), type); in GetFloatDoubleOrReferenceEquivalentOfPhi()
486 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in GetFloatDoubleOrReferenceEquivalentOfPhi()
|
| D | ssa_liveness_analysis.cc | 241 for (size_t i = 0, e = current->InputCount(); i < e; ++i) { in ComputeLiveRanges()
380 for (size_t i = 0, e = user->InputCount(); i < e; ++i) { in FindFirstRegisterHint()
421 for (size_t i = 0, e = defined_by_->InputCount(); i < e; ++i) { in FindHintAtDefinition()
|
| D | graph_visualizer.cc | 207 if (instruction->InputCount() > 0) { in PrintInstruction()
246 for (size_t i = 0; i < instruction->InputCount(); ++i) { in PrintInstruction()
|
| D | nodes.cc | 38 for (size_t i = 0; i < instruction->InputCount(); i++) { in RemoveAsUser()
457 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in UpdateInputsUsers()
778 for (size_t i = index, e = InputCount(); i < e; ++i) { in RemoveInputAt()
882 if (InputCount() != other->InputCount()) return false; in Equals()
884 for (size_t i = 0, e = InputCount(); i < e; ++i) { in Equals()
1381 size_t last_input_index = invoke->InputCount() - 1; in InlineInto()
|
| D | nodes.h | 1326 virtual size_t InputCount() const = 0;
1501 for (size_t i = 0, e = InputCount(); i < e; ++i) { in ComputeHashCode()
1587 bool Done() const { return index_ == instruction_->InputCount(); } in Done()
1694 size_t InputCount() const OVERRIDE { return N; } in InputCount() function
2378 size_t InputCount() const OVERRIDE { return inputs_.Size(); } in InputCount() function
2501 size_t last_input_index = InputCount() - 1; in RemoveLoadClassAsLastInput()
2528 if (kIsDebugBuild && IsStaticWithExplicitClinitCheck() && (i == InputCount() - 1)) { in InputRecordAt()
3049 size_t InputCount() const OVERRIDE { return inputs_.Size(); } in InputCount() function
|
| D | code_generator.cc | 94 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in CheckTypeConsistency()
415 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in InitLocationsBaseline()
|
| D | bounds_check_elimination.cc | 1472 for (size_t i = 2, e = phi->InputCount(); i < e; ++i) { in HasSameInputAtBackEdges()
|
| D | code_generator_arm64.cc | 1102 DCHECK_EQ(instr->InputCount(), 2U); in FOR_EACH_UNIMPLEMENTED_INSTRUCTION()
2436 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in VisitPhi()
|
| D | register_allocator.cc | 293 for (size_t i = 0; i < instruction->InputCount(); ++i) { in ProcessInstruction()
|
| D | code_generator_mips64.cc | 1010 DCHECK_EQ(instruction->InputCount(), 2U); in HandleBinaryOp()
2844 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in VisitPhi()
|
| D | code_generator_arm.cc | 2772 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in VisitPhi()
|
| D | code_generator_x86_64.cc | 3119 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in VisitPhi()
|
| D | code_generator_x86.cc | 3162 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in VisitPhi()
|