cannam@127
|
1 /*
|
cannam@127
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
cannam@127
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
cannam@127
|
4 *
|
cannam@127
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@127
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@127
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@127
|
8 * (at your option) any later version.
|
cannam@127
|
9 *
|
cannam@127
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@127
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@127
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@127
|
13 * GNU General Public License for more details.
|
cannam@127
|
14 *
|
cannam@127
|
15 * You should have received a copy of the GNU General Public License
|
cannam@127
|
16 * along with this program; if not, write to the Free Software
|
cannam@127
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
cannam@127
|
18 *
|
cannam@127
|
19 */
|
cannam@127
|
20
|
cannam@127
|
21
|
cannam@127
|
22 /*
|
cannam@127
|
23 * This header file must include every file or define every
|
cannam@127
|
24 * type or macro which is required to compile a codelet.
|
cannam@127
|
25 */
|
cannam@127
|
26
|
cannam@127
|
27 #ifndef __DFT_CODELET_H__
|
cannam@127
|
28 #define __DFT_CODELET_H__
|
cannam@127
|
29
|
cannam@127
|
30 #include "ifftw.h"
|
cannam@127
|
31
|
cannam@127
|
32 /**************************************************************
|
cannam@127
|
33 * types of codelets
|
cannam@127
|
34 **************************************************************/
|
cannam@127
|
35
|
cannam@127
|
36 /* DFT codelets */
|
cannam@127
|
37 typedef struct kdft_desc_s kdft_desc;
|
cannam@127
|
38
|
cannam@127
|
39 typedef struct {
|
cannam@127
|
40 int (*okp)(
|
cannam@127
|
41 const kdft_desc *desc,
|
cannam@127
|
42 const R *ri, const R *ii, const R *ro, const R *io,
|
cannam@127
|
43 INT is, INT os, INT vl, INT ivs, INT ovs,
|
cannam@127
|
44 const planner *plnr);
|
cannam@127
|
45 INT vl;
|
cannam@127
|
46 } kdft_genus;
|
cannam@127
|
47
|
cannam@127
|
48 struct kdft_desc_s {
|
cannam@127
|
49 INT sz; /* size of transform computed */
|
cannam@127
|
50 const char *nam;
|
cannam@127
|
51 opcnt ops;
|
cannam@127
|
52 const kdft_genus *genus;
|
cannam@127
|
53 INT is;
|
cannam@127
|
54 INT os;
|
cannam@127
|
55 INT ivs;
|
cannam@127
|
56 INT ovs;
|
cannam@127
|
57 };
|
cannam@127
|
58
|
cannam@127
|
59 typedef void (*kdft) (const R *ri, const R *ii, R *ro, R *io,
|
cannam@127
|
60 stride is, stride os, INT vl, INT ivs, INT ovs);
|
cannam@127
|
61 void X(kdft_register)(planner *p, kdft codelet, const kdft_desc *desc);
|
cannam@127
|
62
|
cannam@127
|
63
|
cannam@127
|
64 typedef struct ct_desc_s ct_desc;
|
cannam@127
|
65
|
cannam@127
|
66 typedef struct {
|
cannam@127
|
67 int (*okp)(
|
cannam@127
|
68 const struct ct_desc_s *desc,
|
cannam@127
|
69 const R *rio, const R *iio,
|
cannam@127
|
70 INT rs, INT vs, INT m, INT mb, INT me, INT ms,
|
cannam@127
|
71 const planner *plnr);
|
cannam@127
|
72 INT vl;
|
cannam@127
|
73 } ct_genus;
|
cannam@127
|
74
|
cannam@127
|
75 struct ct_desc_s {
|
cannam@127
|
76 INT radix;
|
cannam@127
|
77 const char *nam;
|
cannam@127
|
78 const tw_instr *tw;
|
cannam@127
|
79 const ct_genus *genus;
|
cannam@127
|
80 opcnt ops;
|
cannam@127
|
81 INT rs;
|
cannam@127
|
82 INT vs;
|
cannam@127
|
83 INT ms;
|
cannam@127
|
84 };
|
cannam@127
|
85
|
cannam@127
|
86 typedef void (*kdftw) (R *rioarray, R *iioarray, const R *W,
|
cannam@127
|
87 stride ios, INT mb, INT me, INT ms);
|
cannam@127
|
88 void X(kdft_dit_register)(planner *p, kdftw codelet, const ct_desc *desc);
|
cannam@127
|
89 void X(kdft_dif_register)(planner *p, kdftw codelet, const ct_desc *desc);
|
cannam@127
|
90
|
cannam@127
|
91
|
cannam@127
|
92 typedef void (*kdftwsq) (R *rioarray, R *iioarray,
|
cannam@127
|
93 const R *W, stride is, stride vs,
|
cannam@127
|
94 INT mb, INT me, INT ms);
|
cannam@127
|
95 void X(kdft_difsq_register)(planner *p, kdftwsq codelet, const ct_desc *desc);
|
cannam@127
|
96
|
cannam@127
|
97
|
cannam@127
|
98 extern const solvtab X(solvtab_dft_standard);
|
cannam@127
|
99 extern const solvtab X(solvtab_dft_sse2);
|
cannam@127
|
100 extern const solvtab X(solvtab_dft_avx);
|
cannam@127
|
101 extern const solvtab X(solvtab_dft_avx_128_fma);
|
cannam@127
|
102 extern const solvtab X(solvtab_dft_avx2);
|
cannam@127
|
103 extern const solvtab X(solvtab_dft_avx2_128);
|
cannam@127
|
104 extern const solvtab X(solvtab_dft_avx512);
|
cannam@127
|
105 extern const solvtab X(solvtab_dft_kcvi);
|
cannam@127
|
106 extern const solvtab X(solvtab_dft_altivec);
|
cannam@127
|
107 extern const solvtab X(solvtab_dft_vsx);
|
cannam@127
|
108 extern const solvtab X(solvtab_dft_neon);
|
cannam@127
|
109 extern const solvtab X(solvtab_dft_generic_simd128);
|
cannam@127
|
110 extern const solvtab X(solvtab_dft_generic_simd256);
|
cannam@127
|
111
|
cannam@127
|
112 #endif /* __DFT_CODELET_H__ */
|