Hi! Lately this testcase often timesout for me on a busy box, I don't see a point iterating 2000^3 times, with 400^3 it is much faster and I still could reproduce the problem before the corresponding fix and the vectorizer r145171 fix fixed it.
Bootstrapped/regtested on x86_64-linux and i686-linux, ok for trunk? 2012-12-11 Jakub Jelinek <ja...@redhat.com> * gfortran.dg/vect/fast-math-pr38968.f90: Decrease n from 2000 to 400. --- gcc/testsuite/gfortran.dg/vect/fast-math-pr38968.f90.jj 2011-01-25 18:39:53.000000000 +0100 +++ gcc/testsuite/gfortran.dg/vect/fast-math-pr38968.f90 2012-12-11 16:19:45.222105217 +0100 @@ -7,7 +7,7 @@ program mymatmul implicit none integer, parameter :: kp = 4 - integer, parameter :: n = 2000 + integer, parameter :: n = 400 real(kp), dimension(n,n) :: rr, ri complex(kp), dimension(n,n) :: a,b,c real :: t1, t2 Jakub