1 //===- PostDominators.cpp - Post-Dominator Calculation --------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the post-dominator construction algorithms.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "postdomtree"
16 #include "llvm/Analysis/PostDominators.h"
17 #include "llvm/Instructions.h"
18 #include "llvm/Support/CFG.h"
19 #include "llvm/Support/Debug.h"
20 #include "llvm/ADT/DepthFirstIterator.h"
21 #include "llvm/ADT/SetOperations.h"
22 #include "llvm/Analysis/DominatorInternals.h"
25 //===----------------------------------------------------------------------===//
26 // PostDominatorTree Implementation
27 //===----------------------------------------------------------------------===//
29 char PostDominatorTree::ID = 0;
30 char PostDominanceFrontier::ID = 0;
31 static RegisterPass<PostDominatorTree>
32 F("postdomtree", "Post-Dominator Tree Construction", true, true);
34 bool PostDominatorTree::runOnFunction(Function &F) {
39 PostDominatorTree::~PostDominatorTree() {
43 void PostDominatorTree::print(raw_ostream &OS, const Module *) const {
48 FunctionPass* llvm::createPostDomTree() {
49 return new PostDominatorTree();
52 //===----------------------------------------------------------------------===//
53 // PostDominanceFrontier Implementation
54 //===----------------------------------------------------------------------===//
56 static RegisterPass<PostDominanceFrontier>
57 H("postdomfrontier", "Post-Dominance Frontier Construction", true, true);
59 const DominanceFrontier::DomSetType &
60 PostDominanceFrontier::calculate(const PostDominatorTree &DT,
61 const DomTreeNode *Node) {
62 // Loop over CFG successors to calculate DFlocal[Node]
63 BasicBlock *BB = Node->getBlock();
64 DomSetType &S = Frontiers[BB]; // The new set to fill in...
65 if (getRoots().empty()) return S;
68 for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB);
71 // Does Node immediately dominate this predecessor?
72 DomTreeNode *SINode = DT[P];
73 if (SINode && SINode->getIDom() != Node)
77 // At this point, S is DFlocal. Now we union in DFup's of our children...
78 // Loop through and visit the nodes that Node immediately dominates (Node's
79 // children in the IDomTree)
81 for (DomTreeNode::const_iterator
82 NI = Node->begin(), NE = Node->end(); NI != NE; ++NI) {
83 DomTreeNode *IDominee = *NI;
84 const DomSetType &ChildDF = calculate(DT, IDominee);
86 DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end();
87 for (; CDFI != CDFE; ++CDFI) {
88 if (!DT.properlyDominates(Node, DT[*CDFI]))
96 FunctionPass* llvm::createPostDomFrontier() {
97 return new PostDominanceFrontier();