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: /* Solve a DHT problem (Discrete Hartley Transform) via post-processing
Chris@42:    of an R2HC problem. */
Chris@42: 
Chris@42: #include "rdft.h"
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:      plan *cld;
Chris@42:      INT os;
Chris@42:      INT n;
Chris@42: } P;
Chris@42: 
Chris@42: static void apply(const plan *ego_, R *I, R *O)
Chris@42: {
Chris@42:      const P *ego = (const P *) ego_;
Chris@42:      INT os = ego->os;
Chris@42:      INT i, n = ego->n;
Chris@42: 
Chris@42:      {
Chris@42: 	  plan_rdft *cld = (plan_rdft *) ego->cld;
Chris@42: 	  cld->apply((plan *) cld, I, O);
Chris@42:      }
Chris@42: 
Chris@42:      for (i = 1; i < n - i; ++i) {
Chris@42: 	  E a, b;
Chris@42: 	  a = O[os * i];
Chris@42: 	  b = O[os * (n - i)];
Chris@42: #if FFT_SIGN == -1
Chris@42: 	  O[os * i] = a - b;
Chris@42: 	  O[os * (n - i)] = a + b;
Chris@42: #else
Chris@42: 	  O[os * i] = a + b;
Chris@42: 	  O[os * (n - i)] = a - b;
Chris@42: #endif
Chris@42:      }
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: }
Chris@42: 
Chris@42: static void destroy(plan *ego_)
Chris@42: {
Chris@42:      P *ego = (P *) ego_;
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, "(dht-r2hc-%D%(%p%))", ego->n, ego->cld);
Chris@42: }
Chris@42: 
Chris@42: static int applicable0(const problem *p_, const planner *plnr)
Chris@42: {
Chris@42:      const problem_rdft *p = (const problem_rdft *) p_;
Chris@42:      return (1
Chris@42: 	     && !NO_DHT_R2HCP(plnr)
Chris@42: 	     && p->sz->rnk == 1
Chris@42: 	     && p->vecsz->rnk == 0
Chris@42: 	     && p->kind[0] == DHT
Chris@42: 	  );
Chris@42: }
Chris@42: 
Chris@42: static int applicable(const solver *ego, const problem *p, const planner *plnr)
Chris@42: {
Chris@42:      UNUSED(ego);
Chris@42:      return (!NO_SLOWP(plnr) && applicable0(p, plnr));
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego_, const problem *p_, planner *plnr)
Chris@42: {
Chris@42:      P *pln;
Chris@42:      const problem_rdft *p;
Chris@42:      plan *cld;
Chris@42: 
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft_solve), awake, print, destroy
Chris@42:      };
Chris@42: 
Chris@42:      if (!applicable(ego_, p_, plnr))
Chris@42:           return (plan *)0;
Chris@42: 
Chris@42:      p = (const problem_rdft *) p_;
Chris@42: 
Chris@42:      /* NO_DHT_R2HC stops infinite loops with rdft-dht.c */
Chris@42:      cld = X(mkplan_f_d)(plnr, 
Chris@42: 			 X(mkproblem_rdft_1)(p->sz, p->vecsz, 
Chris@42: 					     p->I, p->O, R2HC),
Chris@42: 			 NO_DHT_R2HC, 0, 0);
Chris@42:      if (!cld) return (plan *)0;
Chris@42: 
Chris@42:      pln = MKPLAN_RDFT(P, &padt, apply);
Chris@42: 
Chris@42:      pln->n = p->sz->dims[0].n;
Chris@42:      pln->os = p->sz->dims[0].os;
Chris@42:      pln->cld = cld;
Chris@42:      
Chris@42:      pln->super.super.ops = cld->ops;
Chris@42:      pln->super.super.ops.other += 4 * ((pln->n - 1)/2);
Chris@42:      pln->super.super.ops.add += 2 * ((pln->n - 1)/2);
Chris@42: 
Chris@42:      return &(pln->super.super);
Chris@42: }
Chris@42: 
Chris@42: /* constructor */
Chris@42: static solver *mksolver(void)
Chris@42: {
Chris@42:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
Chris@42:      S *slv = MKSOLVER(S, &sadt);
Chris@42:      return &(slv->super);
Chris@42: }
Chris@42: 
Chris@42: void X(dht_r2hc_register)(planner *p)
Chris@42: {
Chris@42:      REGISTER_SOLVER(p, mksolver());
Chris@42: }