cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: 
cannam@167: /* plans for vrank -infty RDFT2s (nothing to do), as well as in-place
cannam@167:    rank-0 HC2R.  Note that in-place rank-0 R2HC is *not* a no-op, because
cannam@167:    we have to set the imaginary parts of the output to zero. */
cannam@167: 
cannam@167: #include "rdft/rdft.h"
cannam@167: 
cannam@167: static void apply(const plan *ego_, R *r0, R *r1, R *cr, R *ci)
cannam@167: {
cannam@167:      UNUSED(ego_);
cannam@167:      UNUSED(r0);
cannam@167:      UNUSED(r1);
cannam@167:      UNUSED(cr);
cannam@167:      UNUSED(ci);
cannam@167: }
cannam@167: 
cannam@167: static int applicable(const solver *ego_, const problem *p_)
cannam@167: {
cannam@167:      const problem_rdft2 *p = (const problem_rdft2 *) p_;
cannam@167:      UNUSED(ego_);
cannam@167: 
cannam@167:      return(0
cannam@167: 	    /* case 1 : -infty vector rank */
cannam@167: 	    || (p->vecsz->rnk == RNK_MINFTY)
cannam@167: 		 
cannam@167: 	    /* case 2 : rank-0 in-place rdft, except that
cannam@167: 	       R2HC is not a no-op because it sets the imaginary
cannam@167: 	       part to 0 */
cannam@167: 	    || (1
cannam@167: 		&& p->kind != R2HC
cannam@167: 		&& p->sz->rnk == 0
cannam@167: 		&& FINITE_RNK(p->vecsz->rnk)
cannam@167: 		&& (p->r0 == p->cr)
cannam@167: 		&& X(rdft2_inplace_strides)(p, RNK_MINFTY)
cannam@167: 		 ));
cannam@167: }
cannam@167: 
cannam@167: static void print(const plan *ego, printer *p)
cannam@167: {
cannam@167:      UNUSED(ego);
cannam@167:      p->print(p, "(rdft2-nop)");
cannam@167: }
cannam@167: 
cannam@167: static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
cannam@167: {
cannam@167:      static const plan_adt padt = {
cannam@167: 	  X(rdft2_solve), X(null_awake), print, X(plan_null_destroy)
cannam@167:      };
cannam@167:      plan_rdft2 *pln;
cannam@167: 
cannam@167:      UNUSED(plnr);
cannam@167: 
cannam@167:      if (!applicable(ego, p))
cannam@167:           return (plan *) 0;
cannam@167:      pln = MKPLAN_RDFT2(plan_rdft2, &padt, apply);
cannam@167:      X(ops_zero)(&pln->super.ops);
cannam@167: 
cannam@167:      return &(pln->super);
cannam@167: }
cannam@167: 
cannam@167: static solver *mksolver(void)
cannam@167: {
cannam@167:      static const solver_adt sadt = { PROBLEM_RDFT2, mkplan, 0 };
cannam@167:      return MKSOLVER(solver, &sadt);
cannam@167: }
cannam@167: 
cannam@167: void X(rdft2_nop_register)(planner *p)
cannam@167: {
cannam@167:      REGISTER_SOLVER(p, mksolver());
cannam@167: }