https://gcc.gnu.org/bugzilla/show_bug.cgi?id=110305
Michael Morrell <mmorrell at tachyum dot com> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |mmorrell at tachyum dot com
--- Comment #6 from Michael Morrell <mmorrell at tachyum dot com> ---
I'm curious why this transformation is being done by both
fold_real_zero_addition_p AND simplify_binary_operation_1. The checks in
fold_real_zero_addition_p are more complex and will leave "a + 0.0" unchanged
in more cases, yet later simplify_binary_operation_1 transforms the expression
for less complex reasons.
I also wonder if there aren't similar expressions (perhaps "a * 1.0" -> a) that
need to be looked at.
