aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDevang Patel <dpatel@apple.com>2006-09-14 01:27:42 +0000
committerDevang Patel <dpatel@apple.com>2006-09-14 01:27:42 +0000
commit57d12f962d5af0c23283e0a129b95b106a517e46 (patch)
tree05e31488da9abe9c753e7073c758035dabffd19a
parent08c33011d1443ce3e12b6c4026cde975b24c8e37 (diff)
Avoid recursion in assignDFSNumber(). Move def from ET-Forest.h
to Dominators.h git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30309 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--include/llvm/Analysis/ET-Forest.h11
-rw-r--r--lib/VMCore/Dominators.cpp33
2 files changed, 34 insertions, 10 deletions
diff --git a/include/llvm/Analysis/ET-Forest.h b/include/llvm/Analysis/ET-Forest.h
index b05776a9e0..ef2b2155c7 100644
--- a/include/llvm/Analysis/ET-Forest.h
+++ b/include/llvm/Analysis/ET-Forest.h
@@ -250,16 +250,7 @@ public:
return this->Below(other);
}
- void assignDFSNumber(int &num) {
- DFSNumIn = num++;
-
- if (Son) {
- Son->assignDFSNumber(num);
- for (ETNode *son = Son->Right; son != Son; son = son->Right)
- son->assignDFSNumber(num);
- }
- DFSNumOut = num++;
- }
+ void assignDFSNumber(int &);
bool hasFather() const {
return Father != NULL;
diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp
index 9f7e5d9365..fd193b8d7a 100644
--- a/lib/VMCore/Dominators.cpp
+++ b/lib/VMCore/Dominators.cpp
@@ -890,6 +890,39 @@ void ETForest::calculate(const ImmediateDominators &ID) {
updateDFSNumbers ();
}
+// Walk ETNode and its children using DFS algorithm and assign
+// DFSNumIn and DFSNumOut numbers for each node.
+void ETNode::assignDFSNumber(int &num) {
+
+ std::vector<ETNode *> DFSInStack;
+ std::set<ETNode *> visited;
+
+ DFSInStack.push_back(this);
+
+ visited.insert(this);
+
+ while(!DFSInStack.empty()) {
+ ETNode *Parent = DFSInStack.back();
+ DFSInStack.pop_back();
+ Parent->DFSNumIn = num++;
+ Parent->DFSNumOut = Parent->DFSNumIn + 1;
+
+ ETNode *son = Parent->Son;
+ if (son && visited.count(son) == 0) {
+
+ DFSInStack.push_back(son);
+ son->DFSNumIn = Parent->DFSNumIn + 1;
+ visited.insert(son);
+
+ for (ETNode *s = son->Right; s != son; s = s->Right) {
+ DFSInStack.push_back(s);
+ s->DFSNumIn = Parent->DFSNumIn + 1;
+ visited.insert(s);
+ }
+ }
+ }
+}
+
//===----------------------------------------------------------------------===//
// ETForestBase Implementation
//===----------------------------------------------------------------------===//