annotate src/fftw-3.3.3/mpi/dft-problem.c @ 83:ae30d91d2ffe

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