|
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 X(plan) X(plan_many_dft_c2r)(int rank, const int *n,
|
|
Chris@42
|
25 int howmany,
|
|
Chris@42
|
26 C *in, const int *inembed,
|
|
Chris@42
|
27 int istride, int idist,
|
|
Chris@42
|
28 R *out, const int *onembed,
|
|
Chris@42
|
29 int ostride, int odist, unsigned flags)
|
|
Chris@42
|
30 {
|
|
Chris@42
|
31 R *ri, *ii;
|
|
Chris@42
|
32 int *nfi, *nfo;
|
|
Chris@42
|
33 int inplace;
|
|
Chris@42
|
34 X(plan) p;
|
|
Chris@42
|
35
|
|
Chris@42
|
36 if (!X(many_kosherp)(rank, n, howmany)) return 0;
|
|
Chris@42
|
37
|
|
Chris@42
|
38 EXTRACT_REIM(FFT_SIGN, in, &ri, &ii);
|
|
Chris@42
|
39 inplace = out == ri;
|
|
Chris@42
|
40
|
|
Chris@42
|
41 if (!inplace)
|
|
Chris@42
|
42 flags |= FFTW_DESTROY_INPUT;
|
|
Chris@42
|
43 p = X(mkapiplan)(
|
|
Chris@42
|
44 0, flags,
|
|
Chris@42
|
45 X(mkproblem_rdft2_d_3pointers)(
|
|
Chris@42
|
46 X(mktensor_rowmajor)(
|
|
Chris@42
|
47 rank, n,
|
|
Chris@42
|
48 X(rdft2_pad)(rank, n, inembed, inplace, 1, &nfi),
|
|
Chris@42
|
49 X(rdft2_pad)(rank, n, onembed, inplace, 0, &nfo),
|
|
Chris@42
|
50 2 * istride, ostride),
|
|
Chris@42
|
51 X(mktensor_1d)(howmany, 2 * idist, odist),
|
|
Chris@42
|
52 TAINT_UNALIGNED(out, flags),
|
|
Chris@42
|
53 TAINT_UNALIGNED(ri, flags), TAINT_UNALIGNED(ii, flags),
|
|
Chris@42
|
54 HC2R));
|
|
Chris@42
|
55
|
|
Chris@42
|
56 X(ifree0)(nfi);
|
|
Chris@42
|
57 X(ifree0)(nfo);
|
|
Chris@42
|
58 return p;
|
|
Chris@42
|
59 }
|
