annotate fft/fftw/fftw-3.3.4/mpi/rdft2-problem.c @ 40:223f770b5341 kissfft-double tip

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