Gitiles
Code Review Sign In
gerrit-public.fairphone.software / fp2-dev / platform / external / llvm / 11d45b63a2b865c10ccde9a3439e7fbe143a6830 / . / docs / OpenProjects.html
blob: bfd4aa7b5a6779548ca9127a4a525b9a7410d9a2 [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>
Misha Brukman05bcca92004-09-06 22:35:43 +0000[diff] [blame]29 <li><a href="#profileguided">Profile-Guided Optimization</a></li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]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
Reid Spencer11d45b62004-11-01 20:41:01 +0000[diff] [blame^]93has <a
94 href="http://llvm.cs.uiuc.edu/bugs/buglist.cgi?short_desc_type=allwordssubstr&amp;short_desc=&amp;long_desc_type=allwordssubstr&amp;long_desc=&amp;bug_file_loc_type=allwordssubstr&amp;bug_file_loc=&amp;status_whiteboard_type=allwordssubstr&amp;status_whiteboard=&amp;keywords_type=allwords&amp;keywords=code-cleanup&amp;bug_status=NEW&amp;bug_status=ASSIGNED&amp;bug_status=REOPENED&amp;emailassigned_to1=1&amp;emailtype1=substring&amp;email1=&amp;emailassigned_to2=1&amp;emailreporter2=1&amp;emailcc2=1&amp;emailtype2=substring&amp;email2=&amp;bugidtype=include&amp;bug_id=&amp;votes=&amp;changedin=&amp;chfieldfrom=&amp;chfieldto=Now&amp;chfieldvalue=&amp;cmdtype=doit&amp;order=Bug+Number&amp;field0-0-0=noop&amp;type0-0-0=noop&amp;value0-0-0=">"code-cleanup" bugs</a> filed in it. Taking one of these and fixing it is a good
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]95way to get your feet wet in the LLVM code and discover how some of its components
96work.
97</p>
98
99</div>
100
101<!-- ======================================================================= -->
102<div class="doc_subsection">
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]103 <a name="glibc">Port glibc to LLVM</a>
104</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]105
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]106<div class="doc_text">
107
108<p>It would be very useful to <a
Tanya Lattner09cf73c2004-06-22 04:24:55 +0000[diff] [blame]109href="http://www.gnu.org/software/libc/manual/html_node/Porting.html">port</a> <a
110href="http://www.gnu.org/software/libc/">glibc</a> to LLVM. This would allow a
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]111variety of interprocedural algorithms to be much more effective in the face of
112library calls. The most important pieces to port are things like the string
113library and the <tt>stdio</tt> related functions... low-level system calls like
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]114'<tt>read</tt>' should stay unimplemented in LLVM.</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]115
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]116</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]117
118<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]119<div class="doc_subsection">
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]120 <a name="programs">Compile programs with the LLVM Compiler</a>
121</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]122
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]123<div class="doc_text">
124
125<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]126particular, it is useful to try compiling your favorite C source code with LLVM.
127If it doesn't compile, try to figure out why or report it to the <a
128href="http://mail.cs.uiuc.edu/pipermail/llvmbugs/">llvm-bugs</a> list. If you
129get the program to compile, it would be extremely useful to convert the build
130system to be compatible with the LLVM Programs testsuite so that we can check it
Chris Lattner1b360042003-02-07 19:25:35 +0000[diff] [blame]131into CVS and the automated tester can use it to track progress of the
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]132compiler.</p>
Chris Lattner1b360042003-02-07 19:25:35 +0000[diff] [blame]133
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]134<p>When testing a code, try running it with a variety of optimizations, and with
135all the back-ends: CBE, llc, and lli.</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]136
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]137</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]138
139<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]140<div class="doc_subsection">
141 <a name="llvm_ir">Extend the LLVM intermediate representation</a>
142</div>
143
144<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]145
146<ol>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]147<li>Add support for platform-independent prefetch support. The GCC <a
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]148 href="http://gcc.gnu.org/projects/prefetch.html">prefetch project</a> page
149 has a good survey of the prefetching capabilities of a variety of modern
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]150 processors.</li>
151
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]152</ol>
153
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]154</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]155
156<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]157<div class="doc_subsection">
158 <a name="misc_imp">Miscellaneous Improvements</a>
159</div>
160
161<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]162
163<ol>
Chris Lattner8bde96f2003-05-06 20:47:11 +0000[diff] [blame]164<li>Someone needs to look into getting the <tt>ranlib</tt> tool to index LLVM
165 bytecode files, so that linking in .a files is not hideously slow. They
166 would also then have to implement the reader for this index in
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]167 <tt>gccld</tt>.</li>
Chris Lattner8bde96f2003-05-06 20:47:11 +0000[diff] [blame]168
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]169<li>Rework the PassManager to be more flexible</li>
170
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]171<li>Some transformations and analyses only work on reducible flow graphs. It
172would be nice to have a transformation which could be "required" by these passes
173which makes irreducible graphs reducible. This can easily be accomplished
174through code duplication. See <a
175href="http://citeseer.nj.nec.com/janssen97making.html">Making Graphs Reducible
176with Controlled Node Splitting</a> and perhaps <a
177href="http://doi.acm.org/10.1145/262004.262005">Nesting of Reducible and
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]178Irreducible Loops</a>.</li>
179
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]180</ol>
181
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]182</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]183
184<!-- *********************************************************************** -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]185<div class="doc_section">
186 <a name="new">Adding new capabilities to LLVM</a>
187</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]188<!-- *********************************************************************** -->
189
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]190<div class="doc_text">
191
Brian Gaeke2d261352004-04-07 15:31:23 +0000[diff] [blame]192<p>Sometimes creating new things is more fun than improving existing things.
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]193These projects tend to be more involved and perhaps require more work, but can
194also be very rewarding.</p>
195
196</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]197
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]198
199<!-- ======================================================================= -->
200<div class="doc_subsection">
201 <a name="newfeaturebugs">Implementing new feature PRs</a>
202</div>
203
204<div class="doc_text">
205
Reid Spencer11d45b62004-11-01 20:41:01 +0000[diff] [blame^]206<p>Many ideas for feature requests are stored in LLVM bugzilla. Just <a
207 href="http://llvm.org/bugs/buglist.cgi?short_desc_type=allwordssubstr&amp;short_desc=&amp;long_desc_type=allwordssubstr&amp;long_desc=&amp;bug_file_loc_type=allwordssubstr&amp;bug_file_loc=&amp;status_whiteboard_type=allwordssubstr&amp;status_whiteboard=&amp;keywords_type=allwords&amp;keywords=new-feature&amp;bug_status=UNCONFIRMED&amp;bug_status=NEW&amp;bug_status=ASSIGNED&amp;bug_status=REOPENED&amp;emailassigned_to1=1&amp;emailtype1=substring&amp;email1=&amp;emailassigned_to2=1&amp;emailreporter2=1&amp;emailcc2=1&amp;emailtype2=substring&amp;email2=&amp;bugidtype=include&amp;bug_id=&amp;votes=&amp;changedin=&amp;chfieldfrom=&amp;chfieldto=Now&amp;chfieldvalue=&amp;cmdtype=doit&amp;namedcmd=All+PRs&amp;newqueryname=&amp;order=Bug+Number&amp;field0-0-0=noop&amp;type0-0-0=noop&amp;value0-0-0=">search for bugs with a "new-feature" keyword</a>.</p>
Chris Lattner7e0281f2004-05-28 20:41:37 +0000[diff] [blame]208
209</div>
210
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]211<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]212<div class="doc_subsection">
213 <a name="pointeranalysis">Pointer and Alias Analysis</a>
214</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]215
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]216<div class="doc_text">
217
218<p>We have a <a href="AliasAnalysis.html">strong base for development</a> of
219both pointer analysis based optimizations as well as pointer analyses
220themselves. It seems natural to want to take advantage of this...</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]221
222<ol>
223<li>Implement a flow-sensitive context-sensitive alias analysis algorithm<br>
224 - Pick one of the somewhat efficient algorithms, but strive for maximum
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]225 precision</li>
226
Chris Lattnerf56703b2003-06-25 14:31:06 +0000[diff] [blame]227<li>Implement a flow-sensitive context-insensitive alias analysis algorithm<br>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]228 - Just an efficient local algorithm perhaps?</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]229
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]230<li>Implement alias-analysis-based optimizations:
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]231 <ul>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]232 <li>...</li>
233 </ul></li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]234</ol>
235
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]236</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]237
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]238<!-- ======================================================================= -->
239<div class="doc_subsection">
Misha Brukman05bcca92004-09-06 22:35:43 +0000[diff] [blame]240 <a name="profileguided">Profile-Guided Optimization</a>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]241</div>
242
243<div class="doc_text">
244
Chris Lattnera5422e42004-03-08 22:29:35 +0000[diff] [blame]245<p>We now have a unified infrastructure for writing profile-guided
246transformations, which will work either at offline-compile-time or in the JIT,
247but we don't have many transformations. We would welcome new profile-guided
248transformations as well as improvements to the current profiling system.
249</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]250
Misha Brukman05bcca92004-09-06 22:35:43 +0000[diff] [blame]251<p>Ideas for profile-guided transformations:</p>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]252
253<ol>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]254<li>Superblock formation (with many optimizations)</li>
255<li>Loop unrolling/peeling</li>
256<li>Profile directed inlining</li>
257<li>Code layout</li>
258<li>...</li>
259</ol>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]260
Chris Lattnera5422e42004-03-08 22:29:35 +0000[diff] [blame]261<p>Improvements to the existing support:</p>
262
263<ol>
264<li>The current block and edge profiling code that gets inserted is very simple
265and inefficient. Through the use of control-dependence information, many fewer
266counters could be inserted into the code. Also, if the execution count of a
267loop is known to be a compile-time or runtime constant, all of the counters in
268the loop could be avoided.</li>
269
270<li>You could implement one of the "static profiling" algorithms which analyze a
271piece of code an make educated guesses about the relative execution frequencies
272of various parts of the code.</li>
273
274<li>You could add path profiling support, or adapt the existing LLVM path
275profiling code to work with the generic profiling interfaces.</li>
276</ol>
277
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]278</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]279
280<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]281<div class="doc_subsection">
282 <a name="xforms">New Transformations and Analyses</a>
283</div>
284
285<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]286
287<ol>
Chris Lattnerc2a57302004-10-01 22:25:28 +0000[diff] [blame]288<li>Implement <a href="http://www.cs.purdue.edu/homes/vandrutj/">GVN-PRE</a>, a
289 powerful and simple Partial Redundancy Elimination algorithm for SSA form</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]290<li>Implement a Dependence Analysis Infrastructure<br>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]291 - Design some way to represent and query dep analysis</li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]292<li>Implement a strength reduction pass</li>
293<li>Value range propagation pass</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]294</ol>
295
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]296</div>
297
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]298<!-- ======================================================================= -->
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]299<div class="doc_section">
300 <a name="x86be">X86 Back-end Improvements</a>
301</div>
302
303<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]304
305<ol>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]306<li>Implement a better instruction selector</li>
Chris Lattner99df25f2003-04-28 03:42:31 +0000[diff] [blame]307<li>Implement support for the "switch" instruction without requiring the
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]308 lower-switches pass.</li>
Reid Spencer750c4252004-07-02 06:27:12 +0000[diff] [blame]309<li>Implement interprocedural register allocation. The CallGraphSCCPass can be
310 used to implement a bottom-up analysis that will determine the *actual*
311 registers clobbered by a function. Use the pass to fine tune register usage
312 in callers based on *actual* registers used by the callee.</li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]313</ol>
314
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]315</div>
316
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]317<!-- ======================================================================= -->
Misha Brukman3497ae92004-03-11 21:26:29 +0000[diff] [blame]318<div class="doc_section">
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]319 <a name="misc_new">Miscellaneous Additions</a>
320</div>
321
322<div class="doc_text">
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]323
324<ol>
Misha Brukman85595942004-07-12 21:10:47 +0000[diff] [blame]325<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]326Scheme compiler, from Manuel Serrano at INRIA Sophia-Antipolis, to
327output LLVM bytecode. It seems that it can already output .NET
328bytecode, JVM bytecode, and C, so LLVM would ostensibly be another good
329candidate.</li>
Misha Brukman85595942004-07-12 21:10:47 +0000[diff] [blame]330<li>Write a new frontend for C/C++ <b>in</b> C++, giving us the ability to
331directly use LLVM C++ classes from within a compiler rather than use
332C-based wrapper functions a la llvm-gcc. One possible starting point is the <a
333href="http://www.parashift.com/c++-faq-lite/compiler-dependencies.html#faq-37.11">C++
334yacc grammar by Ed Willink</a>.</li>
Brian Gaeke2d261352004-04-07 15:31:23 +0000[diff] [blame]335<li>Write a new frontend for some other language (Java? OCaml? Forth?)</li>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]336<li>Write a new backend for a target (IA64? MIPS? MMIX?)</li>
Misha Brukmandec8cfb2004-04-16 16:55:30 +0000[diff] [blame]337<li>Write a disassembler for machine code that would use TableGen to output
338<tt>MachineInstr</tt>s for transformations, optimizations, etc.</li>
Brian Gaekea2245a32004-03-10 19:15:50 +0000[diff] [blame]339<li>Random test vector generator: Use a C grammar to generate random C code;
340run it through llvm-gcc, then run a random set of passes on it using opt.
341Try to crash opt. When opt crashes, use bugpoint to reduce the test case and
342mail the result to yourself. Repeat ad infinitum.</li>
Misha Brukman1a49bc82004-03-10 19:22:29 +0000[diff] [blame]343<li>Design a simple, recognizable logo.</li>
Misha Brukman6d84e0d2004-10-01 18:36:22 +0000[diff] [blame]344<li>Improve the usefulness and utility of the Skeleton target backend:
345<ul>
346 <li>Convert the non-functional Skeleton target to become an abstract machine
347 target (choose some simple instructions, a register set, etc). This will
348 become a much more useful example of a backend since it would be a simple
Misha Brukmanb8cbd9f2004-10-04 17:36:35 +0000[diff] [blame]349 but <em>functional</em> backend. Examples of such architectures include MIX,
350 MMIX, <a
351 href="http://www.cs.cinvestav.mx/SC/prof_personal/adiaz/vhdl/DLX/">DLX</a>,
352 or come up with your own!</li>
Misha Brukman6d84e0d2004-10-01 18:36:22 +0000[diff] [blame]353 <li>Use the new Skeleton backend in the Interpreter: compile LLVM to Skeleton
354 target, and then interpret that code instead of LLVM. Performance win would
355 be the primary goal, as the number of registers would be a small constant
356 instead of unbounded, for example.</li>
357</ul></li>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]358</ol>
359
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]360</div>
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]361
362<!-- *********************************************************************** -->
Chris Lattnerb7131092003-02-06 19:39:21 +0000[diff] [blame]363
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]364<hr>
Misha Brukman836db502004-05-12 18:57:54 +0000[diff] [blame]365<address>
366 <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
367 src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
368 <a href="http://validator.w3.org/check/referer"><img
369 src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!"></a>
370
371 <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
372 <a href="http://llvm.cs.uiuc.edu">LLVM Compiler Infrastructure</a><br>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]373 Last modified: $Date$
Misha Brukman836db502004-05-12 18:57:54 +0000[diff] [blame]374</address>
Misha Brukman076438b2003-11-14 17:34:38 +0000[diff] [blame]375
376</body>
377</html>