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 "threads.h"
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_dft super;
Chris@42:      plan *cld;
Chris@42:      plan **cldws;
Chris@42:      int nthr;
Chris@42:      INT r;
Chris@42: } P;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan **cldws;
Chris@42:      R *r, *i;
Chris@42: } PD;
Chris@42: 
Chris@42: static void *spawn_apply(spawn_data *d)
Chris@42: {
Chris@42:      PD *ego = (PD *) d->data;
Chris@42:      INT thr_num = d->thr_num;
Chris@42: 
Chris@42:      plan_dftw *cldw = (plan_dftw *) (ego->cldws[thr_num]);
Chris@42:      cldw->apply((plan *) cldw, ego->r, ego->i);
Chris@42:      return 0;
Chris@42: }
Chris@42: 
Chris@42: static void apply_dit(const plan *ego_, R *ri, R *ii, R *ro, R *io)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_dft *cld;
Chris@42: 
Chris@42:      cld = (plan_dft *) ego->cld;
Chris@42:      cld->apply(ego->cld, ri, ii, ro, io);
Chris@42: 
Chris@42:      {
Chris@42: 	  PD d;
Chris@42: 
Chris@42: 	  d.r = ro; d.i = io;
Chris@42: 	  d.cldws = ego->cldws;
Chris@42: 
Chris@42: 	  X(spawn_loop)(ego->nthr, ego->nthr, spawn_apply, (void*)&d);
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static void apply_dif(const plan *ego_, R *ri, R *ii, R *ro, R *io)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_dft *cld;
Chris@42: 
Chris@42:      {
Chris@42: 	  PD d;
Chris@42: 
Chris@42: 	  d.r = ri; d.i = ii;
Chris@42: 	  d.cldws = ego->cldws;
Chris@42: 
Chris@42: 	  X(spawn_loop)(ego->nthr, ego->nthr, spawn_apply, (void*)&d);
Chris@42:      }
Chris@42: 
Chris@42:      cld = (plan_dft *) ego->cld;
Chris@42:      cld->apply(ego->cld, ri, ii, ro, io);
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      int i;
Chris@42:      X(plan_awake)(ego->cld, wakefulness);
Chris@42:      for (i = 0; i < ego->nthr; ++i)
Chris@42: 	  X(plan_awake)(ego->cldws[i], wakefulness);
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      int i;
Chris@42:      X(plan_destroy_internal)(ego->cld);
Chris@42:      for (i = 0; i < ego->nthr; ++i)
Chris@42: 	  X(plan_destroy_internal)(ego->cldws[i]);
Chris@42:      X(ifree)(ego->cldws);
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:      int i;
Chris@42:      p->print(p, "(dft-thr-ct-%s-x%d/%D",
Chris@42: 	      ego->super.apply == apply_dit ? "dit" : "dif",
Chris@42: 	      ego->nthr, ego->r);
Chris@42:      for (i = 0; i < ego->nthr; ++i)
Chris@42:           if (i == 0 || (ego->cldws[i] != ego->cldws[i-1] &&
Chris@42:                          (i <= 1 || ego->cldws[i] != ego->cldws[i-2])))
Chris@42:                p->print(p, "%(%p%)", ego->cldws[i]);
Chris@42:      p->print(p, "%(%p%))", ego->cld);
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const ct_solver *ego = (const ct_solver *) ego_;
Chris@42:      const problem_dft *p;
Chris@42:      P *pln = 0;
Chris@42:      plan *cld = 0, **cldws = 0;
Chris@42:      INT n, r, m, v, ivs, ovs;
Chris@42:      INT block_size;
Chris@42:      int i, nthr, plnr_nthr_save;
Chris@42:      iodim *d;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(dft_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      if (plnr->nthr <= 1 || !X(ct_applicable)(ego, p_, plnr))
Chris@42:           return (plan *) 0;
Chris@42: 
Chris@42:      p = (const problem_dft *) p_;
Chris@42:      d = p->sz->dims;
Chris@42:      n = d[0].n;
Chris@42:      r = X(choose_radix)(ego->r, n);
Chris@42:      m = n / r;
Chris@42: 
Chris@42:      X(tensor_tornk1)(p->vecsz, &v, &ivs, &ovs);
Chris@42: 
Chris@42:      block_size = (m + plnr->nthr - 1) / plnr->nthr;
Chris@42:      nthr = (int)((m + block_size - 1) / block_size);
Chris@42:      plnr_nthr_save = plnr->nthr;
Chris@42:      plnr->nthr = (plnr->nthr + nthr - 1) / nthr;
Chris@42: 
Chris@42:      cldws = (plan **) MALLOC(sizeof(plan *) * nthr, PLANS);
Chris@42:      for (i = 0; i < nthr; ++i) cldws[i] = (plan *) 0;
Chris@42: 
Chris@42:      switch (ego->dec) {
Chris@42: 	 case DECDIT:
Chris@42: 	 {
Chris@42: 	      for (i = 0; i < nthr; ++i) {
Chris@42: 		   cldws[i] = ego->mkcldw(ego,
Chris@42: 					  r, m * d[0].os, m * d[0].os,
Chris@42: 					  m, d[0].os,
Chris@42: 					  v, ovs, ovs,
Chris@42: 					  i*block_size,
Chris@42: 					  (i == nthr - 1) ?
Chris@42: 					  (m - i*block_size) : block_size,
Chris@42: 					  p->ro, p->io, plnr);
Chris@42: 		   if (!cldws[i]) goto nada;
Chris@42: 	      }
Chris@42: 
Chris@42: 	      plnr->nthr = plnr_nthr_save;
Chris@42: 
Chris@42: 	      cld = X(mkplan_d)(plnr,
Chris@42: 				X(mkproblem_dft_d)(
Chris@42: 				     X(mktensor_1d)(m, r * d[0].is, d[0].os),
Chris@42: 				     X(mktensor_2d)(r, d[0].is, m * d[0].os,
Chris@42: 						    v, ivs, ovs),
Chris@42: 				     p->ri, p->ii, p->ro, p->io)
Chris@42: 		   );
Chris@42: 	      if (!cld) goto nada;
Chris@42: 
Chris@42: 	      pln = MKPLAN_DFT(P, &padt, apply_dit);
Chris@42: 	      break;
Chris@42: 	 }
Chris@42: 	 case DECDIF:
Chris@42: 	 case DECDIF+TRANSPOSE:
Chris@42: 	 {
Chris@42: 	      INT cors, covs; /* cldw ors, ovs */
Chris@42: 	      if (ego->dec == DECDIF+TRANSPOSE) {
Chris@42: 		   cors = ivs;
Chris@42: 		   covs = m * d[0].is;
Chris@42: 		   /* ensure that we generate well-formed dftw subproblems */
Chris@42: 		   /* FIXME: too conservative */
Chris@42: 		   if (!(1
Chris@42: 			 && r == v
Chris@42: 			 && d[0].is == r * cors))
Chris@42: 			goto nada;
Chris@42: 
Chris@42: 		   /* FIXME: allow in-place only for now, like in
Chris@42: 		      fftw-3.[01] */
Chris@42: 		   if (!(1
Chris@42: 			 && p->ri == p->ro
Chris@42: 			 && d[0].is == r * d[0].os
Chris@42: 			 && cors == d[0].os
Chris@42: 			 && covs == ovs
Chris@42: 			    ))
Chris@42: 			goto nada;
Chris@42: 	      } else {
Chris@42: 		   cors = m * d[0].is;
Chris@42: 		   covs = ivs;
Chris@42: 	      }
Chris@42: 
Chris@42: 	      for (i = 0; i < nthr; ++i) {
Chris@42: 		   cldws[i] = ego->mkcldw(ego,
Chris@42: 					  r, m * d[0].is, cors,
Chris@42: 					  m, d[0].is,
Chris@42: 					  v, ivs, covs,
Chris@42: 					  i*block_size,
Chris@42: 					  (i == nthr - 1) ?
Chris@42: 					  (m - i*block_size) : block_size,
Chris@42: 					  p->ri, p->ii, plnr);
Chris@42: 		   if (!cldws[i]) goto nada;
Chris@42: 	      }
Chris@42: 
Chris@42: 	      plnr->nthr = plnr_nthr_save;
Chris@42: 
Chris@42: 	      cld = X(mkplan_d)(plnr,
Chris@42: 				X(mkproblem_dft_d)(
Chris@42: 				     X(mktensor_1d)(m, d[0].is, r * d[0].os),
Chris@42: 				     X(mktensor_2d)(r, cors, d[0].os,
Chris@42: 						    v, covs, ovs),
Chris@42: 				     p->ri, p->ii, p->ro, p->io)
Chris@42: 		   );
Chris@42: 	      if (!cld) goto nada;
Chris@42: 
Chris@42: 	      pln = MKPLAN_DFT(P, &padt, apply_dif);
Chris@42: 	      break;
Chris@42: 	 }
Chris@42: 
Chris@42: 	 default: A(0);
Chris@42: 
Chris@42:      }
Chris@42: 
Chris@42:      pln->cld = cld;
Chris@42:      pln->cldws = cldws;
Chris@42:      pln->nthr = nthr;
Chris@42:      pln->r = r;
Chris@42:      X(ops_zero)(&pln->super.super.ops);
Chris@42:      for (i = 0; i < nthr; ++i) {
Chris@42:           X(ops_add2)(&cldws[i]->ops, &pln->super.super.ops);
Chris@42: 	  pln->super.super.could_prune_now_p |= cldws[i]->could_prune_now_p;
Chris@42:      }
Chris@42:      X(ops_add2)(&cld->ops, &pln->super.super.ops);
Chris@42:      return &(pln->super.super);
Chris@42: 
Chris@42:  nada:
Chris@42:      if (cldws) {
Chris@42: 	  for (i = 0; i < nthr; ++i)
Chris@42: 	       X(plan_destroy_internal)(cldws[i]);
Chris@42: 	  X(ifree)(cldws);
Chris@42:      }
Chris@42:      X(plan_destroy_internal)(cld);
Chris@42:      return (plan *) 0;
Chris@42: }
Chris@42: 
Chris@42: ct_solver *X(mksolver_ct_threads)(size_t size, INT r, int dec,
Chris@42: 				  ct_mkinferior mkcldw,
Chris@42: 				  ct_force_vrecursion force_vrecursionp)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_DFT, mkplan, 0 };
Chris@42:      ct_solver *slv = (ct_solver *) X(mksolver)(size, &sadt);
Chris@42:      slv->r = r;
Chris@42:      slv->dec = dec;
Chris@42:      slv->mkcldw = mkcldw;
Chris@42:      slv->force_vrecursionp = force_vrecursionp;
Chris@42:      return slv;
Chris@42: }