Searched refs:DT (Results 101 - 125 of 302) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DIVDescriptors.cpp114 DominatorTree *DT) {
129 if (MaxBitWidth == DL.getTypeSizeInBits(Exit->getType()) && AC && DT) {
133 auto NumSignBits = ComputeNumSignBits(Exit, DL, 0, AC, nullptr, DT);
194 DominatorTree *DT) {
426 computeRecurrenceType(ExitInstruction, DB, AC, DT);
613 DominatorTree *DT) {
621 AC, DT)) {
626 AC, DT)) {
631 AC, DT)) {
636 AC, DT)) {
111 computeRecurrenceType(Instruction *Exit, DemandedBits *DB, AssumptionCache *AC, DominatorTree *DT) argument
189 AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop, bool HasFunNoNaNAttr, RecurrenceDescriptor &RedDes, DemandedBits *DB, AssumptionCache *AC, DominatorTree *DT) argument
610 isReductionPHI(PHINode *Phi, Loop *TheLoop, RecurrenceDescriptor &RedDes, DemandedBits *DB, AssumptionCache *AC, DominatorTree *DT) argument
670 isFirstOrderRecurrence( PHINode *Phi, Loop *TheLoop, DenseMap<Instruction *, Instruction *> &SinkAfter, DominatorTree *DT) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp51 static bool simplifyLoopInst(Loop &L, DominatorTree &DT, LoopInfo &LI, argument
55 SimplifyQuery SQ(DL, &TLI, &DT, &AC);
190 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
205 return simplifyLoopInst(*L, DT, LI, AC, TLI,
233 if (!simplifyLoopInst(L, AR.DT, AR.LI, AR.AC, AR.TLI,
H A DStructurizeCFG.cpp97 DominatorTree *DT; member in class:__anon2763::NearestCommonDominator
109 BasicBlock *NewResult = DT->findNearestCommonDominator(Result, BB);
118 explicit NearestCommonDominator(DominatorTree *DomTree) : DT(DomTree) {}
194 DominatorTree *DT; member in class:__anon2763::StructurizeCFG
556 NearestCommonDominator Dominator(DT);
623 NearestCommonDominator Dominator(DT);
647 Q.DT = DT;
703 Dominator = DT->findNearestCommonDominator(Dominator, BB);
709 DT
[all...]
H A DIndVarSimplify.cpp139 DominatorTree *DT; member in class:__anon123::IndVarSimplify
170 IndVarSimplify(LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, argument
173 : LI(LI), SE(SE), DT(DT), DL(DL), TLI(TLI), TTI(TTI) {}
239 DominatorTree *DT, LoopInfo *LI) {
251 if (!DT->isReachableFromEntry(InsertBB))
258 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
271 assert(DT->dominates(DefI, InsertPt) && "def does not dominate all uses");
276 for (auto *DTN = (*DT)[InsertPt->getParent()]; DTN; DTN = DTN->getIDom())
587 assert(L->isRecursivelyLCSSAForm(*DT, *L
238 getInsertPointForUses(Instruction *User, Value *Def, DominatorTree *DT, LoopInfo *LI) argument
1001 DominatorTree *DT; member in class:__anon126::WidenIV
1371 truncateIVUse(NarrowIVDefUse DU, DominatorTree *DT, LoopInfo *LI) argument
2152 mustExecuteUBIfPoisonOnPathTo(Instruction *Root, Instruction *OnPathTo, DominatorTree *DT) argument
2274 FindLoopCounter(Loop *L, BasicBlock *ExitingBB, const SCEV *BECount, ScalarEvolution *SE, DominatorTree *DT) argument
2683 getMaxBackedgeTakenCount(ScalarEvolution &SE, DominatorTree &DT, Loop *L) argument
3214 auto *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable
[all...]
H A DFloat2Int.cpp65 const DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable
66 return Impl.runImpl(F, DT);
123 void Float2IntPass::findRoots(Function &F, const DominatorTree &DT, argument
128 if (!DT.isReachableFromEntry(&BB))
518 bool Float2IntPass::runImpl(Function &F, const DominatorTree &DT) { argument
528 findRoots(F, DT, Roots);
543 const DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); local
544 if (!runImpl(F, DT))
H A DSeparateConstOffsetFromGEP.cpp238 User *&UserChainTail, const DominatorTree *DT);
244 const DominatorTree *DT);
247 ConstantOffsetExtractor(Instruction *InsertionPt, const DominatorTree *DT) argument
248 : IP(InsertionPt), DL(InsertionPt->getModule()->getDataLayout()), DT(DT) {
339 const DominatorTree *DT; member in class:__anon2756::ConstantOffsetExtractor
449 DominatorTree *DT = nullptr; member in class:__anon2756::SeparateConstOffsetFromGEP
503 !haveNoCommonBitsSet(LHS, RHS, DL, nullptr, BO, DT))
738 const DominatorTree *DT) {
739 ConstantOffsetExtractor Extractor(GEP, DT);
736 Extract(Value *Idx, GetElementPtrInst *GEP, User *&UserChainTail, const DominatorTree *DT) argument
754 Find(Value *Idx, GetElementPtrInst *GEP, const DominatorTree *DT) argument
[all...]
H A DRewriteStatepointsForGC.cpp142 auto &DT = FAM.getResult<DominatorTreeAnalysis>(F); local
145 Changed |= runOnFunction(F, DT, TTI, TLI);
190 auto &DT = getAnalysis<DominatorTreeWrapperPass>(F).getDomTree(); variable
192 Changed |= Impl.runOnFunction(F, DT, TTI, TLI);
302 static void computeLiveInValues(DominatorTree &DT, Function &F,
373 DominatorTree &DT, GCPtrLivenessData &OriginalLivenessData, CallBase *Call,
1162 DominatorTree *DT, DefiningValueMapTy &DVCache) {
1168 DT->dominates(cast<Instruction>(base)->getParent(),
1176 static void findBasePointers(DominatorTree &DT, DefiningValueMapTy &DVCache, argument
1180 findBasePointers(result.LiveSet, PointerToBase, &DT, DVCach
372 analyzeParsePointLiveness( DominatorTree &DT, GCPtrLivenessData &OriginalLivenessData, CallBase *Call, PartiallyConstructedSafepointRecord &Result) argument
1160 findBasePointers(const StatepointLiveSetTy &live, MapVector<Value *, Value *> &PointerToBase, DominatorTree *DT, DefiningValueMapTy &DVCache) argument
1202 recomputeLiveInValues( Function &F, DominatorTree &DT, ArrayRef<CallBase *> toUpdate, MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) argument
1222 normalizeForInvokeSafepoint(BasicBlock *BB, BasicBlock *InvokeParent, DominatorTree &DT) argument
1602 makeStatepointExplicit(DominatorTree &DT, CallBase *Call, PartiallyConstructedSafepointRecord &Result, std::vector<DeferredReplacement> &Replacements) argument
1687 relocationViaAlloca( Function &F, DominatorTree &DT, ArrayRef<Value *> Live, ArrayRef<PartiallyConstructedSafepointRecord> Records) argument
1916 findLiveReferences( Function &F, DominatorTree &DT, ArrayRef<CallBase *> toUpdate, MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) argument
2172 insertParsePoints(Function &F, DominatorTree &DT, TargetTransformInfo &TTI, SmallVectorImpl<CallBase *> &ToUpdate) argument
2517 runOnFunction(Function &F, DominatorTree &DT, TargetTransformInfo &TTI, const TargetLibraryInfo &TLI) argument
2699 checkBasicSSA(DominatorTree &DT, SetVector<Value *> &Live, Instruction *TI, bool TermOkay = false) argument
2717 checkBasicSSA(DominatorTree &DT, GCPtrLivenessData &Data, BasicBlock &BB) argument
2725 computeLiveInValues(DominatorTree &DT, Function &F, GCPtrLivenessData &Data) argument
[all...]
H A DLoopUnswitch.cpp185 DominatorTree *DT = nullptr; member in class:__anon2722::LoopUnswitch
527 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
531 assert(DT && "Cannot update MemorySSA without a valid DomTree.");
545 assert(currentLoop->isLCSSAForm(*DT));
561 auto *Node = DT->getNode(BB)->getIDom();
566 Node = DT->getNode(DomBB)->getIDom();
581 if (DT->dominates(UnreachableSucc, BB))
726 !SafetyInfo.isGuaranteedToExecute(*TI, DT, currentLoop))
968 // Inform the DT about the new branch.
969 if (DT) {
[all...]
H A DLoopPassManager.cpp61 assert(L.isRecursivelyLCSSAForm(AR.DT, AR.LI) &&
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp229 DominatorTree &DT; member in struct:__anon3231::PromoteMem2Reg
268 PromoteMem2Reg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT, argument
270 : Allocas(Allocas.begin(), Allocas.end()), DT(DT),
271 DIB(*DT.getRoot()->getParent()->getParent(), /*AllowUnresolved*/ false),
272 AC(AC), SQ(DT.getRoot()->getParent()->getParent()->getDataLayout(),
273 nullptr, &DT, AC) {}
349 DominatorTree &DT, AssumptionCache *AC) {
381 } else if (!DT.dominates(StoreBB, LI->getParent())) {
401 !isKnownNonZero(ReplVal, DL, 0, AC, LI, &DT))
347 rewriteSingleStoreAlloca(AllocaInst *AI, AllocaInfo &Info, LargeBlockInfo &LBI, const DataLayout &DL, DominatorTree &DT, AssumptionCache *AC) argument
444 promoteSingleBlockAlloca(AllocaInst *AI, const AllocaInfo &Info, LargeBlockInfo &LBI, const DataLayout &DL, DominatorTree &DT, AssumptionCache *AC) argument
1000 PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT, AssumptionCache *AC) argument
[all...]
H A DLoopUnrollAndJam.cpp54 DominatorTree *DT) {
60 if (DT->dominates(SubLoopLatch, BB))
174 bool UnrollRemainder, LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
201 LI, SE, DT, AC, true, EpilogueLoop)) {
265 DT);
363 DT->addNewBlock(New, ForeBlocksLast[It - 1]);
365 DT->addNewBlock(New, SubLoopBlocksLast[It - 1]);
367 DT->addNewBlock(New, AftBlocksLast[It - 1]);
371 auto BBDomNode = DT->getNode(*BB);
376 DT
50 partitionOuterLoopBlocks(Loop *L, Loop *SubLoop, BasicBlockSet &ForeBlocks, BasicBlockSet &SubLoopBlocks, BasicBlockSet &AftBlocks, DominatorTree *DT) argument
172 UnrollAndJamLoop( Loop *L, unsigned Count, unsigned TripCount, unsigned TripMultiple, bool UnrollRemainder, LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC, OptimizationRemarkEmitter *ORE, Loop **EpilogueLoop) argument
688 isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT, DependenceInfo &DI) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCodeExtractor.h89 DominatorTree *const DT; member in class:llvm::CodeExtractor
119 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
130 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false,
H A DLocal.h264 const DominatorTree *DT = nullptr);
270 const DominatorTree *DT = nullptr) {
271 return getOrEnforceKnownAlignment(V, 0, DL, CxtI, AC, DT);
388 DominatorTree &DT);
454 unsigned replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT,
458 unsigned replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DHotColdSplitting.cpp302 DominatorTree &DT, BlockFrequencyInfo *BFI, TargetTransformInfo &TTI,
307 CodeExtractor CE(Region, &DT, /* AggregateArgs */ false, /* BFI */ nullptr,
401 const DominatorTree &DT,
472 bool SinkDom = DT.dominates(&SinkBB, &SuccBB);
507 BlockSequence takeSingleEntrySubRegion(DominatorTree &DT) { argument
521 BB == SuggestedEntryPoint || DT.dominates(SuggestedEntryPoint, BB);
555 std::unique_ptr<DominatorTree> DT; local
585 if (!DT)
586 DT = std::make_unique<DominatorTree>(F);
590 auto Regions = OutliningRegion::create(*BB, *DT, *PD
300 extractColdRegion( const BlockSequence &Region, const CodeExtractorAnalysisCache &CEAC, DominatorTree &DT, BlockFrequencyInfo *BFI, TargetTransformInfo &TTI, OptimizationRemarkEmitter &ORE, AssumptionCache *AC, unsigned Count) argument
400 create(BasicBlock &SinkBB, const DominatorTree &DT, const PostDominatorTree &PDT) argument
[all...]
H A DLoopExtractor.cpp98 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
149 CodeExtractor Extractor(DT, *L, false, nullptr, nullptr, AC);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h93 const DominatorTree *DT = nullptr; member in struct:llvm::SimplifyQuery
106 const DominatorTree *DT = nullptr,
109 : DL(DL), TLI(TLI), DT(DT), AC(AC), CxtI(CXTI), IIQ(UseInstrInfo) {}
282 const DominatorTree *DT = nullptr, AssumptionCache *AC = nullptr,
293 const DominatorTree *DT = nullptr,
H A DRegionInfoImpl.h47 : RegionNodeBase<Tr>(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
107 if (!DT->getNode(BB))
116 return (DT->dominates(entry, BB) &&
117 !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
169 if (DT->getNode(Pred) && !contains(Pred)) {
473 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT);
486 return new RegionT(getEntry(), R->getExit(), RI, DT);
570 if (DT->dominates(entry, P) && !DT
[all...]
H A DDominanceFrontierImpl.h160 ForwardDominanceFrontierBase<BlockT>::calculate(const DomTreeT &DT, argument
186 if (DT[Succ]->getIDom() != currentNode)
218 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64CleanupLocalDynamicTLSPass.cpp53 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>(); variable
54 return VisitNode(DT->getRootNode(), 0);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZLDCleanup.cpp78 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>(); local
79 return VisitNode(DT->getRootNode(), 0);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DDebugInfo.h87 void processType(DIType *DT);
92 bool addType(DIType *DT);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineInternal.h324 DominatorTree &DT; member in class:llvm::InstCombiner
340 AssumptionCache &AC, TargetLibraryInfo &TLI, DominatorTree &DT,
344 ExpensiveCombines(ExpensiveCombines), AA(AA), AC(AC), TLI(TLI), DT(DT),
345 DL(DL), SQ(DL, &TLI, &DT, &AC), ORE(ORE), BFI(BFI), PSI(PSI), LI(LI) {}
356 DominatorTree &getDominatorTree() const { return DT; }
730 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT);
735 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT);
741 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
746 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, &AC, CxtI, &DT);
338 InstCombiner(InstCombineWorklist &Worklist, BuilderTy &Builder, bool MinimizeSize, bool ExpensiveCombines, AliasAnalysis *AA, AssumptionCache &AC, TargetLibraryInfo &TLI, DominatorTree &DT, OptimizationRemarkEmitter &ORE, BlockFrequencyInfo *BFI, ProfileSummaryInfo *PSI, const DataLayout &DL, LoopInfo *LI) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp327 : F(Fin), BFI(BFIin), DT(DTin), PSI(PSIin), RI(RIin), ORE(OREin) {}
406 DominatorTree &DT; member in class:__anon2622::CHR
506 static bool isHoistable(Instruction *I, DominatorTree &DT) { argument
509 return isSafeToSpeculativelyExecute(I, nullptr, &DT);
518 Value *V, DominatorTree &DT,
527 if (!isHoistable(I, DT)) {
534 std::set<Value *> OpResult = getBaseValues(Op, DT, Visited);
557 checkHoistValue(Value *V, Instruction *InsertPoint, DominatorTree &DT, argument
566 assert(DT.getNode(I->getParent()) && "DT mus
517 getBaseValues( Value *V, DominatorTree &DT, DenseMap<Value *, std::set<Value *>> &Visited) argument
1065 shouldSplit(Instruction *InsertPoint, DenseSet<Value *> &PrevConditionValues, DenseSet<Value *> &ConditionValues, DominatorTree &DT, DenseSet<Instruction *> &Unhoistables) argument
1455 hoistValue(Value *V, Instruction *HoistPoint, Region *R, HoistStopMapTy &HoistStopMap, DenseSet<Instruction *> &HoistedSet, DenseSet<PHINode *> &TrivialPHIs, DominatorTree &DT) argument
1503 hoistScopeConditions(CHRScope *Scope, Instruction *HoistPoint, DenseSet<PHINode *> &TrivialPHIs, DominatorTree &DT) argument
2083 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local
2102 auto &DT = FAM.getResult<DominatorTreeAnalysis>(F); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DStackProtector.h53 DominatorTree *DT; member in class:llvm::StackProtector
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DHotColdSplitting.h49 DominatorTree &DT, BlockFrequencyInfo *BFI,

Completed in 342 milliseconds

1234567891011>>