Open LLVM Projects
This document is meant to be a sort of "big TODO list" for LLVM. Each project
in this document is something that would be useful for LLVM to have, and would
also be a great way to get familiar with the system. Some of these projects are
small and self-contained, which may be implemented in a couple of days, others
are larger. Several of these projects may lead to interesting research projects
in their own right. In any case, we welcome all contributions.
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.
Improvements to the current infrastructure are always very welcome and tend to
be fairly straight-forward to implement. Here are some of the key areas that
can use improvement...
It would be very useful to port glibc to LLVM. This would allow a
variety of interprocedural algorithms to be much more effective in the face of
library calls. The most important pieces to port are things like the string
library and the stdio related functions... low-level system calls like
'read' should stay unimplemented in LLVM.
The Nightly Tester is a simple perl script (located
in utils/NightlyTest.pl) which runs every night to generate a daily report. It
could use the following improvements:
- 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 necessary to add the script-fu to gnuplotize it.
- Regression tests - We should run the regression tests in addition to the
program tests...
We are always looking for new testcases and benchmarks for use with LLVM. In
particular, it is useful to try compiling your favorite C source code with LLVM.
If it doesn't compile, try to figure out why or report it to the llvm-bugs list. If you
get the program to compile, it would be extremely useful to convert the build
system to be compatible with the LLVM Programs testsuite so that we can check it
into CVS and the automated tester can use it to track progress of the
compiler.
When testing a code, try running it with a variety of optimizations, and with
all the back-ends: CBE, llc, and lli.
- Add a new conditional move instruction: X = select bool Cond, Y, Z
- Add support for platform independent prefetch support. The GCC prefetch project page
has a good survey of the prefetching capabilities of a variety of modern
processors.
- Someone needs to look into getting the ranlib 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
gccld.
- Improve the efficiency of the bytecode loader/writer
- Extend the FunctionPassManager to use a ModuleProvider to stream functions
in on demand. This would improve the efficiency of the JIT.
- Rework the PassManager to be more flexible
- 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.
Sometimes creating new things is more fun that improving existing things. These
projects tend to be more involved and perhaps require more work, but can also be
very rewarding.
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...
- 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 analysis 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:
- 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 an unswitching pass
- Write a loop unroller, with a simple heuristic for when to unroll
- Implement a global register allocator
- Implement a better instruction selector
- Implement support for the "switch" instruction without requiring the
lower-switches pass.
- Write a new frontend for some language (Java? OCaml? Forth?)
- Write a new backend for a target (IA64? MIPS? MMIX?)
Chris Lattner
Last modified: Wed Oct 1 16:48:54 CDT 2003