[Bug fortran/39087] Performance using COMPLEX data type

2009-02-03 Thread bonzini at gnu dot org
--- Comment #4 from bonzini at gnu dot org 2009-02-03 16:52 --- more precisely, without -ffast-math gcc is not able to change abs(z) < 2 to r*r+i*i < 4 and computes a square root on every iteration. -- bonzini at gnu dot org changed: What|Removed |

[Bug fortran/39087] Performance using COMPLEX data type

2009-02-03 Thread rguenth at gcc dot gnu dot org
--- Comment #3 from rguenth at gcc dot gnu dot org 2009-02-03 16:15 --- Use -ffast-math. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=39087

[Bug fortran/39087] Performance using COMPLEX data type

2009-02-03 Thread m4341 at abc dot se
--- Comment #2 from m4341 at abc dot se 2009-02-03 15:50 --- Notice that the test cases have been executed on a Pentium III computer with dual 866MHz processors. The 'depth' variable in the example code has been set to produce comfortable execution times for the forementioned computer.

[Bug fortran/39087] Performance using COMPLEX data type

2009-02-03 Thread m4341 at abc dot se
--- Comment #1 from m4341 at abc dot se 2009-02-03 15:46 --- Created an attachment (id=17234) --> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=17234&action=view) Test cases for demonstrating performance impact. The attached file contains code that is in it's current state requiring X