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