HomeSort by relevance Sort by last modified time
    Searched refs:GetTopologicalSortOrder (Results 1 - 3 of 3) sorted by null

  /art/compiler/dex/
dataflow_iterator.h 340 : DataflowIterator(mir_graph, 0, mir_graph->GetTopologicalSortOrder()->Size()) {
343 block_id_list_ = mir_graph->GetTopologicalSortOrder();
372 : DataflowIterator(mir_graph, 0, mir_graph->GetTopologicalSortOrder()->Size()) {
375 block_id_list_ = mir_graph->GetTopologicalSortOrder();
411 : DataflowIterator(mir_graph, 0, mir_graph->GetTopologicalSortOrder()->Size()),
416 block_id_list_ = mir_graph->GetTopologicalSortOrder();
mir_graph_test.cc 123 for (size_t i = 0, size = cu_.mir_graph->GetTopologicalSortOrder()->Size(); i != size; ++i) {
131 ASSERT_EQ(count, cu_.mir_graph->GetTopologicalSortOrder()->Size());
133 EXPECT_EQ(ids[i], cu_.mir_graph->GetTopologicalSortOrder()->Get(i)) << i;
mir_graph.h 689 GrowableArray<BasicBlockId>* GetTopologicalSortOrder() {
    [all...]

Completed in 248 milliseconds