annotate src/fftw-3.3.8/libbench2/verify.c @ 167:bd3cc4d1df30

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