Chris@19: /*
Chris@19:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19:  *
Chris@19:  * This program is free software; you can redistribute it and/or modify
Chris@19:  * it under the terms of the GNU General Public License as published by
Chris@19:  * the Free Software Foundation; either version 2 of the License, or
Chris@19:  * (at your option) any later version.
Chris@19:  *
Chris@19:  * This program is distributed in the hope that it will be useful,
Chris@19:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@19:  * GNU General Public License for more details.
Chris@19:  *
Chris@19:  * You should have received a copy of the GNU General Public License
Chris@19:  * along with this program; if not, write to the Free Software
Chris@19:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@19:  *
Chris@19:  */
Chris@19: 
Chris@19: 
Chris@19: #include "ct.h"
Chris@19: 
Chris@19: ct_solver *(*X(mksolver_ct_hook))(size_t, INT, int, 
Chris@19: 				  ct_mkinferior, ct_force_vrecursion) = 0;
Chris@19: 
Chris@19: typedef struct {
Chris@19:      plan_dft super;
Chris@19:      plan *cld;
Chris@19:      plan *cldw;
Chris@19:      INT r;
Chris@19: } P;
Chris@19: 
Chris@19: static void apply_dit(const plan *ego_, R *ri, R *ii, R *ro, R *io)
Chris@19: {
Chris@19:      const P *ego = (const P *) ego_;
Chris@19:      plan_dft *cld;
Chris@19:      plan_dftw *cldw;
Chris@19: 
Chris@19:      cld = (plan_dft *) ego->cld;
Chris@19:      cld->apply(ego->cld, ri, ii, ro, io);
Chris@19: 
Chris@19:      cldw = (plan_dftw *) ego->cldw;
Chris@19:      cldw->apply(ego->cldw, ro, io);
Chris@19: }
Chris@19: 
Chris@19: static void apply_dif(const plan *ego_, R *ri, R *ii, R *ro, R *io)
Chris@19: {
Chris@19:      const P *ego = (const P *) ego_;
Chris@19:      plan_dft *cld;
Chris@19:      plan_dftw *cldw;
Chris@19: 
Chris@19:      cldw = (plan_dftw *) ego->cldw;
Chris@19:      cldw->apply(ego->cldw, ri, ii);
Chris@19: 
Chris@19:      cld = (plan_dft *) ego->cld;
Chris@19:      cld->apply(ego->cld, ri, ii, ro, io);
Chris@19: }
Chris@19: 
Chris@19: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@19: {
Chris@19:      P *ego = (P *) ego_;
Chris@19:      X(plan_awake)(ego->cld, wakefulness);
Chris@19:      X(plan_awake)(ego->cldw, wakefulness);
Chris@19: }
Chris@19: 
Chris@19: static void destroy(plan *ego_)
Chris@19: {
Chris@19:      P *ego = (P *) ego_;
Chris@19:      X(plan_destroy_internal)(ego->cldw);
Chris@19:      X(plan_destroy_internal)(ego->cld);
Chris@19: }
Chris@19: 
Chris@19: static void print(const plan *ego_, printer *p)
Chris@19: {
Chris@19:      const P *ego = (const P *) ego_;
Chris@19:      p->print(p, "(dft-ct-%s/%D%(%p%)%(%p%))",
Chris@19: 	      ego->super.apply == apply_dit ? "dit" : "dif",
Chris@19: 	      ego->r, ego->cldw, ego->cld);
Chris@19: }
Chris@19: 
Chris@19: static int applicable0(const ct_solver *ego, const problem *p_, planner *plnr)
Chris@19: {
Chris@19:      const problem_dft *p = (const problem_dft *) p_;
Chris@19:      INT r;
Chris@19: 
Chris@19:      return (1
Chris@19: 	     && p->sz->rnk == 1
Chris@19: 	     && p->vecsz->rnk <= 1
Chris@19: 
Chris@19: 	     /* DIF destroys the input and we don't like it */
Chris@19: 	     && (ego->dec == DECDIT ||
Chris@19: 		 p->ri == p->ro ||
Chris@19: 		 !NO_DESTROY_INPUTP(plnr))
Chris@19: 
Chris@19: 	     && ((r = X(choose_radix)(ego->r, p->sz->dims[0].n)) > 1)
Chris@19: 	     && p->sz->dims[0].n > r);
Chris@19: }
Chris@19: 
Chris@19: 
Chris@19: int X(ct_applicable)(const ct_solver *ego, const problem *p_, planner *plnr)
Chris@19: {
Chris@19:      const problem_dft *p;
Chris@19: 
Chris@19:      if (!applicable0(ego, p_, plnr))
Chris@19:           return 0;
Chris@19: 
Chris@19:      p = (const problem_dft *) p_;
Chris@19: 
Chris@19:      return (0
Chris@19: 	     || ego->dec == DECDIF+TRANSPOSE
Chris@19: 	     || p->vecsz->rnk == 0
Chris@19: 	     || !NO_VRECURSEP(plnr)
Chris@19: 	     || (ego->force_vrecursionp && ego->force_vrecursionp(ego, p))
Chris@19: 	  );
Chris@19: }
Chris@19: 
Chris@19: 
Chris@19: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@19: {
Chris@19:      const ct_solver *ego = (const ct_solver *) ego_;
Chris@19:      const problem_dft *p;
Chris@19:      P *pln = 0;
Chris@19:      plan *cld = 0, *cldw = 0;
Chris@19:      INT n, r, m, v, ivs, ovs;
Chris@19:      iodim *d;
Chris@19: 
Chris@19:      static const plan_adt padt = {
Chris@19: 	  X(dft_solve), awake, print, destroy
Chris@19:      };
Chris@19: 
Chris@19:      if ((NO_NONTHREADEDP(plnr)) || !X(ct_applicable)(ego, p_, plnr))
Chris@19:           return (plan *) 0;
Chris@19: 
Chris@19:      p = (const problem_dft *) p_;
Chris@19:      d = p->sz->dims;
Chris@19:      n = d[0].n;
Chris@19:      r = X(choose_radix)(ego->r, n);
Chris@19:      m = n / r;
Chris@19: 
Chris@19:      X(tensor_tornk1)(p->vecsz, &v, &ivs, &ovs);
Chris@19: 
Chris@19:      switch (ego->dec) {
Chris@19: 	 case DECDIT:
Chris@19: 	 {
Chris@19: 	      cldw = ego->mkcldw(ego,
Chris@19: 				 r, m * d[0].os, m * d[0].os,
Chris@19: 				 m, d[0].os,
Chris@19: 				 v, ovs, ovs,
Chris@19: 				 0, m,
Chris@19: 				 p->ro, p->io, plnr);
Chris@19: 	      if (!cldw) goto nada;
Chris@19: 
Chris@19: 	      cld = X(mkplan_d)(plnr,
Chris@19: 				X(mkproblem_dft_d)(
Chris@19: 				     X(mktensor_1d)(m, r * d[0].is, d[0].os),
Chris@19: 				     X(mktensor_2d)(r, d[0].is, m * d[0].os,
Chris@19: 						    v, ivs, ovs),
Chris@19: 				     p->ri, p->ii, p->ro, p->io)
Chris@19: 		   );
Chris@19: 	      if (!cld) goto nada;
Chris@19: 
Chris@19: 	      pln = MKPLAN_DFT(P, &padt, apply_dit);
Chris@19: 	      break;
Chris@19: 	 }
Chris@19: 	 case DECDIF:
Chris@19: 	 case DECDIF+TRANSPOSE:
Chris@19: 	 {
Chris@19: 	      INT cors, covs; /* cldw ors, ovs */
Chris@19: 	      if (ego->dec == DECDIF+TRANSPOSE) {
Chris@19: 		   cors = ivs;
Chris@19: 		   covs = m * d[0].is;
Chris@19: 		   /* ensure that we generate well-formed dftw subproblems */
Chris@19: 		   /* FIXME: too conservative */
Chris@19: 		   if (!(1
Chris@19: 			 && r == v
Chris@19: 			 && d[0].is == r * cors))
Chris@19: 			goto nada;
Chris@19: 
Chris@19: 		   /* FIXME: allow in-place only for now, like in
Chris@19: 		      fftw-3.[01] */
Chris@19: 		   if (!(1
Chris@19: 			 && p->ri == p->ro
Chris@19: 			 && d[0].is == r * d[0].os
Chris@19: 			 && cors == d[0].os
Chris@19: 			 && covs == ovs
Chris@19: 			    ))
Chris@19: 			goto nada;
Chris@19: 	      } else {
Chris@19: 		   cors = m * d[0].is;
Chris@19: 		   covs = ivs;
Chris@19: 	      }
Chris@19: 
Chris@19: 	      cldw = ego->mkcldw(ego,
Chris@19: 				 r, m * d[0].is, cors,
Chris@19: 				 m, d[0].is,
Chris@19: 				 v, ivs, covs,
Chris@19: 				 0, m,
Chris@19: 				 p->ri, p->ii, plnr);
Chris@19: 	      if (!cldw) goto nada;
Chris@19: 
Chris@19: 	      cld = X(mkplan_d)(plnr,
Chris@19: 				X(mkproblem_dft_d)(
Chris@19: 				     X(mktensor_1d)(m, d[0].is, r * d[0].os),
Chris@19: 				     X(mktensor_2d)(r, cors, d[0].os,
Chris@19: 						    v, covs, ovs),
Chris@19: 				     p->ri, p->ii, p->ro, p->io)
Chris@19: 		   );
Chris@19: 	      if (!cld) goto nada;
Chris@19: 
Chris@19: 	      pln = MKPLAN_DFT(P, &padt, apply_dif);
Chris@19: 	      break;
Chris@19: 	 }
Chris@19: 
Chris@19: 	 default: A(0);
Chris@19: 
Chris@19:      }
Chris@19: 
Chris@19:      pln->cld = cld;
Chris@19:      pln->cldw = cldw;
Chris@19:      pln->r = r;
Chris@19:      X(ops_add)(&cld->ops, &cldw->ops, &pln->super.super.ops);
Chris@19: 
Chris@19:      /* inherit could_prune_now_p attribute from cldw */
Chris@19:      pln->super.super.could_prune_now_p = cldw->could_prune_now_p;
Chris@19:      return &(pln->super.super);
Chris@19: 
Chris@19:  nada:
Chris@19:      X(plan_destroy_internal)(cldw);
Chris@19:      X(plan_destroy_internal)(cld);
Chris@19:      return (plan *) 0;
Chris@19: }
Chris@19: 
Chris@19: ct_solver *X(mksolver_ct)(size_t size, INT r, int dec, 
Chris@19: 			  ct_mkinferior mkcldw,
Chris@19: 			  ct_force_vrecursion force_vrecursionp)
Chris@19: {
Chris@19:      static const solver_adt sadt = { PROBLEM_DFT, mkplan, 0 };
Chris@19:      ct_solver *slv = (ct_solver *)X(mksolver)(size, &sadt);
Chris@19:      slv->r = r;
Chris@19:      slv->dec = dec;
Chris@19:      slv->mkcldw = mkcldw;
Chris@19:      slv->force_vrecursionp = force_vrecursionp;
Chris@19:      return slv;
Chris@19: }
Chris@19: 
Chris@19: plan *X(mkplan_dftw)(size_t size, const plan_adt *adt, dftwapply apply)
Chris@19: {
Chris@19:      plan_dftw *ego;
Chris@19: 
Chris@19:      ego = (plan_dftw *) X(mkplan)(size, adt);
Chris@19:      ego->apply = apply;
Chris@19: 
Chris@19:      return &(ego->super);
Chris@19: }