cannam@167: /* cannam@167: * Copyright (c) 2000 Matteo Frigo cannam@167: * Copyright (c) 2000 Massachusetts Institute of Technology cannam@167: * cannam@167: * This program is free software; you can redistribute it and/or modify cannam@167: * it under the terms of the GNU General Public License as published by cannam@167: * the Free Software Foundation; either version 2 of the License, or cannam@167: * (at your option) any later version. cannam@167: * cannam@167: * This program is distributed in the hope that it will be useful, cannam@167: * but WITHOUT ANY WARRANTY; without even the implied warranty of cannam@167: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the cannam@167: * GNU General Public License for more details. cannam@167: * cannam@167: * You should have received a copy of the GNU General Public License cannam@167: * along with this program; if not, write to the Free Software cannam@167: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA cannam@167: * cannam@167: */ cannam@167: cannam@167: cannam@167: #include cannam@167: #include cannam@167: cannam@167: #include "verify.h" cannam@167: cannam@167: void verify_problem(bench_problem *p, int rounds, double tol) cannam@167: { cannam@167: errors e; cannam@167: const char *pstring = p->pstring ? p->pstring : ""; cannam@167: cannam@167: switch (p->kind) { cannam@167: case PROBLEM_COMPLEX: verify_dft(p, rounds, tol, &e); break; cannam@167: case PROBLEM_REAL: verify_rdft2(p, rounds, tol, &e); break; cannam@167: case PROBLEM_R2R: verify_r2r(p, rounds, tol, &e); break; cannam@167: } cannam@167: cannam@167: if (verbose) cannam@167: ovtpvt("%s %g %g %g\n", pstring, e.l, e.i, e.s); cannam@167: } cannam@167: cannam@167: void verify(const char *param, int rounds, double tol) cannam@167: { cannam@167: bench_problem *p; cannam@167: cannam@167: p = problem_parse(param); cannam@167: problem_alloc(p); cannam@167: cannam@167: if (!can_do(p)) { cannam@167: ovtpvt_err("No can_do for %s\n", p->pstring); cannam@167: BENCH_ASSERT(0); cannam@167: } cannam@167: cannam@167: problem_zero(p); cannam@167: setup(p); cannam@167: cannam@167: verify_problem(p, rounds, tol); cannam@167: cannam@167: done(p); cannam@167: problem_destroy(p); cannam@167: } cannam@167: cannam@167: cannam@167: static void do_accuracy(bench_problem *p, int rounds, int impulse_rounds) cannam@167: { cannam@167: double t[6]; cannam@167: cannam@167: switch (p->kind) { cannam@167: case PROBLEM_COMPLEX: cannam@167: accuracy_dft(p, rounds, impulse_rounds, t); break; cannam@167: case PROBLEM_REAL: cannam@167: accuracy_rdft2(p, rounds, impulse_rounds, t); break; cannam@167: case PROBLEM_R2R: cannam@167: accuracy_r2r(p, rounds, impulse_rounds, t); break; cannam@167: } cannam@167: cannam@167: /* t[0] : L1 error cannam@167: t[1] : L2 error cannam@167: t[2] : Linf error cannam@167: t[3..5]: L1, L2, Linf backward error */ cannam@167: ovtpvt("%6.2e %6.2e %6.2e %6.2e %6.2e %6.2e\n", cannam@167: t[0], t[1], t[2], t[3], t[4], t[5]); cannam@167: } cannam@167: cannam@167: void accuracy(const char *param, int rounds, int impulse_rounds) cannam@167: { cannam@167: bench_problem *p; cannam@167: p = problem_parse(param); cannam@167: BENCH_ASSERT(can_do(p)); cannam@167: problem_alloc(p); cannam@167: problem_zero(p); cannam@167: setup(p); cannam@167: do_accuracy(p, rounds, impulse_rounds); cannam@167: done(p); cannam@167: problem_destroy(p); cannam@167: }