Searched refs:preorder (Results 1 – 5 of 5) sorted by relevance
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_graph.cpp | 199 DFSIterator(Graph *graph, const bool preorder) in DFSIterator() argument
210 search(graph->getRoot(), preorder, seq); in DFSIterator()
220 void search(Graph::Node *node, const bool preorder, const int sequence) in search() argument
222 if (preorder) in search()
227 search(ei.getNode(), preorder, sequence); in search()
229 if (!preorder) in search()
244 IteratorRef Graph::iteratorDFS(bool preorder) in iteratorDFS() argument
246 return IteratorRef(new DFSIterator(this, preorder)); in iteratorDFS()
249 IteratorRef Graph::safeIteratorDFS(bool preorder) in safeIteratorDFS() argument
251 return this->iteratorDFS(preorder); in safeIteratorDFS()
|
| D | nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorDFS(bool preorder = true);
|
| /external/clang/utils/ |
| 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):
|
| /external/llvm/docs/ |
| D | HowToSetUpLLVMStyleRTTI.rst | 287 preorder traversal of the class hierarchy tree. With that arrangement, all
405 according to a preorder traversal of the inheritance tree.
|
| /external/elfutils/src/libdw/ |
| D | ChangeLog | 1723 Take two functions for both preorder and postorder visitors.
|