annotate src/fftw-3.3.3/rdft/hc2hc.h @ 95:89f5e221ed7b

Add FFTW3
author Chris Cannam <cannam@all-day-breakfast.com>
date Wed, 20 Mar 2013 15:35:50 +0000
parents
children
rev   line source
cannam@95 1 /*
cannam@95 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95 4 *
cannam@95 5 * This program is free software; you can redistribute it and/or modify
cannam@95 6 * it under the terms of the GNU General Public License as published by
cannam@95 7 * the Free Software Foundation; either version 2 of the License, or
cannam@95 8 * (at your option) any later version.
cannam@95 9 *
cannam@95 10 * This program is distributed in the hope that it will be useful,
cannam@95 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@95 13 * GNU General Public License for more details.
cannam@95 14 *
cannam@95 15 * You should have received a copy of the GNU General Public License
cannam@95 16 * along with this program; if not, write to the Free Software
cannam@95 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@95 18 *
cannam@95 19 */
cannam@95 20
cannam@95 21 #include "rdft.h"
cannam@95 22
cannam@95 23 typedef void (*hc2hcapply) (const plan *ego, R *IO);
cannam@95 24 typedef struct hc2hc_solver_s hc2hc_solver;
cannam@95 25 typedef plan *(*hc2hc_mkinferior)(const hc2hc_solver *ego,
cannam@95 26 rdft_kind kind, INT r, INT m, INT s,
cannam@95 27 INT vl, INT vs, INT mstart, INT mcount,
cannam@95 28 R *IO, planner *plnr);
cannam@95 29
cannam@95 30 typedef struct {
cannam@95 31 plan super;
cannam@95 32 hc2hcapply apply;
cannam@95 33 } plan_hc2hc;
cannam@95 34
cannam@95 35 extern plan *X(mkplan_hc2hc)(size_t size, const plan_adt *adt,
cannam@95 36 hc2hcapply apply);
cannam@95 37
cannam@95 38 #define MKPLAN_HC2HC(type, adt, apply) \
cannam@95 39 (type *)X(mkplan_hc2hc)(sizeof(type), adt, apply)
cannam@95 40
cannam@95 41 struct hc2hc_solver_s {
cannam@95 42 solver super;
cannam@95 43 INT r;
cannam@95 44
cannam@95 45 hc2hc_mkinferior mkcldw;
cannam@95 46 };
cannam@95 47
cannam@95 48 hc2hc_solver *X(mksolver_hc2hc)(size_t size, INT r, hc2hc_mkinferior mkcldw);
cannam@95 49 extern hc2hc_solver *(*X(mksolver_hc2hc_hook))(size_t, INT, hc2hc_mkinferior);
cannam@95 50
cannam@95 51 void X(regsolver_hc2hc_direct)(planner *plnr, khc2hc codelet,
cannam@95 52 const hc2hc_desc *desc);
cannam@95 53
cannam@95 54 int X(hc2hc_applicable)(const hc2hc_solver *, const problem *, planner *);