annotate src/fftw-3.3.3/libbench2/verify.c @ 169:223a55898ab9 tip default

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