|
Chris@82
|
1 /*
|
|
Chris@82
|
2 * Copyright (c) 2001 Matteo Frigo
|
|
Chris@82
|
3 * Copyright (c) 2001 Massachusetts Institute of Technology
|
|
Chris@82
|
4 *
|
|
Chris@82
|
5 * This program is free software; you can redistribute it and/or modify
|
|
Chris@82
|
6 * it under the terms of the GNU General Public License as published by
|
|
Chris@82
|
7 * the Free Software Foundation; either version 2 of the License, or
|
|
Chris@82
|
8 * (at your option) any later version.
|
|
Chris@82
|
9 *
|
|
Chris@82
|
10 * This program is distributed in the hope that it will be useful,
|
|
Chris@82
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Chris@82
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Chris@82
|
13 * GNU General Public License for more details.
|
|
Chris@82
|
14 *
|
|
Chris@82
|
15 * You should have received a copy of the GNU General Public License
|
|
Chris@82
|
16 * along with this program; if not, write to the Free Software
|
|
Chris@82
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
Chris@82
|
18 *
|
|
Chris@82
|
19 */
|
|
Chris@82
|
20
|
|
Chris@82
|
21
|
|
Chris@82
|
22 #include "libbench2/bench.h"
|
|
Chris@82
|
23
|
|
Chris@82
|
24 int no_speed_allocation = 0; /* 1 to not allocate array data in speed() */
|
|
Chris@82
|
25
|
|
Chris@82
|
26 void speed(const char *param, int setup_only)
|
|
Chris@82
|
27 {
|
|
Chris@82
|
28 double *t;
|
|
Chris@82
|
29 int iter = 0, k;
|
|
Chris@82
|
30 bench_problem *p;
|
|
Chris@82
|
31 double tmin, y;
|
|
Chris@82
|
32
|
|
Chris@82
|
33 t = (double *) bench_malloc(time_repeat * sizeof(double));
|
|
Chris@82
|
34
|
|
Chris@82
|
35 for (k = 0; k < time_repeat; ++k)
|
|
Chris@82
|
36 t[k] = 0;
|
|
Chris@82
|
37
|
|
Chris@82
|
38 p = problem_parse(param);
|
|
Chris@82
|
39 BENCH_ASSERT(can_do(p));
|
|
Chris@82
|
40 if (!no_speed_allocation) {
|
|
Chris@82
|
41 problem_alloc(p);
|
|
Chris@82
|
42 problem_zero(p);
|
|
Chris@82
|
43 }
|
|
Chris@82
|
44
|
|
Chris@82
|
45 timer_start(LIBBENCH_TIMER);
|
|
Chris@82
|
46 setup(p);
|
|
Chris@82
|
47 p->setup_time = bench_cost_postprocess(timer_stop(LIBBENCH_TIMER));
|
|
Chris@82
|
48
|
|
Chris@82
|
49 /* reset the input to zero again, because the planner in paranoid
|
|
Chris@82
|
50 mode sets it to random values, thus making the benchmark
|
|
Chris@82
|
51 diverge. */
|
|
Chris@82
|
52 if (!no_speed_allocation)
|
|
Chris@82
|
53 problem_zero(p);
|
|
Chris@82
|
54
|
|
Chris@82
|
55 if (setup_only)
|
|
Chris@82
|
56 goto done;
|
|
Chris@82
|
57
|
|
Chris@82
|
58 start_over:
|
|
Chris@82
|
59 for (iter = 1; iter < (1<<30); iter *= 2) {
|
|
Chris@82
|
60 tmin = 1.0e20;
|
|
Chris@82
|
61 for (k = 0; k < time_repeat; ++k) {
|
|
Chris@82
|
62 timer_start(LIBBENCH_TIMER);
|
|
Chris@82
|
63 doit(iter, p);
|
|
Chris@82
|
64 y = bench_cost_postprocess(timer_stop(LIBBENCH_TIMER));
|
|
Chris@82
|
65 if (y < 0) /* yes, it happens */
|
|
Chris@82
|
66 goto start_over;
|
|
Chris@82
|
67 t[k] = y;
|
|
Chris@82
|
68 if (y < tmin)
|
|
Chris@82
|
69 tmin = y;
|
|
Chris@82
|
70 }
|
|
Chris@82
|
71
|
|
Chris@82
|
72 if (tmin >= time_min)
|
|
Chris@82
|
73 goto done;
|
|
Chris@82
|
74 }
|
|
Chris@82
|
75
|
|
Chris@82
|
76 goto start_over; /* this also happens */
|
|
Chris@82
|
77
|
|
Chris@82
|
78 done:
|
|
Chris@82
|
79 done(p);
|
|
Chris@82
|
80
|
|
Chris@82
|
81 if (iter)
|
|
Chris@82
|
82 for (k = 0; k < time_repeat; ++k)
|
|
Chris@82
|
83 t[k] /= iter;
|
|
Chris@82
|
84 else
|
|
Chris@82
|
85 for (k = 0; k < time_repeat; ++k)
|
|
Chris@82
|
86 t[k] = 0;
|
|
Chris@82
|
87
|
|
Chris@82
|
88 report(p, t, time_repeat);
|
|
Chris@82
|
89
|
|
Chris@82
|
90 if (!no_speed_allocation)
|
|
Chris@82
|
91 problem_destroy(p);
|
|
Chris@82
|
92 bench_free(t);
|
|
Chris@82
|
93 return;
|
|
Chris@82
|
94 }
|
