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 vrank -infty RDFT2s (nothing to do), as well as in-place
Chris@42:    rank-0 HC2R.  Note that in-place rank-0 R2HC is *not* a no-op, because
Chris@42:    we have to set the imaginary parts of the output to zero. */
Chris@42: 
Chris@42: #include "rdft.h"
Chris@42: 
Chris@42: static void apply(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
Chris@42: {
Chris@42:      UNUSED(ego_);
Chris@42:      UNUSED(r0);
Chris@42:      UNUSED(r1);
Chris@42:      UNUSED(cr);
Chris@42:      UNUSED(ci);
Chris@42: }
Chris@42: 
Chris@42: static int applicable(const solver *ego_, const problem *p_)
Chris@42: {
Chris@42:      const problem_rdft2 *p = (const problem_rdft2 *) p_;
Chris@42:      UNUSED(ego_);
Chris@42: 
Chris@42:      return(0
Chris@42: 	    /* case 1 : -infty vector rank */
Chris@42: 	    || (p->vecsz->rnk == RNK_MINFTY)
Chris@42: 		 
Chris@42: 	    /* case 2 : rank-0 in-place rdft, except that
Chris@42: 	       R2HC is not a no-op because it sets the imaginary
Chris@42: 	       part to 0 */
Chris@42: 	    || (1
Chris@42: 		&& p->kind != R2HC
Chris@42: 		&& p->sz->rnk == 0
Chris@42: 		&& FINITE_RNK(p->vecsz->rnk)
Chris@42: 		&& (p->r0 == p->cr)
Chris@42: 		&& X(rdft2_inplace_strides)(p, RNK_MINFTY)
Chris@42: 		 ));
Chris@42: }
Chris@42: 
Chris@42: static void print(const plan *ego, printer *p)
Chris@42: {
Chris@42:      UNUSED(ego);
Chris@42:      p->print(p, "(rdft2-nop)");
Chris@42: }
Chris@42: 
Chris@42: static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
Chris@42: {
Chris@42:      static const plan_adt padt = {
Chris@42: 	  X(rdft2_solve), X(null_awake), print, X(plan_null_destroy)
Chris@42:      };
Chris@42:      plan_rdft2 *pln;
Chris@42: 
Chris@42:      UNUSED(plnr);
Chris@42: 
Chris@42:      if (!applicable(ego, p))
Chris@42:           return (plan *) 0;
Chris@42:      pln = MKPLAN_RDFT2(plan_rdft2, &padt, apply);
Chris@42:      X(ops_zero)(&pln->super.ops);
Chris@42: 
Chris@42:      return &(pln->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:      return MKSOLVER(solver, &sadt);
Chris@42: }
Chris@42: 
Chris@42: void X(rdft2_nop_register)(planner *p)
Chris@42: {
Chris@42:      REGISTER_SOLVER(p, mksolver());
Chris@42: }