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