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