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