From: Chris Lattner Date: Thu, 6 Feb 2003 19:39:21 +0000 (+0000) Subject: New "open projects" document X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=b71310982a1782f435e3836c8b9bdc489d4135e2;p=llvm New "open projects" document git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5497 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/docs/OpenProjects.html b/docs/OpenProjects.html new file mode 100644 index 00000000000..b79c0aae92e --- /dev/null +++ b/docs/OpenProjects.html @@ -0,0 +1,287 @@ + +Open LLVM Projects + + +

Open LLVM Projects

+ +

What is this? +
Improving the current system +
+ +
Adding new capabilities to LLVM +
+

+ +

+ + + +

+What is this? +

+ +If you are thinking about tackling one of these projects, please send a mail to +the LLVM +Developer's 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.

+ + + +

+Improving the current system +

+ + +

+ +Port glibc to LLVM +

port

glibc

stdio

read

+ + + +

+ +Improving the Nightly Tester +

Nightly Tester

+ +

Olden timings - Time the compilation and execution times for the Olden + benchmark suite, keeping track of these values over time. + +
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. + +
Regression tests - We should run the regression tests in addition to the + program tests... +

+ + +

+ +Compile programs with the LLVM Compiler +

llvm-bugs

+ +Extend the LLVM intermediate representation +

Transform setjmp and longjmp calls to use the LLVM + invoke mechanism. +
Add support for a volatile attribute on loads and stores +
Support for variable argument functions +
Add a new conditional move instruction: X = select bool Cond, Y, Z +
Add support for platform independant prefetch support. The GCC prefetch project page + has a good survey of the prefetching capabilities of a variety of modern + processors. +

+ +Miscellaneous Improvements +

Improve the efficiency of the bytecode loader/writer, allow streaming lazy + loading of functions from the bytecode (for use by the JIT, for example)
+
Rework the PassManager +
Do not encode zero intializers for large arrays into the bytecode + +
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 +which makes irreducible graphs reducible. This can easily be accomplished +through code duplication. See Making Graphs Reducible +with Controlled Node Splitting and perhaps Nesting of Reducible and +Irreducible Loops. +

+Adding new capabilities to LLVM +

+ + +

+ +Pointer and Alias Analysis +

+ +

Implement a flow-sensitive context-sensitive alias analysis algorithm
+ - Pick one of the somewhat efficient algorithms, but strive for maximum + precision +
Implement a flow-sensitive context-insensitive alias anlaysis algorithm
+ - Just an efficient local algorithm perhaps? + +
Implement an interface to update analyses in response to common code motion + transformations +
Implement alias analysis based optimizations: +
- Dead store elimination +
- Location invariant Code Motion (LcICM) +
- Store+Reload or "store forwarding" elimination:
  + Change: +
```
+        store int X, int* P
+        Y = load int* P
```
  + into: +
```
+        store int X, int *P
+        Y = X
```
  +
- Register promotion (move loads and stores out of loop bodies, for example) +
+

+ +Profile Guided Optimization +

+ +Ideas for profile guided transformations:

+ +

Superblock formation (with many optimizations) +
Loop unrolling/peeling +
Profile directed inlining +
Code layout +
... +

+ + + +

+ +New Transformations and Analyses +

Implement a Dependence Analysis Infrastructure
+ - Design some way to represent and query dep analysis +
Implement a faster Dominator Set Construction Algorithm
+ - A linear time or nearly so algorithm +
Implement a strength reduction pass +
Value range propagation pass +
Implement a tail recursion elimination pass +
Implement an unswitching pass +

+ +X86 Back-end Improvements +

Implement a global register allocator +
Implement a better instruction selector +
Implement a static compiler in addition to the JIT (easy project) +

+ +Miscellaneous Additions +

Write a new frontend for some language (Java? OCaml? Forth?) +
Write a new backend for a target (IA64? MIPS? MMIX?) +

+ + +

Chris Lattner

+ + +Last modified: Thu Feb 6 13:38:41 CST 2003 + +