| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 std::unique_ptr<PostDomTreeT> PDT;
37 if (!PDT)
38 PDT.reset(new PostDomTreeT());
39 return *PDT;
44 MachineDomTreeNode *getRootNode() const { return PDT->getRootNode(); }
47 return PDT->getNode(BB);
51 return PDT->getNode(BB);
56 return PDT->dominates(A, B);
60 return PDT->dominates(A, B);
65 return PDT->properlyDominates(A, B)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| CodeMoverUtils.h | 30 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,
|
| SCCPSolver.h | 34 PostDominatorTree *PDT;
|
| BasicBlockUtils.h | 138 PostDominatorTree *PDT;
153 PostDominatorTree *PDT = nullptr)
154 : DT(DT), PDT(PDT), LI(LI), MSSAU(MSSAU) {}
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachinePostDominators.cpp | 32 : MachineFunctionPass(ID), PDT(nullptr) {
41 PDT = std::make_unique<PostDomTreeT>();
42 PDT->recalculate(F);
57 NCD = PDT->findNearestCommonDominator(NCD, BB);
60 if (PDT->isVirtualRoot(PDT->getNode(NCD)))
68 if (PDT && VerifyMachineDomInfo)
69 if (!PDT->verify(PostDomTreeT::VerificationLevel::Basic)) {
78 PDT->print(OS);
|
| MachineRegionInfo.cpp | 64 PDT = PDT_;
88 auto PDT = &getAnalysis<MachinePostDominatorTree>();
91 RI.recalculate(F, DT, PDT, DF);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 80 if (Strategy != UpdateStrategy::Lazy || !PDT)
89 PDT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));
125 if (PDT)
126 PDT->recalculate(F);
141 if (PDT)
142 PDT->recalculate(F);
161 if (!PDT)
172 // The DT and PDT require the nodes related to updates
209 if (PDT && !IsRecalculatingPostDomTree)
210 if (PDT->getNode(DelBB)
[all...] |
| RegionInfo.cpp | 98 PDT = PDT_;
127 auto PDT = &getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree();
130 RI.recalculate(F, DT, PDT, DF);
190 auto *PDT = &AM.getResult<PostDominatorTreeAnalysis>(F);
193 RI.recalculate(F, DT, PDT, DF);
|
| LegacyDivergenceAnalysis.cpp | 98 PostDominatorTree &PDT, DenseSet<const Value *> &DV,
100 : F(F), TTI(TTI), DT(DT), PDT(PDT), DV(DV), DU(DU) {}
121 PostDominatorTree &PDT;
164 DomTreeNode *ThisNode = PDT.getNode(ThisBB);
244 assert(PDT.properlyDominates(End, Start) &&
337 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree();
342 gpuDA = std::make_unique<DivergenceInfo>(F, DT, PDT, LI, TTI,
347 DivergencePropagator DP(F, TTI, DT, PDT, DivergentValues, DivergentUses);
|
| PostDominators.cpp | 100 PostDominatorTree PDT(F);
101 return PDT;
|
| SyncDependenceAnalysis.cpp | 234 const PostDominatorTree &PDT,
236 : DT(DT), PDT(PDT), LI(LI) {
247 const PostDominatorTree &PDT;
262 const PostDominatorTree &PDT, const LoopInfo &LI,
264 : LoopPOT(LoopPOT), DT(DT), PDT(PDT), LI(LI), DivTermBlock(DivTermBlock),
445 DivergencePropagator Propagator(LoopPO, DT, PDT, LI, TermBlock);
|
| DivergenceAnalysis.cpp | 348 const PostDominatorTree &PDT, const LoopInfo &LI,
361 SDA = std::make_unique<SyncDependenceAnalysis>(DT, PDT, LI);
385 auto &PDT = AM.getResult<PostDominatorTreeAnalysis>(F);
389 return DivergenceInfo(F, DT, PDT, LI, TTI, /* KnownReducible = */ false);
|
| BranchProbabilityInfo.cpp | 682 const LoopBlock &LoopBB, DominatorTree *DT, PostDominatorTree *PDT,
687 const auto *PDTStartNode = PDT->getNode(BB);
694 if (!PDT->dominates(PDTStartNode, PDT->getNode(DomBB)))
759 const Function &F, DominatorTree *DT, PostDominatorTree *PDT) {
770 propagateEstimatedBlockWeight(getLoopBlock(BB), DT, PDT,
818 propagateEstimatedBlockWeight(LoopBB, DT, PDT, MaxWeight.getValue(),
1252 PostDominatorTree *PDT) {
1271 if (!PDT) {
1273 PDT = PDTPtr.get()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| CodeMoverUtils.cpp | 66 const PostDominatorTree &PDT,
110 const PostDominatorTree &PDT, unsigned MaxLookup) {
135 if (PDT.dominates(CurBlock, IDom)) {
139 } else if (PDT.dominates(CurBlock, BI->getSuccessor(0))) {
145 } else if (PDT.dominates(CurBlock, BI->getSuccessor(1))) {
231 const PostDominatorTree &PDT) {
232 return isControlFlowEquivalent(*I0.getParent(), *I1.getParent(), DT, PDT);
237 const PostDominatorTree &PDT) {
241 if ((DT.dominates(&BB0, &BB1) && PDT.dominates(&BB1, &BB0)) ||
242 (PDT.dominates(&BB0, &BB1) && DT.dominates(&BB1, &BB0))
[all...] |
| BreakCriticalEdges.cpp | 55 auto *PDT = PDTWP ? &PDTWP->getPostDomTree() : nullptr;
60 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI, nullptr, PDT));
231 auto *PDT = Options.PDT;
237 if (!DT && !PDT && !LI)
240 if (DT || PDT) {
258 if (PDT)
259 PDT->applyUpdates(Updates);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| DomTreeUpdater.h | 38 : PDT(&PDT_), Strategy(Strategy_) {}
40 : PDT(PDT_), Strategy(Strategy_) {}
43 : DT(&DT_), PDT(&PDT_), Strategy(Strategy_) {}
46 : DT(DT_), PDT(PDT_), Strategy(Strategy_) {}
60 bool hasPostDomTree() const { return PDT != nullptr; }
72 /// Returns true if either of DT or PDT is valid and the tree has at
73 /// least one update pending. If DT or PDT is nullptr it is treated
84 /// Returns false under Eager UpdateStrategy or PDT is nullptr.
201 /// modified while awaiting deletion. When both DT and PDT are nullptrs, DelBB
266 PostDominatorTree *PDT = nullptr
[all...] |
| SyncDependenceAnalysis.h | 63 SyncDependenceAnalysis(const DominatorTree &DT, const PostDominatorTree &PDT,
83 const PostDominatorTree &PDT;
|
| BranchProbabilityInfo.h | 122 PostDominatorTree *PDT = nullptr) {
123 calculate(F, LI, TLI, DT, PDT);
207 PostDominatorTree *PDT);
399 PostDominatorTree *PDT, uint32_t BBWeight,
408 PostDominatorTree *PDT);
|
| RegionInfo.h | 697 : 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,
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| ADCE.cpp | 122 PostDominatorTree &PDT;
197 PostDominatorTree &PDT)
198 : F(F), DT(DT), PDT(PDT) {}
299 for (auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) {
489 ReverseIDFCalculator IDFs(PDT);
630 DomTreeUpdater(DT, &PDT, DomTreeUpdater::UpdateStrategy::Eager)
693 auto &PDT = FAM.getResult<PostDominatorTreeAnalysis>(F);
694 if (!AggressiveDeadCodeElimination(F, DT, PDT).performDeadCodeElimination())
725 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree()
[all...] |
| LoopFuse.cpp | 182 const PostDominatorTree *PDT;
187 const PostDominatorTree *PDT, OptimizationRemarkEmitter &ORE,
193 Peeled(false), DT(DT), PDT(PDT), ORE(ORE) {
398 // Do not save PDT to local variable as it is only used in asserts and thus
400 assert(DT && LHS.PDT && "Expecting valid dominator tree");
406 assert(LHS.PDT->dominates(LHSEntryBlock, RHSEntryBlock));
412 assert(LHS.PDT->dominates(RHSEntryBlock, LHSEntryBlock));
549 PostDominatorTree &PDT;
557 ScalarEvolution &SE, PostDominatorTree &PDT,
[all...] |
| GuardWidening.cpp | 115 PostDominatorTree *PDT;
273 explicit GuardWideningImpl(DominatorTree &DT, PostDominatorTree *PDT,
276 : DT(DT), PDT(PDT), LI(LI), Root(Root), BlockFilter(BlockFilter)
454 if (!PDT) return true;
455 return !PDT->dominates(DominatedBlock, DominatingBlock);
768 auto &PDT = AM.getResult<PostDominatorTreeAnalysis>(F);
769 if (!GuardWideningImpl(DT, &PDT, LI, DT.getRootNode(),
807 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree();
808 return GuardWideningImpl(DT, &PDT, LI, DT.getRootNode()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SILowerI1Copies.cpp | 50 MachinePostDominatorTree *PDT = nullptr;
126 MachinePostDominatorTree &PDT;
136 PhiIncomingAnalysis(MachinePostDominatorTree &PDT) : PDT(PDT) {}
180 if (Divergent && PDT.dominates(&DefBlock, MBB))
249 MachinePostDominatorTree &PDT;
273 LoopFinder(MachineDominatorTree &DT, MachinePostDominatorTree &PDT)
274 : DT(DT), PDT(PDT) {}
[all...] |
| AMDGPUUnifyDivergentExitNodes.cpp | 222 auto &PDT = getAnalysis<PostDominatorTreeWrapperPass>().getPostDomTree();
227 if (PDT.root_size() <= 1 && F.getCallingConv() != CallingConv::AMDGPU_PS)
247 for (BasicBlock *BB : PDT.roots()) {
375 // FIXME: add PDT here once simplifycfg is ready.
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| HotColdSplitting.cpp | 450 const PostDominatorTree &PDT) {
472 bool SinkPostDom = PDT.dominates(&SinkBB, &PredBB);
608 std::unique_ptr<PostDominatorTree> PDT;
639 if (!PDT)
640 PDT = std::make_unique<PostDominatorTree>(F);
642 auto Regions = OutliningRegion::create(*BB, *DT, *PDT);
|
