annotate src/fftw-3.3.8/mpi/rdft2-problem.c @ 82:d0c2a83c1364

Add FFTW 3.3.8 source, and a Linux build
author Chris Cannam
date Tue, 19 Nov 2019 14:52:55 +0000
parents
children
rev   line source
Chris@82 1 /*
Chris@82 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@82 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@82 4 *
Chris@82 5 * This program is free software; you can redistribute it and/or modify
Chris@82 6 * it under the terms of the GNU General Public License as published by
Chris@82 7 * the Free Software Foundation; either version 2 of the License, or
Chris@82 8 * (at your option) any later version.
Chris@82 9 *
Chris@82 10 * This program is distributed in the hope that it will be useful,
Chris@82 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@82 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@82 13 * GNU General Public License for more details.
Chris@82 14 *
Chris@82 15 * You should have received a copy of the GNU General Public License
Chris@82 16 * along with this program; if not, write to the Free Software
Chris@82 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@82 18 *
Chris@82 19 */
Chris@82 20
Chris@82 21 #include "mpi-rdft2.h"
Chris@82 22
Chris@82 23 static void destroy(problem *ego_)
Chris@82 24 {
Chris@82 25 problem_mpi_rdft2 *ego = (problem_mpi_rdft2 *) ego_;
Chris@82 26 XM(dtensor_destroy)(ego->sz);
Chris@82 27 MPI_Comm_free(&ego->comm);
Chris@82 28 X(ifree)(ego_);
Chris@82 29 }
Chris@82 30
Chris@82 31 static void hash(const problem *p_, md5 *m)
Chris@82 32 {
Chris@82 33 const problem_mpi_rdft2 *p = (const problem_mpi_rdft2 *) p_;
Chris@82 34 int i;
Chris@82 35 X(md5puts)(m, "mpi-rdft2");
Chris@82 36 X(md5int)(m, p->I == p->O);
Chris@82 37 /* don't include alignment -- may differ between processes
Chris@82 38 X(md5int)(m, X(ialignment_of)(p->I));
Chris@82 39 X(md5int)(m, X(ialignment_of)(p->O));
Chris@82 40 ... note that applicability of MPI plans does not depend
Chris@82 41 on alignment (although optimality may, in principle). */
Chris@82 42 XM(dtensor_md5)(m, p->sz);
Chris@82 43 X(md5INT)(m, p->vn);
Chris@82 44 X(md5int)(m, p->kind);
Chris@82 45 X(md5int)(m, p->flags);
Chris@82 46 MPI_Comm_size(p->comm, &i); X(md5int)(m, i);
Chris@82 47 A(XM(md5_equal)(*m, p->comm));
Chris@82 48 }
Chris@82 49
Chris@82 50 static void print(const problem *ego_, printer *p)
Chris@82 51 {
Chris@82 52 const problem_mpi_rdft2 *ego = (const problem_mpi_rdft2 *) ego_;
Chris@82 53 int i;
Chris@82 54 p->print(p, "(mpi-rdft2 %d %d %d ",
Chris@82 55 ego->I == ego->O,
Chris@82 56 X(ialignment_of)(ego->I),
Chris@82 57 X(ialignment_of)(ego->O));
Chris@82 58 XM(dtensor_print)(ego->sz, p);
Chris@82 59 p->print(p, " %D %d %d", ego->vn, (int) ego->kind, ego->flags);
Chris@82 60 MPI_Comm_size(ego->comm, &i); p->print(p, " %d)", i);
Chris@82 61 }
Chris@82 62
Chris@82 63 static void zero(const problem *ego_)
Chris@82 64 {
Chris@82 65 const problem_mpi_rdft2 *ego = (const problem_mpi_rdft2 *) ego_;
Chris@82 66 R *I = ego->I;
Chris@82 67 dtensor *sz;
Chris@82 68 INT i, N;
Chris@82 69 int my_pe;
Chris@82 70
Chris@82 71 sz = XM(dtensor_copy)(ego->sz);
Chris@82 72 sz->dims[sz->rnk - 1].n = sz->dims[sz->rnk - 1].n / 2 + 1;
Chris@82 73 MPI_Comm_rank(ego->comm, &my_pe);
Chris@82 74 N = 2 * ego->vn * XM(total_block)(sz, IB, my_pe);
Chris@82 75 XM(dtensor_destroy)(sz);
Chris@82 76 for (i = 0; i < N; ++i) I[i] = K(0.0);
Chris@82 77 }
Chris@82 78
Chris@82 79 static const problem_adt padt =
Chris@82 80 {
Chris@82 81 PROBLEM_MPI_RDFT2,
Chris@82 82 hash,
Chris@82 83 zero,
Chris@82 84 print,
Chris@82 85 destroy
Chris@82 86 };
Chris@82 87
Chris@82 88 problem *XM(mkproblem_rdft2)(const dtensor *sz, INT vn,
Chris@82 89 R *I, R *O,
Chris@82 90 MPI_Comm comm,
Chris@82 91 rdft_kind kind,
Chris@82 92 unsigned flags)
Chris@82 93 {
Chris@82 94 problem_mpi_rdft2 *ego =
Chris@82 95 (problem_mpi_rdft2 *)X(mkproblem)(sizeof(problem_mpi_rdft2), &padt);
Chris@82 96 int n_pes;
Chris@82 97
Chris@82 98 A(XM(dtensor_validp)(sz) && FINITE_RNK(sz->rnk) && sz->rnk > 1);
Chris@82 99 MPI_Comm_size(comm, &n_pes);
Chris@82 100 A(vn >= 0);
Chris@82 101 A(kind == R2HC || kind == HC2R);
Chris@82 102
Chris@82 103 /* enforce pointer equality if untainted pointers are equal */
Chris@82 104 if (UNTAINT(I) == UNTAINT(O))
Chris@82 105 I = O = JOIN_TAINT(I, O);
Chris@82 106
Chris@82 107 ego->sz = XM(dtensor_canonical)(sz, 0);
Chris@82 108 #ifdef FFTW_DEBUG
Chris@82 109 ego->sz->dims[sz->rnk - 1].n = sz->dims[sz->rnk - 1].n / 2 + 1;
Chris@82 110 A(n_pes >= XM(num_blocks_total)(ego->sz, IB)
Chris@82 111 && n_pes >= XM(num_blocks_total)(ego->sz, OB));
Chris@82 112 ego->sz->dims[sz->rnk - 1].n = sz->dims[sz->rnk - 1].n;
Chris@82 113 #endif
Chris@82 114
Chris@82 115 ego->vn = vn;
Chris@82 116 ego->I = I;
Chris@82 117 ego->O = O;
Chris@82 118 ego->kind = kind;
Chris@82 119
Chris@82 120 /* We only support TRANSPOSED_OUT for r2c and TRANSPOSED_IN for
Chris@82 121 c2r transforms. */
Chris@82 122
Chris@82 123 ego->flags = flags;
Chris@82 124
Chris@82 125 MPI_Comm_dup(comm, &ego->comm);
Chris@82 126
Chris@82 127 return &(ego->super);
Chris@82 128 }
Chris@82 129
Chris@82 130 problem *XM(mkproblem_rdft2_d)(dtensor *sz, INT vn,
Chris@82 131 R *I, R *O,
Chris@82 132 MPI_Comm comm,
Chris@82 133 rdft_kind kind,
Chris@82 134 unsigned flags)
Chris@82 135 {
Chris@82 136 problem *p = XM(mkproblem_rdft2)(sz, vn, I, O, comm, kind, flags);
Chris@82 137 XM(dtensor_destroy)(sz);
Chris@82 138 return p;
Chris@82 139 }