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: #include "hc2hc.h"
Chris@42: 
Chris@42: hc2hc_solver *(*X(mksolver_hc2hc_hook))(size_t, INT, hc2hc_mkinferior) = 0;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_rdft super;
Chris@42:      plan *cld;
Chris@42:      plan *cldw;
Chris@42:      INT r;
Chris@42: } P;
Chris@42: 
Chris@42: static void apply_dit(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_rdft *cld;
Chris@42:      plan_hc2hc *cldw;
Chris@42: 
Chris@42:      cld = (plan_rdft *) ego->cld;
Chris@42:      cld->apply(ego->cld, I, O);
Chris@42: 
Chris@42:      cldw = (plan_hc2hc *) ego->cldw;
Chris@42:      cldw->apply(ego->cldw, O);
Chris@42: }
Chris@42: 
Chris@42: static void apply_dif(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_rdft *cld;
Chris@42:      plan_hc2hc *cldw;
Chris@42: 
Chris@42:      cldw = (plan_hc2hc *) ego->cldw;
Chris@42:      cldw->apply(ego->cldw, I);
Chris@42: 
Chris@42:      cld = (plan_rdft *) ego->cld;
Chris@42:      cld->apply(ego->cld, I, O);
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_awake)(ego->cld, wakefulness);
Chris@42:      X(plan_awake)(ego->cldw, wakefulness);
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      X(plan_destroy_internal)(ego->cldw);
Chris@42:      X(plan_destroy_internal)(ego->cld);
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:      p->print(p, "(rdft-ct-%s/%D%(%p%)%(%p%))",
Chris@42: 	      ego->super.apply == apply_dit ? "dit" : "dif",
Chris@42: 	      ego->r, ego->cldw, ego->cld);
Chris@42: }
Chris@42: 
Chris@42: static int applicable0(const hc2hc_solver *ego, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const problem_rdft *p = (const problem_rdft *) p_;
Chris@42:      INT r;
Chris@42: 
Chris@42:      return (1
Chris@42: 	     && p->sz->rnk == 1
Chris@42: 	     && p->vecsz->rnk <= 1 
Chris@42: 
Chris@42: 	     && (/* either the problem is R2HC, which is solved by DIT */
Chris@42: 		  (p->kind[0] == R2HC)
Chris@42: 		  ||
Chris@42: 		  /* or the problem is HC2R, in which case it is solved
Chris@42: 		     by DIF, which destroys the input */
Chris@42: 		  (p->kind[0] == HC2R && 
Chris@42: 		   (p->I == p->O || !NO_DESTROY_INPUTP(plnr))))
Chris@42: 		  
Chris@42: 	     && ((r = X(choose_radix)(ego->r, p->sz->dims[0].n)) > 0)
Chris@42: 	     && p->sz->dims[0].n > r);
Chris@42: }
Chris@42: 
Chris@42: int X(hc2hc_applicable)(const hc2hc_solver *ego, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const problem_rdft *p;
Chris@42: 
Chris@42:      if (!applicable0(ego, p_, plnr))
Chris@42:           return 0;
Chris@42: 
Chris@42:      p = (const problem_rdft *) p_;
Chris@42: 
Chris@42:      return (0
Chris@42: 	     || p->vecsz->rnk == 0
Chris@42: 	     || !NO_VRECURSEP(plnr)
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const hc2hc_solver *ego = (const hc2hc_solver *) ego_;
Chris@42:      const problem_rdft *p;
Chris@42:      P *pln = 0;
Chris@42:      plan *cld = 0, *cldw = 0;
Chris@42:      INT n, r, m, v, ivs, ovs;
Chris@42:      iodim *d;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      if (NO_NONTHREADEDP(plnr) || !X(hc2hc_applicable)(ego, p_, plnr))
Chris@42:           return (plan *) 0;
Chris@42: 
Chris@42:      p = (const problem_rdft *) p_;
Chris@42:      d = p->sz->dims;
Chris@42:      n = d[0].n;
Chris@42:      r = X(choose_radix)(ego->r, n);
Chris@42:      m = n / r;
Chris@42: 
Chris@42:      X(tensor_tornk1)(p->vecsz, &v, &ivs, &ovs);
Chris@42: 
Chris@42:      switch (p->kind[0]) {
Chris@42: 	 case R2HC:
Chris@42: 	      cldw = ego->mkcldw(ego, 
Chris@42: 				 R2HC, r, m, d[0].os, v, ovs, 0, (m+2)/2, 
Chris@42: 				 p->O, plnr);
Chris@42: 	      if (!cldw) goto nada;
Chris@42: 
Chris@42: 	      cld = X(mkplan_d)(plnr, 
Chris@42: 				X(mkproblem_rdft_d)(
Chris@42: 				     X(mktensor_1d)(m, r * d[0].is, d[0].os),
Chris@42: 				     X(mktensor_2d)(r, d[0].is, m * d[0].os,
Chris@42: 						    v, ivs, ovs),
Chris@42: 				     p->I, p->O, p->kind)
Chris@42: 		   );
Chris@42: 	      if (!cld) goto nada;
Chris@42: 
Chris@42: 	      pln = MKPLAN_RDFT(P, &padt, apply_dit);
Chris@42: 	      break;
Chris@42: 
Chris@42: 	 case HC2R:
Chris@42: 	      cldw = ego->mkcldw(ego,
Chris@42: 				 HC2R, r, m, d[0].is, v, ivs, 0, (m+2)/2, 
Chris@42: 				 p->I, plnr);
Chris@42: 	      if (!cldw) goto nada;
Chris@42: 
Chris@42: 	      cld = X(mkplan_d)(plnr, 
Chris@42: 				X(mkproblem_rdft_d)(
Chris@42: 				     X(mktensor_1d)(m, d[0].is, r * d[0].os),
Chris@42: 				     X(mktensor_2d)(r, m * d[0].is, d[0].os,
Chris@42: 						    v, ivs, ovs),
Chris@42: 				     p->I, p->O, p->kind)
Chris@42: 		   );
Chris@42: 	      if (!cld) goto nada;
Chris@42: 	      
Chris@42: 	      pln = MKPLAN_RDFT(P, &padt, apply_dif);
Chris@42: 	      break;
Chris@42: 
Chris@42: 	 default: 
Chris@42: 	      A(0);
Chris@42:      }
Chris@42: 
Chris@42:      pln->cld = cld;
Chris@42:      pln->cldw = cldw;
Chris@42:      pln->r = r;
Chris@42:      X(ops_add)(&cld->ops, &cldw->ops, &pln->super.super.ops);
Chris@42: 
Chris@42:      /* inherit could_prune_now_p attribute from cldw */
Chris@42:      pln->super.super.could_prune_now_p = cldw->could_prune_now_p;
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: 
Chris@42:  nada:
Chris@42:      X(plan_destroy_internal)(cldw);
Chris@42:      X(plan_destroy_internal)(cld);
Chris@42:      return (plan *) 0;
Chris@42: }
Chris@42: 
Chris@42: hc2hc_solver *X(mksolver_hc2hc)(size_t size, INT r, hc2hc_mkinferior mkcldw)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
Chris@42:      hc2hc_solver *slv = (hc2hc_solver *)X(mksolver)(size, &sadt);
Chris@42:      slv->r = r;
Chris@42:      slv->mkcldw = mkcldw;
Chris@42:      return slv;
Chris@42: }
Chris@42: 
Chris@42: plan *X(mkplan_hc2hc)(size_t size, const plan_adt *adt, hc2hcapply apply)
Chris@42: {
Chris@42:      plan_hc2hc *ego;
Chris@42: 
Chris@42:      ego = (plan_hc2hc *) X(mkplan)(size, adt);
Chris@42:      ego->apply = apply;
Chris@42: 
Chris@42:      return &(ego->super);
Chris@42: }