/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | ByteCodeStmtGen.cpp | 229 auto DT = VD->getType(); local 237 if (Optional<PrimType> T = this->classify(DT)) { 238 auto Off = this->allocateLocalPrimitive(VD, *T, DT.isConstQualified());
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonGenExtract.cpp | 83 DominatorTree *DT; member in class:__anon5160::HexagonGenExtract 225 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B))) 256 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
H A D | HexagonCommonGEP.cpp | 157 DominatorTree *DT; member in class:__anon5139::HexagonCommonGEP 325 // Compute block ordering for a typical DT-based traversal of the flow 330 for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root))) 415 // The creation of gep nodes requires DT-traversal. When processing a GEP 670 static BasicBlock *nearest_common_dominator(DominatorTree *DT, T &Blocks) { argument 690 Dom = B ? DT->findNearestCommonDominator(Dom, B) : nullptr; 699 static BasicBlock *nearest_common_dominatee(DominatorTree *DT, T &Blocks) { argument 707 return DT->getRoot(); 713 if (DT->dominates(B, DomB)) 715 if (!DT 866 preheader(DominatorTree *DT, Loop *L) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | SanitizerCoverage.cpp | 481 static bool isFullDominator(const BasicBlock *BB, const DominatorTree *DT) { argument 486 if (!DT->dominates(BB, SUCC)) 508 const DominatorTree *DT, 533 return !isFullDominator(BB, DT) 543 const DominatorTree *DT) { 544 if (DT->dominates(To, From)) 547 if (DT->dominates(Next, From)) 557 static bool IsInterestingCmp(ICmpInst *CMP, const DominatorTree *DT, argument 563 if (IsBackEdge(BR->getParent(), B, DT)) 601 const DominatorTree *DT local 507 shouldInstrumentBlock(const Function &F, const BasicBlock *BB, const DominatorTree *DT, const PostDominatorTree *PDT, const SanitizerCoverageOptions &Options) argument 542 IsBackEdge(BasicBlock *From, BasicBlock *To, const DominatorTree *DT) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 80 assert(SE.DT.dominates(Ret, &*BIP)); 512 SE.DT.dominates(cast<Instruction>(V), &*Builder.GetInsertPoint())); 606 DominatorTree &DT) { 611 if (DT.dominates(A->getHeader(), B->getHeader())) return B; 612 if (DT.dominates(B->getHeader(), A->getHeader())) return A; 638 L = PickMostRelevantLoop(L, getRelevantLoop(Op), SE.DT); 647 getRelevantLoop(D->getLHS()), getRelevantLoop(D->getRHS()), SE.DT); 657 DominatorTree &DT; member in class:__anon4473::LoopCompare 659 explicit LoopCompare(DominatorTree &dt) : DT(dt) {} 670 return PickMostRelevantLoop(LHS.first, RHS.first, DT) ! 605 PickMostRelevantLoop(const Loop *A, const Loop *B, DominatorTree &DT) argument 1080 hoistBeforePos(DominatorTree *DT, Instruction *InstToHoist, Instruction *Pos, PHINode *LoopPhi) argument 1949 replaceCongruentIVs(Loop *L, const DominatorTree *DT, SmallVectorImpl<WeakTrackingVH> &DeadInsts, const TargetTransformInfo *TTI) argument [all...] |
H A D | BasicAliasAnalysis.cpp | 105 (DT && Inv.invalidate<DominatorTreeAnalysis>(Fn, PA)) || 281 AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) { 320 BOp, DT)) { 328 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 333 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 338 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 344 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW); 384 Depth + 1, AC, DT, NSW, NUW); 465 DominatorTree *DT) { 582 SExtBits, DL, 0, AC, DT, NS 278 GetLinearExpression( const Value *V, APInt &Scale, APInt &Offset, unsigned &ZExtBits, unsigned &SExtBits, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) argument 463 DecomposeGEPExpression(const Value *V, DecomposedGEP &Decomposed, const DataLayout &DL, AssumptionCache *AC, DominatorTree *DT) argument 1979 constantOffsetHeuristic( const SmallVectorImpl<VariableGEPIndex> &VarIndices, LocationSize MaybeV1Size, LocationSize MaybeV2Size, APInt BaseOffset, AssumptionCache *AC, DominatorTree *DT) argument [all...] |
H A D | LoopInfo.cpp | 423 DominatorTree &DT) { 442 DT.isReachableFromEntry(UserBB)) 449 bool Loop::isLCSSAForm(DominatorTree &DT) const { 452 return isBlockInLCSSAForm(*this, *BB, DT); 456 bool Loop::isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const { 461 return isBlockInLCSSAForm(*LI.getLoopFor(BB), *BB, DT); 1079 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 1080 LI.verify(DT); 1096 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); 1097 LI.verify(DT); [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | StackProtector.cpp | 87 DT = DTWP ? &DTWP->getDomTree() : nullptr; 493 if (DT && DT->isReachableFromEntry(BB)) { 494 DT->addNewBlock(NewBB, BB); 495 DT->addNewBlock(FailBB, BB);
|
H A D | InterleavedAccessPass.cpp | 101 DominatorTree *DT = nullptr; member in class:__anon4560::InterleavedAccess 377 if (!DT->dominates(Shuffle, Extract)) 452 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | VectorUtils.h | 563 DominatorTree *DT, LoopInfo *LI, 565 : PSE(PSE), TheLoop(L), DT(DT), LI(LI), LAI(LAI) {} 625 DominatorTree *DT; member in class:llvm::InterleavedAccessInfo 700 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT); 562 InterleavedAccessInfo(PredicatedScalarEvolution &PSE, Loop *L, DominatorTree *DT, LoopInfo *LI, const LoopAccessInfo *LAI) argument
|
H A D | LoopAccessAnalysis.h | 519 AliasAnalysis *AA, DominatorTree *DT, LoopInfo *LI); 543 DominatorTree *DT); 611 const TargetLibraryInfo *TLI, DominatorTree *DT); 754 DominatorTree *DT = nullptr; member in class:llvm::LoopAccessLegacyAnalysis
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64StackTagging.cpp | 302 const DominatorTree *DT); 437 const DominatorTree *DT) { 449 PrologueBB = DT->findNearestCommonDominator(PrologueBB, AI->getParent()); 589 DominatorTree *DT = nullptr; local 591 DT = &P->getDomTree(); 593 if (DT == nullptr && (NumInterestingAllocas > 1 || 596 DT = DeleteDT.get(); 612 Instruction *Base = insertBaseTaggedPointer(Allocas, DT); 648 if (!isPotentiallyReachable(Start, RI, nullptr, DT)) 651 if (DT ! 435 insertBaseTaggedPointer( const MapVector<AllocaInst *, AllocaInfo> &Allocas, const DominatorTree *DT) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopPredication.cpp | 254 DominatorTree *DT; member in class:__anon5671::LoopPredication 311 LoopPredication(AliasAnalysis *AA, DominatorTree *DT, argument 314 : AA(AA), DT(DT), SE(SE), LI(LI), BPI(BPI) {}; 335 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable 339 LoopPredication LP(AA, DT, SE, LI, &BPI); 365 LoopPredication LP(&AR.AA, &AR.DT, &AR.SE, &AR.LI, BPI); 1003 DominatorTree &DT, 1013 assert(DT.dominates(ExitingBB, L->getLoopLatch()) && 1112 const SCEV *MinEC = getMinAnalyzeableBackedgeTakenCount(*SE, *DT, 1002 getMinAnalyzeableBackedgeTakenCount(ScalarEvolution &SE, DominatorTree &DT, Loop *L) argument [all...] |
H A D | LoopUnrollPass.cpp | 336 const Loop *L, unsigned TripCount, DominatorTree &DT, ScalarEvolution &SE, 466 assert(L->isLCSSAForm(DT) && 739 Loop *L, const TargetTransformInfo &TTI, DominatorTree &DT, LoopInfo *LI, 829 L, FullUnrollTripCount, DT, SE, EphValues, TTI, 1014 Loop *L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE, 1122 L, TTI, DT, LI, SE, EphValues, &ORE, TripCount, MaxTripCount, MaxOrZero, 1140 LI, &SE, &DT, &AC, &ORE, PreserveLCSSA, &RemainderLoop); 1227 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable 1240 L, DT, LI, SE, TTI, AC, ORE, nullptr, nullptr, PreserveLCSSA, OptLevel, 1321 bool Changed = tryToUnrollLoop(&L, AR.DT, 335 analyzeLoopUnrollCost( const Loop *L, unsigned TripCount, DominatorTree &DT, ScalarEvolution &SE, const SmallPtrSetImpl<const Value *> &EphValues, const TargetTransformInfo &TTI, unsigned MaxUnrolledLoopSize) argument 738 computeUnrollCount( Loop *L, const TargetTransformInfo &TTI, DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE, const SmallPtrSetImpl<const Value *> &EphValues, OptimizationRemarkEmitter *ORE, unsigned &TripCount, unsigned MaxTripCount, bool MaxOrZero, unsigned &TripMultiple, unsigned LoopSize, TargetTransformInfo::UnrollingPreferences &UP, bool &UseUpperBound) argument 1013 tryToUnrollLoop( Loop *L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE, const TargetTransformInfo &TTI, AssumptionCache &AC, OptimizationRemarkEmitter &ORE, BlockFrequencyInfo *BFI, ProfileSummaryInfo *PSI, bool PreserveLCSSA, int OptLevel, bool OnlyWhenForced, bool ForgetAllSCEV, Optional<unsigned> ProvidedCount, Optional<unsigned> ProvidedThreshold, Optional<bool> ProvidedAllowPartial, Optional<bool> ProvidedRuntime, Optional<bool> ProvidedUpperBound, Optional<bool> ProvidedAllowPeeling, Optional<bool> ProvidedAllowProfileBasedPeeling, Optional<unsigned> ProvidedFullUnrollMaxCount) argument 1416 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local [all...] |
H A D | DeadStoreElimination.cpp | 654 BasicBlock *BB, DominatorTree *DT) { 662 if (DT->isReachableFromEntry(Pred)) 670 MemoryDependenceResults *MD, DominatorTree *DT, 721 findUnconditionalPreds(Blocks, BB, DT); 1090 MemoryDependenceResults *MD, DominatorTree *DT, 1105 MadeChange |= handleFree(F, AA, MD, DT, TLI, IOL, OBB, ThrowableInst); 1340 MemoryDependenceResults *MD, DominatorTree *DT, 1346 if (DT->isReachableFromEntry(&BB)) 1347 MadeChange |= eliminateDeadStores(BB, AA, MD, DT, TLI); 1357 DominatorTree *DT local 653 findUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, BasicBlock *BB, DominatorTree *DT) argument 669 handleFree(CallInst *F, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI, InstOverlapIntervalsTy &IOL, OrderedBasicBlock &OBB, MapVector<Instruction *, bool> &ThrowableInst) argument 1089 eliminateDeadStores(BasicBlock &BB, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument 1339 eliminateDeadStores(Function &F, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument [all...] |
H A D | EarlyCSE.cpp | 484 DominatorTree &DT; member in class:__anon5635::EarlyCSE 565 const TargetTransformInfo &TTI, DominatorTree &DT, 567 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), SQ(DL, &TLI, &DT, &AC), MSSA(MSSA), 884 if (unsigned Count = replaceDominatedUsesWith(Curr, TorF, DT, 1316 CurrentGeneration, DT.getRootNode(), 1317 DT.getRootNode()->begin(), DT.getRootNode()->end())); 1358 auto &DT local 564 EarlyCSE(const DataLayout &DL, const TargetLibraryInfo &TLI, const TargetTransformInfo &TTI, DominatorTree &DT, AssumptionCache &AC, MemorySSA *MSSA) argument 1403 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable [all...] |
H A D | GVN.cpp | 442 if (NonLocalDepCall && DT->properlyDominates(I->getBB(), C->getParent())){ 619 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 625 bool Changed = runImpl(F, AC, DT, TLI, AA, &MemDep, LI, &ORE); 830 DominatorTree *DT, 842 DT->dominates(cast<Instruction>(U), LI)) { 922 reportMayClobberedLoad(LI, DepInfo, DT, ORE); 1180 Cur, Cur->getSinglePredecessor(), *DT, NewInsts); 1190 LoadPtr = Address.PHITranslateWithInsertion(LoadBB, UnavailablePred, *DT, 1759 if (DT->dominates(Vals.BB, BB)) { 1766 if (DT 829 reportMayClobberedLoad(LoadInst *LI, MemDepResult DepInfo, DominatorTree *DT, OptimizationRemarkEmitter *ORE) argument 1780 isOnlyReachableViaThisEdge(const BasicBlockEdge &E, DominatorTree *DT) argument [all...] |
H A D | CallSiteSplitting.cpp | 472 assert(DTU.hasDomTree() && "We need a DTU with a valid DT!"); 511 TargetTransformInfo &TTI, DominatorTree &DT) { 513 DomTreeUpdater DTU(&DT, DomTreeUpdater::UpdateStrategy::Lazy); 569 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable 570 return doCallSiteSplitting(F, TLI, TTI, DT); 591 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 593 if (!doCallSiteSplitting(F, TLI, TTI, DT)) 510 doCallSiteSplitting(Function &F, TargetLibraryInfo &TLI, TargetTransformInfo &TTI, DominatorTree &DT) argument
|
H A D | LoopInterchange.cpp | 400 LoopInfo *LI, DominatorTree *DT, 403 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT), 425 DominatorTree *DT; member in class:__anon5668::LoopInterchangeTransform 437 DominatorTree *DT = nullptr; member in struct:__anon5668::LoopInterchange 460 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 578 LoopInterchangeTransform LIT(OuterLoop, InnerLoop, SE, LI, DT, LoopNestExit, 1253 InnerLoop->getLoopLatch()->getTerminator(), DT, LI); 1299 SplitBlock(InnerLoopHeader, InnerLoopHeader->getFirstNonPHI(), DT, LI); 1453 InsertPreheaderForLoop(OuterLoop, DT, L 399 LoopInterchangeTransform(Loop *Outer, Loop *Inner, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, BasicBlock *LoopNestExit, const LoopInterchangeLegality &LIL) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyIndVar.cpp | 56 DominatorTree *DT; member in class:__anon5768::SimplifyIndvar 63 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, argument 66 : L(Loop), LI(LI), SE(SE), DT(DT), Rewriter(Rewriter), DeadInsts(Dead), 542 !DT->isReachableFromEntry(cast<Instruction>(U)->getParent())) 712 if (!DT || !DT->dominates(IVOperand, UseInst)) 933 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, argument 936 SimplifyIndvar SIV(LI->getLoopFor(CurrIV->getParent()), SE, DT, LI, Rewriter, 944 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT, argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SILowerI1Copies.cpp | 56 MachineDominatorTree *DT = nullptr; member in class:__anon5024::SILowerI1Copies 259 MachineDominatorTree &DT; member in class:__anon5024::LoopFinder 284 LoopFinder(MachineDominatorTree &DT, MachinePostDominatorTree &PDT) argument 285 : DT(DT), PDT(PDT) {} 330 Dom = DT.findNearestCommonDominator(Dom, MBB); 387 VisitedDom = DT.findNearestCommonDominator(VisitedDom, MBB); 457 DT = &getAnalysis<MachineDominatorTree>(); 543 LoopFinder LF(*DT, *PDT); 670 LoopFinder LF(*DT, *PD [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
H A D | CoroFrame.cpp | 495 AllocaUseVisitor(const DataLayout &DL, const DominatorTree &DT, argument 497 : PtrUseVisitor(DL), DT(DT), CoroBegin(CB) {} 501 if (DT.dominates(&I, &CoroBegin)) 520 const DominatorTree &DT; member in struct:__anon5515::AllocaUseVisitor 524 static bool mightWriteIntoAllocaPtr(AllocaInst &A, const DominatorTree &DT, argument 527 AllocaUseVisitor Visitor(DL, DT, CB); 594 DominatorTree DT(*CB->getFunction()); 705 if (DT.dominates(CB, I)) { 760 if (DT [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 397 DominatorTree DT(*F); 398 LoopInfo LI(DT); 502 DT.getDescendants(*SI, DominateVector); 937 DominatorTree DT(*Caller); 938 LoopInfo LI(DT); 1118 DominatorTree DT; 1119 DT.recalculate(*ClonedFunc); 1122 LoopInfo LI(DT); 1134 CodeExtractor CE(RegionInfo.Region, &DT, /*AggregateArgs*/ false, 1193 DominatorTree DT; local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCContract.cpp | 66 DominatorTree *DT; member in class:__anon5612::ObjCARCContract 558 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 646 if (!DT->isReachableFromEntry(U) || !DT->dominates(Inst, U)) 662 InsertBB = DT->getNode(InsertBB)->getIDom()->getBlock(); 665 assert(DT->dominates(Inst, &InsertBB->back()) &&
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | CSEMIRBuilder.cpp | 119 DstOp::DstType DT = Op.getDstOpKind(); 120 return DT == DstOp::DstType::Ty_LLT || DT == DstOp::DstType::Ty_RC;
|