1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
/*
* Copyright (c) 2003, 2006 Matteo Frigo
* Copyright (c) 2003, 2006 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/* $Id: conf.c,v 1.31 2006-01-05 03:04:26 stevenj Exp $ */
#include "dft.h"
static const solvtab s =
{
SOLVTAB(X(dft_indirect_register)),
SOLVTAB(X(dft_indirect_transpose_register)),
SOLVTAB(X(dft_rank_geq2_register)),
SOLVTAB(X(dft_vrank_geq1_register)),
SOLVTAB(X(dft_buffered_register)),
SOLVTAB(X(dft_generic_register)),
SOLVTAB(X(dft_rader_register)),
SOLVTAB(X(dft_bluestein_register)),
SOLVTAB(X(dft_nop_register)),
SOLVTAB(X(ct_generic_register)),
SOLVTAB(X(ct_genericbuf_register)),
SOLVTAB_END
};
void X(dft_conf_standard)(planner *p)
{
X(solvtab_exec)(s, p);
X(solvtab_exec)(X(solvtab_dft_standard), p);
#if HAVE_K7
X(solvtab_exec)(X(solvtab_dft_k7), p);
#endif
#if HAVE_SIMD
X(solvtab_exec)(X(solvtab_dft_simd), p);
#endif
}
|
