Chris@42: /* fftw hook to be used in the benchmark program.  
Chris@42:    
Chris@42:    We keep it in a separate file because 
Chris@42: 
Chris@42:    1) bench.c is supposed to test the API---we do not want to #include
Chris@42:       "ifftw.h" and accidentally use internal symbols/macros.
Chris@42:    2) this code is a royal mess.  The messiness is due to
Chris@42:       A) confusion between internal fftw tensors and bench_tensor's
Chris@42:          (which we want to keep separate because the benchmark
Chris@42: 	  program tests other routines too)
Chris@42:       B) despite A), our desire to recycle the libbench verifier.
Chris@42: */
Chris@42: 
Chris@42: #include <stdio.h>
Chris@42: #include "bench-user.h"
Chris@42: 
Chris@42: #define CALLING_FFTW /* hack for Windows DLL nonsense */
Chris@42: #include "api.h"
Chris@42: #include "dft.h"
Chris@42: #include "rdft.h"
Chris@42: 
Chris@42: extern int paranoid; /* in bench.c */
Chris@42: extern X(plan) the_plan; /* in bench.c */
Chris@42: 
Chris@42: /*
Chris@42:   transform an fftw tensor into a bench_tensor.
Chris@42: */
Chris@42: static bench_tensor *fftw_tensor_to_bench_tensor(tensor *t)
Chris@42: {
Chris@42:      bench_tensor *bt = mktensor(t->rnk);
Chris@42: 
Chris@42:      if (FINITE_RNK(t->rnk)) {
Chris@42: 	  int i;
Chris@42: 	  for (i = 0; i < t->rnk; ++i) {
Chris@42: 	       /* FIXME: 64-bit unclean because of INT -> int conversion */
Chris@42: 	       bt->dims[i].n = t->dims[i].n;
Chris@42: 	       bt->dims[i].is = t->dims[i].is;
Chris@42: 	       bt->dims[i].os = t->dims[i].os;
Chris@42: 	       BENCH_ASSERT(bt->dims[i].n == t->dims[i].n);
Chris@42: 	       BENCH_ASSERT(bt->dims[i].is == t->dims[i].is);
Chris@42: 	       BENCH_ASSERT(bt->dims[i].os == t->dims[i].os);
Chris@42: 	  }
Chris@42:      }
Chris@42:      return bt;
Chris@42: }
Chris@42: 
Chris@42: /*
Chris@42:   transform an fftw problem into a bench_problem.
Chris@42: */
Chris@42: static bench_problem *fftw_problem_to_bench_problem(planner *plnr,
Chris@42: 						    const problem *p_)
Chris@42: {
Chris@42:      bench_problem *bp = 0;
Chris@42:      switch (p_->adt->problem_kind) {
Chris@42: 	 case PROBLEM_DFT:
Chris@42: 	 {
Chris@42: 	      const problem_dft *p = (const problem_dft *) p_;
Chris@42: 	  
Chris@42: 	      if (!p->ri || !p->ii)
Chris@42: 		   abort();
Chris@42: 
Chris@42: 	      bp = (bench_problem *) bench_malloc(sizeof(bench_problem));
Chris@42: 
Chris@42: 	      bp->kind = PROBLEM_COMPLEX;
Chris@42: 	      bp->sign = FFT_SIGN;
Chris@42: 	      bp->split = 1; /* tensor strides are in R's, not C's */
Chris@42: 	      bp->in = UNTAINT(p->ri);
Chris@42: 	      bp->out = UNTAINT(p->ro);
Chris@42: 	      bp->ini = UNTAINT(p->ii);
Chris@42: 	      bp->outi = UNTAINT(p->io);
Chris@42: 	      bp->inphys = bp->outphys = 0;
Chris@42: 	      bp->iphyssz = bp->ophyssz = 0;
Chris@42: 	      bp->in_place = p->ri == p->ro;
Chris@42: 	      bp->sz = fftw_tensor_to_bench_tensor(p->sz);
Chris@42: 	      bp->vecsz = fftw_tensor_to_bench_tensor(p->vecsz);
Chris@42: 	      bp->k = 0;
Chris@42: 	      break;
Chris@42: 	 }
Chris@42: 	 case PROBLEM_RDFT:
Chris@42: 	 {
Chris@42: 	      const problem_rdft *p = (const problem_rdft *) p_;
Chris@42: 	      int i;
Chris@42: 
Chris@42: 	      if (!p->I || !p->O)
Chris@42: 		   abort();
Chris@42: 
Chris@42: 	      for (i = 0; i < p->sz->rnk; ++i)
Chris@42: 		   switch (p->kind[i]) {
Chris@42: 		       case R2HC01:
Chris@42: 		       case R2HC10:
Chris@42: 		       case R2HC11:
Chris@42: 		       case HC2R01:
Chris@42: 		       case HC2R10:
Chris@42: 		       case HC2R11:
Chris@42: 			    return bp;
Chris@42: 		       default:
Chris@42: 			    ;
Chris@42: 		   }
Chris@42: 	  
Chris@42: 	      bp = (bench_problem *) bench_malloc(sizeof(bench_problem));
Chris@42: 
Chris@42: 	      bp->kind = PROBLEM_R2R;
Chris@42: 	      bp->sign = FFT_SIGN;
Chris@42: 	      bp->split = 0;
Chris@42: 	      bp->in = UNTAINT(p->I);
Chris@42: 	      bp->out = UNTAINT(p->O);
Chris@42: 	      bp->ini = bp->outi = 0;
Chris@42: 	      bp->inphys = bp->outphys = 0;
Chris@42: 	      bp->iphyssz = bp->ophyssz = 0;
Chris@42: 	      bp->in_place = p->I == p->O;
Chris@42: 	      bp->sz = fftw_tensor_to_bench_tensor(p->sz);
Chris@42: 	      bp->vecsz = fftw_tensor_to_bench_tensor(p->vecsz);
Chris@42: 	      bp->k = (r2r_kind_t *) bench_malloc(sizeof(r2r_kind_t) * p->sz->rnk);
Chris@42: 	      for (i = 0; i < p->sz->rnk; ++i)
Chris@42: 		   switch (p->kind[i]) {
Chris@42: 		       case R2HC: bp->k[i] = R2R_R2HC; break;
Chris@42: 		       case HC2R: bp->k[i] = R2R_HC2R; break;
Chris@42: 		       case DHT: bp->k[i] = R2R_DHT; break;
Chris@42: 		       case REDFT00: bp->k[i] = R2R_REDFT00; break;
Chris@42: 		       case REDFT01: bp->k[i] = R2R_REDFT01; break;
Chris@42: 		       case REDFT10: bp->k[i] = R2R_REDFT10; break;
Chris@42: 		       case REDFT11: bp->k[i] = R2R_REDFT11; break;
Chris@42: 		       case RODFT00: bp->k[i] = R2R_RODFT00; break;
Chris@42: 		       case RODFT01: bp->k[i] = R2R_RODFT01; break;
Chris@42: 		       case RODFT10: bp->k[i] = R2R_RODFT10; break;
Chris@42: 		       case RODFT11: bp->k[i] = R2R_RODFT11; break;
Chris@42: 		       default: CK(0);
Chris@42: 		   }
Chris@42: 	      break;
Chris@42: 	 }
Chris@42: 	 case PROBLEM_RDFT2:
Chris@42: 	 {
Chris@42: 	      const problem_rdft2 *p = (const problem_rdft2 *) p_;
Chris@42: 	      int rnk = p->sz->rnk;
Chris@42: 	  
Chris@42: 	      if (!p->r0 || !p->r1 || !p->cr || !p->ci)
Chris@42: 		   abort();
Chris@42: 	      
Chris@42: 	      /* give up verifying rdft2 R2HCII */
Chris@42: 	      if (p->kind != R2HC && p->kind != HC2R)
Chris@42: 		   return bp;
Chris@42: 
Chris@42: 	      if (rnk > 0) {
Chris@42: 		   /* can't verify separate even/odd arrays for now */
Chris@42: 		   if (2 * (p->r1 - p->r0) !=
Chris@42: 		       ((p->kind == R2HC) ? 
Chris@42: 			p->sz->dims[rnk-1].is : p->sz->dims[rnk-1].os))
Chris@42: 			return bp;
Chris@42: 	      }
Chris@42: 
Chris@42: 	      bp = (bench_problem *) bench_malloc(sizeof(bench_problem));
Chris@42: 
Chris@42: 	      bp->kind = PROBLEM_REAL;
Chris@42: 	      bp->sign = p->kind == R2HC ? FFT_SIGN : -FFT_SIGN;
Chris@42: 	      bp->split = 1; /* tensor strides are in R's, not C's */
Chris@42: 	      if (p->kind == R2HC) {
Chris@42: 		   bp->sign = FFT_SIGN;
Chris@42: 		   bp->in = UNTAINT(p->r0);
Chris@42: 		   bp->out = UNTAINT(p->cr);
Chris@42: 		   bp->ini = 0;
Chris@42: 		   bp->outi = UNTAINT(p->ci);
Chris@42: 	      }
Chris@42: 	      else {
Chris@42: 		   bp->sign = -FFT_SIGN;
Chris@42: 		   bp->out = UNTAINT(p->r0);
Chris@42: 		   bp->in = UNTAINT(p->cr);
Chris@42: 		   bp->outi = 0;
Chris@42: 		   bp->ini = UNTAINT(p->ci);
Chris@42: 	      }
Chris@42: 	      bp->inphys = bp->outphys = 0;
Chris@42: 	      bp->iphyssz = bp->ophyssz = 0;
Chris@42: 	      bp->in_place = p->r0 == p->cr;
Chris@42: 	      bp->sz = fftw_tensor_to_bench_tensor(p->sz);
Chris@42: 	      if (rnk > 0) {
Chris@42: 		   if (p->kind == R2HC)
Chris@42: 			bp->sz->dims[rnk-1].is /= 2;
Chris@42: 		   else 
Chris@42: 			bp->sz->dims[rnk-1].os /= 2;
Chris@42: 	      }
Chris@42: 	      bp->vecsz = fftw_tensor_to_bench_tensor(p->vecsz);
Chris@42: 	      bp->k = 0;
Chris@42: 	      break;
Chris@42: 	 }
Chris@42: 	 default: 
Chris@42: 	      abort();
Chris@42:      }
Chris@42: 
Chris@42:      bp->userinfo = 0;
Chris@42:      bp->pstring = 0;
Chris@42:      bp->destroy_input = !NO_DESTROY_INPUTP(plnr);
Chris@42: 
Chris@42:      return bp;
Chris@42: }
Chris@42: 
Chris@42: static void hook(planner *plnr, plan *pln, const problem *p_, int optimalp)
Chris@42: {
Chris@42:      int rounds = 5;
Chris@42:      double tol = SINGLE_PRECISION ? 1.0e-3 : 1.0e-10;
Chris@42:      UNUSED(optimalp);
Chris@42: 
Chris@42:      if (verbose > 5) {
Chris@42: 	  printer *pr = X(mkprinter_file)(stdout);
Chris@42: 	  pr->print(pr, "%P:%(%p%)\n", p_, pln);
Chris@42: 	  X(printer_destroy)(pr);
Chris@42: 	  printf("cost %g  \n\n", pln->pcost);
Chris@42:      }
Chris@42: 
Chris@42:      if (paranoid) {
Chris@42: 	  bench_problem *bp;
Chris@42: 
Chris@42: 	  bp = fftw_problem_to_bench_problem(plnr, p_);
Chris@42: 	  if (bp) {
Chris@42: 	       X(plan) the_plan_save = the_plan;
Chris@42: 
Chris@42: 	       the_plan = (apiplan *) MALLOC(sizeof(apiplan), PLANS);
Chris@42: 	       the_plan->pln = pln;
Chris@42: 	       the_plan->prb = (problem *) p_;
Chris@42: 
Chris@42: 	       X(plan_awake)(pln, AWAKE_SQRTN_TABLE);
Chris@42: 	       verify_problem(bp, rounds, tol);
Chris@42: 	       X(plan_awake)(pln, SLEEPY);
Chris@42: 
Chris@42: 	       X(ifree)(the_plan);
Chris@42: 	       the_plan = the_plan_save;
Chris@42: 
Chris@42: 	       problem_destroy(bp);
Chris@42: 	  }
Chris@42: 
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static void paranoid_checks(void)
Chris@42: {
Chris@42:      /* FIXME: assumes char = 8 bits, which is false on at least one
Chris@42: 	DSP I know of. */
Chris@42: #if 0
Chris@42:      /* if flags_t is not 64 bits i want to know it. */
Chris@42:      CK(sizeof(flags_t) == 8);
Chris@42: 
Chris@42:      CK(sizeof(md5uint) >= 4);
Chris@42: #endif
Chris@42: 
Chris@42:      CK(sizeof(uintptr_t) >= sizeof(R *));
Chris@42: 
Chris@42:      CK(sizeof(INT) >= sizeof(R *));
Chris@42: }
Chris@42: 
Chris@42: void install_hook(void)
Chris@42: {
Chris@42:      planner *plnr = X(the_planner)();
Chris@42:      plnr->hook = hook;
Chris@42:      paranoid_checks();
Chris@42: }
Chris@42: 
Chris@42: void uninstall_hook(void)
Chris@42: {
Chris@42:      planner *plnr = X(the_planner)();
Chris@42:      plnr->hook = 0;
Chris@42: }