From 00812e2095b19dda7a639ac19bad21bc45c7ad0b Mon Sep 17 00:00:00 2001 From: Reid Spencer Date: Tue, 17 May 2005 02:47:27 +0000 Subject: [PATCH] Fix a few grammaros. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22100 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/ReleaseNotes.html | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/docs/ReleaseNotes.html b/docs/ReleaseNotes.html index f47b4230ead..fb0c7fbfbd5 100644 --- a/docs/ReleaseNotes.html +++ b/docs/ReleaseNotes.html @@ -148,7 +148,7 @@ than the caller, etc. The only case not supported are varargs calls, but that could be added if desired.

-

In order for a front-end to get a guaranteed tail call, it must mark +

To ensure a call is interpreted as a tail call, a front-end must mark functions as "fastcc", mark calls with the 'tail' marker, and follow the call with a return of the called value (or void). The optimizer and code generator attempt to handle more general cases, but the simple case will always work if @@ -217,7 +217,7 @@ multiple of 8 bytes in size. hitting swap during optimized builds.

  • The LLVM Transformation Visualizer (llvm-tv) project has been updated to - work with LLVM CVS.
    • + work with LLVM 1.5.
  • Nightly tester output is now archived on the llvm-testresults mailing list.
    • @@ -243,7 +243,7 @@ only accessed in main to SSA registers.
  • Loops with trip counts based on array pointer comparisons (e.g. "for (i = 0; &A[i] != &A[n]; ++i) ...") are optimized better than before, -which primarily helps iterator-intensive C++ codes.
    • +which primarily helps iterator-intensive C++ code.
  • The optimizer now eliminates simple cases where redundant conditions exist between neighboring blocks.
    • @@ -353,8 +353,8 @@ things), is more aggressive and intelligent.

    LLVM is known to work on the following platforms: