| /external/swiftshader/third_party/SPIRV-Tools/source/ |
| D | cfa.h | 178 size_t dominator; ///< The index of blocks's dominator in post order array in CalculateDominators() member
187 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index; in CalculateDominators()
199 idoms[pred].dominator != undefined_dom; in CalculateDominators()
212 if (idoms[p].dominator != undefined_dom) { in CalculateDominators()
217 finger1 = idoms[postorder[finger1]].dominator; in CalculateDominators()
220 finger2 = idoms[postorder[finger2]].dominator; in CalculateDominators()
226 if (idoms[*b].dominator != idom_idx) { in CalculateDominators()
227 idoms[*b].dominator = idom_idx; in CalculateDominators()
238 const_cast<BB*>(postorder[std::get<1>(idom).dominator])}); in CalculateDominators()
|
| /external/deqp-deps/SPIRV-Tools/source/ |
| D | cfa.h | 178 size_t dominator; ///< The index of blocks's dominator in post order array in CalculateDominators() member
187 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index; in CalculateDominators()
199 idoms[pred].dominator != undefined_dom; in CalculateDominators()
212 if (idoms[p].dominator != undefined_dom) { in CalculateDominators()
217 finger1 = idoms[postorder[finger1]].dominator; in CalculateDominators()
220 finger2 = idoms[postorder[finger2]].dominator; in CalculateDominators()
226 if (idoms[*b].dominator != idom_idx) { in CalculateDominators()
227 idoms[*b].dominator = idom_idx; in CalculateDominators()
238 const_cast<BB*>(postorder[std::get<1>(idom).dominator])}); in CalculateDominators()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/InstCombine/ |
| D | pr30929.ll | 1 ; We need this pipeline because to trigger dominator info verification
2 ; we have to compute the dominator before libcalls-shrinkwrap and
3 ; have a pass which requires the dominator tree after.
|
| /external/v8/src/compiler/ |
| D | scheduler.cc | 1142 BasicBlock* dominator = *pred; in PropagateImmediateDominators() local
1143 bool deferred = dominator->deferred(); in PropagateImmediateDominators()
1150 dominator = BasicBlock::GetCommonDominator(dominator, *pred); in PropagateImmediateDominators()
1153 block->set_dominator(dominator); in PropagateImmediateDominators()
1154 block->set_dominator_depth(dominator->dominator_depth() + 1); in PropagateImmediateDominators()
1157 dominator->id().ToInt(), block->dominator_depth()); in PropagateImmediateDominators()
1324 BasicBlock* dominator = BasicBlock::GetCommonDominator(b1, b2); in InsideSameDominatorChain() local
1325 return dominator == b1 || dominator == b2; in InsideSameDominatorChain()
1521 while (marked_[use_block->dominator()->id().ToSize()]) { in SplitNode()
1522 use_block = use_block->dominator(); in SplitNode()
[all …]
|
| D | schedule.h | 130 BasicBlock* dominator() const { return dominator_; } in NON_EXPORTED_BASE()
131 void set_dominator(BasicBlock* dominator) { dominator_ = dominator; } in NON_EXPORTED_BASE()
|
| D | verifier.cc | 1810 block = block->dominator(); in HasDominatingDef()
1819 static bool Dominates(Schedule* schedule, Node* dominator, Node* dominatee) { in Dominates() argument
1820 BasicBlock* dom = schedule->block(dominator); in Dominates()
1826 sub = sub->dominator(); in Dominates()
1891 BasicBlock* dom = block->dominator(); in Run()
1948 BasicBlock* idom = block->dominator(); in Run()
1978 BasicBlock* idom = block->dominator(); in Run()
|
| D | node-properties.h | 165 static bool NoObservableSideEffectBetween(Node* effect, Node* dominator);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopRotate/ |
| D | pr35210.ll | 4 ; This test is to make sure we invalidate the post dominator pass after loop rotate simplifies the …
5 ; The adce passes are here to make sure post dominator analysis is required.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/Inline/ |
| D | cgscc-invalidate.ll | 18 ; perturb the dominator tree.
40 ; destroying dominator tree.
|
| D | cgscc-incremental-invalidate.ll | 49 ; perturb the dominator tree.
132 ; a dominator tree for one of the functions but not the other and without even
135 ; dominator tree.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/GVNHoist/ |
| D | hoist-newgvn.ll | 7 ; Check that we hoist load and scalar expressions in dominator.
52 ; Check that we hoist load and scalar expressions in dominator.
|
| /external/swiftshader/third_party/SPIRV-Tools/source/val/ |
| D | construct.h | 58 Construct(ConstructType type, BasicBlock* dominator,
|
| /external/deqp-deps/SPIRV-Tools/source/val/ |
| D | construct.h | 58 Construct(ConstructType type, BasicBlock* dominator,
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/ |
| D | Passes.rst | 107 This pass is a simple dominator construction algorithm for finding forward
108 dominator frontiers.
113 This pass is a simple dominator construction algorithm for finding forward
142 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
149 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
156 This pass, only available in ``opt``, prints the post dominator tree into a
163 This pass, only available in ``opt``, prints the post dominator tree into a
261 This pass is a simple post-dominator construction algorithm for finding
262 post-dominator frontiers.
267 This pass is a simple post-dominator construction algorithm for finding
[all …]
|
| /external/llvm/docs/ |
| D | Passes.rst | 105 This pass is a simple dominator construction algorithm for finding forward
106 dominator frontiers.
111 This pass is a simple dominator construction algorithm for finding forward
140 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
147 This pass, only available in ``opt``, prints the dominator tree into a ``.dot``
154 This pass, only available in ``opt``, prints the post dominator tree into a
161 This pass, only available in ``opt``, prints the post dominator tree into a
259 This pass is a simple post-dominator construction algorithm for finding
260 post-dominator frontiers.
265 This pass is a simple post-dominator construction algorithm for finding
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/HistoricalNotes/ |
| D | 2000-12-06-MeetingSummary.txt | 38 1. Including dominator information in the LLVM bytecode
41 idea, we could include an immediate dominator number for each basic block
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2000-12-06-MeetingSummary.txt | 38 1. Including dominator information in the LLVM bytecode
41 idea, we could include an immediate dominator number for each basic block
|
| /external/swiftshader/third_party/LLVM/docs/HistoricalNotes/ |
| D | 2000-12-06-MeetingSummary.txt | 38 1. Including dominator information in the LLVM bytecode
41 idea, we could include an immediate dominator number for each basic block
|
| /external/deqp-deps/glslang/Test/ |
| D | spv.loopsArtificial.frag | 44 // Immediate dominator
|
| D | loopsArtificial.frag | 73 // Immediate dominator
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/DivergenceAnalysis/AMDGPU/ |
| D | no-return-blocks.ll | 7 ; The post dominator tree does not have a root node in this case
|
| /external/llvm/test/Analysis/DivergenceAnalysis/AMDGPU/ |
| D | no-return-blocks.ll | 7 ; The post dominator tree does not have a root node in this case
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | selectiondag-dominator.ll | 1 ; Make sure we don't crash because we have a stale dominator tree.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopVersioning/ |
| D | exit-block-dominates-rt-check-block.ll | 1 ; This test ensures loop versioning does not produce an invalid dominator tree
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | merge_return_pass.cpp | 630 BasicBlock* dominator = dom_tree->ImmediateDominator(bb); in AddNewPhiNodes() local
631 if (dominator) { in AddNewPhiNodes()
632 AddNewPhiNodes(bb, new_merge_nodes_[bb], dominator->id()); in AddNewPhiNodes()
|