Home
last modified time | relevance | path

Searched refs:postorder (Results 1 - 19 of 19) sorted by relevance

/third_party/skia/third_party/externals/spirv-tools/source/
H A Dcfa.h58 /// BasicBlock and calls the pre/postorder functions when it needs to process
67 /// @param[in] postorder A function that will be called for every block in a
68 /// CFG following postorder traversal semantics
78 std::function<void(cbb_ptr)> postorder,
87 /// predecessors), and it is therefore at the end of the postorder vector.
93 /// @param[in] postorder A vector of blocks in post order traversal
107 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func);
140 std::function<void(cbb_ptr)> postorder, in DepthFirstTraversal()
156 postorder(top.block); in DepthFirstTraversal()
176 const std::vector<cbb_ptr>& postorder, get_blocks_fun in CalculateDominators()
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
175 CalculateDominators( const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) CalculateDominators() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dcfa.h58 /// BasicBlock and calls the pre/postorder functions when it needs to process
67 /// @param[in] postorder A function that will be called for every block in a
68 /// CFG following postorder traversal semantics
78 std::function<void(cbb_ptr)> postorder,
87 /// predecessors), and it is therefore at the end of the postorder vector.
93 /// @param[in] postorder A vector of blocks in post order traversal
107 const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func);
140 std::function<void(cbb_ptr)> postorder, in DepthFirstTraversal()
156 postorder(top.block); in DepthFirstTraversal()
176 const std::vector<cbb_ptr>& postorder, get_blocks_fun in CalculateDominators()
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
175 CalculateDominators( const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) CalculateDominators() argument
[all...]
/third_party/spirv-tools/source/
H A Dcfa.h58 /// BasicBlock and calls the pre/postorder functions when it needs to process
66 /// @param[in] postorder A function that will be called for every block in a
67 /// CFG following postorder traversal semantics
76 std::function<void(cbb_ptr)> postorder,
82 /// BasicBlock and calls the pre/postorder functions when it needs to process
92 /// @param[in] postorder A function that will be called for every block in a
93 /// CFG following postorder traversal semantics
104 std::function<void(cbb_ptr)> postorder,
114 /// predecessors), and it is therefore at the end of the postorder vector.
120 /// @param[in] postorder
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
218 CalculateDominators( const std::vector<cbb_ptr>& postorder, get_blocks_func predecessor_func) CalculateDominators() argument
[all...]
/third_party/musl/libc-test/src/functional/
H A Dsearch_tsearch.c35 if (v == postorder) in act()
37 t_error("postorder visited node \"%s\", wanted \"%c\"\n", e->k, wantc); in act()
41 if (v == postorder || v == leaf) in act()
55 if (v == preorder || v == postorder) in getparent()
/third_party/spirv-tools/source/val/
H A Dvalidate_cfg.cpp641 ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) { in ValidateStructuredSelections()
643 for (auto iter = postorder.rbegin(); iter != postorder.rend(); ++iter) { in ValidateStructuredSelections()
696 const std::vector<const BasicBlock*>& postorder) { in StructuredControlFlowChecks()
871 if (auto error = ValidateStructuredSelections(_, postorder)) { in StructuredControlFlowChecks()
902 std::vector<const BasicBlock*> postorder; in PerformCfgChecks() local
909 ignore_block, [&](const BasicBlock* b) { postorder.push_back(b); }, in PerformCfgChecks()
912 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
952 postorder.clear(); in PerformCfgChecks()
960 [&](const BasicBlock* b) { postorder in PerformCfgChecks()
640 ValidateStructuredSelections( ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) ValidateStructuredSelections() argument
693 StructuredControlFlowChecks( ValidationState_t& _, Function* function, const std::vector<std::pair<uint32_t, uint32_t>>& back_edges, const std::vector<const BasicBlock*>& postorder) StructuredControlFlowChecks() argument
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddominator_tree.cpp37 // preorder and postorder index of each node. We use these indexes to compare
295 // Each time the depth first traversal calls the postorder callback in GetDominatorEdges()
296 // std::function we push that node into the postorder vector to create our in GetDominatorEdges()
297 // postorder list. in GetDominatorEdges()
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/
H A Ddominator_tree.cpp37 // preorder and postorder index of each node. We use these indexes to compare
295 // Each time the depth first traversal calls the postorder callback in GetDominatorEdges()
296 // std::function we push that node into the postorder vector to create our in GetDominatorEdges()
297 // postorder list. in GetDominatorEdges()
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/
H A Ddominator_tree.cpp37 // preorder and postorder index of each node. We use these indexes to compare
282 // Each time the depth first traversal calls the postorder callback in GetDominatorEdges()
283 // std::function we push that node into the postorder vector to create our in GetDominatorEdges()
284 // postorder list. in GetDominatorEdges()
285 std::vector<const BasicBlock*> postorder; in GetDominatorEdges() local
287 postorder.push_back(b); in GetDominatorEdges()
310 *edges = CFA<BasicBlock>::CalculateDominators(postorder, predecessor_functor); in GetDominatorEdges()
/third_party/skia/third_party/externals/spirv-tools/source/val/
H A Dvalidate_cfg.cpp634 ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) { in ValidateStructuredSelections()
636 for (auto iter = postorder.rbegin(); iter != postorder.rend(); ++iter) { in ValidateStructuredSelections()
688 const std::vector<const BasicBlock*>& postorder) { in StructuredControlFlowChecks()
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()
633 ValidateStructuredSelections( ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) ValidateStructuredSelections() argument
685 StructuredControlFlowChecks( ValidationState_t& _, Function* function, const std::vector<std::pair<uint32_t, uint32_t>>& back_edges, const std::vector<const BasicBlock*>& postorder) StructuredControlFlowChecks() argument
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/val/
H A Dvalidate_cfg.cpp634 ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) { in ValidateStructuredSelections()
636 for (auto iter = postorder.rbegin(); iter != postorder.rend(); ++iter) { in ValidateStructuredSelections()
688 const std::vector<const BasicBlock*>& postorder) { in StructuredControlFlowChecks()
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()
633 ValidateStructuredSelections( ValidationState_t& _, const std::vector<const BasicBlock*>& postorder) ValidateStructuredSelections() argument
685 StructuredControlFlowChecks( ValidationState_t& _, Function* function, const std::vector<std::pair<uint32_t, uint32_t>>& back_edges, const std::vector<const BasicBlock*>& postorder) StructuredControlFlowChecks() argument
/third_party/skia/third_party/externals/microhttpd/src/microhttpd/
H A Dtsearch.h28 postorder, enumerator
/third_party/musl/src/search/
H A Dtwalk.c13 action(r, postorder, d); in walk()
/third_party/musl/porting/liteos_m_iccarm/kernel/include/
H A Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/porting/uniproton/kernel/include/
H A Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/porting/liteos_m/kernel/include/
H A Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/include/
H A Dsearch.h14 typedef enum { preorder, postorder, endorder, leaf } VISIT; enumerator
/third_party/musl/libc-test/src/api/
H A Dsearch.c22 case postorder: in f()
/third_party/alsa-lib/include/
H A Dsearch.h122 postorder, enumerator
/third_party/elfutils/libcpu/
H A Di386_parse.y869 if (value == leaf || value == postorder)
1078 if (value == leaf || value == postorder)
1094 if (value == leaf || value == postorder)
1103 if (value == leaf || value == postorder)
1378 if (value == leaf || value == postorder)

Completed in 13 milliseconds