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: 
Chris@42: #include "ct.h"
Chris@42: 
Chris@42: typedef struct {
Chris@42:      ct_solver super;
Chris@42:      const ct_desc *desc;
Chris@42:      kdftwsq k;
Chris@42: } S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_dftw super;
Chris@42:      kdftwsq k;
Chris@42:      INT r;
Chris@42:      stride rs, vs;
Chris@42:      INT m, ms, v, mb, me;
Chris@42:      twid *td;
Chris@42:      const S *slv;
Chris@42: } P;
Chris@42: 
Chris@42: 
Chris@42: static void apply(const plan *ego_, R *rio, R *iio)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      INT mb = ego->mb, ms = ego->ms;
Chris@42:      ego->k(rio + mb*ms, iio + mb*ms, ego->td->W, ego->rs, ego->vs,
Chris@42: 	    mb, ego->me, ms);
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42: 
Chris@42:      X(twiddle_awake)(wakefulness, &ego->td, ego->slv->desc->tw,
Chris@42: 		      ego->r * ego->m, ego->r, ego->m);
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(stride_destroy)(ego->rs);
Chris@42:      X(stride_destroy)(ego->vs);
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:      const S *slv = ego->slv;
Chris@42:      const ct_desc *e = slv->desc;
Chris@42: 
Chris@42:      p->print(p, "(dftw-directsq-%D/%D%v \"%s\")",
Chris@42: 	      ego->r, X(twiddle_length)(ego->r, e->tw), ego->v, e->nam);
Chris@42: }
Chris@42: 
Chris@42: static int applicable(const S *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 mb, INT me,
Chris@42: 		      R *rio, R *iio,
Chris@42: 		      const planner *plnr)
Chris@42: {
Chris@42:      const ct_desc *e = ego->desc;
Chris@42:      UNUSED(v);
Chris@42: 
Chris@42:      return (
Chris@42: 	  1
Chris@42: 	  && r == e->radix
Chris@42: 
Chris@42: 	  /* transpose r, v */
Chris@42: 	  && r == v
Chris@42: 	  && irs == ovs
Chris@42: 	  && ivs == ors
Chris@42: 
Chris@42: 	  /* check for alignment/vector length restrictions */
Chris@42: 	  && e->genus->okp(e, rio, iio, irs, ivs, m, mb, me, ms, plnr)
Chris@42: 
Chris@42: 	  );
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:      const ct_desc *e = ego->desc;
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(ego,
Chris@42: 		     r, irs, ors, m, ms, v, ivs, ovs, mstart, mstart + mcount,
Chris@42: 		     rio, iio, plnr))
Chris@42:           return (plan *)0;
Chris@42: 
Chris@42:      pln = MKPLAN_DFTW(P, &padt, apply);
Chris@42: 
Chris@42:      pln->k = ego->k;
Chris@42:      pln->rs = X(mkstride)(r, irs);
Chris@42:      pln->vs = X(mkstride)(v, ivs);
Chris@42:      pln->td = 0;
Chris@42:      pln->r = r;
Chris@42:      pln->m = m;
Chris@42:      pln->ms = ms;
Chris@42:      pln->v = v;
Chris@42:      pln->mb = mstart;
Chris@42:      pln->me = mstart + mcount;
Chris@42:      pln->slv = ego;
Chris@42: 
Chris@42:      X(ops_zero)(&pln->super.super.ops);
Chris@42:      X(ops_madd2)(mcount/e->genus->vl, &e->ops, &pln->super.super.ops);
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: }
Chris@42: 
Chris@42: static void regone(planner *plnr, kdftwsq codelet,
Chris@42: 		   const ct_desc *desc, int dec)
Chris@42: {
Chris@42:      S *slv = (S *)X(mksolver_ct)(sizeof(S), desc->radix, dec, mkcldw, 0);
Chris@42:      slv->k = codelet;
Chris@42:      slv->desc = desc;
Chris@42:      REGISTER_SOLVER(plnr, &(slv->super.super));
Chris@42:      if (X(mksolver_ct_hook)) {
Chris@42: 	  slv = (S *)X(mksolver_ct_hook)(sizeof(S), desc->radix, dec,
Chris@42: 					 mkcldw, 0);
Chris@42: 	  slv->k = codelet;
Chris@42: 	  slv->desc = desc;
Chris@42: 	  REGISTER_SOLVER(plnr, &(slv->super.super));
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: void X(regsolver_ct_directwsq)(planner *plnr, kdftwsq codelet,
Chris@42: 			       const ct_desc *desc, int dec)
Chris@42: {
Chris@42:      regone(plnr, codelet, desc, dec+TRANSPOSE);
Chris@42: }