| /NextBSD/contrib/llvm/tools/clang/lib/Lex/ |
| HD | PPExpressions.cpp | 82 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
|
| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | LCSSA.cpp | 62 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, in processInstruction() 205 DominatorTree &DT, in blockDominatesAnExit() 215 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA() 264 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively() 284 DominatorTree *DT; member
|
| HD | LoopSimplify.cpp | 121 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; in InsertPreheaderForLoop() local 162 AliasAnalysis *AA, DominatorTree *DT, in rewriteLoopExitBlock() 210 DominatorTree *DT, in findPHIToPartitionLoops() 254 AliasAnalysis *AA, DominatorTree *DT, in separateNestedLoop() 361 DominatorTree *DT, LoopInfo *LI) { in insertUniqueBackedgeBlock() 479 AliasAnalysis *AA, DominatorTree *DT, LoopInfo *LI, in simplifyOneLoop() 719 bool llvm::simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, Pass *PP, in simplifyLoop() 753 DominatorTree *DT; member
|
| HD | BasicBlockUtils.cpp | 110 bool llvm::MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT, in MergeBlockIntoPredecessor() 239 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT, in SplitEdge() 286 DominatorTree *DT, LoopInfo *LI) { in SplitBlock() 319 DominatorTree *DT, LoopInfo *LI, in UpdateAnalysisInformation() 478 DominatorTree *DT, LoopInfo *LI, in SplitBlockPredecessors() 547 AliasAnalysis *AA, DominatorTree *DT, in SplitLandingPadPredecessors() 708 DominatorTree *DT) { in SplitBlockAndInsertIfThen()
|
| HD | BreakCriticalEdges.cpp | 46 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; in runOnFunction() local 201 auto *DT = Options.DT; in SplitCriticalEdge() local
|
| HD | Mem2Reg.cpp | 68 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in INITIALIZE_PASS_DEPENDENCY() local
|
| /NextBSD/contrib/llvm/include/llvm/Support/ |
| HD | GenericDomTreeConstruction.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass() 108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, in Eval() 151 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | InstructionSimplify.cpp | 51 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 …]
|
| HD | PHITransAddr.cpp | 147 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()
|
| HD | CFG.cpp | 131 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachableFromMany() 174 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable() 186 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable()
|
| HD | ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) { in IVUseShouldUsePostIncValue() 71 DominatorTree &DT; member in __anonce0708b40111::PostIncTransform 251 DominatorTree &DT) { in TransformForPostIncUse()
|
| HD | RegionInfo.cpp | 66 DominatorTree *DT, Region *Parent) : in Region() 121 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); in runOnFunction() local
|
| HD | ValueTracking.cpp | 100 const DominatorTree *DT; member 136 const DominatorTree *DT) { in computeKnownBits() 143 const DominatorTree *DT) { in haveNoCommonBitsSet() 163 const DominatorTree *DT) { in ComputeSignBit() 174 const DominatorTree *DT) { in isKnownToBeAPowerOfTwo() 184 const DominatorTree *DT) { in isKnownNonZero() 193 const Instruction *CxtI, const DominatorTree *DT) { in MaskedValueIsZero() 204 const DominatorTree *DT) { in ComputeNumSignBits() 485 const DominatorTree *DT) { in isValidAssumeForContext() 2883 const DominatorTree *DT, in isDereferenceableFromAttribute() [all …]
|
| HD | DivergenceAnalysis.cpp | 131 DominatorTree &DT, PostDominatorTree &PDT, in DivergencePropagator() 153 DominatorTree &DT; member in __anon4ec144720211::DivergencePropagator
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/Lex/ |
| HD | DirectoryLookup.h | 68 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, in DirectoryLookup() 78 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, in DirectoryLookup()
|
| /NextBSD/contrib/llvm/lib/CodeGen/ |
| HD | MachineRegionInfo.cpp | 26 MachineDominatorTree *DT, MachineRegion *Parent) : in MachineRegion() 84 auto DT = &getAnalysis<MachineDominatorTree>(); in runOnMachineFunction() local
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | SeparateConstOffsetFromGEP.cpp | 223 ConstantOffsetExtractor(Instruction *InsertionPt, const DominatorTree *DT) in ConstantOffsetExtractor() 305 const DominatorTree *DT; member in __anon8cf3dbd50111::ConstantOffsetExtractor 380 const DominatorTree *DT; member in __anon8cf3dbd50111::SeparateConstOffsetFromGEP 653 const DominatorTree *DT) { in Extract() 670 const DominatorTree *DT) { in Find()
|
| HD | LICM.cpp | 137 DominatorTree *DT; // Dominator Tree for the current Loop. member 298 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, in sinkRegion() 356 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, in hoistRegion() 430 bool canSinkOrHoistInst(Instruction &I, AliasAnalysis *AA, DominatorTree *DT, in canSinkOrHoistInst() 582 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT, in sink() 664 const DominatorTree *DT, in isSafeToExecuteUnconditionally() 676 const DominatorTree *DT, in isGuaranteedToExecute() 802 DominatorTree *DT, Loop *CurLoop, in promoteLoopAccessesToScalars()
|
| HD | RewriteStatepointsForGC.cpp | 268 DominatorTree &DT, GCPtrLivenessData &OriginalLivenessData, in analyzeParsePointLiveness() 1028 DominatorTree *DT, DefiningValueMapTy &DVCache) { in findBasePointers() 1056 static void findBasePointers(DominatorTree &DT, DefiningValueMapTy &DVCache, in findBasePointers() 1089 Function &F, DominatorTree &DT, Pass *P, ArrayRef<CallSite> toUpdate, in recomputeLiveInValues() 1110 DominatorTree &DT) { in normalizeForInvokeSafepoint() 1404 makeStatepointExplicit(DominatorTree &DT, const CallSite &CS, Pass *P, in makeStatepointExplicit() 1506 Function &F, DominatorTree &DT, ArrayRef<Value *> Live, in relocationViaAlloca() 1743 Function &F, DominatorTree &DT, Pass *P, ArrayRef<CallSite> toUpdate, in findLiveReferences() 1763 DominatorTree &DT) { in splitVectorValues() 2082 static bool insertParsePoints(Function &F, DominatorTree &DT, Pass *P, in insertParsePoints() [all …]
|
| /NextBSD/contrib/llvm/lib/Target/AArch64/ |
| HD | AArch64PromoteConstant.cpp | 345 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( in isDominated() local 370 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( in tryAndMerge() local 471 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( in insertDefinitions() local
|
| /NextBSD/contrib/llvm/include/llvm/Transforms/Utils/ |
| HD | LoopVersioning.h | 96 DominatorTree *DT; variable
|
| HD | CodeExtractor.h | 48 DominatorTree *const DT; variable
|
| /NextBSD/contrib/llvm/include/llvm/Analysis/ |
| HD | IteratedDominanceFrontier.h | 50 IDFCalculator(DominatorTree &DT) : DT(DT), useLiveIn(false) {} in IDFCalculator()
|
| HD | LazyValueInfo.h | 33 DominatorTree *DT; variable
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | StackProtector.h | 61 DominatorTree *DT; variable
|