Chris@10: /*
Chris@10: * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10: * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10: *
Chris@10: * This program is free software; you can redistribute it and/or modify
Chris@10: * it under the terms of the GNU General Public License as published by
Chris@10: * the Free Software Foundation; either version 2 of the License, or
Chris@10: * (at your option) any later version.
Chris@10: *
Chris@10: * This program is distributed in the hope that it will be useful,
Chris@10: * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10: * GNU General Public License for more details.
Chris@10: *
Chris@10: * You should have received a copy of the GNU General Public License
Chris@10: * along with this program; if not, write to the Free Software
Chris@10: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10: *
Chris@10: */
Chris@10:
Chris@10: #include "api.h"
Chris@10: #include "fftw3-mpi.h"
Chris@10: #include "ifftw-mpi.h"
Chris@10: #include "mpi-transpose.h"
Chris@10: #include "mpi-dft.h"
Chris@10: #include "mpi-rdft.h"
Chris@10: #include "mpi-rdft2.h"
Chris@10:
Chris@10: /* Convert API flags to internal MPI flags. */
Chris@10: #define MPI_FLAGS(f) ((f) >> 27)
Chris@10:
Chris@10: /*************************************************************************/
Chris@10:
Chris@10: static int mpi_inited = 0;
Chris@10:
Chris@10: static MPI_Comm problem_comm(const problem *p) {
Chris@10: switch (p->adt->problem_kind) {
Chris@10: case PROBLEM_MPI_DFT:
Chris@10: return ((const problem_mpi_dft *) p)->comm;
Chris@10: case PROBLEM_MPI_RDFT:
Chris@10: return ((const problem_mpi_rdft *) p)->comm;
Chris@10: case PROBLEM_MPI_RDFT2:
Chris@10: return ((const problem_mpi_rdft2 *) p)->comm;
Chris@10: case PROBLEM_MPI_TRANSPOSE:
Chris@10: return ((const problem_mpi_transpose *) p)->comm;
Chris@10: default:
Chris@10: return MPI_COMM_NULL;
Chris@10: }
Chris@10: }
Chris@10:
Chris@10: /* used to synchronize cost measurements (timing or estimation)
Chris@10: across all processes for an MPI problem, which is critical to
Chris@10: ensure that all processes decide to use the same MPI plans
Chris@10: (whereas serial plans need not be syncronized). */
Chris@10: static double cost_hook(const problem *p, double t, cost_kind k)
Chris@10: {
Chris@10: MPI_Comm comm = problem_comm(p);
Chris@10: double tsum;
Chris@10: if (comm == MPI_COMM_NULL) return t;
Chris@10: MPI_Allreduce(&t, &tsum, 1, MPI_DOUBLE,
Chris@10: k == COST_SUM ? MPI_SUM : MPI_MAX, comm);
Chris@10: return tsum;
Chris@10: }
Chris@10:
Chris@10: /* Used to reject wisdom that is not in sync across all processes
Chris@10: for an MPI problem, which is critical to ensure that all processes
Chris@10: decide to use the same MPI plans. (Even though costs are synchronized,
Chris@10: above, out-of-sync wisdom may result from plans being produced
Chris@10: by communicators that do not span all processes, either from a
Chris@10: user-specified communicator or e.g. from transpose-recurse. */
Chris@10: static int wisdom_ok_hook(const problem *p, flags_t flags)
Chris@10: {
Chris@10: MPI_Comm comm = problem_comm(p);
Chris@10: int eq_me, eq_all;
Chris@10: /* unpack flags bitfield, since MPI communications may involve
Chris@10: byte-order changes and MPI cannot do this for bit fields */
Chris@10: #if SIZEOF_UNSIGNED_INT >= 4 /* must be big enough to hold 20-bit fields */
Chris@10: unsigned int f[5];
Chris@10: #else
Chris@10: unsigned long f[5]; /* at least 32 bits as per C standard */
Chris@10: #endif
Chris@10:
Chris@10: if (comm == MPI_COMM_NULL) return 1; /* non-MPI wisdom is always ok */
Chris@10:
Chris@10: if (XM(any_true)(0, comm)) return 0; /* some process had nowisdom_hook */
Chris@10:
Chris@10: /* otherwise, check that the flags and solver index are identical
Chris@10: on all processes in this problem's communicator.
Chris@10:
Chris@10: TO DO: possibly we can relax strict equality, but it is
Chris@10: critical to ensure that any flags which affect what plan is
Chris@10: created (and whether the solver is applicable) are the same,
Chris@10: e.g. DESTROY_INPUT, NO_UGLY, etcetera. (If the MPI algorithm
Chris@10: differs between processes, deadlocks/crashes generally result.) */
Chris@10: f[0] = flags.l;
Chris@10: f[1] = flags.hash_info;
Chris@10: f[2] = flags.timelimit_impatience;
Chris@10: f[3] = flags.u;
Chris@10: f[4] = flags.slvndx;
Chris@10: MPI_Bcast(f, 5,
Chris@10: SIZEOF_UNSIGNED_INT >= 4 ? MPI_UNSIGNED : MPI_UNSIGNED_LONG,
Chris@10: 0, comm);
Chris@10: eq_me = f[0] == flags.l && f[1] == flags.hash_info
Chris@10: && f[2] == flags.timelimit_impatience
Chris@10: && f[3] == flags.u && f[4] == flags.slvndx;
Chris@10: MPI_Allreduce(&eq_me, &eq_all, 1, MPI_INT, MPI_LAND, comm);
Chris@10: return eq_all;
Chris@10: }
Chris@10:
Chris@10: /* This hook is called when wisdom is not found. The any_true here
Chris@10: matches up with the any_true in wisdom_ok_hook, in order to handle
Chris@10: the case where some processes had wisdom (and called wisdom_ok_hook)
Chris@10: and some processes didn't have wisdom (and called nowisdom_hook). */
Chris@10: static void nowisdom_hook(const problem *p)
Chris@10: {
Chris@10: MPI_Comm comm = problem_comm(p);
Chris@10: if (comm == MPI_COMM_NULL) return; /* nothing to do for non-MPI p */
Chris@10: XM(any_true)(1, comm); /* signal nowisdom to any wisdom_ok_hook */
Chris@10: }
Chris@10:
Chris@10: /* needed to synchronize planner bogosity flag, in case non-MPI problems
Chris@10: on a subset of processes encountered bogus wisdom */
Chris@10: static wisdom_state_t bogosity_hook(wisdom_state_t state, const problem *p)
Chris@10: {
Chris@10: MPI_Comm comm = problem_comm(p);
Chris@10: if (comm != MPI_COMM_NULL /* an MPI problem */
Chris@10: && XM(any_true)(state == WISDOM_IS_BOGUS, comm)) /* bogus somewhere */
Chris@10: return WISDOM_IS_BOGUS;
Chris@10: return state;
Chris@10: }
Chris@10:
Chris@10: void XM(init)(void)
Chris@10: {
Chris@10: if (!mpi_inited) {
Chris@10: planner *plnr = X(the_planner)();
Chris@10: plnr->cost_hook = cost_hook;
Chris@10: plnr->wisdom_ok_hook = wisdom_ok_hook;
Chris@10: plnr->nowisdom_hook = nowisdom_hook;
Chris@10: plnr->bogosity_hook = bogosity_hook;
Chris@10: XM(conf_standard)(plnr);
Chris@10: mpi_inited = 1;
Chris@10: }
Chris@10: }
Chris@10:
Chris@10: void XM(cleanup)(void)
Chris@10: {
Chris@10: X(cleanup)();
Chris@10: mpi_inited = 0;
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10:
Chris@10: static dtensor *mkdtensor_api(int rnk, const XM(ddim) *dims0)
Chris@10: {
Chris@10: dtensor *x = XM(mkdtensor)(rnk);
Chris@10: int i;
Chris@10: for (i = 0; i < rnk; ++i) {
Chris@10: x->dims[i].n = dims0[i].n;
Chris@10: x->dims[i].b[IB] = dims0[i].ib;
Chris@10: x->dims[i].b[OB] = dims0[i].ob;
Chris@10: }
Chris@10: return x;
Chris@10: }
Chris@10:
Chris@10: static dtensor *default_sz(int rnk, const XM(ddim) *dims0, int n_pes,
Chris@10: int rdft2)
Chris@10: {
Chris@10: dtensor *sz = XM(mkdtensor)(rnk);
Chris@10: dtensor *sz0 = mkdtensor_api(rnk, dims0);
Chris@10: block_kind k;
Chris@10: int i;
Chris@10:
Chris@10: for (i = 0; i < rnk; ++i)
Chris@10: sz->dims[i].n = dims0[i].n;
Chris@10:
Chris@10: if (rdft2) sz->dims[rnk-1].n = dims0[rnk-1].n / 2 + 1;
Chris@10:
Chris@10: for (i = 0; i < rnk; ++i) {
Chris@10: sz->dims[i].b[IB] = dims0[i].ib ? dims0[i].ib : sz->dims[i].n;
Chris@10: sz->dims[i].b[OB] = dims0[i].ob ? dims0[i].ob : sz->dims[i].n;
Chris@10: }
Chris@10:
Chris@10: /* If we haven't used all of the processes yet, and some of the
Chris@10: block sizes weren't specified (i.e. 0), then set the
Chris@10: unspecified blocks so as to use as many processes as
Chris@10: possible with as few distributed dimensions as possible. */
Chris@10: FORALL_BLOCK_KIND(k) {
Chris@10: INT nb = XM(num_blocks_total)(sz, k);
Chris@10: INT np = n_pes / nb;
Chris@10: for (i = 0; i < rnk && np > 1; ++i)
Chris@10: if (!sz0->dims[i].b[k]) {
Chris@10: sz->dims[i].b[k] = XM(default_block)(sz->dims[i].n, np);
Chris@10: nb *= XM(num_blocks)(sz->dims[i].n, sz->dims[i].b[k]);
Chris@10: np = n_pes / nb;
Chris@10: }
Chris@10: }
Chris@10:
Chris@10: if (rdft2) sz->dims[rnk-1].n = dims0[rnk-1].n;
Chris@10:
Chris@10: /* punt for 1d prime */
Chris@10: if (rnk == 1 && X(is_prime)(sz->dims[0].n))
Chris@10: sz->dims[0].b[IB] = sz->dims[0].b[OB] = sz->dims[0].n;
Chris@10:
Chris@10: XM(dtensor_destroy)(sz0);
Chris@10: sz0 = XM(dtensor_canonical)(sz, 0);
Chris@10: XM(dtensor_destroy)(sz);
Chris@10: return sz0;
Chris@10: }
Chris@10:
Chris@10: /* allocate simple local (serial) dims array corresponding to n[rnk] */
Chris@10: static XM(ddim) *simple_dims(int rnk, const ptrdiff_t *n)
Chris@10: {
Chris@10: XM(ddim) *dims = (XM(ddim) *) MALLOC(sizeof(XM(ddim)) * rnk,
Chris@10: TENSORS);
Chris@10: int i;
Chris@10: for (i = 0; i < rnk; ++i)
Chris@10: dims[i].n = dims[i].ib = dims[i].ob = n[i];
Chris@10: return dims;
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10:
Chris@10: static void local_size(int my_pe, const dtensor *sz, block_kind k,
Chris@10: ptrdiff_t *local_n, ptrdiff_t *local_start)
Chris@10: {
Chris@10: int i;
Chris@10: if (my_pe >= XM(num_blocks_total)(sz, k))
Chris@10: for (i = 0; i < sz->rnk; ++i)
Chris@10: local_n[i] = local_start[i] = 0;
Chris@10: else {
Chris@10: XM(block_coords)(sz, k, my_pe, local_start);
Chris@10: for (i = 0; i < sz->rnk; ++i) {
Chris@10: local_n[i] = XM(block)(sz->dims[i].n, sz->dims[i].b[k],
Chris@10: local_start[i]);
Chris@10: local_start[i] *= sz->dims[i].b[k];
Chris@10: }
Chris@10: }
Chris@10: }
Chris@10:
Chris@10: static INT prod(int rnk, const ptrdiff_t *local_n)
Chris@10: {
Chris@10: int i;
Chris@10: INT N = 1;
Chris@10: for (i = 0; i < rnk; ++i) N *= local_n[i];
Chris@10: return N;
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_guru)(int rnk, const XM(ddim) *dims0,
Chris@10: ptrdiff_t howmany, MPI_Comm comm,
Chris@10: ptrdiff_t *local_n_in,
Chris@10: ptrdiff_t *local_start_in,
Chris@10: ptrdiff_t *local_n_out,
Chris@10: ptrdiff_t *local_start_out,
Chris@10: int sign, unsigned flags)
Chris@10: {
Chris@10: INT N;
Chris@10: int my_pe, n_pes, i;
Chris@10: dtensor *sz;
Chris@10:
Chris@10: if (rnk == 0)
Chris@10: return howmany;
Chris@10:
Chris@10: MPI_Comm_rank(comm, &my_pe);
Chris@10: MPI_Comm_size(comm, &n_pes);
Chris@10: sz = default_sz(rnk, dims0, n_pes, 0);
Chris@10:
Chris@10: /* Now, we must figure out how much local space the user should
Chris@10: allocate (or at least an upper bound). This depends strongly
Chris@10: on the exact algorithms we employ...ugh! FIXME: get this info
Chris@10: from the solvers somehow? */
Chris@10: N = 1; /* never return zero allocation size */
Chris@10: if (rnk > 1 && XM(is_block1d)(sz, IB) && XM(is_block1d)(sz, OB)) {
Chris@10: INT Nafter;
Chris@10: ddim odims[2];
Chris@10:
Chris@10: /* dft-rank-geq2-transposed */
Chris@10: odims[0] = sz->dims[0]; odims[1] = sz->dims[1]; /* save */
Chris@10: /* we may need extra space for transposed intermediate data */
Chris@10: for (i = 0; i < 2; ++i)
Chris@10: if (XM(num_blocks)(sz->dims[i].n, sz->dims[i].b[IB]) == 1 &&
Chris@10: XM(num_blocks)(sz->dims[i].n, sz->dims[i].b[OB]) == 1) {
Chris@10: sz->dims[i].b[IB]
Chris@10: = XM(default_block)(sz->dims[i].n, n_pes);
Chris@10: sz->dims[1-i].b[IB] = sz->dims[1-i].n;
Chris@10: local_size(my_pe, sz, IB, local_n_in, local_start_in);
Chris@10: N = X(imax)(N, prod(rnk, local_n_in));
Chris@10: sz->dims[i] = odims[i];
Chris@10: sz->dims[1-i] = odims[1-i];
Chris@10: break;
Chris@10: }
Chris@10:
Chris@10: /* dft-rank-geq2 */
Chris@10: Nafter = howmany;
Chris@10: for (i = 1; i < sz->rnk; ++i) Nafter *= sz->dims[i].n;
Chris@10: N = X(imax)(N, (sz->dims[0].n
Chris@10: * XM(block)(Nafter, XM(default_block)(Nafter, n_pes),
Chris@10: my_pe) + howmany - 1) / howmany);
Chris@10:
Chris@10: /* dft-rank-geq2 with dimensions swapped */
Chris@10: Nafter = howmany * sz->dims[0].n;
Chris@10: for (i = 2; i < sz->rnk; ++i) Nafter *= sz->dims[i].n;
Chris@10: N = X(imax)(N, (sz->dims[1].n
Chris@10: * XM(block)(Nafter, XM(default_block)(Nafter, n_pes),
Chris@10: my_pe) + howmany - 1) / howmany);
Chris@10: }
Chris@10: else if (rnk == 1) {
Chris@10: if (howmany >= n_pes && !MPI_FLAGS(flags)) { /* dft-rank1-bigvec */
Chris@10: ptrdiff_t n[2], start[2];
Chris@10: dtensor *sz2 = XM(mkdtensor)(2);
Chris@10: sz2->dims[0] = sz->dims[0];
Chris@10: sz2->dims[0].b[IB] = sz->dims[0].n;
Chris@10: sz2->dims[1].n = sz2->dims[1].b[OB] = howmany;
Chris@10: sz2->dims[1].b[IB] = XM(default_block)(howmany, n_pes);
Chris@10: local_size(my_pe, sz2, IB, n, start);
Chris@10: XM(dtensor_destroy)(sz2);
Chris@10: N = X(imax)(N, (prod(2, n) + howmany - 1) / howmany);
Chris@10: }
Chris@10: else { /* dft-rank1 */
Chris@10: INT r, m, rblock[2], mblock[2];
Chris@10:
Chris@10: /* Since the 1d transforms are so different, we require
Chris@10: the user to call local_size_1d for this case. Ugh. */
Chris@10: CK(sign == FFTW_FORWARD || sign == FFTW_BACKWARD);
Chris@10:
Chris@10: if ((r = XM(choose_radix)(sz->dims[0], n_pes, flags, sign,
Chris@10: rblock, mblock))) {
Chris@10: m = sz->dims[0].n / r;
Chris@10: if (flags & FFTW_MPI_SCRAMBLED_IN)
Chris@10: sz->dims[0].b[IB] = rblock[IB] * m;
Chris@10: else { /* !SCRAMBLED_IN */
Chris@10: sz->dims[0].b[IB] = r * mblock[IB];
Chris@10: N = X(imax)(N, rblock[IB] * m);
Chris@10: }
Chris@10: if (flags & FFTW_MPI_SCRAMBLED_OUT)
Chris@10: sz->dims[0].b[OB] = r * mblock[OB];
Chris@10: else { /* !SCRAMBLED_OUT */
Chris@10: N = X(imax)(N, r * mblock[OB]);
Chris@10: sz->dims[0].b[OB] = rblock[OB] * m;
Chris@10: }
Chris@10: }
Chris@10: }
Chris@10: }
Chris@10:
Chris@10: local_size(my_pe, sz, IB, local_n_in, local_start_in);
Chris@10: local_size(my_pe, sz, OB, local_n_out, local_start_out);
Chris@10:
Chris@10: /* at least, make sure we have enough space to store input & output */
Chris@10: N = X(imax)(N, X(imax)(prod(rnk, local_n_in), prod(rnk, local_n_out)));
Chris@10:
Chris@10: XM(dtensor_destroy)(sz);
Chris@10: return N * howmany;
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_many_transposed)(int rnk, const ptrdiff_t *n,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t xblock, ptrdiff_t yblock,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx,
Chris@10: ptrdiff_t *local_x_start,
Chris@10: ptrdiff_t *local_ny,
Chris@10: ptrdiff_t *local_y_start)
Chris@10: {
Chris@10: ptrdiff_t N;
Chris@10: XM(ddim) *dims;
Chris@10: ptrdiff_t *local;
Chris@10:
Chris@10: if (rnk == 0) {
Chris@10: *local_nx = *local_ny = 1;
Chris@10: *local_x_start = *local_y_start = 0;
Chris@10: return howmany;
Chris@10: }
Chris@10:
Chris@10: dims = simple_dims(rnk, n);
Chris@10: local = (ptrdiff_t *) MALLOC(sizeof(ptrdiff_t) * rnk * 4, TENSORS);
Chris@10:
Chris@10: /* default 1d block distribution, with transposed output
Chris@10: if yblock < n[1] */
Chris@10: dims[0].ib = xblock;
Chris@10: if (rnk > 1) {
Chris@10: if (yblock < n[1])
Chris@10: dims[1].ob = yblock;
Chris@10: else
Chris@10: dims[0].ob = xblock;
Chris@10: }
Chris@10: else
Chris@10: dims[0].ob = xblock; /* FIXME: 1d not really supported here
Chris@10: since we don't have flags/sign */
Chris@10:
Chris@10: N = XM(local_size_guru)(rnk, dims, howmany, comm,
Chris@10: local, local + rnk,
Chris@10: local + 2*rnk, local + 3*rnk,
Chris@10: 0, 0);
Chris@10: *local_nx = local[0];
Chris@10: *local_x_start = local[rnk];
Chris@10: if (rnk > 1) {
Chris@10: *local_ny = local[2*rnk + 1];
Chris@10: *local_y_start = local[3*rnk + 1];
Chris@10: }
Chris@10: else {
Chris@10: *local_ny = *local_nx;
Chris@10: *local_y_start = *local_x_start;
Chris@10: }
Chris@10: X(ifree)(local);
Chris@10: X(ifree)(dims);
Chris@10: return N;
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_many)(int rnk, const ptrdiff_t *n,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t xblock,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx,
Chris@10: ptrdiff_t *local_x_start)
Chris@10: {
Chris@10: ptrdiff_t local_ny, local_y_start;
Chris@10: return XM(local_size_many_transposed)(rnk, n, howmany,
Chris@10: xblock, rnk > 1
Chris@10: ? n[1] : FFTW_MPI_DEFAULT_BLOCK,
Chris@10: comm,
Chris@10: local_nx, local_x_start,
Chris@10: &local_ny, &local_y_start);
Chris@10: }
Chris@10:
Chris@10:
Chris@10: ptrdiff_t XM(local_size_transposed)(int rnk, const ptrdiff_t *n,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx,
Chris@10: ptrdiff_t *local_x_start,
Chris@10: ptrdiff_t *local_ny,
Chris@10: ptrdiff_t *local_y_start)
Chris@10: {
Chris@10: return XM(local_size_many_transposed)(rnk, n, 1,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: comm,
Chris@10: local_nx, local_x_start,
Chris@10: local_ny, local_y_start);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size)(int rnk, const ptrdiff_t *n,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx,
Chris@10: ptrdiff_t *local_x_start)
Chris@10: {
Chris@10: return XM(local_size_many)(rnk, n, 1, FFTW_MPI_DEFAULT_BLOCK, comm,
Chris@10: local_nx, local_x_start);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_many_1d)(ptrdiff_t nx, ptrdiff_t howmany,
Chris@10: MPI_Comm comm, int sign, unsigned flags,
Chris@10: ptrdiff_t *local_nx, ptrdiff_t *local_x_start,
Chris@10: ptrdiff_t *local_ny, ptrdiff_t *local_y_start)
Chris@10: {
Chris@10: XM(ddim) d;
Chris@10: d.n = nx;
Chris@10: d.ib = d.ob = FFTW_MPI_DEFAULT_BLOCK;
Chris@10: return XM(local_size_guru)(1, &d, howmany, comm,
Chris@10: local_nx, local_x_start,
Chris@10: local_ny, local_y_start, sign, flags);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_1d)(ptrdiff_t nx,
Chris@10: MPI_Comm comm, int sign, unsigned flags,
Chris@10: ptrdiff_t *local_nx, ptrdiff_t *local_x_start,
Chris@10: ptrdiff_t *local_ny, ptrdiff_t *local_y_start)
Chris@10: {
Chris@10: return XM(local_size_many_1d)(nx, 1, comm, sign, flags,
Chris@10: local_nx, local_x_start,
Chris@10: local_ny, local_y_start);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_2d_transposed)(ptrdiff_t nx, ptrdiff_t ny,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx,
Chris@10: ptrdiff_t *local_x_start,
Chris@10: ptrdiff_t *local_ny,
Chris@10: ptrdiff_t *local_y_start)
Chris@10: {
Chris@10: ptrdiff_t n[2];
Chris@10: n[0] = nx; n[1] = ny;
Chris@10: return XM(local_size_transposed)(2, n, comm,
Chris@10: local_nx, local_x_start,
Chris@10: local_ny, local_y_start);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_2d)(ptrdiff_t nx, ptrdiff_t ny, MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx, ptrdiff_t *local_x_start)
Chris@10: {
Chris@10: ptrdiff_t n[2];
Chris@10: n[0] = nx; n[1] = ny;
Chris@10: return XM(local_size)(2, n, comm, local_nx, local_x_start);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_3d_transposed)(ptrdiff_t nx, ptrdiff_t ny,
Chris@10: ptrdiff_t nz,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx,
Chris@10: ptrdiff_t *local_x_start,
Chris@10: ptrdiff_t *local_ny,
Chris@10: ptrdiff_t *local_y_start)
Chris@10: {
Chris@10: ptrdiff_t n[3];
Chris@10: n[0] = nx; n[1] = ny; n[2] = nz;
Chris@10: return XM(local_size_transposed)(3, n, comm,
Chris@10: local_nx, local_x_start,
Chris@10: local_ny, local_y_start);
Chris@10: }
Chris@10:
Chris@10: ptrdiff_t XM(local_size_3d)(ptrdiff_t nx, ptrdiff_t ny, ptrdiff_t nz,
Chris@10: MPI_Comm comm,
Chris@10: ptrdiff_t *local_nx, ptrdiff_t *local_x_start)
Chris@10: {
Chris@10: ptrdiff_t n[3];
Chris@10: n[0] = nx; n[1] = ny; n[2] = nz;
Chris@10: return XM(local_size)(3, n, comm, local_nx, local_x_start);
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10: /* Transpose API */
Chris@10:
Chris@10: X(plan) XM(plan_many_transpose)(ptrdiff_t nx, ptrdiff_t ny,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t xblock, ptrdiff_t yblock,
Chris@10: R *in, R *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: int n_pes;
Chris@10: XM(init)();
Chris@10:
Chris@10: if (howmany < 0 || xblock < 0 || yblock < 0 ||
Chris@10: nx <= 0 || ny <= 0) return 0;
Chris@10:
Chris@10: MPI_Comm_size(comm, &n_pes);
Chris@10: if (!xblock) xblock = XM(default_block)(nx, n_pes);
Chris@10: if (!yblock) yblock = XM(default_block)(ny, n_pes);
Chris@10: if (n_pes < XM(num_blocks)(nx, xblock)
Chris@10: || n_pes < XM(num_blocks)(ny, yblock))
Chris@10: return 0;
Chris@10:
Chris@10: return
Chris@10: X(mkapiplan)(FFTW_FORWARD, flags,
Chris@10: XM(mkproblem_transpose)(nx, ny, howmany,
Chris@10: in, out, xblock, yblock,
Chris@10: comm, MPI_FLAGS(flags)));
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_transpose)(ptrdiff_t nx, ptrdiff_t ny, R *in, R *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10:
Chris@10: {
Chris@10: return XM(plan_many_transpose)(nx, ny, 1,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10: /* Complex DFT API */
Chris@10:
Chris@10: X(plan) XM(plan_guru_dft)(int rnk, const XM(ddim) *dims0,
Chris@10: ptrdiff_t howmany,
Chris@10: C *in, C *out,
Chris@10: MPI_Comm comm, int sign, unsigned flags)
Chris@10: {
Chris@10: int n_pes, i;
Chris@10: dtensor *sz;
Chris@10:
Chris@10: XM(init)();
Chris@10:
Chris@10: if (howmany < 0 || rnk < 1) return 0;
Chris@10: for (i = 0; i < rnk; ++i)
Chris@10: if (dims0[i].n < 1 || dims0[i].ib < 0 || dims0[i].ob < 0)
Chris@10: return 0;
Chris@10:
Chris@10: MPI_Comm_size(comm, &n_pes);
Chris@10: sz = default_sz(rnk, dims0, n_pes, 0);
Chris@10:
Chris@10: if (XM(num_blocks_total)(sz, IB) > n_pes
Chris@10: || XM(num_blocks_total)(sz, OB) > n_pes) {
Chris@10: XM(dtensor_destroy)(sz);
Chris@10: return 0;
Chris@10: }
Chris@10:
Chris@10: return
Chris@10: X(mkapiplan)(sign, flags,
Chris@10: XM(mkproblem_dft_d)(sz, howmany,
Chris@10: (R *) in, (R *) out,
Chris@10: comm, sign,
Chris@10: MPI_FLAGS(flags)));
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_many_dft)(int rnk, const ptrdiff_t *n,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t iblock, ptrdiff_t oblock,
Chris@10: C *in, C *out,
Chris@10: MPI_Comm comm, int sign, unsigned flags)
Chris@10: {
Chris@10: XM(ddim) *dims = simple_dims(rnk, n);
Chris@10: X(plan) pln;
Chris@10:
Chris@10: if (rnk == 1) {
Chris@10: dims[0].ib = iblock;
Chris@10: dims[0].ob = oblock;
Chris@10: }
Chris@10: else if (rnk > 1) {
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_IN)].ib = iblock;
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_OUT)].ob = oblock;
Chris@10: }
Chris@10:
Chris@10: pln = XM(plan_guru_dft)(rnk,dims,howmany, in,out, comm, sign, flags);
Chris@10: X(ifree)(dims);
Chris@10: return pln;
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft)(int rnk, const ptrdiff_t *n, C *in, C *out,
Chris@10: MPI_Comm comm, int sign, unsigned flags)
Chris@10: {
Chris@10: return XM(plan_many_dft)(rnk, n, 1,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: in, out, comm, sign, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_1d)(ptrdiff_t nx, C *in, C *out,
Chris@10: MPI_Comm comm, int sign, unsigned flags)
Chris@10: {
Chris@10: return XM(plan_dft)(1, &nx, in, out, comm, sign, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_2d)(ptrdiff_t nx, ptrdiff_t ny, C *in, C *out,
Chris@10: MPI_Comm comm, int sign, unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[2];
Chris@10: n[0] = nx; n[1] = ny;
Chris@10: return XM(plan_dft)(2, n, in, out, comm, sign, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_3d)(ptrdiff_t nx, ptrdiff_t ny, ptrdiff_t nz,
Chris@10: C *in, C *out,
Chris@10: MPI_Comm comm, int sign, unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[3];
Chris@10: n[0] = nx; n[1] = ny; n[2] = nz;
Chris@10: return XM(plan_dft)(3, n, in, out, comm, sign, flags);
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10: /* R2R API */
Chris@10:
Chris@10: X(plan) XM(plan_guru_r2r)(int rnk, const XM(ddim) *dims0,
Chris@10: ptrdiff_t howmany,
Chris@10: R *in, R *out,
Chris@10: MPI_Comm comm, const X(r2r_kind) *kind,
Chris@10: unsigned flags)
Chris@10: {
Chris@10: int n_pes, i;
Chris@10: dtensor *sz;
Chris@10: rdft_kind *k;
Chris@10: X(plan) pln;
Chris@10:
Chris@10: XM(init)();
Chris@10:
Chris@10: if (howmany < 0 || rnk < 1) return 0;
Chris@10: for (i = 0; i < rnk; ++i)
Chris@10: if (dims0[i].n < 1 || dims0[i].ib < 0 || dims0[i].ob < 0)
Chris@10: return 0;
Chris@10:
Chris@10: k = X(map_r2r_kind)(rnk, kind);
Chris@10:
Chris@10: MPI_Comm_size(comm, &n_pes);
Chris@10: sz = default_sz(rnk, dims0, n_pes, 0);
Chris@10:
Chris@10: if (XM(num_blocks_total)(sz, IB) > n_pes
Chris@10: || XM(num_blocks_total)(sz, OB) > n_pes) {
Chris@10: XM(dtensor_destroy)(sz);
Chris@10: return 0;
Chris@10: }
Chris@10:
Chris@10: pln = X(mkapiplan)(0, flags,
Chris@10: XM(mkproblem_rdft_d)(sz, howmany,
Chris@10: in, out,
Chris@10: comm, k, MPI_FLAGS(flags)));
Chris@10: X(ifree0)(k);
Chris@10: return pln;
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_many_r2r)(int rnk, const ptrdiff_t *n,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t iblock, ptrdiff_t oblock,
Chris@10: R *in, R *out,
Chris@10: MPI_Comm comm, const X(r2r_kind) *kind,
Chris@10: unsigned flags)
Chris@10: {
Chris@10: XM(ddim) *dims = simple_dims(rnk, n);
Chris@10: X(plan) pln;
Chris@10:
Chris@10: if (rnk == 1) {
Chris@10: dims[0].ib = iblock;
Chris@10: dims[0].ob = oblock;
Chris@10: }
Chris@10: else if (rnk > 1) {
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_IN)].ib = iblock;
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_OUT)].ob = oblock;
Chris@10: }
Chris@10:
Chris@10: pln = XM(plan_guru_r2r)(rnk,dims,howmany, in,out, comm, kind, flags);
Chris@10: X(ifree)(dims);
Chris@10: return pln;
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_r2r)(int rnk, const ptrdiff_t *n, R *in, R *out,
Chris@10: MPI_Comm comm,
Chris@10: const X(r2r_kind) *kind,
Chris@10: unsigned flags)
Chris@10: {
Chris@10: return XM(plan_many_r2r)(rnk, n, 1,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: in, out, comm, kind, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_r2r_2d)(ptrdiff_t nx, ptrdiff_t ny, R *in, R *out,
Chris@10: MPI_Comm comm,
Chris@10: X(r2r_kind) kindx, X(r2r_kind) kindy,
Chris@10: unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[2];
Chris@10: X(r2r_kind) kind[2];
Chris@10: n[0] = nx; n[1] = ny;
Chris@10: kind[0] = kindx; kind[1] = kindy;
Chris@10: return XM(plan_r2r)(2, n, in, out, comm, kind, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_r2r_3d)(ptrdiff_t nx, ptrdiff_t ny, ptrdiff_t nz,
Chris@10: R *in, R *out,
Chris@10: MPI_Comm comm,
Chris@10: X(r2r_kind) kindx, X(r2r_kind) kindy,
Chris@10: X(r2r_kind) kindz,
Chris@10: unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[3];
Chris@10: X(r2r_kind) kind[3];
Chris@10: n[0] = nx; n[1] = ny; n[2] = nz;
Chris@10: kind[0] = kindx; kind[1] = kindy; kind[2] = kindz;
Chris@10: return XM(plan_r2r)(3, n, in, out, comm, kind, flags);
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10: /* R2C/C2R API */
Chris@10:
Chris@10: static X(plan) plan_guru_rdft2(int rnk, const XM(ddim) *dims0,
Chris@10: ptrdiff_t howmany,
Chris@10: R *r, C *c,
Chris@10: MPI_Comm comm, rdft_kind kind, unsigned flags)
Chris@10: {
Chris@10: int n_pes, i;
Chris@10: dtensor *sz;
Chris@10: R *cr = (R *) c;
Chris@10:
Chris@10: XM(init)();
Chris@10:
Chris@10: if (howmany < 0 || rnk < 2) return 0;
Chris@10: for (i = 0; i < rnk; ++i)
Chris@10: if (dims0[i].n < 1 || dims0[i].ib < 0 || dims0[i].ob < 0)
Chris@10: return 0;
Chris@10:
Chris@10: MPI_Comm_size(comm, &n_pes);
Chris@10: sz = default_sz(rnk, dims0, n_pes, 1);
Chris@10:
Chris@10: sz->dims[rnk-1].n = dims0[rnk-1].n / 2 + 1;
Chris@10: if (XM(num_blocks_total)(sz, IB) > n_pes
Chris@10: || XM(num_blocks_total)(sz, OB) > n_pes) {
Chris@10: XM(dtensor_destroy)(sz);
Chris@10: return 0;
Chris@10: }
Chris@10: sz->dims[rnk-1].n = dims0[rnk-1].n;
Chris@10:
Chris@10: if (kind == R2HC)
Chris@10: return X(mkapiplan)(0, flags,
Chris@10: XM(mkproblem_rdft2_d)(sz, howmany,
Chris@10: r, cr, comm, R2HC,
Chris@10: MPI_FLAGS(flags)));
Chris@10: else
Chris@10: return X(mkapiplan)(0, flags,
Chris@10: XM(mkproblem_rdft2_d)(sz, howmany,
Chris@10: cr, r, comm, HC2R,
Chris@10: MPI_FLAGS(flags)));
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_many_dft_r2c)(int rnk, const ptrdiff_t *n,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t iblock, ptrdiff_t oblock,
Chris@10: R *in, C *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: XM(ddim) *dims = simple_dims(rnk, n);
Chris@10: X(plan) pln;
Chris@10:
Chris@10: if (rnk == 1) {
Chris@10: dims[0].ib = iblock;
Chris@10: dims[0].ob = oblock;
Chris@10: }
Chris@10: else if (rnk > 1) {
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_IN)].ib = iblock;
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_OUT)].ob = oblock;
Chris@10: }
Chris@10:
Chris@10: pln = plan_guru_rdft2(rnk,dims,howmany, in,out, comm, R2HC, flags);
Chris@10: X(ifree)(dims);
Chris@10: return pln;
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_many_dft_c2r)(int rnk, const ptrdiff_t *n,
Chris@10: ptrdiff_t howmany,
Chris@10: ptrdiff_t iblock, ptrdiff_t oblock,
Chris@10: C *in, R *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: XM(ddim) *dims = simple_dims(rnk, n);
Chris@10: X(plan) pln;
Chris@10:
Chris@10: if (rnk == 1) {
Chris@10: dims[0].ib = iblock;
Chris@10: dims[0].ob = oblock;
Chris@10: }
Chris@10: else if (rnk > 1) {
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_IN)].ib = iblock;
Chris@10: dims[0 != (flags & FFTW_MPI_TRANSPOSED_OUT)].ob = oblock;
Chris@10: }
Chris@10:
Chris@10: pln = plan_guru_rdft2(rnk,dims,howmany, out,in, comm, HC2R, flags);
Chris@10: X(ifree)(dims);
Chris@10: return pln;
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_r2c)(int rnk, const ptrdiff_t *n, R *in, C *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: return XM(plan_many_dft_r2c)(rnk, n, 1,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_r2c_2d)(ptrdiff_t nx, ptrdiff_t ny, R *in, C *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[2];
Chris@10: n[0] = nx; n[1] = ny;
Chris@10: return XM(plan_dft_r2c)(2, n, in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_r2c_3d)(ptrdiff_t nx, ptrdiff_t ny, ptrdiff_t nz,
Chris@10: R *in, C *out, MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[3];
Chris@10: n[0] = nx; n[1] = ny; n[2] = nz;
Chris@10: return XM(plan_dft_r2c)(3, n, in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_c2r)(int rnk, const ptrdiff_t *n, C *in, R *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: return XM(plan_many_dft_c2r)(rnk, n, 1,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: FFTW_MPI_DEFAULT_BLOCK,
Chris@10: in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_c2r_2d)(ptrdiff_t nx, ptrdiff_t ny, C *in, R *out,
Chris@10: MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[2];
Chris@10: n[0] = nx; n[1] = ny;
Chris@10: return XM(plan_dft_c2r)(2, n, in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: X(plan) XM(plan_dft_c2r_3d)(ptrdiff_t nx, ptrdiff_t ny, ptrdiff_t nz,
Chris@10: C *in, R *out, MPI_Comm comm, unsigned flags)
Chris@10: {
Chris@10: ptrdiff_t n[3];
Chris@10: n[0] = nx; n[1] = ny; n[2] = nz;
Chris@10: return XM(plan_dft_c2r)(3, n, in, out, comm, flags);
Chris@10: }
Chris@10:
Chris@10: /*************************************************************************/
Chris@10: /* New-array execute functions */
Chris@10:
Chris@10: void XM(execute_dft)(const X(plan) p, C *in, C *out) {
Chris@10: /* internally, MPI plans are just rdft plans */
Chris@10: X(execute_r2r)(p, (R*) in, (R*) out);
Chris@10: }
Chris@10:
Chris@10: void XM(execute_dft_r2c)(const X(plan) p, R *in, C *out) {
Chris@10: /* internally, MPI plans are just rdft plans */
Chris@10: X(execute_r2r)(p, in, (R*) out);
Chris@10: }
Chris@10:
Chris@10: void XM(execute_dft_c2r)(const X(plan) p, C *in, R *out) {
Chris@10: /* internally, MPI plans are just rdft plans */
Chris@10: X(execute_r2r)(p, (R*) in, out);
Chris@10: }
Chris@10:
Chris@10: void XM(execute_r2r)(const X(plan) p, R *in, R *out) {
Chris@10: /* internally, MPI plans are just rdft plans */
Chris@10: X(execute_r2r)(p, in, out);
Chris@10: }