Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: 
Chris@42: /* direct RDFT2 R2HC/HC2R solver, if we have a codelet */
Chris@42: 
Chris@42: #include "rdft.h"
Chris@42: 
Chris@42: typedef struct {
Chris@42:      solver super;
Chris@42:      const kr2c_desc *desc;
Chris@42:      kr2c k;
Chris@42: } S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_rdft2 super;
Chris@42: 
Chris@42:      stride rs, cs;
Chris@42:      INT vl;
Chris@42:      INT ivs, ovs;
Chris@42:      kr2c k;
Chris@42:      const S *slv;
Chris@42:      INT ilast;
Chris@42: } P;
Chris@42: 
Chris@42: static void apply(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      ASSERT_ALIGNED_DOUBLE;
Chris@42:      ego->k(r0, r1, cr, ci,
Chris@42: 	    ego->rs, ego->cs, ego->cs,
Chris@42: 	    ego->vl, ego->ivs, ego->ovs);
Chris@42: }
Chris@42: 
Chris@42: static void apply_r2hc(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      INT i, vl = ego->vl, ovs = ego->ovs;
Chris@42:      ASSERT_ALIGNED_DOUBLE;
Chris@42:      ego->k(r0, r1, cr, ci,
Chris@42: 	    ego->rs, ego->cs, ego->cs,
Chris@42: 	    vl, ego->ivs, ovs);
Chris@42:      for (i = 0; i < vl; ++i, ci += ovs)
Chris@42: 	  ci[0] = ci[ego->ilast] = 0;
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(stride_destroy)(ego->rs);
Chris@42:      X(stride_destroy)(ego->cs);
Chris@42: }
Chris@42: 
Chris@42: static void print(const plan *ego_, printer *p)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      const S *s = ego->slv;
Chris@42: 
Chris@42:      p->print(p, "(rdft2-%s-direct-%D%v \"%s\")", 
Chris@42: 	      X(rdft_kind_str)(s->desc->genus->kind), s->desc->n, 
Chris@42: 	      ego->vl, s->desc->nam);
Chris@42: }
Chris@42: 
Chris@42: static int applicable(const solver *ego_, const problem *p_)
Chris@42: {
Chris@42:      const S *ego = (const S *) ego_;
Chris@42:      const kr2c_desc *desc = ego->desc;
Chris@42:      const problem_rdft2 *p = (const problem_rdft2 *) p_;
Chris@42:      INT vl;
Chris@42:      INT ivs, ovs;
Chris@42: 
Chris@42:      return (
Chris@42: 	  1
Chris@42: 	  && p->sz->rnk == 1
Chris@42: 	  && p->vecsz->rnk <= 1
Chris@42: 	  && p->sz->dims[0].n == desc->n
Chris@42: 	  && p->kind == desc->genus->kind
Chris@42: 
Chris@42: 	  /* check strides etc */
Chris@42: 	  && X(tensor_tornk1)(p->vecsz, &vl, &ivs, &ovs)
Chris@42: 
Chris@42: 	  && (0
Chris@42: 	      /* can operate out-of-place */
Chris@42: 	      || p->r0 != p->cr
Chris@42: 
Chris@42: 	      /*
Chris@42: 	       * can compute one transform in-place, no matter
Chris@42: 	       * what the strides are.
Chris@42: 	       */
Chris@42: 	      || p->vecsz->rnk == 0
Chris@42: 
Chris@42: 	      /* can operate in-place as long as strides are the same */
Chris@42: 	      || X(rdft2_inplace_strides)(p, RNK_MINFTY)
Chris@42: 	       )
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const S *ego = (const S *) ego_;
Chris@42:      P *pln;
Chris@42:      const problem_rdft2 *p;
Chris@42:      iodim *d;
Chris@42:      int r2hc_kindp;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft2_solve), X(null_awake), print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      UNUSED(plnr);
Chris@42: 
Chris@42:      if (!applicable(ego_, p_))
Chris@42:           return (plan *)0;
Chris@42: 
Chris@42:      p = (const problem_rdft2 *) p_;
Chris@42: 
Chris@42:      r2hc_kindp = R2HC_KINDP(p->kind);
Chris@42:      A(r2hc_kindp || HC2R_KINDP(p->kind));
Chris@42: 
Chris@42:      pln = MKPLAN_RDFT2(P, &padt, p->kind == R2HC ? apply_r2hc : apply);
Chris@42: 
Chris@42:      d = p->sz->dims;
Chris@42: 
Chris@42:      pln->k = ego->k;
Chris@42: 
Chris@42:      pln->rs = X(mkstride)(d->n, r2hc_kindp ? d->is : d->os);
Chris@42:      pln->cs = X(mkstride)(d->n, r2hc_kindp ? d->os : d->is);
Chris@42: 
Chris@42:      X(tensor_tornk1)(p->vecsz, &pln->vl, &pln->ivs, &pln->ovs);
Chris@42: 
Chris@42:      /* Nyquist freq., if any */
Chris@42:      pln->ilast = (d->n % 2) ? 0 : (d->n/2) * d->os;
Chris@42: 
Chris@42:      pln->slv = ego;
Chris@42:      X(ops_zero)(&pln->super.super.ops);
Chris@42:      X(ops_madd2)(pln->vl / ego->desc->genus->vl,
Chris@42: 		  &ego->desc->ops,
Chris@42: 		  &pln->super.super.ops);
Chris@42:      if (p->kind == R2HC)
Chris@42: 	  pln->super.super.ops.other += 2 * pln->vl; /* + 2 stores */
Chris@42: 
Chris@42:      pln->super.super.could_prune_now_p = 1;
Chris@42:      return &(pln->super.super);
Chris@42: }
Chris@42: 
Chris@42: /* constructor */
Chris@42: solver *X(mksolver_rdft2_direct)(kr2c k, const kr2c_desc *desc)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_RDFT2, mkplan, 0 };
Chris@42:      S *slv = MKSOLVER(S, &sadt);
Chris@42:      slv->k = k;
Chris@42:      slv->desc = desc;
Chris@42:      return &(slv->super);
Chris@42: }