ADCE is broken but at least we know why

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@656 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Transforms/Scalar/ADCE.cpp b/lib/Transforms/Scalar/ADCE.cpp
index dcf740e7f903a9d9b0e15c82dc7fd8ab86cf9199..631db2cea78368877aaadcd8acab6d4f8bd51b51 100644 (file)
--- a/lib/Transforms/Scalar/ADCE.cpp
+++ b/lib/Transforms/Scalar/ADCE.cpp
@@ -17,7 +17,7 @@
 #include <set>
 #include <algorithm>
 
-//#define DEBUG_ADCE 1
+#define DEBUG_ADCE 1
 
 //===----------------------------------------------------------------------===//
 // ADCE Class
@@ -184,6 +184,11 @@ bool ADCE::doADCE() {
        MadeChanges = true;
       }
       AliveBlocks.insert(E);
+
+      // Next we need to change any PHI nodes in the entry block to refer to the
+      // new predecessor node...
+
+
     } else {
       // We need to move the new entry block to be the first bb of the method.
       Method::iterator EBI = find(M->begin(), M->end(), EntryBlock);