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 "rdft.h" cannam@95: cannam@95: typedef void (*hc2hcapply) (const plan *ego, R *IO); cannam@95: typedef struct hc2hc_solver_s hc2hc_solver; cannam@95: typedef plan *(*hc2hc_mkinferior)(const hc2hc_solver *ego, cannam@95: rdft_kind kind, INT r, INT m, INT s, cannam@95: INT vl, INT vs, INT mstart, INT mcount, cannam@95: R *IO, planner *plnr); cannam@95: cannam@95: typedef struct { cannam@95: plan super; cannam@95: hc2hcapply apply; cannam@95: } plan_hc2hc; cannam@95: cannam@95: extern plan *X(mkplan_hc2hc)(size_t size, const plan_adt *adt, cannam@95: hc2hcapply apply); cannam@95: cannam@95: #define MKPLAN_HC2HC(type, adt, apply) \ cannam@95: (type *)X(mkplan_hc2hc)(sizeof(type), adt, apply) cannam@95: cannam@95: struct hc2hc_solver_s { cannam@95: solver super; cannam@95: INT r; cannam@95: cannam@95: hc2hc_mkinferior mkcldw; cannam@95: }; cannam@95: cannam@95: hc2hc_solver *X(mksolver_hc2hc)(size_t size, INT r, hc2hc_mkinferior mkcldw); cannam@95: extern hc2hc_solver *(*X(mksolver_hc2hc_hook))(size_t, INT, hc2hc_mkinferior); cannam@95: cannam@95: void X(regsolver_hc2hc_direct)(planner *plnr, khc2hc codelet, cannam@95: const hc2hc_desc *desc); cannam@95: cannam@95: int X(hc2hc_applicable)(const hc2hc_solver *, const problem *, planner *);