annotate fft/fftw/fftw-3.3.4/mpi/rdft2-serial.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 /* "MPI" DFTs where all of the data is on one processor...just
Chris@19 22 call through to serial API. */
Chris@19 23
Chris@19 24 #include "mpi-rdft2.h"
Chris@19 25 #include "rdft.h"
Chris@19 26
Chris@19 27 typedef struct {
Chris@19 28 plan_mpi_rdft2 super;
Chris@19 29 plan *cld;
Chris@19 30 INT vn;
Chris@19 31 } P;
Chris@19 32
Chris@19 33 static void apply_r2c(const plan *ego_, R *I, R *O)
Chris@19 34 {
Chris@19 35 const P *ego = (const P *) ego_;
Chris@19 36 plan_rdft2 *cld;
Chris@19 37 cld = (plan_rdft2 *) ego->cld;
Chris@19 38 cld->apply(ego->cld, I, I+ego->vn, O, O+1);
Chris@19 39 }
Chris@19 40
Chris@19 41 static void apply_c2r(const plan *ego_, R *I, R *O)
Chris@19 42 {
Chris@19 43 const P *ego = (const P *) ego_;
Chris@19 44 plan_rdft2 *cld;
Chris@19 45 cld = (plan_rdft2 *) ego->cld;
Chris@19 46 cld->apply(ego->cld, O, O+ego->vn, I, I+1);
Chris@19 47 }
Chris@19 48
Chris@19 49 static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@19 50 {
Chris@19 51 P *ego = (P *) ego_;
Chris@19 52 X(plan_awake)(ego->cld, wakefulness);
Chris@19 53 }
Chris@19 54
Chris@19 55 static void destroy(plan *ego_)
Chris@19 56 {
Chris@19 57 P *ego = (P *) ego_;
Chris@19 58 X(plan_destroy_internal)(ego->cld);
Chris@19 59 }
Chris@19 60
Chris@19 61 static void print(const plan *ego_, printer *p)
Chris@19 62 {
Chris@19 63 const P *ego = (const P *) ego_;
Chris@19 64 p->print(p, "(mpi-rdft2-serial %(%p%))", ego->cld);
Chris@19 65 }
Chris@19 66
Chris@19 67 int XM(rdft2_serial_applicable)(const problem_mpi_rdft2 *p)
Chris@19 68 {
Chris@19 69 return (1
Chris@19 70 && p->flags == 0 /* TRANSPOSED/SCRAMBLED_IN/OUT not supported */
Chris@19 71 && ((XM(is_local)(p->sz, IB) && XM(is_local)(p->sz, OB))
Chris@19 72 || p->vn == 0));
Chris@19 73 }
Chris@19 74
Chris@19 75 static plan *mkplan(const solver *ego, const problem *p_, planner *plnr)
Chris@19 76 {
Chris@19 77 const problem_mpi_rdft2 *p = (const problem_mpi_rdft2 *) p_;
Chris@19 78 P *pln;
Chris@19 79 plan *cld;
Chris@19 80 int my_pe;
Chris@19 81 R *r0, *r1, *cr, *ci;
Chris@19 82 static const plan_adt padt = {
Chris@19 83 XM(rdft2_solve), awake, print, destroy
Chris@19 84 };
Chris@19 85
Chris@19 86 UNUSED(ego);
Chris@19 87
Chris@19 88 /* check whether applicable: */
Chris@19 89 if (!XM(rdft2_serial_applicable)(p))
Chris@19 90 return (plan *) 0;
Chris@19 91
Chris@19 92 if (p->kind == R2HC) {
Chris@19 93 r1 = (r0 = p->I) + p->vn;
Chris@19 94 ci = (cr = p->O) + 1;
Chris@19 95 }
Chris@19 96 else {
Chris@19 97 r1 = (r0 = p->O) + p->vn;
Chris@19 98 ci = (cr = p->I) + 1;
Chris@19 99 }
Chris@19 100
Chris@19 101 MPI_Comm_rank(p->comm, &my_pe);
Chris@19 102 if (my_pe == 0 && p->vn > 0) {
Chris@19 103 INT ivs = 1 + (p->kind == HC2R), ovs = 1 + (p->kind == R2HC);
Chris@19 104 int i, rnk = p->sz->rnk;
Chris@19 105 tensor *sz = X(mktensor)(p->sz->rnk);
Chris@19 106 sz->dims[rnk - 1].is = sz->dims[rnk - 1].os = 2 * p->vn;
Chris@19 107 sz->dims[rnk - 1].n = p->sz->dims[rnk - 1].n / 2 + 1;
Chris@19 108 for (i = rnk - 1; i > 0; --i) {
Chris@19 109 sz->dims[i - 1].is = sz->dims[i - 1].os =
Chris@19 110 sz->dims[i].is * sz->dims[i].n;
Chris@19 111 sz->dims[i - 1].n = p->sz->dims[i - 1].n;
Chris@19 112 }
Chris@19 113 sz->dims[rnk - 1].n = p->sz->dims[rnk - 1].n;
Chris@19 114
Chris@19 115 cld = X(mkplan_d)(plnr,
Chris@19 116 X(mkproblem_rdft2_d)(sz,
Chris@19 117 X(mktensor_1d)(p->vn,ivs,ovs),
Chris@19 118 r0, r1, cr, ci, p->kind));
Chris@19 119 }
Chris@19 120 else { /* idle process: make nop plan */
Chris@19 121 cld = X(mkplan_d)(plnr,
Chris@19 122 X(mkproblem_rdft2_d)(X(mktensor_0d)(),
Chris@19 123 X(mktensor_1d)(0,0,0),
Chris@19 124 cr, ci, cr, ci, HC2R));
Chris@19 125 }
Chris@19 126 if (XM(any_true)(!cld, p->comm)) return (plan *) 0;
Chris@19 127
Chris@19 128 pln = MKPLAN_MPI_RDFT2(P, &padt, p->kind == R2HC ? apply_r2c : apply_c2r);
Chris@19 129 pln->cld = cld;
Chris@19 130 pln->vn = p->vn;
Chris@19 131 X(ops_cpy)(&cld->ops, &pln->super.super.ops);
Chris@19 132 return &(pln->super.super);
Chris@19 133 }
Chris@19 134
Chris@19 135 static solver *mksolver(void)
Chris@19 136 {
Chris@19 137 static const solver_adt sadt = { PROBLEM_MPI_RDFT2, mkplan, 0 };
Chris@19 138 return MKSOLVER(solver, &sadt);
Chris@19 139 }
Chris@19 140
Chris@19 141 void XM(rdft2_serial_register)(planner *p)
Chris@19 142 {
Chris@19 143 REGISTER_SOLVER(p, mksolver());
Chris@19 144 }