annotate src/fftw-3.3.3/rdft/nop.c @ 23:619f715526df sv_v2.1

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