cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: 
cannam@95: /* plans for vrank -infty RDFTs (nothing to do) */
cannam@95: 
cannam@95: #include "rdft.h"
cannam@95: 
cannam@95: static void apply(const plan *ego_, R *I, R *O)
cannam@95: {
cannam@95:      UNUSED(ego_);
cannam@95:      UNUSED(I);
cannam@95:      UNUSED(O);
cannam@95: }
cannam@95: 
cannam@95: static int applicable(const solver *ego_, const problem *p_)
cannam@95: {
cannam@95:      const problem_rdft *p = (const problem_rdft *) p_;
cannam@95:      UNUSED(ego_);
cannam@95:      return 0
cannam@95: 	  /* case 1 : -infty vector rank */
cannam@95: 	  || (p->vecsz->rnk == RNK_MINFTY)
cannam@95: 
cannam@95: 	  /* case 2 : rank-0 in-place rdft */
cannam@95: 	  || (1
cannam@95: 	      && p->sz->rnk == 0
cannam@95: 	      && FINITE_RNK(p->vecsz->rnk)
cannam@95: 	      && p->O == p->I
cannam@95: 	      && X(tensor_inplace_strides)(p->vecsz)
cannam@95: 	       );
cannam@95: }
cannam@95: 
cannam@95: static void print(const plan *ego, printer *p)
cannam@95: {
cannam@95:      UNUSED(ego);
cannam@95:      p->print(p, "(rdft-nop)");
cannam@95: }
cannam@95: 
cannam@95: static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
cannam@95: {
cannam@95:      static const plan_adt padt = {
cannam@95: 	  X(rdft_solve), X(null_awake), print, X(plan_null_destroy)
cannam@95:      };
cannam@95:      plan_rdft *pln;
cannam@95: 
cannam@95:      UNUSED(plnr);
cannam@95: 
cannam@95:      if (!applicable(ego, p))
cannam@95:           return (plan *) 0;
cannam@95:      pln = MKPLAN_RDFT(plan_rdft, &padt, apply);
cannam@95:      X(ops_zero)(&pln->super.ops);
cannam@95: 
cannam@95:      return &(pln->super);
cannam@95: }
cannam@95: 
cannam@95: static solver *mksolver(void)
cannam@95: {
cannam@95:      static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
cannam@95:      return MKSOLVER(solver, &sadt);
cannam@95: }
cannam@95: 
cannam@95: void X(rdft_nop_register)(planner *p)
cannam@95: {
cannam@95:      REGISTER_SOLVER(p, mksolver());
cannam@95: }