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: /* "MPI" DFTs where all of the data is on one processor...just
Chris@42:    call through to serial API. */
Chris@42: 
Chris@42: #include "mpi-dft.h"
Chris@42: #include "dft.h"
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_mpi_dft super;
Chris@42:      plan *cld;
Chris@42:      INT roff, ioff;
Chris@42: } P;
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:      plan_dft *cld;
Chris@42:      INT roff = ego->roff, ioff = ego->ioff;
Chris@42:      cld = (plan_dft *) ego->cld;
Chris@42:      cld->apply(ego->cld, I+roff, I+ioff, O+roff, O+ioff);
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_awake)(ego->cld, wakefulness);
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_destroy_internal)(ego->cld);
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:      p->print(p, "(mpi-dft-serial %(%p%))", ego->cld);
Chris@42: }
Chris@42: 
Chris@42: int XM(dft_serial_applicable)(const problem_mpi_dft *p)
Chris@42: {
Chris@42:      return (1
Chris@42: 	     && p->flags == 0 /* TRANSPOSED/SCRAMBLED_IN/OUT not supported */
Chris@42: 	     && ((XM(is_local)(p->sz, IB) && XM(is_local)(p->sz, OB))
Chris@42: 		 || p->vn == 0));
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const problem_mpi_dft *p = (const problem_mpi_dft *) p_;
Chris@42:      P *pln;
Chris@42:      plan *cld;
Chris@42:      int my_pe;
Chris@42:      R *ri, *ii, *ro, *io;
Chris@42:      static const plan_adt padt = {
Chris@42:           XM(dft_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      UNUSED(ego);
Chris@42: 
Chris@42:      /* check whether applicable: */
Chris@42:      if (!XM(dft_serial_applicable)(p))
Chris@42:           return (plan *) 0;
Chris@42: 
Chris@42:      X(extract_reim)(p->sign, p->I, &ri, &ii);
Chris@42:      X(extract_reim)(p->sign, p->O, &ro, &io);
Chris@42: 
Chris@42:      MPI_Comm_rank(p->comm, &my_pe);
Chris@42:      if (my_pe == 0 && p->vn > 0) {
Chris@42: 	  int i, rnk = p->sz->rnk;
Chris@42: 	  tensor *sz = X(mktensor)(p->sz->rnk);
Chris@42: 	  sz->dims[rnk - 1].is = sz->dims[rnk - 1].os = 2 * p->vn;
Chris@42: 	  sz->dims[rnk - 1].n = p->sz->dims[rnk - 1].n;
Chris@42: 	  for (i = rnk - 1; i > 0; --i) {
Chris@42: 	       sz->dims[i - 1].is = sz->dims[i - 1].os = 
Chris@42: 		    sz->dims[i].is * sz->dims[i].n;
Chris@42: 	       sz->dims[i - 1].n = p->sz->dims[i - 1].n;
Chris@42: 	  }
Chris@42: 	  
Chris@42: 	  cld = X(mkplan_d)(plnr,
Chris@42: 			    X(mkproblem_dft_d)(sz,
Chris@42: 					       X(mktensor_1d)(p->vn, 2, 2),
Chris@42: 					       ri, ii, ro, io));
Chris@42:      }
Chris@42:      else { /* idle process: make nop plan */
Chris@42: 	  cld = X(mkplan_d)(plnr,
Chris@42: 			    X(mkproblem_dft_d)(X(mktensor_0d)(),
Chris@42: 					       X(mktensor_1d)(0,0,0),
Chris@42: 					       ri, ii, ro, io));
Chris@42:      }
Chris@42:      if (XM(any_true)(!cld, p->comm)) return (plan *) 0;
Chris@42: 
Chris@42:      pln = MKPLAN_MPI_DFT(P, &padt, apply);
Chris@42:      pln->cld = cld;
Chris@42:      pln->roff = ro - p->O;
Chris@42:      pln->ioff = io - p->O;
Chris@42:      X(ops_cpy)(&cld->ops, &pln->super.super.ops);
Chris@42:      return &(pln->super.super);
Chris@42: }
Chris@42: 
Chris@42: static solver *mksolver(void)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_MPI_DFT, mkplan, 0 };
Chris@42:      return MKSOLVER(solver, &sadt);
Chris@42: }
Chris@42: 
Chris@42: void XM(dft_serial_register)(planner *p)
Chris@42: {
Chris@42:      REGISTER_SOLVER(p, mksolver());
Chris@42: }