Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: 
Chris@42: #include "ifftw.h"
Chris@42: 
Chris@42: #ifdef HAVE_UNISTD_H
Chris@42: #  include <unistd.h>
Chris@42: #endif
Chris@42: 
Chris@42: #ifndef WITH_SLOW_TIMER
Chris@42: #  include "cycle.h"
Chris@42: #endif
Chris@42: 
Chris@42: #ifndef FFTW_TIME_LIMIT
Chris@42: #define FFTW_TIME_LIMIT 2.0  /* don't run for more than two seconds */
Chris@42: #endif
Chris@42: 
Chris@42: /* the following code is disabled for now, because it seems to
Chris@42:    require that we #include <windows.h> in ifftw.h to 
Chris@42:    typedef LARGE_INTEGER crude_time, and this pulls in the whole
Chris@42:    Windows universe and leads to namespace conflicts (unless
Chris@42:    we did some hack like assuming sizeof(LARGE_INTEGER) == sizeof(long long).
Chris@42:    gettimeofday is provided by MinGW, which we use to cross-compile
Chris@42:    FFTW for Windows, and this seems to work well enough */
Chris@42: #if 0 && (defined(__WIN32__) || defined(_WIN32) || defined(_WIN64))
Chris@42: crude_time X(get_crude_time)(void)
Chris@42: {
Chris@42:      crude_time tv;
Chris@42:      QueryPerformanceCounter(&tv);
Chris@42:      return tv;
Chris@42: }
Chris@42: 
Chris@42: static double elapsed_since(crude_time t0)
Chris@42: {
Chris@42:      crude_time t1, freq;
Chris@42:      QueryPerformanceCounter(&t1);
Chris@42:      QueryPerformanceFrequency(&freq);
Chris@42:      return (((double) (t1.QuadPart - t0.QuadPart))) /
Chris@42: 	  ((double) freq.QuadPart);
Chris@42: }
Chris@42: 
Chris@42: #  define TIME_MIN_SEC 1.0e-2
Chris@42: 
Chris@42: #elif defined(HAVE_GETTIMEOFDAY)
Chris@42: crude_time X(get_crude_time)(void)
Chris@42: {
Chris@42:      crude_time tv;
Chris@42:      gettimeofday(&tv, 0);
Chris@42:      return tv;
Chris@42: }
Chris@42: 
Chris@42: #define elapsed_sec(t1,t0) ((double)(t1.tv_sec - t0.tv_sec) +		\
Chris@42: 			    (double)(t1.tv_usec - t0.tv_usec) * 1.0E-6)
Chris@42: 
Chris@42: static double elapsed_since(crude_time t0)
Chris@42: {
Chris@42:      crude_time t1;
Chris@42:      gettimeofday(&t1, 0);
Chris@42:      return elapsed_sec(t1, t0);
Chris@42: }
Chris@42: 
Chris@42: #  define TIME_MIN_SEC 1.0e-3
Chris@42: 
Chris@42: #else /* !HAVE_GETTIMEOFDAY */
Chris@42: 
Chris@42: /* Note that the only system where we are likely to need to fall back
Chris@42:    on the clock() function is Windows, for which CLOCKS_PER_SEC is 1000
Chris@42:    and thus the clock wraps once every 50 days.  This should hopefully
Chris@42:    be longer than the time required to create any single plan! */
Chris@42: crude_time X(get_crude_time)(void) { return clock(); }
Chris@42: 
Chris@42: #define elapsed_sec(t1,t0) ((double) ((t1) - (t0)) / CLOCKS_PER_SEC)
Chris@42: 
Chris@42: static double elapsed_since(crude_time t0)
Chris@42: {
Chris@42:      return elapsed_sec(clock(), t0);
Chris@42: }
Chris@42: 
Chris@42: #  define TIME_MIN_SEC 2.0e-1 /* from fftw2 */
Chris@42: 
Chris@42: #endif /* !HAVE_GETTIMEOFDAY */
Chris@42: 
Chris@42: double X(elapsed_since)(const planner *plnr, const problem *p, crude_time t0)
Chris@42: {
Chris@42:      double t = elapsed_since(t0);
Chris@42:      if (plnr->cost_hook)
Chris@42: 	  t = plnr->cost_hook(p, t, COST_MAX);
Chris@42:      return t;
Chris@42: }
Chris@42: 
Chris@42: #ifdef WITH_SLOW_TIMER
Chris@42: /* excruciatingly slow; only use this if there is no choice! */
Chris@42: typedef crude_time ticks;
Chris@42: #  define getticks X(get_crude_time)
Chris@42: #  define elapsed(t1,t0) elapsed_sec(t1,t0)
Chris@42: #  define TIME_MIN TIME_MIN_SEC
Chris@42: #  define TIME_REPEAT 4 /* from fftw2 */
Chris@42: #  define HAVE_TICK_COUNTER
Chris@42: #endif
Chris@42: 
Chris@42: #ifdef HAVE_TICK_COUNTER
Chris@42: 
Chris@42: #  ifndef TIME_MIN
Chris@42: #    define TIME_MIN 100.0
Chris@42: #  endif
Chris@42: 
Chris@42: #  ifndef TIME_REPEAT
Chris@42: #    define TIME_REPEAT 8
Chris@42: #  endif
Chris@42: 
Chris@42:   static double measure(plan *pln, const problem *p, int iter)
Chris@42:   {
Chris@42:        ticks t0, t1;
Chris@42:        int i;
Chris@42: 
Chris@42:        t0 = getticks();
Chris@42:        for (i = 0; i < iter; ++i) 
Chris@42: 	    pln->adt->solve(pln, p);
Chris@42:        t1 = getticks();
Chris@42:        return elapsed(t1, t0);
Chris@42:   }
Chris@42: 
Chris@42: 
Chris@42:   double X(measure_execution_time)(const planner *plnr, 
Chris@42: 				   plan *pln, const problem *p)
Chris@42:   {
Chris@42:        int iter;
Chris@42:        int repeat;
Chris@42: 
Chris@42:        X(plan_awake)(pln, AWAKE_ZERO);
Chris@42:        p->adt->zero(p);
Chris@42: 
Chris@42:   start_over:
Chris@42:        for (iter = 1; iter; iter *= 2) {
Chris@42: 	    double tmin = 0;
Chris@42: 	    int first = 1;
Chris@42: 	    crude_time begin = X(get_crude_time)();
Chris@42: 
Chris@42: 	    /* repeat the measurement TIME_REPEAT times */
Chris@42: 	    for (repeat = 0; repeat < TIME_REPEAT; ++repeat) {
Chris@42: 		 double t = measure(pln, p, iter);
Chris@42: 		 
Chris@42: 		 if (plnr->cost_hook)
Chris@42: 		      t = plnr->cost_hook(p, t, COST_MAX);
Chris@42: 		 if (t < 0)
Chris@42: 		      goto start_over;
Chris@42: 
Chris@42: 		 if (first || t < tmin)
Chris@42: 		      tmin = t;
Chris@42: 		 first = 0;
Chris@42: 
Chris@42: 		 /* do not run for too long */
Chris@42: 		 if (X(elapsed_since)(plnr, p, begin) > FFTW_TIME_LIMIT)
Chris@42: 		      break;
Chris@42: 	    }
Chris@42: 
Chris@42: 	    if (tmin >= TIME_MIN) {
Chris@42: 		 X(plan_awake)(pln, SLEEPY);
Chris@42: 		 return tmin / (double) iter;
Chris@42: 	    }
Chris@42:        }
Chris@42:        goto start_over; /* may happen if timer is screwed up */
Chris@42:   }
Chris@42: 
Chris@42: #else /* no cycle counter */
Chris@42: 
Chris@42:   double X(measure_execution_time)(const planner *plnr, 
Chris@42: 				   plan *pln, const problem *p)
Chris@42:   {
Chris@42:        UNUSED(plnr);
Chris@42:        UNUSED(p);
Chris@42:        UNUSED(pln);
Chris@42:        return -1.0;
Chris@42:   }
Chris@42: 
Chris@42: #endif