Searched defs:dominator (Results 1 - 7 of 7) sorted by relevance
/art/compiler/optimizing/ |
H A D | 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...] |
H A D | gvn.cc | 389 // are allocated and populated by the dominator, and updated by all blocks 390 // in the path from the dominator to the block. 421 HBasicBlock* dominator = block->GetDominator(); local 422 ValueSet* dominator_set = FindSetFor(dominator); 424 if (dominator->GetSuccessors().size() == 1) { 425 // `block` is a direct successor of its dominator. No need to clone the 426 // dominator's set, `block` can take over its ownership including its buckets. 427 DCHECK_EQ(dominator->GetSingleSuccessor(), block); 428 AbandonSetFor(dominator);
|
H A D | nodes.cc | 293 // dominator of the block. We can then start visiting its successors. 306 // of all dominator chains has decreased in the current iteration. 328 // Make sure that there are no remaining blocks whose dominator information 937 // Walk up the dominator tree from `other`, to find out if `this` 1278 void HInstruction::ReplaceUsesDominatedBy(HInstruction* dominator, HInstruction* replacement) { argument 1285 if (dominator->StrictlyDominates(user)) { 1759 // This instruction has uses in two or more blocks. Find the common dominator. 1767 // Move to the first dominator not in a loop. 2092 // was their dominator. 2107 // dominator o [all...] |
H A D | nodes.h | 1032 void SetDominator(HBasicBlock* dominator) { dominator_ = dominator; } argument 1187 // Disconnects `this` from all its predecessors, successors and dominator, 2204 void ReplaceUsesDominatedBy(HInstruction* dominator, HInstruction* replacement); 2219 // to the end of the out-of-loop common dominator of the user's blocks. 7416 // Visit the graph following dominator tree reverse post-order.
|
/art/tools/ahat/src/main/com/android/ahat/dominators/ |
H A D | DominatorsComputation.java | 49 * <li>Setting the computed dominator for a node using the 55 * Associates the given dominator state with this node. Subsequent calls to 61 * @param state the dominator state to associate with this node 66 * Returns the dominator state most recently associated with this node 72 * @return the associated dominator state 88 * Sets the dominator for this node based on the results of the dominators 91 * @param dominator the computed immediate dominator of this node 93 void setDominator(Node dominator); argument 106 // dominator o [all...] |
/art/tools/ahat/src/test/com/android/ahat/ |
H A D | DominatorsTest.java | 31 public Node dominator; field in class:DominatorsTest.Node 62 public void setDominator(DominatorsComputation.Node dominator) { argument 63 this.dominator = (Node)dominator; 84 assertEquals(parent, child.dominator); 102 assertEquals(parent, left.dominator); 103 assertEquals(parent, right.dominator); 104 assertEquals(parent, child.dominator); 119 assertEquals(parent, child.dominator); 120 assertEquals(parent, right.dominator); [all...] |
/art/tools/ahat/src/main/com/android/ahat/heapdump/ |
H A D | AhatInstance.java | 251 * Returns the immediate dominator of this instance. 254 * @return the immediate dominator of this instance 724 public void setDominator(DominatorsComputation.Node dominator) { argument 725 mImmediateDominator = (AhatInstance)dominator;
|
Completed in 333 milliseconds