/third_party/flutter/skia/third_party/externals/spirv-tools/source/ |
D | cfa.h | 83 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 …]
|
D | validate_cfg.cpp | 279 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/ |
D | cfa.h | 78 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/ |
D | cfa.h | 78 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/ |
D | cfa.h | 78 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/ |
D | search_tsearch.c | 35 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/ |
D | tree_traits.hpp | 36 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/ |
D | validate_cfg.cpp | 634 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/ |
D | validate_cfg.cpp | 622 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/ |
D | validate_cfg.cpp | 634 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/ |
D | dominator_tree.cpp | 298 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/ |
D | dominator_tree.cpp | 298 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/ |
D | dominator_tree.cpp | 298 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/ |
D | tsearch.h | 38 postorder, enumerator
|
/third_party/skia/third_party/externals/microhttpd/src/microhttpd/ |
D | tsearch.h | 28 postorder, enumerator
|
/third_party/musl/src/search/ |
D | twalk.c | 13 action(r, postorder, d); in walk()
|
/third_party/musl/porting/uniproton/kernel/include/ |
D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
/third_party/musl/ndk_musl_include/ |
D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
/third_party/musl/include/ |
D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
/third_party/musl/porting/liteos_m_iccarm/kernel/include/ |
D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
/third_party/musl/porting/liteos_m/kernel/include/ |
D | search.h | 14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
|
/third_party/musl/libc-test/src/api/ |
D | search.c | 22 case postorder: in f()
|
/third_party/boost/libs/graph/example/ |
D | graph_as_tree.cpp | 26 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/ |
D | local_single_store_elim_pass.cpp | 236 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/ |
D | dev-options.rst | 58 Dump the reverse postorder traversal of the CFG.
|