Home
last modified time | relevance | path

Searched refs:GetReversePostOrder (Results 1 – 23 of 23) sorted by relevance

/art/compiler/optimizing/
Ddead_code_elimination.cc242 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in SimplifyAlwaysThrows()
325 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in SimplifyIfs()
429 for (size_t i = 1u, size = graph_->GetReversePostOrder().size(); i != size; ++i) { in ConnectSuccessiveBlocks()
430 HBasicBlock* block = graph_->GetReversePostOrder()[i]; in ConnectSuccessiveBlocks()
437 DCHECK_LT(i, IndexOfElement(graph_->GetReversePostOrder(), successor)); in ConnectSuccessiveBlocks()
440 DCHECK_EQ(size, graph_->GetReversePostOrder().size()); in ConnectSuccessiveBlocks()
441 DCHECK_EQ(block, graph_->GetReversePostOrder()[i]); in ConnectSuccessiveBlocks()
Dlinear_order.h45 linear_order->resize(graph->GetReversePostOrder().size()); in LinearizeGraph()
Dlinear_order.cc87 DCHECK_EQ(linear_order.size(), graph->GetReversePostOrder().size()); in LinearizeGraphInternal()
100 for (HBasicBlock* block : graph->GetReversePostOrder()) { in LinearizeGraphInternal()
Dside_effects_analysis.cc29 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dssa_phi_elimination.cc46 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in MarkDeadPhis()
136 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dssa_builder.cc34 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in FixNullConstantType()
67 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in EquivalentPhisCleanup()
89 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in FixEnvironmentPhis()
241 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in RunPrimitiveTypePropagation()
503 for (HBasicBlock* block : graph->GetReversePostOrder()) { in HasPhiEquivalentAtLoopEntry()
Dload_store_analysis.cc152 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dcha_guard_optimization.cc249 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dprepare_for_register_allocation.cc29 for (HBasicBlock* block : GetGraph()->GetReversePostOrder()) { in Run()
Dnodes.cc224 for (HBasicBlock* block : GetReversePostOrder()) { in ClearDominanceInformation()
232 for (HBasicBlock* block : GetReversePostOrder()) { in ClearLoopInformation()
322 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeDominanceInformation()
333 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeDominanceInformation()
342 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeDominanceInformation()
537 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeTryBlockInformation()
1534 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in VisitReversePostOrder()
2525 for (HBasicBlock* current : GetReversePostOrder()) { in InlineInto()
Dbounds_check_elimination.cc2055 for (size_t i = 0, size = graph_->GetReversePostOrder().size(); i != size; ++i) { in Run()
2056 HBasicBlock* current = graph_->GetReversePostOrder()[i]; in Run()
2065 size_t new_size = graph_->GetReversePostOrder().size(); in Run()
2068 DCHECK_EQ(current, graph_->GetReversePostOrder()[i]); in Run()
Dgvn.cc418 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dreference_type_propagation.cc132 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in ValidateTypes()
329 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dscheduler.cc569 for (HBasicBlock* block : graph->GetReversePostOrder()) { in Schedule()
Dload_store_elimination.cc932 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dgraph_checker.cc64 size_t current_size = GetGraph()->GetReversePostOrder().size(); in Run()
Dsuperblock_cloner.cc1053 for (HBasicBlock* orig_block : graph_->GetReversePostOrder()) { in CloneBasicBlocks()
Dnodes.h563 const ArenaVector<HBasicBlock*>& GetReversePostOrder() const { in GetReversePostOrder() function
568 DCHECK(GetReversePostOrder()[0] == entry_block_); in GetReversePostOrderSkipEntryBlock()
569 return ArrayRef<HBasicBlock* const>(GetReversePostOrder()).SubArray(1); in GetReversePostOrderSkipEntryBlock()
573 return ReverseRange(GetReversePostOrder()); in GetPostOrder()
8080 blocks_(info.GetHeader()->GetGraph()->GetReversePostOrder()), in HBlocksInLoopReversePostOrderIterator()
Dinduction_var_analysis.cc250 for (HBasicBlock* graph_block : graph_->GetReversePostOrder()) { in Run()
Dinstruction_builder.cc137 for (HBasicBlock* current : graph_->GetReversePostOrder()) { in InitializeBlockLocals()
329 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Build()
Dcode_generator.cc1093 for (HBasicBlock* block : graph.GetReversePostOrder()) { in CheckLoopEntriesCanBeUsedForOsr()
Dinliner.cc163 ArenaVector<HBasicBlock*> blocks = graph_->GetReversePostOrder(); in Run()
Dinstruction_simplifier.cc159 for (HBasicBlock* block : GetGraph()->GetReversePostOrder()) { in Run()