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