cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: 
cannam@95: #include "ct.h"
cannam@95: 
cannam@95: typedef struct {
cannam@95:      ct_solver super;
cannam@95:      const ct_desc *desc;
cannam@95:      int bufferedp;
cannam@95:      kdftw k;
cannam@95: } S;
cannam@95: 
cannam@95: typedef struct {
cannam@95:      plan_dftw super;
cannam@95:      kdftw k;
cannam@95:      INT r;
cannam@95:      stride rs;
cannam@95:      INT m, ms, v, vs, mb, me, extra_iter;
cannam@95:      stride brs;
cannam@95:      twid *td;
cannam@95:      const S *slv;
cannam@95: } P;
cannam@95: 
cannam@95: 
cannam@95: /*************************************************************
cannam@95:   Nonbuffered code
cannam@95:  *************************************************************/
cannam@95: static void apply(const plan *ego_, R *rio, R *iio)
cannam@95: {
cannam@95:      const P *ego = (const P *) ego_;
cannam@95:      INT i;
cannam@95:      ASSERT_ALIGNED_DOUBLE;
cannam@95:      for (i = 0; i < ego->v; ++i, rio += ego->vs, iio += ego->vs) {
cannam@95: 	  INT  mb = ego->mb, ms = ego->ms;
cannam@95: 	  ego->k(rio + mb*ms, iio + mb*ms, ego->td->W, 
cannam@95: 		 ego->rs, mb, ego->me, ms);
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: static void apply_extra_iter(const plan *ego_, R *rio, R *iio)
cannam@95: {
cannam@95:      const P *ego = (const P *) ego_;
cannam@95:      INT i, v = ego->v, vs = ego->vs;
cannam@95:      INT mb = ego->mb, me = ego->me, mm = me - 1, ms = ego->ms;
cannam@95:      ASSERT_ALIGNED_DOUBLE;
cannam@95:      for (i = 0; i < v; ++i, rio += vs, iio += vs) {
cannam@95: 	  ego->k(rio + mb*ms, iio + mb*ms, ego->td->W, 
cannam@95: 		 ego->rs, mb, mm, ms);
cannam@95: 	  ego->k(rio + mm*ms, iio + mm*ms, ego->td->W, 
cannam@95: 		 ego->rs, mm, mm+2, 0);
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: /*************************************************************
cannam@95:   Buffered code
cannam@95:  *************************************************************/
cannam@95: static void dobatch(const P *ego, R *rA, R *iA, INT mb, INT me, R *buf)
cannam@95: {
cannam@95:      INT brs = WS(ego->brs, 1);
cannam@95:      INT rs = WS(ego->rs, 1);
cannam@95:      INT ms = ego->ms;
cannam@95: 
cannam@95:      X(cpy2d_pair_ci)(rA + mb*ms, iA + mb*ms, buf, buf + 1,
cannam@95: 		      ego->r, rs, brs,
cannam@95: 		      me - mb, ms, 2);
cannam@95:      ego->k(buf, buf + 1, ego->td->W, ego->brs, mb, me, 2);
cannam@95:      X(cpy2d_pair_co)(buf, buf + 1, rA + mb*ms, iA + mb*ms,
cannam@95: 		      ego->r, brs, rs,
cannam@95: 		      me - mb, 2, ms);
cannam@95: }
cannam@95: 
cannam@95: /* must be even for SIMD alignment; should not be 2^k to avoid
cannam@95:    associativity conflicts */
cannam@95: static INT compute_batchsize(INT radix)
cannam@95: {
cannam@95:      /* round up to multiple of 4 */
cannam@95:      radix += 3;
cannam@95:      radix &= -4;
cannam@95: 
cannam@95:      return (radix + 2);
cannam@95: }
cannam@95: 
cannam@95: static void apply_buf(const plan *ego_, R *rio, R *iio)
cannam@95: {
cannam@95:      const P *ego = (const P *) ego_;
cannam@95:      INT i, j, v = ego->v, r = ego->r;
cannam@95:      INT batchsz = compute_batchsize(r);
cannam@95:      R *buf;
cannam@95:      INT mb = ego->mb, me = ego->me;
cannam@95:      size_t bufsz = r * batchsz * 2 * sizeof(R);
cannam@95: 
cannam@95:      BUF_ALLOC(R *, buf, bufsz);
cannam@95: 
cannam@95:      for (i = 0; i < v; ++i, rio += ego->vs, iio += ego->vs) {
cannam@95: 	  for (j = mb; j + batchsz < me; j += batchsz) 
cannam@95: 	       dobatch(ego, rio, iio, j, j + batchsz, buf);
cannam@95: 
cannam@95: 	  dobatch(ego, rio, iio, j, me, buf);
cannam@95:      }
cannam@95: 
cannam@95:      BUF_FREE(buf, bufsz);
cannam@95: }
cannam@95: 
cannam@95: /*************************************************************
cannam@95:   common code
cannam@95:  *************************************************************/
cannam@95: static void awake(plan *ego_, enum wakefulness wakefulness)
cannam@95: {
cannam@95:      P *ego = (P *) ego_;
cannam@95: 
cannam@95:      X(twiddle_awake)(wakefulness, &ego->td, ego->slv->desc->tw,
cannam@95: 		      ego->r * ego->m, ego->r, ego->m + ego->extra_iter);
cannam@95: }
cannam@95: 
cannam@95: static void destroy(plan *ego_)
cannam@95: {
cannam@95:      P *ego = (P *) ego_;
cannam@95:      X(stride_destroy)(ego->brs);
cannam@95:      X(stride_destroy)(ego->rs);
cannam@95: }
cannam@95: 
cannam@95: static void print(const plan *ego_, printer *p)
cannam@95: {
cannam@95:      const P *ego = (const P *) ego_;
cannam@95:      const S *slv = ego->slv;
cannam@95:      const ct_desc *e = slv->desc;
cannam@95: 
cannam@95:      if (slv->bufferedp)
cannam@95: 	  p->print(p, "(dftw-directbuf/%D-%D/%D%v \"%s\")",
cannam@95: 		   compute_batchsize(ego->r), ego->r,
cannam@95: 		   X(twiddle_length)(ego->r, e->tw), ego->v, e->nam);
cannam@95:      else
cannam@95: 	  p->print(p, "(dftw-direct-%D/%D%v \"%s\")",
cannam@95: 		   ego->r, X(twiddle_length)(ego->r, e->tw), ego->v, e->nam);
cannam@95: }
cannam@95: 
cannam@95: static int applicable0(const S *ego,
cannam@95: 		       INT r, INT irs, INT ors,
cannam@95: 		       INT m, INT ms,
cannam@95: 		       INT v, INT ivs, INT ovs,
cannam@95: 		       INT mb, INT me,
cannam@95: 		       R *rio, R *iio,
cannam@95: 		       const planner *plnr, INT *extra_iter)
cannam@95: {
cannam@95:      const ct_desc *e = ego->desc;
cannam@95:      UNUSED(v);
cannam@95: 
cannam@95:      return (
cannam@95: 	  1
cannam@95: 	  && r == e->radix
cannam@95: 	  && irs == ors /* in-place along R */
cannam@95: 	  && ivs == ovs /* in-place along V */
cannam@95: 
cannam@95: 	  /* check for alignment/vector length restrictions */
cannam@95: 	  && ((*extra_iter = 0,
cannam@95: 	       e->genus->okp(e, rio, iio, irs, ivs, m, mb, me, ms, plnr))
cannam@95: 	      ||
cannam@95: 	      (*extra_iter = 1,
cannam@95: 	       (1
cannam@95: 		/* FIXME: require full array, otherwise some threads
cannam@95: 		   may be extra_iter and other threads won't be.
cannam@95: 		   Generating the proper twiddle factors is a pain in
cannam@95: 		   this case */
cannam@95: 		&& mb == 0 && me == m
cannam@95: 		&& e->genus->okp(e, rio, iio, irs, ivs,
cannam@95: 				 m, mb, me - 1, ms, plnr)
cannam@95: 		&& e->genus->okp(e, rio, iio, irs, ivs,
cannam@95: 				 m, me - 1, me + 1, ms, plnr))))
cannam@95: 
cannam@95: 	  && (e->genus->okp(e, rio + ivs, iio + ivs, irs, ivs,
cannam@95: 			    m, mb, me - *extra_iter, ms, plnr))
cannam@95: 
cannam@95: 	  );
cannam@95: }
cannam@95: 
cannam@95: static int applicable0_buf(const S *ego,
cannam@95: 			   INT r, INT irs, INT ors,
cannam@95: 			   INT m, INT ms,
cannam@95: 			   INT v, INT ivs, INT ovs,
cannam@95: 			   INT mb, INT me,
cannam@95: 			   R *rio, R *iio,
cannam@95: 			   const planner *plnr)
cannam@95: {
cannam@95:      const ct_desc *e = ego->desc;
cannam@95:      INT batchsz;
cannam@95:      UNUSED(v); UNUSED(ms); UNUSED(rio); UNUSED(iio);
cannam@95: 
cannam@95:      return (
cannam@95: 	  1
cannam@95: 	  && r == e->radix
cannam@95: 	  && irs == ors /* in-place along R */
cannam@95: 	  && ivs == ovs /* in-place along V */
cannam@95: 
cannam@95: 	  /* check for alignment/vector length restrictions, both for
cannam@95: 	     batchsize and for the remainder */
cannam@95: 	  && (batchsz = compute_batchsize(r), 1)
cannam@95: 	  && (e->genus->okp(e, 0, ((const R *)0) + 1, 2 * batchsz, 0,
cannam@95: 			    m, mb, mb + batchsz, 2, plnr))
cannam@95: 	  && (e->genus->okp(e, 0, ((const R *)0) + 1, 2 * batchsz, 0,
cannam@95: 			    m, mb, me, 2, plnr))
cannam@95: 	  );
cannam@95: }
cannam@95: 
cannam@95: static int applicable(const S *ego,
cannam@95: 		      INT r, INT irs, INT ors,
cannam@95: 		      INT m, INT ms,
cannam@95: 		      INT v, INT ivs, INT ovs,
cannam@95: 		      INT mb, INT me,
cannam@95: 		      R *rio, R *iio,
cannam@95: 		      const planner *plnr, INT *extra_iter)
cannam@95: {
cannam@95:      if (ego->bufferedp) {
cannam@95: 	  *extra_iter = 0;
cannam@95: 	  if (!applicable0_buf(ego,
cannam@95: 			       r, irs, ors, m, ms, v, ivs, ovs, mb, me,
cannam@95: 			       rio, iio, plnr))
cannam@95: 	       return 0;
cannam@95:      } else {
cannam@95: 	  if (!applicable0(ego,
cannam@95: 			   r, irs, ors, m, ms, v, ivs, ovs, mb, me,
cannam@95: 			   rio, iio, plnr, extra_iter))
cannam@95: 	       return 0;
cannam@95:      }
cannam@95: 
cannam@95:      if (NO_UGLYP(plnr) && X(ct_uglyp)((ego->bufferedp? (INT)512 : (INT)16),
cannam@95: 				       v, m * r, r))
cannam@95: 	  return 0;
cannam@95: 
cannam@95:      if (m * r > 262144 && NO_FIXED_RADIX_LARGE_NP(plnr))
cannam@95: 	  return 0;
cannam@95: 
cannam@95:      return 1;
cannam@95: }
cannam@95: 
cannam@95: static plan *mkcldw(const ct_solver *ego_,
cannam@95: 		    INT r, INT irs, INT ors,
cannam@95: 		    INT m, INT ms,
cannam@95: 		    INT v, INT ivs, INT ovs,
cannam@95: 		    INT mstart, INT mcount,
cannam@95: 		    R *rio, R *iio,
cannam@95: 		    planner *plnr)
cannam@95: {
cannam@95:      const S *ego = (const S *) ego_;
cannam@95:      P *pln;
cannam@95:      const ct_desc *e = ego->desc;
cannam@95:      INT extra_iter;
cannam@95: 
cannam@95:      static const plan_adt padt = {
cannam@95: 	  0, awake, print, destroy
cannam@95:      };
cannam@95: 
cannam@95:      A(mstart >= 0 && mstart + mcount <= m);
cannam@95:      if (!applicable(ego,
cannam@95: 		     r, irs, ors, m, ms, v, ivs, ovs, mstart, mstart + mcount,
cannam@95: 		     rio, iio, plnr, &extra_iter))
cannam@95:           return (plan *)0;
cannam@95: 
cannam@95:      if (ego->bufferedp) {
cannam@95: 	  pln = MKPLAN_DFTW(P, &padt, apply_buf);
cannam@95:      } else {
cannam@95: 	  pln = MKPLAN_DFTW(P, &padt, extra_iter ? apply_extra_iter : apply);
cannam@95:      }
cannam@95: 
cannam@95:      pln->k = ego->k;
cannam@95:      pln->rs = X(mkstride)(r, irs);
cannam@95:      pln->td = 0;
cannam@95:      pln->r = r;
cannam@95:      pln->m = m;
cannam@95:      pln->ms = ms;
cannam@95:      pln->v = v;
cannam@95:      pln->vs = ivs;
cannam@95:      pln->mb = mstart;
cannam@95:      pln->me = mstart + mcount;
cannam@95:      pln->slv = ego;
cannam@95:      pln->brs = X(mkstride)(r, 2 * compute_batchsize(r));
cannam@95:      pln->extra_iter = extra_iter;
cannam@95: 
cannam@95:      X(ops_zero)(&pln->super.super.ops);
cannam@95:      X(ops_madd2)(v * (mcount/e->genus->vl), &e->ops, &pln->super.super.ops);
cannam@95: 
cannam@95:      if (ego->bufferedp) {
cannam@95: 	  /* 8 load/stores * N * V */
cannam@95: 	  pln->super.super.ops.other += 8 * r * mcount * v;
cannam@95:      }
cannam@95: 
cannam@95:      pln->super.super.could_prune_now_p =
cannam@95: 	  (!ego->bufferedp && r >= 5 && r < 64 && m >= r);
cannam@95:      return &(pln->super.super);
cannam@95: }
cannam@95: 
cannam@95: static void regone(planner *plnr, kdftw codelet,
cannam@95: 		   const ct_desc *desc, int dec, int bufferedp)
cannam@95: {
cannam@95:      S *slv = (S *)X(mksolver_ct)(sizeof(S), desc->radix, dec, mkcldw, 0);
cannam@95:      slv->k = codelet;
cannam@95:      slv->desc = desc;
cannam@95:      slv->bufferedp = bufferedp;
cannam@95:      REGISTER_SOLVER(plnr, &(slv->super.super));
cannam@95:      if (X(mksolver_ct_hook)) {
cannam@95: 	  slv = (S *)X(mksolver_ct_hook)(sizeof(S), desc->radix,
cannam@95: 					 dec, mkcldw, 0);
cannam@95: 	  slv->k = codelet;
cannam@95: 	  slv->desc = desc;
cannam@95: 	  slv->bufferedp = bufferedp;
cannam@95: 	  REGISTER_SOLVER(plnr, &(slv->super.super));
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: void X(regsolver_ct_directw)(planner *plnr, kdftw codelet,
cannam@95: 			     const ct_desc *desc, int dec)
cannam@95: {
cannam@95:      regone(plnr, codelet, desc, dec, /* bufferedp */ 0);
cannam@95:      regone(plnr, codelet, desc, dec, /* bufferedp */ 1);
cannam@95: }