| /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.h | 92 HBasicBlock* dominator() const { return dominator_; } function in class:v8::internal::final
[all...] |
| hydrogen-instructions.h | 711 HValue* dominator) {
4903 HValue* dominator = allocate->allocation_folding_dominator(); local
5947 HValue* dominator() const { return dominator_; } function in class:final::final
6152 HValue* dominator() const { return dominator_; } function in class:final::final
[all...] |
| /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);
|
| /system/core/libmemunreachable/ |
| LeakFolding.h | 58 bool dominator; member in struct:android::LeakFolding::SCCInfo
67 dominator(false),
91 void AccumulateLeaks(SCCInfo* dominator);
|
| /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...] |
| /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)) {
|
| CodeRewriter.java | 899 BasicBlock dominator = dominatorTree.closestDominator(userBlocks); local
[all...] |
| /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/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...] |
| /prebuilts/tools/common/m2/repository/com/squareup/leakcanary/leakcanary-analyzer/1.4/ |
| leakcanary-analyzer-1.4.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.4.0-beta3/ |
| perflib-24.4.0-beta3.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.4.0-beta6/ |
| perflib-24.4.0-beta6.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/24.5.0/ |
| perflib-24.5.0.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0/ |
| perflib-25.0.0.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-alpha1/ |
| perflib-25.0.0-alpha1.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-alpha3/ |
| perflib-25.0.0-alpha3.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-alpha5/ |
| perflib-25.0.0-alpha5.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-alpha7/ |
| perflib-25.0.0-alpha7.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-alpha9/ |
| perflib-25.0.0-alpha9.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-beta2/ |
| perflib-25.0.0-beta2.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-beta5/ |
| perflib-25.0.0-beta5.jar | |
| /prebuilts/gradle-plugin/com/android/tools/perflib/perflib/25.0.0-beta6/ |
| perflib-25.0.0-beta6.jar | |
