------- Comment #40 from rob1weld at aol dot com 2009-04-21 12:30 ------- (In reply to comment #0) > I've found a major performance regression in gcc 4.0.0's optimization ...
(In reply to comment #11) > We need more analysis on these kinds of issues. > So, we're doing a worse job on register allocation. Is that because > the register allocator got worse, or because we're giving it a harder > problem to solve? (In reply to comment #12) > It is the latter and the pass which is responsible ... (In reply to comment #13) > Tough, there is really not much that can be done about this ... Is this of any use ? Register Allocation by Puzzle Solving http://compilers.cs.ucla.edu/fernando/projects/puzzles/ "This project consists in developing a new model for register allocation that has fast compilation time, produces code of good quality, is able to address the many irregularities found in common computer architectures and is intuitive enough to be easily understood." "Our implementation produces Pentium code that is of similar quality to the code produced by the slower, state-of-the-art iterated register coalescing algorithm of George and Appel augmented with extensions by Smith, Ramsey, and Holloway." YT, Rob -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=21485
