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