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: 
cannam@167: /* direct RDFT solver, using r2r codelets */
cannam@167: 
cannam@167: #include "rdft/rdft.h"
cannam@167: 
cannam@167: typedef struct {
cannam@167:      solver super;
cannam@167:      const kr2r_desc *desc;
cannam@167:      kr2r k;
cannam@167: } S;
cannam@167: 
cannam@167: typedef struct {
cannam@167:      plan_rdft super;
cannam@167: 
cannam@167:      INT vl, ivs, ovs;
cannam@167:      stride is, os;
cannam@167:      kr2r k;
cannam@167:      const S *slv;
cannam@167: } P;
cannam@167: 
cannam@167: static void apply(const plan *ego_, R *I, R *O)
cannam@167: {
cannam@167:      const P *ego = (const P *) ego_;
cannam@167:      ASSERT_ALIGNED_DOUBLE;
cannam@167:      ego->k(I, O, ego->is, ego->os, ego->vl, ego->ivs, ego->ovs);
cannam@167: }
cannam@167: 
cannam@167: static void destroy(plan *ego_)
cannam@167: {
cannam@167:      P *ego = (P *) ego_;
cannam@167:      X(stride_destroy)(ego->is);
cannam@167:      X(stride_destroy)(ego->os);
cannam@167: }
cannam@167: 
cannam@167: static void print(const plan *ego_, printer *p)
cannam@167: {
cannam@167:      const P *ego = (const P *) ego_;
cannam@167:      const S *s = ego->slv;
cannam@167: 
cannam@167:      p->print(p, "(rdft-%s-direct-r2r-%D%v \"%s\")", 
cannam@167: 	      X(rdft_kind_str)(s->desc->kind), s->desc->n,
cannam@167: 	      ego->vl, s->desc->nam);
cannam@167: }
cannam@167: 
cannam@167: static int applicable(const solver *ego_, const problem *p_)
cannam@167: {
cannam@167:      const S *ego = (const S *) ego_;
cannam@167:      const problem_rdft *p = (const problem_rdft *) p_;
cannam@167:      INT vl;
cannam@167:      INT ivs, ovs;
cannam@167: 
cannam@167:      return (
cannam@167: 	  1
cannam@167: 	  && p->sz->rnk == 1
cannam@167: 	  && p->vecsz->rnk <= 1
cannam@167: 	  && p->sz->dims[0].n == ego->desc->n
cannam@167: 	  && p->kind[0] == ego->desc->kind
cannam@167: 
cannam@167: 	  /* check strides etc */
cannam@167: 	  && X(tensor_tornk1)(p->vecsz, &vl, &ivs, &ovs)
cannam@167: 
cannam@167: 	  && (0
cannam@167: 	      /* can operate out-of-place */
cannam@167: 	      || p->I != p->O
cannam@167: 
cannam@167: 	      /* computing one transform */
cannam@167: 	      || vl == 1
cannam@167: 
cannam@167: 	      /* can operate in-place as long as strides are the same */
cannam@167: 	      || X(tensor_inplace_strides2)(p->sz, p->vecsz)
cannam@167: 	       )
cannam@167: 	  );
cannam@167: }
cannam@167: 
cannam@167: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
cannam@167: {
cannam@167:      const S *ego = (const S *) ego_;
cannam@167:      P *pln;
cannam@167:      const problem_rdft *p;
cannam@167:      iodim *d;
cannam@167: 
cannam@167:      static const plan_adt padt = {
cannam@167: 	  X(rdft_solve), X(null_awake), print, destroy
cannam@167:      };
cannam@167: 
cannam@167:      UNUSED(plnr);
cannam@167: 
cannam@167:      if (!applicable(ego_, p_))
cannam@167:           return (plan *)0;
cannam@167: 
cannam@167:      p = (const problem_rdft *) p_;
cannam@167: 
cannam@167: 
cannam@167:      pln = MKPLAN_RDFT(P, &padt, apply);
cannam@167: 
cannam@167:      d = p->sz->dims;
cannam@167: 
cannam@167:      pln->k = ego->k;
cannam@167: 
cannam@167:      pln->is = X(mkstride)(d->n, d->is);
cannam@167:      pln->os = X(mkstride)(d->n, d->os);
cannam@167: 
cannam@167:      X(tensor_tornk1)(p->vecsz, &pln->vl, &pln->ivs, &pln->ovs);
cannam@167: 
cannam@167:      pln->slv = ego;
cannam@167:      X(ops_zero)(&pln->super.super.ops);
cannam@167:      X(ops_madd2)(pln->vl / ego->desc->genus->vl,
cannam@167: 		  &ego->desc->ops,
cannam@167: 		  &pln->super.super.ops);
cannam@167: 
cannam@167:      pln->super.super.could_prune_now_p = 1;
cannam@167: 
cannam@167:      return &(pln->super.super);
cannam@167: }
cannam@167: 
cannam@167: /* constructor */
cannam@167: solver *X(mksolver_rdft_r2r_direct)(kr2r k, const kr2r_desc *desc)
cannam@167: {
cannam@167:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
cannam@167:      S *slv = MKSOLVER(S, &sadt);
cannam@167:      slv->k = k;
cannam@167:      slv->desc = desc;
cannam@167:      return &(slv->super);
cannam@167: }
cannam@167: