On Wed, 10 Apr 2013, Richard Biener wrote:
>
> This handles commutative operations during SLP tree build in the
> way that if one configuration does not match, the build will
> try again with commutated operands for. This allows to remove
> the special-casing of commutated loads in a complex add
This handles commutative operations during SLP tree build in the
way that if one configuration does not match, the build will
try again with commutated operands for. This allows to remove
the special-casing of commutated loads in a complex addition
that was in the end handled as "permutation". I
