|
Chris@42
|
1 /*
|
|
Chris@42
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
Chris@42
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
Chris@42
|
4 *
|
|
Chris@42
|
5 * This program is free software; you can redistribute it and/or modify
|
|
Chris@42
|
6 * it under the terms of the GNU General Public License as published by
|
|
Chris@42
|
7 * the Free Software Foundation; either version 2 of the License, or
|
|
Chris@42
|
8 * (at your option) any later version.
|
|
Chris@42
|
9 *
|
|
Chris@42
|
10 * This program is distributed in the hope that it will be useful,
|
|
Chris@42
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Chris@42
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Chris@42
|
13 * GNU General Public License for more details.
|
|
Chris@42
|
14 *
|
|
Chris@42
|
15 * You should have received a copy of the GNU General Public License
|
|
Chris@42
|
16 * along with this program; if not, write to the Free Software
|
|
Chris@42
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
Chris@42
|
18 *
|
|
Chris@42
|
19 */
|
|
Chris@42
|
20
|
|
Chris@42
|
21 #include "ifftw-mpi.h"
|
|
Chris@42
|
22
|
|
Chris@42
|
23 /* problem.c: */
|
|
Chris@42
|
24 typedef struct {
|
|
Chris@42
|
25 problem super;
|
|
Chris@42
|
26 dtensor *sz;
|
|
Chris@42
|
27 INT vn; /* vector length (vector stride 1) */
|
|
Chris@42
|
28 R *I, *O; /* contiguous interleaved arrays */
|
|
Chris@42
|
29
|
|
Chris@42
|
30 int sign; /* FFTW_FORWARD / FFTW_BACKWARD */
|
|
Chris@42
|
31 unsigned flags; /* TRANSPOSED_IN/OUT meaningful for rnk>1 only
|
|
Chris@42
|
32 SCRAMBLED_IN/OUT meaningful for 1d transforms only */
|
|
Chris@42
|
33
|
|
Chris@42
|
34 MPI_Comm comm;
|
|
Chris@42
|
35 } problem_mpi_dft;
|
|
Chris@42
|
36
|
|
Chris@42
|
37 problem *XM(mkproblem_dft)(const dtensor *sz, INT vn,
|
|
Chris@42
|
38 R *I, R *O, MPI_Comm comm,
|
|
Chris@42
|
39 int sign, unsigned flags);
|
|
Chris@42
|
40 problem *XM(mkproblem_dft_d)(dtensor *sz, INT vn,
|
|
Chris@42
|
41 R *I, R *O, MPI_Comm comm,
|
|
Chris@42
|
42 int sign, unsigned flags);
|
|
Chris@42
|
43
|
|
Chris@42
|
44 /* solve.c: */
|
|
Chris@42
|
45 void XM(dft_solve)(const plan *ego_, const problem *p_);
|
|
Chris@42
|
46
|
|
Chris@42
|
47 /* plans have same operands as rdft plans, so just re-use */
|
|
Chris@42
|
48 typedef plan_rdft plan_mpi_dft;
|
|
Chris@42
|
49 #define MKPLAN_MPI_DFT(type, adt, apply) \
|
|
Chris@42
|
50 (type *)X(mkplan_rdft)(sizeof(type), adt, apply)
|
|
Chris@42
|
51
|
|
Chris@42
|
52 int XM(dft_serial_applicable)(const problem_mpi_dft *p);
|
|
Chris@42
|
53
|
|
Chris@42
|
54 /* various solvers */
|
|
Chris@42
|
55 void XM(dft_rank_geq2_register)(planner *p);
|
|
Chris@42
|
56 void XM(dft_rank_geq2_transposed_register)(planner *p);
|
|
Chris@42
|
57 void XM(dft_serial_register)(planner *p);
|
|
Chris@42
|
58 void XM(dft_rank1_bigvec_register)(planner *p);
|
|
Chris@42
|
59 void XM(dft_rank1_register)(planner *p);
|
