| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 122 CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) { in findNearestCommonDominator() function 123 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator() 126 const CFGBlock *findNearestCommonDominator(const CFGBlock *A, in findNearestCommonDominator() function 128 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | MachinePostDominators.h | 75 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, in findNearestCommonDominator() function 77 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| H A D | MachineDominators.h | 160 inline MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, in findNearestCommonDominator() function 163 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | ShrinkWrap.cpp | 310 IDom = Dom.findNearestCommonDominator(IDom, BB); in FindIDom() 325 Save = MDT->findNearestCommonDominator(Save, &MBB); in updateSaveRestorePoints() 339 Restore = MPDT->findNearestCommonDominator(Restore, &MBB); in updateSaveRestorePoints() 399 Save = MDT->findNearestCommonDominator(Save, Restore); in updateSaveRestorePoints() 404 Restore = MPDT->findNearestCommonDominator(Restore, Save); in updateSaveRestorePoints()
|
| H A D | MachineLICM.cpp | 790 B = DT->findNearestCommonDominator(B, MI.getParent()); in SinkIntoLoop()
|
| H A D | SplitKit.cpp | 1059 MDT.findNearestCommonDominator(Dom.first, ValMBB); in hoistCopies()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 446 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const { 475 const NodeT *findNearestCommonDominator(const NodeT *A, 479 return findNearestCommonDominator(const_cast<NodeT *>(A), 815 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
|
| H A D | GenericDomTreeConstruction.h | 733 ? DT.findNearestCommonDominator(From->getBlock(), To->getBlock()) in InsertReachable() 945 const NodePtr NCDBlock = DT.findNearestCommonDominator(From, To); in DeleteEdge() 978 DT.findNearestCommonDominator(FromTN->getBlock(), ToTN->getBlock()); in DeleteReachable() 1019 DT.findNearestCommonDominator(TN->getBlock(), Pred); in HasProperSupport() 1079 DT.findNearestCommonDominator(TN->getBlock(), ToTN->getBlock()); in DeleteUnreachable()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 316 Dom = DT.findNearestCommonDominator(Dom, MBB); 373 VisitedDom = DT.findNearestCommonDominator(VisitedDom, MBB); in advanceLevel() 545 PDT->findNearestCommonDominator(PostDomBound, Use.getParent()); in lowerPhis() 667 PDT->findNearestCommonDominator(PostDomBound, Use.getParent()); in lowerCopiesToI1()
|
| H A D | SIFixSGPRCopies.cpp | 536 auto *MBB = MDT.findNearestCommonDominator(MI1->getParent(), in hoistAndMergeSGPRInits()
|
| /freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGStackify.cpp | 224 Header = Header ? MDT.findNearestCommonDominator(Header, Pred) : Pred; in placeBlockMarker() 436 Header = Header ? MDT.findNearestCommonDominator(Header, Pred) : Pred; in placeTryMarker()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 103 BasicBlock *NewResult = DT->findNearestCommonDominator(Result, BB); in addBlock() 700 Dominator = DT->findNearestCommonDominator(Dominator, BB); in changeExit()
|
| H A D | ConstantHoisting.cpp | 333 BB = DT->findNearestCommonDominator(BB1, BB2); in findConstantInsertionPoint()
|
| H A D | IndVarSimplify.cpp | 241 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB); in getInsertPointForUses()
|
| H A D | LoopStrengthReduce.cpp | 2480 DT.findNearestCommonDominator(IVIncInsertPos->getParent(), in OptimizeLoopTermCond() 5001 BB = DT.findNearestCommonDominator(BB, ExitingBlocks[i]); in AdjustInsertPositionForExpand()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 419 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB); in tryAndMerge()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 805 NewIDom = DT->findNearestCommonDominator(BB, LatchBlock); in UnrollLoop()
|
| /freebsd-12.1/contrib/llvm/lib/Target/X86/ |
| H A D | X86FlagsCopyLowering.cpp | 475 return MDT->findNearestCommonDominator(LHS, RHS); in runOnMachineFunction()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | MemorySSAUpdater.cpp | 676 PrevIDom = DT.findNearestCommonDominator(PrevIDom, BB); in applyInsertUpdates()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonFrameLowering.cpp | 458 DomB = MDT.findNearestCommonDominator(DomB, SFBlocks[i]); in findShrunkPrologEpilog() 464 PDomB = MPT.findNearestCommonDominator(PDomB, SFBlocks[i]); in findShrunkPrologEpilog()
|
| H A D | HexagonCommonGEP.cpp | 689 Dom = B ? DT->findNearestCommonDominator(Dom, B) : nullptr; in nearest_common_dominator()
|
| H A D | HexagonConstExtenders.cpp | 1496 DomB = MDT->findNearestCommonDominator(DomB, MBB); in calculatePlacement()
|
| H A D | HexagonLoopIdiomRecognition.cpp | 2231 ExitD = DT->findNearestCommonDominator(ExitD, PB); in processCopyingStore()
|