Searched refs:Dominator (Results 1 – 8 of 8) sorted by relevance
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | StructurizeCFG.cpp | 292 BasicBlock *getNextFlow(BasicBlock *Dominator);
562 NearestCommonDominator Dominator(DT); in insertConditions() local
563 Dominator.addBlock(Parent); in insertConditions()
575 Dominator.addAndRememberBlock(BB); in insertConditions()
581 if (!Dominator.resultIsRememberedBlock()) in insertConditions()
582 PhiInserter.AddAvailableValue(Dominator.result(), Default); in insertConditions()
634 NearestCommonDominator Dominator(DT); in setPhiValues() local
635 Dominator.addBlock(To); in setPhiValues()
638 Dominator.addAndRememberBlock(VI.first); in setPhiValues()
641 if (!Dominator.resultIsRememberedBlock()) in setPhiValues()
[all …]
|
| D | LICM.cpp | 1035 BasicBlock *Dominator = in hoistRegion() local
1037 if (!HoistPoint || !DT->dominates(HoistPoint->getParent(), Dominator)) { in hoistRegion()
1039 assert(DT->dominates(Dominator, HoistPoint->getParent()) && in hoistRegion()
1041 HoistPoint = Dominator->getTerminator(); in hoistRegion()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| D | CodeMoverUtils.cpp | 64 collectControlConditions(const BasicBlock &BB, const BasicBlock &Dominator,
109 const BasicBlock &BB, const BasicBlock &Dominator, const DominatorTree &DT, in collectControlConditions() argument
111 assert(DT.dominates(&Dominator, &BB) && "Expecting Dominator to dominate BB"); in collectControlConditions()
117 if (&Dominator == &BB) in collectControlConditions()
126 assert(DT.dominates(&Dominator, IDom) && in collectControlConditions()
161 } while (CurBlock != &Dominator); in collectControlConditions()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| D | MemorySSA.cpp | 2083 bool MemorySSA::locallyDominates(const MemoryAccess *Dominator, in locallyDominates() argument
2085 const BasicBlock *DominatorBlock = Dominator->getBlock(); in locallyDominates()
2090 if (Dominatee == Dominator) in locallyDominates()
2100 if (isLiveOnEntryDef(Dominator)) in locallyDominates()
2106 unsigned long DominatorNum = BlockNumbering.lookup(Dominator); in locallyDominates()
2114 bool MemorySSA::dominates(const MemoryAccess *Dominator, in dominates() argument
2116 if (Dominator == Dominatee) in dominates()
2122 if (Dominator->getBlock() != Dominatee->getBlock()) in dominates()
2123 return DT->dominates(Dominator->getBlock(), Dominatee->getBlock()); in dominates()
2124 return locallyDominates(Dominator, Dominatee); in dominates()
[all …]
|
| D | ValueTracking.cpp | 5202 auto *Dominator = DNode->getIDom(); in isGuaranteedNotToBeUndefOrPoison() local
5203 while (Dominator) { in isGuaranteedNotToBeUndefOrPoison()
5204 auto *TI = Dominator->getBlock()->getTerminator(); in isGuaranteedNotToBeUndefOrPoison()
5225 Dominator = Dominator->getIDom(); in isGuaranteedNotToBeUndefOrPoison()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
| D | ARMParallelDSP.cpp | 387 LoadInst *Dominator = BaseFirst ? Base : Offset; in RecordMemoryOps() local
396 if (Dominator->comesBefore(Before)) in RecordMemoryOps()
|
| /freebsd-12-stable/contrib/gcc/doc/ |
| D | cfg.texi | 49 lexicographical order. Dominator traversals are also possible using
|
| D | passes.texi | 291 @item Dominator optimizations
|