annotate src/fftw-3.3.5/libbench2/verify.c @ 148:b4bfdf10c4b3

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