[Bug tree-optimization/18589] could optimize FP multiplies better

["pinskia at gcc dot gnu dot org" <gcc-bugzilla@gcc.gnu.org>]

------- Additional Comments From pinskia at gcc dot gnu dot org  2005-01-12 06:50 -------
This is actually not a target issue, it can be shown on ppc also and other targets including x86.
doing (f1*f2)^2^2 will be the best every where as it is only three instructions and it would take the 
same time as what is proposed if there are two FPU units  but what I said is the smallest and fastest 
version.

-- 
           What    |Removed                     |Added
----------------------------------------------------------------------------
          Component|target                      |tree-optimization
  GCC build triplet|amd64-linux                 |
   GCC host triplet|amd64-linux                 |
 GCC target triplet|amd64-linux                 |


http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18589

------- You are receiving this mail because: -------
You reported the bug, or are watching the reporter.