annotate fft/fftw/fftw-3.3.4/dft/dftw-directsq.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
Chris@19 22 #include "ct.h"
Chris@19 23
Chris@19 24 typedef struct {
Chris@19 25 ct_solver super;
Chris@19 26 const ct_desc *desc;
Chris@19 27 kdftwsq k;
Chris@19 28 } S;
Chris@19 29
Chris@19 30 typedef struct {
Chris@19 31 plan_dftw super;
Chris@19 32 kdftwsq k;
Chris@19 33 INT r;
Chris@19 34 stride rs, vs;
Chris@19 35 INT m, ms, v, mb, me;
Chris@19 36 twid *td;
Chris@19 37 const S *slv;
Chris@19 38 } P;
Chris@19 39
Chris@19 40
Chris@19 41 static void apply(const plan *ego_, R *rio, R *iio)
Chris@19 42 {
Chris@19 43 const P *ego = (const P *) ego_;
Chris@19 44 INT mb = ego->mb, ms = ego->ms;
Chris@19 45 ego->k(rio + mb*ms, iio + mb*ms, ego->td->W, ego->rs, ego->vs,
Chris@19 46 mb, ego->me, ms);
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
Chris@19 53 X(twiddle_awake)(wakefulness, &ego->td, ego->slv->desc->tw,
Chris@19 54 ego->r * ego->m, ego->r, ego->m);
Chris@19 55 }
Chris@19 56
Chris@19 57 static void destroy(plan *ego_)
Chris@19 58 {
Chris@19 59 P *ego = (P *) ego_;
Chris@19 60 X(stride_destroy)(ego->rs);
Chris@19 61 X(stride_destroy)(ego->vs);
Chris@19 62 }
Chris@19 63
Chris@19 64 static void print(const plan *ego_, printer *p)
Chris@19 65 {
Chris@19 66 const P *ego = (const P *) ego_;
Chris@19 67 const S *slv = ego->slv;
Chris@19 68 const ct_desc *e = slv->desc;
Chris@19 69
Chris@19 70 p->print(p, "(dftw-directsq-%D/%D%v \"%s\")",
Chris@19 71 ego->r, X(twiddle_length)(ego->r, e->tw), ego->v, e->nam);
Chris@19 72 }
Chris@19 73
Chris@19 74 static int applicable(const S *ego,
Chris@19 75 INT r, INT irs, INT ors,
Chris@19 76 INT m, INT ms,
Chris@19 77 INT v, INT ivs, INT ovs,
Chris@19 78 INT mb, INT me,
Chris@19 79 R *rio, R *iio,
Chris@19 80 const planner *plnr)
Chris@19 81 {
Chris@19 82 const ct_desc *e = ego->desc;
Chris@19 83 UNUSED(v);
Chris@19 84
Chris@19 85 return (
Chris@19 86 1
Chris@19 87 && r == e->radix
Chris@19 88
Chris@19 89 /* transpose r, v */
Chris@19 90 && r == v
Chris@19 91 && irs == ovs
Chris@19 92 && ivs == ors
Chris@19 93
Chris@19 94 /* check for alignment/vector length restrictions */
Chris@19 95 && e->genus->okp(e, rio, iio, irs, ivs, m, mb, me, ms, plnr)
Chris@19 96
Chris@19 97 );
Chris@19 98 }
Chris@19 99
Chris@19 100 static plan *mkcldw(const ct_solver *ego_,
Chris@19 101 INT r, INT irs, INT ors,
Chris@19 102 INT m, INT ms,
Chris@19 103 INT v, INT ivs, INT ovs,
Chris@19 104 INT mstart, INT mcount,
Chris@19 105 R *rio, R *iio,
Chris@19 106 planner *plnr)
Chris@19 107 {
Chris@19 108 const S *ego = (const S *) ego_;
Chris@19 109 P *pln;
Chris@19 110 const ct_desc *e = ego->desc;
Chris@19 111
Chris@19 112 static const plan_adt padt = {
Chris@19 113 0, awake, print, destroy
Chris@19 114 };
Chris@19 115
Chris@19 116 A(mstart >= 0 && mstart + mcount <= m);
Chris@19 117 if (!applicable(ego,
Chris@19 118 r, irs, ors, m, ms, v, ivs, ovs, mstart, mstart + mcount,
Chris@19 119 rio, iio, plnr))
Chris@19 120 return (plan *)0;
Chris@19 121
Chris@19 122 pln = MKPLAN_DFTW(P, &padt, apply);
Chris@19 123
Chris@19 124 pln->k = ego->k;
Chris@19 125 pln->rs = X(mkstride)(r, irs);
Chris@19 126 pln->vs = X(mkstride)(v, ivs);
Chris@19 127 pln->td = 0;
Chris@19 128 pln->r = r;
Chris@19 129 pln->m = m;
Chris@19 130 pln->ms = ms;
Chris@19 131 pln->v = v;
Chris@19 132 pln->mb = mstart;
Chris@19 133 pln->me = mstart + mcount;
Chris@19 134 pln->slv = ego;
Chris@19 135
Chris@19 136 X(ops_zero)(&pln->super.super.ops);
Chris@19 137 X(ops_madd2)(mcount/e->genus->vl, &e->ops, &pln->super.super.ops);
Chris@19 138
Chris@19 139 return &(pln->super.super);
Chris@19 140 }
Chris@19 141
Chris@19 142 static void regone(planner *plnr, kdftwsq codelet,
Chris@19 143 const ct_desc *desc, int dec)
Chris@19 144 {
Chris@19 145 S *slv = (S *)X(mksolver_ct)(sizeof(S), desc->radix, dec, mkcldw, 0);
Chris@19 146 slv->k = codelet;
Chris@19 147 slv->desc = desc;
Chris@19 148 REGISTER_SOLVER(plnr, &(slv->super.super));
Chris@19 149 if (X(mksolver_ct_hook)) {
Chris@19 150 slv = (S *)X(mksolver_ct_hook)(sizeof(S), desc->radix, dec,
Chris@19 151 mkcldw, 0);
Chris@19 152 slv->k = codelet;
Chris@19 153 slv->desc = desc;
Chris@19 154 REGISTER_SOLVER(plnr, &(slv->super.super));
Chris@19 155 }
Chris@19 156 }
Chris@19 157
Chris@19 158 void X(regsolver_ct_directwsq)(planner *plnr, kdftwsq codelet,
Chris@19 159 const ct_desc *desc, int dec)
Chris@19 160 {
Chris@19 161 regone(plnr, codelet, desc, dec+TRANSPOSE);
Chris@19 162 }