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 RDFT solver, using r2c codelets */
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:      int bufferedp;
Chris@42: } S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_rdft super;
Chris@42: 
Chris@42:      stride rs, csr, csi;
Chris@42:      stride brs, bcsr, bcsi;
Chris@42:      INT n, vl, rs0, ivs, ovs, ioffset, bioffset;
Chris@42:      kr2c k;
Chris@42:      const S *slv;
Chris@42: } P;
Chris@42: 
Chris@42: /*************************************************************
Chris@42:   Nonbuffered code
Chris@42:  *************************************************************/
Chris@42: static void apply_r2hc(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      ASSERT_ALIGNED_DOUBLE;
Chris@42:      ego->k(I, I + ego->rs0, O, O + ego->ioffset, 
Chris@42: 	    ego->rs, ego->csr, ego->csi,
Chris@42: 	    ego->vl, ego->ivs, ego->ovs);
Chris@42: }
Chris@42: 
Chris@42: static void apply_hc2r(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      ASSERT_ALIGNED_DOUBLE;
Chris@42:      ego->k(O, O + ego->rs0, I, I + ego->ioffset, 
Chris@42: 	    ego->rs, ego->csr, ego->csi,
Chris@42: 	    ego->vl, ego->ivs, ego->ovs);
Chris@42: }
Chris@42: 
Chris@42: /*************************************************************
Chris@42:   Buffered code
Chris@42:  *************************************************************/
Chris@42: /* should not be 2^k to avoid associativity conflicts */
Chris@42: static INT compute_batchsize(INT radix)
Chris@42: {
Chris@42:      /* round up to multiple of 4 */
Chris@42:      radix += 3;
Chris@42:      radix &= -4;
Chris@42: 
Chris@42:      return (radix + 2);
Chris@42: }
Chris@42: 
Chris@42: static void dobatch_r2hc(const P *ego, R *I, R *O, R *buf, INT batchsz)
Chris@42: {
Chris@42:      X(cpy2d_ci)(I, buf,
Chris@42: 		 ego->n, ego->rs0, WS(ego->bcsr /* hack */, 1),
Chris@42: 		 batchsz, ego->ivs, 1, 1);
Chris@42: 
Chris@42:      if (IABS(WS(ego->csr, 1)) < IABS(ego->ovs)) {
Chris@42: 	  /* transform directly to output */
Chris@42: 	  ego->k(buf, buf + WS(ego->bcsr /* hack */, 1), 
Chris@42: 		 O, O + ego->ioffset, 
Chris@42: 		 ego->brs, ego->csr, ego->csi,
Chris@42: 		 batchsz, 1, ego->ovs);
Chris@42:      } else {
Chris@42: 	  /* transform to buffer and copy back */
Chris@42: 	  ego->k(buf, buf + WS(ego->bcsr /* hack */, 1), 
Chris@42: 		 buf, buf + ego->bioffset, 
Chris@42: 		 ego->brs, ego->bcsr, ego->bcsi,
Chris@42: 		 batchsz, 1, 1);
Chris@42: 	  X(cpy2d_co)(buf, O,
Chris@42: 		      ego->n, WS(ego->bcsr, 1), WS(ego->csr, 1),  
Chris@42: 		      batchsz, 1, ego->ovs, 1);
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static void dobatch_hc2r(const P *ego, R *I, R *O, R *buf, INT batchsz)
Chris@42: {
Chris@42:      if (IABS(WS(ego->csr, 1)) < IABS(ego->ivs)) {
Chris@42: 	  /* transform directly from input */
Chris@42: 	  ego->k(buf, buf + WS(ego->bcsr /* hack */, 1),
Chris@42: 		 I, I + ego->ioffset, 
Chris@42: 		 ego->brs, ego->csr, ego->csi,
Chris@42: 		 batchsz, ego->ivs, 1);
Chris@42:      } else {
Chris@42: 	  /* copy into buffer and transform in place */
Chris@42: 	  X(cpy2d_ci)(I, buf,
Chris@42: 		      ego->n, WS(ego->csr, 1), WS(ego->bcsr, 1),
Chris@42: 		      batchsz, ego->ivs, 1, 1);
Chris@42: 	  ego->k(buf, buf + WS(ego->bcsr /* hack */, 1),
Chris@42: 		 buf, buf + ego->bioffset, 
Chris@42: 		 ego->brs, ego->bcsr, ego->bcsi,
Chris@42: 		 batchsz, 1, 1);
Chris@42:      }
Chris@42:      X(cpy2d_co)(buf, O,
Chris@42: 		 ego->n, WS(ego->bcsr /* hack */, 1), ego->rs0,
Chris@42: 		 batchsz, 1, ego->ovs, 1);
Chris@42: }
Chris@42: 
Chris@42: static void iterate(const P *ego, R *I, R *O,
Chris@42: 		    void (*dobatch)(const P *ego, R *I, R *O, 
Chris@42: 				    R *buf, INT batchsz))
Chris@42: {
Chris@42:      R *buf;
Chris@42:      INT vl = ego->vl;
Chris@42:      INT n = ego->n;
Chris@42:      INT i;
Chris@42:      INT batchsz = compute_batchsize(n);
Chris@42:      size_t bufsz = n * batchsz * sizeof(R);
Chris@42: 
Chris@42:      BUF_ALLOC(R *, buf, bufsz);
Chris@42: 
Chris@42:      for (i = 0; i < vl - batchsz; i += batchsz) {
Chris@42: 	  dobatch(ego, I, O, buf, batchsz);
Chris@42: 	  I += batchsz * ego->ivs;
Chris@42: 	  O += batchsz * ego->ovs;
Chris@42:      }
Chris@42:      dobatch(ego, I, O, buf, vl - i);
Chris@42: 
Chris@42:      BUF_FREE(buf, bufsz);
Chris@42: }
Chris@42: 
Chris@42: static void apply_buf_r2hc(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      iterate((const P *) ego_, I, O, dobatch_r2hc);
Chris@42: }
Chris@42: 
Chris@42: static void apply_buf_hc2r(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      iterate((const P *) ego_, I, O, dobatch_hc2r);
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->csr);
Chris@42:      X(stride_destroy)(ego->csi);
Chris@42:      X(stride_destroy)(ego->brs);
Chris@42:      X(stride_destroy)(ego->bcsr);
Chris@42:      X(stride_destroy)(ego->bcsi);
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:      if (ego->slv->bufferedp)
Chris@42: 	  p->print(p, "(rdft-%s-directbuf/%D-r2c-%D%v \"%s\")", 
Chris@42: 		   X(rdft_kind_str)(s->desc->genus->kind), 
Chris@42: 		   /* hack */ WS(ego->bcsr, 1), ego->n, 
Chris@42: 		   ego->vl, s->desc->nam);
Chris@42: 
Chris@42:      else 
Chris@42: 	  p->print(p, "(rdft-%s-direct-r2c-%D%v \"%s\")", 
Chris@42: 		   X(rdft_kind_str)(s->desc->genus->kind), ego->n, 
Chris@42: 		   ego->vl, s->desc->nam);
Chris@42: }
Chris@42: 
Chris@42: static INT ioffset(rdft_kind kind, INT sz, INT s)
Chris@42: {
Chris@42:      return(s * ((kind == R2HC || kind == HC2R) ? sz : (sz - 1)));
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_rdft *p = (const problem_rdft *) p_;
Chris@42:      INT vl, 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[0] == 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->I != p->O
Chris@42: 
Chris@42: 	      /* computing one transform */
Chris@42: 	      || vl == 1
Chris@42: 
Chris@42: 	      /* can operate in-place as long as strides are the same */
Chris@42: 	      || X(tensor_inplace_strides2)(p->sz, p->vecsz)
Chris@42: 	       )
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static int applicable_buf(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_rdft *p = (const problem_rdft *) p_;
Chris@42:      INT vl, ivs, ovs, batchsz;
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[0] == desc->genus->kind
Chris@42: 
Chris@42: 	  /* check strides etc */
Chris@42: 	  && X(tensor_tornk1)(p->vecsz, &vl, &ivs, &ovs)
Chris@42: 
Chris@42: 	  && (batchsz = compute_batchsize(desc->n), 1)
Chris@42: 
Chris@42: 	  && (0
Chris@42: 	      /* can operate out-of-place */
Chris@42: 	      || p->I != p->O
Chris@42: 
Chris@42: 	      /* can operate in-place as long as strides are the same */
Chris@42: 	      || X(tensor_inplace_strides2)(p->sz, p->vecsz)
Chris@42: 
Chris@42: 	      /* can do it if the problem fits in the buffer, no matter
Chris@42: 		 what the strides are */
Chris@42: 	      || vl <= batchsz
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_rdft *p;
Chris@42:      iodim *d;
Chris@42:      INT rs, cs, b, n;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft_solve), X(null_awake), print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      UNUSED(plnr);
Chris@42: 
Chris@42:      if (ego->bufferedp) {
Chris@42: 	  if (!applicable_buf(ego_, p_))
Chris@42: 	       return (plan *)0;
Chris@42:      } else {
Chris@42: 	  if (!applicable(ego_, p_))
Chris@42: 	       return (plan *)0;
Chris@42:      }
Chris@42: 
Chris@42:      p = (const problem_rdft *) p_;
Chris@42: 
Chris@42:      if (R2HC_KINDP(p->kind[0])) {
Chris@42: 	  rs = p->sz->dims[0].is; cs = p->sz->dims[0].os;
Chris@42: 	  pln = MKPLAN_RDFT(P, &padt, 
Chris@42: 			    ego->bufferedp ? apply_buf_r2hc : apply_r2hc);
Chris@42:      } else {
Chris@42: 	  rs = p->sz->dims[0].os; cs = p->sz->dims[0].is;
Chris@42: 	  pln = MKPLAN_RDFT(P, &padt, 
Chris@42: 			    ego->bufferedp ? apply_buf_hc2r : apply_hc2r);
Chris@42:      }
Chris@42: 
Chris@42:      d = p->sz->dims;
Chris@42:      n = d[0].n;
Chris@42: 
Chris@42:      pln->k = ego->k;
Chris@42:      pln->n = n;
Chris@42: 
Chris@42:      pln->rs0 = rs;
Chris@42:      pln->rs = X(mkstride)(n, 2 * rs);
Chris@42:      pln->csr = X(mkstride)(n, cs);
Chris@42:      pln->csi = X(mkstride)(n, -cs);
Chris@42:      pln->ioffset = ioffset(p->kind[0], n, cs);
Chris@42: 
Chris@42:      b = compute_batchsize(n);
Chris@42:      pln->brs = X(mkstride)(n, 2 * b);
Chris@42:      pln->bcsr = X(mkstride)(n, b);
Chris@42:      pln->bcsi = X(mkstride)(n, -b);
Chris@42:      pln->bioffset = ioffset(p->kind[0], n, b);
Chris@42: 
Chris@42:      X(tensor_tornk1)(p->vecsz, &pln->vl, &pln->ivs, &pln->ovs);
Chris@42: 
Chris@42:      pln->slv = ego;
Chris@42:      X(ops_zero)(&pln->super.super.ops);
Chris@42: 
Chris@42:      X(ops_madd2)(pln->vl / ego->desc->genus->vl,
Chris@42: 		  &ego->desc->ops,
Chris@42: 		  &pln->super.super.ops);
Chris@42: 
Chris@42:      if (ego->bufferedp) 
Chris@42: 	  pln->super.super.ops.other += 2 * n * pln->vl;
Chris@42: 
Chris@42:      pln->super.super.could_prune_now_p = !ego->bufferedp;
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: }
Chris@42: 
Chris@42: /* constructor */
Chris@42: static solver *mksolver(kr2c k, const kr2c_desc *desc, int bufferedp)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
Chris@42:      S *slv = MKSOLVER(S, &sadt);
Chris@42:      slv->k = k;
Chris@42:      slv->desc = desc;
Chris@42:      slv->bufferedp = bufferedp;
Chris@42:      return &(slv->super);
Chris@42: }
Chris@42: 
Chris@42: solver *X(mksolver_rdft_r2c_direct)(kr2c k, const kr2c_desc *desc)
Chris@42: {
Chris@42:      return mksolver(k, desc, 0);
Chris@42: }
Chris@42: 
Chris@42: solver *X(mksolver_rdft_r2c_directbuf)(kr2c k, const kr2c_desc *desc)
Chris@42: {
Chris@42:      return mksolver(k, desc, 1);
Chris@42: }