annotate fft/fftw/fftw-3.3.4/mpi/rdft-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-rdft.h"
Chris@19 22
Chris@19 23 static void destroy(problem *ego_)
Chris@19 24 {
Chris@19 25 problem_mpi_rdft *ego = (problem_mpi_rdft *) ego_;
Chris@19 26 XM(dtensor_destroy)(ego->sz);
Chris@19 27 MPI_Comm_free(&ego->comm);
Chris@19 28 #if !defined(STRUCT_HACK_C99) && !defined(STRUCT_HACK_KR)
Chris@19 29 X(ifree0)(ego->kind);
Chris@19 30 #endif
Chris@19 31 X(ifree)(ego_);
Chris@19 32 }
Chris@19 33
Chris@19 34 static void hash(const problem *p_, md5 *m)
Chris@19 35 {
Chris@19 36 const problem_mpi_rdft *p = (const problem_mpi_rdft *) p_;
Chris@19 37 int i;
Chris@19 38 X(md5puts)(m, "mpi-dft");
Chris@19 39 X(md5int)(m, p->I == p->O);
Chris@19 40 /* don't include alignment -- may differ between processes
Chris@19 41 X(md5int)(m, X(alignment_of)(p->I));
Chris@19 42 X(md5int)(m, X(alignment_of)(p->O));
Chris@19 43 ... note that applicability of MPI plans does not depend
Chris@19 44 on alignment (although optimality may, in principle). */
Chris@19 45 XM(dtensor_md5)(m, p->sz);
Chris@19 46 X(md5INT)(m, p->vn);
Chris@19 47 for (i = 0; i < p->sz->rnk; ++i)
Chris@19 48 X(md5int)(m, p->kind[i]);
Chris@19 49 X(md5int)(m, p->flags);
Chris@19 50 MPI_Comm_size(p->comm, &i); X(md5int)(m, i);
Chris@19 51 A(XM(md5_equal)(*m, p->comm));
Chris@19 52 }
Chris@19 53
Chris@19 54 static void print(const problem *ego_, printer *p)
Chris@19 55 {
Chris@19 56 const problem_mpi_rdft *ego = (const problem_mpi_rdft *) ego_;
Chris@19 57 int i;
Chris@19 58 p->print(p, "(mpi-rdft %d %d %d ",
Chris@19 59 ego->I == ego->O,
Chris@19 60 X(alignment_of)(ego->I),
Chris@19 61 X(alignment_of)(ego->O));
Chris@19 62 XM(dtensor_print)(ego->sz, p);
Chris@19 63 for (i = 0; i < ego->sz->rnk; ++i)
Chris@19 64 p->print(p, " %d", (int)ego->kind[i]);
Chris@19 65 p->print(p, " %D %d", ego->vn, ego->flags);
Chris@19 66 MPI_Comm_size(ego->comm, &i); p->print(p, " %d)", i);
Chris@19 67 }
Chris@19 68
Chris@19 69 static void zero(const problem *ego_)
Chris@19 70 {
Chris@19 71 const problem_mpi_rdft *ego = (const problem_mpi_rdft *) ego_;
Chris@19 72 R *I = ego->I;
Chris@19 73 INT i, N;
Chris@19 74 int my_pe;
Chris@19 75
Chris@19 76 MPI_Comm_rank(ego->comm, &my_pe);
Chris@19 77 N = ego->vn * XM(total_block)(ego->sz, IB, my_pe);
Chris@19 78 for (i = 0; i < N; ++i) I[i] = K(0.0);
Chris@19 79 }
Chris@19 80
Chris@19 81 static const problem_adt padt =
Chris@19 82 {
Chris@19 83 PROBLEM_MPI_RDFT,
Chris@19 84 hash,
Chris@19 85 zero,
Chris@19 86 print,
Chris@19 87 destroy
Chris@19 88 };
Chris@19 89
Chris@19 90 problem *XM(mkproblem_rdft)(const dtensor *sz, INT vn,
Chris@19 91 R *I, R *O,
Chris@19 92 MPI_Comm comm,
Chris@19 93 const rdft_kind *kind, unsigned flags)
Chris@19 94 {
Chris@19 95 problem_mpi_rdft *ego;
Chris@19 96 int i, rnk = sz->rnk;
Chris@19 97 int n_pes;
Chris@19 98
Chris@19 99 A(XM(dtensor_validp)(sz) && FINITE_RNK(sz->rnk));
Chris@19 100 MPI_Comm_size(comm, &n_pes);
Chris@19 101 A(n_pes >= XM(num_blocks_total)(sz, IB)
Chris@19 102 && n_pes >= XM(num_blocks_total)(sz, OB));
Chris@19 103 A(vn >= 0);
Chris@19 104
Chris@19 105 #if defined(STRUCT_HACK_KR)
Chris@19 106 ego = (problem_mpi_rdft *) X(mkproblem)(sizeof(problem_mpi_rdft)
Chris@19 107 + sizeof(rdft_kind)
Chris@19 108 * (rnk > 0 ? rnk - 1 : 0), &padt);
Chris@19 109 #elif defined(STRUCT_HACK_C99)
Chris@19 110 ego = (problem_mpi_rdft *) X(mkproblem)(sizeof(problem_mpi_rdft)
Chris@19 111 + sizeof(rdft_kind) * rnk, &padt);
Chris@19 112 #else
Chris@19 113 ego = (problem_mpi_rdft *) X(mkproblem)(sizeof(problem_mpi_rdft), &padt);
Chris@19 114 ego->kind = (rdft_kind *) MALLOC(sizeof(rdft_kind) * rnk, PROBLEMS);
Chris@19 115 #endif
Chris@19 116
Chris@19 117 /* enforce pointer equality if untainted pointers are equal */
Chris@19 118 if (UNTAINT(I) == UNTAINT(O))
Chris@19 119 I = O = JOIN_TAINT(I, O);
Chris@19 120
Chris@19 121 ego->sz = XM(dtensor_canonical)(sz, 0);
Chris@19 122 ego->vn = vn;
Chris@19 123 ego->I = I;
Chris@19 124 ego->O = O;
Chris@19 125 for (i = 0; i< ego->sz->rnk; ++i)
Chris@19 126 ego->kind[i] = kind[i];
Chris@19 127
Chris@19 128 /* canonicalize: replace TRANSPOSED_IN with TRANSPOSED_OUT by
Chris@19 129 swapping the first two dimensions (for rnk > 1) */
Chris@19 130 if ((flags & TRANSPOSED_IN) && ego->sz->rnk > 1) {
Chris@19 131 rdft_kind k = ego->kind[0];
Chris@19 132 ddim dim0 = ego->sz->dims[0];
Chris@19 133 ego->sz->dims[0] = ego->sz->dims[1];
Chris@19 134 ego->sz->dims[1] = dim0;
Chris@19 135 ego->kind[0] = ego->kind[1];
Chris@19 136 ego->kind[1] = k;
Chris@19 137 flags &= ~TRANSPOSED_IN;
Chris@19 138 flags ^= TRANSPOSED_OUT;
Chris@19 139 }
Chris@19 140 ego->flags = flags;
Chris@19 141
Chris@19 142 MPI_Comm_dup(comm, &ego->comm);
Chris@19 143
Chris@19 144 return &(ego->super);
Chris@19 145 }
Chris@19 146
Chris@19 147 problem *XM(mkproblem_rdft_d)(dtensor *sz, INT vn,
Chris@19 148 R *I, R *O,
Chris@19 149 MPI_Comm comm,
Chris@19 150 const rdft_kind *kind, unsigned flags)
Chris@19 151 {
Chris@19 152 problem *p = XM(mkproblem_rdft)(sz, vn, I, O, comm, kind, flags);
Chris@19 153 XM(dtensor_destroy)(sz);
Chris@19 154 return p;
Chris@19 155 }