Searched defs:preorder (Results 1 - 3 of 3) sorted by path

/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/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...]
/external/clang/utils/
H A DFindSpecRefs795 def preorder(node,parents=(),first=True): function
800 for item in preorder(c, parents+(node,)):
858 for path in preorder(node,first=False):
/external/mesa3d/src/gallium/drivers/nv50/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...]

Completed in 232 milliseconds