LLVM  6.0.0svn
PostDominators.h
Go to the documentation of this file.
1 //=- llvm/Analysis/PostDominators.h - Post Dominator Calculation --*- C++ -*-=//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file exposes interfaces to post dominance information.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #ifndef LLVM_ANALYSIS_POSTDOMINATORS_H
15 #define LLVM_ANALYSIS_POSTDOMINATORS_H
16 
18 #include "llvm/IR/Dominators.h"
19 #include "llvm/IR/PassManager.h"
20 #include "llvm/Pass.h"
21 
22 namespace llvm {
23 
24 class Function;
25 class raw_ostream;
26 
27 /// PostDominatorTree Class - Concrete subclass of DominatorTree that is used to
28 /// compute the post-dominator tree.
29 struct PostDominatorTree : public PostDomTreeBase<BasicBlock> {
31 
32  /// Handle invalidation explicitly.
33  bool invalidate(Function &F, const PreservedAnalyses &PA,
35 };
36 
37 /// \brief Analysis pass which computes a \c PostDominatorTree.
39  : public AnalysisInfoMixin<PostDominatorTreeAnalysis> {
41 
42  static AnalysisKey Key;
43 
44 public:
45  /// \brief Provide the result type for this analysis pass.
47 
48  /// \brief Run the analysis pass over a function and produce a post dominator
49  /// tree.
51 };
52 
53 /// \brief Printer pass for the \c PostDominatorTree.
55  : public PassInfoMixin<PostDominatorTreePrinterPass> {
56  raw_ostream &OS;
57 
58 public:
60 
62 };
63 
65  static char ID; // Pass identification, replacement for typeid
66 
68 
71  }
72 
74  const PostDominatorTree &getPostDomTree() const { return DT; }
75 
76  bool runOnFunction(Function &F) override;
77 
78  void getAnalysisUsage(AnalysisUsage &AU) const override {
79  AU.setPreservesAll();
80  }
81 
82  void releaseMemory() override {
83  DT.releaseMemory();
84  }
85 
86  void print(raw_ostream &OS, const Module*) const override;
87 };
88 
90 
91 template <> struct GraphTraits<PostDominatorTree*>
92  : public GraphTraits<DomTreeNode*> {
94  return DT->getRootNode();
95  }
96 
97  static nodes_iterator nodes_begin(PostDominatorTree *N) {
98  if (getEntryNode(N))
99  return df_begin(getEntryNode(N));
100  else
101  return df_end(getEntryNode(N));
102  }
103 
104  static nodes_iterator nodes_end(PostDominatorTree *N) {
105  return df_end(getEntryNode(N));
106  }
107 };
108 
109 } // end namespace llvm
110 
111 #endif // LLVM_ANALYSIS_POSTDOMINATORS_H
static PassRegistry * getPassRegistry()
getPassRegistry - Access the global registry object, which is automatically initialized at applicatio...
Compute iterated dominance frontiers using a linear time algorithm.
Definition: AllocatorList.h:24
A Module instance is used to store all the information related to an LLVM module. ...
Definition: Module.h:63
F(f)
Key
PAL metadata keys.
static nodes_iterator nodes_end(PostDominatorTree *N)
A CRTP mix-in to automatically provide informational APIs needed for passes.
Definition: PassManager.h:365
void getAnalysisUsage(AnalysisUsage &AU) const override
getAnalysisUsage - This function should be overriden by passes that need analysis information to do t...
Core dominator tree base class.
Definition: LoopInfo.h:61
static bool runOnFunction(Function &F, bool PostInlining)
typename DomTreeNode *::UnknownGraphTypeError NodeRef
Definition: GraphTraits.h:59
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:153
void initializePostDominatorTreeWrapperPassPass(PassRegistry &)
df_iterator< T > df_end(const T &G)
static nodes_iterator nodes_begin(PostDominatorTree *N)
A CRTP mix-in that provides informational APIs needed for analysis passes.
Definition: PassManager.h:382
Represent the analysis usage information of a pass.
FunctionPass class - This class is used to implement most global optimizations.
Definition: Pass.h:285
static NodeRef getEntryNode(PostDominatorTree *DT)
DomTreeNodeBase< NodeT > * getRootNode()
getRootNode - This returns the entry node for the CFG of the function.
void print(raw_ostream &O) const
print - Convert to human readable form
PostDominatorTree & getPostDomTree()
Analysis pass which computes a PostDominatorTree.
df_iterator< T > df_begin(const T &G)
void setPreservesAll()
Set by analyses that do not transform their input at all.
PostDominatorTree Class - Concrete subclass of DominatorTree that is used to compute the post-dominat...
const PostDominatorTree & getPostDomTree() const
#define N
API to communicate dependencies between analyses during invalidation.
Definition: PassManager.h:559
Printer pass for the PostDominatorTree.
FunctionPass * createPostDomTree()
bool invalidate(Function &F, const PreservedAnalyses &PA, FunctionAnalysisManager::Invalidator &)
Handle invalidation explicitly.
void releaseMemory() override
releaseMemory() - This member can be implemented by a pass if it wants to be able to release its memo...
This class implements an extremely fast bulk output stream that can only output to a stream...
Definition: raw_ostream.h:44
A container for analyses that lazily runs them and caches their results.
This header defines various interfaces for pass management in LLVM.
A special type used by analysis passes to provide an address that identifies that particular analysis...
Definition: PassManager.h:70