Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / llvm / b3366bc37e81a27d2d830df61fc1425c78523eac / . / docs / OpenProjects.html
blob: cc0f133d9a2c3fd0a3dc9bdc8c8b0de02c3067f7 [file] [log] [blame]
Misha Brukman076438b2003-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 Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]9
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]10<div class="doc_title">
11 Open LLVM Projects
12</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]13
14<ul>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]15 <li><a href="#what">What is this?</a></li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]16 <li><a href="#improving">Improving the current system</a>
17 <ol>
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]18 <li><a href="#code-cleanups">Implementing Code Cleanup bugs</a></li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]19 <li><a href="#glibc">Port glibc to LLVM</a></li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]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 Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]24
25 <li><a href="#new">Adding new capabilities to LLVM</a>
26 <ol>
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]27 <li><a href="#newfeaturebugs">Implementing new feature PRs</a></li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]28 <li><a href="#pointeranalysis">Pointer and Alias Analysis</a></li>
29 <li><a href="#profileguided">Profile Guided Optimization</a></li>
30 <li><a href="#xforms">New Transformations and Analyses</a></li>
31 <li><a href="#x86be">X86 Back-end Improvements</a></li>
32 <li><a href="#misc_new">Miscellaneous Additions</a></li>
33 </ol></li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]34</ul>
35
Chris Lattner97d49ef2004-05-23 21:06:21 +0000[diff] [blame]36<div class="doc_author">
37 <p>Written by the <a href="http://llvm.cs.uiuc.edu/">LLVM Team</a></p>
38</div>
39
40
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]41<!-- *********************************************************************** -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]42<div class="doc_section">
43 <a name="what">What is this?</a>
44</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]45<!-- *********************************************************************** -->
46
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]47<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]48
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]49<p>This document is meant to be a sort of "big TODO list" for LLVM. Each
50project in this document is something that would be useful for LLVM to have, and
51would also be a great way to get familiar with the system. Some of these
52projects are small and self-contained, which may be implemented in a couple of
53days, others are larger. Several of these projects may lead to interesting
54research projects in their own right. In any case, we welcome all
55contributions.</p>
56
57<p>If you are thinking about tackling one of these projects, please send a mail
58to the <a href="http://mail.cs.uiuc.edu/mailman/listinfo/llvmdev">LLVM
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]59Developer's</a> mailing list, so that we know the project is being worked on.
60Additionally this is a good way to get more information about a specific project
Alkis Evlogimenos45ff0272004-03-11 02:50:35 +0000[diff] [blame]61or to suggest other projects to add to this page.
62</p>
63
Misha Brukman836db502004-05-12 18:57:54 +0000[diff] [blame]64<p>The projects in this page are open-ended. More specific projects are
65filed as unassigned enhancements in the <a href="http://llvm.cs.uiuc.edu/bugs/">
Chris Lattner9f57b182004-05-23 20:29:35 +0000[diff] [blame]66LLVM bug tracker</a>. See the <a href="http://llvm.cs.uiuc.edu/bugs/buglist.cgi?keywords_type=allwords&amp;keywords=&amp;bug_status=NEW&amp;bug_status=ASSIGNED&amp;bug_status=REOPENED&amp;bug_severity=enhancement&amp;emailassigned_to1=1&amp;emailtype1=substring&amp;email1=unassigned">list of currently outstanding issues</a> if you wish to help improve LLVM.</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]67
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]68</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]69
70<!-- *********************************************************************** -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]71<div class="doc_section">
72 <a name="improving">Improving the current system</a>
73</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]74<!-- *********************************************************************** -->
75
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]76<div class="doc_text">
77
78<p>Improvements to the current infrastructure are always very welcome and tend
79to be fairly straight-forward to implement. Here are some of the key areas that
80can use improvement...</p>
81
82</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]83
84<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]85<div class="doc_subsection">
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]86 <a name="code-cleanups">Implementing Code Cleanup bugs</a>
87</div>
88
89<div class="doc_text">
90
91<p>
92The <a href="http://llvm.cs.uiuc.edu/bugs/">LLVM bug tracker</a> occasionally
93has <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
94way to get your feet wet in the LLVM code and discover how some of its components
95work.
96</p>
97
98</div>
99
100<!-- ======================================================================= -->
101<div class="doc_subsection">
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]102 <a name="glibc">Port glibc to LLVM</a>
103</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]104
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]105<div class="doc_text">
106
107<p>It would be very useful to <a
Tanya Lattner09cf73c2004-06-22 04:24:55 +0000[diff] [blame]108href="http://www.gnu.org/software/libc/manual/html_node/Porting.html">port</a> <a
109href="http://www.gnu.org/software/libc/">glibc</a> to LLVM. This would allow a
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]110variety of interprocedural algorithms to be much more effective in the face of
111library calls. The most important pieces to port are things like the string
112library and the <tt>stdio</tt> related functions... low-level system calls like
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]113'<tt>read</tt>' should stay unimplemented in LLVM.</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]114
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]115</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]116
117<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]118<div class="doc_subsection">
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]119 <a name="programs">Compile programs with the LLVM Compiler</a>
120</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]121
Misha Brukman076438b2003-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 Lattnerb7131092003-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 Lattner1b360042003-02-07 19:25:35 +0000[diff] [blame]130into CVS and the automated tester can use it to track progress of the
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]131compiler.</p>
Chris Lattner1b360042003-02-07 19:25:35 +0000[diff] [blame]132
Misha Brukman076438b2003-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 Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]135
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]136</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]137
138<!-- ======================================================================= -->
Misha Brukman076438b2003-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 Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]144
145<ol>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]146<li>Add support for platform-independent prefetch support. The GCC <a
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]147 href="http://gcc.gnu.org/projects/prefetch.html">prefetch project</a> page
148 has a good survey of the prefetching capabilities of a variety of modern
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]149 processors.</li>
150
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]151</ol>
152
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]153</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]154
155<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]156<div class="doc_subsection">
157 <a name="misc_imp">Miscellaneous Improvements</a>
158</div>
159
160<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]161
162<ol>
Chris Lattner8bde96f2003-05-06 20:47:11 +0000[diff] [blame]163<li>Someone needs to look into getting the <tt>ranlib</tt> tool to index LLVM
164 bytecode files, so that linking in .a files is not hideously slow. They
165 would also then have to implement the reader for this index in
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]166 <tt>gccld</tt>.</li>
Chris Lattner8bde96f2003-05-06 20:47:11 +0000[diff] [blame]167
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]168<li>Rework the PassManager to be more flexible</li>
169
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]170<li>Some transformations and analyses only work on reducible flow graphs. It
171would be nice to have a transformation which could be "required" by these passes
172which makes irreducible graphs reducible. This can easily be accomplished
173through code duplication. See <a
174href="http://citeseer.nj.nec.com/janssen97making.html">Making Graphs Reducible
175with Controlled Node Splitting</a> and perhaps <a
176href="http://doi.acm.org/10.1145/262004.262005">Nesting of Reducible and
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]177Irreducible Loops</a>.</li>
178
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]179</ol>
180
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]181</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]182
183<!-- *********************************************************************** -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]184<div class="doc_section">
185 <a name="new">Adding new capabilities to LLVM</a>
186</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]187<!-- *********************************************************************** -->
188
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]189<div class="doc_text">
190
Brian Gaeke2d261352004-04-07 15:31:23 +0000[diff] [blame]191<p>Sometimes creating new things is more fun than improving existing things.
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]192These projects tend to be more involved and perhaps require more work, but can
193also be very rewarding.</p>
194
195</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]196
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]197
198<!-- ======================================================================= -->
199<div class="doc_subsection">
200 <a name="newfeaturebugs">Implementing new feature PRs</a>
201</div>
202
203<div class="doc_text">
204
205<p>Many ideas for feature requests are stored in LLVM bugzilla. Just <a href="http://llvm.org/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>
206
207</div>
208
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]209<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]210<div class="doc_subsection">
211 <a name="pointeranalysis">Pointer and Alias Analysis</a>
212</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]213
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]214<div class="doc_text">
215
216<p>We have a <a href="AliasAnalysis.html">strong base for development</a> of
217both pointer analysis based optimizations as well as pointer analyses
218themselves. It seems natural to want to take advantage of this...</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]219
220<ol>
221<li>Implement a flow-sensitive context-sensitive alias analysis algorithm<br>
222 - Pick one of the somewhat efficient algorithms, but strive for maximum
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]223 precision</li>
224
Chris Lattnerf56703b2003-06-25 14:31:06 +0000[diff] [blame]225<li>Implement a flow-sensitive context-insensitive alias analysis algorithm<br>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]226 - Just an efficient local algorithm perhaps?</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]227
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]228<li>Implement alias-analysis-based optimizations:
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]229 <ul>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]230 <li>Dead store elimination</li>
231 <li>...</li>
232 </ul></li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]233</ol>
234
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]235</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]236
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]237<!-- ======================================================================= -->
238<div class="doc_subsection">
239 <a name="profileguided">Profile Guided Optimization</a>
240</div>
241
242<div class="doc_text">
243
Chris Lattnera5422e42004-03-08 22:29:35 +0000[diff] [blame]244<p>We now have a unified infrastructure for writing profile-guided
245transformations, which will work either at offline-compile-time or in the JIT,
246but we don't have many transformations. We would welcome new profile-guided
247transformations as well as improvements to the current profiling system.
248</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]249
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]250<p>Ideas for profile guided transformations:</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]251
252<ol>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]253<li>Superblock formation (with many optimizations)</li>
254<li>Loop unrolling/peeling</li>
255<li>Profile directed inlining</li>
256<li>Code layout</li>
257<li>...</li>
258</ol>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]259
Chris Lattnera5422e42004-03-08 22:29:35 +0000[diff] [blame]260<p>Improvements to the existing support:</p>
261
262<ol>
263<li>The current block and edge profiling code that gets inserted is very simple
264and inefficient. Through the use of control-dependence information, many fewer
265counters could be inserted into the code. Also, if the execution count of a
266loop is known to be a compile-time or runtime constant, all of the counters in
267the loop could be avoided.</li>
268
269<li>You could implement one of the "static profiling" algorithms which analyze a
270piece of code an make educated guesses about the relative execution frequencies
271of various parts of the code.</li>
272
273<li>You could add path profiling support, or adapt the existing LLVM path
274profiling code to work with the generic profiling interfaces.</li>
275</ol>
276
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]277</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]278
279<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]280<div class="doc_subsection">
281 <a name="xforms">New Transformations and Analyses</a>
282</div>
283
284<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]285
286<ol>
287<li>Implement a Dependence Analysis Infrastructure<br>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]288 - Design some way to represent and query dep analysis</li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]289<li>Implement a strength reduction pass</li>
290<li>Value range propagation pass</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]291</ol>
292
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]293</div>
294
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]295<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]296<div class="doc_section">
297 <a name="x86be">X86 Back-end Improvements</a>
298</div>
299
300<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]301
302<ol>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]303<li>Implement a better instruction selector</li>
Chris Lattner99df25f2003-04-28 03:42:31 +0000[diff] [blame]304<li>Implement support for the "switch" instruction without requiring the
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]305 lower-switches pass.</li>
Reid Spencer750c4252004-07-02 06:27:12 +0000[diff] [blame]306<li>Implement interprocedural register allocation. The CallGraphSCCPass can be
307 used to implement a bottom-up analysis that will determine the *actual*
308 registers clobbered by a function. Use the pass to fine tune register usage
309 in callers based on *actual* registers used by the callee.</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]310</ol>
311
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]312</div>
313
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]314<!-- ======================================================================= -->
Misha Brukman3497ae92004-03-11 21:26:29 +0000[diff] [blame]315<div class="doc_section">
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]316 <a name="misc_new">Miscellaneous Additions</a>
317</div>
318
319<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]320
321<ol>
Misha Brukman85595942004-07-12 21:10:47 +0000[diff] [blame]322<li>Port the <a href="http://www-sop.inria.fr/mimosa/fp/Bigloo/">Bigloo</A>
Brian Gaeke2d261352004-04-07 15:31:23 +0000[diff] [blame]323Scheme compiler, from Manuel Serrano at INRIA Sophia-Antipolis, to
324output LLVM bytecode. It seems that it can already output .NET
325bytecode, JVM bytecode, and C, so LLVM would ostensibly be another good
326candidate.</li>
Misha Brukman85595942004-07-12 21:10:47 +0000[diff] [blame]327<li>Write a new frontend for C/C++ <b>in</b> C++, giving us the ability to
328directly use LLVM C++ classes from within a compiler rather than use
329C-based wrapper functions a la llvm-gcc. One possible starting point is the <a
330href="http://www.parashift.com/c++-faq-lite/compiler-dependencies.html#faq-37.11">C++
331yacc grammar by Ed Willink</a>.</li>
Brian Gaeke2d261352004-04-07 15:31:23 +0000[diff] [blame]332<li>Write a new frontend for some other language (Java? OCaml? Forth?)</li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]333<li>Write a new backend for a target (IA64? MIPS? MMIX?)</li>
Misha Brukmandec8cfb2004-04-16 16:55:30 +0000[diff] [blame]334<li>Write a disassembler for machine code that would use TableGen to output
335<tt>MachineInstr</tt>s for transformations, optimizations, etc.</li>
Brian Gaekea2245a32004-03-10 19:15:50 +0000[diff] [blame]336<li>Random test vector generator: Use a C grammar to generate random C code;
337run it through llvm-gcc, then run a random set of passes on it using opt.
338Try to crash opt. When opt crashes, use bugpoint to reduce the test case and
339mail the result to yourself. Repeat ad infinitum.</li>
Misha Brukman1a49bc82004-03-10 19:22:29 +0000[diff] [blame]340<li>Design a simple, recognizable logo.</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]341</ol>
342
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]343</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]344
345<!-- *********************************************************************** -->
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]346
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]347<hr>
Misha Brukman836db502004-05-12 18:57:54 +0000[diff] [blame]348<address>
349 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
350 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
351 <a href="http://validator.w3.org/check/referer"><img
352 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
353
354 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
355 <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]356 Last modified: $Date$
Misha Brukman836db502004-05-12 18:57:54 +0000[diff] [blame]357</address>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]358
359</body>
360</html>