Searched refs:Dominator (Results 1 – 5 of 5) sorted by relevance
550 NearestCommonDominator Dominator(DT); in insertConditions() local551 Dominator.addBlock(Parent); in insertConditions()563 Dominator.addAndRememberBlock(BB); in insertConditions()617 NearestCommonDominator Dominator(DT); in setPhiValues() local618 Dominator.addBlock(To); in setPhiValues()680 BasicBlock *Dominator = nullptr; in changeExit() local697 if (!Dominator) in changeExit()698 Dominator = BB; in changeExit()700 Dominator = DT->findNearestCommonDominator(Dominator, BB); in changeExit()705 if (Dominator) in changeExit()[all …]
859 BasicBlock *Dominator = in hoistRegion() local861 if (!HoistPoint || !DT->dominates(HoistPoint->getParent(), Dominator)) { in hoistRegion()863 assert(DT->dominates(Dominator, HoistPoint->getParent()) && in hoistRegion()865 HoistPoint = Dominator->getTerminator(); in hoistRegion()
1998 bool MemorySSA::locallyDominates(const MemoryAccess *Dominator, in locallyDominates() argument2000 const BasicBlock *DominatorBlock = Dominator->getBlock(); in locallyDominates()2005 if (Dominatee == Dominator) in locallyDominates()2015 if (isLiveOnEntryDef(Dominator)) in locallyDominates()2029 bool MemorySSA::dominates(const MemoryAccess *Dominator, in dominates() argument2031 if (Dominator == Dominatee) in dominates()2037 if (Dominator->getBlock() != Dominatee->getBlock()) in dominates()2039 return locallyDominates(Dominator, Dominatee); in dominates()2042 bool MemorySSA::dominates(const MemoryAccess *Dominator, in dominates() argument2047 if (UseBB != Dominator->getBlock()) in dominates()[all …]
49 lexicographical order. Dominator traversals are also possible using
291 @item Dominator optimizations