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