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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
/*
* 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: dft.h,v 1.1 2008/10/17 06:11:08 scuri Exp $ */
#ifndef __DFT_H__
#define __DFT_H__
#include "ifftw.h"
#include "codelet-dft.h"
/* problem.c: */
typedef struct {
problem super;
tensor *sz, *vecsz;
R *ri, *ii, *ro, *io;
} problem_dft;
int X(problem_dft_p)(const problem *p);
#define DFTP X(problem_dft_p) /* shorthand */
void X(dft_zerotens)(tensor *sz, R *ri, R *ii);
problem *X(mkproblem_dft)(const tensor *sz, const tensor *vecsz,
R *ri, R *ii, R *ro, R *io);
problem *X(mkproblem_dft_d)(tensor *sz, tensor *vecsz,
R *ri, R *ii, R *ro, R *io);
/* solve.c: */
void X(dft_solve)(const plan *ego_, const problem *p_);
/* plan.c: */
typedef void (*dftapply) (const plan *ego, R *ri, R *ii, R *ro, R *io);
typedef struct {
plan super;
dftapply apply;
} plan_dft;
plan *X(mkplan_dft)(size_t size, const plan_adt *adt, dftapply apply);
#define MKPLAN_DFT(type, adt, apply) \
(type *)X(mkplan_dft)(sizeof(type), adt, apply)
/* various solvers */
solver *X(mksolver_dft_direct)(kdft k, const kdft_desc *desc);
solver *X(mksolver_dft_ct_dit)(kdft_dit codelet, const ct_desc *desc);
solver *X(mksolver_dft_ct_ditbuf)(kdft_dit codelet, const ct_desc *desc);
solver *X(mksolver_dft_ct_dif)(kdft_dif codelet, const ct_desc *desc);
solver *X(mksolver_dft_ct_ditf)(kdft_difsq codelet, const ct_desc *desc);
extern void (*X(kdft_dit_register_hook))(planner *, kdft_dit, const ct_desc *);
extern void (*X(kdft_dif_register_hook))(planner *, kdft_dif, const ct_desc *);
void X(dft_rank0_register)(planner *p);
void X(dft_rank_geq2_register)(planner *p);
void X(dft_indirect_register)(planner *p);
void X(dft_vrank_geq1_register)(planner *p);
void X(dft_vrank2_transpose_register)(planner *p);
void X(dft_vrank3_transpose_register)(planner *p);
void X(dft_buffered_register)(planner *p);
void X(dft_generic_register)(planner *p);
void X(dft_rader_register)(planner *p);
void X(dft_nop_register)(planner *p);
/* rader-omega.c: auxiliary stuff for rader */
R *X(dft_rader_mkomega)(plan *p_, int n, int ginv);
void X(dft_rader_free_omega)(R **omega);
/* configurations */
void X(dft_conf_standard)(planner *p);
#endif /* __DFT_H__ */
|
