[llvm-commits] CVS: llvm/lib/Analysis/IPA/Andersens.cpp

[Chris Lattner]

Changes in directory llvm/lib/Analysis/IPA:

Andersens.cpp updated: 1.2 -> 1.3

---
Log message:

Add some notes so I can throw away one of my many todo lists.


---
Diffs of the changes:  (+6 -0)

Index: llvm/lib/Analysis/IPA/Andersens.cpp
diff -u llvm/lib/Analysis/IPA/Andersens.cpp:1.2 llvm/lib/Analysis/IPA/Andersens.cpp:1.3
--- llvm/lib/Analysis/IPA/Andersens.cpp:1.2	Thu May 27 15:57:01 2004
+++ llvm/lib/Analysis/IPA/Andersens.cpp	Sat Jun  5 15:12:36 2004
@@ -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"