I'd like to announce the opening of the ra-improvements branch. My aim with this branch is to modify the existing global register allocator with several improvements to reduce its overall memory usage, make it faster and hopefully produce some better code too. This work is not a competitor with RABLE or YARA. Hopefully, those projects might even be able to use some of the work done here. The first changes to be checked in will deal with changing the square conflict bit matrix to use a smaller lower-triangular bit matrix. That change was first posted at:
http://gcc.gnu.org/ml/gcc-patches/2006-02/msg00129.html with later follow up patches extending it. Suggestions for improvements are welcome as well as critiques. I'd also welcome test cases that people think are stressing the current global allocator due to large numbers of pseudos. Peter Index: svn.html =================================================================== RCS file: /cvs/gcc/wwwdocs/htdocs/svn.html,v retrieving revision 1.30 diff -u -p -r1.30 svn.html --- svn.html 15 Jun 2006 20:11:01 -0000 1.30 +++ svn.html 2 Aug 2006 03:12:03 -0000 @@ -297,6 +297,19 @@ list therefore provides only some repres branch is maintained by <a href="mailto:[EMAIL PROTECTED]">Laurynas Biveinis</a>.</dd> + + <dt>ra-improvements</dt> + <dd>This branch aims to implement several improvements to the + current register allocator. Examples include implenting a + lower-triangular conflict matrix and register coalescing. + It is hoped that these improvements will not only help the + current allocator, but will be useful to the other register + allocation projects such as RABLE and YARA. This branch will + be merged with the dataflow-branch from time to time. + The patches for this branch should be marked with the tag + <code>[ra-improvements]</code> in the subject line. The branch + is maintained by <a href="mailto:[EMAIL PROTECTED]">Peter + Bergner</a>.</dd> </dl> <h4>Architecture-specific</h4>
