| /third_party/mesa3d/src/nouveau/codegen/ |
| H A 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()
[all...] |
| H A D | nv50_ir_graph.h | 159 IteratorRef iteratorDFS(bool preorder = true);
163 IteratorRef safeIteratorDFS(bool preorder = true);
|
| /third_party/spirv-tools/source/ |
| H A D | cfa.h | 64 /// @param[in] preorder A function that will be called for every block in a
65 /// CFG following preorder traversal semantics
75 std::function<void(cbb_ptr)> preorder,
90 /// @param[in] preorder A function that will be called for every block in a
91 /// CFG following preorder traversal semantics
103 std::function<void(cbb_ptr)> preorder,
166 std::function<void(cbb_ptr)> preorder, in DepthFirstTraversal()
169 DepthFirstTraversal(entry, successor_func, preorder, postorder, in DepthFirstTraversal()
176 std::function<void(cbb_ptr)> preorder, in DepthFirstTraversal()
181 assert(preorder in DepthFirstTraversal()
164 DepthFirstTraversal(const BB* entry, get_blocks_func successor_func, std::function<void(cbb_ptr)> preorder, std::function<void(cbb_ptr)> postorder, std::function<bool(cbb_ptr)> terminal) DepthFirstTraversal() argument
174 DepthFirstTraversal( const BB* entry, get_blocks_func successor_func, std::function<void(cbb_ptr)> preorder, std::function<void(cbb_ptr)> postorder, std::function<void(cbb_ptr, cbb_ptr)> backedge, std::function<bool(cbb_ptr)> terminal) DepthFirstTraversal() argument
[all...] |
| /third_party/musl/libc-test/src/functional/ |
| H A D | search_tsearch.c | 29 if (v == preorder) in act()
31 t_error("preorder visited node \"%s\" before \"%c\"\n", e->k, wantc); in act()
52 if (v == preorder || v == leaf) in getparent()
55 if (v == preorder || v == postorder) in getparent()
|
| /third_party/skia/third_party/externals/spirv-tools/source/ |
| H A D | cfa.h | 65 /// @param[in] preorder A function that will be called for every block in a
66 /// CFG following preorder traversal semantics
77 std::function<void(cbb_ptr)> preorder,
139 std::function<void(cbb_ptr)> preorder, in DepthFirstTraversal()
150 preorder(entry); in DepthFirstTraversal()
165 preorder(child); in DepthFirstTraversal()
137 DepthFirstTraversal( const BB* entry, get_blocks_func successor_func, std::function<void(cbb_ptr)> preorder, std::function<void(cbb_ptr)> postorder, std::function<void(cbb_ptr, cbb_ptr)> backedge) DepthFirstTraversal() argument
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/ |
| H A D | cfa.h | 65 /// @param[in] preorder A function that will be called for every block in a
66 /// CFG following preorder traversal semantics
77 std::function<void(cbb_ptr)> preorder,
139 std::function<void(cbb_ptr)> preorder, in DepthFirstTraversal()
150 preorder(entry); in DepthFirstTraversal()
165 preorder(child); in DepthFirstTraversal()
137 DepthFirstTraversal( const BB* entry, get_blocks_func successor_func, std::function<void(cbb_ptr)> preorder, std::function<void(cbb_ptr)> postorder, std::function<void(cbb_ptr, cbb_ptr)> backedge) DepthFirstTraversal() argument
|
| /third_party/skia/third_party/externals/microhttpd/src/microhttpd/ |
| H A D | tsearch.h | 27 preorder, enumerator
|
| /third_party/musl/src/search/ |
| H A D | twalk.c | 11 action(r, preorder, d); in walk()
|
| /third_party/musl/porting/liteos_m_iccarm/kernel/include/ |
| H A D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
| /third_party/musl/porting/uniproton/kernel/include/ |
| H A D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
| /third_party/musl/porting/liteos_m/kernel/include/ |
| H A D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
| /third_party/musl/include/ |
| H A D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
| /third_party/musl/libc-test/src/api/ |
| H A D | search.c | 21 case preorder: in f()
|
| /third_party/alsa-lib/include/ |
| H A D | search.h | 121 preorder, enumerator
|