Regress to not using the llvm namespace.

[oota-llvm.git] / docs / OpenProjects.html

diff --git a/docs/OpenProjects.html b/docs/OpenProjects.html
index 9b50d23b433daa64e7030b1dd97ce1fe75c67685..fbaa89438cc659aca1fcbc9519eab92c5a6dbe80 100644 (file)
--- a/docs/OpenProjects.html
+++ b/docs/OpenProjects.html
@@ -45,7 +45,9 @@ If you are thinking about tackling one of these projects, please send a mail to
 the <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM
 Developer's</a> mailing list, so that we know the project is being worked on.
 Additionally this is a good way to get more information about a specific project
-or to suggest other projects to add to this page.<p>
+or to suggest other projects to add to this page.  Another good place to
+look for ideas is the
+<a href="http://llvm.cs.uiuc.edu/bugs/">LLVM bug tracker</a>.<p>
 
 
 <!-- *********************************************************************** -->
@@ -92,7 +94,7 @@ could use the following improvements:<p>
 
 <li>Graphs - It would be great to have gnuplot graphs to keep track of how the
     tree is changing over time.  We already gather a several statistics, it
-    just neccesary to add the script-fu to gnuplotize it.
+    just necessary to add the script-fu to gnuplotize it.
 
 <li>Regression tests - We should run the regression tests in addition to the
     program tests...
@@ -127,10 +129,6 @@ all the back-ends: CBE, llc, and lli.<p>
 </b></font></td></tr></table><ul>
 
 <ol>
-<li>Transform <tt>setjmp</tt> and <tt>longjmp</tt> calls to use the LLVM
-    <tt>invoke</tt> mechanism.
-<li>Add support for a volatile attribute on loads and stores
-<li>Support for variable argument functions
 <li>Add a new conditional move instruction: <tt>X = select bool Cond, Y, Z</tt>
 <li>Add support for platform independent prefetch support.  The GCC <a
     href="http://gcc.gnu.org/projects/prefetch.html">prefetch project</a> page
@@ -147,8 +145,14 @@ all the back-ends: CBE, llc, and lli.<p>
 </b></font></td></tr></table><ul>
 
 <ol>
-<li>Improve the efficiency of the bytecode loader/writer, allow streaming lazy
-    loading of functions from the bytecode (for use by the JIT, for example)<br>
+<li>Someone needs to look into getting the <tt>ranlib</tt> tool to index LLVM
+    bytecode files, so that linking in .a files is not hideously slow.  They
+    would also then have to implement the reader for this index in
+    <tt>gccld</tt>.<br>
+
+<li>Improve the efficiency of the bytecode loader/writer<br>
+<li>Extend the FunctionPassManager to use a ModuleProvider to stream functions
+    in on demand.  This would improve the efficiency of the JIT.
 <li>Rework the PassManager to be more flexible
 <li>Some transformations and analyses only work on reducible flow graphs.  It
 would be nice to have a transformation which could be "required" by these passes
@@ -179,15 +183,15 @@ very rewarding.<p>
 <a name="pointeranalysis">Pointer and Alias Analysis
 </b></font></td></tr></table><ul>
 
-We have a strong base for development of both pointer analysis based
-optimizations as well as pointer analyses themselves.  It seems natural to want
-to take advantage of this...<p>
+We have a <a href="AliasAnalysis.html">strong base for development</a> of both
+pointer analysis based optimizations as well as pointer analyses themselves.  It
+seems natural to want to take advantage of this...<p>
 
 <ol>
 <li>Implement a flow-sensitive context-sensitive alias analysis algorithm<br>
   - Pick one of the somewhat efficient algorithms, but strive for maximum
     precision
-<li>Implement a flow-sensitive context-insensitive alias anlaysis algorithm<br>
+<li>Implement a flow-sensitive context-insensitive alias analysis algorithm<br>
   - Just an efficient local algorithm perhaps?
 
 <li>Implement an interface to update analyses in response to common code motion
@@ -195,15 +199,6 @@ to take advantage of this...<p>
 <li>Implement alias analysis based optimizations:
   <ul>
   <li>Dead store elimination
-  <li>Store+Reload or "store forwarding" elimination:<p>
-      Change:
-       <pre>
-        store int X, int* P
-        Y = load int* P</pre>
-      into:
-       <pre>
-        store int X, int *P
-        Y = X</pre>
   </ul>
 </ol>
 
@@ -245,8 +240,8 @@ Ideas for profile guided transformations:<p>
      - A linear time or nearly so algorithm
 <li>Implement a strength reduction pass
 <li>Value range propagation pass
-<li>Implement a tail recursion elimination pass
 <li>Implement an unswitching pass
+<li>Write a loop unroller, with a simple heuristic for when to unroll
 </ol>
 
 <!-- ======================================================================= -->
@@ -259,7 +254,6 @@ Ideas for profile guided transformations:<p>
 <ol>
 <li>Implement a global register allocator
 <li>Implement a better instruction selector
-<li>Implement a static compiler in addition to the JIT (easy project)
 <li>Implement support for the "switch" instruction without requiring the 
     lower-switches pass.
 </ol>
@@ -283,8 +277,10 @@ Ideas for profile guided transformations:<p>
 
 <hr><font size-1>
 <address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
+<a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
+<br>
 <!-- Created: Tue Aug  6 15:00:33 CDT 2002 -->
 <!-- hhmts start -->
-Last modified: Wed Feb 26 10:37:31 CST 2003
+Last modified: Mon Oct 27 12:00:00 CDT 2003
 <!-- hhmts end -->
 </font></body></html>