/*
 * Copyright (c) 2003, 2007-11 Matteo Frigo
 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */

#include "ifftw-mpi.h"

/* r2c and c2r transforms.  The sz dtensor, as usual, gives the size
   of the "logical" complex array.  For the last dimension N, however,
   only N/2+1 complex numbers are stored for the complex data.  Moreover,
   for the real data, the last dimension is *always* padded to a size
   2*(N/2+1).  (Contrast this with the serial API, where there is only
   padding for in-place plans.) */

/* problem.c: */
typedef struct {
     problem super;
     dtensor *sz;
     INT vn; /* vector length (vector stride 1) */
     R *I, *O; /* contiguous interleaved arrays */

     rdft_kind kind; /* assert(kind < DHT) */
     unsigned flags; /* TRANSPOSED_IN/OUT meaningful for rnk>1 only
			SCRAMBLED_IN/OUT meaningful for 1d transforms only */

     MPI_Comm comm;
} problem_mpi_rdft2;

problem *XM(mkproblem_rdft2)(const dtensor *sz, INT vn,
			     R *I, R *O, MPI_Comm comm,
			     rdft_kind kind, unsigned flags);
problem *XM(mkproblem_rdft2_d)(dtensor *sz, INT vn,
			       R *I, R *O, MPI_Comm comm,
			       rdft_kind kind, unsigned flags);

/* solve.c: */
void XM(rdft2_solve)(const plan *ego_, const problem *p_);

/* plans have same operands as rdft plans, so just re-use */
typedef plan_rdft plan_mpi_rdft2;
#define MKPLAN_MPI_RDFT2(type, adt, apply) \
  (type *)X(mkplan_rdft)(sizeof(type), adt, apply)

int XM(rdft2_serial_applicable)(const problem_mpi_rdft2 *p);

/* various solvers */
void XM(rdft2_rank_geq2_register)(planner *p);
void XM(rdft2_rank_geq2_transposed_register)(planner *p);
void XM(rdft2_serial_register)(planner *p);