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