|
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 "rdft/rdft.h"
|
|
Chris@82
|
22
|
|
Chris@82
|
23 typedef void (*hc2hcapply) (const plan *ego, R *IO);
|
|
Chris@82
|
24 typedef struct hc2hc_solver_s hc2hc_solver;
|
|
Chris@82
|
25 typedef plan *(*hc2hc_mkinferior)(const hc2hc_solver *ego,
|
|
Chris@82
|
26 rdft_kind kind, INT r, INT m, INT s,
|
|
Chris@82
|
27 INT vl, INT vs, INT mstart, INT mcount,
|
|
Chris@82
|
28 R *IO, planner *plnr);
|
|
Chris@82
|
29
|
|
Chris@82
|
30 typedef struct {
|
|
Chris@82
|
31 plan super;
|
|
Chris@82
|
32 hc2hcapply apply;
|
|
Chris@82
|
33 } plan_hc2hc;
|
|
Chris@82
|
34
|
|
Chris@82
|
35 extern plan *X(mkplan_hc2hc)(size_t size, const plan_adt *adt,
|
|
Chris@82
|
36 hc2hcapply apply);
|
|
Chris@82
|
37
|
|
Chris@82
|
38 #define MKPLAN_HC2HC(type, adt, apply) \
|
|
Chris@82
|
39 (type *)X(mkplan_hc2hc)(sizeof(type), adt, apply)
|
|
Chris@82
|
40
|
|
Chris@82
|
41 struct hc2hc_solver_s {
|
|
Chris@82
|
42 solver super;
|
|
Chris@82
|
43 INT r;
|
|
Chris@82
|
44
|
|
Chris@82
|
45 hc2hc_mkinferior mkcldw;
|
|
Chris@82
|
46 };
|
|
Chris@82
|
47
|
|
Chris@82
|
48 hc2hc_solver *X(mksolver_hc2hc)(size_t size, INT r, hc2hc_mkinferior mkcldw);
|
|
Chris@82
|
49 extern hc2hc_solver *(*X(mksolver_hc2hc_hook))(size_t, INT, hc2hc_mkinferior);
|
|
Chris@82
|
50
|
|
Chris@82
|
51 void X(regsolver_hc2hc_direct)(planner *plnr, khc2hc codelet,
|
|
Chris@82
|
52 const hc2hc_desc *desc);
|
|
Chris@82
|
53
|
|
Chris@82
|
54 int X(hc2hc_applicable)(const hc2hc_solver *, const problem *, planner *);
|
