| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | MachinePostDominators.h | 77 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, in findNearestCommonDominator() function
79 return PDT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
85 findNearestCommonDominator(ArrayRef<MachineBasicBlock *> Blocks) const;
|
| H A D | MachineDominators.h | 160 MachineBasicBlock *findNearestCommonDominator(MachineBasicBlock *A, in findNearestCommonDominator() function
163 return DT->findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | MachinePostDominators.cpp | 51 MachineBasicBlock *MachinePostDominatorTree::findNearestCommonDominator( in findNearestCommonDominator() function in MachinePostDominatorTree
57 NCD = PDT->findNearestCommonDominator(NCD, BB); in findNearestCommonDominator()
|
| H A D | ShrinkWrap.cpp | 326 IDom = Dom.findNearestCommonDominator(IDom, BB); in FindIDom()
341 Save = MDT->findNearestCommonDominator(Save, &MBB); in updateSaveRestorePoints()
351 Restore = MPDT->findNearestCommonDominator(Restore, &MBB); in updateSaveRestorePoints()
411 Save = MDT->findNearestCommonDominator(Save, Restore); in updateSaveRestorePoints()
416 Restore = MPDT->findNearestCommonDominator(Restore, Save); in updateSaveRestorePoints()
|
| H A D | MachineCSE.cpp | 842 auto CMBB = DT->findNearestCommonDominator(MBB, MBB1); in ProcessBlockPRE()
|
| /openbsd-src/gnu/llvm/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 149 CFGBlock *findNearestCommonDominator(CFGBlock *A, CFGBlock *B) { in findNearestCommonDominator() function
150 return DT.findNearestCommonDominator(A, B); in findNearestCommonDominator()
153 const CFGBlock *findNearestCommonDominator(const CFGBlock *A, in findNearestCommonDominator() function
155 return DT.findNearestCommonDominator(A, B); in findNearestCommonDominator()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | TLSVariableHoist.cpp | 178 Dom = DT->findNearestCommonDominator(Dom, PredBB); in getNearestLoopDomInst()
190 return DT->findNearestCommonDominator(I1, I2); in getDomInst()
|
| H A D | Sink.cpp | 144 SuccToSinkTo = DT.findNearestCommonDominator(SuccToSinkTo, UseBlock); in SinkInstruction()
|
| H A D | LoopDataPrefetch.cpp | 263 BasicBlock *DomBB = DT->findNearestCommonDominator(PrefBB, InsBB); in addInstruction()
|
| H A D | StructurizeCFG.cpp | 164 BasicBlock *NewResult = DT->findNearestCommonDominator(Result, BB); in addBlock()
830 Dominator = DT->findNearestCommonDominator(Dominator, BB); in changeExit()
|
| H A D | ConstantHoisting.cpp | 344 BB = DT->findNearestCommonDominator(BB1, BB2); in findConstantInsertionPoint()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/IR/ |
| H A D | Dominators.h | 223 using Base::findNearestCommonDominator;
227 Instruction *findNearestCommonDominator(Instruction *I1,
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 310 Dom = DT.findNearestCommonDominator(Dom, MBB);
367 VisitedDom = DT.findNearestCommonDominator(VisitedDom, MBB); in advanceLevel()
599 PDT->findNearestCommonDominator(DomBlocks); in lowerPhis()
720 PDT->findNearestCommonDominator(DomBlocks); in lowerCopiesToI1()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Support/ |
| H A D | GenericDomTree.h | 484 NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const {
514 const NodeT *findNearestCommonDominator(const NodeT *A,
518 return findNearestCommonDominator(const_cast<NodeT *>(A),
888 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
|
| H A D | GenericDomTreeConstruction.h | 748 ? DT.findNearestCommonDominator(From->getBlock(), To->getBlock()) in InsertReachable()
944 const NodePtr NCDBlock = DT.findNearestCommonDominator(From, To); in DeleteEdge()
977 DT.findNearestCommonDominator(FromTN->getBlock(), ToTN->getBlock()); in DeleteReachable()
1017 const NodePtr Support = DT.findNearestCommonDominator(TNB, Pred); in HasProperSupport()
1077 DT.findNearestCommonDominator(TN->getBlock(), ToTN->getBlock()); in DeleteUnreachable()
|
| /openbsd-src/gnu/llvm/llvm/lib/IR/ |
| H A D | Dominators.cpp | 358 Instruction *DominatorTree::findNearestCommonDominator(Instruction *I1, in findNearestCommonDominator() function in DominatorTree
368 BasicBlock *DomBB = findNearestCommonDominator(BB1, BB2); in findNearestCommonDominator()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | CodeMoverUtils.cpp | 249 const BasicBlock *CommonDominator = DT.findNearestCommonDominator(&BB0, &BB1); in isControlFlowEquivalent()
443 DT->findNearestCommonDominator(ThisBlock, OtherBlock); in nonStrictlyPostDominate()
|
| H A D | LoopUnrollRuntime.cpp | 175 auto *NewDom = DT->findNearestCommonDominator(OriginalLoopLatchExit, in ConnectProlog()
298 auto *NewDom = DT->findNearestCommonDominator(Exit, NewExit); in ConnectEpilog()
|
| H A D | LoopUnroll.cpp | 675 BasicBlock *NewIDom = DT->findNearestCommonDominator(BB, LatchBlock); in UnrollLoop()
|
| H A D | LoopPeel.cpp | 887 BasicBlock *NewIDom = DT.findNearestCommonDominator(BB, Latch); in peelLoop()
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | CaptureTracking.cpp | 185 EarliestCapture = DT.findNearestCommonDominator(EarliestCapture, I); in captured()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 433 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB); in tryAndMerge()
|
| H A D | AArch64StackTagging.cpp | 454 PrologueBB = DT->findNearestCommonDominator(PrologueBB, AI->getParent()); in insertBaseTaggedPointer()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGStackify.cpp | 267 Header = Header ? MDT.findNearestCommonDominator(Header, Pred) : Pred; in placeBlockMarker()
480 Header = Header ? MDT.findNearestCommonDominator(Header, Pred) : Pred; in placeTryMarker()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/X86/ |
| H A D | X86FlagsCopyLowering.cpp | 493 return MDT->findNearestCommonDominator(LHS, RHS); in runOnMachineFunction()
|