Home
last modified time | relevance | path

Searched refs:linear_order (Results 1 – 4 of 4) sorted by relevance

/art/compiler/optimizing/
Dlinear_order.h26 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order);
40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph() argument
45 linear_order->resize(graph->GetReversePostOrder().size()); in LinearizeGraph()
46 LinearizeGraphInternal(graph, ArrayRef<HBasicBlock*>(*linear_order)); in LinearizeGraph()
Dlinear_order.cc58 static bool IsLinearOrderWellFormed(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in IsLinearOrderWellFormed() argument
66 for (HBasicBlock* block : linear_order) { in IsLinearOrderWellFormed()
86 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in LinearizeGraphInternal() argument
87 DCHECK_EQ(linear_order.size(), graph->GetReversePostOrder().size()); in LinearizeGraphInternal()
117 linear_order[num_added] = current; in LinearizeGraphInternal()
128 DCHECK_EQ(num_added, linear_order.size()); in LinearizeGraphInternal()
130 DCHECK(graph->HasIrreducibleLoops() || IsLinearOrderWellFormed(graph, linear_order)); in LinearizeGraphInternal()
Dloop_optimization.cc525 ScopedArenaVector<HBasicBlock*> linear_order(loop_allocator_->Adapter(kArenaAllocLinearOrder)); in LocalRun() local
526 LinearizeGraph(graph_, &linear_order); in LocalRun()
529 for (HBasicBlock* block : linear_order) { in LocalRun()
/art/compiler/
DAndroid.bp73 "optimizing/linear_order.cc",