2002-08-02 16:43:03 +00:00
|
|
|
//===- PostDominators.cpp - Post-Dominator Calculation --------------------===//
|
2001-07-02 05:46:38 +00:00
|
|
|
//
|
2002-08-02 16:43:03 +00:00
|
|
|
// This file implements the post-dominator construction algorithms.
|
2001-07-02 05:46:38 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-08-21 23:43:50 +00:00
|
|
|
#include "llvm/Analysis/PostDominators.h"
|
2002-05-07 19:18:48 +00:00
|
|
|
#include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
|
2002-02-12 21:07:25 +00:00
|
|
|
#include "llvm/Support/CFG.h"
|
2001-11-27 00:03:19 +00:00
|
|
|
#include "Support/DepthFirstIterator.h"
|
2002-02-05 03:35:31 +00:00
|
|
|
#include "Support/SetOperations.h"
|
2002-01-20 22:54:45 +00:00
|
|
|
|
2001-07-06 16:58:22 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-08-02 16:43:03 +00:00
|
|
|
// PostDominatorSet Implementation
|
2001-07-06 16:58:22 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-07-26 21:12:44 +00:00
|
|
|
static RegisterAnalysis<PostDominatorSet>
|
2002-07-30 16:27:52 +00:00
|
|
|
B("postdomset", "Post-Dominator Set Construction", true);
|
2001-07-06 16:58:22 +00:00
|
|
|
|
2002-07-26 18:40:14 +00:00
|
|
|
// Postdominator set construction. This converts the specified function to only
|
|
|
|
// have a single exit node (return stmt), then calculates the post dominance
|
|
|
|
// sets for the function.
|
2001-07-06 16:58:22 +00:00
|
|
|
//
|
2002-07-26 18:40:14 +00:00
|
|
|
bool PostDominatorSet::runOnFunction(Function &F) {
|
|
|
|
Doms.clear(); // Reset from the last time we were run...
|
2002-01-31 00:42:27 +00:00
|
|
|
// Since we require that the unify all exit nodes pass has been run, we know
|
2002-04-07 20:49:59 +00:00
|
|
|
// that there can be at most one return instruction in the function left.
|
2002-01-31 00:42:27 +00:00
|
|
|
// Get it.
|
|
|
|
//
|
2002-04-27 07:27:19 +00:00
|
|
|
Root = getAnalysis<UnifyFunctionExitNodes>().getExitNode();
|
2001-07-06 16:58:22 +00:00
|
|
|
|
2002-04-07 20:49:59 +00:00
|
|
|
if (Root == 0) { // No exit node for the function? Postdomsets are all empty
|
2002-06-25 16:13:24 +00:00
|
|
|
for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI)
|
|
|
|
Doms[FI] = DomSetType();
|
2002-07-26 18:40:14 +00:00
|
|
|
return false;
|
2001-08-23 17:07:19 +00:00
|
|
|
}
|
2001-07-02 05:46:38 +00:00
|
|
|
|
2001-07-06 16:58:22 +00:00
|
|
|
bool Changed;
|
|
|
|
do {
|
|
|
|
Changed = false;
|
|
|
|
|
2003-09-10 16:08:03 +00:00
|
|
|
std::set<const BasicBlock*> Visited;
|
2001-07-06 16:58:22 +00:00
|
|
|
DomSetType WorkingSet;
|
2002-01-31 00:42:27 +00:00
|
|
|
idf_iterator<BasicBlock*> It = idf_begin(Root), End = idf_end(Root);
|
2001-07-06 16:58:22 +00:00
|
|
|
for ( ; It != End; ++It) {
|
2002-04-28 00:15:57 +00:00
|
|
|
BasicBlock *BB = *It;
|
|
|
|
succ_iterator PI = succ_begin(BB), PEnd = succ_end(BB);
|
2001-07-06 16:58:22 +00:00
|
|
|
if (PI != PEnd) { // Is there SOME predecessor?
|
|
|
|
// Loop until we get to a successor that has had it's dom set filled
|
|
|
|
// in at least once. We are guaranteed to have this because we are
|
|
|
|
// traversing the graph in DFO and have handled start nodes specially.
|
|
|
|
//
|
|
|
|
while (Doms[*PI].size() == 0) ++PI;
|
|
|
|
WorkingSet = Doms[*PI];
|
|
|
|
|
|
|
|
for (++PI; PI != PEnd; ++PI) { // Intersect all of the successor sets
|
|
|
|
DomSetType &PredSet = Doms[*PI];
|
|
|
|
if (PredSet.size())
|
|
|
|
set_intersect(WorkingSet, PredSet);
|
|
|
|
}
|
2002-10-04 14:50:20 +00:00
|
|
|
} else if (BB != Root) {
|
|
|
|
// If this isn't the root basic block and it has no successors, it must
|
|
|
|
// be an non-returning block. Fib a bit by saying that the root node
|
|
|
|
// postdominates this unreachable node. This isn't exactly true,
|
|
|
|
// because there is no path from this node to the root node, but it is
|
|
|
|
// sorta true because any paths to the exit node would have to go
|
|
|
|
// through this node.
|
|
|
|
//
|
|
|
|
// This allows for postdominator properties to be built for code that
|
|
|
|
// doesn't return in a reasonable manner.
|
|
|
|
//
|
|
|
|
WorkingSet = Doms[Root];
|
2001-07-06 16:58:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
WorkingSet.insert(BB); // A block always dominates itself
|
|
|
|
DomSetType &BBSet = Doms[BB];
|
|
|
|
if (BBSet != WorkingSet) {
|
|
|
|
BBSet.swap(WorkingSet); // Constant time operation!
|
|
|
|
Changed = true; // The sets changed.
|
|
|
|
}
|
|
|
|
WorkingSet.clear(); // Clear out the set for next iteration
|
|
|
|
}
|
|
|
|
} while (Changed);
|
2002-07-26 18:40:14 +00:00
|
|
|
return false;
|
2001-07-02 05:46:38 +00:00
|
|
|
}
|
|
|
|
|
2002-07-26 18:40:14 +00:00
|
|
|
// getAnalysisUsage - This obviously provides a post-dominator set, but it also
|
|
|
|
// requires the UnifyFunctionExitNodes pass.
|
2002-01-31 00:42:27 +00:00
|
|
|
//
|
2002-07-26 18:40:14 +00:00
|
|
|
void PostDominatorSet::getAnalysisUsage(AnalysisUsage &AU) const {
|
2002-04-27 06:56:12 +00:00
|
|
|
AU.setPreservesAll();
|
2002-08-08 19:01:28 +00:00
|
|
|
AU.addRequired<UnifyFunctionExitNodes>();
|
2002-01-31 00:42:27 +00:00
|
|
|
}
|
|
|
|
|
2001-07-02 05:46:38 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-08-02 16:43:03 +00:00
|
|
|
// ImmediatePostDominators Implementation
|
2001-07-02 05:46:38 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-07-26 21:12:44 +00:00
|
|
|
static RegisterAnalysis<ImmediatePostDominators>
|
2002-07-30 16:27:52 +00:00
|
|
|
D("postidom", "Immediate Post-Dominators Construction", true);
|
2002-01-31 00:42:27 +00:00
|
|
|
|
2001-07-02 05:46:38 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-08-02 16:43:03 +00:00
|
|
|
// PostDominatorTree Implementation
|
2001-07-02 05:46:38 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-07-26 21:12:44 +00:00
|
|
|
static RegisterAnalysis<PostDominatorTree>
|
2002-07-30 16:27:52 +00:00
|
|
|
F("postdomtree", "Post-Dominator Tree Construction", true);
|
2002-01-31 00:42:27 +00:00
|
|
|
|
2002-07-26 18:40:14 +00:00
|
|
|
void PostDominatorTree::calculate(const PostDominatorSet &DS) {
|
2001-07-02 05:46:38 +00:00
|
|
|
Nodes[Root] = new Node(Root, 0); // Add a node for the root...
|
|
|
|
|
2002-07-26 18:40:14 +00:00
|
|
|
if (Root) {
|
2001-07-06 16:58:22 +00:00
|
|
|
// Iterate over all nodes in depth first order...
|
2002-01-31 00:42:27 +00:00
|
|
|
for (idf_iterator<BasicBlock*> I = idf_begin(Root), E = idf_end(Root);
|
2001-09-28 22:56:31 +00:00
|
|
|
I != E; ++I) {
|
2002-04-28 00:15:57 +00:00
|
|
|
BasicBlock *BB = *I;
|
2001-07-06 16:58:22 +00:00
|
|
|
const DominatorSet::DomSetType &Dominators = DS.getDominators(BB);
|
|
|
|
unsigned DomSetSize = Dominators.size();
|
|
|
|
if (DomSetSize == 1) continue; // Root node... IDom = null
|
|
|
|
|
2001-09-28 22:56:31 +00:00
|
|
|
// Loop over all dominators of this node. This corresponds to looping
|
|
|
|
// over nodes in the dominator chain, looking for a node whose dominator
|
|
|
|
// set is equal to the current nodes, except that the current node does
|
|
|
|
// not exist in it. This means that it is one level higher in the dom
|
|
|
|
// chain than the current node, and it is our idom! We know that we have
|
|
|
|
// already added a DominatorTree node for our idom, because the idom must
|
|
|
|
// be a predecessor in the depth first order that we are iterating through
|
2002-04-07 20:49:59 +00:00
|
|
|
// the function.
|
2001-07-06 16:58:22 +00:00
|
|
|
//
|
|
|
|
DominatorSet::DomSetType::const_iterator I = Dominators.begin();
|
|
|
|
DominatorSet::DomSetType::const_iterator End = Dominators.end();
|
|
|
|
for (; I != End; ++I) { // Iterate over dominators...
|
2002-01-31 00:42:27 +00:00
|
|
|
// All of our dominators should form a chain, where the number
|
|
|
|
// of elements in the dominator set indicates what level the
|
|
|
|
// node is at in the chain. We want the node immediately
|
|
|
|
// above us, so it will have an identical dominator set,
|
|
|
|
// except that BB will not dominate it... therefore it's
|
2001-07-06 16:58:22 +00:00
|
|
|
// dominator set size will be one less than BB's...
|
|
|
|
//
|
|
|
|
if (DS.getDominators(*I).size() == DomSetSize - 1) {
|
|
|
|
// We know that the immediate dominator should already have a node,
|
|
|
|
// because we are traversing the CFG in depth first order!
|
|
|
|
//
|
|
|
|
Node *IDomNode = Nodes[*I];
|
|
|
|
assert(IDomNode && "No node for IDOM?");
|
|
|
|
|
|
|
|
// Add a new tree node for this BasicBlock, and link it as a child of
|
|
|
|
// IDomNode
|
|
|
|
Nodes[BB] = IDomNode->addChild(new Node(BB, IDomNode));
|
|
|
|
break;
|
|
|
|
}
|
2001-07-02 05:46:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-08-02 16:43:03 +00:00
|
|
|
// PostDominanceFrontier Implementation
|
2001-07-02 05:46:38 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2002-07-26 21:12:44 +00:00
|
|
|
static RegisterAnalysis<PostDominanceFrontier>
|
2002-07-30 16:27:52 +00:00
|
|
|
H("postdomfrontier", "Post-Dominance Frontier Construction", true);
|
2002-01-31 00:42:27 +00:00
|
|
|
|
2002-04-28 16:21:30 +00:00
|
|
|
const DominanceFrontier::DomSetType &
|
2002-07-26 18:40:14 +00:00
|
|
|
PostDominanceFrontier::calculate(const PostDominatorTree &DT,
|
|
|
|
const DominatorTree::Node *Node) {
|
2001-07-06 16:58:22 +00:00
|
|
|
// Loop over CFG successors to calculate DFlocal[Node]
|
2002-04-28 00:15:57 +00:00
|
|
|
BasicBlock *BB = Node->getNode();
|
2001-07-06 16:58:22 +00:00
|
|
|
DomSetType &S = Frontiers[BB]; // The new set to fill in...
|
2001-08-23 17:07:19 +00:00
|
|
|
if (!Root) return S;
|
2001-07-06 16:58:22 +00:00
|
|
|
|
2002-04-28 00:15:57 +00:00
|
|
|
for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB);
|
2002-02-12 22:39:50 +00:00
|
|
|
SI != SE; ++SI) {
|
2001-07-06 16:58:22 +00:00
|
|
|
// Does Node immediately dominate this predeccessor?
|
|
|
|
if (DT[*SI]->getIDom() != Node)
|
|
|
|
S.insert(*SI);
|
|
|
|
}
|
|
|
|
|
|
|
|
// At this point, S is DFlocal. Now we union in DFup's of our children...
|
|
|
|
// Loop through and visit the nodes that Node immediately dominates (Node's
|
|
|
|
// children in the IDomTree)
|
|
|
|
//
|
2002-07-26 18:40:14 +00:00
|
|
|
for (PostDominatorTree::Node::const_iterator
|
|
|
|
NI = Node->begin(), NE = Node->end(); NI != NE; ++NI) {
|
2001-07-06 16:58:22 +00:00
|
|
|
DominatorTree::Node *IDominee = *NI;
|
2002-07-26 18:40:14 +00:00
|
|
|
const DomSetType &ChildDF = calculate(DT, IDominee);
|
2001-07-06 16:58:22 +00:00
|
|
|
|
|
|
|
DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end();
|
|
|
|
for (; CDFI != CDFE; ++CDFI) {
|
|
|
|
if (!Node->dominates(DT[*CDFI]))
|
|
|
|
S.insert(*CDFI);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return S;
|
|
|
|
}
|
2002-08-21 23:43:50 +00:00
|
|
|
|
|
|
|
// stub - a dummy function to make linking work ok.
|
|
|
|
void PostDominanceFrontier::stub() {
|
|
|
|
}
|