Fix a major bug in the DFS calculation. Thanks for Christopher Lamb for pointing...
authorOwen Anderson <resistor@mac.com>
Mon, 31 Mar 2008 01:39:20 +0000 (01:39 +0000)
committerOwen Anderson <resistor@mac.com>
Mon, 31 Mar 2008 01:39:20 +0000 (01:39 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@48973 91177308-0d34-0410-b5e6-96231b3b80d8

lib/CodeGen/StrongPHIElimination.cpp

index 05b38bb9931cfe9fa1ef8e359d671118a7c74f90..0c785367168c270f338656c9b69607749cd4ec9e 100644 (file)
@@ -174,7 +174,7 @@ void StrongPHIElimination::computeDFS(MachineFunction& MF) {
     }
     
     bool inserted = false;
-    for (MachineDomTreeNode::iterator I = node->begin(), E = node->end();
+    for (MachineDomTreeNode::iterator I = currNode->begin(), E = currNode->end();
          I != E; ++I)
       if (!frontier.count(*I) && !visited.count(*I)) {
         worklist.push_back(*I);