| /netbsd-src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| H A D | SimplifyCFG.cpp | 102 static bool removeDeadBlocks_v2(Function &F, DominatorTree &DT) { in removeDeadBlocks_v2()
173 static bool eliminateCondBranches_v2(Function &F, DominatorTree &DT) { in eliminateCondBranches_v2()
219 static bool eliminateCondBranches_v3(Function &F, DominatorTree &DT) { in eliminateCondBranches_v3()
306 static bool mergeIntoSinglePredecessor_v2(Function &F, DominatorTree &DT) { in mergeIntoSinglePredecessor_v2()
361 static bool doSimplify_v2(Function &F, DominatorTree &DT) { in doSimplify_v2()
366 static bool doSimplify_v3(Function &F, DominatorTree &DT) { in doSimplify_v3()
395 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
399 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | Sink.cpp | 71 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
109 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
179 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
219 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions()
237 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
258 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| H A D | LoopFlatten.cpp | 432 static OverflowResult checkOverflow(FlattenInfo &FI, DominatorTree *DT, in checkOverflow()
471 static bool CanFlattenLoopPair(FlattenInfo &FI, DominatorTree *DT, LoopInfo *LI, in CanFlattenLoopPair()
515 static bool DoFlattenLoopPair(FlattenInfo &FI, DominatorTree *DT, LoopInfo *LI, in DoFlattenLoopPair()
577 static bool CanWidenIV(FlattenInfo &FI, DominatorTree *DT, LoopInfo *LI, in CanWidenIV()
627 static bool FlattenLoopPair(FlattenInfo &FI, DominatorTree *DT, LoopInfo *LI, in FlattenLoopPair()
661 bool Flatten(DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE, in Flatten()
676 auto *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
739 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnFunction() local
|
| H A D | PartiallyInlineLibCalls.cpp | 105 DominatorTree *DT) { in runPartiallyInlineLibCalls()
158 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
191 DominatorTree *DT = nullptr; in runOnFunction() local
|
| H A D | SimplifyCFGPass.cpp | 238 DominatorTree *DT, in simplifyFunctionCFGImpl()
266 DominatorTree *DT, in simplifyFunctionCFG()
310 DominatorTree *DT = nullptr; in run() local
347 DominatorTree *DT = nullptr; in runOnFunction() local
|
| H A D | SpeculateAroundPHIs.cpp | 49 isSafeToSpeculatePHIUsers(PHINode &PN, DominatorTree &DT, in isSafeToSpeculatePHIUsers()
205 SmallPtrSetImpl<Instruction *> &UnsafeSet, DominatorTree &DT, in isSafeAndProfitableToSpeculateAroundPHI()
430 DominatorTree &DT, TargetTransformInfo &TTI) { in findProfitablePHIs()
568 DominatorTree &DT) { in speculatePHIs()
740 DominatorTree &DT, TargetTransformInfo &TTI) { in tryToSpeculatePHIs()
809 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 158 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, in createNaturalLoopInternal()
247 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, in createNaturalLoop()
253 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, in createNaturalLoop()
261 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G) { in makeReducible()
307 static bool FixIrreducibleImpl(Function &F, LoopInfo &LI, DominatorTree &DT) { in FixIrreducibleImpl()
336 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
343 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | CodeMoverUtils.cpp | 96 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA, in domTreeLevelBefore()
109 const BasicBlock &BB, const BasicBlock &Dominator, const DominatorTree &DT, in collectControlConditions()
230 const DominatorTree &DT, in isControlFlowEquivalent()
236 const DominatorTree &DT, in isControlFlowEquivalent()
311 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
390 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
401 DominatorTree &DT, in moveInstructionsToTheBeginning()
416 DominatorTree &DT, in moveInstructionsToTheEnd()
|
| H A D | LCSSA.cpp | 80 const DominatorTree &DT, const LoopInfo &LI, in formLCSSAForInstructions()
295 Loop &L, const DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits()
336 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, in formLCSSA()
403 bool llvm::formLCSSARecursively(Loop &L, const DominatorTree &DT, in formLCSSARecursively()
416 static bool formLCSSAOnAllLoops(const LoopInfo *LI, const DominatorTree &DT, in formLCSSAOnAllLoops()
432 DominatorTree *DT; member
499 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 | 138 static bool unifyLoopExits(DominatorTree &DT, LoopInfo &LI, Loop *L) { in unifyLoopExits()
210 static bool runImpl(LoopInfo &LI, DominatorTree &DT) { in runImpl()
226 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
236 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | LoopSimplify.cpp | 123 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, in InsertPreheaderForLoop()
178 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, in findPHIToPartitionLoops()
221 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop()
365 DominatorTree *DT, LoopInfo *LI, in insertUniqueBackedgeBlock()
486 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop()
719 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop()
810 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
845 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | LibCallsShrinkWrap.cpp | 76 LibCallsShrinkWrap(const TargetLibraryInfo &TLI, DominatorTree *DT) in LibCallsShrinkWrap()
130 DominatorTree *DT; member in __anon5f6800280211::LibCallsShrinkWrap
524 DominatorTree *DT) { in runImpl()
539 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnFunction() local
554 auto *DT = FAM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | LoopVersioning.cpp | 41 LoopInfo *LI, DominatorTree *DT, in LoopVersioning()
261 DominatorTree *DT, ScalarEvolution *SE) { in runImpl()
309 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
353 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | TypeMetadataUtils.cpp | 28 const CallInst *CI, DominatorTree &DT) { in findCallsAtConstantOffset()
55 int64_t Offset, const CallInst *CI, DominatorTree &DT) { in findLoadCallsAtConstantOffset()
78 DominatorTree &DT) { in findDevirtualizableCallsForTypeTest()
99 const CallInst *CI, DominatorTree &DT) { in findDevirtualizableCallsForTypeCheckedLoad()
|
| H A D | RegionInfo.cpp | 63 DominatorTree *DT, Region *Parent) : in Region()
126 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
189 auto *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | MustExecute.cpp | 120 const DominatorTree *DT, in CanProveNotTakenFirstIteration()
252 const DominatorTree *DT, in isGuaranteedToExecute()
271 const DominatorTree *DT, in isGuaranteedToExecute()
400 static bool isMustExecuteIn(const Instruction &I, Loop *L, DominatorTree *DT) { in isMustExecuteIn()
418 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
430 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
465 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
641 const DominatorTree *DT = DTGetter(*InitBB->getParent()); in findBackwardJoinPoint() local
842 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | PHITransAddr.cpp | 145 const DominatorTree *DT) { in PHITranslateSubExpr()
313 const DominatorTree *DT, in PHITranslateValue()
342 const DominatorTree &DT, in PHITranslateWithInsertion()
366 BasicBlock *PredBB, const DominatorTree &DT, in InsertPHITranslatedSubExpr()
|
| H A D | CFG.cpp | 139 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachableFromMany()
213 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
238 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
|
| H A D | Loads.cpp | 46 const Instruction *CtxI, const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
198 const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
214 const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
237 const DominatorTree *DT, in isDereferenceablePointer()
275 DominatorTree &DT) { in isDereferenceableAndAlignedInLoop()
338 const DominatorTree *DT, in isSafeToLoadUnconditionally()
413 const DominatorTree *DT, in isSafeToLoadUnconditionally()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | DemandedBits.h | 42 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits()
87 DominatorTree &DT; variable
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| H A D | AggressiveInstCombine.cpp | 76 static bool foldGuardedFunnelShift(Instruction &I, const DominatorTree &DT) { in foldGuardedFunnelShift()
368 static bool foldUnusualPatterns(Function &F, DominatorTree &DT) { in foldUnusualPatterns()
397 static bool runImpl(Function &F, TargetLibraryInfo &TLI, DominatorTree &DT) { in runImpl()
419 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
426 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
|
| H A D | AggressiveInstCombineInternal.h | 54 const DominatorTree &DT; variable
79 const DominatorTree &DT) in TruncInstCombine()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Lex/ |
| H A D | PPExpressions.cpp | 102 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateDefined() argument
229 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateValue()
611 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
806 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
871 DefinedTracker DT; in EvaluateDirectiveExpression() local
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| H A D | SCCP.cpp | 30 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
69 DominatorTree &DT = in runOnModule() local
|