Lines Matching refs:mir_graph
21 #include "mir_graph.h"
62 DataflowIterator(MIRGraph* mir_graph, bool is_iterative, int start_idx, int end_idx,
64 : mir_graph_(mir_graph),
87 ReachableNodesIterator(MIRGraph* mir_graph, bool is_iterative)
88 : DataflowIterator(mir_graph, is_iterative, 0,
89 mir_graph->GetNumReachableBlocks(), false) {
91 block_id_list_ = mir_graph->GetDfsOrder();
97 PreOrderDfsIterator(MIRGraph* mir_graph, bool is_iterative)
98 : DataflowIterator(mir_graph, is_iterative, 0,
99 mir_graph->GetNumReachableBlocks(), false) {
101 block_id_list_ = mir_graph->GetDfsOrder();
107 PostOrderDfsIterator(MIRGraph* mir_graph, bool is_iterative)
108 : DataflowIterator(mir_graph, is_iterative, 0,
109 mir_graph->GetNumReachableBlocks(), false) {
111 block_id_list_ = mir_graph->GetDfsPostOrder();
117 ReversePostOrderDfsIterator(MIRGraph* mir_graph, bool is_iterative)
118 : DataflowIterator(mir_graph, is_iterative,
119 mir_graph->GetNumReachableBlocks() -1, 0, true) {
121 block_id_list_ = mir_graph->GetDfsPostOrder();
127 PostOrderDOMIterator(MIRGraph* mir_graph, bool is_iterative)
128 : DataflowIterator(mir_graph, is_iterative, 0,
129 mir_graph->GetNumReachableBlocks(), false) {
131 block_id_list_ = mir_graph->GetDomPostOrder();
137 AllNodesIterator(MIRGraph* mir_graph, bool is_iterative)
138 : DataflowIterator(mir_graph, is_iterative, 0, 0, false) {
140 new (mir_graph->GetArena()) GrowableArray<BasicBlock*>::Iterator(mir_graph->GetBlockList());
