Searched refs:preorder (Results 1 - 5 of 5) sorted by relevance
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 199 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 D | nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true); 164 IteratorRef safeIteratorDFS(bool preorder = true);
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 199 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 D | nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true); 164 IteratorRef safeIteratorDFS(bool preorder = true);
|
/external/clang/utils/ |
H A D | FindSpecRefs | 795 def preorder(node,parents=(),first=True): function 800 for item in preorder(c, parents+(node,)): 858 for path in preorder(node,first=False):
|
Completed in 302 milliseconds