cannam@127: /*
cannam@127:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@127:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@127:  *
cannam@127:  * This program is free software; you can redistribute it and/or modify
cannam@127:  * it under the terms of the GNU General Public License as published by
cannam@127:  * the Free Software Foundation; either version 2 of the License, or
cannam@127:  * (at your option) any later version.
cannam@127:  *
cannam@127:  * This program is distributed in the hope that it will be useful,
cannam@127:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@127:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@127:  * GNU General Public License for more details.
cannam@127:  *
cannam@127:  * You should have received a copy of the GNU General Public License
cannam@127:  * along with this program; if not, write to the Free Software
cannam@127:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@127:  *
cannam@127:  */
cannam@127: 
cannam@127: #include "api.h"
cannam@127: #include "rdft.h"
cannam@127: 
cannam@127: #define N0(nembed)((nembed) ? (nembed) : n)
cannam@127: 
cannam@127: X(plan) X(plan_many_r2r)(int rank, const int *n,
cannam@127: 			 int howmany,
cannam@127: 			 R *in, const int *inembed,
cannam@127: 			 int istride, int idist,
cannam@127: 			 R *out, const int *onembed,
cannam@127: 			 int ostride, int odist,
cannam@127: 			 const X(r2r_kind) * kind, unsigned flags)
cannam@127: {
cannam@127:      X(plan) p;
cannam@127:      rdft_kind *k;
cannam@127: 
cannam@127:      if (!X(many_kosherp)(rank, n, howmany)) return 0;
cannam@127: 
cannam@127:      k = X(map_r2r_kind)(rank, kind);
cannam@127:      p = X(mkapiplan)(
cannam@127: 	  0, flags,
cannam@127: 	  X(mkproblem_rdft_d)(X(mktensor_rowmajor)(rank, n, 
cannam@127: 						   N0(inembed), N0(onembed),
cannam@127: 						   istride, ostride),
cannam@127: 			      X(mktensor_1d)(howmany, idist, odist),
cannam@127: 			      TAINT_UNALIGNED(in, flags), 
cannam@127: 			      TAINT_UNALIGNED(out, flags), k));
cannam@127:      X(ifree0)(k);
cannam@127:      return p;
cannam@127: }