annotate src/fftw-3.3.3/rdft/nop.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 89f5e221ed7b
children
rev   line source
cannam@95 1 /*
cannam@95 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95 4 *
cannam@95 5 * This program is free software; you can redistribute it and/or modify
cannam@95 6 * it under the terms of the GNU General Public License as published by
cannam@95 7 * the Free Software Foundation; either version 2 of the License, or
cannam@95 8 * (at your option) any later version.
cannam@95 9 *
cannam@95 10 * This program is distributed in the hope that it will be useful,
cannam@95 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@95 13 * GNU General Public License for more details.
cannam@95 14 *
cannam@95 15 * You should have received a copy of the GNU General Public License
cannam@95 16 * along with this program; if not, write to the Free Software
cannam@95 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@95 18 *
cannam@95 19 */
cannam@95 20
cannam@95 21
cannam@95 22 /* plans for vrank -infty RDFTs (nothing to do) */
cannam@95 23
cannam@95 24 #include "rdft.h"
cannam@95 25
cannam@95 26 static void apply(const plan *ego_, R *I, R *O)
cannam@95 27 {
cannam@95 28 UNUSED(ego_);
cannam@95 29 UNUSED(I);
cannam@95 30 UNUSED(O);
cannam@95 31 }
cannam@95 32
cannam@95 33 static int applicable(const solver *ego_, const problem *p_)
cannam@95 34 {
cannam@95 35 const problem_rdft *p = (const problem_rdft *) p_;
cannam@95 36 UNUSED(ego_);
cannam@95 37 return 0
cannam@95 38 /* case 1 : -infty vector rank */
cannam@95 39 || (p->vecsz->rnk == RNK_MINFTY)
cannam@95 40
cannam@95 41 /* case 2 : rank-0 in-place rdft */
cannam@95 42 || (1
cannam@95 43 && p->sz->rnk == 0
cannam@95 44 && FINITE_RNK(p->vecsz->rnk)
cannam@95 45 && p->O == p->I
cannam@95 46 && X(tensor_inplace_strides)(p->vecsz)
cannam@95 47 );
cannam@95 48 }
cannam@95 49
cannam@95 50 static void print(const plan *ego, printer *p)
cannam@95 51 {
cannam@95 52 UNUSED(ego);
cannam@95 53 p->print(p, "(rdft-nop)");
cannam@95 54 }
cannam@95 55
cannam@95 56 static plan *mkplan(const solver *ego, const problem *p, planner *plnr)
cannam@95 57 {
cannam@95 58 static const plan_adt padt = {
cannam@95 59 X(rdft_solve), X(null_awake), print, X(plan_null_destroy)
cannam@95 60 };
cannam@95 61 plan_rdft *pln;
cannam@95 62
cannam@95 63 UNUSED(plnr);
cannam@95 64
cannam@95 65 if (!applicable(ego, p))
cannam@95 66 return (plan *) 0;
cannam@95 67 pln = MKPLAN_RDFT(plan_rdft, &padt, apply);
cannam@95 68 X(ops_zero)(&pln->super.ops);
cannam@95 69
cannam@95 70 return &(pln->super);
cannam@95 71 }
cannam@95 72
cannam@95 73 static solver *mksolver(void)
cannam@95 74 {
cannam@95 75 static const solver_adt sadt = { PROBLEM_RDFT, mkplan, 0 };
cannam@95 76 return MKSOLVER(solver, &sadt);
cannam@95 77 }
cannam@95 78
cannam@95 79 void X(rdft_nop_register)(planner *p)
cannam@95 80 {
cannam@95 81 REGISTER_SOLVER(p, mksolver());
cannam@95 82 }