[Bug tree-optimization/18589] could optimize FP multiplies better
- To: debian-gcc@lists.debian.org
- Subject: [Bug tree-optimization/18589] could optimize FP multiplies better
- From: "rguenth at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
- Date: Mon, 09 Jan 2012 12:20:31 +0000
- Message-id: <bug-18589-5724-vLuqjvD9tt@http.gcc.gnu.org/bugzilla/>
- In-reply-to: <bug-18589-5724@http.gcc.gnu.org/bugzilla/>
- References: <bug-18589-5724@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18589
Richard Guenther <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |rguenth at gcc dot gnu.org,
| |wschmidt at gcc dot gnu.org
--- Comment #6 from Richard Guenther <rguenth at gcc dot gnu.org> 2012-01-09 12:20:31 UTC ---
Yeah, reassoc does not canonicalize to pow () so the tree level optimal
expansion does not trigger [in reality reassoc should probably do both
on-the-fly - linearly expand existing pow()s to expose them to multiply
chains and sorting, combine them back and then emit them in optimal form].
Bill, something you want to tackle?
--
Configure bugmail: http://gcc.gnu.org/bugzilla/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You reported the bug.
Reply to: