annotate src/fftw-3.3.8/dft/dftw-directsq.c @ 167:bd3cc4d1df30

Add FFTW 3.3.8 source, and a Linux build
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 19 Nov 2019 14:52:55 +0000
parents
children
rev   line source
cannam@167 1 /*
cannam@167 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167 4 *
cannam@167 5 * This program is free software; you can redistribute it and/or modify
cannam@167 6 * it under the terms of the GNU General Public License as published by
cannam@167 7 * the Free Software Foundation; either version 2 of the License, or
cannam@167 8 * (at your option) any later version.
cannam@167 9 *
cannam@167 10 * This program is distributed in the hope that it will be useful,
cannam@167 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@167 13 * GNU General Public License for more details.
cannam@167 14 *
cannam@167 15 * You should have received a copy of the GNU General Public License
cannam@167 16 * along with this program; if not, write to the Free Software
cannam@167 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@167 18 *
cannam@167 19 */
cannam@167 20
cannam@167 21
cannam@167 22 #include "dft/ct.h"
cannam@167 23
cannam@167 24 typedef struct {
cannam@167 25 ct_solver super;
cannam@167 26 const ct_desc *desc;
cannam@167 27 kdftwsq k;
cannam@167 28 } S;
cannam@167 29
cannam@167 30 typedef struct {
cannam@167 31 plan_dftw super;
cannam@167 32 kdftwsq k;
cannam@167 33 INT r;
cannam@167 34 stride rs, vs;
cannam@167 35 INT m, ms, v, mb, me;
cannam@167 36 twid *td;
cannam@167 37 const S *slv;
cannam@167 38 } P;
cannam@167 39
cannam@167 40
cannam@167 41 static void apply(const plan *ego_, R *rio, R *iio)
cannam@167 42 {
cannam@167 43 const P *ego = (const P *) ego_;
cannam@167 44 INT mb = ego->mb, ms = ego->ms;
cannam@167 45 ego->k(rio + mb*ms, iio + mb*ms, ego->td->W, ego->rs, ego->vs,
cannam@167 46 mb, ego->me, ms);
cannam@167 47 }
cannam@167 48
cannam@167 49 static void awake(plan *ego_, enum wakefulness wakefulness)
cannam@167 50 {
cannam@167 51 P *ego = (P *) ego_;
cannam@167 52
cannam@167 53 X(twiddle_awake)(wakefulness, &ego->td, ego->slv->desc->tw,
cannam@167 54 ego->r * ego->m, ego->r, ego->m);
cannam@167 55 }
cannam@167 56
cannam@167 57 static void destroy(plan *ego_)
cannam@167 58 {
cannam@167 59 P *ego = (P *) ego_;
cannam@167 60 X(stride_destroy)(ego->rs);
cannam@167 61 X(stride_destroy)(ego->vs);
cannam@167 62 }
cannam@167 63
cannam@167 64 static void print(const plan *ego_, printer *p)
cannam@167 65 {
cannam@167 66 const P *ego = (const P *) ego_;
cannam@167 67 const S *slv = ego->slv;
cannam@167 68 const ct_desc *e = slv->desc;
cannam@167 69
cannam@167 70 p->print(p, "(dftw-directsq-%D/%D%v \"%s\")",
cannam@167 71 ego->r, X(twiddle_length)(ego->r, e->tw), ego->v, e->nam);
cannam@167 72 }
cannam@167 73
cannam@167 74 static int applicable(const S *ego,
cannam@167 75 INT r, INT irs, INT ors,
cannam@167 76 INT m, INT ms,
cannam@167 77 INT v, INT ivs, INT ovs,
cannam@167 78 INT mb, INT me,
cannam@167 79 R *rio, R *iio,
cannam@167 80 const planner *plnr)
cannam@167 81 {
cannam@167 82 const ct_desc *e = ego->desc;
cannam@167 83 UNUSED(v);
cannam@167 84
cannam@167 85 return (
cannam@167 86 1
cannam@167 87 && r == e->radix
cannam@167 88
cannam@167 89 /* transpose r, v */
cannam@167 90 && r == v
cannam@167 91 && irs == ovs
cannam@167 92 && ivs == ors
cannam@167 93
cannam@167 94 /* check for alignment/vector length restrictions */
cannam@167 95 && e->genus->okp(e, rio, iio, irs, ivs, m, mb, me, ms, plnr)
cannam@167 96
cannam@167 97 );
cannam@167 98 }
cannam@167 99
cannam@167 100 static plan *mkcldw(const ct_solver *ego_,
cannam@167 101 INT r, INT irs, INT ors,
cannam@167 102 INT m, INT ms,
cannam@167 103 INT v, INT ivs, INT ovs,
cannam@167 104 INT mstart, INT mcount,
cannam@167 105 R *rio, R *iio,
cannam@167 106 planner *plnr)
cannam@167 107 {
cannam@167 108 const S *ego = (const S *) ego_;
cannam@167 109 P *pln;
cannam@167 110 const ct_desc *e = ego->desc;
cannam@167 111
cannam@167 112 static const plan_adt padt = {
cannam@167 113 0, awake, print, destroy
cannam@167 114 };
cannam@167 115
cannam@167 116 A(mstart >= 0 && mstart + mcount <= m);
cannam@167 117 if (!applicable(ego,
cannam@167 118 r, irs, ors, m, ms, v, ivs, ovs, mstart, mstart + mcount,
cannam@167 119 rio, iio, plnr))
cannam@167 120 return (plan *)0;
cannam@167 121
cannam@167 122 pln = MKPLAN_DFTW(P, &padt, apply);
cannam@167 123
cannam@167 124 pln->k = ego->k;
cannam@167 125 pln->rs = X(mkstride)(r, irs);
cannam@167 126 pln->vs = X(mkstride)(v, ivs);
cannam@167 127 pln->td = 0;
cannam@167 128 pln->r = r;
cannam@167 129 pln->m = m;
cannam@167 130 pln->ms = ms;
cannam@167 131 pln->v = v;
cannam@167 132 pln->mb = mstart;
cannam@167 133 pln->me = mstart + mcount;
cannam@167 134 pln->slv = ego;
cannam@167 135
cannam@167 136 X(ops_zero)(&pln->super.super.ops);
cannam@167 137 X(ops_madd2)(mcount/e->genus->vl, &e->ops, &pln->super.super.ops);
cannam@167 138
cannam@167 139 return &(pln->super.super);
cannam@167 140 }
cannam@167 141
cannam@167 142 static void regone(planner *plnr, kdftwsq codelet,
cannam@167 143 const ct_desc *desc, int dec)
cannam@167 144 {
cannam@167 145 S *slv = (S *)X(mksolver_ct)(sizeof(S), desc->radix, dec, mkcldw, 0);
cannam@167 146 slv->k = codelet;
cannam@167 147 slv->desc = desc;
cannam@167 148 REGISTER_SOLVER(plnr, &(slv->super.super));
cannam@167 149 if (X(mksolver_ct_hook)) {
cannam@167 150 slv = (S *)X(mksolver_ct_hook)(sizeof(S), desc->radix, dec,
cannam@167 151 mkcldw, 0);
cannam@167 152 slv->k = codelet;
cannam@167 153 slv->desc = desc;
cannam@167 154 REGISTER_SOLVER(plnr, &(slv->super.super));
cannam@167 155 }
cannam@167 156 }
cannam@167 157
cannam@167 158 void X(regsolver_ct_directwsq)(planner *plnr, kdftwsq codelet,
cannam@167 159 const ct_desc *desc, int dec)
cannam@167 160 {
cannam@167 161 regone(plnr, codelet, desc, dec+TRANSPOSE);
cannam@167 162 }