2
* Copyright (c) 2003, 2006 Matteo Frigo
3
* Copyright (c) 2003, 2006 Massachusetts Institute of Technology
5
* This program is free software; you can redistribute it and/or modify
6
* it under the terms of the GNU General Public License as published by
7
* the Free Software Foundation; either version 2 of the License, or
8
* (at your option) any later version.
10
* This program is distributed in the hope that it will be useful,
11
* but WITHOUT ANY WARRANTY; without even the implied warranty of
12
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13
* GNU General Public License for more details.
15
* You should have received a copy of the GNU General Public License
16
* along with this program; if not, write to the Free Software
17
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21
/* $Id: ct.c,v 1.52 2006-01-27 02:10:50 athena Exp $ */
25
ct_solver *(*X(mksolver_ct_hook))(size_t, INT, int, ct_mkinferior) = 0;
34
static void apply_dit(const plan *ego_, R *ri, R *ii, R *ro, R *io)
36
const P *ego = (const P *) ego_;
40
cld = (plan_dft *) ego->cld;
41
cld->apply(ego->cld, ri, ii, ro, io);
43
cldw = (plan_dftw *) ego->cldw;
44
cldw->apply(ego->cldw, ro, io);
47
static void apply_dif(const plan *ego_, R *ri, R *ii, R *ro, R *io)
49
const P *ego = (const P *) ego_;
53
cldw = (plan_dftw *) ego->cldw;
54
cldw->apply(ego->cldw, ri, ii);
56
cld = (plan_dft *) ego->cld;
57
cld->apply(ego->cld, ri, ii, ro, io);
60
static void awake(plan *ego_, enum wakefulness wakefulness)
63
X(plan_awake)(ego->cld, wakefulness);
64
X(plan_awake)(ego->cldw, wakefulness);
67
static void destroy(plan *ego_)
70
X(plan_destroy_internal)(ego->cldw);
71
X(plan_destroy_internal)(ego->cld);
74
static void print(const plan *ego_, printer *p)
76
const P *ego = (const P *) ego_;
77
p->print(p, "(dft-ct-%s/%D%(%p%)%(%p%))",
78
ego->super.apply == apply_dit ? "dit" : "dif",
79
ego->r, ego->cldw, ego->cld);
82
static int applicable0(const ct_solver *ego, const problem *p_, planner *plnr)
84
const problem_dft *p = (const problem_dft *) p_;
91
/* DIF destroys the input and we don't like it */
92
&& (ego->dec == DECDIT ||
94
!NO_DESTROY_INPUTP(plnr))
96
&& ((r = X(choose_radix)(ego->r, p->sz->dims[0].n)) > 1)
97
&& p->sz->dims[0].n > r);
101
int X(ct_applicable)(const ct_solver *ego, const problem *p_, planner *plnr)
103
const problem_dft *p;
105
if (!applicable0(ego, p_, plnr))
108
p = (const problem_dft *) p_;
110
/* emulate fftw2 behavior */
111
if (NO_VRECURSEP(plnr) && (p->vecsz->rnk > 0))
118
static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
120
const ct_solver *ego = (const ct_solver *) ego_;
121
const problem_dft *p;
123
plan *cld = 0, *cldw = 0;
124
INT n, r, m, vl, ivs, ovs;
128
static const plan_adt padt = {
129
X(dft_solve), awake, print, destroy
132
if ((NO_NONTHREADEDP(plnr)) || !X(ct_applicable)(ego, p_, plnr))
135
p = (const problem_dft *) p_;
138
r = X(choose_radix)(ego->r, n);
141
X(tensor_tornk1)(p->vecsz, &vl, &ivs, &ovs);
146
cldw = ego->mkcldw(ego,
147
DECDIT, r, m, d[0].os, vl, ovs, 0, m,
149
if (!cldw) goto nada;
151
t1 = X(mktensor_1d)(r, d[0].is, m * d[0].os);
152
t2 = X(tensor_append)(t1, p->vecsz);
153
X(tensor_destroy)(t1);
155
cld = X(mkplan_d)(plnr,
157
X(mktensor_1d)(m, r * d[0].is, d[0].os),
158
t2, p->ri, p->ii, p->ro, p->io)
162
pln = MKPLAN_DFT(P, &padt, apply_dit);
167
cldw = ego->mkcldw(ego,
168
DECDIF, r, m, d[0].is, vl, ivs, 0, m,
170
if (!cldw) goto nada;
172
t1 = X(mktensor_1d)(r, m * d[0].is, d[0].os);
173
t2 = X(tensor_append)(t1, p->vecsz);
174
X(tensor_destroy)(t1);
176
cld = X(mkplan_d)(plnr,
178
X(mktensor_1d)(m, d[0].is, r * d[0].os),
179
t2, p->ri, p->ii, p->ro, p->io)
183
pln = MKPLAN_DFT(P, &padt, apply_dif);
194
X(ops_add)(&cld->ops, &cldw->ops, &pln->super.super.ops);
196
/* inherit could_prune_now_p attribute from cldw */
197
pln->super.super.could_prune_now_p = cldw->could_prune_now_p;
198
return &(pln->super.super);
201
X(plan_destroy_internal)(cldw);
202
X(plan_destroy_internal)(cld);
206
ct_solver *X(mksolver_ct)(size_t size, INT r, int dec, ct_mkinferior mkcldw)
208
static const solver_adt sadt = { PROBLEM_DFT, mkplan };
209
ct_solver *slv = (ct_solver *)X(mksolver)(size, &sadt);
212
slv->mkcldw = mkcldw;
216
plan *X(mkplan_dftw)(size_t size, const plan_adt *adt, dftwapply apply)
220
ego = (plan_dftw *) X(mkplan)(size, adt);
223
return &(ego->super);