HomeSort by relevance Sort by last modified time
    Searched refs:preorder (Results 1 - 25 of 39) sorted by null

1 2

  /external/toolchain-utils/binary_search_tool/full_bisect_test/
build.sh 15 gcc -c preorder.c -o work/preorder.o
21 gcc -o bin-trees work/main.o work/preorder.o work/inorder.o work/build.o work/preorder_norecurse.o work/inorder_norecurse.o work/stack.o
chromeos_build.sh 15 x86_64-cros-linux-gnu-gcc -c preorder.c -o work/preorder.o
21 x86_64-cros-linux-gnu-gcc -o bin-trees work/main.o work/preorder.o work/inorder.o work/build.o work/preorder_norecurse.o work/inorder_norecurse.o work/stack.o
  /external/libmicrohttpd/src/microhttpd/
tsearch.h 27 preorder, enumerator in enum:__anon25087
  /bionic/tests/headers/posix/
search_h.c 44 v = preorder;
  /external/mesa3d/src/gallium/drivers/nouveau/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);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/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)
  /external/python/cpython2/Lib/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/gdb/darwin-x86/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/gdb/linux-x86/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/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)
  /bionic/libc/include/
search.h 26 preorder, enumerator in enum:__anon307
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
search.h 47 preorder, enumerator in enum:__anon65615
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
ASTBase.cpp 86 ASTBase::preorder() function in class:ASTBase
98 tree->_down->preorder();
ASTBase.h 81 void preorder();
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
ASTBase.h 81 void preorder(void* pData = NULL /* MR23 */);
ASTBase.cpp 86 ASTBase::preorder(void* pData /*= NULL*/ /* MR23 */) function in class:ASTBase
98 tree->_down->preorder(pData);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/
search.h 121 preorder, enumerator in enum:__anon63061
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/
cfa.h 71 /// @param[in] preorder A function that will be called for every block in a
72 /// CFG following preorder traversal semantics
82 std::function<void(cbb_ptr)> preorder,
139 function<void(cbb_ptr)> preorder,
150 preorder(entry);
166 preorder(child);
  /bionic/libc/upstream-openbsd/lib/libc/stdlib/
tsearch.c 100 (*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...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
fset2.c 77 preorder( Tree *tree ) function
79 preorder( tree )
88 preorder(tree->down);
90 preorder(tree->right);
159 /*** preorder(t); ***/
388 *** preorder(t); fprintf(stderr, ",");
389 *** preorder(u); fprintf(stderr, " )\n");
443 /*fprintf(stderr, "tlink: u is:"); preorder(u); fprintf(stderr, "\n");*/
603 fprintf(stderr, "blk(%s) returns:",((Junction *)p)->rname); preorder(r); fprintf(stderr, "\n");
722 fprintf(stderr, "after ruleref, t is:"); preorder(t); fprintf(stderr, "\n");
    [all...]
dumpnode.c 100 preorder(p->tcontext);
223 preorder(j->ftree);
fset.c 604 preorder(non_covered);
609 preorder(ambig->down);
625 preorder(non_covered);
630 preorder(ambig->down);
    [all...]

Completed in 2104 milliseconds

1 2