From 076438b633c6af211e006413dff74598c4cdef51 Mon Sep 17 00:00:00 2001 From: Misha Brukman Date: Fri, 14 Nov 2003 17:34:38 +0000 Subject: [PATCH] Stylesheets: they do a website good! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10003 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/OpenProjects.html | 358 ++++++++++++++++++++++------------------- 1 file changed, 196 insertions(+), 162 deletions(-) diff --git a/docs/OpenProjects.html b/docs/OpenProjects.html index fbaa89438cc..ebbf7b3e72b 100644 --- a/docs/OpenProjects.html +++ b/docs/OpenProjects.html @@ -1,159 +1,178 @@ - -Open LLVM Projects - - -

Open LLVM Projects

+ + + + Open LLVM Projects + + + + +

+ Open LLVM Projects +

What is this? +
What is this?
Improving the current system
+
Port glibc to LLVM
Improving the Nightly Tester
Compile programs with the LLVM Compiler
Extend the LLVM intermediate representation
Miscellaneous Improvements
Adding new capabilities to LLVM
+
Pointer and Alias Analysis
Profile Guided Optimization
New Transformations and Analyses
X86 Back-end Improvements
Miscellaneous Additions

-

- - -

-What is this? -

+ What is this? +

+ +

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 +

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. Another good place to -look for ideas is the -LLVM bug tracker.

+or to suggest other projects to add to this page. Another good place to look +for ideas is the LLVM bug +tracker.

-Improving the current system -

+ Improving the current system +

+ +

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...

+ +

- -Port glibc to LLVM -

+ Port glibc to LLVM +

+ +

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.

+'read' should stay unimplemented in LLVM.

- -Improving the Nightly Tester -

+ 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. +
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:
+
1. 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. + just necessary to add the script-fu to gnuplotize it.
2. Regression tests - We should run the regression tests in addition to the - program tests... -
+ program tests...

- -Compile programs with the LLVM Compiler -

+ Compile programs with the LLVM Compiler +

+ +

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.

+compiler.

-When testing a code, try running it with a variety of optimizations, and with -all the back-ends: CBE, llc, and lli.

When testing a code, try running it with a variety of optimizations, and with +all the back-ends: CBE, llc, and lli.

- -Extend the LLVM intermediate representation -

+ Extend the LLVM intermediate representation +

Add a new conditional move instruction: X = select bool Cond, Y, Z -
Add support for platform independent prefetch support. The GCC 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. + processors.

- -Miscellaneous Improvements -

+ Miscellaneous Improvements +

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.
+ gccld.
Improve the efficiency of the bytecode loader/writer
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 + 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 @@ -161,126 +180,141 @@ through code duplication. See Making Graphs Reducible with Controlled Node Splitting and perhaps Nesting of Reducible and -Irreducible Loops. +Irreducible Loops.

-Adding new capabilities to LLVM -

+ Adding new capabilities to LLVM +

+ +

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.

+ +

- -Pointer and Alias Analysis -

+ Pointer and Alias Analysis +

strong base for development

+ +

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 + precision
Implement a flow-sensitive context-insensitive alias analysis algorithm
- - Just an efficient local algorithm perhaps? + - Just an efficient local algorithm perhaps?
Implement an interface to update analyses in response to common code motion - transformations -
Implement alias analysis based optimizations: + transformations
Implement alias-analysis-based optimizations:
- Dead store elimination -
+
Dead store elimination
...

+ + - -

- -Profile Guided Optimization -

+ Profile Guided Optimization +

+ +

We are getting to the point where we really need a unified infrastructure for profile guided optimizations. It would be wonderful to be able to write profile guided transformations which can be performed either at static compile time (compile time or offline optimization time) or at runtime in a JIT type setup. -The LLVM transformation itself shouldn't need to know how it is being used.

+The LLVM transformation itself shouldn't need to know how it is being used.

-Ideas for profile guided transformations:

Ideas for profile guided transformations:

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

Superblock formation (with many optimizations)

Loop unrolling/peeling

Profile directed inlining

Code layout

...

+ +

- -New Transformations and Analyses -

+ New Transformations and Analyses +

Implement a Dependence Analysis Infrastructure
- - Design some way to represent and query dep analysis + - 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 + - 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

- -X86 Back-end Improvements -

+ X86 Back-end Improvements +

Implement a global register allocator -
Implement a better instruction selector +
Implement a global register allocator
Implement a better instruction selector
Implement support for the "switch" instruction without requiring the - lower-switches pass. + lower-switches pass.

- -Miscellaneous Additions -

+ Miscellaneous Additions +

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

- -

Chris Lattner

-The LLVM Compiler Infrastructure -
- - -Last modified: Mon Oct 27 12:00:00 CDT 2003 - - +

Chris Lattner

+ The LLVM Compiler Infrastructure +
+ Last modified: $Date$ +

+ + + -- 2.34.1