cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: #ifndef __RDFT_H__
cannam@167: #define __RDFT_H__
cannam@167: 
cannam@167: #include "kernel/ifftw.h"
cannam@167: #include "rdft/codelet-rdft.h"
cannam@167: 
cannam@167: #ifdef __cplusplus
cannam@167: extern "C"
cannam@167: {
cannam@167: #endif /* __cplusplus */
cannam@167: 
cannam@167: /* problem.c: */
cannam@167: typedef struct {
cannam@167:      problem super;
cannam@167:      tensor *sz, *vecsz;
cannam@167:      R *I, *O;
cannam@167: #if defined(STRUCT_HACK_KR)
cannam@167:      rdft_kind kind[1];
cannam@167: #elif defined(STRUCT_HACK_C99)
cannam@167:      rdft_kind kind[];
cannam@167: #else
cannam@167:      rdft_kind *kind;
cannam@167: #endif
cannam@167: } problem_rdft;
cannam@167: 
cannam@167: void X(rdft_zerotens)(tensor *sz, R *I);
cannam@167: problem *X(mkproblem_rdft)(const tensor *sz, const tensor *vecsz,
cannam@167: 			   R *I, R *O, const rdft_kind *kind);
cannam@167: problem *X(mkproblem_rdft_d)(tensor *sz, tensor *vecsz,
cannam@167: 			     R *I, R *O, const rdft_kind *kind);
cannam@167: problem *X(mkproblem_rdft_0_d)(tensor *vecsz, R *I, R *O);
cannam@167: problem *X(mkproblem_rdft_1)(const tensor *sz, const tensor *vecsz,
cannam@167: 			     R *I, R *O, rdft_kind kind);
cannam@167: problem *X(mkproblem_rdft_1_d)(tensor *sz, tensor *vecsz,
cannam@167: 			       R *I, R *O, rdft_kind kind);
cannam@167: 
cannam@167: const char *X(rdft_kind_str)(rdft_kind kind);
cannam@167: 
cannam@167: /* solve.c: */
cannam@167: void X(rdft_solve)(const plan *ego_, const problem *p_);
cannam@167: 
cannam@167: /* plan.c: */
cannam@167: typedef void (*rdftapply) (const plan *ego, R *I, R *O);
cannam@167: 
cannam@167: typedef struct {
cannam@167:      plan super;
cannam@167:      rdftapply apply;
cannam@167: } plan_rdft;
cannam@167: 
cannam@167: plan *X(mkplan_rdft)(size_t size, const plan_adt *adt, rdftapply apply);
cannam@167: 
cannam@167: #define MKPLAN_RDFT(type, adt, apply) \
cannam@167:   (type *)X(mkplan_rdft)(sizeof(type), adt, apply)
cannam@167: 
cannam@167: /* various solvers */
cannam@167: 
cannam@167: solver *X(mksolver_rdft_r2c_direct)(kr2c k, const kr2c_desc *desc);
cannam@167: solver *X(mksolver_rdft_r2c_directbuf)(kr2c k, const kr2c_desc *desc);
cannam@167: solver *X(mksolver_rdft_r2r_direct)(kr2r k, const kr2r_desc *desc);
cannam@167: 
cannam@167: void X(rdft_rank0_register)(planner *p);
cannam@167: void X(rdft_vrank3_transpose_register)(planner *p);
cannam@167: void X(rdft_rank_geq2_register)(planner *p);
cannam@167: void X(rdft_indirect_register)(planner *p);
cannam@167: void X(rdft_vrank_geq1_register)(planner *p);
cannam@167: void X(rdft_buffered_register)(planner *p);
cannam@167: void X(rdft_generic_register)(planner *p);
cannam@167: void X(rdft_rader_hc2hc_register)(planner *p);
cannam@167: void X(rdft_dht_register)(planner *p);
cannam@167: void X(dht_r2hc_register)(planner *p);
cannam@167: void X(dht_rader_register)(planner *p);
cannam@167: void X(dft_r2hc_register)(planner *p);
cannam@167: void X(rdft_nop_register)(planner *p);
cannam@167: void X(hc2hc_generic_register)(planner *p);
cannam@167: 
cannam@167: /****************************************************************************/
cannam@167: /* problem2.c: */
cannam@167: /* 
cannam@167:    An RDFT2 problem transforms a 1d real array r[n] with stride is/os
cannam@167:    to/from an "unpacked" complex array {rio,iio}[n/2 + 1] with stride
cannam@167:    os/is.  R0 points to the first even element of the real array.  
cannam@167:    R1 points to the first odd element of the real array.
cannam@167: 
cannam@167:    Strides on the real side of the transform express distances
cannam@167:    between consecutive elements of the same array (even or odd).
cannam@167:    E.g., for a contiguous input
cannam@167: 
cannam@167:      R0 R1 R2 R3 ...
cannam@167: 
cannam@167:    the input stride would be 2, not 1.  This convention is necessary
cannam@167:    for hc2c codelets to work, since they transpose even/odd with
cannam@167:    real/imag.
cannam@167:    
cannam@167:    Multidimensional transforms use complex DFTs for the
cannam@167:    noncontiguous dimensions.  vecsz has the usual interpretation.  
cannam@167: */
cannam@167: typedef struct {
cannam@167:      problem super;
cannam@167:      tensor *sz;
cannam@167:      tensor *vecsz;
cannam@167:      R *r0, *r1;
cannam@167:      R *cr, *ci;
cannam@167:      rdft_kind kind; /* assert(kind < DHT) */
cannam@167: } problem_rdft2;
cannam@167: 
cannam@167: problem *X(mkproblem_rdft2)(const tensor *sz, const tensor *vecsz,
cannam@167: 			    R *r0, R *r1, R *cr, R *ci, rdft_kind kind);
cannam@167: problem *X(mkproblem_rdft2_d)(tensor *sz, tensor *vecsz,
cannam@167: 			      R *r0, R *r1, R *cr, R *ci, rdft_kind kind);
cannam@167: problem *X(mkproblem_rdft2_d_3pointers)(tensor *sz, tensor *vecsz,
cannam@167: 					R *r, R *cr, R *ci, rdft_kind kind);
cannam@167: int X(rdft2_inplace_strides)(const problem_rdft2 *p, int vdim);
cannam@167: INT X(rdft2_tensor_max_index)(const tensor *sz, rdft_kind k);
cannam@167: void X(rdft2_strides)(rdft_kind kind, const iodim *d, INT *rs, INT *cs);
cannam@167: INT X(rdft2_complex_n)(INT real_n, rdft_kind kind);
cannam@167: 
cannam@167: /* verify.c: */
cannam@167: void X(rdft2_verify)(plan *pln, const problem_rdft2 *p, int rounds);
cannam@167: 
cannam@167: /* solve.c: */
cannam@167: void X(rdft2_solve)(const plan *ego_, const problem *p_);
cannam@167: 
cannam@167: /* plan.c: */
cannam@167: typedef void (*rdft2apply) (const plan *ego, R *r0, R *r1, R *cr, R *ci);
cannam@167: 
cannam@167: typedef struct {
cannam@167:      plan super;
cannam@167:      rdft2apply apply;
cannam@167: } plan_rdft2;
cannam@167: 
cannam@167: plan *X(mkplan_rdft2)(size_t size, const plan_adt *adt, rdft2apply apply);
cannam@167: 
cannam@167: #define MKPLAN_RDFT2(type, adt, apply) \
cannam@167:   (type *)X(mkplan_rdft2)(sizeof(type), adt, apply)
cannam@167: 
cannam@167: /* various solvers */
cannam@167: 
cannam@167: solver *X(mksolver_rdft2_direct)(kr2c k, const kr2c_desc *desc);
cannam@167: 
cannam@167: void X(rdft2_vrank_geq1_register)(planner *p);
cannam@167: void X(rdft2_buffered_register)(planner *p);
cannam@167: void X(rdft2_rdft_register)(planner *p);
cannam@167: void X(rdft2_nop_register)(planner *p);
cannam@167: void X(rdft2_rank0_register)(planner *p);
cannam@167: void X(rdft2_rank_geq2_register)(planner *p);
cannam@167: 
cannam@167: /****************************************************************************/
cannam@167: 
cannam@167: /* configurations */
cannam@167: void X(rdft_conf_standard)(planner *p);
cannam@167: 
cannam@167: #ifdef __cplusplus
cannam@167: }  /* extern "C" */
cannam@167: #endif /* __cplusplus */
cannam@167: 
cannam@167: #endif /* __RDFT_H__ */