| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | MoveAutoInit.cpp | 91 ? DT.findNearestCommonDominator(CurrentDominator, in usersDominator()
170 ? DT.findNearestCommonDominator(DominatingPredecessor, Pred) in runMoveAutoInit()
185 UsersDominator = DT.findNearestCommonDominator(UsersDominator, Pred); in runMoveAutoInit()
|
| H A D | CodeMoverUtils.cpp | 249 const BasicBlock *CommonDominator = DT.findNearestCommonDominator(&BB0, &BB1); in isControlFlowEquivalent()
456 DT->findNearestCommonDominator(ThisBlock, OtherBlock); in nonStrictlyPostDominate()
|
| H A D | LoopUnrollRuntime.cpp | 192 auto *NewDom = DT->findNearestCommonDominator(OriginalLoopLatchExit, in ConnectProlog()
321 auto *NewDom = DT->findNearestCommonDominator(Exit, NewExit); in ConnectEpilog()
|
| H A D | LoopUnroll.cpp | 871 BasicBlock *NewIDom = DT->findNearestCommonDominator(BB, LatchBlock); in UnrollLoop()
|
| H A D | SimplifyIndVar.cpp | 121 CommonDom ? DT.findNearestCommonDominator(CommonDom, Insn) : Insn; in findCommonDominator()
1202 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB); in getInsertPointForUses()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachinePostDominators.h | 62 using Base::findNearestCommonDominator;
67 findNearestCommonDominator(ArrayRef<MachineBasicBlock *> Blocks) const;
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachinePostDominators.cpp | 98 MachineBasicBlock *MachinePostDominatorTree::findNearestCommonDominator( in findNearestCommonDominator() function in MachinePostDominatorTree
104 NCD = Base::findNearestCommonDominator(NCD, BB); in findNearestCommonDominator()
|
| H A D | ShrinkWrap.cpp | 389 MachineBasicBlock *IDom = Dom.findNearestCommonDominator(iterator_range(BBs)); in FindIDom()
695 Save = MDT->findNearestCommonDominator(Save, &MBB); in updateSaveRestorePoints()
705 Restore = MPDT->findNearestCommonDominator(Restore, &MBB); in updateSaveRestorePoints()
765 Save = MDT->findNearestCommonDominator(Save, Restore); in updateSaveRestorePoints()
770 Restore = MPDT->findNearestCommonDominator(Restore, Save); in updateSaveRestorePoints()
|
| H A D | MachineCSE.cpp | 838 auto CMBB = DT->findNearestCommonDominator(MBB, MBB1); in ProcessBlockPRE()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 519 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const {
549 const NodeT *findNearestCommonDominator(const NodeT *A,
553 return findNearestCommonDominator(const_cast<NodeT *>(A),
562 NodeT *findNearestCommonDominator(iterator_range<IteratorTy> Nodes) const {
567 NCD = findNearestCommonDominator(NCD, Node);
974 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
|
| H A D | GenericDomTreeConstruction.h | 746 ? DT.findNearestCommonDominator(From->getBlock(), To->getBlock()) in InsertReachable()
942 const NodePtr NCDBlock = DT.findNearestCommonDominator(From, To); in DeleteEdge()
975 DT.findNearestCommonDominator(FromTN->getBlock(), ToTN->getBlock()); in DeleteReachable()
1015 const NodePtr Support = DT.findNearestCommonDominator(TNB, Pred); in HasProperSupport()
1075 DT.findNearestCommonDominator(TN->getBlock(), ToTN->getBlock()); in DeleteUnreachable()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 228 using Base::findNearestCommonDominator;
232 LLVM_ABI Instruction *findNearestCommonDominator(Instruction *I1,
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Dominators.cpp | 357 Instruction *DominatorTree::findNearestCommonDominator(Instruction *I1, in findNearestCommonDominator() function in DominatorTree
367 BasicBlock *DomBB = findNearestCommonDominator(BB1, BB2); in findNearestCommonDominator()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 286 Dom = DT.findNearestCommonDominator(Dom, Incoming.Block);
346 VisitedDom = DT.findNearestCommonDominator(VisitedDom, MBB); in advanceLevel()
519 PDT->findNearestCommonDominator(DomBlocks); in lowerPhis()
643 PDT->findNearestCommonDominator(DomBlocks); in lowerCopiesToI1()
|
| H A D | SILowerSGPRSpills.cpp | 337 DomMBB = MDT->findNearestCommonDominator(DomMBB, MBB); in updateLaneVGPRDomInstr()
|
| H A D | SIFixSGPRCopies.cpp | 546 auto *MBB = MDT.findNearestCommonDominator(MI1->getParent(), in hoistAndMergeSGPRInits()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Sink.cpp | 139 SuccToSinkTo = DT.findNearestCommonDominator(SuccToSinkTo, UseBlock); in SinkInstruction()
|
| H A D | LoopDataPrefetch.cpp | 262 BasicBlock *DomBB = DT->findNearestCommonDominator(PrefBB, InsBB); in addInstruction()
|
| H A D | StructurizeCFG.cpp | 203 BasicBlock *NewResult = DT->findNearestCommonDominator(Result, BB); in addBlock()
953 Dominator = DT->findNearestCommonDominator(Dominator, BB); in changeExit()
|
| H A D | ConstantHoisting.cpp | 341 BB = DT->findNearestCommonDominator(BB1, BB2); in findConstantInsertionPoint()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CaptureTracking.cpp | 177 EarliestCapture = DT.findNearestCommonDominator(EarliestCapture, I); in captured()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 433 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB); in tryAndMerge()
|
| H A D | AArch64StackTagging.cpp | 463 PrologueBB = DT->findNearestCommonDominator(PrologueBB, AI->getParent()); in insertBaseTaggedPointer()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGStackify.cpp | 297 Header = Header ? MDT->findNearestCommonDominator(Header, Pred) : Pred; in placeBlockMarker()
516 Header = Header ? MDT.findNearestCommonDominator(Header, Pred) : Pred; in placeTryMarker()
710 Header = Header ? MDT.findNearestCommonDominator(Header, Pred) : Pred; in placeTryTableMarker()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86FlagsCopyLowering.cpp | 502 return MDT->findNearestCommonDominator(LHS, RHS); in runOnMachineFunction()
|