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: #include "ifftw-mpi.h"
cannam@95: 
cannam@95: /* r2c and c2r transforms.  The sz dtensor, as usual, gives the size
cannam@95:    of the "logical" complex array.  For the last dimension N, however,
cannam@95:    only N/2+1 complex numbers are stored for the complex data.  Moreover,
cannam@95:    for the real data, the last dimension is *always* padded to a size
cannam@95:    2*(N/2+1).  (Contrast this with the serial API, where there is only
cannam@95:    padding for in-place plans.) */
cannam@95: 
cannam@95: /* problem.c: */
cannam@95: typedef struct {
cannam@95:      problem super;
cannam@95:      dtensor *sz;
cannam@95:      INT vn; /* vector length (vector stride 1) */
cannam@95:      R *I, *O; /* contiguous interleaved arrays */
cannam@95: 
cannam@95:      rdft_kind kind; /* assert(kind < DHT) */
cannam@95:      unsigned flags; /* TRANSPOSED_IN/OUT meaningful for rnk>1 only
cannam@95: 			SCRAMBLED_IN/OUT meaningful for 1d transforms only */
cannam@95: 
cannam@95:      MPI_Comm comm;
cannam@95: } problem_mpi_rdft2;
cannam@95: 
cannam@95: problem *XM(mkproblem_rdft2)(const dtensor *sz, INT vn,
cannam@95: 			     R *I, R *O, MPI_Comm comm,
cannam@95: 			     rdft_kind kind, unsigned flags);
cannam@95: problem *XM(mkproblem_rdft2_d)(dtensor *sz, INT vn,
cannam@95: 			       R *I, R *O, MPI_Comm comm,
cannam@95: 			       rdft_kind kind, unsigned flags);
cannam@95: 
cannam@95: /* solve.c: */
cannam@95: void XM(rdft2_solve)(const plan *ego_, const problem *p_);
cannam@95: 
cannam@95: /* plans have same operands as rdft plans, so just re-use */
cannam@95: typedef plan_rdft plan_mpi_rdft2;
cannam@95: #define MKPLAN_MPI_RDFT2(type, adt, apply) \
cannam@95:   (type *)X(mkplan_rdft)(sizeof(type), adt, apply)
cannam@95: 
cannam@95: int XM(rdft2_serial_applicable)(const problem_mpi_rdft2 *p);
cannam@95: 
cannam@95: /* various solvers */
cannam@95: void XM(rdft2_rank_geq2_register)(planner *p);
cannam@95: void XM(rdft2_rank_geq2_transposed_register)(planner *p);
cannam@95: void XM(rdft2_serial_register)(planner *p);