------- Comment #5 from hjl dot tools at gmail dot com 2010-06-04 14:40 -------
tree-ssa-reassoc.c has
2. Left linearization of the expression trees, so that (A+B)+(C+D)
becomes (((A+B)+C)+D), which is easier for us to rewrite later.
During linearization, we place the operands of the binary
expressions into a vector of operand_entry_t
I think this may always generate slower codes. We may not want to
use much more registers. We can limit us to 2 temporaries.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=44382
