| /external/v8/src/crankshaft/ |
| hydrogen-sce.cc | 12 // For each loop block walk the dominator tree from the backwards branch to
20 HBasicBlock* dominator = back_edge; local
22 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) {
30 if (dominator == block) break;
32 // Move up the dominator tree.
33 dominator = dominator->dominator();
|
| hydrogen-gvn.h | 121 HBasicBlock* dominator,
143 // Used when collecting side effects on paths from dominator to
|
| hydrogen-gvn.cc | 652 HBasicBlock* dominator, HBasicBlock* dominated) {
656 if (dominator->block_id() < block->block_id() &&
665 dominator, block));
673 // traversal of the dominator tree done during GVN (the stack is handled
676 // of the dominator tree but this forces us to initialize each frame calling
693 HBasicBlock** dominator) {
696 *dominator = block();
703 *dominator = dominator_state->block();
707 *dominator = NULL;
741 // No need to copy the map for the last child in the dominator tree
[all...] |
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| DominatorTree.java | 31 * Get the immediate dominator block for a block.
40 * @param subject subject to check for domination by {@code dominator}
41 * @param dominator dominator to check against
42 * @return wether {@code subject} is dominated by {@code dominator}
44 public boolean dominatedBy(BasicBlock subject, BasicBlock dominator) {
45 if (subject == dominator) {
48 return strictlyDominatedBy(subject, dominator);
54 * @param subject subject to check for domination by {@code dominator}
55 * @param dominator dominator to check agains
85 BasicBlock dominator = it.next(); local
[all...] |
| /system/core/libmemunreachable/ |
| LeakFolding.cpp | 59 void LeakFolding::AccumulateLeaks(SCCInfo* dominator) {
61 if (scc->accumulator != dominator) {
62 scc->accumulator = dominator;
63 dominator->cuumulative_size += scc->size;
64 dominator->cuumulative_count += scc->count;
68 walk(dominator);
102 scc->dominator = true;
122 if (leak.scc->dominator) {
|
| LeakFolding.h | 58 bool dominator; member in struct:android::LeakFolding::SCCInfo
67 dominator(false),
91 void AccumulateLeaks(SCCInfo* dominator);
|
| /art/compiler/optimizing/ |
| cha_guard_optimization.cc | 129 HBasicBlock* dominator = flag->GetBlock(); local
133 // We potentially need to traverse the full dominator chain to receiver_def_block,
138 while (dominator != receiver_def_block) {
139 if (block_has_cha_guard_[dominator->GetBlockId()] == 1) {
143 dominator = dominator->GetDominator();
146 // At this point dominator is the block where receiver is defined.
147 // We do a linear search within dominator to see if there is a guard after
150 if (dominator == flag->GetBlock()) {
155 // Search backward from the last instruction of that dominator
[all...] |
| gvn.cc | 397 // are allocated and populated by the dominator, and updated by all blocks
398 // in the path from the dominator to the block.
429 HBasicBlock* dominator = block->GetDominator(); local
430 ValueSet* dominator_set = FindSetFor(dominator);
432 if (dominator->GetSuccessors().size() == 1) {
433 // `block` is a direct successor of its dominator. No need to clone the
434 // dominator's set, `block` can take over its ownership including its buckets.
435 DCHECK_EQ(dominator->GetSingleSuccessor(), block);
436 AbandonSetFor(dominator);
|
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/val/ |
| Construct.h | 59 Construct(ConstructType type, BasicBlock* dominator,
70 /// Returns the dominator block of the construct.
75 /// Returns the dominator block of the construct.
121 /// @brief Dominator block for the construct
123 /// The dominator block for the construct. Depending on the construct this may
|
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| validate_cfg.cpp | 151 size_t dominator; ///< The index of blocks's dominator in post order array member in struct:libspirv::block_detail
160 idoms[postorder.back()].dominator = idoms[postorder.back()].postorder_index;
170 return idoms[pred].dominator != undefined_dom;
179 if (idoms[p].dominator != undefined_dom) {
184 finger1 = idoms[postorder[finger1]].dominator;
187 finger2 = idoms[postorder[finger2]].dominator;
193 if (idoms[*b].dominator != idom_idx) {
194 idoms[*b].dominator = idom_idx;
205 const_cast<BasicBlock*>(postorder[get<1>(idom).dominator])});
[all...] |
| /external/r8/src/main/java/com/android/tools/r8/ir/optimize/ |
| DeadCodeRemover.java | 26 DominatorTree dominator = new DominatorTree(code); local
36 removeUnneededCatchHandlers(worklist, block, dominator);
132 Queue<BasicBlock> worklist, BasicBlock block, DominatorTree dominator) {
136 for (BasicBlock unlinked : block.unlink(target, dominator)) {
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| dom.go | 17 // This file contains code to compute the dominator tree
69 // for 75% of memory (size) allocation for dominator computation
113 // dominatorsLTOrig runs Lengauer-Tarjan to compute a dominator tree starting at
115 // computing both dominator and post-dominator trees.
241 // dominators computes the dominator tree for f. It returns a slice
242 // which maps block ID to the immediate dominator of that block.
296 // intersect finds the closest dominator of both b and c.
|
| lca.go | 7 // Code to compute lowest common ancestors in the dominator tree.
25 parent ID // parent in dominator tree. 0 = no parent (entry or unreachable)
26 firstChild ID // first child in dominator tree
29 depth int32 // depth in dominator tree (root=0, its children=1, etc.)
|
| sparsetree.go | 73 // treestructure provides a string description of the dominator
145 // Sibling returns a sibling of x in the dominator tree (i.e.,
146 // a node with the same immediate dominator) or nil if there
156 // Child returns a child of x in the dominator tree, or
183 // domorder returns a value for dominator-oriented sorting.
194 // Entry and exit values are assigned in a depth-first dominator tree walk.
|
| dom_test.go | 177 // as determined by domFn, match the map node->dominator
202 t.Errorf("expected %s as dominator of %s, found %s", d, n, blockNames[domNode])
204 t.Fatal("unexpected dominator condition")
215 t.Errorf("unexpected dominator of %s for %s", blockNames[d], blockNames[b])
440 // reference dominator tree for testing faster algorithms.
|
| sparsetreemap.go | 17 // Given a set of blocks {B1, B2, B3} within the dominator tree, established
21 // ancestor of B within the dominator tree, or nil if none exists.
53 Dom []*Block // exported data; the dominator of this block.
80 // data structure indexed by (dominator tree walk) entry and exit numbers.
|
| zcse.go | 25 // where we might use it. This prevents the need for any dominator
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| dom.go | 17 // This file contains code to compute the dominator tree
69 // for 75% of memory (size) allocation for dominator computation
113 // dominatorsLTOrig runs Lengauer-Tarjan to compute a dominator tree starting at
115 // computing both dominator and post-dominator trees.
241 // dominators computes the dominator tree for f. It returns a slice
242 // which maps block ID to the immediate dominator of that block.
296 // intersect finds the closest dominator of both b and c.
|
| lca.go | 7 // Code to compute lowest common ancestors in the dominator tree.
25 parent ID // parent in dominator tree. 0 = no parent (entry or unreachable)
26 firstChild ID // first child in dominator tree
29 depth int32 // depth in dominator tree (root=0, its children=1, etc.)
|
| sparsetree.go | 73 // treestructure provides a string description of the dominator
145 // Sibling returns a sibling of x in the dominator tree (i.e.,
146 // a node with the same immediate dominator) or nil if there
156 // Child returns a child of x in the dominator tree, or
183 // domorder returns a value for dominator-oriented sorting.
194 // Entry and exit values are assigned in a depth-first dominator tree walk.
|
| dom_test.go | 177 // as determined by domFn, match the map node->dominator
202 t.Errorf("expected %s as dominator of %s, found %s", d, n, blockNames[domNode])
204 t.Fatal("unexpected dominator condition")
215 t.Errorf("unexpected dominator of %s for %s", blockNames[d], blockNames[b])
440 // reference dominator tree for testing faster algorithms.
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| phi.go | 47 // properties of the dominator tree
48 idom []*ssa.Block // dominator parents
49 tree []domBlock // dominator child+sibling
50 level []int32 // level in dominator tree (0 = root or unreachable, 1 = children of root, ...)
119 // Make dominator tree.
129 // Compute levels in dominator tree.
267 // Do a depth-first walk of the dominator tree, keeping track
348 // Walk children in dominator tree.
355 // domBlock contains extra per-block information to record the dominator tree.
357 firstChild *ssa.Block // first child of block in dominator tre
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| phi.go | 47 // properties of the dominator tree
48 idom []*ssa.Block // dominator parents
49 tree []domBlock // dominator child+sibling
50 level []int32 // level in dominator tree (0 = root or unreachable, 1 = children of root, ...)
119 // Make dominator tree.
129 // Compute levels in dominator tree.
267 // Do a depth-first walk of the dominator tree, keeping track
348 // Walk children in dominator tree.
355 // domBlock contains extra per-block information to record the dominator tree.
357 firstChild *ssa.Block // first child of block in dominator tre
[all...] |
| /external/v8/src/compiler/ |
| schedule.h | 122 BasicBlock* dominator() const { return dominator_; } function in class:v8::internal::compiler::final
123 void set_dominator(BasicBlock* dominator) { dominator_ = dominator; }
147 // Computes the immediate common dominator of {b1} and {b2}. The worst time
148 // complexity is O(N) where N is the height of the dominator tree.
155 int32_t dominator_depth_; // Depth within the dominator tree.
156 BasicBlock* dominator_; // Immediate dominator of the block.
|
| scheduler.cc | 594 // Phase 2: Compute special RPO and dominator tree.
1114 BasicBlock* dominator = *pred; local
1294 BasicBlock* dominator = BasicBlock::GetCommonDominator(b1, b2); local
[all...] |
