diff options
| author | Daniel Berlin <dberlin@dberlin.org> | 2017-02-09 20:37:46 +0000 |
|---|---|---|
| committer | Daniel Berlin <dberlin@dberlin.org> | 2017-02-09 20:37:46 +0000 |
| commit | 61d13b1c02c0f32e99a169158868716eb437560b (patch) | |
| tree | 57799d767374b9ddc072b5c15148f2a72b849a46 /lib/Analysis/IteratedDominanceFrontier.cpp | |
| parent | c0fb95811ad7a3a6391aaba608ea0cd867b50006 (diff) | |
Drop graph_ prefix
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@294621 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/IteratedDominanceFrontier.cpp')
| -rw-r--r-- | lib/Analysis/IteratedDominanceFrontier.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Analysis/IteratedDominanceFrontier.cpp b/lib/Analysis/IteratedDominanceFrontier.cpp index 27249664bce..2a736ec0379 100644 --- a/lib/Analysis/IteratedDominanceFrontier.cpp +++ b/lib/Analysis/IteratedDominanceFrontier.cpp @@ -64,7 +64,7 @@ void IDFCalculator<NodeTy>::calculate( BasicBlock *BB = Node->getBlock(); // Succ is the successor in the direction we are calculating IDF, so it is // successor for IDF, and predecessor for Reverse IDF. - for (auto *Succ : graph_children<NodeTy>(BB)) { + for (auto *Succ : children<NodeTy>(BB)) { DomTreeNode *SuccNode = DT.getNode(Succ); // Quickly skip all CFG edges that are also dominator tree edges instead |