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.cc156 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.cc225 for (HBasicBlock* block : GetReversePostOrder()) { in ClearDominanceInformation()
233 for (HBasicBlock* block : GetReversePostOrder()) { in ClearLoopInformation()
323 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeDominanceInformation()
334 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeDominanceInformation()
343 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeDominanceInformation()
538 for (HBasicBlock* block : GetReversePostOrder()) { in ComputeTryBlockInformation()
1535 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in VisitReversePostOrder()
2525 for (HBasicBlock* current : GetReversePostOrder()) { in InlineInto()
Dbounds_check_elimination.cc1954 for (size_t i = 0, size = graph_->GetReversePostOrder().size(); i != size; ++i) { in Run()
1955 HBasicBlock* current = graph_->GetReversePostOrder()[i]; in Run()
1964 size_t new_size = graph_->GetReversePostOrder().size(); in Run()
1967 DCHECK_EQ(current, graph_->GetReversePostOrder()[i]); in Run()
Dgvn.cc403 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dreference_type_propagation.cc170 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in ValidateTypes()
368 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dscheduler.cc568 for (HBasicBlock* block : graph->GetReversePostOrder()) { in Schedule()
Dload_store_elimination.cc940 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
Dsuperblock_cloner.cc1007 for (HBasicBlock* orig_block : graph_->GetReversePostOrder()) { in CloneBasicBlocks()
Dgraph_checker.cc63 size_t current_size = GetGraph()->GetReversePostOrder().size(); in Run()
Dnodes.h508 const ArenaVector<HBasicBlock*>& GetReversePostOrder() const { in GetReversePostOrder() function
513 DCHECK(GetReversePostOrder()[0] == entry_block_); in GetReversePostOrderSkipEntryBlock()
514 return ArrayRef<HBasicBlock* const>(GetReversePostOrder()).SubArray(1); in GetReversePostOrderSkipEntryBlock()
518 return ReverseRange(GetReversePostOrder()); in GetPostOrder()
7996 blocks_(info.GetHeader()->GetGraph()->GetReversePostOrder()), in HBlocksInLoopReversePostOrderIterator()
Dinstruction_builder.cc138 for (HBasicBlock* current : graph_->GetReversePostOrder()) { in InitializeBlockLocals()
330 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Build()
Dinduction_var_analysis.cc250 for (HBasicBlock* graph_block : graph_->GetReversePostOrder()) { in Run()
Dcode_generator.cc1042 for (HBasicBlock* block : graph.GetReversePostOrder()) { in CheckLoopEntriesCanBeUsedForOsr()
Dinliner.cc164 ArenaVector<HBasicBlock*> blocks = graph_->GetReversePostOrder(); in Run()
Dinstruction_simplifier.cc153 for (HBasicBlock* block : GetGraph()->GetReversePostOrder()) { in Run()