Searched refs:dominator (Results 1 – 7 of 7) sorted by relevance
38 1. Including dominator information in the LLVM bytecode41 idea, we could include an immediate dominator number for each basic block
1268 if (entry->dominator() == NULL) entry->set_dominator(entry); in SetDominatorsToSelf()2711 for (HeapEntry* dominator = entry->dominator(); in ApproximateRetainedSizes() local2712 dominator != entry; in ApproximateRetainedSizes()2713 entry = dominator, dominator = entry->dominator()) { in ApproximateRetainedSizes()2714 dominator->add_retained_size(entry_size); in ApproximateRetainedSizes()2896 writer_->AddNumber(GetNodeId(entry->dominator())); in SerializeNode()
217 HBasicBlock* current = other->dominator(); in Dominates()220 current = current->dominator(); in Dominates()285 } else if (other->dominator() != NULL) { in AssignCommonDominator()291 first = first->dominator(); in AssignCommonDominator()293 second = second->dominator(); in AssignCommonDominator()472 ASSERT(entry_block_->dominator() == NULL); in Verify()477 if (block->dominator() == NULL) { in Verify()484 block->dominator()); in Verify()1217 HBasicBlock* dominator = back_edge; in Process() local1219 while (dominator != block && !back_edge_dominated_by_call) { in Process()[all …]
79 HBasicBlock* dominator() const { return dominator_; } in dominator() function
552 HeapEntry* dominator() { return dominator_; } in dominator() function
5409 return reinterpret_cast<const HeapGraphNode*>(ToInternal(this)->dominator()); in GetDominatorNode()
166 ; some exits out of the loop, and that we can do so without breaking dominator