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