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: /* plans for rank-0 RDFT2 (copy operations, plus setting 0 imag. parts) */
Chris@42: 
Chris@42: #include "rdft.h"
Chris@42: 
Chris@42: #ifdef HAVE_STRING_H
Chris@42: #include <string.h>		/* for memcpy() */
Chris@42: #endif
Chris@42: 
Chris@42: typedef struct {
Chris@42:      solver super;
Chris@42: } S;
Chris@42: 
Chris@42: typedef struct {
Chris@42:      plan_rdft super;
Chris@42:      INT vl;
Chris@42:      INT ivs, ovs;
Chris@42:      plan *cldcpy;
Chris@42: } P;
Chris@42: 
Chris@42: static int applicable(const problem *p_)
Chris@42: {
Chris@42:      const problem_rdft2 *p = (const problem_rdft2 *) p_;
Chris@42:      return (1
Chris@42: 	     && p->sz->rnk == 0
Chris@42: 	     && (p->kind == HC2R
Chris@42: 		 ||
Chris@42: 		 (1
Chris@42: 		  && p->kind == R2HC
Chris@42: 		
Chris@42: 		  && p->vecsz->rnk <= 1
Chris@42:   
Chris@42: 		  && ((p->r0 != p->cr) 
Chris@42: 		      || 
Chris@42: 		      X(rdft2_inplace_strides)(p, RNK_MINFTY)) ))
Chris@42: 	  );
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;
Chris@42:      INT ivs = ego->ivs, ovs = ego->ovs;
Chris@42: 
Chris@42:      UNUSED(r1); /* rank-0 has no real odd-index elements */
Chris@42: 
Chris@42:      for (i = 4; i <= vl; i += 4) {
Chris@42:           R x0, x1, x2, x3;
Chris@42:           x0 = *r0; r0 += ivs;
Chris@42:           x1 = *r0; r0 += ivs;
Chris@42:           x2 = *r0; r0 += ivs;
Chris@42:           x3 = *r0; r0 += ivs;
Chris@42:           *cr = x0; cr += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42:           *cr = x1; cr += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42:           *cr = x2; cr += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42: 	  *cr = x3; cr += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42:      }
Chris@42:      for (; i < vl + 4; ++i) {
Chris@42:           R x0;
Chris@42:           x0 = *r0; r0 += ivs;
Chris@42:           *cr = x0; cr += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: /* in-place r2hc rank-0: set imaginary parts of output to 0 */
Chris@42: static void apply_r2hc_inplace(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;
Chris@42:      INT ovs = ego->ovs;
Chris@42: 
Chris@42:      UNUSED(r0); UNUSED(r1); UNUSED(cr);
Chris@42: 
Chris@42:      for (i = 4; i <= vl; i += 4) {
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42:      }
Chris@42:      for (; i < vl + 4; ++i) {
Chris@42: 	  *ci = K(0.0); ci += ovs;
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: /* a rank-0 HC2R rdft2 problem is just a copy from cr to r0,
Chris@42:    so we can use a rank-0 rdft plan */
Chris@42: static void apply_hc2r(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      plan_rdft *cldcpy = (plan_rdft *) ego->cldcpy;
Chris@42:      UNUSED(ci);
Chris@42:      UNUSED(r1);
Chris@42:      cldcpy->apply((plan *) cldcpy, cr, r0);
Chris@42: }
Chris@42: 
Chris@42: static void awake(plan *ego_, enum wakefulness wakefulness)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      if (ego->cldcpy)
Chris@42: 	  X(plan_awake)(ego->cldcpy, wakefulness);
Chris@42: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
Chris@42:      if (ego->cldcpy)
Chris@42: 	  X(plan_destroy_internal)(ego->cldcpy);
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:      if (ego->cldcpy)
Chris@42: 	  p->print(p, "(rdft2-hc2r-rank0%(%p%))", ego->cldcpy);
Chris@42:      else
Chris@42: 	  p->print(p, "(rdft2-r2hc-rank0%v)", ego->vl);
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      const problem_rdft2 *p;
Chris@42:      plan *cldcpy = (plan *) 0;
Chris@42:      P *pln;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft2_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      UNUSED(ego_);
Chris@42: 
Chris@42:      if (!applicable(p_))
Chris@42:           return (plan *) 0;
Chris@42: 
Chris@42:      p = (const problem_rdft2 *) p_;
Chris@42: 
Chris@42:      if (p->kind == HC2R) {
Chris@42: 	  cldcpy = X(mkplan_d)(plnr,
Chris@42: 			       X(mkproblem_rdft_0_d)(
Chris@42: 				    X(tensor_copy)(p->vecsz),
Chris@42: 				    p->cr, p->r0));
Chris@42: 	  if (!cldcpy) return (plan *) 0;
Chris@42:      }
Chris@42: 
Chris@42:      pln = MKPLAN_RDFT2(P, &padt, 
Chris@42: 			p->kind == R2HC ? 
Chris@42: 			(p->r0 == p->cr ? apply_r2hc_inplace : apply_r2hc) 
Chris@42: 			: apply_hc2r);
Chris@42:      
Chris@42:      if (p->kind == R2HC)
Chris@42: 	  X(tensor_tornk1)(p->vecsz, &pln->vl, &pln->ivs, &pln->ovs);
Chris@42:      pln->cldcpy = cldcpy;
Chris@42: 
Chris@42:      if (p->kind == R2HC) {
Chris@42: 	  /* vl loads, 2*vl stores */
Chris@42: 	  X(ops_other)(3 * pln->vl, &pln->super.super.ops);
Chris@42:      }
Chris@42:      else {
Chris@42: 	  pln->super.super.ops = cldcpy->ops;
Chris@42:      }
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: }
Chris@42: 
Chris@42: static solver *mksolver(void)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_RDFT2, mkplan, 0 };
Chris@42:      S *slv = MKSOLVER(S, &sadt);
Chris@42:      return &(slv->super);
Chris@42: }
Chris@42: 
Chris@42: void X(rdft2_rank0_register)(planner *p)
Chris@42: {
Chris@42:      REGISTER_SOLVER(p, mksolver());
Chris@42: }