This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [www patch] news/sms.html: Fix typos.
- From: Gerald Pfeifer <gerald at pfeifer dot com>
- To: Kazu Hirata <kazu at cs dot umass dot edu>,Mostafa Hagog <MUSTAFA at il dot ibm dot com>
- Cc: gcc-patches at gcc dot gnu dot org
- Date: Sun, 20 Mar 2005 22:13:53 +0100 (CET)
- Subject: Re: [www patch] news/sms.html: Fix typos.
- References: <20050320.152902.59463700.kazu@cs.umass.edu>
On Sun, 20 Mar 2005, Kazu Hirata wrote:
> Committed as obvious.
>
> Index: sms.html
> ===================================================================
> -because of compile time consumption; <code>-fmodulo-sched<\code>
> +because of compile time consumption; <code>-fmodulo-sched</code>
^^^
Thanks, Kazu! Even after your fix, and the following one I committed
in addition, the page still does not validate.
Mostafa, my automated tester had spotted this when you committed this
new page, but you didn't respond and fix the page. Would you mind having
a look and address the remaining issues?
Thanks,
Gerald
Index: sms.html
===================================================================
RCS file: /cvs/gcc/wwwdocs/htdocs/news/sms.html,v
retrieving revision 1.1
diff -u -3 -p -r1.1 sms.html
--- sms.html 27 Feb 2005 14:24:25 -0000 1.1
+++ sms.html 20 Mar 2005 20:44:04 -0000
@@ -10,7 +10,7 @@
<p>February 2005</p>
<p>We are pleased to announce that Mostafa Hagog and Ayal Zaks, of <a
-href="http://www.haifa.il.ibm.com/";>IBM Haifa Labs</a>, have contributed
+href="http://www.haifa.il.ibm.com/">IBM Haifa Labs</a>, have contributed
Swing Modulo Scheduling (SMS) to GCC 4.0. Their implementation is based
on the articles:<p/>
<ul>
@@ -28,7 +28,7 @@ on the articles:<p/>
traditional scheduler (in GCC) that does not give a special
handling for loops. For more information on the theory behind
SMS take a look at the <a href=
-"http://www.gccsummit.org/2004/2004-GCC-Summit-Proceedings.pdf";>
+"http://www.gccsummit.org/2004/2004-GCC-Summit-Proceedings.pdf">
2004 GCC summit proceedings (page 55)</a>.
This optimization helps in loops where there is a place to
run consecutive iterations concurrently but the traditional