annotate src/fftw-3.3.5/dft/dftw-directsq.c @ 169:223a55898ab9 tip default

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