*** empty log message ***

1 files changed, 0 insertions, 86 deletions

diff --git a/src/fftw3/rdft/rnop.c b/src/fftw3/rdft/rnop.c
deleted file mode 100644
index e784a5a..0000000
--- a/src/fftw3/rdft/rnop.c
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright (c) 2003 Matteo Frigo
- * Copyright (c) 2003 Massachusetts Institute of Technology
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- *
- */
-
-/* $Id: rnop.c,v 1.1 2008/10/17 06:11:29 scuri Exp $ */
-
-/* plans for vrank -infty RDFTs (nothing to do) */
-
-#include "rdft.h"
-
-static void apply(const plan *ego_, R *I, R *O)
-{
-     UNUSED(ego_);
-     UNUSED(I);
-     UNUSED(O);
-}
-
-static int applicable(const solver *ego_, const problem *p_)
-{
-     UNUSED(ego_);
-     if (RDFTP(p_)) {
-          const problem_rdft *p = (const problem_rdft *) p_;
-          return 0
-	       /* case 1 : -infty vector rank */
-	       || (p->vecsz->rnk == RNK_MINFTY)
-
-	       /* case 2 : rank-0 in-place rdft */
-	       || (1
-		   && p->sz->rnk == 0
-		   && FINITE_RNK(p->vecsz->rnk)
-		   && p->O == p->I
-		   && X(tensor_inplace_strides)(p->vecsz)
-                    );
-     }
-     return 0;
-}
-
-static void print(const plan *ego, printer *p)
-{
-     UNUSED(ego);
-     p->print(p, "(rdft-nop)");
-}
-
-static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
-{
-     static const plan_adt padt = {
-	  X(rdft_solve), X(null_awake), print, X(plan_null_destroy)
-     };
-     plan_rdft *pln;
-
-     UNUSED(plnr);
-
-     if (!applicable(ego, p))
-          return (plan *) 0;
-     pln = MKPLAN_RDFT(plan_rdft, &padt, apply);
-     X(ops_zero)(&pln->super.ops);
-
-     return &(pln->super);
-}
-
-static solver *mksolver(void)
-{
-     static const solver_adt sadt = { mkplan };
-     return MKSOLVER(solver, &sadt);
-}
-
-void X(rdft_nop_register)(planner *p)
-{
-     REGISTER_SOLVER(p, mksolver());
-}