Home
last modified time | relevance | path

Searched refs:postorder (Results 1 – 25 of 30) sorted by relevance

12

/third_party/flutter/skia/third_party/externals/spirv-tools/source/
Dcfa.h83 std::function<void(cbb_ptr)> postorder,
107 const vector<cbb_ptr>& postorder, get_blocks_func predecessor_func);
140 function<void(cbb_ptr)> postorder, in DepthFirstTraversal() argument
156 postorder(top.block); in DepthFirstTraversal()
177 const vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) { in CalculateDominators() argument
182 const size_t undefined_dom = postorder.size(); in CalculateDominators()
185 for (size_t i = 0; i < postorder.size(); i++) { in CalculateDominators()
186 idoms[postorder[i]] = { undefined_dom, i }; in CalculateDominators()
188 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index; in CalculateDominators()
193 for (auto b = postorder.rbegin() + 1; b != postorder.rend(); ++b) { in CalculateDominators()
[all …]
Dvalidate_cfg.cpp279 vector<const BasicBlock*> postorder; in PerformCfgChecks() local
288 ignore_block, [&](cbb_ptr b) { postorder.push_back(b); }, in PerformCfgChecks()
291 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
/third_party/spirv-tools/source/
Dcfa.h78 std::function<void(cbb_ptr)> postorder,
107 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func);
140 std::function<void(cbb_ptr)> postorder, in DepthFirstTraversal() argument
156 postorder(top.block); in DepthFirstTraversal()
176 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) { in CalculateDominators() argument
181 const size_t undefined_dom = postorder.size(); in CalculateDominators()
184 for (size_t i = 0; i < postorder.size(); i++) { in CalculateDominators()
185 idoms[postorder[i]] = {undefined_dom, i}; in CalculateDominators()
187 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index; in CalculateDominators()
192 for (auto b = postorder.rbegin() + 1; b != postorder.rend(); ++b) { in CalculateDominators()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
Dcfa.h78 std::function<void(cbb_ptr)> postorder,
107 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func);
140 std::function<void(cbb_ptr)> postorder, in DepthFirstTraversal() argument
156 postorder(top.block); in DepthFirstTraversal()
176 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) { in CalculateDominators() argument
181 const size_t undefined_dom = postorder.size(); in CalculateDominators()
184 for (size_t i = 0; i < postorder.size(); i++) { in CalculateDominators()
185 idoms[postorder[i]] = {undefined_dom, i}; in CalculateDominators()
187 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index; in CalculateDominators()
192 for (auto b = postorder.rbegin() + 1; b != postorder.rend(); ++b) { in CalculateDominators()
[all …]
/third_party/skia/third_party/externals/spirv-tools/source/
Dcfa.h78 std::function<void(cbb_ptr)> postorder,
107 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func);
140 std::function<void(cbb_ptr)> postorder, in DepthFirstTraversal() argument
156 postorder(top.block); in DepthFirstTraversal()
176 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) { in CalculateDominators() argument
181 const size_t undefined_dom = postorder.size(); in CalculateDominators()
184 for (size_t i = 0; i < postorder.size(); i++) { in CalculateDominators()
185 idoms[postorder[i]] = {undefined_dom, i}; in CalculateDominators()
187 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index; in CalculateDominators()
192 for (auto b = postorder.rbegin() + 1; b != postorder.rend(); ++b) { in CalculateDominators()
[all …]
/third_party/musl/libc-test/src/functional/
Dsearch_tsearch.c35 if (v == postorder) in act()
41 if (v == postorder || v == leaf) in act()
55 if (v == preorder || v == postorder) in getparent()
/third_party/boost/boost/graph/
Dtree_traits.hpp36 visitor.postorder(v, t); in traverse_tree()
43 template < typename Node, typename Tree > void postorder(Node, Tree&) {} in postorder() function
/third_party/skia/third_party/externals/spirv-tools/source/val/
Dvalidate_cfg.cpp634 ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) { in ValidateStructuredSelections() argument
636 for (auto iter = postorder.rbegin(); iter != postorder.rend(); ++iter) { in ValidateStructuredSelections()
688 const std::vector<const BasicBlock*>& postorder) { in StructuredControlFlowChecks() argument
825 if (auto error = ValidateStructuredSelections(_, postorder)) { in StructuredControlFlowChecks()
857 std::vector<const BasicBlock*> postorder; in PerformCfgChecks() local
866 ignore_block, [&](const BasicBlock* b) { postorder.push_back(b); }, in PerformCfgChecks()
869 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
931 StructuredControlFlowChecks(_, &function, back_edges, postorder)) in PerformCfgChecks()
/third_party/spirv-tools/source/val/
Dvalidate_cfg.cpp622 ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) { in ValidateStructuredSelections() argument
624 for (auto iter = postorder.rbegin(); iter != postorder.rend(); ++iter) { in ValidateStructuredSelections()
676 const std::vector<const BasicBlock*>& postorder) { in StructuredControlFlowChecks() argument
813 if (auto error = ValidateStructuredSelections(_, postorder)) { in StructuredControlFlowChecks()
845 std::vector<const BasicBlock*> postorder; in PerformCfgChecks() local
854 ignore_block, [&](const BasicBlock* b) { postorder.push_back(b); }, in PerformCfgChecks()
857 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
919 StructuredControlFlowChecks(_, &function, back_edges, postorder)) in PerformCfgChecks()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/
Dvalidate_cfg.cpp634 ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) { in ValidateStructuredSelections() argument
636 for (auto iter = postorder.rbegin(); iter != postorder.rend(); ++iter) { in ValidateStructuredSelections()
688 const std::vector<const BasicBlock*>& postorder) { in StructuredControlFlowChecks() argument
825 if (auto error = ValidateStructuredSelections(_, postorder)) { in StructuredControlFlowChecks()
857 std::vector<const BasicBlock*> postorder; in PerformCfgChecks() local
866 ignore_block, [&](const BasicBlock* b) { postorder.push_back(b); }, in PerformCfgChecks()
869 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
931 StructuredControlFlowChecks(_, &function, back_edges, postorder)) in PerformCfgChecks()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Ddominator_tree.cpp298 std::vector<const BasicBlock*> postorder; in GetDominatorEdges() local
300 postorder.push_back(b); in GetDominatorEdges()
323 *edges = CFA<BasicBlock>::CalculateDominators(postorder, predecessor_functor); in GetDominatorEdges()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_tree.cpp298 std::vector<const BasicBlock*> postorder; in GetDominatorEdges() local
300 postorder.push_back(b); in GetDominatorEdges()
323 *edges = CFA<BasicBlock>::CalculateDominators(postorder, predecessor_functor); in GetDominatorEdges()
/third_party/spirv-tools/source/opt/
Ddominator_tree.cpp298 std::vector<const BasicBlock*> postorder; in GetDominatorEdges() local
300 postorder.push_back(b); in GetDominatorEdges()
323 *edges = CFA<BasicBlock>::CalculateDominators(postorder, predecessor_functor); in GetDominatorEdges()
/third_party/gettext/gettext-runtime/intl/
Dtsearch.h38 postorder, enumerator
/third_party/skia/third_party/externals/microhttpd/src/microhttpd/
Dtsearch.h28 postorder, enumerator
/third_party/musl/src/search/
Dtwalk.c13 action(r, postorder, d); in walk()
/third_party/musl/porting/uniproton/kernel/include/
Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/ndk_musl_include/
Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/include/
Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/porting/liteos_m_iccarm/kernel/include/
Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/porting/liteos_m/kernel/include/
Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/libc-test/src/api/
Dsearch.c22 case postorder: in f()
/third_party/boost/libs/graph/example/
Dgraph_as_tree.cpp26 template < typename Node, typename Tree > void postorder(Node, Tree&) in postorder() function in tree_printer
/third_party/flutter/skia/third_party/externals/spirv-tools/source/opt/
Dlocal_single_store_elim_pass.cpp236 vector<const ir::BasicBlock*> postorder; in CalculateImmediateDominators() local
241 ignore_block, [&](cbb_ptr b) { postorder.push_back(b); }, in CalculateImmediateDominators()
244 postorder, AugmentedCFGPredecessorsFunction()); in CalculateImmediateDominators()
/third_party/ltp/tools/sparse/sparse-src/Documentation/
Ddev-options.rst58 Dump the reverse postorder traversal of the CFG.

12