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