/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | CommandLine.h | 542 template <class DT> void setValue(const DT & /*V*/) {} 611 template <class DT> OptionValue<DataType> &operator=(const DT &V) { 851 template <class DT> 852 void addLiteralOption(StringRef Name, const DT &V, StringRef HelpStr) { 1208 template <class ParserClass, class DT> 1209 void printOptionDiff(const Option &O, const generic_parser_base &P, const DT &V, 1210 const OptionValue<DT> &Default, size_t GlobalWidth) { 1211 OptionValue<DT> O [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 196 buildExtractionBlockSet(ArrayRef<BasicBlock *> BBs, DominatorTree *DT, argument 205 if (DT && !DT->isReachableFromEntry(BB)) 244 CodeExtractor::CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT, argument 249 : DT(DT), AggregateArgs(AggregateArgs || AggregateArgsOpt), BFI(BFI), 251 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), 254 CodeExtractor::CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs, argument 258 : DT(&DT), AggregateArg [all...] |
H A D | LoopUtils.cpp | 51 bool llvm::formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI, argument 88 BB, InLoopPredecessors, ".loopexit", DT, LI, MSSAU, PreserveLCSSA); 506 void llvm::deleteDeadLoop(Loop *L, DominatorTree *DT = nullptr, 509 assert((!DT || L->isLCSSAForm(*DT)) && "Expected LCSSA!"); 591 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager); 592 if (DT) { 620 // If we have a DT then we can check that uses outside a loop only in 622 if (DT) 623 assert(!DT [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | Lint.cpp | 133 DominatorTree *DT; member in class:__anon1631::Lint 208 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 550 static bool isZero(Value *V, const DataLayout &DL, DominatorTree *DT, argument 558 KnownBits Known = computeKnownBits(V, DL, 0, AC, dyn_cast<Instruction>(V), DT); 586 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC), 591 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC), 596 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC), 601 Assert(!isZero(I.getOperand(1), I.getModule()->getDataLayout(), DT, AC), 719 if (Value *W = SimplifyInstruction(Inst, {*DL, TLI, DT, AC}))
|
H A D | MemoryDependenceAnalysis.cpp | 383 if (Best == nullptr || DT.dominates(Best, Other)) 397 if (!U || U == LI || !DT.dominates(U, LI)) 689 MR = AA.callCapturesBefore(Inst, MemLoc, &DT, OBB); 1200 if (DT.isReachableFromEntry(Entry.getBB())) { 1269 if (DT.isReachableFromEntry(BB)) { 1340 PredPointer.PHITranslateValue(BB, Pred, &DT, /*MustDominate=*/false); 1463 !DT.isReachableFromEntry(BB)) && 1758 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 1760 return MemoryDependenceResults(AA, AC, TLI, DT, PV, DefaultBlockScanLimit); 1821 auto &DT local [all...] |
H A D | InstructionSimplify.cpp | 206 static bool valueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { argument 219 if (DT) 220 return DT->dominates(I, P); 529 if (!valueDominatesPHI(RHS, PI, Q.DT)) 535 if (!valueDominatesPHI(LHS, PI, Q.DT)) 576 if (!valueDominatesPHI(RHS, PI, Q.DT)) 761 KnownBits Known = computeKnownBits(Op1, Q.DL, 0, Q.AC, Q.CxtI, Q.DT); 1271 KnownBits Known = computeKnownBits(Op1, Q.DL, 0, Q.AC, Q.CxtI, Q.DT); 1303 KnownBits Op0Known = computeKnownBits(Op0, Q.DL, /*Depth=*/0, Q.AC, Q.CxtI, Q.DT); 1366 const KnownBits YKnown = computeKnownBits(Y, Q.DL, 0, Q.AC, Q.CxtI, Q.DT); 2341 computePointerICmp(const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, CmpInst::Predicate Pred, AssumptionCache *AC, const Instruction *CxtI, const InstrInfoQuery &IIQ, Value *LHS, Value *RHS) argument 5519 replaceAndRecursivelySimplifyImpl( Instruction *I, Value *SimpleV, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, SmallSetVector<Instruction *, 8> *UnsimplifiedUsers = nullptr) argument 5578 recursivelySimplifyInstruction(Instruction *I, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC) argument 5585 replaceAndRecursivelySimplify( Instruction *I, Value *SimpleV, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, SmallSetVector<Instruction *, 8> *UnsimplifiedUsers) argument 5598 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; local 5614 auto *DT = AM.template getCachedResult<DominatorTreeAnalysis>(F); local [all...] |
H A D | ModuleSummaryAnalysis.cpp | 167 DominatorTree &DT) { 192 findDevirtualizableCallsForTypeTest(DevirtCalls, Assumes, CI, DT); 212 HasNonCallUses, CI, DT); 244 ProfileSummaryInfo *PSI, DominatorTree &DT, 339 TypeTestAssumeConstVCalls, TypeCheckedLoadConstVCalls, DT); 739 DominatorTree DT(const_cast<Function &>(F)); 745 LoopInfo LI{DT}; 751 computeFunctionSummary(Index, M, F, BFI, PSI, DT, 161 addIntrinsicToSummary( const CallInst *CI, SetVector<GlobalValue::GUID> &TypeTests, SetVector<FunctionSummary::VFuncId> &TypeTestAssumeVCalls, SetVector<FunctionSummary::VFuncId> &TypeCheckedLoadVCalls, SetVector<FunctionSummary::ConstVCall> &TypeTestAssumeConstVCalls, SetVector<FunctionSummary::ConstVCall> &TypeCheckedLoadConstVCalls, DominatorTree &DT) argument 242 computeFunctionSummary(ModuleSummaryIndex &Index, const Module &M, const Function &F, BlockFrequencyInfo *BFI, ProfileSummaryInfo *PSI, DominatorTree &DT, bool HasLocalsInUsedOrAsm, DenseSet<GlobalValue::GUID> &CantBePromoted, bool IsThinLTO) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Scalarizer.cpp | 178 ScalarizerVisitor(unsigned ParallelLoopAccessMDKind, DominatorTree *DT) argument 179 : ParallelLoopAccessMDKind(ParallelLoopAccessMDKind), DT(DT) { 220 DominatorTree *DT; member in class:__anon2755::ScalarizerVisitor 316 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 317 ScalarizerVisitor Impl(ParallelLoopAccessMDKind, DT); 360 if (!DT->isReachableFromEntry(VOp->getParent())) 879 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); local 880 ScalarizerVisitor Impl(ParallelLoopAccessMDKind, DT);
|
H A D | InductiveRangeCheckElimination.cpp | 233 DominatorTree &DT; member in class:__anon2683::InductiveRangeCheckElimination 238 BranchProbabilityInfo *BPI, DominatorTree &DT, 240 : SE(SE), BPI(BPI), DT(DT), LI(LI) {} 605 DominatorTree &DT; member in class:__anon2684::LoopConstrainer 630 DominatorTree &DT, InductiveRangeCheck::Range R) 632 SE(SE), DT(DT), LI(LI), LPMAddNewLoop(LPMAddNewLoop), OriginalLoop(L), 1526 DT.recalculate(F); 1547 formLCSSARecursively(*L, DT, 237 InductiveRangeCheckElimination(ScalarEvolution &SE, BranchProbabilityInfo *BPI, DominatorTree &DT, LoopInfo &LI) argument 627 LoopConstrainer(Loop &L, LoopInfo &LI, function_ref<void(Loop *, bool)> LPMAddNewLoop, const LoopStructure &LS, ScalarEvolution &SE, DominatorTree &DT, InductiveRangeCheck::Range R) argument 1776 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local [all...] |
H A D | NewGVN.cpp | 493 DominatorTree *DT = nullptr; 658 NewGVN(Function &F, DominatorTree *DT, AssumptionCache *AC, 661 : F(F), DT(DT), TLI(TLI), AA(AA), MSSA(MSSA), DL(DL), 662 PredInfo(std::make_unique<PredicateInfo>(F, *DT, *AC)), 663 SQ(DL, TLI, DT, AC, /*CtxI=*/nullptr, /*UseInstrInfo=*/false) {} 895 RPOOrdering.lookup(DT->getNode(From)) >= 896 RPOOrdering.lookup(DT->getNode(To)); 1284 if (DT->dominates(cast<Instruction>(CC->getLeader()), U)) 1287 DT [all...] |
H A D | StraightLineStrengthReduce.cpp | 233 DominatorTree *DT = nullptr; member in class:__anon2761::StraightLineStrengthReduce 267 DT->dominates(Basis.Ins->getParent(), C.Ins->getParent()) && 712 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 716 for (const auto Node : depth_first(DT))
|
H A D | TailRecursionElimination.cpp | 833 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; 839 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager); 868 auto *DT = AM.getCachedResult<DominatorTreeAnalysis>(F); 873 DomTreeUpdater DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Eager);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoadStoreVectorizer.cpp | 115 DominatorTree &DT; member in class:__anon2810::Vectorizer 122 Vectorizer(Function &F, AliasAnalysis &AA, DominatorTree &DT, argument 124 : F(F), AA(AA), DT(DT), SE(SE), TTI(TTI), 256 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 261 Vectorizer V(F, AA, DT, SE, TTI); 271 DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); local 275 Vectorizer V(F, AA, DT, SE, TTI); 472 computeKnownBits(OpA, Known, DL, 0, nullptr, OpA, &DT); 1031 DL, S0, nullptr, &DT); [all...] |
H A D | VPlan.cpp | 466 // We do not attempt to preserve DT for outer loop vectorization currently. 468 updateDominatorTree(State->DT, VectorPreHeaderBB, VectorLatchBB, 477 void VPlan::updateDominatorTree(DominatorTree *DT, BasicBlock *LoopPreHeaderBB, argument 495 DT->addNewBlock(PostDomSucc, BB); 509 DT->addNewBlock(InterimSucc, BB); 510 DT->addNewBlock(PostDomSucc, BB); 513 DT->changeImmediateDominator(LoopExitBB, LoopLatchBB); 514 assert(DT->verify(DominatorTree::VerificationLevel::Fast)); 752 template void DomTreeBuilder::Calculate<VPDominatorTree>(VPDominatorTree &DT);
|
H A D | LoopVectorize.cpp | 401 LoopInfo *LI, DominatorTree *DT, 407 : OrigLoop(OrigLoop), PSE(PSE), LI(LI), DT(DT), TLI(TLI), TTI(TTI), 682 DominatorTree *DT; member in class:llvm::InnerLoopVectorizer 782 LoopInfo *LI, DominatorTree *DT, 788 : InnerLoopVectorizer(OrigLoop, PSE, LI, DT, TLI, TTI, AC, ORE, 1, 1614 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 1628 return Impl.runImpl(F, *SE, *LI, *TTI, *DT, *BFI, TLI, *DB, *AA, *AC, 1673 DT->dominates(Instr->getParent(), LoopVectorPreHeader)); 2709 SplitBlock(TCCheckBlock, TCCheckBlock->getTerminator(), DT, L 400 InnerLoopVectorizer(Loop *OrigLoop, PredicatedScalarEvolution &PSE, LoopInfo *LI, DominatorTree *DT, const TargetLibraryInfo *TLI, const TargetTransformInfo *TTI, AssumptionCache *AC, OptimizationRemarkEmitter *ORE, unsigned VecWidth, unsigned UnrollFactor, LoopVectorizationLegality *LVL, LoopVectorizationCostModel *CM) argument 781 InnerLoopUnroller(Loop *OrigLoop, PredicatedScalarEvolution &PSE, LoopInfo *LI, DominatorTree *DT, const TargetLibraryInfo *TLI, const TargetTransformInfo *TTI, AssumptionCache *AC, OptimizationRemarkEmitter *ORE, unsigned UnrollFactor, LoopVectorizationLegality *LVL, LoopVectorizationCostModel *CM) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineSink.cpp | 91 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon80::MachineSinking 308 if (!DT->dominates(MBB, UseBlock)) 324 DT = &getAnalysis<MachineDominatorTree>(); 375 if (!DT->isReachableFromEntry(&MBB)) return false; 549 if (!DT->dominates(ToBB, *PI)) 622 DT->getNode(MBB)->getChildren(); 935 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) { 1039 if (!User.isDebugValue() || DT->dominates(TargetBlock, User.getParent()))
|
H A D | HardwareLoops.cpp | 155 DominatorTree *DT = nullptr; member in class:__anon1725::HardwareLoops 225 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 288 if (!HWLoopInfo.isHardwareLoopCandidate(*SE, *LI, *DT, ForceNestedLoop, 305 Preheader = InsertPreheaderForLoop(L, DT, LI, nullptr, PreserveLCSSA);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGCXXABI.h | 315 CXXDtorType DT) const = 0; 319 CXXDtorType DT) const; 323 CXXDtorType DT) const;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | Cloning.h | 249 DominatorTree *DT,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUPrintfRuntimeBinding.cpp | 71 return SimplifyInstruction(I, {*TD, TLI, DT}); 75 const DominatorTree *DT; member in class:__anon2082::final 99 : ModulePass(ID), TD(nullptr), DT(nullptr) { 596 DT = DTWP ? &DTWP->getDomTree() : nullptr;
|
H A D | AMDGPUAtomicOptimizer.cpp | 46 DominatorTree *DT; member in class:__anon2070::AMDGPUAtomicOptimizer 88 DT = DTW ? &DTW->getDomTree() : nullptr; 430 SplitBlockAndInsertIfThen(Cond, &I, false, nullptr, DT, nullptr); 566 SplitBlockAndInsertIfThen(Cond, &I, false, nullptr, DT, nullptr);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 157 DominatorTree *DT; member in class:__anon2259::HexagonLoopIdiomRecognize 563 : CurLoop(loop), DL(dl), DT(dt), TLI(tli), SE(se) {} 618 const DominatorTree &DT; member in class:__anon2260::PolynomialMultiplyRecognize 1472 if (Value *SV = SimplifyInstruction(&I, {DL, &TLI, &DT})) 2156 if (Value *Simp = SimplifyInstruction(In, {*DL, TLI, DT})) 2191 DT->addNewBlock(NewPreheader, Preheader); 2192 DT->changeImmediateDominator(Header, NewPreheader); 2229 DT->addNewBlock(MemmoveB, Preheader); 2234 ExitD = DT->findNearestCommonDominator(ExitD, PB); 2242 if (ExitD && DT [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/ |
H A D | SLPVectorizer.h | 71 DominatorTree *DT = nullptr; member in struct:llvm::SLPVectorizerPass
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.h | 63 DominatorTree *DT, AssumptionCache *AC,
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionExpander.h | 201 unsigned replaceCongruentIVs(Loop *L, const DominatorTree *DT, 408 void hoistBeforePos(DominatorTree *DT, Instruction *InstToHoist,
|