![]() System : Linux absol.cf 5.4.0-198-generic #218-Ubuntu SMP Fri Sep 27 20:18:53 UTC 2024 x86_64 User : www-data ( 33) PHP Version : 7.4.33 Disable Function : pcntl_alarm,pcntl_fork,pcntl_waitpid,pcntl_wait,pcntl_wifexited,pcntl_wifstopped,pcntl_wifsignaled,pcntl_wifcontinued,pcntl_wexitstatus,pcntl_wtermsig,pcntl_wstopsig,pcntl_signal,pcntl_signal_get_handler,pcntl_signal_dispatch,pcntl_get_last_error,pcntl_strerror,pcntl_sigprocmask,pcntl_sigwaitinfo,pcntl_sigtimedwait,pcntl_exec,pcntl_getpriority,pcntl_setpriority,pcntl_async_signals,pcntl_unshare, Directory : /usr/include/llvm-10/llvm/Analysis/ |
Upload File : |
//=- llvm/Analysis/PostDominators.h - Post Dominator Calculation --*- C++ -*-=// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // // This file exposes interfaces to post dominance information. // //===----------------------------------------------------------------------===// #ifndef LLVM_ANALYSIS_POSTDOMINATORS_H #define LLVM_ANALYSIS_POSTDOMINATORS_H #include "llvm/ADT/DepthFirstIterator.h" #include "llvm/IR/Dominators.h" #include "llvm/IR/PassManager.h" #include "llvm/Pass.h" namespace llvm { class Function; class raw_ostream; /// PostDominatorTree Class - Concrete subclass of DominatorTree that is used to /// compute the post-dominator tree. class PostDominatorTree : public PostDomTreeBase<BasicBlock> { public: using Base = PostDomTreeBase<BasicBlock>; PostDominatorTree() = default; explicit PostDominatorTree(Function &F) { recalculate(F); } /// Handle invalidation explicitly. bool invalidate(Function &F, const PreservedAnalyses &PA, FunctionAnalysisManager::Invalidator &); // Ensure base-class overloads are visible. using Base::dominates; /// Return true if \p I1 dominates \p I2. This checks if \p I2 comes before /// \p I1 if they belongs to the same basic block. bool dominates(const Instruction *I1, const Instruction *I2) const; }; /// Analysis pass which computes a \c PostDominatorTree. class PostDominatorTreeAnalysis : public AnalysisInfoMixin<PostDominatorTreeAnalysis> { friend AnalysisInfoMixin<PostDominatorTreeAnalysis>; static AnalysisKey Key; public: /// Provide the result type for this analysis pass. using Result = PostDominatorTree; /// Run the analysis pass over a function and produce a post dominator /// tree. PostDominatorTree run(Function &F, FunctionAnalysisManager &); }; /// Printer pass for the \c PostDominatorTree. class PostDominatorTreePrinterPass : public PassInfoMixin<PostDominatorTreePrinterPass> { raw_ostream &OS; public: explicit PostDominatorTreePrinterPass(raw_ostream &OS); PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM); }; struct PostDominatorTreeWrapperPass : public FunctionPass { static char ID; // Pass identification, replacement for typeid PostDominatorTree DT; PostDominatorTreeWrapperPass(); PostDominatorTree &getPostDomTree() { return DT; } const PostDominatorTree &getPostDomTree() const { return DT; } bool runOnFunction(Function &F) override; void verifyAnalysis() const override; void getAnalysisUsage(AnalysisUsage &AU) const override { AU.setPreservesAll(); } void releaseMemory() override { DT.releaseMemory(); } void print(raw_ostream &OS, const Module*) const override; }; FunctionPass* createPostDomTree(); template <> struct GraphTraits<PostDominatorTree*> : public GraphTraits<DomTreeNode*> { static NodeRef getEntryNode(PostDominatorTree *DT) { return DT->getRootNode(); } static nodes_iterator nodes_begin(PostDominatorTree *N) { if (getEntryNode(N)) return df_begin(getEntryNode(N)); else return df_end(getEntryNode(N)); } static nodes_iterator nodes_end(PostDominatorTree *N) { return df_end(getEntryNode(N)); } }; } // end namespace llvm #endif // LLVM_ANALYSIS_POSTDOMINATORS_H