|
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 #include "api.h"
|
|
Chris@42
|
22 #include "rdft.h"
|
|
Chris@42
|
23
|
|
Chris@42
|
24 rdft_kind *X(map_r2r_kind)(int rank, const X(r2r_kind) * kind)
|
|
Chris@42
|
25 {
|
|
Chris@42
|
26 int i;
|
|
Chris@42
|
27 rdft_kind *k;
|
|
Chris@42
|
28
|
|
Chris@42
|
29 A(FINITE_RNK(rank));
|
|
Chris@42
|
30 k = (rdft_kind *) MALLOC((unsigned)rank * sizeof(rdft_kind), PROBLEMS);
|
|
Chris@42
|
31 for (i = 0; i < rank; ++i) {
|
|
Chris@42
|
32 rdft_kind m;
|
|
Chris@42
|
33 switch (kind[i]) {
|
|
Chris@42
|
34 case FFTW_R2HC: m = R2HC; break;
|
|
Chris@42
|
35 case FFTW_HC2R: m = HC2R; break;
|
|
Chris@42
|
36 case FFTW_DHT: m = DHT; break;
|
|
Chris@42
|
37 case FFTW_REDFT00: m = REDFT00; break;
|
|
Chris@42
|
38 case FFTW_REDFT01: m = REDFT01; break;
|
|
Chris@42
|
39 case FFTW_REDFT10: m = REDFT10; break;
|
|
Chris@42
|
40 case FFTW_REDFT11: m = REDFT11; break;
|
|
Chris@42
|
41 case FFTW_RODFT00: m = RODFT00; break;
|
|
Chris@42
|
42 case FFTW_RODFT01: m = RODFT01; break;
|
|
Chris@42
|
43 case FFTW_RODFT10: m = RODFT10; break;
|
|
Chris@42
|
44 case FFTW_RODFT11: m = RODFT11; break;
|
|
Chris@42
|
45 default: m = R2HC; A(0);
|
|
Chris@42
|
46 }
|
|
Chris@42
|
47 k[i] = m;
|
|
Chris@42
|
48 }
|
|
Chris@42
|
49 return k;
|
|
Chris@42
|
50 }
|
