Home
last modified time | relevance | path

Searched refs:PDT (Results 1 – 25 of 88) sorted by relevance

1234

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp80 if (Strategy != UpdateStrategy::Lazy || !PDT) in applyPostDomTreeUpdates()
89 PDT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E)); in applyPostDomTreeUpdates()
125 if (PDT) in recalculate()
126 PDT->recalculate(F); in recalculate()
141 if (PDT) in recalculate()
142 PDT->recalculate(F); in recalculate()
161 if (!PDT) in hasPendingPostDomTreeUpdates()
209 if (PDT && !IsRecalculatingPostDomTree) in eraseDelBBNode()
210 if (PDT->getNode(DelBB)) in eraseDelBBNode()
211 PDT->eraseNode(DelBB); in eraseDelBBNode()
[all …]
H A DLegacyDivergenceAnalysis.cpp98 PostDominatorTree &PDT, DenseSet<const Value *> &DV, in DivergencePropagator() argument
100 : F(F), TTI(TTI), DT(DT), PDT(PDT), DV(DV), DU(DU) {} in DivergencePropagator()
121 PostDominatorTree &PDT; member in __anonaa55da030111::DivergencePropagator
164 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
244 assert(PDT.properlyDominates(End, Start) && in computeInfluenceRegion()
337 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
342 gpuDA = std::make_unique<DivergenceInfo>(F, DT, PDT, LI, TTI, in runOnFunction()
347 DivergencePropagator DP(F, TTI, DT, PDT, DivergentValues, DivergentUses); in runOnFunction()
H A DSyncDependenceAnalysis.cpp234 const PostDominatorTree &PDT, in SyncDependenceAnalysis() argument
236 : DT(DT), PDT(PDT), LI(LI) { in SyncDependenceAnalysis()
247 const PostDominatorTree &PDT; member
262 const PostDominatorTree &PDT, const LoopInfo &LI, in DivergencePropagator()
264 : LoopPOT(LoopPOT), DT(DT), PDT(PDT), LI(LI), DivTermBlock(DivTermBlock), in DivergencePropagator()
445 DivergencePropagator Propagator(LoopPO, DT, PDT, LI, TermBlock); in getJoinBlocks()
H A DRegionInfo.cpp98 PDT = PDT_; in recalculate()
127 auto PDT = &getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
130 RI.recalculate(F, DT, PDT, DF); in runOnFunction()
190 auto *PDT = &AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
193 RI.recalculate(F, DT, PDT, DF); in run()
H A DBranchProbabilityInfo.cpp682 const LoopBlock &LoopBB, DominatorTree *DT, PostDominatorTree *PDT, in propagateEstimatedBlockWeight() argument
687 const auto *PDTStartNode = PDT->getNode(BB); in propagateEstimatedBlockWeight()
694 if (!PDT->dominates(PDTStartNode, PDT->getNode(DomBB))) in propagateEstimatedBlockWeight()
759 const Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in computeEestimateBlockWeight() argument
770 propagateEstimatedBlockWeight(getLoopBlock(BB), DT, PDT, in computeEestimateBlockWeight()
818 propagateEstimatedBlockWeight(LoopBB, DT, PDT, MaxWeight.getValue(), in computeEestimateBlockWeight()
1252 PostDominatorTree *PDT) { in calculate() argument
1271 if (!PDT) { in calculate()
1273 PDT = PDTPtr.get(); in calculate()
1276 computeEestimateBlockWeight(F, DT, PDT); in calculate()
[all …]
H A DDivergenceAnalysis.cpp348 const PostDominatorTree &PDT, const LoopInfo &LI, in DivergenceInfo() argument
361 SDA = std::make_unique<SyncDependenceAnalysis>(DT, PDT, LI); in DivergenceInfo()
385 auto &PDT = AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
389 return DivergenceInfo(F, DT, PDT, LI, TTI, /* KnownReducible = */ false); in run()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachinePostDominators.h29 std::unique_ptr<PostDomTreeT> PDT; variable
37 if (!PDT) in getBase()
38 PDT.reset(new PostDomTreeT()); in getBase()
39 return *PDT; in getBase()
44 MachineDomTreeNode *getRootNode() const { return PDT->getRootNode(); } in getRootNode()
47 return PDT->getNode(BB);
51 return PDT->getNode(BB); in getNode()
56 return PDT->dominates(A, B); in dominates()
60 return PDT->dominates(A, B); in dominates()
65 return PDT->properlyDominates(A, B); in properlyDominates()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DMachinePostDominators.cpp32 : MachineFunctionPass(ID), PDT(nullptr) { in MachinePostDominatorTree()
41 PDT = std::make_unique<PostDomTreeT>(); in runOnMachineFunction()
42 PDT->recalculate(F); in runOnMachineFunction()
57 NCD = PDT->findNearestCommonDominator(NCD, BB); in findNearestCommonDominator()
60 if (PDT->isVirtualRoot(PDT->getNode(NCD))) in findNearestCommonDominator()
68 if (PDT && VerifyMachineDomInfo) in verifyAnalysis()
69 if (!PDT->verify(PostDomTreeT::VerificationLevel::Basic)) { in verifyAnalysis()
78 PDT->print(OS); in print()
H A DMachineRegionInfo.cpp64 PDT = PDT_; in recalculate()
88 auto PDT = &getAnalysis<MachinePostDominatorTree>(); in runOnMachineFunction() local
91 RI.recalculate(F, DT, PDT, DF); in runOnMachineFunction()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DCodeMoverUtils.cpp66 const PostDominatorTree &PDT,
110 const PostDominatorTree &PDT, unsigned MaxLookup) { in collectControlConditions() argument
135 if (PDT.dominates(CurBlock, IDom)) { in collectControlConditions()
139 } else if (PDT.dominates(CurBlock, BI->getSuccessor(0))) { in collectControlConditions()
145 } else if (PDT.dominates(CurBlock, BI->getSuccessor(1))) { in collectControlConditions()
231 const PostDominatorTree &PDT) { in isControlFlowEquivalent() argument
232 return isControlFlowEquivalent(*I0.getParent(), *I1.getParent(), DT, PDT); in isControlFlowEquivalent()
237 const PostDominatorTree &PDT) { in isControlFlowEquivalent() argument
241 if ((DT.dominates(&BB0, &BB1) && PDT.dominates(&BB1, &BB0)) || in isControlFlowEquivalent()
242 (PDT.dominates(&BB0, &BB1) && DT.dominates(&BB1, &BB0))) in isControlFlowEquivalent()
[all …]
H A DBreakCriticalEdges.cpp55 auto *PDT = PDTWP ? &PDTWP->getPostDomTree() : nullptr; in runOnFunction() local
60 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI, nullptr, PDT)); in runOnFunction()
231 auto *PDT = Options.PDT; in SplitKnownCriticalEdge() local
237 if (!DT && !PDT && !LI) in SplitKnownCriticalEdge()
240 if (DT || PDT) { in SplitKnownCriticalEdge()
258 if (PDT) in SplitKnownCriticalEdge()
259 PDT->applyUpdates(Updates); in SplitKnownCriticalEdge()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DCodeMoverUtils.h30 const PostDominatorTree &PDT);
37 const PostDominatorTree &PDT);
42 const PostDominatorTree *PDT = nullptr,
49 const PostDominatorTree *PDT = nullptr,
56 const PostDominatorTree &PDT,
62 DominatorTree &DT, const PostDominatorTree &PDT,
H A DBasicBlockUtils.h138 PostDominatorTree *PDT; member
153 PostDominatorTree *PDT = nullptr)
154 : DT(DT), PDT(PDT), LI(LI), MSSAU(MSSAU) {} in DT()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
H A DSILowerI1Copies.cpp50 MachinePostDominatorTree *PDT = nullptr; member in __anond5a978c00111::SILowerI1Copies
126 MachinePostDominatorTree &PDT; member in __anond5a978c00111::PhiIncomingAnalysis
136 PhiIncomingAnalysis(MachinePostDominatorTree &PDT) : PDT(PDT) {} in PhiIncomingAnalysis() argument
180 if (Divergent && PDT.dominates(&DefBlock, MBB)) in analyze()
249 MachinePostDominatorTree &PDT; member in __anond5a978c00111::LoopFinder
273 LoopFinder(MachineDominatorTree &DT, MachinePostDominatorTree &PDT) in LoopFinder() argument
274 : DT(DT), PDT(PDT) {} in LoopFinder()
292 MachineDomTreeNode *PDNode = PDT.getNode(DefBlock); in findLoop()
354 VisitedPostDom = PDT.getNode(VisitedPostDom)->getIDom()->getBlock(); in advanceLevel()
358 if (PDT.dominates(VisitedPostDom, NextLevel[i])) { in advanceLevel()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DDomTreeUpdater.h38 : PDT(&PDT_), Strategy(Strategy_) {} in DomTreeUpdater()
40 : PDT(PDT_), Strategy(Strategy_) {} in DomTreeUpdater()
43 : DT(&DT_), PDT(&PDT_), Strategy(Strategy_) {} in DomTreeUpdater()
46 : DT(DT_), PDT(PDT_), Strategy(Strategy_) {} in DomTreeUpdater()
60 bool hasPostDomTree() const { return PDT != nullptr; } in hasPostDomTree()
266 PostDominatorTree *PDT = nullptr; variable
H A DBranchProbabilityInfo.h122 PostDominatorTree *PDT = nullptr) {
123 calculate(F, LI, TLI, DT, PDT);
207 PostDominatorTree *PDT);
399 PostDominatorTree *PDT, uint32_t BBWeight,
408 PostDominatorTree *PDT);
H A DSyncDependenceAnalysis.h63 SyncDependenceAnalysis(const DominatorTree &DT, const PostDominatorTree &PDT,
83 const PostDominatorTree &PDT; variable
H A DRegionInfo.h697 : DT(std::move(Arg.DT)), PDT(std::move(Arg.PDT)), DF(std::move(Arg.DF)),
705 PDT = std::move(RHS.PDT);
716 PostDomTreeT *PDT;
746 PDT = nullptr;
925 void recalculate(Function &F, DominatorTree *DT, PostDominatorTree *PDT,
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopFuse.cpp182 const PostDominatorTree *PDT; member
187 const PostDominatorTree *PDT, OptimizationRemarkEmitter &ORE, in FusionCandidate()
193 Peeled(false), DT(DT), PDT(PDT), ORE(ORE) { in FusionCandidate()
400 assert(DT && LHS.PDT && "Expecting valid dominator tree"); in operator ()()
406 assert(LHS.PDT->dominates(LHSEntryBlock, RHSEntryBlock)); in operator ()()
412 assert(LHS.PDT->dominates(RHSEntryBlock, LHSEntryBlock)); in operator ()()
549 PostDominatorTree &PDT; member
557 ScalarEvolution &SE, PostDominatorTree &PDT, in LoopFuser()
560 : LDT(LI), DTU(DT, PDT, DomTreeUpdater::UpdateStrategy::Lazy), LI(LI), in LoopFuser()
561 DT(DT), DI(DI), SE(SE), PDT(PDT), ORE(ORE), AC(AC), TTI(TTI) {} in LoopFuser()
[all …]
H A DADCE.cpp122 PostDominatorTree &PDT; member in __anon535d972b0111::AggressiveDeadCodeElimination
197 PostDominatorTree &PDT) in AggressiveDeadCodeElimination() argument
198 : F(F), DT(DT), PDT(PDT) {} in AggressiveDeadCodeElimination()
299 for (auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) { in initialize()
489 ReverseIDFCalculator IDFs(PDT); in markLiveBranchesFromControlDependences()
630 DomTreeUpdater(DT, &PDT, DomTreeUpdater::UpdateStrategy::Eager) in updateDeadRegions()
693 auto &PDT = FAM.getResult<PostDominatorTreeAnalysis>(F); in run() local
694 if (!AggressiveDeadCodeElimination(F, DT, PDT).performDeadCodeElimination()) in run()
725 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
726 return AggressiveDeadCodeElimination(F, DT, PDT) in runOnFunction()
H A DGuardWidening.cpp115 PostDominatorTree *PDT; member in __anon59e977a60111::GuardWideningImpl
273 explicit GuardWideningImpl(DominatorTree &DT, PostDominatorTree *PDT, in GuardWideningImpl() argument
276 : DT(DT), PDT(PDT), LI(LI), Root(Root), BlockFilter(BlockFilter) in GuardWideningImpl()
454 if (!PDT) return true; in computeWideningScore()
455 return !PDT->dominates(DominatedBlock, DominatingBlock); in computeWideningScore()
768 auto &PDT = AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
769 if (!GuardWideningImpl(DT, &PDT, LI, DT.getRootNode(), in run()
807 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
808 return GuardWideningImpl(DT, &PDT, LI, DT.getRootNode(), in runOnFunction()
835 auto *PDT = PDTWP ? &PDTWP->getPostDomTree() : nullptr; in runOnLoop() local
[all …]
H A DDeadStoreElimination.cpp853 PostDominatorTree &PDT; member
879 PostDominatorTree &PDT, const TargetLibraryInfo &TLI) in DSEState()
880 : F(F), AA(AA), BatchAA(AA), MSSA(MSSA), DT(DT), PDT(PDT), TLI(TLI), in DSEState()
884 DominatorTree &DT, PostDominatorTree &PDT, in get()
886 DSEState State(F, AA, MSSA, DT, PDT, TLI); in get()
1585 CommonPred = PDT.findNearestCommonDominator(CommonPred, *I); in getDomMemoryDef()
1591 if (PDT.dominates(CommonPred, EarlierAccess->getBlock())) in getDomMemoryDef()
1599 if (PDT.dominates(CommonPred, EarlierAccess->getBlock())) { in getDomMemoryDef()
1607 for (BasicBlock *R : PDT.roots()) in getDomMemoryDef()
1840 DominatorTree &DT, PostDominatorTree &PDT, in eliminateDeadStores() argument
[all …]
H A DGVNHoist.cpp261 GVNHoist(DominatorTree *DT, PostDominatorTree *PDT, AliasAnalysis *AA, in GVNHoist() argument
263 : DT(DT), PDT(PDT), AA(AA), MD(MD), MSSA(MSSA), in GVNHoist()
279 PostDominatorTree *PDT; member in llvm::GVNHoist
376 auto Root = PDT->getNode(nullptr); in insertCHI()
427 ReverseIDFCalculator IDFs(*PDT); in computeInsertionPoints()
532 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
537 GVNHoist G(&DT, &PDT, &AA, &MD, &MSSA); in runOnFunction()
1235 PostDominatorTree &PDT = AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
1239 GVNHoist G(&DT, &PDT, &AA, &MD, &MSSA); in run()
/netbsd-src/usr.sbin/traceroute/
H A DCHANGES86 v1.3.2 Thu Sep 26 18:06:16 PDT 1996
98 v1.3.1 Wed Sep 18 21:08:16 PDT 1996
108 v1.3 Mon Sep 16 14:55:44 PDT 1996
129 v1.2 Tue Oct 17 23:50:05 PDT 1995
136 v1.1 Thu Jun 15 02:32:55 PDT 1995
147 v1.0 Tue Feb 28 23:50:05 PDT 1989
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
H A DAArch64StackTagging.cpp523 static bool postDominates(const PostDominatorTree *PDT, const IntrinsicInst *A, in postDominates() argument
529 return PDT->dominates(ABB, BBB); in postDominates()
626 PostDominatorTree *PDT = nullptr; in runOnFunction() local
628 PDT = &P->getPostDomTree(); in runOnFunction()
630 if (PDT == nullptr && !F->hasFnAttribute(Attribute::OptimizeNone)) { in runOnFunction()
632 PDT = DeletePDT.get(); in runOnFunction()
668 if (PDT != nullptr && postDominates(PDT, End, Start)) { in runOnFunction()

1234