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:      solver super;
Chris@42:      int vecloop_dim;
Chris@42:      const int *buddies;
Chris@42:      size_t nbuddies;
Chris@42: } S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_rdft super;
Chris@42:      plan **cldrn;
Chris@42:      INT its, ots;
Chris@42:      int nthr;
Chris@42:      const S *solver;
Chris@42: } P;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      INT its, ots;
Chris@42:      R *I, *O;
Chris@42:      plan **cldrn;
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:      plan_rdft *cld = (plan_rdft *) ego->cldrn[d->thr_num];
Chris@42: 
Chris@42:      cld->apply((plan *) cld,
Chris@42: 		ego->I + thr_num * ego->its, ego->O + thr_num * ego->ots);
Chris@42:      return 0;
Chris@42: }
Chris@42: 
Chris@42: static void apply(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      PD d;
Chris@42: 
Chris@42:      d.its = ego->its;
Chris@42:      d.ots = ego->ots;
Chris@42:      d.cldrn = ego->cldrn;
Chris@42:      d.I = I; d.O = O;
Chris@42: 
Chris@42:      X(spawn_loop)(ego->nthr, ego->nthr, spawn_apply, (void*) &d);
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:      for (i = 0; i < ego->nthr; ++i)
Chris@42: 	  X(plan_awake)(ego->cldrn[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:      for (i = 0; i < ego->nthr; ++i)
Chris@42: 	  X(plan_destroy_internal)(ego->cldrn[i]);
Chris@42:      X(ifree)(ego->cldrn);
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 *s = ego->solver;
Chris@42:      int i;
Chris@42:      p->print(p, "(rdft-thr-vrank>=1-x%d/%d", ego->nthr, s->vecloop_dim);
Chris@42:      for (i = 0; i < ego->nthr; ++i)
Chris@42: 	  if (i == 0 || (ego->cldrn[i] != ego->cldrn[i-1] &&
Chris@42: 			 (i <= 1 || ego->cldrn[i] != ego->cldrn[i-2])))
Chris@42: 	       p->print(p, "%(%p%)", ego->cldrn[i]);
Chris@42:      p->putchr(p, ')');
Chris@42: }
Chris@42: 
Chris@42: static int pickdim(const S *ego, const tensor *vecsz, int oop, int *dp)
Chris@42: {
Chris@42:      return X(pickdim)(ego->vecloop_dim, ego->buddies, ego->nbuddies,
Chris@42: 		       vecsz, oop, dp);
Chris@42: }
Chris@42: 
Chris@42: static int applicable0(const solver *ego_, const problem *p_,
Chris@42: 		       const planner *plnr, int *dp)
Chris@42: {
Chris@42:      const S *ego = (const S *) ego_;
Chris@42:      const problem_rdft *p = (const problem_rdft *) p_;
Chris@42: 
Chris@42:      return (1
Chris@42: 	     && plnr->nthr > 1
Chris@42: 	     && FINITE_RNK(p->vecsz->rnk)
Chris@42: 	     && p->vecsz->rnk > 0
Chris@42: 	     && pickdim(ego, p->vecsz, p->I != p->O, dp)
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static int applicable(const solver *ego_, const problem *p_,
Chris@42: 		      const planner *plnr, int *dp)
Chris@42: {
Chris@42:      const S *ego = (const S *)ego_;
Chris@42: 
Chris@42:      if (!applicable0(ego_, p_, plnr, dp)) return 0;
Chris@42: 
Chris@42:      /* fftw2 behavior */
Chris@42:      if (NO_VRANK_SPLITSP(plnr) && (ego->vecloop_dim != ego->buddies[0]))
Chris@42: 	  return 0;
Chris@42: 
Chris@42:      return 1;
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const S *ego = (const S *) ego_;
Chris@42:      const problem_rdft *p;
Chris@42:      P *pln;
Chris@42:      problem *cldp;
Chris@42:      int vdim;
Chris@42:      iodim *d;
Chris@42:      plan **cldrn = (plan **) 0;
Chris@42:      int i, nthr;
Chris@42:      INT its, ots, block_size;
Chris@42:      tensor *vecsz;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      if (!applicable(ego_, p_, plnr, &vdim))
Chris@42:           return (plan *) 0;
Chris@42:      p = (const problem_rdft *) p_;
Chris@42: 
Chris@42:      d = p->vecsz->dims + vdim;
Chris@42: 
Chris@42:      block_size = (d->n + plnr->nthr - 1) / plnr->nthr;
Chris@42:      nthr = (int)((d->n + block_size - 1) / block_size);
Chris@42:      plnr->nthr = (plnr->nthr + nthr - 1) / nthr;
Chris@42:      its = d->is * block_size;
Chris@42:      ots = d->os * block_size;
Chris@42: 
Chris@42:      cldrn = (plan **)MALLOC(sizeof(plan *) * nthr, PLANS);
Chris@42:      for (i = 0; i < nthr; ++i) cldrn[i] = (plan *) 0;
Chris@42:      
Chris@42:      vecsz = X(tensor_copy)(p->vecsz);
Chris@42:      for (i = 0; i < nthr; ++i) {
Chris@42: 	  vecsz->dims[vdim].n =
Chris@42: 	       (i == nthr - 1) ? (d->n - i*block_size) : block_size;
Chris@42: 	  cldp = X(mkproblem_rdft)(p->sz, vecsz,
Chris@42: 				   p->I + i*its, p->O + i*ots, p->kind);
Chris@42: 	  cldrn[i] = X(mkplan_d)(plnr, cldp);
Chris@42: 	  if (!cldrn[i]) goto nada;
Chris@42:      }
Chris@42:      X(tensor_destroy)(vecsz);
Chris@42: 
Chris@42:      pln = MKPLAN_RDFT(P, &padt, apply);
Chris@42: 
Chris@42:      pln->cldrn = cldrn;
Chris@42:      pln->its = its;
Chris@42:      pln->ots = ots;
Chris@42:      pln->nthr = nthr;
Chris@42: 
Chris@42:      pln->solver = ego;
Chris@42:      X(ops_zero)(&pln->super.super.ops);
Chris@42:      pln->super.super.pcost = 0;
Chris@42:      for (i = 0; i < nthr; ++i) {
Chris@42: 	  X(ops_add2)(&cldrn[i]->ops, &pln->super.super.ops);
Chris@42: 	  pln->super.super.pcost += cldrn[i]->pcost;
Chris@42:      }
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: 
Chris@42:  nada:
Chris@42:      if (cldrn) {
Chris@42: 	  for (i = 0; i < nthr; ++i)
Chris@42: 	       X(plan_destroy_internal)(cldrn[i]);
Chris@42: 	  X(ifree)(cldrn);
Chris@42:      }
Chris@42:      X(tensor_destroy)(vecsz);
Chris@42:      return (plan *) 0;
Chris@42: }
Chris@42: 
Chris@42: static solver *mksolver(int vecloop_dim, const int *buddies, size_t nbuddies)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
Chris@42:      S *slv = MKSOLVER(S, &sadt);
Chris@42:      slv->vecloop_dim = vecloop_dim;
Chris@42:      slv->buddies = buddies;
Chris@42:      slv->nbuddies = nbuddies;
Chris@42:      return &(slv->super);
Chris@42: }
Chris@42: 
Chris@42: void X(rdft_thr_vrank_geq1_register)(planner *p)
Chris@42: {
Chris@42:      int i;
Chris@42: 
Chris@42:      /* FIXME: Should we try other vecloop_dim values? */
Chris@42:      static const int buddies[] = { 1, -1 };
Chris@42: 
Chris@42:      for (i = 0; i < NELEM(buddies); ++i)
Chris@42:           REGISTER_SOLVER(p, mksolver(buddies[i], buddies, NELEM(buddies)));
Chris@42: }