This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[web,cfo] project page for cfo-branch
- From: Gábor Lóki <loki at inf dot u-szeged dot hu>
- To: gcc-patches at gcc dot gnu dot org
- Date: Fri, 26 Nov 2004 12:08:49 +0100
- Subject: [web,cfo] project page for cfo-branch
- References: <41A709C4.3070304@inf.u-szeged.hu>
Hi,
I've created a project page for cfo-branch.
It passes the w3 validator.
Is it OK to commit?
br,
Gabor Loki
Index: wwwdocs/htdocs/cvs.html
===================================================================
RCS file: /cvs/gcc/wwwdocs/htdocs/cvs.html,v
retrieving revision 1.167
diff -u -r1.167 cvs.html
--- wwwdocs/htdocs/cvs.html 19 Nov 2004 22:52:14 -0000 1.167
+++ wwwdocs/htdocs/cvs.html 26 Nov 2004 10:03:53 -0000
@@ -251,6 +251,13 @@
branch do not require approval, but they should be sent to gcc-patches
list and the usual testing rules apply.</dd>
+ <dt><a href="projects/cfo.html">cfo-branch</a></dt>
+ <dd>The goal of this branch is to add a new extension for improving
+ the code size optimization of GCC with code factoring methods (code
+ motion and merging algorithms). Messages should be marked with <code>
+ [cfo]</code> in the subject line. The usual contribution and testing
+ rules apply.</dd>
+
</dl>
<h4>Architecture-specific</h4>
--- /dev/null 2004-09-23 10:14:19.000000000 +0200
+++ wwwdocs/htdocs/projects/cfo.html 2004-11-23 09:12:28.000000000 +0100
@@ -0,0 +1,55 @@
+<html>
+<head>
+<title>Code Factoring Optimizations</title>
+</head>
+
+<body>
+<h1>Code Factoring Optimizations</h1>
+
+<h2>Table of Contents</h2>
+
+<ul>
+<li><a href="#news">Latest news (last updated: 2004-11-16)</a></li>
+<li><a href="#intro">Introduction</a></li>
+<li><a href="#documentation">Documentation</a></li>
+</ul>
+
+<hr />
+<h2><a name="news">Latest News</a></h2>
+
+<dl>
+<dt>2004-11-16</dt>
+<dd><p>The branch is now open. Checkout the cfo-branch branch by following the
+instructions found in the <a href="../../cvs.html">CVS documentation</a>.
+</p></dd>
+</dl>
+
+<hr />
+<h3><a name="intro">Introduction</a></h3>
+
+<p>The goal of this project is to add a new extension for improving the code
+size optimization of GCC with code factoring methods (code motion and merging
+algorithms). The implementation currently resides in the cfo-branch branch.</p>
+
+<hr />
+<h3><a name="documentation">Documentation</a></h3>
+
+<p>The project includes two different code factoring algorithms which are the
+following:</p>
+<ul>
+<li>Local code factoring: This is code motion technique which tries to merge two
+identical instructions.</li>
+<li>Sequence abstraction: This algorithm merges identical code sequences. It is
+nearly the opposite of function inlining.</li>
+</ul>
+
+<p>Both algorithms have an oportunity of working on two different levels
+(Tree, RTL). Both have their own advatages and disadvatages.
+This project holds both types for future investigations. </p>
+
+<p>For more information about code factoring see the
+<a href="http://www.gccsummit.org/2004/2004-GCC-Summit-Proceedings.pdf";>
+GCC Summit Proceedings</a>.</p>
+
+</body>
+</html>