/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGCXXABI.cpp | 286 CXXDtorType DT) const { 292 GVALinkage Linkage, const CXXDestructorDecl *Dtor, CXXDtorType DT) const {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopPass.cpp | 167 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 270 assert(CurrentLoop->isRecursivelyLCSSAForm(*DT, *LI));
|
H A D | TargetTransformInfo.cpp | 58 LoopInfo &LI, DominatorTree &DT, 102 if (!DT.dominates(BB, Pred)) { 249 DominatorTree *DT, const LoopAccessInfo *LAI) const { 250 return TTIImpl->preferPredicateOverEpilogue(L, LI, SE, AC, TLI, DT, LAI); 286 DominatorTree *DT, AssumptionCache *AC, 288 return TTIImpl->canSaveCmp(L, BI, SE, LI, DT, AC, LibInfo); 57 isHardwareLoopCandidate(ScalarEvolution &SE, LoopInfo &LI, DominatorTree &DT, bool ForceNestedLoop, bool ForceHardwareLoopPHI) argument 247 preferPredicateOverEpilogue(Loop *L, LoopInfo *LI, ScalarEvolution &SE, AssumptionCache &AC, TargetLibraryInfo *TLI, DominatorTree *DT, const LoopAccessInfo *LAI) const argument 284 canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC, TargetLibraryInfo *LibInfo) const argument
|
H A D | ScalarEvolution.cpp | 662 DominatorTree &DT, unsigned Depth = 0) { 713 if (DT.dominates(LHead, RHead)) 716 assert(DT.dominates(RHead, LHead) && 729 LA->getOperand(i), RA->getOperand(i), DT, 754 LC->getOperand(i), RC->getOperand(i), DT, 769 RC->getLHS(), DT, Depth + 1); 773 RC->getRHS(), DT, Depth + 1); 787 LC->getOperand(), RC->getOperand(), DT, 810 LoopInfo *LI, DominatorTree &DT) { 819 if (CompareSCEVComplexity(EqCacheSCEV, EqCacheValue, LI, RHS, LHS, DT) < 658 CompareSCEVComplexity( EquivalenceClasses<const SCEV *> &EqCacheSCEV, EquivalenceClasses<const Value *> &EqCacheValue, const LoopInfo *const LI, const SCEV *LHS, const SCEV *RHS, DominatorTree &DT, unsigned Depth = 0) argument 809 GroupByComplexity(SmallVectorImpl<const SCEV *> &Ops, LoopInfo *LI, DominatorTree &DT) argument [all...] |
H A D | LoopAccessAnalysis.cpp | 1792 DominatorTree *DT) { 1945 if (blockNeedsPredication(ST->getParent(), TheLoop, DT)) 1989 if (blockNeedsPredication(LD->getParent(), TheLoop, DT)) 2080 DominatorTree *DT) { 2085 return !DT->dominates(BB, Latch); 2347 DominatorTree *DT, LoopInfo *LI) 2355 analyzeLoop(AA, LI, TLI, DT); 2409 LAI = std::make_unique<LoopAccessInfo>(L, SE, TLI, AA, DT, LI); 2430 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 2460 return LoopAccessInfo(&L, &AR.SE, &AR.TLI, &AR.AA, &AR.DT, 1790 analyzeLoop(AliasAnalysis *AA, LoopInfo *LI, const TargetLibraryInfo *TLI, DominatorTree *DT) argument 2079 blockNeedsPredication(BasicBlock *BB, Loop *TheLoop, DominatorTree *DT) argument 2345 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const TargetLibraryInfo *TLI, AliasAnalysis *AA, DominatorTree *DT, LoopInfo *LI) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfUnit.h | 299 DIE *getOrCreateStaticMemberDIE(const DIDerivedType *DT); 315 DIE &constructMemberDIE(DIE &Buffer, const DIDerivedType *DT);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopVersioningLICM.cpp | 606 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 607 LoopVersioning LVer(*LAI, CurLoop, LI, DT, SE, true);
|
H A D | LoopRerollPass.cpp | 184 DominatorTree *DT; member in class:__anon2706::LoopReroll 381 TargetLibraryInfo *TLI, DominatorTree *DT, LoopInfo *LI, 385 : Parent(Parent), L(L), SE(SE), AA(AA), TLI(TLI), DT(DT), LI(LI), 437 DominatorTree *DT; member in struct:__anon2706::LoopReroll::DAGRootTracker 1619 DAGRootTracker DAGRoots(this, L, IV, SE, AA, TLI, DT, LI, PreserveLCSSA, 1650 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 379 DAGRootTracker(LoopReroll *Parent, Loop *L, Instruction *IV, ScalarEvolution *SE, AliasAnalysis *AA, TargetLibraryInfo *TLI, DominatorTree *DT, LoopInfo *LI, bool PreserveLCSSA, DenseMap<Instruction *, int64_t> &IncrMap, Instruction *LoopCtrlIV) argument
|
H A D | MemCpyOptimizer.cpp | 845 DominatorTree &DT = LookupDomTree(); 847 if (!DT.dominates(cpyDestInst, C)) 858 MR = AA.callCapturesBefore(C, cpyDest, LocationSize::precise(srcSize), &DT); 1283 DominatorTree &DT = LookupDomTree(); local 1286 CS.getInstruction(), &AC, &DT) < ByValAlign) 1328 DominatorTree &DT = LookupDomTree(); local 1336 if (!DT.isReachableFromEntry(&BB))
|
H A D | LoopStrengthReduce.cpp | 1913 DominatorTree &DT; member in class:__anon2716::LSRInstance 2054 LSRInstance(Loop *L, IVUsers &IU, ScalarEvolution &SE, DominatorTree &DT, 2416 if (!DT.dominates(ExitingBlock, LatchBlock)) 2426 !DT.properlyDominates(UI->getUser()->getParent(), ExitingBlock)) { 2508 DT.findNearestCommonDominator(IVIncInsertPos->getParent(), 3044 for (DomTreeNode *Rung = DT.getNode(L->getLoopLatch()); 3243 bool SaveCmp = TTI.canSaveCmp(L, &ExitBranch, &SE, &LI, &DT, &AC, &LibInfo); 3430 if (!DT.dominates(L->getHeader(), UseBB)) 5020 if (Inst == Tentative || !DT.dominates(Inst, Tentative)) { 5027 (!BetterPos || !DT 5496 LSRInstance(Loop *L, IVUsers &IU, ScalarEvolution &SE, DominatorTree &DT, LoopInfo &LI, const TargetTransformInfo &TTI, AssumptionCache &AC, TargetLibraryInfo &LibInfo) argument 5707 ReduceLoopStrength(Loop *L, IVUsers &IU, ScalarEvolution &SE, DominatorTree &DT, LoopInfo &LI, const TargetTransformInfo &TTI, AssumptionCache &AC, TargetLibraryInfo &LibInfo) argument 5743 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local [all...] |
H A D | LoopIdiomRecognize.cpp | 118 DominatorTree *DT; member in class:__anon2697::LoopIdiomRecognize 128 explicit LoopIdiomRecognize(AliasAnalysis *AA, DominatorTree *DT, argument 134 : AA(AA), DT(DT), LI(LI), SE(SE), TLI(TLI), TTI(TTI), DL(DL), ORE(ORE) {} 217 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable 233 LoopIdiomRecognize LIR(AA, DT, LI, SE, TLI, TTI, DL, ORE); 266 LoopIdiomRecognize LIR(&AR.AA, &AR.DT, &AR.LI, &AR.SE, &AR.TLI, &AR.TTI, DL, 562 if (!DT->dominates(BB, ExitBlocks[i]))
|
H A D | MergeICmps.cpp | 865 DominatorTree *DT) { 877 DomTreeUpdater DTU(DT, /*PostDominatorTree*/ nullptr, 938 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); local 939 const bool MadeChanges = runImpl(F, TLI, TTI, AA, DT); 863 runImpl(Function &F, const TargetLibraryInfo &TLI, const TargetTransformInfo &TTI, AliasAnalysis &AA, DominatorTree *DT) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 192 void Calculate(DomTreeT &DT); 195 void CalculateWithUpdates(DomTreeT &DT, 199 void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, 203 void DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, 207 void ApplyUpdates(DomTreeT &DT, 211 bool Verify(const DomTreeT &DT, typename DomTreeT::VerificationLevel VL);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | DebugInfo.cpp | 124 void DebugInfoFinder::processType(DIType *DT) { argument 125 if (!addType(DT)) 127 processScope(DT->getScope()); 128 if (auto *ST = dyn_cast<DISubroutineType>(DT)) { 133 if (auto *DCT = dyn_cast<DICompositeType>(DT)) { 143 if (auto *DDT = dyn_cast<DIDerivedType>(DT)) { 228 bool DebugInfoFinder::addType(DIType *DT) { argument 229 if (!DT) 232 if (!NodesSeen.insert(DT).second) 235 TYs.push_back(const_cast<DIType *>(DT)); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 1185 const DominatorTree *DT) { 1189 KnownBits Known = computeKnownBits(V, DL, 0, AC, CxtI, DT); 1760 Instruction &From, Value &To, Instruction &DomPoint, DominatorTree &DT, 1784 } else if (!DT.dominates(&DomPoint, DII)) { 1841 Instruction &DomPoint, DominatorTree &DT) { 1859 return rewriteDebugUsers(From, To, DomPoint, DT, Identity); 1871 return rewriteDebugUsers(From, To, DomPoint, DT, Identity); 1887 return rewriteDebugUsers(From, To, DomPoint, DT, SignOrZeroExt); 2514 DominatorTree &DT, 2516 auto Dominates = [&DT](cons 1181 getOrEnforceKnownAlignment(Value *V, unsigned PrefAlign, const DataLayout &DL, const Instruction *CxtI, AssumptionCache *AC, const DominatorTree *DT) argument 1759 rewriteDebugUsers( Instruction &From, Value &To, Instruction &DomPoint, DominatorTree &DT, function_ref<DbgValReplacement(DbgVariableIntrinsic &DII)> RewriteExpr) argument 1840 replaceAllDbgUsesWith(Instruction &From, Value &To, Instruction &DomPoint, DominatorTree &DT) argument 2513 replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT, const BasicBlockEdge &Root) argument 2522 replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT, const BasicBlock *BB) argument [all...] |
H A D | CloneFunction.cpp | 755 DominatorTree *DT, 780 DT->addNewBlock(NewPH, LoopDomBB); 812 DT->addNewBlock(NewBB, NewPH); 819 BasicBlock *IDomBB = DT->getNode(BB)->getIDom()->getBlock(); 820 DT->changeImmediateDominator(cast<BasicBlock>(VMap[BB]), 752 cloneLoopWithPreheader(BasicBlock *Before, BasicBlock *LoopDomBB, Loop *OrigLoop, ValueToValueMapTy &VMap, const Twine &NameSuffix, LoopInfo *LI, DominatorTree *DT, SmallVectorImpl<BasicBlock *> &Blocks) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | TargetTransformInfo.h | 104 DominatorTree &DT, bool ForceNestedLoop = false, 526 DominatorTree *DT, 578 DominatorTree *DT, AssumptionCache *AC, 1219 DominatorTree *DT, 1232 LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC, 1492 DominatorTree *DT, 1494 return Impl.preferPredicateOverEpilogue(L, LI, SE, AC, TLI, DT, LAI); 1518 LoopInfo *LI, DominatorTree *DT, AssumptionCache *AC, 1520 return Impl.canSaveCmp(L, BI, SE, LI, DT, AC, LibInfo);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | InterleavedLoadCombinePass.cpp | 66 InterleavedLoadCombineImpl(Function &F, DominatorTree &DT, MemorySSA &MSSA, argument 68 : F(F), DT(DT), MSSA(MSSA), 81 DominatorTree &DT; member in struct:__anon1731::InterleavedLoadCombineImpl 1194 if (!DT.dominates(InsertionPoint, VI.SVI))
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMParallelDSP.cpp | 216 DominatorTree *DT; member in class:__anon2166::ARMParallelDSP 266 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 662 V = DT->dominates(cast<Instruction>(A), cast<Instruction>(B)) ? B : A; 754 if (DT->dominates(Source, Sink) || 765 LoadInst *DomLoad = DT->dominates(Base, Offset) ? Base : Offset;
|
H A D | ARMTargetTransformInfo.h | 234 DominatorTree *DT,
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | LoopPassManager.h | 348 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) &&
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | PredicateInfo.h | 247 DominatorTree &DT; member in class:llvm::PredicateInfo
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorizationLegality.cpp | 615 DT)) { 646 SinkAfter, DT)) { 886 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT); 970 isDereferenceableAndAlignedInLoop(LI, TheLoop, SE, *DT))
|
H A D | LoopVectorizationPlanner.h | 249 void executePlan(InnerLoopVectorizer &LB, DominatorTree *DT);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | DataFlowSanitizer.cpp | 389 DominatorTree DT; member in struct:__anon2623::DFSanFunction 412 DT.recalculate(*F); 1118 if (CCS.Block && DT.dominates(CCS.Block, Pos->getParent())) 1134 Ne, Pos, /*Unreachable=*/false, DFS.ColdCallWeights, &DT)); 1258 if (DomTreeNode *OldNode = DT.getNode(Head)) { 1261 DomTreeNode *NewNode = DT.addNewBlock(Tail, Head); 1263 DT.changeImmediateDominator(Child, NewNode); 1272 DT.addNewBlock(FallbackBB, Head); 1277 DT.addNewBlock(NextBB, LastBr->getParent()); 1692 SplitEdge(II->getParent(), II->getNormalDest(), &DFSF.DT); [all...] |