|
Chris@82
|
1 /*
|
|
Chris@82
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
Chris@82
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
Chris@82
|
4 *
|
|
Chris@82
|
5 * This program is free software; you can redistribute it and/or modify
|
|
Chris@82
|
6 * it under the terms of the GNU General Public License as published by
|
|
Chris@82
|
7 * the Free Software Foundation; either version 2 of the License, or
|
|
Chris@82
|
8 * (at your option) any later version.
|
|
Chris@82
|
9 *
|
|
Chris@82
|
10 * This program is distributed in the hope that it will be useful,
|
|
Chris@82
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Chris@82
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Chris@82
|
13 * GNU General Public License for more details.
|
|
Chris@82
|
14 *
|
|
Chris@82
|
15 * You should have received a copy of the GNU General Public License
|
|
Chris@82
|
16 * along with this program; if not, write to the Free Software
|
|
Chris@82
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
Chris@82
|
18 *
|
|
Chris@82
|
19 */
|
|
Chris@82
|
20
|
|
Chris@82
|
21 #include "dft/dft.h"
|
|
Chris@82
|
22
|
|
Chris@82
|
23 typedef void (*dftwapply)(const plan *ego, R *rio, R *iio);
|
|
Chris@82
|
24 typedef struct ct_solver_s ct_solver;
|
|
Chris@82
|
25 typedef plan *(*ct_mkinferior)(const ct_solver *ego,
|
|
Chris@82
|
26 INT r, INT irs, INT ors,
|
|
Chris@82
|
27 INT m, INT ms,
|
|
Chris@82
|
28 INT v, INT ivs, INT ovs,
|
|
Chris@82
|
29 INT mstart, INT mcount,
|
|
Chris@82
|
30 R *rio, R *iio, planner *plnr);
|
|
Chris@82
|
31 typedef int (*ct_force_vrecursion)(const ct_solver *ego,
|
|
Chris@82
|
32 const problem_dft *p);
|
|
Chris@82
|
33
|
|
Chris@82
|
34 typedef struct {
|
|
Chris@82
|
35 plan super;
|
|
Chris@82
|
36 dftwapply apply;
|
|
Chris@82
|
37 } plan_dftw;
|
|
Chris@82
|
38
|
|
Chris@82
|
39 extern plan *X(mkplan_dftw)(size_t size, const plan_adt *adt, dftwapply apply);
|
|
Chris@82
|
40
|
|
Chris@82
|
41 #define MKPLAN_DFTW(type, adt, apply) \
|
|
Chris@82
|
42 (type *)X(mkplan_dftw)(sizeof(type), adt, apply)
|
|
Chris@82
|
43
|
|
Chris@82
|
44 struct ct_solver_s {
|
|
Chris@82
|
45 solver super;
|
|
Chris@82
|
46 INT r;
|
|
Chris@82
|
47 int dec;
|
|
Chris@82
|
48 # define DECDIF 0
|
|
Chris@82
|
49 # define DECDIT 1
|
|
Chris@82
|
50 # define TRANSPOSE 2
|
|
Chris@82
|
51 ct_mkinferior mkcldw;
|
|
Chris@82
|
52 ct_force_vrecursion force_vrecursionp;
|
|
Chris@82
|
53 };
|
|
Chris@82
|
54
|
|
Chris@82
|
55 int X(ct_applicable)(const ct_solver *, const problem *, planner *);
|
|
Chris@82
|
56 ct_solver *X(mksolver_ct)(size_t size, INT r, int dec,
|
|
Chris@82
|
57 ct_mkinferior mkcldw,
|
|
Chris@82
|
58 ct_force_vrecursion force_vrecursionp);
|
|
Chris@82
|
59 extern ct_solver *(*X(mksolver_ct_hook))(size_t, INT, int,
|
|
Chris@82
|
60 ct_mkinferior, ct_force_vrecursion);
|
|
Chris@82
|
61
|
|
Chris@82
|
62 void X(regsolver_ct_directw)(planner *plnr,
|
|
Chris@82
|
63 kdftw codelet, const ct_desc *desc, int dec);
|
|
Chris@82
|
64 void X(regsolver_ct_directwbuf)(planner *plnr,
|
|
Chris@82
|
65 kdftw codelet, const ct_desc *desc, int dec);
|
|
Chris@82
|
66 solver *X(mksolver_ctsq)(kdftwsq codelet, const ct_desc *desc, int dec);
|
|
Chris@82
|
67 void X(regsolver_ct_directwsq)(planner *plnr, kdftwsq codelet,
|
|
Chris@82
|
68 const ct_desc *desc, int dec);
|
