Lines Matching defs:dominator
661 // Phase 2: Compute special RPO and dominator tree.
1185 // Try to find the common dominator by walking, if there is a chance of
1194 b2 = b2->dominator();
1196 b1 = b1->dominator();
1200 // We might fall out of the loop here if the dominator tree has several
1209 b1 = b1->dominator();
1211 b2 = b2->dominator();
1237 b1 = b1->dominator();
1239 b2 = b2->dominator();
1267 BasicBlock* dominator = *pred;
1268 bool deferred = dominator->deferred();
1269 // For multiple predecessors, walk up the dominator tree until a common
1270 // dominator is found. Visitation order guarantees that all predecessors
1280 ((*pred)->dominator()->dominator() == cache ||
1281 (*pred)->dominator()->dominator()->dominator() == cache)) {
1283 DCHECK_EQ(dominator, BasicBlock::GetCommonDominator(dominator, *pred));
1285 dominator = BasicBlock::GetCommonDominator(dominator, *pred);
1287 cache = (*pred)->dominator();
1290 block->set_dominator(dominator);
1291 block->set_dominator_depth(dominator->dominator_depth() + 1);
1294 dominator->id().ToInt(), block->dominator_depth());
1299 // Seed start block to be the first dominator.
1302 // Build the block dominator tree resulting from the above seed.
1447 // has the net effect of computing the minimum dominator block of {node} that
1461 // Propagate new position if it is deeper down the dominator tree than the
1463 // the dominator chain of {node}'s minimum block position.
1477 BasicBlock* dominator = BasicBlock::GetCommonDominator(b1, b2);
1478 return dominator == b1 || dominator == b2;
1630 // The {block} is common dominator of all uses of {node}, so we cannot
1670 // If the (common dominator) {block} is marked, we know that all paths from
1674 TRACE(" not splitting #%d:%s, its common dominator id:%d is perfect\n",
1680 // closure. Every marking partition has a unique dominator, which get's a
1688 while (IsMarked(use_block->dominator())) {
1689 use_block = use_block->dominator();
1714 if (block->IsLoopHeader()) return block->dominator();
1727 return header_block->dominator();
1756 // dominator of its uses. This will not recurse more than one level.
1869 // Schedule: Places nodes in dominator block of all their uses.
1912 // Iterate on phase 2: Compute special RPO and dominator tree.