| /external/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 …]
|
| /external/deqp-deps/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 …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/llvm_ir/ |
| D | fused_ir_emitter.cc | 228 auto postorder = in IsFusedIrEmitterInefficient() local
230 std::reverse(postorder.begin(), postorder.end()); in IsFusedIrEmitterInefficient()
231 for (const auto* instruction : postorder) { in IsFusedIrEmitterInefficient()
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | dominator_tree.cpp | 294 std::vector<const BasicBlock*> postorder; in GetDominatorEdges() local
296 postorder.push_back(b); in GetDominatorEdges()
319 *edges = CFA<BasicBlock>::CalculateDominators(postorder, predecessor_functor); in GetDominatorEdges()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | dominator_tree.cpp | 294 std::vector<const BasicBlock*> postorder; in GetDominatorEdges() local
296 postorder.push_back(b); in GetDominatorEdges()
319 *edges = CFA<BasicBlock>::CalculateDominators(postorder, predecessor_functor); in GetDominatorEdges()
|
| /external/elfutils/libcpu/ |
| D | i386_parse.y | 869 if (value == leaf || value == postorder)
1078 if (value == leaf || value == postorder) in print_op_str()
1094 if (value == leaf || value == postorder) in print_op_str_idx()
1103 if (value == leaf || value == postorder) in print_op_fct()
1378 if (value == leaf || value == postorder)
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_computation.cc | 962 std::vector<HloInstruction*> postorder; in CloneWithReplacements() local
981 postorder.push_back(cur); in CloneWithReplacements()
1003 for (auto instr : postorder) { in CloneWithReplacements()
1024 for (auto instr : postorder) { in CloneWithReplacements()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/val/ |
| D | validate_cfg.cpp | 605 std::vector<const BasicBlock*> postorder; in PerformCfgChecks() local
614 ignore_block, [&](const BasicBlock* b) { postorder.push_back(b); }, in PerformCfgChecks()
617 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
|
| /external/deqp-deps/SPIRV-Tools/source/val/ |
| D | validate_cfg.cpp | 605 std::vector<const BasicBlock*> postorder; in PerformCfgChecks() local
614 ignore_block, [&](const BasicBlock* b) { postorder.push_back(b); }, in PerformCfgChecks()
617 postorder, function.AugmentedCFGPredecessorsFunction()); in PerformCfgChecks()
|
| /external/eigen/bench/ |
| D | sparse_cholesky.cpp | 176 c.postorder = 0; in main()
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | TreeFilter.m | 70 we need to reduce multiply-by-zero subtrees on the way up (postorder).
74 visitor, we execute an action in the postorder position. ANTLR
|
| /external/python/cpython2/Parser/ |
| D | spark.py | 755 def postorder(self, node=None): member in GenericASTTraversal
760 self.postorder(kid)
|
| /external/llvm/docs/ |
| D | Lexicon.rst | 213 Reverse postorder
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/ |
| D | Lexicon.rst | 242 Reverse postorder
|
| /external/elfutils/libdw/ |
| D | ChangeLog | 2927 Take two functions for both preorder and postorder visitors.
|
| /external/jline/src/src/test/resources/jline/example/ |
| D | english.gz | |
| /external/v8/ |
| D | ChangeLog | 33953 [wasm] Binary 11: WASM AST is now postorder. [wasm] Binary 11: br_table
|