1 //===- Dominators.cpp - Dominator Calculation -----------------------------===//
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 implements simple dominator construction algorithms for finding
11 // forward dominators. Postdominators are available in libanalysis, but are not
12 // included in libvmcore, because it's not needed. Forward dominators are
13 // needed to support the Verifier pass.
15 //===----------------------------------------------------------------------===//
17 #include "llvm/Analysis/Dominators.h"
18 #include "llvm/Support/CFG.h"
19 #include "llvm/Assembly/Writer.h"
20 #include "llvm/ADT/DepthFirstIterator.h"
21 #include "llvm/ADT/SetOperations.h"
22 #include "llvm/ADT/SmallPtrSet.h"
23 #include "llvm/Instructions.h"
24 #include "llvm/Support/Streams.h"
29 static std::ostream &operator<<(std::ostream &o,
30 const std::set<BasicBlock*> &BBs) {
31 for (std::set<BasicBlock*>::const_iterator I = BBs.begin(), E = BBs.end();
34 WriteAsOperand(o, *I, false);
36 o << " <<exit node>>";
41 //===----------------------------------------------------------------------===//
42 // DominatorTree Implementation
43 //===----------------------------------------------------------------------===//
45 // DominatorTree construction - This pass constructs immediate dominator
46 // information for a flow-graph based on the algorithm described in this
49 // A Fast Algorithm for Finding Dominators in a Flowgraph
50 // T. Lengauer & R. Tarjan, ACM TOPLAS July 1979, pgs 121-141.
52 // This implements both the O(n*ack(n)) and the O(n*log(n)) versions of EVAL and
53 // LINK, but it turns out that the theoretically slower O(n*log(n))
54 // implementation is actually faster than the "efficient" algorithm (even for
55 // large CFGs) because the constant overheads are substantially smaller. The
56 // lower-complexity version can be enabled with the following #define:
58 #define BALANCE_IDOM_TREE 0
60 //===----------------------------------------------------------------------===//
62 char DominatorTree::ID = 0;
63 static RegisterPass<DominatorTree>
64 E("domtree", "Dominator Tree Construction", true);
66 // NewBB is split and now it has one successor. Update dominator tree to
67 // reflect this change.
68 void DominatorTree::splitBlock(BasicBlock *NewBB) {
70 assert(NewBB->getTerminator()->getNumSuccessors() == 1
71 && "NewBB should have a single successor!");
72 BasicBlock *NewBBSucc = NewBB->getTerminator()->getSuccessor(0);
74 std::vector<BasicBlock*> PredBlocks;
75 for (pred_iterator PI = pred_begin(NewBB), PE = pred_end(NewBB);
77 PredBlocks.push_back(*PI);
79 assert(!PredBlocks.empty() && "No predblocks??");
81 // The newly inserted basic block will dominate existing basic blocks iff the
82 // PredBlocks dominate all of the non-pred blocks. If all predblocks dominate
83 // the non-pred blocks, then they all must be the same block!
85 bool NewBBDominatesNewBBSucc = true;
87 BasicBlock *OnePred = PredBlocks[0];
88 unsigned i = 1, e = PredBlocks.size();
89 for (i = 1; !isReachableFromEntry(OnePred); ++i) {
90 assert(i != e && "Didn't find reachable pred?");
91 OnePred = PredBlocks[i];
95 if (PredBlocks[i] != OnePred && isReachableFromEntry(OnePred)){
96 NewBBDominatesNewBBSucc = false;
100 if (NewBBDominatesNewBBSucc)
101 for (pred_iterator PI = pred_begin(NewBBSucc), E = pred_end(NewBBSucc);
103 if (*PI != NewBB && !dominates(NewBBSucc, *PI)) {
104 NewBBDominatesNewBBSucc = false;
109 // The other scenario where the new block can dominate its successors are when
110 // all predecessors of NewBBSucc that are not NewBB are dominated by NewBBSucc
112 if (!NewBBDominatesNewBBSucc) {
113 NewBBDominatesNewBBSucc = true;
114 for (pred_iterator PI = pred_begin(NewBBSucc), E = pred_end(NewBBSucc);
116 if (*PI != NewBB && !dominates(NewBBSucc, *PI)) {
117 NewBBDominatesNewBBSucc = false;
123 // Find NewBB's immediate dominator and create new dominator tree node for NewBB.
124 BasicBlock *NewBBIDom = 0;
126 for (i = 0; i < PredBlocks.size(); ++i)
127 if (isReachableFromEntry(PredBlocks[i])) {
128 NewBBIDom = PredBlocks[i];
131 assert(i != PredBlocks.size() && "No reachable preds?");
132 for (i = i + 1; i < PredBlocks.size(); ++i) {
133 if (isReachableFromEntry(PredBlocks[i]))
134 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
136 assert(NewBBIDom && "No immediate dominator found??");
138 // Create the new dominator tree node... and set the idom of NewBB.
139 DomTreeNode *NewBBNode = addNewBlock(NewBB, NewBBIDom);
141 // If NewBB strictly dominates other blocks, then it is now the immediate
142 // dominator of NewBBSucc. Update the dominator tree as appropriate.
143 if (NewBBDominatesNewBBSucc) {
144 DomTreeNode *NewBBSuccNode = getNode(NewBBSucc);
145 changeImmediateDominator(NewBBSuccNode, NewBBNode);
149 unsigned DominatorTree::DFSPass(BasicBlock *V, InfoRec &VInfo,
151 // This is more understandable as a recursive algorithm, but we can't use the
152 // recursive algorithm due to stack depth issues. Keep it here for
153 // documentation purposes.
158 Vertex.push_back(V); // Vertex[n] = V;
159 //Info[V].Ancestor = 0; // Ancestor[n] = 0
160 //Info[V].Child = 0; // Child[v] = 0
161 VInfo.Size = 1; // Size[v] = 1
163 for (succ_iterator SI = succ_begin(V), E = succ_end(V); SI != E; ++SI) {
164 InfoRec &SuccVInfo = Info[*SI];
165 if (SuccVInfo.Semi == 0) {
166 SuccVInfo.Parent = V;
167 N = DFSPass(*SI, SuccVInfo, N);
171 std::vector<std::pair<BasicBlock*, unsigned> > Worklist;
172 Worklist.push_back(std::make_pair(V, 0U));
173 while (!Worklist.empty()) {
174 BasicBlock *BB = Worklist.back().first;
175 unsigned NextSucc = Worklist.back().second;
177 // First time we visited this BB?
179 InfoRec &BBInfo = Info[BB];
183 Vertex.push_back(BB); // Vertex[n] = V;
184 //BBInfo[V].Ancestor = 0; // Ancestor[n] = 0
185 //BBInfo[V].Child = 0; // Child[v] = 0
186 BBInfo.Size = 1; // Size[v] = 1
189 // If we are done with this block, remove it from the worklist.
190 if (NextSucc == BB->getTerminator()->getNumSuccessors()) {
195 // Otherwise, increment the successor number for the next time we get to it.
196 ++Worklist.back().second;
198 // Visit the successor next, if it isn't already visited.
199 BasicBlock *Succ = BB->getTerminator()->getSuccessor(NextSucc);
201 InfoRec &SuccVInfo = Info[Succ];
202 if (SuccVInfo.Semi == 0) {
203 SuccVInfo.Parent = BB;
204 Worklist.push_back(std::make_pair(Succ, 0U));
211 void DominatorTree::Compress(BasicBlock *VIn) {
213 std::vector<BasicBlock *> Work;
214 std::set<BasicBlock *> Visited;
215 InfoRec &VInInfo = Info[VIn];
216 BasicBlock *VInAncestor = VInInfo.Ancestor;
217 InfoRec &VInVAInfo = Info[VInAncestor];
219 if (VInVAInfo.Ancestor != 0)
222 while (!Work.empty()) {
223 BasicBlock *V = Work.back();
224 InfoRec &VInfo = Info[V];
225 BasicBlock *VAncestor = VInfo.Ancestor;
226 InfoRec &VAInfo = Info[VAncestor];
228 // Process Ancestor first
229 if (Visited.count(VAncestor) == 0 && VAInfo.Ancestor != 0) {
230 Work.push_back(VAncestor);
231 Visited.insert(VAncestor);
236 // Update VINfo based on Ancestor info
237 if (VAInfo.Ancestor == 0)
239 BasicBlock *VAncestorLabel = VAInfo.Label;
240 BasicBlock *VLabel = VInfo.Label;
241 if (Info[VAncestorLabel].Semi < Info[VLabel].Semi)
242 VInfo.Label = VAncestorLabel;
243 VInfo.Ancestor = VAInfo.Ancestor;
247 BasicBlock *DominatorTree::Eval(BasicBlock *V) {
248 InfoRec &VInfo = Info[V];
249 #if !BALANCE_IDOM_TREE
250 // Higher-complexity but faster implementation
251 if (VInfo.Ancestor == 0)
256 // Lower-complexity but slower implementation
257 if (VInfo.Ancestor == 0)
260 BasicBlock *VLabel = VInfo.Label;
262 BasicBlock *VAncestorLabel = Info[VInfo.Ancestor].Label;
263 if (Info[VAncestorLabel].Semi >= Info[VLabel].Semi)
266 return VAncestorLabel;
270 void DominatorTree::Link(BasicBlock *V, BasicBlock *W, InfoRec &WInfo){
271 #if !BALANCE_IDOM_TREE
272 // Higher-complexity but faster implementation
275 // Lower-complexity but slower implementation
276 BasicBlock *WLabel = WInfo.Label;
277 unsigned WLabelSemi = Info[WLabel].Semi;
279 InfoRec *SInfo = &Info[S];
281 BasicBlock *SChild = SInfo->Child;
282 InfoRec *SChildInfo = &Info[SChild];
284 while (WLabelSemi < Info[SChildInfo->Label].Semi) {
285 BasicBlock *SChildChild = SChildInfo->Child;
286 if (SInfo->Size+Info[SChildChild].Size >= 2*SChildInfo->Size) {
287 SChildInfo->Ancestor = S;
288 SInfo->Child = SChild = SChildChild;
289 SChildInfo = &Info[SChild];
291 SChildInfo->Size = SInfo->Size;
292 S = SInfo->Ancestor = SChild;
294 SChild = SChildChild;
295 SChildInfo = &Info[SChild];
299 InfoRec &VInfo = Info[V];
300 SInfo->Label = WLabel;
302 assert(V != W && "The optimization here will not work in this case!");
303 unsigned WSize = WInfo.Size;
304 unsigned VSize = (VInfo.Size += WSize);
307 std::swap(S, VInfo.Child);
317 void DominatorTree::calculate(Function& F) {
318 BasicBlock* Root = Roots[0];
320 // Add a node for the root...
321 DomTreeNodes[Root] = RootNode = new DomTreeNode(Root, 0);
325 // Step #1: Number blocks in depth-first order and initialize variables used
326 // in later stages of the algorithm.
328 for (unsigned i = 0, e = Roots.size(); i != e; ++i)
329 N = DFSPass(Roots[i], Info[Roots[i]], 0);
331 for (unsigned i = N; i >= 2; --i) {
332 BasicBlock *W = Vertex[i];
333 InfoRec &WInfo = Info[W];
335 // Step #2: Calculate the semidominators of all vertices
336 for (pred_iterator PI = pred_begin(W), E = pred_end(W); PI != E; ++PI)
337 if (Info.count(*PI)) { // Only if this predecessor is reachable!
338 unsigned SemiU = Info[Eval(*PI)].Semi;
339 if (SemiU < WInfo.Semi)
343 Info[Vertex[WInfo.Semi]].Bucket.push_back(W);
345 BasicBlock *WParent = WInfo.Parent;
346 Link(WParent, W, WInfo);
348 // Step #3: Implicitly define the immediate dominator of vertices
349 std::vector<BasicBlock*> &WParentBucket = Info[WParent].Bucket;
350 while (!WParentBucket.empty()) {
351 BasicBlock *V = WParentBucket.back();
352 WParentBucket.pop_back();
353 BasicBlock *U = Eval(V);
354 IDoms[V] = Info[U].Semi < Info[V].Semi ? U : WParent;
358 // Step #4: Explicitly define the immediate dominator of each vertex
359 for (unsigned i = 2; i <= N; ++i) {
360 BasicBlock *W = Vertex[i];
361 BasicBlock *&WIDom = IDoms[W];
362 if (WIDom != Vertex[Info[W].Semi])
363 WIDom = IDoms[WIDom];
366 // Loop over all of the reachable blocks in the function...
367 for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
368 if (BasicBlock *ImmDom = getIDom(I)) { // Reachable block.
369 DomTreeNode *&BBNode = DomTreeNodes[I];
370 if (!BBNode) { // Haven't calculated this node yet?
371 // Get or calculate the node for the immediate dominator
372 DomTreeNode *IDomNode = getNodeForBlock(ImmDom);
374 // Add a new tree node for this BasicBlock, and link it as a child of
376 DomTreeNode *C = new DomTreeNode(I, IDomNode);
378 BBNode = IDomNode->addChild(C);
382 // Free temporary memory used to construct idom's
385 std::vector<BasicBlock*>().swap(Vertex);
390 void DominatorTreeBase::updateDFSNumbers()
393 // Iterate over all nodes in depth first order.
394 for (unsigned i = 0, e = Roots.size(); i != e; ++i)
395 for (df_iterator<BasicBlock*> I = df_begin(Roots[i]),
396 E = df_end(Roots[i]); I != E; ++I) {
398 DomTreeNode *BBNode = getNode(BB);
400 if (!BBNode->getIDom())
401 BBNode->assignDFSNumber(dfsnum);
408 /// isReachableFromEntry - Return true if A is dominated by the entry
409 /// block of the function containing it.
410 const bool DominatorTreeBase::isReachableFromEntry(BasicBlock* A) {
411 assert (!isPostDominator()
412 && "This is not implemented for post dominators");
413 return dominates(&A->getParent()->getEntryBlock(), A);
416 // dominates - Return true if A dominates B. THis performs the
417 // special checks necessary if A and B are in the same basic block.
418 bool DominatorTreeBase::dominates(Instruction *A, Instruction *B) {
419 BasicBlock *BBA = A->getParent(), *BBB = B->getParent();
420 if (BBA != BBB) return dominates(BBA, BBB);
422 // It is not possible to determine dominance between two PHI nodes
423 // based on their ordering.
424 if (isa<PHINode>(A) && isa<PHINode>(B))
427 // Loop through the basic block until we find A or B.
428 BasicBlock::iterator I = BBA->begin();
429 for (; &*I != A && &*I != B; ++I) /*empty*/;
431 if(!IsPostDominators) {
432 // A dominates B if it is found first in the basic block.
435 // A post-dominates B if B is found first in the basic block.
440 // DominatorTreeBase::reset - Free all of the tree node memory.
442 void DominatorTreeBase::reset() {
443 for (DomTreeNodeMapType::iterator I = DomTreeNodes.begin(),
444 E = DomTreeNodes.end(); I != E; ++I)
446 DomTreeNodes.clear();
453 /// findNearestCommonDominator - Find nearest common dominator basic block
454 /// for basic block A and B. If there is no such block then return NULL.
455 BasicBlock *DominatorTreeBase::findNearestCommonDominator(BasicBlock *A,
458 assert (!isPostDominator()
459 && "This is not implemented for post dominators");
460 assert (A->getParent() == B->getParent()
461 && "Two blocks are not in same function");
463 // If either A or B is a entry block then it is nearest common dominator.
464 BasicBlock &Entry = A->getParent()->getEntryBlock();
465 if (A == &Entry || B == &Entry)
468 // If B dominates A then B is nearest common dominator.
472 // If A dominates B then A is nearest common dominator.
476 DomTreeNode *NodeA = getNode(A);
477 DomTreeNode *NodeB = getNode(B);
479 // Collect NodeA dominators set.
480 SmallPtrSet<DomTreeNode*, 16> NodeADoms;
481 NodeADoms.insert(NodeA);
482 DomTreeNode *IDomA = NodeA->getIDom();
484 NodeADoms.insert(IDomA);
485 IDomA = IDomA->getIDom();
488 // Walk NodeB immediate dominators chain and find common dominator node.
489 DomTreeNode *IDomB = NodeB->getIDom();
491 if (NodeADoms.count(IDomB) != 0)
492 return IDomB->getBlock();
494 IDomB = IDomB->getIDom();
500 /// assignDFSNumber - Assign In and Out numbers while walking dominator tree
502 void DomTreeNode::assignDFSNumber(int num) {
503 std::vector<DomTreeNode *> workStack;
504 std::set<DomTreeNode *> visitedNodes;
506 workStack.push_back(this);
507 visitedNodes.insert(this);
508 this->DFSNumIn = num++;
510 while (!workStack.empty()) {
511 DomTreeNode *Node = workStack.back();
513 bool visitChild = false;
514 for (std::vector<DomTreeNode*>::iterator DI = Node->begin(),
515 E = Node->end(); DI != E && !visitChild; ++DI) {
516 DomTreeNode *Child = *DI;
517 if (visitedNodes.count(Child) == 0) {
519 Child->DFSNumIn = num++;
520 workStack.push_back(Child);
521 visitedNodes.insert(Child);
525 // If we reach here means all children are visited
526 Node->DFSNumOut = num++;
527 workStack.pop_back();
532 void DomTreeNode::setIDom(DomTreeNode *NewIDom) {
533 assert(IDom && "No immediate dominator?");
534 if (IDom != NewIDom) {
535 std::vector<DomTreeNode*>::iterator I =
536 std::find(IDom->Children.begin(), IDom->Children.end(), this);
537 assert(I != IDom->Children.end() &&
538 "Not in immediate dominator children set!");
539 // I am no longer your child...
540 IDom->Children.erase(I);
542 // Switch to new dominator
544 IDom->Children.push_back(this);
548 DomTreeNode *DominatorTree::getNodeForBlock(BasicBlock *BB) {
549 DomTreeNode *&BBNode = DomTreeNodes[BB];
550 if (BBNode) return BBNode;
552 // Haven't calculated this node yet? Get or calculate the node for the
553 // immediate dominator.
554 BasicBlock *IDom = getIDom(BB);
555 DomTreeNode *IDomNode = getNodeForBlock(IDom);
557 // Add a new tree node for this BasicBlock, and link it as a child of
559 DomTreeNode *C = new DomTreeNode(BB, IDomNode);
560 DomTreeNodes[BB] = C;
561 return BBNode = IDomNode->addChild(C);
564 static std::ostream &operator<<(std::ostream &o,
565 const DomTreeNode *Node) {
566 if (Node->getBlock())
567 WriteAsOperand(o, Node->getBlock(), false);
569 o << " <<exit node>>";
573 static void PrintDomTree(const DomTreeNode *N, std::ostream &o,
575 o << std::string(2*Lev, ' ') << "[" << Lev << "] " << N;
576 for (DomTreeNode::const_iterator I = N->begin(), E = N->end();
578 PrintDomTree(*I, o, Lev+1);
581 void DominatorTreeBase::print(std::ostream &o, const Module* ) const {
582 o << "=============================--------------------------------\n"
583 << "Inorder Dominator Tree:\n";
584 PrintDomTree(getRootNode(), o, 1);
587 void DominatorTreeBase::dump() {
591 bool DominatorTree::runOnFunction(Function &F) {
592 reset(); // Reset from the last time we were run...
593 Roots.push_back(&F.getEntryBlock());
598 //===----------------------------------------------------------------------===//
599 // DominanceFrontier Implementation
600 //===----------------------------------------------------------------------===//
602 char DominanceFrontier::ID = 0;
603 static RegisterPass<DominanceFrontier>
604 G("domfrontier", "Dominance Frontier Construction", true);
606 // NewBB is split and now it has one successor. Update dominace frontier to
607 // reflect this change.
608 void DominanceFrontier::splitBlock(BasicBlock *NewBB) {
610 assert(NewBB->getTerminator()->getNumSuccessors() == 1
611 && "NewBB should have a single successor!");
612 BasicBlock *NewBBSucc = NewBB->getTerminator()->getSuccessor(0);
614 std::vector<BasicBlock*> PredBlocks;
615 for (pred_iterator PI = pred_begin(NewBB), PE = pred_end(NewBB);
617 PredBlocks.push_back(*PI);
619 if (PredBlocks.empty())
620 // If NewBB does not have any predecessors then it is a entry block.
621 // In this case, NewBB and its successor NewBBSucc dominates all
625 DominatorTree &DT = getAnalysis<DominatorTree>();
626 bool NewBBDominatesNewBBSucc = true;
627 if (!DT.dominates(NewBB, NewBBSucc))
628 NewBBDominatesNewBBSucc = false;
630 // NewBBSucc inherites original NewBB frontier.
631 DominanceFrontier::iterator NewBBI = find(NewBB);
632 if (NewBBI != end()) {
633 DominanceFrontier::DomSetType NewBBSet = NewBBI->second;
634 DominanceFrontier::DomSetType NewBBSuccSet;
635 NewBBSuccSet.insert(NewBBSet.begin(), NewBBSet.end());
636 addBasicBlock(NewBBSucc, NewBBSuccSet);
639 // If NewBB dominates NewBBSucc, then DF(NewBB) is now going to be the
640 // DF(PredBlocks[0]) without the stuff that the new block does not dominate
642 if (NewBBDominatesNewBBSucc) {
643 DominanceFrontier::iterator DFI = find(PredBlocks[0]);
645 DominanceFrontier::DomSetType Set = DFI->second;
646 // Filter out stuff in Set that we do not dominate a predecessor of.
647 for (DominanceFrontier::DomSetType::iterator SetI = Set.begin(),
648 E = Set.end(); SetI != E;) {
649 bool DominatesPred = false;
650 for (pred_iterator PI = pred_begin(*SetI), E = pred_end(*SetI);
652 if (DT.dominates(NewBB, *PI))
653 DominatesPred = true;
660 if (NewBBI != end()) {
661 DominanceFrontier::DomSetType NewBBSet = NewBBI->second;
662 NewBBSet.insert(Set.begin(), Set.end());
664 addBasicBlock(NewBB, Set);
668 // DF(NewBB) is {NewBBSucc} because NewBB does not strictly dominate
669 // NewBBSucc, but it does dominate itself (and there is an edge (NewBB ->
670 // NewBBSucc)). NewBBSucc is the single successor of NewBB.
671 DominanceFrontier::DomSetType NewDFSet;
672 NewDFSet.insert(NewBBSucc);
673 addBasicBlock(NewBB, NewDFSet);
676 // Now we must loop over all of the dominance frontiers in the function,
677 // replacing occurrences of NewBBSucc with NewBB in some cases. All
678 // blocks that dominate a block in PredBlocks and contained NewBBSucc in
679 // their dominance frontier must be updated to contain NewBB instead.
681 for (Function::iterator FI = NewBB->getParent()->begin(),
682 FE = NewBB->getParent()->end(); FI != FE; ++FI) {
683 DominanceFrontier::iterator DFI = find(FI);
684 if (DFI == end()) continue; // unreachable block.
686 // Only consider dominators of NewBBSucc
687 if (!DFI->second.count(NewBBSucc)) continue;
689 bool BlockDominatesAny = false;
690 for (std::vector<BasicBlock*>::const_iterator BI = PredBlocks.begin(),
691 BE = PredBlocks.end(); BI != BE; ++BI) {
692 if (DT.dominates(FI, *BI)) {
693 BlockDominatesAny = true;
698 if (BlockDominatesAny) {
699 // If NewBBSucc should not stay in our dominator frontier, remove it.
700 // We remove it unless there is a predecessor of NewBBSucc that we
701 // dominate, but we don't strictly dominate NewBBSucc.
702 bool ShouldRemove = true;
703 if ((BasicBlock*)FI == NewBBSucc
704 || !DT.dominates(FI, NewBBSucc)) {
705 // Okay, we know that PredDom does not strictly dominate NewBBSucc.
706 // Check to see if it dominates any predecessors of NewBBSucc.
707 for (pred_iterator PI = pred_begin(NewBBSucc),
708 E = pred_end(NewBBSucc); PI != E; ++PI)
709 if (DT.dominates(FI, *PI)) {
710 ShouldRemove = false;
715 removeFromFrontier(DFI, NewBBSucc);
716 addToFrontier(DFI, NewBB);
725 class DFCalculateWorkObject {
727 DFCalculateWorkObject(BasicBlock *B, BasicBlock *P,
728 const DomTreeNode *N,
729 const DomTreeNode *PN)
730 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
731 BasicBlock *currentBB;
732 BasicBlock *parentBB;
733 const DomTreeNode *Node;
734 const DomTreeNode *parentNode;
738 const DominanceFrontier::DomSetType &
739 DominanceFrontier::calculate(const DominatorTree &DT,
740 const DomTreeNode *Node) {
741 BasicBlock *BB = Node->getBlock();
742 DomSetType *Result = NULL;
744 std::vector<DFCalculateWorkObject> workList;
745 SmallPtrSet<BasicBlock *, 32> visited;
747 workList.push_back(DFCalculateWorkObject(BB, NULL, Node, NULL));
749 DFCalculateWorkObject *currentW = &workList.back();
750 assert (currentW && "Missing work object.");
752 BasicBlock *currentBB = currentW->currentBB;
753 BasicBlock *parentBB = currentW->parentBB;
754 const DomTreeNode *currentNode = currentW->Node;
755 const DomTreeNode *parentNode = currentW->parentNode;
756 assert (currentBB && "Invalid work object. Missing current Basic Block");
757 assert (currentNode && "Invalid work object. Missing current Node");
758 DomSetType &S = Frontiers[currentBB];
760 // Visit each block only once.
761 if (visited.count(currentBB) == 0) {
762 visited.insert(currentBB);
764 // Loop over CFG successors to calculate DFlocal[currentNode]
765 for (succ_iterator SI = succ_begin(currentBB), SE = succ_end(currentBB);
767 // Does Node immediately dominate this successor?
768 if (DT[*SI]->getIDom() != currentNode)
773 // At this point, S is DFlocal. Now we union in DFup's of our children...
774 // Loop through and visit the nodes that Node immediately dominates (Node's
775 // children in the IDomTree)
776 bool visitChild = false;
777 for (DomTreeNode::const_iterator NI = currentNode->begin(),
778 NE = currentNode->end(); NI != NE; ++NI) {
779 DomTreeNode *IDominee = *NI;
780 BasicBlock *childBB = IDominee->getBlock();
781 if (visited.count(childBB) == 0) {
782 workList.push_back(DFCalculateWorkObject(childBB, currentBB,
783 IDominee, currentNode));
788 // If all children are visited or there is any child then pop this block
789 // from the workList.
797 DomSetType::const_iterator CDFI = S.begin(), CDFE = S.end();
798 DomSetType &parentSet = Frontiers[parentBB];
799 for (; CDFI != CDFE; ++CDFI) {
800 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
801 parentSet.insert(*CDFI);
806 } while (!workList.empty());
811 void DominanceFrontierBase::print(std::ostream &o, const Module* ) const {
812 for (const_iterator I = begin(), E = end(); I != E; ++I) {
813 o << " DomFrontier for BB";
815 WriteAsOperand(o, I->first, false);
817 o << " <<exit node>>";
818 o << " is:\t" << I->second << "\n";
822 void DominanceFrontierBase::dump() {