diff options
| -rw-r--r-- | docs/ReleaseNotes.html | 36 |
1 files changed, 19 insertions, 17 deletions
diff --git a/docs/ReleaseNotes.html b/docs/ReleaseNotes.html index b3324b8aa2..748e8fc17e 100644 --- a/docs/ReleaseNotes.html +++ b/docs/ReleaseNotes.html @@ -105,9 +105,9 @@ constrained to be the same as the CFG for the LLVM input code.</li> <li>LLVM now has new loop unrolling and loop unswitching passes.</li> <li>The induction variable substitution pass performs linear function test replacement and exit value replacement optimizations.</li> -<li>LLVM now has first-class support for <a href="GarbageCollection.html">Accurate -Garbage Collection</a>, enabling the use of aggressive copying and generational -collectors.</li> +<li>LLVM now has first-class support for <a +href="GarbageCollection.html">Accurate Garbage Collection</a>, enabling the use +of aggressive copying and generational collectors.</li> <li>LLVM now includes an implementation of Andersen's interprocedural alias analysis algorithm.</li> <li>Bugpoint can <a href="http://llvm.cs.uiuc.edu/PR327">extract individual @@ -115,19 +115,19 @@ basic blocks</a> to track down reduce miscompilation testcases.</li> <li>LLVM and the C front-end now work under Win32 using the <a href="http://www.cygwin.com">Cygwin</a> runtime libraries. This includes the JIT compiler.</li> -<li>The LLVM code generator is now being <a - href="CodeGenerator.html">documented</a>.</li> -<li>There is a new tool, llvm-abcd, the Analysis of ByteCode Dumper (abcd). -This tool can compute basic statistics and bytecode density statistics on a -module or function basis and also dump out bytecode in a textual format that -is lower level than assembly (values are not resolved from slot numbers). -It should only be of interest to (a) those who are working to improve the -bytecode format and (b) those who really want to understand or document the -details of the bytecode format.</li> -<li>The <a href="BytecodeFormat.html">LLVM Bytecode file format</a> is now - being documented.</li> -<li>LLVM now provides an <a href="LangRef.html#i_isunordered">llvm.isunordered</a> intrinsic -for efficient implementation of unordered floating point comparisons.</li> +<li>The LLVM code generator is now being <a +href="CodeGenerator.html">documented</a>.</li> +<li>There is a new tool, llvm-bcanalyzer. This tool can compute basic +statistics and bytecode density statistics on a module or function basis and +also dump out bytecode in a textual format that is lower level than assembly +(values are not resolved from slot numbers). It should only be of interest to +(a) those who are working to improve the bytecode format and (b) those who +really want to understand or document the details of the bytecode format.</li> +<li>The <a href="BytecodeFormat.html">LLVM Bytecode file format</a> is now being +documented.</li> +<li>LLVM now provides an <a +href="LangRef.html#i_isunordered">llvm.isunordered</a> intrinsic for efficient +implementation of unordered floating point comparisons.</li> <li>The llvmgcc front-end now supports the GCC builtins for ISO C99 floating point comparison macros (e.g., <tt>__builtin_islessequal</tt>).</li> <li>Now that there are more source files than can fit on a 32Kbyte command @@ -136,6 +136,8 @@ llvmgrep tool in the utils directory combines an egrep and a find without passing filenames through the command line. This improves performance slightly. Simply run llvmgrep like you might egrep but leave off the file names.</li> +<li>We now generate HTML documentation and man pages for the tools from a single +source (perl-style POD files).</li> </ol> </div> @@ -297,7 +299,7 @@ enum type</a></li> prototypes that take opaque structs by-value</a></li> <li><a href="http://llvm.cs.uiuc.edu/PR374">[llvmgcc] Crash compiling variable length array of structures</a></li> -<li><a href="http://llvm.cs.uiuc.edu/PR377">[llvmgcc] miscompilation of staticly +<li><a href="http://llvm.cs.uiuc.edu/PR377">[llvmgcc] miscompilation of staticly initialized unsigned bitfields</a></li> </ol> </div> |