Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/libbench2/verify.c @ 95:89f5e221ed7b
Add FFTW3
author | Chris Cannam <cannam@all-day-breakfast.com> |
---|---|
date | Wed, 20 Mar 2013 15:35:50 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
94:d278df1123f9 | 95:89f5e221ed7b |
---|---|
1 /* | |
2 * Copyright (c) 2000 Matteo Frigo | |
3 * Copyright (c) 2000 Massachusetts Institute of Technology | |
4 * | |
5 * This program is free software; you can redistribute it and/or modify | |
6 * it under the terms of the GNU General Public License as published by | |
7 * the Free Software Foundation; either version 2 of the License, or | |
8 * (at your option) any later version. | |
9 * | |
10 * This program is distributed in the hope that it will be useful, | |
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 * GNU General Public License for more details. | |
14 * | |
15 * You should have received a copy of the GNU General Public License | |
16 * along with this program; if not, write to the Free Software | |
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
18 * | |
19 */ | |
20 | |
21 | |
22 #include <stdio.h> | |
23 #include <stdlib.h> | |
24 | |
25 #include "verify.h" | |
26 | |
27 void verify_problem(bench_problem *p, int rounds, double tol) | |
28 { | |
29 errors e; | |
30 const char *pstring = p->pstring ? p->pstring : "<unknown problem>"; | |
31 | |
32 switch (p->kind) { | |
33 case PROBLEM_COMPLEX: verify_dft(p, rounds, tol, &e); break; | |
34 case PROBLEM_REAL: verify_rdft2(p, rounds, tol, &e); break; | |
35 case PROBLEM_R2R: verify_r2r(p, rounds, tol, &e); break; | |
36 } | |
37 | |
38 if (verbose) | |
39 ovtpvt("%s %g %g %g\n", pstring, e.l, e.i, e.s); | |
40 } | |
41 | |
42 void verify(const char *param, int rounds, double tol) | |
43 { | |
44 bench_problem *p; | |
45 | |
46 p = problem_parse(param); | |
47 problem_alloc(p); | |
48 | |
49 if (!can_do(p)) { | |
50 ovtpvt_err("No can_do for %s\n", p->pstring); | |
51 BENCH_ASSERT(0); | |
52 } | |
53 | |
54 problem_zero(p); | |
55 setup(p); | |
56 | |
57 verify_problem(p, rounds, tol); | |
58 | |
59 done(p); | |
60 problem_destroy(p); | |
61 } | |
62 | |
63 | |
64 static void do_accuracy(bench_problem *p, int rounds, int impulse_rounds) | |
65 { | |
66 double t[6]; | |
67 | |
68 switch (p->kind) { | |
69 case PROBLEM_COMPLEX: | |
70 accuracy_dft(p, rounds, impulse_rounds, t); break; | |
71 case PROBLEM_REAL: | |
72 accuracy_rdft2(p, rounds, impulse_rounds, t); break; | |
73 case PROBLEM_R2R: | |
74 accuracy_r2r(p, rounds, impulse_rounds, t); break; | |
75 } | |
76 | |
77 /* t[0] : L1 error | |
78 t[1] : L2 error | |
79 t[2] : Linf error | |
80 t[3..5]: L1, L2, Linf backward error */ | |
81 ovtpvt("%6.2e %6.2e %6.2e %6.2e %6.2e %6.2e\n", | |
82 t[0], t[1], t[2], t[3], t[4], t[5]); | |
83 } | |
84 | |
85 void accuracy(const char *param, int rounds, int impulse_rounds) | |
86 { | |
87 bench_problem *p; | |
88 p = problem_parse(param); | |
89 BENCH_ASSERT(can_do(p)); | |
90 problem_alloc(p); | |
91 problem_zero(p); | |
92 setup(p); | |
93 do_accuracy(p, rounds, impulse_rounds); | |
94 done(p); | |
95 problem_destroy(p); | |
96 } |