| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| HD | 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-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| HD | FixIrreducible.cpp | 164 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, in createNaturalLoopInternal() 253 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, in createNaturalLoop() 259 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, in createNaturalLoop() 267 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G) { in makeReducible() 313 static bool FixIrreducibleImpl(Function &F, LoopInfo &LI, DominatorTree &DT) { in FixIrreducibleImpl() 344 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local 351 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| HD | 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()
|
| HD | 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
|
| HD | 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
|
| HD | 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
|
| HD | 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
|
| HD | MoveAutoInit.cpp | 64 DominatorTree &DT, MemorySSA &MSSA) { in usersDominator() 106 static bool runMoveAutoInit(Function &F, DominatorTree &DT, MemorySSA &MSSA) { in runMoveAutoInit() 224 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| HD | 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
|
| HD | 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-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| HD | Sink.cpp | 66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() 104 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction() 175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock() 212 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions() 230 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local 251 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| HD | LoopSink.cpp | 118 DominatorTree &DT, BlockFrequencyInfo &BFI) { in findBBsToSinkInto() 173 DominatorTree &DT, BlockFrequencyInfo &BFI, MemorySSAUpdater *MSSAU) { in sinkInstruction() 282 DominatorTree &DT, in sinkLoopInvariantInstructions() 353 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| HD | PartiallyInlineLibCalls.cpp | 106 DominatorTree *DT) { in runPartiallyInlineLibCalls() 162 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); in run() local 195 DominatorTree *DT = nullptr; in runOnFunction() local
|
| HD | 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
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/ |
| HD | 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-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| HD | 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()
|
| HD | 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()
|
| HD | 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
|
| HD | 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()
|
| HD | 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
|
| HD | 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-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| HD | AliasAnalysis.h | 179 DominatorTree &DT; variable 194 : DT(DT), LI(LI) {} in DT() argument
|
| HD | DemandedBits.h | 42 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits() 90 DominatorTree &DT; variable
|
| /freebsd-13-stable/contrib/llvm-project/clang/lib/Lex/ |
| HD | 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-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| HD | 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
|