Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: /* express a twiddle problem in terms of dft + multiplication by
Chris@42:    twiddle factors */
Chris@42: 
Chris@42: #include "ct.h"
Chris@42: 
Chris@42: typedef ct_solver S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_dftw super;
Chris@42: 
Chris@42:      INT r, rs, m, mb, me, ms, v, vs;
Chris@42: 
Chris@42:      plan *cld;
Chris@42: 
Chris@42:      twid *td;
Chris@42: 
Chris@42:      const S *slv;
Chris@42:      int dec;
Chris@42: } P;
Chris@42: 
Chris@42: static void mktwiddle(P *ego, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      static const tw_instr tw[] = { { TW_FULL, 0, 0 }, { TW_NEXT, 1, 0 } };
Chris@42: 
Chris@42:      /* note that R and M are swapped, to allow for sequential
Chris@42: 	access both to data and twiddles */
Chris@42:      X(twiddle_awake)(wakefulness, &ego->td, tw,
Chris@42: 		      ego->r * ego->m, ego->m, ego->r);
Chris@42: }
Chris@42: 
Chris@42: static void bytwiddle(const P *ego, R *rio, R *iio)
Chris@42: {
Chris@42:      INT iv, ir, im;
Chris@42:      INT r = ego->r, rs = ego->rs;
Chris@42:      INT m = ego->m, mb = ego->mb, me = ego->me, ms = ego->ms;
Chris@42:      INT v = ego->v, vs = ego->vs;
Chris@42:      const R *W = ego->td->W;
Chris@42: 
Chris@42:      mb += (mb == 0); /* skip m=0 iteration */
Chris@42:      for (iv = 0; iv < v; ++iv) {
Chris@42: 	  for (ir = 1; ir < r; ++ir) {
Chris@42: 	       for (im = mb; im < me; ++im) {
Chris@42: 		    R *pr = rio + ms * im + rs * ir;
Chris@42: 		    R *pi = iio + ms * im + rs * ir;
Chris@42: 		    E xr = *pr;
Chris@42: 		    E xi = *pi;
Chris@42: 		    E wr = W[2 * im + (2 * (m-1)) * ir - 2];
Chris@42: 		    E wi = W[2 * im + (2 * (m-1)) * ir - 1];
Chris@42: 		    *pr = xr * wr + xi * wi;
Chris@42: 		    *pi = xi * wr - xr * wi;
Chris@42: 	       }
Chris@42: 	  }
Chris@42: 	  rio += vs;
Chris@42: 	  iio += vs;
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static int applicable(INT irs, INT ors, INT ivs, INT ovs,
Chris@42: 		      const planner *plnr)
Chris@42: {
Chris@42:      return (1
Chris@42: 	     && irs == ors
Chris@42: 	     && ivs == ovs
Chris@42: 	     && !NO_SLOWP(plnr)
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static void apply_dit(const plan *ego_, R *rio, R *iio)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_dft *cld;
Chris@42:      INT dm = ego->ms * ego->mb;
Chris@42: 
Chris@42:      bytwiddle(ego, rio, iio);
Chris@42: 
Chris@42:      cld = (plan_dft *) ego->cld;
Chris@42:      cld->apply(ego->cld, rio + dm, iio + dm, rio + dm, iio + dm);
Chris@42: }
Chris@42: 
Chris@42: static void apply_dif(const plan *ego_, R *rio, R *iio)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_dft *cld;
Chris@42:      INT dm = ego->ms * ego->mb;
Chris@42: 
Chris@42:      cld = (plan_dft *) ego->cld;
Chris@42:      cld->apply(ego->cld, rio + dm, iio + dm, rio + dm, iio + dm);
Chris@42: 
Chris@42:      bytwiddle(ego, rio, iio);
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_awake)(ego->cld, wakefulness);
Chris@42:      mktwiddle(ego, wakefulness);
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_destroy_internal)(ego->cld);
Chris@42: }
Chris@42: 
Chris@42: static void print(const plan *ego_, printer *p)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      p->print(p, "(dftw-generic-%s-%D-%D%v%(%p%))",
Chris@42: 	      ego->dec == DECDIT ? "dit" : "dif",
Chris@42: 	      ego->r, ego->m, ego->v, ego->cld);
Chris@42: }
Chris@42: 
Chris@42: static plan *mkcldw(const ct_solver *ego_,
Chris@42: 		    INT r, INT irs, INT ors,
Chris@42: 		    INT m, INT ms,
Chris@42: 		    INT v, INT ivs, INT ovs,
Chris@42: 		    INT mstart, INT mcount,
Chris@42: 		    R *rio, R *iio,
Chris@42: 		    planner *plnr)
Chris@42: {
Chris@42:      const S *ego = (const S *)ego_;
Chris@42:      P *pln;
Chris@42:      plan *cld = 0;
Chris@42:      INT dm = ms * mstart;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  0, awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      A(mstart >= 0 && mstart + mcount <= m);
Chris@42:      if (!applicable(irs, ors, ivs, ovs, plnr))
Chris@42:           return (plan *)0;
Chris@42: 
Chris@42:      cld = X(mkplan_d)(plnr,
Chris@42: 			X(mkproblem_dft_d)(
Chris@42: 			     X(mktensor_1d)(r, irs, irs),
Chris@42: 			     X(mktensor_2d)(mcount, ms, ms, v, ivs, ivs),
Chris@42: 			     rio + dm, iio + dm, rio + dm, iio + dm)
Chris@42: 			);
Chris@42:      if (!cld) goto nada;
Chris@42: 
Chris@42:      pln = MKPLAN_DFTW(P, &padt, ego->dec == DECDIT ? apply_dit : apply_dif);
Chris@42:      pln->slv = ego;
Chris@42:      pln->cld = cld;
Chris@42:      pln->r = r;
Chris@42:      pln->rs = irs;
Chris@42:      pln->m = m;
Chris@42:      pln->ms = ms;
Chris@42:      pln->v = v;
Chris@42:      pln->vs = ivs;
Chris@42:      pln->mb = mstart;
Chris@42:      pln->me = mstart + mcount;
Chris@42:      pln->dec = ego->dec;
Chris@42:      pln->td = 0;
Chris@42: 
Chris@42:      {
Chris@42: 	  double n0 = (r - 1) * (mcount - 1) * v;
Chris@42: 	  pln->super.super.ops = cld->ops;
Chris@42: 	  pln->super.super.ops.mul += 8 * n0;
Chris@42: 	  pln->super.super.ops.add += 4 * n0;
Chris@42: 	  pln->super.super.ops.other += 8 * n0;
Chris@42:      }
Chris@42:      return &(pln->super.super);
Chris@42: 
Chris@42:  nada:
Chris@42:      X(plan_destroy_internal)(cld);
Chris@42:      return (plan *) 0;
Chris@42: }
Chris@42: 
Chris@42: static void regsolver(planner *plnr, INT r, int dec)
Chris@42: {
Chris@42:      S *slv = (S *)X(mksolver_ct)(sizeof(S), r, dec, mkcldw, 0);
Chris@42:      REGISTER_SOLVER(plnr, &(slv->super));
Chris@42:      if (X(mksolver_ct_hook)) {
Chris@42: 	  slv = (S *)X(mksolver_ct_hook)(sizeof(S), r, dec, mkcldw, 0);
Chris@42: 	  REGISTER_SOLVER(plnr, &(slv->super));
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: void X(ct_generic_register)(planner *p)
Chris@42: {
Chris@42:      regsolver(p, 0, DECDIT);
Chris@42:      regsolver(p, 0, DECDIF);
Chris@42: }