1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
/*
* Copyright (c) 2003, 2007-8 Matteo Frigo
* Copyright (c) 2003, 2007-8 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "ifftw.h"
#ifdef HAVE_UNISTD_H
# include <unistd.h>
#endif
#ifndef WITH_SLOW_TIMER
# include "cycle.h"
#endif
#ifndef FFTW_TIME_LIMIT
#define FFTW_TIME_LIMIT 2.0 /* don't run for more than two seconds */
#endif
/* the following code is disabled for now, because it seems to
require that we #include <windows.h> in ifftw.h to
typedef LARGE_INTEGER crude_time, and this pulls in the whole
Windows universe and leads to namespace conflicts (unless
we did some hack like assuming sizeof(LARGE_INTEGER) == sizeof(long long).
gettimeofday is provided by MinGW, which we use to cross-compile
FFTW for Windows, and this seems to work well enough */
#if 0 && (defined(__WIN32__) || defined(_WIN32) || defined(_WIN64))
crude_time X(get_crude_time)(void)
{
crude_time tv;
QueryPerformanceCounter(&tv);
return tv;
}
static double elapsed_since(crude_time t0)
{
crude_time t1, freq;
QueryPerformanceCounter(&t1);
QueryPerformanceFrequency(&freq);
return (((double) (t1.QuadPart - t0.QuadPart))) /
((double) freq.QuadPart);
}
# define TIME_MIN_SEC 1.0e-2
#elif defined(HAVE_GETTIMEOFDAY)
crude_time X(get_crude_time)(void)
{
crude_time tv;
gettimeofday(&tv, 0);
return tv;
}
#define elapsed_sec(t1,t0) ((double)(t1.tv_sec - t0.tv_sec) + \
(double)(t1.tv_usec - t0.tv_usec) * 1.0E-6)
static double elapsed_since(crude_time t0)
{
crude_time t1;
gettimeofday(&t1, 0);
return elapsed_sec(t1, t0);
}
# define TIME_MIN_SEC 1.0e-2 /* from fftw2 */
#else /* !HAVE_GETTIMEOFDAY */
/* Note that the only system where we are likely to need to fall back
on the clock() function is Windows, for which CLOCKS_PER_SEC is 1000
and thus the clock wraps once every 50 days. This should hopefully
be longer than the time required to create any single plan! */
crude_time X(get_crude_time)(void) { return clock(); }
#define elapsed_sec(t1,t0) ((double) ((t1) - (t0)) / CLOCKS_PER_SEC)
static double elapsed_since(crude_time t0)
{
return elapsed_sec(clock(), t0);
}
# define TIME_MIN_SEC 2.0e-1 /* from fftw2 */
#endif /* !HAVE_GETTIMEOFDAY */
double X(elapsed_since)(const planner *plnr, const problem *p, crude_time t0)
{
double t = elapsed_since(t0);
if (plnr->cost_hook)
t = plnr->cost_hook(p, t, COST_MAX);
return t;
}
#ifdef WITH_SLOW_TIMER
/* excruciatingly slow; only use this if there is no choice! */
typedef crude_time ticks;
# define getticks X(get_crude_time)
# define elapsed(t1,t0) elapsed_sec(t1,t0)
# define TIME_MIN TIME_MIN_SEC
# define TIME_REPEAT 4 /* from fftw2 */
# define HAVE_TICK_COUNTER
#endif
#ifdef HAVE_TICK_COUNTER
# ifndef TIME_MIN
# define TIME_MIN 100.0
# endif
# ifndef TIME_REPEAT
# define TIME_REPEAT 8
# endif
static double measure(plan *pln, const problem *p, int iter)
{
ticks t0, t1;
int i;
t0 = getticks();
for (i = 0; i < iter; ++i)
pln->adt->solve(pln, p);
t1 = getticks();
return elapsed(t1, t0);
}
double X(measure_execution_time)(const planner *plnr,
plan *pln, const problem *p)
{
int iter;
int repeat;
X(plan_awake)(pln, AWAKE_ZERO);
p->adt->zero(p);
start_over:
for (iter = 1; iter; iter *= 2) {
double tmin = 0;
int first = 1;
crude_time begin = X(get_crude_time)();
/* repeat the measurement TIME_REPEAT times */
for (repeat = 0; repeat < TIME_REPEAT; ++repeat) {
double t = measure(pln, p, iter);
if (plnr->cost_hook)
t = plnr->cost_hook(p, t, COST_MAX);
if (t < 0)
goto start_over;
if (first || t < tmin)
tmin = t;
first = 0;
/* do not run for too long */
if (X(elapsed_since)(plnr, p, begin) > FFTW_TIME_LIMIT)
break;
}
if (tmin >= TIME_MIN) {
X(plan_awake)(pln, SLEEPY);
return tmin / (double) iter;
}
}
goto start_over; /* may happen if timer is screwed up */
}
#else /* no cycle counter */
double X(measure_execution_time)(const planner *plnr,
plan *pln, const problem *p)
{
UNUSED(plnr);
UNUSED(p);
UNUSED(pln);
return -1.0;
}
#endif
|
