diff options
| author | Chris Lattner <sabre@nondot.org> | 2003-02-01 06:51:17 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2003-02-01 06:51:17 +0000 |
| commit | 706e7ab8710c8b4646a343472370dc6d79f30738 (patch) | |
| tree | a7767e14ab8ebfe79a2a597a6beb7ef7e85a5e5f /lib/Analysis/DataStructure | |
| parent | d4400c8297ea79a1b6950a9375aa94532e337f55 (diff) | |
Fix a bug where we would incorrectly delete globals which had edges to alive nodes in
a graph in the t-d pass. This slows down the TD pass by quite a bit (1/3), but is
needed for correctness.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5464 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure')
| -rw-r--r-- | lib/Analysis/DataStructure/DataStructure.cpp | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp index f1b6e420bb..2c9a75c9a8 100644 --- a/lib/Analysis/DataStructure/DataStructure.cpp +++ b/lib/Analysis/DataStructure/DataStructure.cpp @@ -973,9 +973,6 @@ static bool CanReachAliveNodes(DSNode *N, hash_set<DSNode*> &Alive, if (Visited.count(N)) return false; // Found a cycle Visited.insert(N); // No recursion, insert into Visited... - if (N->NodeType & DSNode::GlobalNode) - return false; // Global nodes will be marked on their own - for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize) if (CanReachAliveNodes(N->getLink(i).getNode(), Alive, Visited)) { N->markReachableNodes(Alive); |