diff options
| author | Vladimir Makarov <vmakarov@redhat.com> | 2013-11-14 01:51:07 +0000 |
|---|---|---|
| committer | Vladimir Makarov <vmakarov@gcc.gnu.org> | 2013-11-14 01:51:07 +0000 |
| commit | 41808d153aaa607fc16c243005d52319d6ef8030 (patch) | |
| tree | f129292eb6b5c4c76dd9abd53f43b81ce7f7cc6e /gcc/ira.c | |
| parent | fffb16d263967f59d2f209c336504f36b4b22372 (diff) | |
| download | gcc-41808d153aaa607fc16c243005d52319d6ef8030.zip gcc-41808d153aaa607fc16c243005d52319d6ef8030.tar.gz gcc-41808d153aaa607fc16c243005d52319d6ef8030.tar.bz2 | |
ira.c: Add comment about threads at the top of file.
2013-11-13 Vladimir Makarov <vmakarov@redhat.com>
* ira.c: Add comment about threads at the top of file.
From-SVN: r204772
Diffstat (limited to 'gcc/ira.c')
| -rw-r--r-- | gcc/ira.c | 9 |
1 files changed, 8 insertions, 1 deletions
@@ -192,7 +192,14 @@ along with GCC; see the file COPYING3. If not see this point. There is some freedom in the order of putting allocnos on the stack which can affect the final result of the allocation. IRA uses some heuristics to improve the - order. + order. The major one is to form *threads* from colorable + allocnos and push them on the stack by threads. Thread is a + set of non-conflicting colorable allocnos connected by + copies. The thread contains allocnos from the colorable + bucket or colorable allocnos already pushed onto the coloring + stack. Pushing thread allocnos one after another onto the + stack increases chances of removing copies when the allocnos + get the same hard reg. We also use a modification of Chaitin-Briggs algorithm which works for intersected register classes of allocnos. To |