Gitiles
Code Review Sign In
gerrit-public.fairphone.software / toolchain / llvm-project / 9d08818de93a8769f811c23809dad2a5b4d68e70 / . / llvm / docs / OpenProjects.html
blob: a840e8c6d754348c91b6cb96a8e2e3e34b6d7671 [file] [log] [blame]
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
2 "http://www.w3.org/TR/html4/strict.dtd">
3<html>
4<head>
5 <title>Open LLVM Projects</title>
6 <link rel="stylesheet" href="llvm.css" type="text/css">
7</head>
8<body>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]9
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]10<div class="doc_title">
11 Open LLVM Projects
12</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]13
14<ul>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]15 <li><a href="#what">What is this?</a></li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]16 <li><a href="#improving">Improving the current system</a>
17 <ol>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]18 <li><a href="#glibc">Port glibc to LLVM</a></li>
19 <li><a href="#NightlyTest">Improving the Nightly Tester</a></li>
20 <li><a href="#programs">Compile programs with the LLVM Compiler</a></li>
21 <li><a href="#llvm_ir">Extend the LLVM intermediate representation</a></li>
22 <li><a href="#misc_imp">Miscellaneous Improvements</a></li>
23 </ol></li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]24
25 <li><a href="#new">Adding new capabilities to LLVM</a>
26 <ol>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]27 <li><a href="#pointeranalysis">Pointer and Alias Analysis</a></li>
28 <li><a href="#profileguided">Profile Guided Optimization</a></li>
29 <li><a href="#xforms">New Transformations and Analyses</a></li>
30 <li><a href="#x86be">X86 Back-end Improvements</a></li>
31 <li><a href="#misc_new">Miscellaneous Additions</a></li>
32 </ol></li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]33</ul>
34
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]35<!-- *********************************************************************** -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]36<div class="doc_section">
37 <a name="what">What is this?</a>
38</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]39<!-- *********************************************************************** -->
40
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]41<div class="doc_text">
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]42
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]43<p>This document is meant to be a sort of "big TODO list" for LLVM. Each
44project in this document is something that would be useful for LLVM to have, and
45would also be a great way to get familiar with the system. Some of these
46projects are small and self-contained, which may be implemented in a couple of
47days, others are larger. Several of these projects may lead to interesting
48research projects in their own right. In any case, we welcome all
49contributions.</p>
50
51<p>If you are thinking about tackling one of these projects, please send a mail
52to the <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]53Developer's</a> mailing list, so that we know the project is being worked on.
54Additionally this is a good way to get more information about a specific project
Alkis Evlogimenos9d088182004-03-11 02:50:35 +0000[diff] [blame^]55or to suggest other projects to add to this page.
56</p>
57
58<p>The projects in this page are open ended. More specific projects are
59filed as unassigned enhancements in our <a href="http://llvm.cs.uiuc.edu/bugs/">
60LLVM bug tracker</a>. Here is the current list:
61</p>
62
63<iframe src="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" frameborder="1" align="center" width="100%" height="400">
64</iframe>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]65
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]66</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]67
68<!-- *********************************************************************** -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]69<div class="doc_section">
70 <a name="improving">Improving the current system</a>
71</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]72<!-- *********************************************************************** -->
73
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]74<div class="doc_text">
75
76<p>Improvements to the current infrastructure are always very welcome and tend
77to be fairly straight-forward to implement. Here are some of the key areas that
78can use improvement...</p>
79
80</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]81
82<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]83<div class="doc_subsection">
84 <a name="glibc">Port glibc to LLVM</a>
85</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]86
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]87<div class="doc_text">
88
89<p>It would be very useful to <a
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]90href="http://www.gnu.org/software/libc/porting.html">port</a> <a
91href="http://www.gnu.org/software/glibc/">glibc</a> to LLVM. This would allow a
92variety of interprocedural algorithms to be much more effective in the face of
93library calls. The most important pieces to port are things like the string
94library and the <tt>stdio</tt> related functions... low-level system calls like
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]95'<tt>read</tt>' should stay unimplemented in LLVM.</p>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]96
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]97</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]98
99<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]100<div class="doc_subsection">
101 <a name="NightlyTest">Improving the Nightly Tester</a>
102</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]103
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]104<div class="doc_text">
105
106<p>The <a href="/testresults/">Nightly Tester</a> is a simple perl script
107(located in <tt>utils/NightlyTest.pl</tt>) which runs every night to generate a
108daily report. It could use the following improvements:</p>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]109
110<ol>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]111<li>Regression tests - We should run the regression tests in addition to the
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]112 program tests...</li>
113</ol>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]114
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]115</div>
Chris Lattnerafc83ba2003-02-07 19:25:35 +0000[diff] [blame]116
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]117<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]118<div class="doc_subsection">
119 <a name="programs">Compile programs with the LLVM Compiler</a>
120</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]121
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]122<div class="doc_text">
123
124<p>We are always looking for new testcases and benchmarks for use with LLVM. In
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]125particular, it is useful to try compiling your favorite C source code with LLVM.
126If it doesn't compile, try to figure out why or report it to the <a
127href="http://mail.cs.uiuc.edu/pipermail/llvmbugs/">llvm-bugs</a> list. If you
128get the program to compile, it would be extremely useful to convert the build
129system to be compatible with the LLVM Programs testsuite so that we can check it
Chris Lattnerafc83ba2003-02-07 19:25:35 +0000[diff] [blame]130into CVS and the automated tester can use it to track progress of the
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]131compiler.</p>
Chris Lattnerafc83ba2003-02-07 19:25:35 +0000[diff] [blame]132
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]133<p>When testing a code, try running it with a variety of optimizations, and with
134all the back-ends: CBE, llc, and lli.</p>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]135
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]136</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]137
138<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]139<div class="doc_subsection">
140 <a name="llvm_ir">Extend the LLVM intermediate representation</a>
141</div>
142
143<div class="doc_text">
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]144
145<ol>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]146
147<li>Add a new conditional move instruction: <tt>X = select bool Cond, Y,
148 Z</tt></li>
149
150<li>Add support for platform-independent prefetch support. The GCC <a
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]151 href="http://gcc.gnu.org/projects/prefetch.html">prefetch project</a> page
152 has a good survey of the prefetching capabilities of a variety of modern
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]153 processors.</li>
154
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]155</ol>
156
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]157</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]158
159<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]160<div class="doc_subsection">
161 <a name="misc_imp">Miscellaneous Improvements</a>
162</div>
163
164<div class="doc_text">
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]165
166<ol>
Chris Lattner94809ee2003-05-06 20:47:11 +0000[diff] [blame]167<li>Someone needs to look into getting the <tt>ranlib</tt> tool to index LLVM
168 bytecode files, so that linking in .a files is not hideously slow. They
169 would also then have to implement the reader for this index in
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]170 <tt>gccld</tt>.</li>
Chris Lattner94809ee2003-05-06 20:47:11 +0000[diff] [blame]171
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]172<li>Rework the PassManager to be more flexible</li>
173
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]174<li>Some transformations and analyses only work on reducible flow graphs. It
175would be nice to have a transformation which could be "required" by these passes
176which makes irreducible graphs reducible. This can easily be accomplished
177through code duplication. See <a
178href="http://citeseer.nj.nec.com/janssen97making.html">Making Graphs Reducible
179with Controlled Node Splitting</a> and perhaps <a
180href="http://doi.acm.org/10.1145/262004.262005">Nesting of Reducible and
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]181Irreducible Loops</a>.</li>
182
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]183</ol>
184
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]185</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]186
187<!-- *********************************************************************** -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]188<div class="doc_section">
189 <a name="new">Adding new capabilities to LLVM</a>
190</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]191<!-- *********************************************************************** -->
192
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]193<div class="doc_text">
194
195<p>Sometimes creating new things is more fun that improving existing things.
196These projects tend to be more involved and perhaps require more work, but can
197also be very rewarding.</p>
198
199</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]200
201<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]202<div class="doc_subsection">
203 <a name="pointeranalysis">Pointer and Alias Analysis</a>
204</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]205
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]206<div class="doc_text">
207
208<p>We have a <a href="AliasAnalysis.html">strong base for development</a> of
209both pointer analysis based optimizations as well as pointer analyses
210themselves. It seems natural to want to take advantage of this...</p>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]211
212<ol>
213<li>Implement a flow-sensitive context-sensitive alias analysis algorithm<br>
214 - Pick one of the somewhat efficient algorithms, but strive for maximum
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]215 precision</li>
216
Chris Lattner0b3def42003-06-25 14:31:06 +0000[diff] [blame]217<li>Implement a flow-sensitive context-insensitive alias analysis algorithm<br>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]218 - Just an efficient local algorithm perhaps?</li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]219
220<li>Implement an interface to update analyses in response to common code motion
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]221 transformations</li>
222
223<li>Implement alias-analysis-based optimizations:
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]224 <ul>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]225 <li>Dead store elimination</li>
226 <li>...</li>
227 </ul></li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]228</ol>
229
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]230</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]231
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]232<!-- ======================================================================= -->
233<div class="doc_subsection">
234 <a name="profileguided">Profile Guided Optimization</a>
235</div>
236
237<div class="doc_text">
238
Chris Lattnerd6e1b282004-03-08 22:29:35 +0000[diff] [blame]239<p>We now have a unified infrastructure for writing profile-guided
240transformations, which will work either at offline-compile-time or in the JIT,
241but we don't have many transformations. We would welcome new profile-guided
242transformations as well as improvements to the current profiling system.
243</p>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]244
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]245<p>Ideas for profile guided transformations:</p>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]246
247<ol>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]248<li>Superblock formation (with many optimizations)</li>
249<li>Loop unrolling/peeling</li>
250<li>Profile directed inlining</li>
251<li>Code layout</li>
252<li>...</li>
253</ol>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]254
Chris Lattnerd6e1b282004-03-08 22:29:35 +0000[diff] [blame]255<p>Improvements to the existing support:</p>
256
257<ol>
258<li>The current block and edge profiling code that gets inserted is very simple
259and inefficient. Through the use of control-dependence information, many fewer
260counters could be inserted into the code. Also, if the execution count of a
261loop is known to be a compile-time or runtime constant, all of the counters in
262the loop could be avoided.</li>
263
264<li>You could implement one of the "static profiling" algorithms which analyze a
265piece of code an make educated guesses about the relative execution frequencies
266of various parts of the code.</li>
267
268<li>You could add path profiling support, or adapt the existing LLVM path
269profiling code to work with the generic profiling interfaces.</li>
270</ol>
271
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]272</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]273
274<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]275<div class="doc_subsection">
276 <a name="xforms">New Transformations and Analyses</a>
277</div>
278
279<div class="doc_text">
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]280
281<ol>
282<li>Implement a Dependence Analysis Infrastructure<br>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]283 - Design some way to represent and query dep analysis</li>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]284<li>Implement a strength reduction pass</li>
285<li>Value range propagation pass</li>
286<li>Implement an unswitching pass</li>
287<li>Write a loop unroller, with a simple heuristic for when to unroll</li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]288</ol>
289
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]290</div>
291
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]292<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]293<div class="doc_section">
294 <a name="x86be">X86 Back-end Improvements</a>
295</div>
296
297<div class="doc_text">
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]298
299<ol>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]300<li>Implement a global register allocator</li>
301<li>Implement a better instruction selector</li>
Chris Lattner50645812003-04-28 03:42:31 +0000[diff] [blame]302<li>Implement support for the "switch" instruction without requiring the
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]303 lower-switches pass.</li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]304</ol>
305
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]306</div>
307
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]308<!-- ======================================================================= -->
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]309<div class="doc_subsection">
310 <a name="misc_new">Miscellaneous Additions</a>
311</div>
312
313<div class="doc_text">
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]314
315<ol>
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]316<li>Write a new frontend for some language (Java? OCaml? Forth?)</li>
317<li>Write a new backend for a target (IA64? MIPS? MMIX?)</li>
Brian Gaeke53d25132004-03-10 19:15:50 +0000[diff] [blame]318<li>Random test vector generator: Use a C grammar to generate random C code;
319run it through llvm-gcc, then run a random set of passes on it using opt.
320Try to crash opt. When opt crashes, use bugpoint to reduce the test case and
321mail the result to yourself. Repeat ad infinitum.</li>
Misha Brukman12f1edd2004-03-10 19:22:29 +0000[diff] [blame]322<li>Design a simple, recognizable logo.</li>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]323</ol>
324
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]325</div>
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]326
327<!-- *********************************************************************** -->
Chris Lattner66f24702003-02-06 19:39:21 +0000[diff] [blame]328
Misha Brukmanc40257f2003-11-14 17:34:38 +0000[diff] [blame]329<hr>
330<div class="doc_footer">
331 <address><a href="mailto:sabre@nondot.org">Chris Lattner</a></address>
332 <a href="http://llvm.cs.uiuc.edu">The LLVM Compiler Infrastructure</a>
333 <br>
334 Last modified: $Date$
335</div>
336
337</body>
338</html>