| /art/compiler/dex/ |
| D | post_opt_passes.cc | 57 for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) { in Start()
63 for (BasicBlock* bb = second.Next(); bb != nullptr; bb = second.Next()) { in Start()
73 for (BasicBlock* child = child_iter.Next(); child != nullptr; child = child_iter.Next()) { in Start()
|
| D | dataflow_iterator.h | 63 virtual BasicBlock* Next(bool had_change = false) = 0;
135 virtual BasicBlock* Next(bool had_change = false) {
166 virtual BasicBlock* Next(bool had_change = false) {
197 virtual BasicBlock* Next(bool had_change = false) {
227 virtual BasicBlock* Next(bool had_change = false) {
258 virtual BasicBlock* Next(bool had_change = false) {
288 virtual BasicBlock* Next(bool had_change = false) {
322 virtual BasicBlock* Next(bool had_change = false) ALWAYS_INLINE;
349 virtual BasicBlock* Next(bool had_change = false) OVERRIDE;
396 virtual BasicBlock* Next(bool had_change = false) OVERRIDE;
|
| D | ssa_transformation.cc | 29 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in ClearAllVisitedFlags()
110 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in ComputeDFSOrders()
152 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in ComputeDefBlockMatrix()
156 for (BasicBlock* bb = iter2.Next(); bb != nullptr; bb = iter2.Next()) { in ComputeDefBlockMatrix()
360 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in ComputeDominators()
379 for (BasicBlock* bb = iter2.Next(false); bb != nullptr; bb = iter2.Next(change)) { in ComputeDominators()
390 for (BasicBlock* bb = iter3.Next(); bb != nullptr; bb = iter3.Next()) { in ComputeDominators()
395 for (BasicBlock* bb = iter4.Next(); bb != nullptr; bb = iter4.Next()) { in ComputeDominators()
402 for (BasicBlock* bb = iter5.Next(); bb != nullptr; bb = iter5.Next()) { in ComputeDominators()
469 for (BasicBlock* bb = iter.Next(false); bb != nullptr; bb = iter.Next(change)) { in FindPhiNodeBlocks()
|
| D | dataflow_iterator-inl.h | 101 inline BasicBlock* AllNodesIterator::Next(bool had_change) { in Next() function
118 inline BasicBlock* TopologicalSortIterator::Next(bool had_change) { in Next() function
142 inline BasicBlock* LoopRepeatingTopologicalSortIterator::Next(bool had_change) { in Next() function
150 for (BasicBlock* child_bb = iter.Next(); child_bb != nullptr; child_bb = iter.Next()) { in Next()
|
| D | mir_optimization.cc | 905 for (BasicBlock* child = iter.Next(); child != nullptr; child = iter.Next()) { in CombineBlocks()
935 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in EliminateNullChecksGate()
1115 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in EliminateNullChecksEnd()
1190 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in EliminateClassInitChecksGate()
1397 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in ApplyGlobalValueNumberingEnd()
1443 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in EliminateDeadCodeEnd()
1574 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in DumpCheckStats()
1639 for (BasicBlock* bb = iter2.Next(); bb != nullptr; bb = iter2.Next()) { in BasicBlockOptimization()
1648 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in BasicBlockOptimization()
1663 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in StringChange()
|
| D | mir_analysis.cc | 1199 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in SkipCompilation()
1218 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in DoCacheFieldLoweringInfo()
1359 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) { in DoCacheMethodLoweringInfo()
|
| D | verified_method.cc | 211 for (; inst < end; inst = inst->Next()) { in GenerateDequickenMap()
258 for (; inst < end; inst = inst->Next()) { in GenerateDevirtMap()
335 for (; inst < end; inst = inst->Next()) { in GenerateSafeCastSet()
|
| D | pass_driver_me.h | 192 for (BasicBlock* bb = iterator->Next(change); bb != nullptr; bb = iterator->Next(change)) { in DoWalkBasicBlocks()
|
| D | dex_to_dex_compiler.cc | 101 inst = const_cast<Instruction*>(inst->Next()), dex_pc = inst->GetDexPc(insns)) { in Compile()
222 inst = const_cast<Instruction*>(inst->Next()); in CompileCheckCast()
|
| D | mir_graph.cc | 379 for (; iterator.HasNext(); iterator.Next()) { in ProcessTryCatchBlocks()
406 check_insn = check_insn->Next(); in IsBadMonitorExitCatch()
450 check_insn = check_insn->Next(); in IsBadMonitorExitCatch()
613 for (; iterator.HasNext(); iterator.Next()) { in ProcessCanThrow()
1870 for (BasicBlock* candidate = iter.Next(); candidate != nullptr; candidate = iter.Next()) { in SelectTopologicalSortOrderFallBack()
1888 BasicBlock* child_bb = child_iter.Next(); in SelectTopologicalSortOrderFallBack()
1889 for ( ; child_bb != nullptr; child_bb = child_iter.Next()) { in SelectTopologicalSortOrderFallBack()
2010 BasicBlock* candidate = iter.Next(); in ComputeTopologicalSortOrder()
2070 BasicBlock* successor = succIter.Next(); in ComputeTopologicalSortOrder()
2071 for ( ; successor != nullptr; successor = succIter.Next()) { in ComputeTopologicalSortOrder()
[all …]
|
| D | mir_optimization_test.cc | 384 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformClassInitCheckElimination()
437 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformNullCheckElimination()
483 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformSuspendCheckElimination()
|
| /art/runtime/ |
| D | dex_method_iterator.h | 71 GetIterator().Next(); in HasNext()
74 GetIterator().Next(); in HasNext()
98 void Next() { in Next() function
102 GetIterator().Next(); in Next()
|
| D | dex_method_iterator_test.cc | 45 it.Next(); in TEST_F()
|
| D | exception_test.cc | 140 iter.Next(); in TEST_F()
143 iter.Next(); in TEST_F()
150 iter.Next(); in TEST_F()
|
| D | dex_file_verifier.cc | 688 for (; it.HasNextStaticField(); it.Next()) { in CheckIntraClassDataItem()
700 for (; it.HasNextInstanceField(); it.Next()) { in CheckIntraClassDataItem()
712 for (; it.HasNextDirectMethod(); it.Next()) { in CheckIntraClassDataItem()
725 for (; it.HasNextVirtualMethod(); it.Next()) { in CheckIntraClassDataItem()
1569 it.Next(); in CheckInterProtoIdItem()
1605 prev_it.Next(); in CheckInterProtoIdItem()
1606 curr_it.Next(); in CheckInterProtoIdItem()
1876 for (; it.HasNextStaticField() || it.HasNextInstanceField(); it.Next()) { in CheckInterClassDataItem()
1883 for (; it.HasNextDirectMethod() || it.HasNextVirtualMethod(); it.Next()) { in CheckInterClassDataItem()
|
| /art/compiler/jni/quick/ |
| D | jni_compiler.cc | 135 main_jni_conv->Next(); // Skip JNIEnv* in ArtJniCompileMethodInternal()
147 main_jni_conv->Next(); // in handle scope so move to next argument in ArtJniCompileMethodInternal()
177 mr_conv->Next(); in ArtJniCompileMethodInternal()
178 main_jni_conv->Next(); in ArtJniCompileMethodInternal()
199 main_jni_conv->Next(); // Skip JNIEnv. in ArtJniCompileMethodInternal()
213 main_jni_conv->Next(); in ArtJniCompileMethodInternal()
248 main_jni_conv->Next(); // Skip JNIEnv. in ArtJniCompileMethodInternal()
260 main_jni_conv->Next(); in ArtJniCompileMethodInternal()
296 mr_conv->Next(); in ArtJniCompileMethodInternal()
305 main_jni_conv->Next(); // Skip JNIEnv*. in ArtJniCompileMethodInternal()
[all …]
|
| D | calling_convention.cc | 57 void ManagedRuntimeCallingConvention::Next() { in Next() function in art::ManagedRuntimeCallingConvention
151 void JniCallingConvention::Next() { in Next() function in art::JniCallingConvention
|
| D | calling_convention.h | 233 void Next();
306 virtual void Next();
|
| /art/compiler/jni/quick/arm/ |
| D | calling_convention_arm.cc | 201 Next(); in EntrySpills()
274 void ArmJniCallingConvention::Next() { in Next() function in art::arm::ArmJniCallingConvention
275 JniCallingConvention::Next(); in Next()
|
| D | calling_convention_arm.h | 58 void Next() OVERRIDE; // Override default behavior for AAPCS
|
| /art/compiler/jni/quick/mips/ |
| D | calling_convention_mips.cc | 165 void MipsJniCallingConvention::Next() { in Next() function in art::mips::MipsJniCallingConvention
166 JniCallingConvention::Next(); in Next()
|
| D | calling_convention_mips.h | 58 void Next() OVERRIDE; // Override default behavior for AAPCS
|
| /art/runtime/quick/ |
| D | inline_method_analyser.cc | 169 const Instruction* return_instruction = instruction->Next(); in AnalyseConstMethod()
205 const Instruction* return_instruction = instruction->Next(); in AnalyseIGetMethod()
268 const Instruction* return_instruction = instruction->Next(); in AnalyseIPutMethod()
|
| /art/runtime/native/ |
| D | dalvik_system_VMRuntime.cc | 521 for (; it.HasNextStaticField(); it.Next()) { in VMRuntime_preloadDexCaches()
525 for (; it.HasNextInstanceField(); it.Next()) { in VMRuntime_preloadDexCaches()
529 for (; it.HasNextDirectMethod(); it.Next()) { in VMRuntime_preloadDexCaches()
534 for (; it.HasNextVirtualMethod(); it.Next()) { in VMRuntime_preloadDexCaches()
|
| /art/compiler/jni/quick/x86/ |
| D | calling_convention_x86.cc | 161 Next(); in EntrySpills()
|