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
|
/*
* Copyright (c) 2003 Matteo Frigo
* Copyright (c) 2003 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/* $Id: ct.h,v 1.1 2008/10/17 06:11:08 scuri Exp $ */
/* Cooley-Tukey variants */
union kct {
kdft_dit dit;
kdft_dif dif;
kdft_difsq difsq;
};
typedef struct {
solver super;
const char *nam;
const ct_desc *desc;
union kct k;
} solver_ct;
typedef struct {
plan_dft super;
union kct k;
plan *cld;
twid *td;
int r, m, vl;
int is, os, ivs, ovs, iios;
stride ios, vs;
const solver_ct *slv;
} plan_ct;
/* data type describing a generic Cooley-Tukey solver */
typedef struct
{
size_t pln_size;
problem *(*mkcld)(const solver_ct *, const problem_dft *p);
void (*finish)(plan_ct *ego);
int (*applicable)(const solver_ct *ego, const problem *p,
const planner *plnr);
dftapply apply;
} ctadt;
int X(dft_ct_applicable)(const solver_ct *ego, const problem *p_);
plan *X(mkplan_dft_ct)(const solver_ct *ego,
const problem *p_,
planner *plnr,
const ctadt *adt);
solver *X(mksolver_dft_ct)(union kct k, const ct_desc *desc,
const char *nam, const solver_adt *adt);
problem *X(dft_mkcld_dit)(const solver_ct *ego, const problem_dft *p);
problem *X(dft_mkcld_dif)(const solver_ct *ego, const problem_dft *p);
|
