Searched refs:preorder (Results 1 - 4 of 4) sorted by relevance

/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp199 DFSIterator(Graph *graph, const bool preorder) argument
210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence) argument
222 if (preorder)
227 search(ei.getNode(), preorder, sequence);
229 if (!preorder)
244 IteratorRef Graph::iteratorDFS(bool preorder) argument
246 return IteratorRef(new DFSIterator(this, preorder));
249 IteratorRef Graph::safeIteratorDFS(bool preorder) argument
251 return this->iteratorDFS(preorder);
[all...]
H A Dnv50_ir_graph.h160 IteratorRef iteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorDFS(bool preorder = true);
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp199 DFSIterator(Graph *graph, const bool preorder) argument
210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence) argument
222 if (preorder)
227 search(ei.getNode(), preorder, sequence);
229 if (!preorder)
244 IteratorRef Graph::iteratorDFS(bool preorder) argument
246 return IteratorRef(new DFSIterator(this, preorder));
249 IteratorRef Graph::safeIteratorDFS(bool preorder) argument
251 return this->iteratorDFS(preorder);
[all...]
H A Dnv50_ir_graph.h159 IteratorRef iteratorDFS(bool preorder = true);
163 IteratorRef safeIteratorDFS(bool preorder = true);

Completed in 4 milliseconds