Home
last modified time | relevance | path

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

123

/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp81 if (Strategy != UpdateStrategy::Lazy || !PDT) in applyPostDomTreeUpdates()
90 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.cpp99 PostDominatorTree &PDT, DenseSet<const Value *> &DV, in DivergencePropagator() argument
101 : F(F), TTI(TTI), DT(DT), PDT(PDT), DV(DV), DU(DU) {} in DivergencePropagator()
122 PostDominatorTree &PDT; member in __anon383f524f0111::DivergencePropagator
165 DomTreeNode *ThisNode = PDT.getNode(ThisBB); in exploreSyncDependency()
245 assert(PDT.properlyDominates(End, Start) && in computeInfluenceRegion()
317 llvm::PostDominatorTree &PDT, in run() argument
321 gpuDA = std::make_unique<DivergenceInfo>(F, DT, PDT, LI, TTI, in run()
326 DivergencePropagator DP(F, TTI, DT, PDT, DivergentValues, DivergentUses); in run()
407 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
409 LegacyDivergenceAnalysisImpl::run(F, TTI, DT, PDT, LI); in runOnFunction()
[all …]
H A DSyncDependenceAnalysis.cpp251 const PostDominatorTree &PDT, in SyncDependenceAnalysis() argument
253 : DT(DT), PDT(PDT), LI(LI) { in SyncDependenceAnalysis()
265 const PostDominatorTree &PDT; member
280 const PostDominatorTree &PDT, const LoopInfo &LI, in DivergencePropagator()
282 : LoopPOT(LoopPOT), DT(DT), PDT(PDT), LI(LI), DivTermBlock(DivTermBlock), in DivergencePropagator()
464 DivergencePropagator Propagator(LoopPO, DT, PDT, LI, TermBlock); in getJoinBlocks()
H A DRegionInfo.cpp99 PDT = PDT_; in recalculate()
128 auto PDT = &getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
131 RI.recalculate(F, DT, PDT, DF); in runOnFunction()
191 auto *PDT = &AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
194 RI.recalculate(F, DT, PDT, DF); in run()
H A DBranchProbabilityInfo.cpp733 const LoopBlock &LoopBB, DominatorTree *DT, PostDominatorTree *PDT, in propagateEstimatedBlockWeight() argument
738 const auto *PDTStartNode = PDT->getNode(BB); in propagateEstimatedBlockWeight()
745 if (!PDT->dominates(PDTStartNode, PDT->getNode(DomBB))) in propagateEstimatedBlockWeight()
810 const Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in computeEestimateBlockWeight() argument
821 propagateEstimatedBlockWeight(getLoopBlock(BB), DT, PDT, *BBWeight, in computeEestimateBlockWeight()
867 propagateEstimatedBlockWeight(LoopBB, DT, PDT, *MaxWeight, in computeEestimateBlockWeight()
1215 PostDominatorTree *PDT) { in calculate() argument
1234 if (!PDT) { in calculate()
1236 PDT = PDTPtr.get(); in calculate()
1239 computeEestimateBlockWeight(F, DT, PDT); in calculate()
[all …]
H A DDivergenceAnalysis.cpp347 const PostDominatorTree &PDT, const LoopInfo &LI, in DivergenceInfo() argument
360 SDA = std::make_unique<SyncDependenceAnalysis>(DT, PDT, LI); in DivergenceInfo()
384 auto &PDT = AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
388 return DivergenceInfo(F, DT, PDT, LI, TTI, /* KnownReducible = */ false); in run()
H A DPostDominators.cpp100 PostDominatorTree PDT(F); in run() local
101 return PDT; in run()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DCodeMoverUtils.cpp65 const PostDominatorTree &PDT,
111 const PostDominatorTree &PDT, in collectControlConditions() argument
137 if (PDT.dominates(CurBlock, IDom)) { in collectControlConditions()
141 } else if (PDT.dominates(CurBlock, BI->getSuccessor(0))) { in collectControlConditions()
147 } else if (PDT.dominates(CurBlock, BI->getSuccessor(1))) { in collectControlConditions()
233 const PostDominatorTree &PDT) { in isControlFlowEquivalent() argument
234 return isControlFlowEquivalent(*I0.getParent(), *I1.getParent(), DT, PDT); in isControlFlowEquivalent()
239 const PostDominatorTree &PDT) { in isControlFlowEquivalent() argument
243 if ((DT.dominates(&BB0, &BB1) && PDT.dominates(&BB1, &BB0)) || in isControlFlowEquivalent()
244 (PDT.dominates(&BB0, &BB1) && DT.dominates(&BB1, &BB0))) in isControlFlowEquivalent()
[all …]
H A DBreakCriticalEdges.cpp53 auto *PDT = PDTWP ? &PDTWP->getPostDomTree() : nullptr; in runOnFunction() local
58 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI, nullptr, PDT)); in runOnFunction()
225 auto *PDT = Options.PDT; in SplitKnownCriticalEdge() local
231 if (!DT && !PDT && !LI) in SplitKnownCriticalEdge()
234 if (DT || PDT) { in SplitKnownCriticalEdge()
252 if (PDT) in SplitKnownCriticalEdge()
253 PDT->applyUpdates(Updates); in SplitKnownCriticalEdge()
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DCodeMoverUtils.h30 const PostDominatorTree &PDT);
37 const PostDominatorTree &PDT);
42 const PostDominatorTree *PDT = nullptr,
50 const PostDominatorTree *PDT = nullptr,
57 const PostDominatorTree &PDT,
63 DominatorTree &DT, const PostDominatorTree &PDT,
73 const PostDominatorTree *PDT);
77 const DominatorTree *DT, const PostDominatorTree *PDT);
H A DBasicBlockUtils.h146 PostDominatorTree *PDT; member
161 PostDominatorTree *PDT = nullptr)
162 : DT(DT), PDT(PDT), LI(LI), MSSAU(MSSAU) {} in DT()
/openbsd-src/gnu/llvm/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()
223 PostDominatorTree *PDT = nullptr; variable
H A DBranchProbabilityInfo.h120 PostDominatorTree *PDT = nullptr) {
121 calculate(F, LI, TLI, DT, PDT);
199 PostDominatorTree *PDT);
392 PostDominatorTree *PDT, uint32_t BBWeight,
401 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,
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSILowerI1Copies.cpp50 MachinePostDominatorTree *PDT = nullptr; member in __anon1ceaab0c0111::SILowerI1Copies
126 MachinePostDominatorTree &PDT; member in __anon1ceaab0c0111::PhiIncomingAnalysis
137 PhiIncomingAnalysis(MachinePostDominatorTree &PDT, const SIInstrInfo *TII) in PhiIncomingAnalysis() argument
138 : PDT(PDT), TII(TII) {} in PhiIncomingAnalysis()
171 if (TII->hasDivergentBranch(MBB) && PDT.dominates(&DefBlock, MBB)) in analyze()
240 MachinePostDominatorTree &PDT; member in __anon1ceaab0c0111::LoopFinder
264 LoopFinder(MachineDominatorTree &DT, MachinePostDominatorTree &PDT) in LoopFinder() argument
265 : DT(DT), PDT(PDT) {} in LoopFinder()
283 MachineDomTreeNode *PDNode = PDT.getNode(DefBlock); in findLoop()
345 VisitedPostDom = PDT.getNode(VisitedPostDom)->getIDom()->getBlock(); in advanceLevel()
[all …]
H A DAMDGPUUnifyDivergentExitNodes.cpp189 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
190 if (PDT.root_size() == 0 || in runOnFunction()
191 (PDT.root_size() == 1 && in runOnFunction()
192 !isa<BranchInst>(PDT.getRoot()->getTerminator()))) in runOnFunction()
216 PDT.roots(), [&](auto BB) { return !isUniformlyReached(DA, *BB); }); in runOnFunction()
218 for (BasicBlock *BB : PDT.roots()) { in runOnFunction()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopFuse.cpp185 const PostDominatorTree *PDT; member
189 FusionCandidate(Loop *L, DominatorTree &DT, const PostDominatorTree *PDT, in FusionCandidate()
195 Peeled(false), DT(DT), PDT(PDT), ORE(ORE) { in FusionCandidate()
408 assert(DT && LHS.PDT && "Expecting valid dominator tree"); in operator ()()
414 assert(LHS.PDT->dominates(LHSEntryBlock, RHSEntryBlock)); in operator ()()
420 assert(LHS.PDT->dominates(RHSEntryBlock, LHSEntryBlock)); in operator ()()
429 nonStrictlyPostDominate(LHSEntryBlock, RHSEntryBlock, DT, LHS.PDT); in operator ()()
431 nonStrictlyPostDominate(RHSEntryBlock, LHSEntryBlock, DT, LHS.PDT); in operator ()()
436 DomTreeNode *LNode = LHS.PDT->getNode(LHSEntryBlock); in operator ()()
437 DomTreeNode *RNode = LHS.PDT->getNode(RHSEntryBlock); in operator ()()
[all …]
H A DADCE.cpp122 PostDominatorTree &PDT; member in __anon5c9c06f70111::AggressiveDeadCodeElimination
197 PostDominatorTree &PDT) in AggressiveDeadCodeElimination() argument
198 : F(F), DT(DT), PDT(PDT) {} in AggressiveDeadCodeElimination()
299 for (const auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) { in initialize()
489 ReverseIDFCalculator IDFs(PDT); in markLiveBranchesFromControlDependences()
642 DomTreeUpdater(DT, &PDT, DomTreeUpdater::UpdateStrategy::Eager) in updateDeadRegions()
701 auto &PDT = FAM.getResult<PostDominatorTreeAnalysis>(F); in run() local
702 if (!AggressiveDeadCodeElimination(F, DT, PDT).performDeadCodeElimination()) in run()
733 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
734 return AggressiveDeadCodeElimination(F, DT, PDT) in runOnFunction()
H A DGuardWidening.cpp118 PostDominatorTree *PDT; member in __anon76406cf20111::GuardWideningImpl
277 explicit GuardWideningImpl(DominatorTree &DT, PostDominatorTree *PDT, in GuardWideningImpl() argument
281 : DT(DT), PDT(PDT), LI(LI), AC(AC), MSSAU(MSSAU), Root(Root), in GuardWideningImpl()
459 if (!PDT) return true; in computeWideningScore()
460 return !PDT->dominates(DominatedBlock, DominatingBlock); in computeWideningScore()
769 auto &PDT = AM.getResult<PostDominatorTreeAnalysis>(F); in run() local
775 if (!GuardWideningImpl(DT, &PDT, LI, AC, MSSAU ? MSSAU.get() : nullptr, in run()
824 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree(); in runOnFunction() local
829 return GuardWideningImpl(DT, &PDT, LI, AC, MSSAU ? MSSAU.get() : nullptr, in runOnFunction()
861 auto *PDT = PDTWP ? &PDTWP->getPostDomTree() : nullptr; in runOnLoop() local
[all …]
/openbsd-src/gnu/usr.bin/perl/dist/base/
H A DChanges32 2.12 Fri Jul 6 00:57:15 PDT 2007
39 2.11 Mon Jul 2 03:30:03 PDT 2007
65 2.03 Sun Sep 14 20:01:48 PDT 2003
76 2.02 Wed Sep 3 20:40:13 PDT 2003
80 2.01 Thu Aug 28 13:39:32 PDT 2003
83 2.0 Wed Aug 27 21:47:51 PDT 2003
/openbsd-src/lib/libpcap/
H A DCHANGES10 v0.4 Sat Jul 25 12:40:09 PDT 1998
107 v0.2.1 Sun Jul 14 03:02:26 PDT 1996
152 v0.2 Sun Jun 23 02:28:42 PDT 1996
169 v0.1 Fri Apr 28 18:11:03 PDT 1995
206 v0.0.6 Fri Apr 28 04:07:13 PDT 1995
210 v0.0.5 Fri Apr 28 00:22:21 PDT 1995
215 v0.0.4 Thu Apr 20 20:41:48 PDT 1995
234 v0.0.3 Tue Oct 18 18:13:46 PDT 1994
239 v0.0.2 Wed Oct 12 20:56:37 PDT 1994
247 v0.0.1 Fri Jun 24 14:50:57 PDT 1994
[all …]

123