Home
last modified time | relevance | path

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

123456

/external/llvm/lib/Transforms/Utils/
DLCSSA.cpp64 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, in processInstruction()
209 DominatorTree &DT, in blockDominatesAnExit()
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
265 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
285 DominatorTree *DT; member
DLoopSimplify.cpp117 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, in InsertPreheaderForLoop()
159 DominatorTree *DT, LoopInfo *LI, in rewriteLoopExitBlock()
206 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, in findPHIToPartitionLoops()
249 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop()
352 DominatorTree *DT, LoopInfo *LI) { in insertUniqueBackedgeBlock()
464 DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop()
703 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, in simplifyLoop()
734 DominatorTree *DT; member
DSimplifyIndVar.cpp50 DominatorTree *DT; member in __anonce11d0420111::SimplifyIndvar
57 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, in SimplifyIndvar()
417 const DominatorTree *DT) { in splitOverflowIntrinsic()
597 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, in simplifyUsersOfIV()
607 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT, in simplifyLoopIVs()
DBasicBlockUtils.cpp108 bool llvm::MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT, in MergeBlockIntoPredecessor()
238 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT, in SplitEdge()
285 DominatorTree *DT, LoopInfo *LI) { in SplitBlock()
318 DominatorTree *DT, LoopInfo *LI, in UpdateAnalysisInformation()
476 const char *Suffix, DominatorTree *DT, in SplitBlockPredecessors()
549 DominatorTree *DT, LoopInfo *LI, in SplitLandingPadPredecessors()
710 DominatorTree *DT) { in SplitBlockAndInsertIfThen()
DBreakCriticalEdges.cpp46 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnFunction() local
199 auto *DT = Options.DT; in SplitCriticalEdge() local
/external/clang/lib/Lex/
DPPExpressions.cpp82 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateDefined() argument
163 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT, in EvaluateValue()
496 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
688 DefinedTracker DT; in EvaluateDirectiveSubExpr() local
750 DefinedTracker DT; in EvaluateDirectiveExpression() local
/external/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT, in Eval()
150 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
/external/llvm/lib/Analysis/
DPHITransAddr.cpp147 const DominatorTree *DT) { in PHITranslateSubExpr()
316 const DominatorTree *DT, in PHITranslateValue()
345 const DominatorTree &DT, in PHITranslateWithInsertion()
369 BasicBlock *PredBB, const DominatorTree &DT, in InsertPHITranslatedSubExpr()
DCFG.cpp132 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachableFromMany()
175 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable()
187 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable()
DInstructionSimplify.cpp51 const DominatorTree *DT; member
104 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { in ValueDominatesPHI()
587 const DominatorTree *DT, AssumptionCache *AC, in SimplifyAddInst()
780 const DominatorTree *DT, AssumptionCache *AC, in SimplifySubInst()
960 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFAddInst()
969 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFSubInst()
978 const DominatorTree *DT, AssumptionCache *AC, in SimplifyFMulInst()
986 const DominatorTree *DT, AssumptionCache *AC, in SimplifyMulInst()
1090 const DominatorTree *DT, AssumptionCache *AC, in SimplifySDivInst()
1108 const DominatorTree *DT, AssumptionCache *AC, in SimplifyUDivInst()
[all …]
DScalarEvolutionNormalization.cpp30 const Loop *L, DominatorTree *DT) { in IVUseShouldUsePostIncValue()
71 DominatorTree &DT; member in __anon650b20080111::PostIncTransform
251 DominatorTree &DT) { in TransformForPostIncUse()
DRegionInfo.cpp69 DominatorTree *DT, Region *Parent) : in Region()
130 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
DValueTracking.cpp101 const DominatorTree *DT; member
137 const DominatorTree *DT) { in computeKnownBits()
144 const DominatorTree *DT) { in haveNoCommonBitsSet()
164 const DominatorTree *DT) { in ComputeSignBit()
175 const DominatorTree *DT) { in isKnownToBeAPowerOfTwo()
185 const DominatorTree *DT) { in isKnownNonZero()
191 const DominatorTree *DT) { in isKnownNonNegative()
202 const DominatorTree *DT) { in isKnownNonEqual()
213 const Instruction *CxtI, const DominatorTree *DT) { in MaskedValueIsZero()
224 const DominatorTree *DT) { in ComputeNumSignBits()
[all …]
DDivergenceAnalysis.cpp87 DivergencePropagator(Function &F, TargetTransformInfo &TTI, DominatorTree &DT, in DivergencePropagator()
109 DominatorTree &DT; member in __anon485c62c60111::DivergencePropagator
/external/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h83 DominatorTree *DT; member
91 : DT(DT), LI(LI), MergeIdenticalEdges(false), in DT() function
DCodeExtractor.h48 DominatorTree *const DT; variable
DLoopVersioning.h109 DominatorTree *DT; variable
/external/clang/include/clang/Lex/
DDirectoryLookup.h68 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, in DirectoryLookup()
78 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, in DirectoryLookup()
/external/llvm/lib/CodeGen/
DMachineRegionInfo.cpp26 MachineDominatorTree *DT, MachineRegion *Parent) : in MachineRegion()
84 auto DT = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction() local
/external/llvm/lib/Transforms/Scalar/
DLoopRotation.cpp126 DominatorTree *DT, ScalarEvolution *SE, in rotateLoop()
485 static bool simplifyLoopLatch(Loop *L, LoopInfo *LI, DominatorTree *DT) { in simplifyLoopLatch()
534 AssumptionCache *AC, DominatorTree *DT, in iterativelyRotateLoop()
601 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnLoop() local
DLICM.cpp143 DominatorTree *DT; // Dominator Tree for the current Loop. member
308 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, in sinkRegion()
366 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, in hoistRegion()
440 bool canSinkOrHoistInst(Instruction &I, AliasAnalysis *AA, DominatorTree *DT, in canSinkOrHoistInst()
603 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT, in sink()
689 const DominatorTree *DT, in isSafeToExecuteUnconditionally()
701 const DominatorTree *DT, in isGuaranteedToExecute()
827 DominatorTree *DT, Loop *CurLoop, in promoteLoopAccessesToScalars()
DLoopLoadElimination.cpp104 DominatorTree *DT) { in doesStoreDominatesAllLatches()
117 DominatorTree *DT) in LoadEliminationForLoop()
498 DominatorTree *DT; member in __anon815764290111::LoadEliminationForLoop
513 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
/external/llvm/lib/Target/AArch64/
DAArch64PromoteConstant.cpp345 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( in isDominated() local
370 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( in tryAndMerge() local
471 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( in insertDefinitions() local
/external/llvm/include/llvm/Transforms/Scalar/
DSROA.h56 DominatorTree *DT; variable
/external/llvm/include/llvm/Analysis/
DIteratedDominanceFrontier.h50 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {} in IDFCalculator()

123456