1 /*
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
18 *
19 */
20
21 #include "api/api.h"
22 #include "rdft/rdft.h"
23
24 #define N0(nembed)((nembed) ? (nembed) : n)
25
X(plan_many_r2r)26 X(plan) X(plan_many_r2r)(int rank, const int *n,
27 int howmany,
28 R *in, const int *inembed,
29 int istride, int idist,
30 R *out, const int *onembed,
31 int ostride, int odist,
32 const X(r2r_kind) * kind, unsigned flags)
33 {
34 X(plan) p;
35 rdft_kind *k;
36
37 if (!X(many_kosherp)(rank, n, howmany)) return 0;
38
39 k = X(map_r2r_kind)(rank, kind);
40 p = X(mkapiplan)(
41 0, flags,
42 X(mkproblem_rdft_d)(X(mktensor_rowmajor)(rank, n,
43 N0(inembed), N0(onembed),
44 istride, ostride),
45 X(mktensor_1d)(howmany, idist, odist),
46 TAINT_UNALIGNED(in, flags),
47 TAINT_UNALIGNED(out, flags), k));
48 X(ifree0)(k);
49 return p;
50 }
51