1 //=- llvm/Analysis/PostDominators.h - Post Dominator Calculation-*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file exposes interfaces to post dominance information.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ANALYSIS_POST_DOMINATORS_H
15 #define LLVM_ANALYSIS_POST_DOMINATORS_H
17 #include "llvm/Analysis/Dominators.h"
21 /// PostDominatorTree Class - Concrete subclass of DominatorTree that is used to
22 /// compute the a post-dominator tree.
24 struct PostDominatorTree : public DominatorTreeBase {
25 static char ID; // Pass identification, replacement for typeid
28 DominatorTreeBase((intptr_t)&ID, true) {}
30 virtual bool runOnFunction(Function &F) {
31 reset(); // Reset from the last time we were run...
36 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
40 void calculate(Function &F);
41 DomTreeNode *getNodeForBlock(BasicBlock *BB);
42 unsigned DFSPass(BasicBlock *V, InfoRec &VInfo,unsigned N);
43 void Compress(BasicBlock *V, InfoRec &VInfo);
44 BasicBlock *Eval(BasicBlock *V);
45 void Link(BasicBlock *V, BasicBlock *W, InfoRec &WInfo);
47 inline BasicBlock *getIDom(BasicBlock *BB) const {
48 std::map<BasicBlock*, BasicBlock*>::const_iterator I = IDoms.find(BB);
49 return I != IDoms.end() ? I->second : 0;
54 /// PostETForest Class - Concrete subclass of ETForestBase that is used to
55 /// compute a forwards post-dominator ET-Forest.
56 struct PostETForest : public ETForestBase {
58 PostETForest() : ETForestBase((intptr_t)&ID, true) {}
60 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
62 AU.addRequired<PostDominatorTree>();
65 virtual bool runOnFunction(Function &F) {
66 reset(); // Reset from the last time we were run...
67 PostDominatorTree &DT = getAnalysis<PostDominatorTree>();
68 Roots = DT.getRoots();
73 void calculate(const PostDominatorTree &DT);
74 ETNode *getNodeForBlock(BasicBlock *BB);
78 /// PostDominanceFrontier Class - Concrete subclass of DominanceFrontier that is
79 /// used to compute the a post-dominance frontier.
81 struct PostDominanceFrontier : public DominanceFrontierBase {
83 PostDominanceFrontier()
84 : DominanceFrontierBase((intptr_t) &ID, true) {}
86 virtual bool runOnFunction(Function &) {
88 PostDominatorTree &DT = getAnalysis<PostDominatorTree>();
89 Roots = DT.getRoots();
90 if (const DomTreeNode *Root = DT.getRootNode())
95 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
97 AU.addRequired<PostDominatorTree>();
101 const DomSetType &calculate(const PostDominatorTree &DT,
102 const DomTreeNode *Node);
105 } // End llvm namespace
107 // Make sure that any clients of this file link in PostDominators.cpp
108 FORCE_DEFINING_FILE_TO_BE_LINKED(PostDominanceFrontier)