| /external/bcc/tools/ |
| D | deadlock_detector.py | 151 preorder = {}
161 if v not in preorder:
163 preorder[v] = i
167 if w not in preorder:
172 lowlink[v] = preorder[v]
175 if preorder[w] > preorder[v]:
178 lowlink[v] = min([lowlink[v], preorder[w]])
180 if lowlink[v] == preorder[v]:
184 scc_queue and preorder[scc_queue[-1]] > preorder[v]
|
| /external/mesa3d/src/gallium/drivers/nouveau/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/toolchain-utils/binary_search_tool/full_bisect_test/ |
| D | 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 …
|
| D | 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…
|
| /external/swiftshader/third_party/SPIRV-Tools/source/ |
| D | cfa.h | 77 std::function<void(cbb_ptr)> preorder,
139 std::function<void(cbb_ptr)> preorder, in DepthFirstTraversal() argument
150 preorder(entry); in DepthFirstTraversal()
165 preorder(child); in DepthFirstTraversal()
|
| /external/deqp-deps/SPIRV-Tools/source/ |
| D | cfa.h | 77 std::function<void(cbb_ptr)> preorder,
139 std::function<void(cbb_ptr)> preorder, in DepthFirstTraversal() argument
150 preorder(entry); in DepthFirstTraversal()
165 preorder(child); in DepthFirstTraversal()
|
| /external/python/cpython2/Lib/compiler/ |
| D | visitor.py | 59 def preorder(self, tree, visitor, *args): member in ASTVisitor
106 walker.preorder(tree, visitor)
|
| /external/toolchain-utils/binary_search_tool/full_bisect_test/good-objects-permanent/ |
| D | _LIST | 6 preorder.o
|
| /external/toolchain-utils/binary_search_tool/full_bisect_test/bad-objects-permanent/ |
| D | _LIST | 6 preorder.o
|
| /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/antlr/runtime/ObjC/Framework/ |
| D | TreeFilter.m | 69 scalar-vector multiply transformation on the way down (preorder) and
73 executing an action in the preorder position. To get a bottom-up
|
| /external/python/cpython2/Parser/ |
| D | spark.py | 733 def preorder(self, node=None): member in GenericASTTraversal
748 self.preorder(kid)
|
| /external/python/cpython2/Doc/library/ |
| D | compiler.rst | 610 order. A walk begins with a call to :meth:`preorder`. For each node, it checks
611 the *visitor* argument to :meth:`preorder` for a method named 'visitNodeType,'
633 .. method:: preorder(tree, visitor)
|
| /external/swiftshader/third_party/llvm-7.0/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/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/libdw/ |
| D | ChangeLog | 2927 Take two functions for both preorder and postorder visitors.
|