| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CallBrPrepare.cpp | 84 auto &DT = FAM.getResult<DominatorTreeAnalysis>(Fn); in run() local
118 bool SplitCriticalEdges(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT) { in SplitCriticalEdges()
140 bool InsertIntrinsicCalls(ArrayRef<CallBrInst *> CBRs, DominatorTree &DT) { in InsertIntrinsicCalls()
173 static void PrintDebugDomInfo(const DominatorTree &DT, const Use &U, in PrintDebugDomInfo()
185 void UpdateSSA(DominatorTree &DT, CallBrInst *CBR, CallInst *Intrinsic, in UpdateSSA()
236 DominatorTree *DT; in runOnFunction() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 256 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers); in createNaturalLoop() argument
262 createNaturalLoopInternal(LI, DT, &L, Blocks, Headers); in createNaturalLoop() argument
167 createNaturalLoopInternal(LoopInfo & LI,DominatorTree & DT,Loop * ParentLoop,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoopInternal() argument
270 makeReducible(LoopInfo & LI,DominatorTree & DT,Graph && G) makeReducible() argument
316 FixIrreducibleImpl(Function & F,LoopInfo & LI,DominatorTree & DT) FixIrreducibleImpl() argument
345 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
352 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...] |
| H A D | CodeMoverUtils.cpp | 95 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA, in domTreeLevelBefore()
110 const DominatorTree &DT, in collectControlConditions()
232 const DominatorTree &DT, in isControlFlowEquivalent()
238 const DominatorTree &DT, in isControlFlowEquivalent()
313 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
413 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
425 DominatorTree &DT, in moveInstructionsToTheBeginning()
438 DominatorTree &DT, in moveInstructionsToTheEnd()
451 const DominatorTree *DT, in nonStrictlyPostDominate()
483 const DominatorTree *DT, in isReachedBefore()
|
| H A D | LCSSA.cpp | 78 const DominatorTree &DT, const LoopInfo &LI, in formLCSSAForInstructions()
322 Loop &L, const DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits()
363 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, in formLCSSA()
425 bool llvm::formLCSSARecursively(Loop &L, const DominatorTree &DT, in formLCSSARecursively()
438 static bool formLCSSAOnAllLoops(const LoopInfo *LI, const DominatorTree &DT, in formLCSSAOnAllLoops()
454 DominatorTree *DT; member
521 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | Mem2Reg.cpp | 35 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT, in promoteMemoryToRegister()
62 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
88 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| H A D | UnifyLoopExits.cpp | 143 static bool unifyLoopExits(DominatorTree &DT, LoopInfo &LI, Loop *L) { in unifyLoopExits()
216 static bool runImpl(LoopInfo &LI, DominatorTree &DT) { in runImpl()
232 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
244 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | LoopSimplify.cpp | 118 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, in InsertPreheaderForLoop()
173 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, in findPHIToPartitionLoops()
216 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop()
359 DominatorTree *DT, LoopInfo *LI, in insertUniqueBackedgeBlock()
479 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop()
700 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop()
797 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
830 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | MoveAutoInit.cpp | 65 usersDominator(const MemoryLocation & ML,Instruction * I,DominatorTree & DT,MemorySSA & MSSA) usersDominator() argument
107 runMoveAutoInit(Function & F,DominatorTree & DT,MemorySSA & MSSA) runMoveAutoInit() argument
221 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
[all...] |
| H A D | AssumeBundleBuilder.cpp | 110 DominatorTree* DT = nullptr; member
293 DominatorTree *DT) { in salvageKnowledge()
311 DominatorTree *DT) { in buildAssumeFromKnowledge()
321 DominatorTree *DT) { in simplifyRetainedKnowledge()
338 DominatorTree *DT; member
544 bool simplifyAssumes(Function &F, AssumptionCache *AC, DominatorTree *DT) { in simplifyAssumes()
579 DominatorTree* DT = AM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | LoopVersioning.cpp | 43 LoopInfo *LI, DominatorTree *DT, in LoopVersioning()
260 bool runImpl(LoopInfo *LI, LoopAccessInfoManager &LAIs, DominatorTree *DT, in runImpl()
301 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Sink.cpp | 66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() argument
175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock() argument
105 SinkInstruction(Instruction * Inst,SmallPtrSetImpl<Instruction * > & Stores,DominatorTree & DT,LoopInfo & LI,AAResults & AA) SinkInstruction() argument
212 iterativelySinkInstructions(Function & F,DominatorTree & DT,LoopInfo & LI,AAResults & AA) iterativelySinkInstructions() argument
230 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); run() local
251 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); runOnFunction() local
[all...] |
| H A D | PartiallyInlineLibCalls.cpp | 106 DominatorTree *DT) { in runPartiallyInlineLibCalls()
162 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
195 DominatorTree *DT = nullptr; in runOnFunction() local
|
| H A D | SimplifyCFGPass.cpp | 271 DominatorTree *DT, in simplifyFunctionCFGImpl()
300 DominatorTree *DT, in simplifyFunctionCFG()
369 DominatorTree *DT = nullptr; in run() local
401 DominatorTree *DT = nullptr; in runOnFunction() local
|
| H A D | LoopSink.cpp | 282 DominatorTree &DT, in sinkLoopInvariantInstructions() argument
353 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
120 findBBsToSinkInto(const Loop & L,const SmallPtrSetImpl<BasicBlock * > & UseBBs,const SmallVectorImpl<BasicBlock * > & ColdLoopBBs,DominatorTree & DT,BlockFrequencyInfo & BFI) findBBsToSinkInto() argument
175 sinkInstruction(Loop & L,Instruction & I,const SmallVectorImpl<BasicBlock * > & ColdLoopBBs,const SmallDenseMap<BasicBlock *,int,16> & LoopBlockNumber,LoopInfo & LI,DominatorTree & DT,BlockFrequencyInfo & BFI,MemorySSAUpdater * MSSAU) sinkInstruction() argument
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/ |
| H A D | SPIRVConvergenceRegionAnalysis.cpp | 123 ConvergenceRegion::ConvergenceRegion(DominatorTree &DT, LoopInfo &LI, in ConvergenceRegion()
136 DominatorTree &DT, LoopInfo &LI, in ConvergenceRegion()
201 ConvergenceRegionAnalyzer(Function &F, DominatorTree &DT, LoopInfo &LI) in ConvergenceRegionAnalyzer()
311 DominatorTree &DT; member in llvm::SPIRV::ConvergenceRegionAnalyzer
316 ConvergenceRegionInfo getConvergenceRegions(Function &F, DominatorTree &DT, in getConvergenceRegions()
331 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
342 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CFG.cpp | 137 const DominatorTree *DT, const LoopInfo *LI) { in isReachableImpl()
241 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachableFromMany()
251 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isManyPotentiallyReachableFromMany()
259 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
283 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
|
| H A D | PHITransAddr.cpp | 132 const DominatorTree *DT) { in translateSubExpr()
300 const DominatorTree *DT, in translateValue()
328 const DominatorTree &DT, in translateWithInsertion()
351 const DominatorTree &DT, SmallVectorImpl<Instruction *> &NewInsts) { in insertTranslatedSubExpr()
|
| H A D | MustExecute.cpp | 118 const DominatorTree *DT, in CanProveNotTakenFirstIteration()
259 const DominatorTree *DT, in isGuaranteedToExecute()
278 const DominatorTree *DT, in isGuaranteedToExecute()
312 static bool isMustExecuteIn(const Instruction &I, Loop *L, DominatorTree *DT) { in isMustExecuteIn()
330 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
342 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
543 const DominatorTree *DT = DTGetter(*InitBB->getParent()); in findBackwardJoinPoint() local
744 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | TypeMetadataUtils.cpp | 27 const CallInst *CI, DominatorTree &DT) { in findCallsAtConstantOffset()
54 int64_t Offset, const CallInst *CI, DominatorTree &DT) { in findLoadCallsAtConstantOffset()
85 DominatorTree &DT) { in findDevirtualizableCallsForTypeTest()
108 const CallInst *CI, DominatorTree &DT) { in findDevirtualizableCallsForTypeCheckedLoad()
|
| H A D | RegionInfo.cpp | 64 DominatorTree *DT, Region *Parent) : in Region()
127 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
190 auto *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | Loads.cpp | 39 const Instruction *CtxI, AssumptionCache *AC, const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
189 const Instruction *CtxI, AssumptionCache *AC, const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
203 const Instruction *CtxI, AssumptionCache *AC, const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
225 const DominatorTree *DT, in isDereferenceablePointer()
264 DominatorTree &DT, in isDereferenceableAndAlignedInLoop()
363 const DominatorTree *DT, in isSafeToLoadUnconditionally()
440 const DominatorTree *DT, in isSafeToLoadUnconditionally()
780 DominatorTree *DT, in isDereferenceableReadOnlyLoop()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | AliasAnalysis.h | 179 DominatorTree &DT; variable
194 : DT(DT), LI(LI) {} in DT() function
|
| H A D | DemandedBits.h | 42 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits()
90 DominatorTree &DT; variable
|
| /freebsd/contrib/llvm-project/clang/lib/Lex/ |
| H A D | PPExpressions.cpp | 102 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateDefined() argument
233 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateValue()
632 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
827 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
893 DefinedTracker DT; in EvaluateDirectiveExpression() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 188 bool AMDGPUUnifyDivergentExitNodesImpl::run(Function &F, DominatorTree *DT, in run()
332 DominatorTree *DT = nullptr; in runOnFunction() local
346 DominatorTree *DT = nullptr; in run() local
|