annotate src/fftw-3.3.3/rdft/conf.c @ 10:37bf6b4a2645

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