cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: /* Complex RDFTs of rank >= 2, for the case where we are distributed
cannam@167:    across the first dimension only, and the output is not transposed. */
cannam@167: 
cannam@167: #include "mpi-rdft.h"
cannam@167: 
cannam@167: typedef struct {
cannam@167:      solver super;
cannam@167:      int preserve_input; /* preserve input even if DESTROY_INPUT was passed */
cannam@167: } S;
cannam@167: 
cannam@167: typedef struct {
cannam@167:      plan_mpi_rdft super;
cannam@167: 
cannam@167:      plan *cld1, *cld2;
cannam@167:      int preserve_input;
cannam@167: } P;
cannam@167: 
cannam@167: static void apply(const plan *ego_, R *I, R *O)
cannam@167: {
cannam@167:      const P *ego = (const P *) ego_;
cannam@167:      plan_rdft *cld1, *cld2;
cannam@167:      
cannam@167:      /* RDFT local dimensions */
cannam@167:      cld1 = (plan_rdft *) ego->cld1;
cannam@167:      if (ego->preserve_input) {
cannam@167: 	  cld1->apply(ego->cld1, I, O);
cannam@167: 	  I = O;
cannam@167:      }
cannam@167:      else
cannam@167: 	  cld1->apply(ego->cld1, I, I);
cannam@167: 
cannam@167:      /* RDFT non-local dimension (via rdft-rank1-bigvec, usually): */
cannam@167:      cld2 = (plan_rdft *) ego->cld2;
cannam@167:      cld2->apply(ego->cld2, I, O);
cannam@167: }
cannam@167: 
cannam@167: static int applicable(const S *ego, const problem *p_,
cannam@167: 		      const planner *plnr)
cannam@167: {
cannam@167:      const problem_mpi_rdft *p = (const problem_mpi_rdft *) p_;
cannam@167:      return (1
cannam@167: 	     && p->sz->rnk > 1
cannam@167: 	     && p->flags == 0 /* TRANSPOSED/SCRAMBLED_IN/OUT not supported */
cannam@167: 	     && (!ego->preserve_input || (!NO_DESTROY_INPUTP(plnr)
cannam@167: 					  && p->I != p->O))
cannam@167: 	     && XM(is_local_after)(1, p->sz, IB)
cannam@167: 	     && XM(is_local_after)(1, p->sz, OB)
cannam@167: 	     && (!NO_SLOWP(plnr) /* slow if rdft-serial is applicable */
cannam@167: 		 || !XM(rdft_serial_applicable)(p))
cannam@167: 	  );
cannam@167: }
cannam@167: 
cannam@167: static void awake(plan *ego_, enum wakefulness wakefulness)
cannam@167: {
cannam@167:      P *ego = (P *) ego_;
cannam@167:      X(plan_awake)(ego->cld1, wakefulness);
cannam@167:      X(plan_awake)(ego->cld2, wakefulness);
cannam@167: }
cannam@167: 
cannam@167: static void destroy(plan *ego_)
cannam@167: {
cannam@167:      P *ego = (P *) ego_;
cannam@167:      X(plan_destroy_internal)(ego->cld2);
cannam@167:      X(plan_destroy_internal)(ego->cld1);
cannam@167: }
cannam@167: 
cannam@167: static void print(const plan *ego_, printer *p)
cannam@167: {
cannam@167:      const P *ego = (const P *) ego_;
cannam@167:      p->print(p, "(mpi-rdft-rank-geq2%s%(%p%)%(%p%))", 
cannam@167: 	      ego->preserve_input==2 ?"/p":"", ego->cld1, ego->cld2);
cannam@167: }
cannam@167: 
cannam@167: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
cannam@167: {
cannam@167:      const S *ego = (const S *) ego_;
cannam@167:      const problem_mpi_rdft *p;
cannam@167:      P *pln;
cannam@167:      plan *cld1 = 0, *cld2 = 0;
cannam@167:      R *I, *O, *I2;
cannam@167:      tensor *sz;
cannam@167:      dtensor *sz2;
cannam@167:      int i, my_pe, n_pes;
cannam@167:      INT nrest;
cannam@167:      static const plan_adt padt = {
cannam@167:           XM(rdft_solve), awake, print, destroy
cannam@167:      };
cannam@167: 
cannam@167:      UNUSED(ego);
cannam@167: 
cannam@167:      if (!applicable(ego, p_, plnr))
cannam@167:           return (plan *) 0;
cannam@167: 
cannam@167:      p = (const problem_mpi_rdft *) p_;
cannam@167: 
cannam@167:      I2 = I = p->I;
cannam@167:      O = p->O;
cannam@167:      if (ego->preserve_input || NO_DESTROY_INPUTP(plnr)) 
cannam@167: 	  I = O; 
cannam@167:      MPI_Comm_rank(p->comm, &my_pe);
cannam@167:      MPI_Comm_size(p->comm, &n_pes);
cannam@167: 
cannam@167:      sz = X(mktensor)(p->sz->rnk - 1); /* tensor of last rnk-1 dimensions */
cannam@167:      i = p->sz->rnk - 2; A(i >= 0);
cannam@167:      sz->dims[i].n = p->sz->dims[i+1].n;
cannam@167:      sz->dims[i].is = sz->dims[i].os = p->vn;
cannam@167:      for (--i; i >= 0; --i) {
cannam@167: 	  sz->dims[i].n = p->sz->dims[i+1].n;
cannam@167: 	  sz->dims[i].is = sz->dims[i].os = sz->dims[i+1].n * sz->dims[i+1].is;
cannam@167:      }
cannam@167:      nrest = X(tensor_sz)(sz);
cannam@167:      {
cannam@167:           INT is = sz->dims[0].n * sz->dims[0].is;
cannam@167:           INT b = XM(block)(p->sz->dims[0].n, p->sz->dims[0].b[IB], my_pe);
cannam@167: 	  cld1 = X(mkplan_d)(plnr,
cannam@167:                              X(mkproblem_rdft_d)(sz,
cannam@167: 						 X(mktensor_2d)(b, is, is,
cannam@167: 								p->vn, 1, 1),
cannam@167: 						 I2, I, p->kind + 1));
cannam@167: 	  if (XM(any_true)(!cld1, p->comm)) goto nada;
cannam@167:      }
cannam@167: 
cannam@167:      sz2 = XM(mkdtensor)(1); /* tensor for first (distributed) dimension */
cannam@167:      sz2->dims[0] = p->sz->dims[0];
cannam@167:      cld2 = X(mkplan_d)(plnr, XM(mkproblem_rdft_d)(sz2, nrest * p->vn,
cannam@167: 						   I, O,
cannam@167: 						   p->comm, p->kind,
cannam@167: 						   RANK1_BIGVEC_ONLY));
cannam@167:      if (XM(any_true)(!cld2, p->comm)) goto nada;
cannam@167: 
cannam@167:      pln = MKPLAN_MPI_RDFT(P, &padt, apply);
cannam@167:      pln->cld1 = cld1;
cannam@167:      pln->cld2 = cld2;
cannam@167:      pln->preserve_input = ego->preserve_input ? 2 : NO_DESTROY_INPUTP(plnr);
cannam@167: 
cannam@167:      X(ops_add)(&cld1->ops, &cld2->ops, &pln->super.super.ops);
cannam@167: 
cannam@167:      return &(pln->super.super);
cannam@167: 
cannam@167:  nada:
cannam@167:      X(plan_destroy_internal)(cld2);
cannam@167:      X(plan_destroy_internal)(cld1);
cannam@167:      return (plan *) 0;
cannam@167: }
cannam@167: 
cannam@167: static solver *mksolver(int preserve_input)
cannam@167: {
cannam@167:      static const solver_adt sadt = { PROBLEM_MPI_RDFT, mkplan, 0 };
cannam@167:      S *slv = MKSOLVER(S, &sadt);
cannam@167:      slv->preserve_input = preserve_input;
cannam@167:      return &(slv->super);
cannam@167: }
cannam@167: 
cannam@167: void XM(rdft_rank_geq2_register)(planner *p)
cannam@167: {
cannam@167:      int preserve_input;
cannam@167:      for (preserve_input = 0; preserve_input <= 1; ++preserve_input)
cannam@167: 	  REGISTER_SOLVER(p, mksolver(preserve_input));
cannam@167: }