Updates
This commit is contained in:
50
fftw-3.3.10/api/plan-many-r2r.c
Normal file
50
fftw-3.3.10/api/plan-many-r2r.c
Normal file
@@ -0,0 +1,50 @@
|
||||
/*
|
||||
* Copyright (c) 2003, 2007-14 Matteo Frigo
|
||||
* Copyright (c) 2003, 2007-14 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*
|
||||
*/
|
||||
|
||||
#include "api/api.h"
|
||||
#include "rdft/rdft.h"
|
||||
|
||||
#define N0(nembed)((nembed) ? (nembed) : n)
|
||||
|
||||
X(plan) X(plan_many_r2r)(int rank, const int *n,
|
||||
int howmany,
|
||||
R *in, const int *inembed,
|
||||
int istride, int idist,
|
||||
R *out, const int *onembed,
|
||||
int ostride, int odist,
|
||||
const X(r2r_kind) * kind, unsigned flags)
|
||||
{
|
||||
X(plan) p;
|
||||
rdft_kind *k;
|
||||
|
||||
if (!X(many_kosherp)(rank, n, howmany)) return 0;
|
||||
|
||||
k = X(map_r2r_kind)(rank, kind);
|
||||
p = X(mkapiplan)(
|
||||
0, flags,
|
||||
X(mkproblem_rdft_d)(X(mktensor_rowmajor)(rank, n,
|
||||
N0(inembed), N0(onembed),
|
||||
istride, ostride),
|
||||
X(mktensor_1d)(howmany, idist, odist),
|
||||
TAINT_UNALIGNED(in, flags),
|
||||
TAINT_UNALIGNED(out, flags), k));
|
||||
X(ifree0)(k);
|
||||
return p;
|
||||
}
|
||||
Reference in New Issue
Block a user