2003-11-14 17:34:38 +00:00
< !DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
"http://www.w3.org/TR/html4/strict.dtd">
< html >
< head >
< title > Open LLVM Projects< / title >
< link rel = "stylesheet" href = "llvm.css" type = "text/css" >
< / head >
< body >
< div class = "doc_title" >
Open LLVM Projects
< / div >
2003-02-06 19:39:21 +00:00
< ul >
2003-11-14 17:34:38 +00:00
< li > < a href = "#what" > What is this?< / a > < / li >
2003-02-06 19:39:21 +00:00
< li > < a href = "#improving" > Improving the current system< / a >
< ol >
2004-05-28 20:41:37 +00:00
< li > < a href = "#code-cleanups" > Implementing Code Cleanup bugs< / a > < / li >
2003-11-14 17:34:38 +00:00
< li > < a href = "#glibc" > Port glibc to LLVM< / a > < / li >
< li > < a href = "#programs" > Compile programs with the LLVM Compiler< / a > < / li >
< li > < a href = "#llvm_ir" > Extend the LLVM intermediate representation< / a > < / li >
2004-11-07 01:03:59 +00:00
< li > < a href = "#target" > Target backend improvements< / a > < / li >
2003-11-14 17:34:38 +00:00
< li > < a href = "#misc_imp" > Miscellaneous Improvements< / a > < / li >
< / ol > < / li >
2003-02-06 19:39:21 +00:00
< li > < a href = "#new" > Adding new capabilities to LLVM< / a >
< ol >
2004-05-28 20:41:37 +00:00
< li > < a href = "#newfeaturebugs" > Implementing new feature PRs< / a > < / li >
2003-11-14 17:34:38 +00:00
< li > < a href = "#pointeranalysis" > Pointer and Alias Analysis< / a > < / li >
2004-09-06 22:35:43 +00:00
< li > < a href = "#profileguided" > Profile-Guided Optimization< / a > < / li >
2003-11-14 17:34:38 +00:00
< li > < a href = "#xforms" > New Transformations and Analyses< / a > < / li >
< li > < a href = "#x86be" > X86 Back-end Improvements< / a > < / li >
< li > < a href = "#misc_new" > Miscellaneous Additions< / a > < / li >
< / ol > < / li >
2003-02-06 19:39:21 +00:00
< / ul >
2004-05-23 21:06:21 +00:00
< div class = "doc_author" >
< p > Written by the < a href = "http://llvm.cs.uiuc.edu/" > LLVM Team< / a > < / p >
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< div class = "doc_section" >
< a name = "what" > What is this?< / a >
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
< p > 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.< / p >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< p > 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
2003-02-06 19:39:21 +00:00
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
2004-03-11 02:50:35 +00:00
or to suggest other projects to add to this page.
< / p >
2004-05-12 18:57:54 +00:00
< p > The projects in this page are open-ended. More specific projects are
filed as unassigned enhancements in the < a href = "http://llvm.cs.uiuc.edu/bugs/" >
2004-05-23 20:29:35 +00:00
LLVM bug tracker< / a > . See the < a href = "http://llvm.cs.uiuc.edu/bugs/buglist.cgi?keywords_type=allwords&keywords=&bug_status=NEW&bug_status=ASSIGNED&bug_status=REOPENED&bug_severity=enhancement&emailassigned_to1=1&emailtype1=substring&email1=unassigned" > list of currently outstanding issues< / a > if you wish to help improve LLVM.< / p >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< div class = "doc_section" >
< a name = "improving" > Improving the current system< / a >
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
< p > 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...< / p >
< / div >
2003-02-06 19:39:21 +00:00
2004-05-28 20:41:37 +00:00
<!-- ======================================================================= -->
< div class = "doc_subsection" >
< a name = "code-cleanups" > Implementing Code Cleanup bugs< / a >
< / div >
< div class = "doc_text" >
< p >
The < a href = "http://llvm.cs.uiuc.edu/bugs/" > LLVM bug tracker< / a > occasionally
2004-11-01 20:41:01 +00:00
has < a
href="http://llvm.cs.uiuc.edu/bugs/buglist.cgi?short_desc_type=allwordssubstr& short_desc=& long_desc_type=allwordssubstr& long_desc=& bug_file_loc_type=allwordssubstr& bug_file_loc=& status_whiteboard_type=allwordssubstr& status_whiteboard=& keywords_type=allwords& keywords=code-cleanup& bug_status=NEW& bug_status=ASSIGNED& bug_status=REOPENED& emailassigned_to1=1& emailtype1=substring& email1=& emailassigned_to2=1& emailreporter2=1& emailcc2=1& emailtype2=substring& email2=& bugidtype=include& bug_id=& votes=& changedin=& chfieldfrom=& chfieldto=Now& chfieldvalue=& cmdtype=doit& order=Bug+Number& field0-0-0=noop& type0-0-0=noop& value0-0-0=">"code-cleanup" bugs< / a > filed in it. Taking one of these and fixing it is a good
2004-05-28 20:41:37 +00:00
way to get your feet wet in the LLVM code and discover how some of its components
work.
< / p >
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
< a name = "glibc" > Port glibc to LLVM< / a >
< / div >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
< p > It would be very useful to < a
2004-06-22 04:24:55 +00:00
href="http://www.gnu.org/software/libc/manual/html_node/Porting.html">port< / a > < a
href="http://www.gnu.org/software/libc/">glibc< / a > to LLVM. This would allow a
2003-02-06 19:39:21 +00:00
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 < tt > stdio< / tt > related functions... low-level system calls like
2003-11-14 17:34:38 +00:00
'< tt > read< / tt > ' should stay unimplemented in LLVM.< / p >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
< a name = "programs" > Compile programs with the LLVM Compiler< / a >
< / div >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
< p > We are always looking for new testcases and benchmarks for use with LLVM. In
2003-02-06 19:39:21 +00:00
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 < a
href="http://mail.cs.uiuc.edu/pipermail/llvmbugs/">llvm-bugs< / a > 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
2003-02-07 19:25:35 +00:00
into CVS and the automated tester can use it to track progress of the
2003-11-14 17:34:38 +00:00
compiler.< / p >
2003-02-07 19:25:35 +00:00
2003-11-14 17:34:38 +00:00
< p > When testing a code, try running it with a variety of optimizations, and with
all the back-ends: CBE, llc, and lli.< / p >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
< a name = "llvm_ir" > Extend the LLVM intermediate representation< / a >
< / div >
< div class = "doc_text" >
2003-02-06 19:39:21 +00:00
< ol >
2003-11-14 17:34:38 +00:00
< li > Add support for platform-independent prefetch support. The GCC < a
2003-02-06 19:39:21 +00:00
href="http://gcc.gnu.org/projects/prefetch.html">prefetch project< / a > page
has a good survey of the prefetching capabilities of a variety of modern
2003-11-14 17:34:38 +00:00
processors.< / li >
2003-02-06 19:39:21 +00:00
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
2004-11-07 01:03:59 +00:00
<!-- ======================================================================= -->
< div class = "doc_subsection" >
< a name = "target" > Target backend improvements< / a >
< / div >
< div class = "doc_text" >
< ol >
< li > Find benchmarks either using our < a
href="http://llvm.cs.uiuc.edu/testresults/">test results< / a > or on your own,
where LLVM code generators do not produce optimal code or simply where another
compiler produces better code. Try to minimize the test case that
demonstrates the issue. Then, either < a
href="http://llvm.cs.uiuc.edu/bugs/">submit a bug< / a > with your testcase and
the code that LLVM produces vs. the code that it < em > should< / em > produce, or
even better, see if you can improve the code generator and submit a
patch.< / li >
< / ol >
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
< a name = "misc_imp" > Miscellaneous Improvements< / a >
< / div >
< div class = "doc_text" >
2003-02-06 19:39:21 +00:00
< ol >
2003-05-06 20:47:11 +00:00
< 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
2003-11-14 17:34:38 +00:00
< tt > gccld< / tt > .< / li >
< li > Rework the PassManager to be more flexible< / li >
2003-02-06 19:39:21 +00:00
< 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
which makes irreducible graphs reducible. This can easily be accomplished
through code duplication. See < a
href="http://citeseer.nj.nec.com/janssen97making.html">Making Graphs Reducible
with Controlled Node Splitting< / a > and perhaps < a
href="http://doi.acm.org/10.1145/262004.262005">Nesting of Reducible and
2003-11-14 17:34:38 +00:00
Irreducible Loops< / a > .< / li >
2003-02-06 19:39:21 +00:00
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< div class = "doc_section" >
< a name = "new" > Adding new capabilities to LLVM< / a >
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
2004-04-07 15:31:23 +00:00
< p > Sometimes creating new things is more fun than improving existing things.
2003-11-14 17:34:38 +00:00
These projects tend to be more involved and perhaps require more work, but can
also be very rewarding.< / p >
< / div >
2003-02-06 19:39:21 +00:00
2004-05-28 20:41:37 +00:00
<!-- ======================================================================= -->
< div class = "doc_subsection" >
< a name = "newfeaturebugs" > Implementing new feature PRs< / a >
< / div >
< div class = "doc_text" >
2004-11-01 20:41:01 +00:00
< p > Many ideas for feature requests are stored in LLVM bugzilla. Just < a
2004-11-07 01:03:59 +00:00
href="http://llvm.cs.uiuc.edu/bugs/buglist.cgi?short_desc_type=allwordssubstr& short_desc=& long_desc_type=allwordssubstr& long_desc=& bug_file_loc_type=allwordssubstr& bug_file_loc=& status_whiteboard_type=allwordssubstr& status_whiteboard=& keywords_type=allwords& keywords=new-feature& bug_status=UNCONFIRMED& bug_status=NEW& bug_status=ASSIGNED& bug_status=REOPENED& emailassigned_to1=1& emailtype1=substring& email1=& emailassigned_to2=1& emailreporter2=1& emailcc2=1& emailtype2=substring& email2=& bugidtype=include& bug_id=& votes=& changedin=& chfieldfrom=& chfieldto=Now& chfieldvalue=& cmdtype=doit& namedcmd=All+PRs& newqueryname=& order=Bug+Number& field0-0-0=noop& type0-0-0=noop& value0-0-0=">search for bugs with a "new-feature" keyword< / a > .< / p >
2004-05-28 20:41:37 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
< a name = "pointeranalysis" > Pointer and Alias Analysis< / a >
< / div >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
< 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 >
2003-02-06 19:39:21 +00:00
< ol >
< li > Implement a flow-sensitive context-sensitive alias analysis algorithm< br >
- Pick one of the somewhat efficient algorithms, but strive for maximum
2003-11-14 17:34:38 +00:00
precision< / li >
2003-06-25 14:31:06 +00:00
< li > Implement a flow-sensitive context-insensitive alias analysis algorithm< br >
2003-11-14 17:34:38 +00:00
- Just an efficient local algorithm perhaps?< / li >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< li > Implement alias-analysis-based optimizations:
2003-02-06 19:39:21 +00:00
< ul >
2003-11-14 17:34:38 +00:00
< li > ...< / li >
< / ul > < / li >
2003-02-06 19:39:21 +00:00
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
2004-09-06 22:35:43 +00:00
< a name = "profileguided" > Profile-Guided Optimization< / a >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
2003-11-14 17:34:38 +00:00
< div class = "doc_text" >
2004-03-08 22:29:35 +00:00
< p > We now have a unified infrastructure for writing profile-guided
transformations, which will work either at offline-compile-time or in the JIT,
but we don't have many transformations. We would welcome new profile-guided
transformations as well as improvements to the current profiling system.
< / p >
2003-02-06 19:39:21 +00:00
2004-09-06 22:35:43 +00:00
< p > Ideas for profile-guided transformations:< / p >
2003-02-06 19:39:21 +00:00
< ol >
2003-11-14 17:34:38 +00:00
< li > Superblock formation (with many optimizations)< / li >
< li > Loop unrolling/peeling< / li >
< li > Profile directed inlining< / li >
< li > Code layout< / li >
< li > ...< / li >
< / ol >
2003-02-06 19:39:21 +00:00
2004-03-08 22:29:35 +00:00
< p > Improvements to the existing support:< / p >
< ol >
< li > The current block and edge profiling code that gets inserted is very simple
and inefficient. Through the use of control-dependence information, many fewer
counters could be inserted into the code. Also, if the execution count of a
loop is known to be a compile-time or runtime constant, all of the counters in
the loop could be avoided.< / li >
< li > You could implement one of the "static profiling" algorithms which analyze a
piece of code an make educated guesses about the relative execution frequencies
of various parts of the code.< / li >
< li > You could add path profiling support, or adapt the existing LLVM path
profiling code to work with the generic profiling interfaces.< / li >
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_subsection" >
< a name = "xforms" > New Transformations and Analyses< / a >
< / div >
< div class = "doc_text" >
2003-02-06 19:39:21 +00:00
< ol >
2004-10-01 22:25:28 +00:00
< li > Implement < a href = "http://www.cs.purdue.edu/homes/vandrutj/" > GVN-PRE< / a > , a
powerful and simple Partial Redundancy Elimination algorithm for SSA form< / li >
2003-02-06 19:39:21 +00:00
< li > Implement a Dependence Analysis Infrastructure< br >
2003-11-14 17:34:38 +00:00
- Design some way to represent and query dep analysis< / li >
< li > Implement a strength reduction pass< / li >
< li > Value range propagation pass< / li >
2003-02-06 19:39:21 +00:00
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2003-11-14 17:34:38 +00:00
< div class = "doc_section" >
< a name = "x86be" > X86 Back-end Improvements< / a >
< / div >
< div class = "doc_text" >
2003-02-06 19:39:21 +00:00
< ol >
2003-11-14 17:34:38 +00:00
< li > Implement a better instruction selector< / li >
2003-04-28 03:42:31 +00:00
< li > Implement support for the "switch" instruction without requiring the
2003-11-14 17:34:38 +00:00
lower-switches pass.< / li >
2004-07-02 06:27:12 +00:00
< li > Implement interprocedural register allocation. The CallGraphSCCPass can be
used to implement a bottom-up analysis that will determine the *actual*
registers clobbered by a function. Use the pass to fine tune register usage
in callers based on *actual* registers used by the callee.< / li >
2003-02-06 19:39:21 +00:00
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- ======================================================================= -->
2004-03-11 21:26:29 +00:00
< div class = "doc_section" >
2003-11-14 17:34:38 +00:00
< a name = "misc_new" > Miscellaneous Additions< / a >
< / div >
< div class = "doc_text" >
2003-02-06 19:39:21 +00:00
< ol >
2004-07-12 21:10:47 +00:00
< li > Port the < a href = "http://www-sop.inria.fr/mimosa/fp/Bigloo/" > Bigloo< / A >
2004-04-07 15:31:23 +00:00
Scheme compiler, from Manuel Serrano at INRIA Sophia-Antipolis, to
output LLVM bytecode. It seems that it can already output .NET
bytecode, JVM bytecode, and C, so LLVM would ostensibly be another good
candidate.< / li >
2004-07-12 21:10:47 +00:00
< li > Write a new frontend for C/C++ < b > in< / b > C++, giving us the ability to
directly use LLVM C++ classes from within a compiler rather than use
C-based wrapper functions a la llvm-gcc. One possible starting point is the < a
href="http://www.parashift.com/c++-faq-lite/compiler-dependencies.html#faq-37.11">C++
yacc grammar by Ed Willink< / a > .< / li >
2004-04-07 15:31:23 +00:00
< li > Write a new frontend for some other language (Java? OCaml? Forth?)< / li >
2003-11-14 17:34:38 +00:00
< li > Write a new backend for a target (IA64? MIPS? MMIX?)< / li >
2004-04-16 16:55:30 +00:00
< li > Write a disassembler for machine code that would use TableGen to output
< tt > MachineInstr< / tt > s for transformations, optimizations, etc.< / li >
2004-03-10 19:15:50 +00:00
< li > Random test vector generator: Use a C grammar to generate random C code;
run it through llvm-gcc, then run a random set of passes on it using opt.
Try to crash opt. When opt crashes, use bugpoint to reduce the test case and
mail the result to yourself. Repeat ad infinitum.< / li >
2004-03-10 19:22:29 +00:00
< li > Design a simple, recognizable logo.< / li >
2004-10-01 18:36:22 +00:00
< li > Improve the usefulness and utility of the Skeleton target backend:
< ul >
< li > Convert the non-functional Skeleton target to become an abstract machine
target (choose some simple instructions, a register set, etc). This will
become a much more useful example of a backend since it would be a simple
2004-10-04 17:36:35 +00:00
but < em > functional< / em > backend. Examples of such architectures include MIX,
MMIX, < a
href="http://www.cs.cinvestav.mx/SC/prof_personal/adiaz/vhdl/DLX/">DLX< / a > ,
or come up with your own!< / li >
2004-10-01 18:36:22 +00:00
< li > Use the new Skeleton backend in the Interpreter: compile LLVM to Skeleton
target, and then interpret that code instead of LLVM. Performance win would
be the primary goal, as the number of registers would be a small constant
instead of unbounded, for example.< / li >
< / ul > < / li >
2003-02-06 19:39:21 +00:00
< / ol >
2003-11-14 17:34:38 +00:00
< / div >
2003-02-06 19:39:21 +00:00
<!-- *********************************************************************** -->
2003-11-14 17:34:38 +00:00
< hr >
2004-05-12 18:57:54 +00:00
< address >
< a href = "http://jigsaw.w3.org/css-validator/check/referer" > < img
src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!">< / a >
< a href = "http://validator.w3.org/check/referer" > < img
src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!">< / a >
< a href = "mailto:sabre@nondot.org" > Chris Lattner< / a > < br >
< a href = "http://llvm.cs.uiuc.edu" > LLVM Compiler Infrastructure< / a > < br >
2003-11-14 17:34:38 +00:00
Last modified: $Date$
2004-05-12 18:57:54 +00:00
< / address >
2003-11-14 17:34:38 +00:00
< / body >
< / html >
