Home
last modified time | relevance | path

Searched refs:Done (Results 51 – 75 of 79) sorted by relevance

1234

/art/compiler/optimizing/
Dgraph_checker.cc163 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock()
180 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock()
522 for (HInstructionIterator phi_it(catch_block->GetPhis()); !phi_it.Done(); phi_it.Advance()) { in VisitInstruction()
737 for (HLoopInformationOutwardIterator it(*loop_header); !it.Done(); it.Advance()) { in HandleLoop()
909 !phi_it.Done(); in VisitPhi()
Dloop_optimization.cc75 for (it_loop.Advance(); !it_loop.Done(); it_loop.Advance()) { in IsEarlyExit()
652 for (HInstructionIterator it(header->GetPhis()); !it.Done(); it.Advance()) { in SimplifyInduction()
673 for (HBlocksInLoopIterator it(*node->loop_info); !it.Done(); it.Advance()) { in SimplifyBlocks()
718 for (HBlocksInLoopIterator it(*node->loop_info); !it.Done(); it.Advance()) { in TryOptimizeInnerLoopFinite()
939 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in ShouldVectorize()
1239 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in GenerateNewLoop()
1245 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in GenerateNewLoop()
2328 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in TrySetSimpleLoopHeader()
2368 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in IsEmptyBody()
2469 for (HBackwardInstructionIterator i(list); !i.Done(); i.Advance()) { in RemoveDeadInstructions()
Dprepare_for_register_allocation.cc31 for (HInstructionIteratorHandleChanges inst_it(block->GetInstructions()); !inst_it.Done(); in Run()
Dinstruction_simplifier_arm.cc62 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock()
Dinstruction_simplifier_arm64.cc64 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock()
Doptimizing_unit_test.h82 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in RemoveSuspendChecks()
Dinduction_var_range.h140 for (HInstructionIterator it(loop->GetHeader()->GetPhis()); !it.Done(); it.Advance()) { in ReVisit()
Dscheduler.cc583 for (HBackwardInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in Schedule()
783 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in IsSchedulable()
Dreference_type_propagation.cc133 for (HInstructionIterator iti(block->GetInstructions()); !iti.Done(); iti.Advance()) { in ValidateTypes()
340 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock()
346 for (HInstructionIteratorHandleChanges it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock()
Dconstant_folding.cc86 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock()
Dinduction_var_analysis.cc207 for (HInstructionIterator it(loop->GetHeader()->GetPhis()); !it.Done(); it.Advance()) { in RewriteBreakLoopBody()
266 for (HBlocksInLoopIterator it_loop(*loop); !it_loop.Done(); it_loop.Advance()) { in VisitLoop()
273 for (HInstructionIterator it(loop_block->GetPhis()); !it.Done(); it.Advance()) { in VisitLoop()
279 for (HInstructionIterator it(loop_block->GetInstructions()); !it.Done(); it.Advance()) { in VisitLoop()
Ddead_code_elimination.cc500 for (i.Advance(); !i.Done(); i.Advance()) { in RemoveDeadInstructions()
Dgraph_visualizer.cc730 for (HInstructionIterator it(list); !it.Done(); it.Advance()) { in PrintInstructions()
856 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock()
Dnodes.h1418 bool Done() const { return current_ == nullptr; } in Done() function
1421 DCHECK(!Done()); in Advance()
1426 DCHECK(!Done()); in Current()
2658 next_ = Done() ? nullptr : instruction_->GetNext(); in HInstructionIterator()
2661 bool Done() const { return instruction_ == nullptr; } in Done() function
2665 next_ = Done() ? nullptr : instruction_->GetNext(); in Advance()
2684 bool Done() const { return instruction_ == nullptr; } in Done() function
2701 next_ = Done() ? nullptr : instruction_->GetPrevious(); in HBackwardInstructionIterator()
2704 bool Done() const { return instruction_ == nullptr; } in Done() function
2708 next_ = Done() ? nullptr : instruction_->GetPrevious(); in Advance()
[all …]
Dinliner.cc110 !instr_it.Done(); in CountNumberOfInstructions()
1809 !instructions.Done(); in SubstituteArguments()
1934 !instr_it.Done(); in CanInlineBody()
Dregister_allocation_resolver.cc186 for (HInstructionIterator inst_it(block->GetPhis()); !inst_it.Done(); inst_it.Advance()) { in Resolve()
Dbounds_check_elimination.cc1697 for (it_loop.Advance(); !it_loop.Done(); it_loop.Advance()) { in IsEarlyExitLoop()
1931 for (HInstructionIterator it(true_block->GetInstructions()); !it.Done(); it.Advance()) { in InsertPhiNodes()
Dregister_allocator_graph_color.cc788 !instr_it.Done(); in ProcessInstructions()
793 for (HInstructionIterator phi_it(block->GetPhis()); !phi_it.Done(); phi_it.Advance()) { in ProcessInstructions()
Dsuperblock_cloner_test.cc433 DCHECK(!it.Done()); in TEST_F()
Dssa_liveness_analysis.h1065 !it.Done(); in AddBackEdgeUses()
/art/runtime/
Dmethod_handles-inl.h99 ALWAYS_INLINE bool Done() const { in Done() function
/art/libartbase/base/
Dbit_vector_test.cc42 EXPECT_TRUE(bv.Indexes().begin().Done()); in TEST()
/art/tools/veridex/
Dflow_analysis.cc96 for (DexSwitchTableIterator s_it(table); !s_it.Done(); s_it.Advance()) { in FindBranches()
/art/test/911-get-stack-trace/
Dexpected-cts-version.txt485 Done
Dexpected.txt919 Done

1234