diff options
| author | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2010-08-18 20:06:05 +0000 |
|---|---|---|
| committer | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2010-08-18 20:06:05 +0000 |
| commit | cf16bea74e3a6f84af914520562e9f9c5dfa0fad (patch) | |
| tree | 18e7a350b178e674b9823e8771b448b2a51dc4ba /include/llvm/ADT/DepthFirstIterator.h | |
| parent | 4d440bd786ae4dad7035c30fd09044a9efc8dccd (diff) | |
| download | external_llvm-cf16bea74e3a6f84af914520562e9f9c5dfa0fad.zip external_llvm-cf16bea74e3a6f84af914520562e9f9c5dfa0fad.tar.gz external_llvm-cf16bea74e3a6f84af914520562e9f9c5dfa0fad.tar.bz2 | |
Revert r111394. It was too aggressive.
We must complete the DFS, otherwise we might miss needed phi-defs, and
prematurely color live ranges with a non-dominating value.
This is not a big deal since we get to color more of the CFG and the next
mapValue call will be faster.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@111397 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/ADT/DepthFirstIterator.h')
| -rw-r--r-- | include/llvm/ADT/DepthFirstIterator.h | 9 |
1 files changed, 0 insertions, 9 deletions
diff --git a/include/llvm/ADT/DepthFirstIterator.h b/include/llvm/ADT/DepthFirstIterator.h index 3edb555..b9e5cbd 100644 --- a/include/llvm/ADT/DepthFirstIterator.h +++ b/include/llvm/ADT/DepthFirstIterator.h @@ -193,15 +193,6 @@ public: NodeType *getPath(unsigned n) const { return VisitStack[n].first.getPointer(); } - - /// skipChildren - Skip all children of Node, assuming that Node is on the - /// current path. This allows more aggressive pruning than just skipping - /// children of the current node. - _Self& skipChildren(NodeType *Node) { - while (!VisitStack.empty() && **this != Node) - VisitStack.pop_back(); - return skipChildren(); - } }; |