Home
last modified time | relevance | path

Searched refs:PostDominatorTree (Results 1 – 25 of 33) sorted by relevance

12

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DPostDominators.h28 class PostDominatorTree : public PostDomTreeBase<BasicBlock> {
32 PostDominatorTree() = default;
33 explicit PostDominatorTree(Function &F) { recalculate(F); } in PostDominatorTree() function
55 using Result = PostDominatorTree;
59 PostDominatorTree run(Function &F, FunctionAnalysisManager &);
76 PostDominatorTree DT;
80 PostDominatorTree &getPostDomTree() { return DT; } in getPostDomTree()
98 template <> struct GraphTraits<PostDominatorTree*>
100 static NodeRef getEntryNode(PostDominatorTree *DT) {
104 static nodes_iterator nodes_begin(PostDominatorTree *N) {
[all …]
H A DDomTreeUpdater.h26 class PostDominatorTree; variable
37 DomTreeUpdater(PostDominatorTree &PDT_, UpdateStrategy Strategy_) in DomTreeUpdater()
39 DomTreeUpdater(PostDominatorTree *PDT_, UpdateStrategy Strategy_) in DomTreeUpdater()
41 DomTreeUpdater(DominatorTree &DT_, PostDominatorTree &PDT_, in DomTreeUpdater()
44 DomTreeUpdater(DominatorTree *DT_, PostDominatorTree *PDT_, in DomTreeUpdater()
233 PostDominatorTree &getPostDomTree();
266 PostDominatorTree *PDT = nullptr;
H A DSyncDependenceAnalysis.h31 class PostDominatorTree; variable
63 SyncDependenceAnalysis(const DominatorTree &DT, const PostDominatorTree &PDT,
83 const PostDominatorTree &PDT;
H A DBranchProbabilityInfo.h40 class PostDominatorTree; variable
122 PostDominatorTree *PDT = nullptr) {
201 PostDominatorTree *PDT);
393 PostDominatorTree *PDT, uint32_t BBWeight,
402 PostDominatorTree *PDT);
H A DMustExecute.h44 class PostDominatorTree; variable
409 GetterTy<const PostDominatorTree> PDTGetter =
529 GetterTy<const PostDominatorTree> PDTGetter;
H A DDivergenceAnalysis.h156 const PostDominatorTree &PDT, const LoopInfo &LI,
H A DRegionInfo.h64 class PostDominatorTree; variable
94 using PostDomTreeT = PostDominatorTree;
925 void recalculate(Function &F, DominatorTree *DT, PostDominatorTree *PDT,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DDomPrinter.cpp67 struct DOTGraphTraits<PostDominatorTree*>
73 static std::string getGraphName(PostDominatorTree *DT) { in getGraphName()
77 std::string getNodeLabel(DomTreeNode *Node, PostDominatorTree *G ) { in getNodeLabel()
138 PostDominatorTree *,
143 PostDominatorTree *, in PostDomViewer()
152 PostDominatorTree *,
157 PostDominatorTree *, in PostDomOnlyViewer()
212 PostDominatorTree *,
217 PostDominatorTree *, in PostDomPrinter()
227 PostDominatorTree *,
[all …]
H A DPostDominators.cpp45 bool PostDominatorTree::invalidate(Function &F, const PreservedAnalyses &PA, in invalidate()
54 bool PostDominatorTree::dominates(const Instruction *I1, in dominates()
83 assert(DT.verify(PostDominatorTree::VerificationLevel::Full)); in verifyAnalysis()
85 assert(DT.verify(PostDominatorTree::VerificationLevel::Basic)); in verifyAnalysis()
98 PostDominatorTree PostDominatorTreeAnalysis::run(Function &F, in run()
100 PostDominatorTree PDT(F); in run()
H A DSyncDependenceAnalysis.cpp234 const PostDominatorTree &PDT, in SyncDependenceAnalysis()
247 const PostDominatorTree &PDT;
262 const PostDominatorTree &PDT, const LoopInfo &LI, in DivergencePropagator()
H A DMustExecute.cpp365 SmallVector<std::unique_ptr<PostDominatorTree>, 8> PDTs; in runOnModule()
378 GetterTy<PostDominatorTree> PDTGetter = [&](const Function &F) { in runOnModule()
380 std::make_unique<PostDominatorTree>(const_cast<Function &>(F))); in runOnModule()
505 const PostDominatorTree *PDT = PDTGetter(*InitBB->getParent()); in findForwardJoinPoint()
859 GetterTy<const PostDominatorTree> PDTGetter = [&](const Function &F) { in run()
H A DBranchProbabilityInfo.cpp682 const LoopBlock &LoopBB, DominatorTree *DT, PostDominatorTree *PDT, in propagateEstimatedBlockWeight()
759 const Function &F, DominatorTree *DT, PostDominatorTree *PDT) { in computeEestimateBlockWeight()
1233 PostDominatorTree *PDT) { in calculate()
1245 std::unique_ptr<PostDominatorTree> PDTPtr; in calculate()
1253 PDTPtr = std::make_unique<PostDominatorTree>(const_cast<Function &>(F)); in calculate()
1308 PostDominatorTree &PDT = in runOnFunction()
H A DLegacyDivergenceAnalysis.cpp98 PostDominatorTree &PDT, DenseSet<const Value *> &DV, in DivergencePropagator()
121 PostDominatorTree &PDT;
H A DRegionInfo.cpp96 PostDominatorTree *PDT_, DominanceFrontier *DF_) { in recalculate()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCodeMoverUtils.h23 class PostDominatorTree; variable
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,
H A DBasicBlockUtils.h40 class PostDominatorTree; variable
138 PostDominatorTree *PDT;
153 PostDominatorTree *PDT = nullptr)
H A DSCCPSolver.h34 PostDominatorTree *PDT;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeMoverUtils.cpp66 const PostDominatorTree &PDT,
110 const PostDominatorTree &PDT, unsigned MaxLookup) { in collectControlConditions()
231 const PostDominatorTree &PDT) { in isControlFlowEquivalent()
237 const PostDominatorTree &PDT) { in isControlFlowEquivalent()
311 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
390 DominatorTree &DT, const PostDominatorTree *PDT, in isSafeToMoveBefore()
402 const PostDominatorTree &PDT, in moveInstructionsToTheBeginning()
417 const PostDominatorTree &PDT, in moveInstructionsToTheEnd()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DSCCP.h35 class PostDominatorTree; variable
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DAddressSanitizerCommon.h58 bool forAllReachableExits(const DominatorTree &DT, const PostDominatorTree &PDT, in forAllReachableExits()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DSanitizerCoverage.cpp187 function_ref<const PostDominatorTree *(Function &F)>;
288 auto PDTCallback = [this](Function &F) -> const PostDominatorTree * { in runOnModule()
320 auto PDTCallback = [&FAM](Function &F) -> const PostDominatorTree * { in run()
527 const PostDominatorTree *PDT) { in isFullPostDominator()
538 const PostDominatorTree *PDT, in shouldInstrumentBlock()
637 const PostDominatorTree *PDT = PDTCallback(F); in instrumentFunction()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DHotColdSplitting.cpp451 const PostDominatorTree &PDT) { in create()
609 std::unique_ptr<PostDominatorTree> PDT; in outlineColdRegions()
641 PDT = std::make_unique<PostDominatorTree>(F); in outlineColdRegions()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DADCE.cpp122 PostDominatorTree &PDT;
197 PostDominatorTree &PDT) in AggressiveDeadCodeElimination()
H A DDeadStoreElimination.cpp865 PostDominatorTree &PDT;
896 PostDominatorTree &PDT, const TargetLibraryInfo &TLI, in DSEState()
902 DominatorTree &DT, PostDominatorTree &PDT, in get()
1881 DominatorTree &DT, PostDominatorTree &PDT, in eliminateDeadStores()
2058 PostDominatorTree &PDT = AM.getResult<PostDominatorTreeAnalysis>(F); in run()
2099 PostDominatorTree &PDT = in runOnFunction()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64StackTagging.cpp611 std::unique_ptr<PostDominatorTree> DeletePDT; in runOnFunction()
612 PostDominatorTree *PDT = nullptr; in runOnFunction()
617 DeletePDT = std::make_unique<PostDominatorTree>(*F); in runOnFunction()

12