Home
last modified time | relevance | path

Searched defs:DT (Results 1 – 25 of 209) sorted by relevance

123456789

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DSink.cpp38 DominatorTree &DT) { in AllUsesDominatedByBlock()
96 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget()
141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
199 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock()
239 static bool iterativelySinkInstructions(Function &F, DominatorTree &DT, in iterativelySinkInstructions()
257 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
278 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
DLoopSink.cpp123 DominatorTree &DT, BlockFrequencyInfo &BFI) { in findBBsToSinkInto()
178 LoopInfo &LI, DominatorTree &DT, in sinkInstruction()
253 DominatorTree &DT, in sinkLoopInvariantInstructions()
321 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
DSpeculateAroundPHIs.cpp49 isSafeToSpeculatePHIUsers(PHINode &PN, DominatorTree &DT, in isSafeToSpeculatePHIUsers()
205 SmallPtrSetImpl<Instruction *> &UnsafeSet, DominatorTree &DT, in isSafeAndProfitableToSpeculateAroundPHI()
424 int NumPreds, DominatorTree &DT, TargetTransformInfo &TTI) { in findProfitablePHIs()
562 DominatorTree &DT) { in speculatePHIs()
734 DominatorTree &DT, TargetTransformInfo &TTI) { in tryToSpeculatePHIs()
806 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
DLoopSimplifyCFG.cpp121 DominatorTree &DT; member in __anon89d58f750111::ConstantTerminatorFoldingImpl
526 ConstantTerminatorFoldingImpl(Loop &L, LoopInfo &LI, DominatorTree &DT, in ConstantTerminatorFoldingImpl()
625 static bool constantFoldTerminators(Loop &L, DominatorTree &DT, LoopInfo &LI, in constantFoldTerminators()
643 static bool mergeBlocksIntoPredecessors(Loop &L, DominatorTree &DT, in mergeBlocksIntoPredecessors()
674 static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI, in simplifyLoopCFG()
727 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnLoop() local
DLoopUnrollAndJamPass.cpp155 Loop *L, Loop *SubLoop, const TargetTransformInfo &TTI, DominatorTree &DT, in computeUnrollAndJamCount()
278 tryToUnrollAndJamLoop(Loop *L, DominatorTree &DT, LoopInfo *LI, in tryToUnrollAndJamLoop()
430 static bool tryToUnrollAndJamLoop(Function &F, DominatorTree &DT, LoopInfo &LI, in tryToUnrollAndJamLoop()
478 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
529 DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
DFloat2Int.cpp65 const DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
123 void Float2IntPass::findRoots(Function &F, const DominatorTree &DT, in findRoots()
518 bool Float2IntPass::runImpl(Function &F, const DominatorTree &DT) { in runImpl()
543 const DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DInstructionPrecedenceTracking.h52 InstructionPrecedenceTracking(DominatorTree *DT) in InstructionPrecedenceTracking()
99 ImplicitControlFlowTracking(DominatorTree *DT) in ImplicitControlFlowTracking()
124 MemoryWriteTracking(DominatorTree *DT) : InstructionPrecedenceTracking(DT) {} in MemoryWriteTracking()
DOrderedInstructions.h35 DominatorTree *DT; variable
44 OrderedInstructions(DominatorTree *DT) : DT(DT) {} in OrderedInstructions()
DDemandedBits.h42 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) : in DemandedBits()
73 DominatorTree &DT; variable
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DLCSSA.cpp79 DominatorTree &DT, LoopInfo &LI, in formLCSSAForInstructions()
277 Loop &L, DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, in computeBlocksDominatingExits()
321 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
386 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
399 static bool formLCSSAOnAllLoops(LoopInfo *LI, DominatorTree &DT, in formLCSSAOnAllLoops()
415 DominatorTree *DT; member
482 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
DMem2Reg.cpp35 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
DCodeMoverUtils.cpp34 const DominatorTree &DT, in isControlFlowEquivalent()
40 const DominatorTree &DT, in isControlFlowEquivalent()
93 const DominatorTree &DT, in isSafeToMoveBefore()
178 const DominatorTree &DT, in moveInstsBottomUp()
DLibCallsShrinkWrap.cpp76 LibCallsShrinkWrap(const TargetLibraryInfo &TLI, DominatorTree *DT) in LibCallsShrinkWrap()
130 DominatorTree *DT; member in __anon7bf2ab680211::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
DLoopSimplify.cpp123 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, in InsertPreheaderForLoop()
183 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, in findPHIToPartitionLoops()
226 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop()
350 DominatorTree *DT, LoopInfo *LI, in insertUniqueBackedgeBlock()
473 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop()
710 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop()
801 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
836 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DTypeMetadataUtils.cpp26 const CallInst *CI, DominatorTree &DT) { in findCallsAtConstantOffset()
53 int64_t Offset, const CallInst *CI, DominatorTree &DT) { in findLoadCallsAtConstantOffset()
76 DominatorTree &DT) { in findDevirtualizableCallsForTypeTest()
101 const CallInst *CI, DominatorTree &DT) { in findDevirtualizableCallsForTypeCheckedLoad()
DLoads.cpp54 const Instruction *CtxI, const DominatorTree *DT, in isDereferenceableAndAlignedPointer()
127 const DominatorTree *DT) { in isDereferenceableAndAlignedPointer()
142 const DominatorTree *DT) { in isDereferenceableAndAlignedPointer()
162 const DominatorTree *DT) { in isDereferenceablePointer()
199 DominatorTree &DT) { in isDereferenceableAndAlignedInLoop()
265 const DominatorTree *DT) { in isSafeToLoadUnconditionally()
344 const DominatorTree *DT) { in isSafeToLoadUnconditionally()
DRegionInfo.cpp66 DominatorTree *DT, Region *Parent) : in Region()
129 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
192 auto *DT = &AM.getResult<DominatorTreeAnalysis>(F); in run() local
DMustExecute.cpp117 const DominatorTree *DT, in CanProveNotTakenFirstIteration()
249 const DominatorTree *DT, in isGuaranteedToExecute()
268 const DominatorTree *DT, in isGuaranteedToExecute()
365 DominatorTree *DT = new DominatorTree(const_cast<Function &>(F)); in runOnModule() local
392 static bool isMustExecuteIn(const Instruction &I, Loop *L, DominatorTree *DT) { in isMustExecuteIn()
410 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
422 DominatorTree &DT, LoopInfo &LI) { in MustExecuteAnnotatedWriter()
461 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
DPHITransAddr.cpp145 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()
DCFG.cpp132 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachableFromMany()
207 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable()
220 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, in isPotentiallyReachable()
DIVUsers.cpp95 static bool isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT, in isSimplifiedLoopNest()
130 const Loop *L, DominatorTree *DT) { in IVUseShouldUsePostIncValue()
305 IVUsers::IVUsers(Loop *L, AssumptionCache *AC, LoopInfo *LI, DominatorTree *DT, in IVUsers()
370 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnLoop() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/AggressiveInstCombine/
DAggressiveInstCombineInternal.h55 const DominatorTree &DT; variable
80 const DominatorTree &DT) in TruncInstCombine()
DAggressiveInstCombine.cpp323 static bool foldUnusualPatterns(Function &F, DominatorTree &DT) { in foldUnusualPatterns()
352 static bool runImpl(Function &F, TargetLibraryInfo &TLI, DominatorTree &DT) { in runImpl()
374 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
381 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); in run() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DPGOMemOPSizeOpt.cpp139 OptimizationRemarkEmitter &ORE, DominatorTree *DT) in MemOPSizeOpt()
176 DominatorTree *DT; member in __anon57b37fce0211::MemOPSizeOpt
417 DominatorTree *DT) { in PGOMemOPSizeOptImpl()
433 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnFunction() local
444 auto *DT = FAM.getCachedResult<DominatorTreeAnalysis>(F); in run() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DSCCP.cpp18 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F); in run() local
57 DominatorTree &DT = in runOnModule() local

123456789