cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: 
cannam@95: #include "threads.h"
cannam@95: 
cannam@95: typedef struct {
cannam@95:      solver super;
cannam@95:      int vecloop_dim;
cannam@95:      const int *buddies;
cannam@95:      int nbuddies;
cannam@95: } S;
cannam@95: 
cannam@95: typedef struct {
cannam@95:      plan_rdft super;
cannam@95:      plan **cldrn;
cannam@95:      INT its, ots;
cannam@95:      int nthr;
cannam@95:      const S *solver;
cannam@95: } P;
cannam@95: 
cannam@95: typedef struct {
cannam@95:      INT its, ots;
cannam@95:      R *I, *O;
cannam@95:      plan **cldrn;
cannam@95: } PD;
cannam@95: 
cannam@95: static void *spawn_apply(spawn_data *d)
cannam@95: {
cannam@95:      PD *ego = (PD *) d->data;
cannam@95:      int thr_num = d->thr_num;
cannam@95:      plan_rdft *cld = (plan_rdft *) ego->cldrn[d->thr_num];
cannam@95: 
cannam@95:      cld->apply((plan *) cld,
cannam@95: 		ego->I + thr_num * ego->its, ego->O + thr_num * ego->ots);
cannam@95:      return 0;
cannam@95: }
cannam@95: 
cannam@95: static void apply(const plan *ego_, R *I, R *O)
cannam@95: {
cannam@95:      const P *ego = (const P *) ego_;
cannam@95:      PD d;
cannam@95: 
cannam@95:      d.its = ego->its;
cannam@95:      d.ots = ego->ots;
cannam@95:      d.cldrn = ego->cldrn;
cannam@95:      d.I = I; d.O = O;
cannam@95: 
cannam@95:      X(spawn_loop)(ego->nthr, ego->nthr, spawn_apply, (void*) &d);
cannam@95: }
cannam@95: 
cannam@95: static void awake(plan *ego_, enum wakefulness wakefulness)
cannam@95: {
cannam@95:      P *ego = (P *) ego_;
cannam@95:      int i;
cannam@95:      for (i = 0; i < ego->nthr; ++i)
cannam@95: 	  X(plan_awake)(ego->cldrn[i], wakefulness);
cannam@95: }
cannam@95: 
cannam@95: static void destroy(plan *ego_)
cannam@95: {
cannam@95:      P *ego = (P *) ego_;
cannam@95:      int i;
cannam@95:      for (i = 0; i < ego->nthr; ++i)
cannam@95: 	  X(plan_destroy_internal)(ego->cldrn[i]);
cannam@95:      X(ifree)(ego->cldrn);
cannam@95: }
cannam@95: 
cannam@95: static void print(const plan *ego_, printer *p)
cannam@95: {
cannam@95:      const P *ego = (const P *) ego_;
cannam@95:      const S *s = ego->solver;
cannam@95:      int i;
cannam@95:      p->print(p, "(rdft-thr-vrank>=1-x%d/%d", ego->nthr, s->vecloop_dim);
cannam@95:      for (i = 0; i < ego->nthr; ++i)
cannam@95: 	  if (i == 0 || (ego->cldrn[i] != ego->cldrn[i-1] &&
cannam@95: 			 (i <= 1 || ego->cldrn[i] != ego->cldrn[i-2])))
cannam@95: 	       p->print(p, "%(%p%)", ego->cldrn[i]);
cannam@95:      p->putchr(p, ')');
cannam@95: }
cannam@95: 
cannam@95: static int pickdim(const S *ego, const tensor *vecsz, int oop, int *dp)
cannam@95: {
cannam@95:      return X(pickdim)(ego->vecloop_dim, ego->buddies, ego->nbuddies,
cannam@95: 		       vecsz, oop, dp);
cannam@95: }
cannam@95: 
cannam@95: static int applicable0(const solver *ego_, const problem *p_,
cannam@95: 		       const planner *plnr, int *dp)
cannam@95: {
cannam@95:      const S *ego = (const S *) ego_;
cannam@95:      const problem_rdft *p = (const problem_rdft *) p_;
cannam@95: 
cannam@95:      return (1
cannam@95: 	     && plnr->nthr > 1
cannam@95: 	     && FINITE_RNK(p->vecsz->rnk)
cannam@95: 	     && p->vecsz->rnk > 0
cannam@95: 	     && pickdim(ego, p->vecsz, p->I != p->O, dp)
cannam@95: 	  );
cannam@95: }
cannam@95: 
cannam@95: static int applicable(const solver *ego_, const problem *p_,
cannam@95: 		      const planner *plnr, int *dp)
cannam@95: {
cannam@95:      const S *ego = (const S *)ego_;
cannam@95: 
cannam@95:      if (!applicable0(ego_, p_, plnr, dp)) return 0;
cannam@95: 
cannam@95:      /* fftw2 behavior */
cannam@95:      if (NO_VRANK_SPLITSP(plnr) && (ego->vecloop_dim != ego->buddies[0]))
cannam@95: 	  return 0;
cannam@95: 
cannam@95:      return 1;
cannam@95: }
cannam@95: 
cannam@95: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
cannam@95: {
cannam@95:      const S *ego = (const S *) ego_;
cannam@95:      const problem_rdft *p;
cannam@95:      P *pln;
cannam@95:      problem *cldp;
cannam@95:      int vdim;
cannam@95:      iodim *d;
cannam@95:      plan **cldrn = (plan **) 0;
cannam@95:      int i, nthr;
cannam@95:      INT its, ots, block_size;
cannam@95:      tensor *vecsz;
cannam@95: 
cannam@95:      static const plan_adt padt = {
cannam@95: 	  X(rdft_solve), awake, print, destroy
cannam@95:      };
cannam@95: 
cannam@95:      if (!applicable(ego_, p_, plnr, &vdim))
cannam@95:           return (plan *) 0;
cannam@95:      p = (const problem_rdft *) p_;
cannam@95: 
cannam@95:      d = p->vecsz->dims + vdim;
cannam@95: 
cannam@95:      block_size = (d->n + plnr->nthr - 1) / plnr->nthr;
cannam@95:      nthr = (int)((d->n + block_size - 1) / block_size);
cannam@95:      plnr->nthr = (plnr->nthr + nthr - 1) / nthr;
cannam@95:      its = d->is * block_size;
cannam@95:      ots = d->os * block_size;
cannam@95: 
cannam@95:      cldrn = (plan **)MALLOC(sizeof(plan *) * nthr, PLANS);
cannam@95:      for (i = 0; i < nthr; ++i) cldrn[i] = (plan *) 0;
cannam@95:      
cannam@95:      vecsz = X(tensor_copy)(p->vecsz);
cannam@95:      for (i = 0; i < nthr; ++i) {
cannam@95: 	  vecsz->dims[vdim].n =
cannam@95: 	       (i == nthr - 1) ? (d->n - i*block_size) : block_size;
cannam@95: 	  cldp = X(mkproblem_rdft)(p->sz, vecsz,
cannam@95: 				   p->I + i*its, p->O + i*ots, p->kind);
cannam@95: 	  cldrn[i] = X(mkplan_d)(plnr, cldp);
cannam@95: 	  if (!cldrn[i]) goto nada;
cannam@95:      }
cannam@95:      X(tensor_destroy)(vecsz);
cannam@95: 
cannam@95:      pln = MKPLAN_RDFT(P, &padt, apply);
cannam@95: 
cannam@95:      pln->cldrn = cldrn;
cannam@95:      pln->its = its;
cannam@95:      pln->ots = ots;
cannam@95:      pln->nthr = nthr;
cannam@95: 
cannam@95:      pln->solver = ego;
cannam@95:      X(ops_zero)(&pln->super.super.ops);
cannam@95:      pln->super.super.pcost = 0;
cannam@95:      for (i = 0; i < nthr; ++i) {
cannam@95: 	  X(ops_add2)(&cldrn[i]->ops, &pln->super.super.ops);
cannam@95: 	  pln->super.super.pcost += cldrn[i]->pcost;
cannam@95:      }
cannam@95: 
cannam@95:      return &(pln->super.super);
cannam@95: 
cannam@95:  nada:
cannam@95:      if (cldrn) {
cannam@95: 	  for (i = 0; i < nthr; ++i)
cannam@95: 	       X(plan_destroy_internal)(cldrn[i]);
cannam@95: 	  X(ifree)(cldrn);
cannam@95:      }
cannam@95:      X(tensor_destroy)(vecsz);
cannam@95:      return (plan *) 0;
cannam@95: }
cannam@95: 
cannam@95: static solver *mksolver(int vecloop_dim, const int *buddies, int nbuddies)
cannam@95: {
cannam@95:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
cannam@95:      S *slv = MKSOLVER(S, &sadt);
cannam@95:      slv->vecloop_dim = vecloop_dim;
cannam@95:      slv->buddies = buddies;
cannam@95:      slv->nbuddies = nbuddies;
cannam@95:      return &(slv->super);
cannam@95: }
cannam@95: 
cannam@95: void X(rdft_thr_vrank_geq1_register)(planner *p)
cannam@95: {
cannam@95:      int i;
cannam@95: 
cannam@95:      /* FIXME: Should we try other vecloop_dim values? */
cannam@95:      static const int buddies[] = { 1, -1 };
cannam@95: 
cannam@95:      const int nbuddies = (int)(sizeof(buddies) / sizeof(buddies[0]));
cannam@95: 
cannam@95:      for (i = 0; i < nbuddies; ++i)
cannam@95:           REGISTER_SOLVER(p, mksolver(buddies[i], buddies, nbuddies));
cannam@95: }