Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: #include "dft.h"
Chris@42: 
Chris@42: typedef void (*dftwapply)(const plan *ego, R *rio, R *iio);
Chris@42: typedef struct ct_solver_s ct_solver;
Chris@42: typedef plan *(*ct_mkinferior)(const ct_solver *ego,
Chris@42: 			       INT r, INT irs, INT ors,
Chris@42: 			       INT m, INT ms,
Chris@42: 			       INT v, INT ivs, INT ovs,
Chris@42: 			       INT mstart, INT mcount,
Chris@42: 			       R *rio, R *iio, planner *plnr);
Chris@42: typedef int (*ct_force_vrecursion)(const ct_solver *ego, 
Chris@42: 				   const problem_dft *p);
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan super;
Chris@42:      dftwapply apply;
Chris@42: } plan_dftw;
Chris@42: 
Chris@42: extern plan *X(mkplan_dftw)(size_t size, const plan_adt *adt, dftwapply apply);
Chris@42: 
Chris@42: #define MKPLAN_DFTW(type, adt, apply) \
Chris@42:   (type *)X(mkplan_dftw)(sizeof(type), adt, apply)
Chris@42: 
Chris@42: struct ct_solver_s {
Chris@42:      solver super;
Chris@42:      INT r;
Chris@42:      int dec;
Chris@42: #    define DECDIF 0
Chris@42: #    define DECDIT 1
Chris@42: #    define TRANSPOSE 2
Chris@42:      ct_mkinferior mkcldw;
Chris@42:      ct_force_vrecursion force_vrecursionp;
Chris@42: };
Chris@42: 
Chris@42: int X(ct_applicable)(const ct_solver *, const problem *, planner *);
Chris@42: ct_solver *X(mksolver_ct)(size_t size, INT r, int dec, 
Chris@42: 			  ct_mkinferior mkcldw, 
Chris@42: 			  ct_force_vrecursion force_vrecursionp);
Chris@42: extern ct_solver *(*X(mksolver_ct_hook))(size_t, INT, int, 
Chris@42: 					 ct_mkinferior, ct_force_vrecursion);
Chris@42: 
Chris@42: void X(regsolver_ct_directw)(planner *plnr,
Chris@42:      kdftw codelet, const ct_desc *desc, int dec);
Chris@42: void X(regsolver_ct_directwbuf)(planner *plnr,
Chris@42:      kdftw codelet, const ct_desc *desc, int dec);
Chris@42: solver *X(mksolver_ctsq)(kdftwsq codelet, const ct_desc *desc, int dec);
Chris@42: void X(regsolver_ct_directwsq)(planner *plnr, kdftwsq codelet, 
Chris@42: 			       const ct_desc *desc, int dec);