2002-08-02 16:43:03 +00:00
|
|
|
//===- PostDominators.cpp - Post-Dominator Calculation --------------------===//
|
2005-04-21 21:13:18 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-21 21:13:18 +00:00
|
|
|
//
|
2003-10-20 19:43:21 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
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
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2008-04-16 04:21:16 +00:00
|
|
|
#define DEBUG_TYPE "postdomtree"
|
|
|
|
|
2002-08-21 23:43:50 +00:00
|
|
|
#include "llvm/Analysis/PostDominators.h"
|
2004-07-29 17:30:56 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2002-02-12 21:07:25 +00:00
|
|
|
#include "llvm/Support/CFG.h"
|
2008-04-16 04:21:16 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2004-09-01 22:55:40 +00:00
|
|
|
#include "llvm/ADT/DepthFirstIterator.h"
|
|
|
|
#include "llvm/ADT/SetOperations.h"
|
2007-10-03 21:25:45 +00:00
|
|
|
#include "llvm/Analysis/DominatorInternals.h"
|
2003-12-07 00:35:42 +00:00
|
|
|
using namespace llvm;
|
2003-11-11 22:41:34 +00:00
|
|
|
|
2006-03-11 02:20:46 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
2007-04-15 08:47:27 +00:00
|
|
|
// PostDominatorTree Implementation
|
2006-03-11 02:20:46 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-05-03 01:11:54 +00:00
|
|
|
char PostDominatorTree::ID = 0;
|
|
|
|
char PostDominanceFrontier::ID = 0;
|
2010-07-21 22:09:45 +00:00
|
|
|
INITIALIZE_PASS(PostDominatorTree, "postdomtree",
|
|
|
|
"Post-Dominator Tree Construction", true, true);
|
2006-03-11 02:20:46 +00:00
|
|
|
|
2007-10-03 03:20:17 +00:00
|
|
|
bool PostDominatorTree::runOnFunction(Function &F) {
|
2007-10-23 20:58:37 +00:00
|
|
|
DT->recalculate(F);
|
2007-10-03 03:20:17 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-08-23 05:17:37 +00:00
|
|
|
PostDominatorTree::~PostDominatorTree() {
|
2008-05-03 20:25:26 +00:00
|
|
|
delete DT;
|
|
|
|
}
|
|
|
|
|
2009-08-23 06:03:38 +00:00
|
|
|
void PostDominatorTree::print(raw_ostream &OS, const Module *) const {
|
|
|
|
DT->print(OS);
|
2009-08-23 05:17:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-05-29 17:00:13 +00:00
|
|
|
FunctionPass* llvm::createPostDomTree() {
|
|
|
|
return new PostDominatorTree();
|
|
|
|
}
|
|
|
|
|
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
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2010-07-21 23:07:00 +00:00
|
|
|
INITIALIZE_PASS(PostDominanceFrontier, "postdomfrontier",
|
|
|
|
"Post-Dominance Frontier Construction", true, true);
|
2002-01-31 00:42:27 +00:00
|
|
|
|
2002-04-28 16:21:30 +00:00
|
|
|
const DominanceFrontier::DomSetType &
|
2005-04-21 21:13:18 +00:00
|
|
|
PostDominanceFrontier::calculate(const PostDominatorTree &DT,
|
2007-06-04 00:32:22 +00:00
|
|
|
const DomTreeNode *Node) {
|
2001-07-06 16:58:22 +00:00
|
|
|
// Loop over CFG successors to calculate DFlocal[Node]
|
2003-09-11 16:26:13 +00:00
|
|
|
BasicBlock *BB = Node->getBlock();
|
2001-07-06 16:58:22 +00:00
|
|
|
DomSetType &S = Frontiers[BB]; // The new set to fill in...
|
2003-09-10 20:37:08 +00:00
|
|
|
if (getRoots().empty()) return S;
|
|
|
|
|
|
|
|
if (BB)
|
|
|
|
for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB);
|
2007-04-18 01:19:55 +00:00
|
|
|
SI != SE; ++SI) {
|
2010-07-09 15:52:36 +00:00
|
|
|
BasicBlock *P = *SI;
|
2003-09-11 18:14:24 +00:00
|
|
|
// Does Node immediately dominate this predecessor?
|
2010-07-09 15:52:36 +00:00
|
|
|
DomTreeNode *SINode = DT[P];
|
2007-04-18 01:19:55 +00:00
|
|
|
if (SINode && SINode->getIDom() != Node)
|
2010-07-09 15:52:36 +00:00
|
|
|
S.insert(P);
|
2007-04-18 01:19:55 +00:00
|
|
|
}
|
2001-07-06 16:58:22 +00:00
|
|
|
|
|
|
|
// 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)
|
|
|
|
//
|
2007-06-04 00:32:22 +00:00
|
|
|
for (DomTreeNode::const_iterator
|
2002-07-26 18:40:14 +00:00
|
|
|
NI = Node->begin(), NE = Node->end(); NI != NE; ++NI) {
|
2007-06-04 00:32:22 +00:00
|
|
|
DomTreeNode *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) {
|
2007-06-07 17:47:21 +00:00
|
|
|
if (!DT.properlyDominates(Node, DT[*CDFI]))
|
2005-04-22 04:01:18 +00:00
|
|
|
S.insert(*CDFI);
|
2001-07-06 16:58:22 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return S;
|
|
|
|
}
|
2008-05-29 17:00:13 +00:00
|
|
|
|
|
|
|
FunctionPass* llvm::createPostDomFrontier() {
|
|
|
|
return new PostDominanceFrontier();
|
2008-05-29 21:05:16 +00:00
|
|
|
}
|