1 /* 2 * Copyright (c) 2003, 2007-14 Matteo Frigo 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology 4 * 5 * This program is free software; you can redistribute it and/or modify 6 * it under the terms of the GNU General Public License as published by 7 * the Free Software Foundation; either version 2 of the License, or 8 * (at your option) any later version. 9 * 10 * This program is distributed in the hope that it will be useful, 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * GNU General Public License for more details. 14 * 15 * You should have received a copy of the GNU General Public License 16 * along with this program; if not, write to the Free Software 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 18 * 19 */ 20 21 #include "ifftw-mpi.h" 22 23 /* r2c and c2r transforms. The sz dtensor, as usual, gives the size 24 of the "logical" complex array. For the last dimension N, however, 25 only N/2+1 complex numbers are stored for the complex data. Moreover, 26 for the real data, the last dimension is *always* padded to a size 27 2*(N/2+1). (Contrast this with the serial API, where there is only 28 padding for in-place plans.) */ 29 30 /* problem.c: */ 31 typedef struct { 32 problem super; 33 dtensor *sz; 34 INT vn; /* vector length (vector stride 1) */ 35 R *I, *O; /* contiguous interleaved arrays */ 36 37 rdft_kind kind; /* assert(kind < DHT) */ 38 unsigned flags; /* TRANSPOSED_IN/OUT meaningful for rnk>1 only 39 SCRAMBLED_IN/OUT meaningful for 1d transforms only */ 40 41 MPI_Comm comm; 42 } problem_mpi_rdft2; 43 44 problem *XM(mkproblem_rdft2)(const dtensor *sz, INT vn, 45 R *I, R *O, MPI_Comm comm, 46 rdft_kind kind, unsigned flags); 47 problem *XM(mkproblem_rdft2_d)(dtensor *sz, INT vn, 48 R *I, R *O, MPI_Comm comm, 49 rdft_kind kind, unsigned flags); 50 51 /* solve.c: */ 52 void XM(rdft2_solve)(const plan *ego_, const problem *p_); 53 54 /* plans have same operands as rdft plans, so just re-use */ 55 typedef plan_rdft plan_mpi_rdft2; 56 #define MKPLAN_MPI_RDFT2(type, adt, apply) \ 57 (type *)X(mkplan_rdft)(sizeof(type), adt, apply) 58 59 int XM(rdft2_serial_applicable)(const problem_mpi_rdft2 *p); 60 61 /* various solvers */ 62 void XM(rdft2_rank_geq2_register)(planner *p); 63 void XM(rdft2_rank_geq2_transposed_register)(planner *p); 64 void XM(rdft2_serial_register)(planner *p); 65