| /bionic/libc/include/ |
| search.h | 16 preorder, enumerator in enum:__anon175
|
| /development/ndk/platforms/android-L/include/ |
| search.h | 16 preorder, enumerator in enum:__anon2525
|
| /prebuilts/ndk/9/platforms/android-19/arch-arm64/usr/include/ |
| search.h | 16 preorder, enumerator in enum:__anon74777
|
| /prebuilts/ndk/9/platforms/android-19/arch-mips64/usr/include/ |
| search.h | 16 preorder, enumerator in enum:__anon76085
|
| /prebuilts/ndk/9/platforms/android-19/arch-x86_64/usr/include/ |
| search.h | 16 preorder, enumerator in enum:__anon77395
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 199 DFSIterator(Graph *graph, const bool preorder)
210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence)
222 if (preorder)
227 search(ei.getNode(), preorder, sequence);
229 if (!preorder)
244 IteratorRef Graph::iteratorDFS(bool preorder)
246 return IteratorRef(new DFSIterator(this, preorder));
249 IteratorRef Graph::safeIteratorDFS(bool preorder)
251 return this->iteratorDFS(preorder);
[all...] |
| nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorDFS(bool preorder = true);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 199 DFSIterator(Graph *graph, const bool preorder)
210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence)
222 if (preorder)
227 search(ei.getNode(), preorder, sequence);
229 if (!preorder)
244 IteratorRef Graph::iteratorDFS(bool preorder)
246 return IteratorRef(new DFSIterator(this, preorder));
249 IteratorRef Graph::safeIteratorDFS(bool preorder)
251 return this->iteratorDFS(preorder);
[all...] |
| nv50_ir_graph.h | 160 IteratorRef iteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorDFS(bool preorder = true);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 9 The ASTVisitor will walk the AST, performing either a preorder or
13 preorder(tree, visitor)
25 child nodes are visited during a preorder walk. (It can't control
59 def preorder(self, tree, visitor, *args): member in class:ASTVisitor
60 """Do preorder walk of tree using visitor"""
106 walker.preorder(tree, visitor)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 9 The ASTVisitor will walk the AST, performing either a preorder or
13 preorder(tree, visitor)
25 child nodes are visited during a preorder walk. (It can't control
59 def preorder(self, tree, visitor, *args): member in class:ASTVisitor
60 """Do preorder walk of tree using visitor"""
106 walker.preorder(tree, visitor)
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| search.h | 47 preorder, enumerator in enum:__anon50467
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/ |
| search.h | 121 preorder, enumerator in enum:__anon46396
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
| search.h | 121 preorder, enumerator in enum:__anon48132
|
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tsearch.c | 101 (*action)(root, preorder, level);
|
| /external/clang/utils/ |
| 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):
[all...] |
| /external/chromium_org/v8/tools/ |
| profile_view.js | 132 * Traverses profile view nodes in preorder.
|
| splaytree.js | 287 * Performs a preorder traversal of the tree.
|
| profile.js | 625 * Traverses the call graph in preorder. This function can be used for
|
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regcomp.c | 38 static reg_errcode_t preorder (bin_tree_t *root,
1235 preorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), function
[all...] |
