diff options
author | Daniel Berlin <dberlin@dberlin.org> | 2016-04-19 06:13:28 +0000 |
---|---|---|
committer | Daniel Berlin <dberlin@dberlin.org> | 2016-04-19 06:13:28 +0000 |
commit | 77fa84eadd926bd95b9893c9fba949eb01bd50be (patch) | |
tree | 694c10fefdab9f6ecc98d3353c87dfe7d0e0cc81 /llvm/lib/Analysis/IteratedDominanceFrontier.cpp | |
parent | de33d5901d59c473f2a1d84edcdc8ab6ac09ebd2 (diff) | |
download | bcm5719-llvm-77fa84eadd926bd95b9893c9fba949eb01bd50be.tar.gz bcm5719-llvm-77fa84eadd926bd95b9893c9fba949eb01bd50be.zip |
Correct IDF calculator for ReverseIDF
Summary:
Need to use predecessors for reverse graph, successors for forward graph.
succ_iterator/pred_iterator are not compatible, this patch is all the work necessary to work around that (which is what everywhere else does). Not sure if there is a better way, so cc'ing some random folks to take a gander :)
Reviewers: dblaikie, qcolombet, echristo
Subscribers: llvm-commits
Differential Revision: http://reviews.llvm.org/D18796
llvm-svn: 266718
Diffstat (limited to 'llvm/lib/Analysis/IteratedDominanceFrontier.cpp')
-rw-r--r-- | llvm/lib/Analysis/IteratedDominanceFrontier.cpp | 19 |
1 files changed, 14 insertions, 5 deletions
diff --git a/llvm/lib/Analysis/IteratedDominanceFrontier.cpp b/llvm/lib/Analysis/IteratedDominanceFrontier.cpp index 9f1edd21820..3ab6b5d6090 100644 --- a/llvm/lib/Analysis/IteratedDominanceFrontier.cpp +++ b/llvm/lib/Analysis/IteratedDominanceFrontier.cpp @@ -16,9 +16,10 @@ #include "llvm/IR/Dominators.h" #include <queue> -using namespace llvm; - -void IDFCalculator::calculate(SmallVectorImpl<BasicBlock *> &PHIBlocks) { +namespace llvm { +template <class NodeTy> +void IDFCalculator<NodeTy>::calculate( + SmallVectorImpl<BasicBlock *> &PHIBlocks) { // If we haven't computed dominator tree levels, do so now. if (DomLevels.empty()) { for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode()); @@ -61,8 +62,12 @@ void IDFCalculator::calculate(SmallVectorImpl<BasicBlock *> &PHIBlocks) { while (!Worklist.empty()) { DomTreeNode *Node = Worklist.pop_back_val(); BasicBlock *BB = Node->getBlock(); - - for (auto Succ : successors(BB)) { + // Succ is the successor in the direction we are calculating IDF, so it is + // successor for IDF, and predecessor for Reverse IDF. + for (auto SuccIter = GraphTraits<NodeTy>::child_begin(BB), + End = GraphTraits<NodeTy>::child_end(BB); + SuccIter != End; ++SuccIter) { + BasicBlock *Succ = *SuccIter; DomTreeNode *SuccNode = DT.getNode(Succ); // Quickly skip all CFG edges that are also dominator tree edges instead @@ -93,3 +98,7 @@ void IDFCalculator::calculate(SmallVectorImpl<BasicBlock *> &PHIBlocks) { } } } + +template class IDFCalculator<BasicBlock *>; +template class IDFCalculator<Inverse<BasicBlock *>>; +} |