cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 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 "verify.h"
cannam@167: 
cannam@167: /* copy A into B, using output stride of A and input stride of B */
cannam@167: typedef struct {
cannam@167:      dotens2_closure k;
cannam@167:      R *ra; R *ia;
cannam@167:      R *rb; R *ib;
cannam@167:      int scalea, scaleb;
cannam@167: } cpy_closure;
cannam@167: 
cannam@167: static void cpy0(dotens2_closure *k_, 
cannam@167: 		 int indxa, int ondxa, int indxb, int ondxb)
cannam@167: {
cannam@167:      cpy_closure *k = (cpy_closure *)k_;
cannam@167:      k->rb[indxb * k->scaleb] = k->ra[ondxa * k->scalea];
cannam@167:      k->ib[indxb * k->scaleb] = k->ia[ondxa * k->scalea];
cannam@167:      UNUSED(indxa); UNUSED(ondxb);
cannam@167: }
cannam@167: 
cannam@167: static void cpy(R *ra, R *ia, const bench_tensor *sza, int scalea,
cannam@167: 		R *rb, R *ib, const bench_tensor *szb, int scaleb)
cannam@167: {
cannam@167:      cpy_closure k;
cannam@167:      k.k.apply = cpy0;
cannam@167:      k.ra = ra; k.ia = ia; k.rb = rb; k.ib = ib;
cannam@167:      k.scalea = scalea; k.scaleb = scaleb;
cannam@167:      bench_dotens2(sza, szb, &k.k);
cannam@167: }
cannam@167: 
cannam@167: typedef struct {
cannam@167:      dofft_closure k;
cannam@167:      bench_problem *p;
cannam@167: } dofft_dft_closure;
cannam@167: 
cannam@167: static void dft_apply(dofft_closure *k_, bench_complex *in, bench_complex *out)
cannam@167: {
cannam@167:      dofft_dft_closure *k = (dofft_dft_closure *)k_;
cannam@167:      bench_problem *p = k->p;
cannam@167:      bench_tensor *totalsz, *pckdsz;
cannam@167:      bench_tensor *totalsz_swap, *pckdsz_swap;
cannam@167:      bench_real *ri, *ii, *ro, *io;
cannam@167:      int totalscale;
cannam@167: 
cannam@167:      totalsz = tensor_append(p->vecsz, p->sz);
cannam@167:      pckdsz = verify_pack(totalsz, 2);
cannam@167:      ri = (bench_real *) p->in;
cannam@167:      ro = (bench_real *) p->out;
cannam@167: 
cannam@167:      totalsz_swap = tensor_copy_swapio(totalsz);
cannam@167:      pckdsz_swap = tensor_copy_swapio(pckdsz);
cannam@167: 
cannam@167:      /* confusion: the stride is the distance between complex elements
cannam@167: 	when using interleaved format, but it is the distance between
cannam@167: 	real elements when using split format */
cannam@167:      if (p->split) {
cannam@167: 	  ii = p->ini ? (bench_real *) p->ini : ri + p->iphyssz;
cannam@167: 	  io = p->outi ? (bench_real *) p->outi : ro + p->ophyssz;
cannam@167: 	  totalscale = 1;
cannam@167:      } else {
cannam@167: 	  ii = p->ini ? (bench_real *) p->ini : ri + 1;
cannam@167: 	  io = p->outi ? (bench_real *) p->outi : ro + 1;
cannam@167: 	  totalscale = 2;
cannam@167:      }
cannam@167: 
cannam@167:      cpy(&c_re(in[0]), &c_im(in[0]), pckdsz, 1,
cannam@167: 	    ri, ii, totalsz, totalscale);
cannam@167:      after_problem_ccopy_from(p, ri, ii);
cannam@167:      doit(1, p);
cannam@167:      after_problem_ccopy_to(p, ro, io);
cannam@167:      if (k->k.recopy_input)
cannam@167: 	  cpy(ri, ii, totalsz_swap, totalscale,
cannam@167: 	      &c_re(in[0]), &c_im(in[0]), pckdsz_swap, 1);
cannam@167:      cpy(ro, io, totalsz, totalscale,
cannam@167: 	 &c_re(out[0]), &c_im(out[0]), pckdsz, 1);
cannam@167: 
cannam@167:      tensor_destroy(totalsz);
cannam@167:      tensor_destroy(pckdsz);
cannam@167:      tensor_destroy(totalsz_swap);
cannam@167:      tensor_destroy(pckdsz_swap);
cannam@167: }
cannam@167: 
cannam@167: void verify_dft(bench_problem *p, int rounds, double tol, errors *e)
cannam@167: {
cannam@167:      C *inA, *inB, *inC, *outA, *outB, *outC, *tmp;
cannam@167:      int n, vecn, N;
cannam@167:      dofft_dft_closure k;
cannam@167: 
cannam@167:      BENCH_ASSERT(p->kind == PROBLEM_COMPLEX);
cannam@167: 
cannam@167:      k.k.apply = dft_apply;
cannam@167:      k.k.recopy_input = 0;
cannam@167:      k.p = p;
cannam@167: 
cannam@167:      if (rounds == 0)
cannam@167: 	  rounds = 20;  /* default value */
cannam@167: 
cannam@167:      n = tensor_sz(p->sz);
cannam@167:      vecn = tensor_sz(p->vecsz);
cannam@167:      N = n * vecn;
cannam@167: 
cannam@167:      inA = (C *) bench_malloc(N * sizeof(C));
cannam@167:      inB = (C *) bench_malloc(N * sizeof(C));
cannam@167:      inC = (C *) bench_malloc(N * sizeof(C));
cannam@167:      outA = (C *) bench_malloc(N * sizeof(C));
cannam@167:      outB = (C *) bench_malloc(N * sizeof(C));
cannam@167:      outC = (C *) bench_malloc(N * sizeof(C));
cannam@167:      tmp = (C *) bench_malloc(N * sizeof(C));
cannam@167: 
cannam@167:      e->i = impulse(&k.k, n, vecn, inA, inB, inC, outA, outB, outC, 
cannam@167: 		    tmp, rounds, tol);
cannam@167:      e->l = linear(&k.k, 0, N, inA, inB, inC, outA, outB, outC,
cannam@167: 		   tmp, rounds, tol);
cannam@167: 
cannam@167:      e->s = 0.0;
cannam@167:      e->s = dmax(e->s, tf_shift(&k.k, 0, p->sz, n, vecn, p->sign,
cannam@167: 				inA, inB, outA, outB, 
cannam@167: 				tmp, rounds, tol, TIME_SHIFT));
cannam@167:      e->s = dmax(e->s, tf_shift(&k.k, 0, p->sz, n, vecn, p->sign,
cannam@167: 				inA, inB, outA, outB, 
cannam@167: 				tmp, rounds, tol, FREQ_SHIFT));
cannam@167: 
cannam@167:      if (!p->in_place && !p->destroy_input)
cannam@167: 	  preserves_input(&k.k, 0, N, inA, inB, outB, rounds);
cannam@167: 
cannam@167:      bench_free(tmp);
cannam@167:      bench_free(outC);
cannam@167:      bench_free(outB);
cannam@167:      bench_free(outA);
cannam@167:      bench_free(inC);
cannam@167:      bench_free(inB);
cannam@167:      bench_free(inA);
cannam@167: }
cannam@167: 
cannam@167: 
cannam@167: void accuracy_dft(bench_problem *p, int rounds, int impulse_rounds,
cannam@167: 		  double t[6])
cannam@167: {
cannam@167:      dofft_dft_closure k;
cannam@167:      int n;
cannam@167:      C *a, *b;
cannam@167: 
cannam@167:      BENCH_ASSERT(p->kind == PROBLEM_COMPLEX);
cannam@167:      BENCH_ASSERT(p->sz->rnk == 1);
cannam@167:      BENCH_ASSERT(p->vecsz->rnk == 0);
cannam@167: 
cannam@167:      k.k.apply = dft_apply;
cannam@167:      k.k.recopy_input = 0;
cannam@167:      k.p = p;
cannam@167:      n = tensor_sz(p->sz);
cannam@167: 
cannam@167:      a = (C *) bench_malloc(n * sizeof(C));
cannam@167:      b = (C *) bench_malloc(n * sizeof(C));
cannam@167:      accuracy_test(&k.k, 0, p->sign, n, a, b, rounds, impulse_rounds, t);
cannam@167:      bench_free(b);
cannam@167:      bench_free(a);
cannam@167: }