|
Chris@42
|
1 /*
|
|
Chris@42
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
Chris@42
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
Chris@42
|
4 *
|
|
Chris@42
|
5 * This program is free software; you can redistribute it and/or modify
|
|
Chris@42
|
6 * it under the terms of the GNU General Public License as published by
|
|
Chris@42
|
7 * the Free Software Foundation; either version 2 of the License, or
|
|
Chris@42
|
8 * (at your option) any later version.
|
|
Chris@42
|
9 *
|
|
Chris@42
|
10 * This program is distributed in the hope that it will be useful,
|
|
Chris@42
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Chris@42
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Chris@42
|
13 * GNU General Public License for more details.
|
|
Chris@42
|
14 *
|
|
Chris@42
|
15 * You should have received a copy of the GNU General Public License
|
|
Chris@42
|
16 * along with this program; if not, write to the Free Software
|
|
Chris@42
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
Chris@42
|
18 *
|
|
Chris@42
|
19 */
|
|
Chris@42
|
20
|
|
Chris@42
|
21
|
|
Chris@42
|
22 #include "dft.h"
|
|
Chris@42
|
23
|
|
Chris@42
|
24 static const solvtab s =
|
|
Chris@42
|
25 {
|
|
Chris@42
|
26 SOLVTAB(X(dft_indirect_register)),
|
|
Chris@42
|
27 SOLVTAB(X(dft_indirect_transpose_register)),
|
|
Chris@42
|
28 SOLVTAB(X(dft_rank_geq2_register)),
|
|
Chris@42
|
29 SOLVTAB(X(dft_vrank_geq1_register)),
|
|
Chris@42
|
30 SOLVTAB(X(dft_buffered_register)),
|
|
Chris@42
|
31 SOLVTAB(X(dft_generic_register)),
|
|
Chris@42
|
32 SOLVTAB(X(dft_rader_register)),
|
|
Chris@42
|
33 SOLVTAB(X(dft_bluestein_register)),
|
|
Chris@42
|
34 SOLVTAB(X(dft_nop_register)),
|
|
Chris@42
|
35 SOLVTAB(X(ct_generic_register)),
|
|
Chris@42
|
36 SOLVTAB(X(ct_genericbuf_register)),
|
|
Chris@42
|
37 SOLVTAB_END
|
|
Chris@42
|
38 };
|
|
Chris@42
|
39
|
|
Chris@42
|
40 void X(dft_conf_standard)(planner *p)
|
|
Chris@42
|
41 {
|
|
Chris@42
|
42 X(solvtab_exec)(s, p);
|
|
Chris@42
|
43 X(solvtab_exec)(X(solvtab_dft_standard), p);
|
|
Chris@42
|
44 #if HAVE_SSE2
|
|
Chris@42
|
45 if (X(have_simd_sse2)())
|
|
Chris@42
|
46 X(solvtab_exec)(X(solvtab_dft_sse2), p);
|
|
Chris@42
|
47 #endif
|
|
Chris@42
|
48 #if HAVE_AVX
|
|
Chris@42
|
49 if (X(have_simd_avx)())
|
|
Chris@42
|
50 X(solvtab_exec)(X(solvtab_dft_avx), p);
|
|
Chris@42
|
51 #endif
|
|
Chris@42
|
52 #if HAVE_AVX_128_FMA
|
|
Chris@42
|
53 if (X(have_simd_avx_128_fma)())
|
|
Chris@42
|
54 X(solvtab_exec)(X(solvtab_dft_avx_128_fma), p);
|
|
Chris@42
|
55 #endif
|
|
Chris@42
|
56 #if HAVE_AVX2
|
|
Chris@42
|
57 if (X(have_simd_avx2)())
|
|
Chris@42
|
58 X(solvtab_exec)(X(solvtab_dft_avx2), p);
|
|
Chris@42
|
59 if (X(have_simd_avx2_128)())
|
|
Chris@42
|
60 X(solvtab_exec)(X(solvtab_dft_avx2_128), p);
|
|
Chris@42
|
61 #endif
|
|
Chris@42
|
62 #if HAVE_AVX512
|
|
Chris@42
|
63 if (X(have_simd_avx512)())
|
|
Chris@42
|
64 X(solvtab_exec)(X(solvtab_dft_avx512), p);
|
|
Chris@42
|
65 #endif
|
|
Chris@42
|
66 #if HAVE_KCVI
|
|
Chris@42
|
67 if (X(have_simd_kcvi)())
|
|
Chris@42
|
68 X(solvtab_exec)(X(solvtab_dft_kcvi), p);
|
|
Chris@42
|
69 #endif
|
|
Chris@42
|
70 #if HAVE_ALTIVEC
|
|
Chris@42
|
71 if (X(have_simd_altivec)())
|
|
Chris@42
|
72 X(solvtab_exec)(X(solvtab_dft_altivec), p);
|
|
Chris@42
|
73 #endif
|
|
Chris@42
|
74 #if HAVE_VSX
|
|
Chris@42
|
75 if (X(have_simd_vsx)())
|
|
Chris@42
|
76 X(solvtab_exec)(X(solvtab_dft_vsx), p);
|
|
Chris@42
|
77 #endif
|
|
Chris@42
|
78 #if HAVE_NEON
|
|
Chris@42
|
79 if (X(have_simd_neon)())
|
|
Chris@42
|
80 X(solvtab_exec)(X(solvtab_dft_neon), p);
|
|
Chris@42
|
81 #endif
|
|
Chris@42
|
82 #if HAVE_GENERIC_SIMD128
|
|
Chris@42
|
83 X(solvtab_exec)(X(solvtab_dft_generic_simd128), p);
|
|
Chris@42
|
84 #endif
|
|
Chris@42
|
85 #if HAVE_GENERIC_SIMD256
|
|
Chris@42
|
86 X(solvtab_exec)(X(solvtab_dft_generic_simd256), p);
|
|
Chris@42
|
87 #endif
|
|
Chris@42
|
88 }
|
