Add some notes so I can throw away one of my many todo lists.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@14046 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/lib/Analysis/IPA/Andersens.cpp b/lib/Analysis/IPA/Andersens.cpp
index 371a8a0..8ccefe1 100644
--- a/lib/Analysis/IPA/Andersens.cpp
+++ b/lib/Analysis/IPA/Andersens.cpp
@@ -41,6 +41,12 @@
// pointers. If we find that an internal function's address escapes outside of
// the program, we update this assumption.
//
+// Future Improvements:
+// This implementation of Andersen's algorithm is extremely slow. To make it
+// scale reasonably well, the inclusion constraints could be sorted (easy),
+// offline variable substitution would be a huge win (straight-forward), and
+// online cycle elimination (trickier) might help as well.
+//
//===----------------------------------------------------------------------===//
#define DEBUG_TYPE "anders-aa"