annotate fft/fftw/fftw-3.3.4/rdft/conf.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21
Chris@19 22 #include "rdft.h"
Chris@19 23
Chris@19 24 static const solvtab s =
Chris@19 25 {
Chris@19 26 SOLVTAB(X(rdft_indirect_register)),
Chris@19 27 SOLVTAB(X(rdft_rank0_register)),
Chris@19 28 SOLVTAB(X(rdft_vrank3_transpose_register)),
Chris@19 29 SOLVTAB(X(rdft_vrank_geq1_register)),
Chris@19 30
Chris@19 31 SOLVTAB(X(rdft_nop_register)),
Chris@19 32 SOLVTAB(X(rdft_buffered_register)),
Chris@19 33 SOLVTAB(X(rdft_generic_register)),
Chris@19 34 SOLVTAB(X(rdft_rank_geq2_register)),
Chris@19 35
Chris@19 36 SOLVTAB(X(dft_r2hc_register)),
Chris@19 37
Chris@19 38 SOLVTAB(X(rdft_dht_register)),
Chris@19 39 SOLVTAB(X(dht_r2hc_register)),
Chris@19 40 SOLVTAB(X(dht_rader_register)),
Chris@19 41
Chris@19 42 SOLVTAB(X(rdft2_vrank_geq1_register)),
Chris@19 43 SOLVTAB(X(rdft2_nop_register)),
Chris@19 44 SOLVTAB(X(rdft2_rank0_register)),
Chris@19 45 SOLVTAB(X(rdft2_buffered_register)),
Chris@19 46 SOLVTAB(X(rdft2_rank_geq2_register)),
Chris@19 47 SOLVTAB(X(rdft2_rdft_register)),
Chris@19 48
Chris@19 49 SOLVTAB(X(hc2hc_generic_register)),
Chris@19 50
Chris@19 51 SOLVTAB_END
Chris@19 52 };
Chris@19 53
Chris@19 54 void X(rdft_conf_standard)(planner *p)
Chris@19 55 {
Chris@19 56 X(solvtab_exec)(s, p);
Chris@19 57 X(solvtab_exec)(X(solvtab_rdft_r2cf), p);
Chris@19 58 X(solvtab_exec)(X(solvtab_rdft_r2cb), p);
Chris@19 59 X(solvtab_exec)(X(solvtab_rdft_r2r), p);
Chris@19 60
Chris@19 61 #if HAVE_SSE2
Chris@19 62 if (X(have_simd_sse2)())
Chris@19 63 X(solvtab_exec)(X(solvtab_rdft_sse2), p);
Chris@19 64 #endif
Chris@19 65 #if HAVE_AVX
Chris@19 66 if (X(have_simd_avx)())
Chris@19 67 X(solvtab_exec)(X(solvtab_rdft_avx), p);
Chris@19 68 #endif
Chris@19 69 #if HAVE_ALTIVEC
Chris@19 70 if (X(have_simd_altivec)())
Chris@19 71 X(solvtab_exec)(X(solvtab_rdft_altivec), p);
Chris@19 72 #endif
Chris@19 73 #if HAVE_NEON
Chris@19 74 if (X(have_simd_neon)())
Chris@19 75 X(solvtab_exec)(X(solvtab_rdft_neon), p);
Chris@19 76 #endif
Chris@19 77 }