annotate src/fftw-3.3.3/kernel/rader.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 #include "ifftw.h"
Chris@10 22
Chris@10 23 /*
Chris@10 24 common routines for Rader solvers
Chris@10 25 */
Chris@10 26
Chris@10 27
Chris@10 28 /* shared twiddle and omega lists, keyed by two/three integers. */
Chris@10 29 struct rader_tls {
Chris@10 30 INT k1, k2, k3;
Chris@10 31 R *W;
Chris@10 32 int refcnt;
Chris@10 33 rader_tl *cdr;
Chris@10 34 };
Chris@10 35
Chris@10 36 void X(rader_tl_insert)(INT k1, INT k2, INT k3, R *W, rader_tl **tl)
Chris@10 37 {
Chris@10 38 rader_tl *t = (rader_tl *) MALLOC(sizeof(rader_tl), TWIDDLES);
Chris@10 39 t->k1 = k1; t->k2 = k2; t->k3 = k3; t->W = W;
Chris@10 40 t->refcnt = 1; t->cdr = *tl; *tl = t;
Chris@10 41 }
Chris@10 42
Chris@10 43 R *X(rader_tl_find)(INT k1, INT k2, INT k3, rader_tl *t)
Chris@10 44 {
Chris@10 45 while (t && (t->k1 != k1 || t->k2 != k2 || t->k3 != k3))
Chris@10 46 t = t->cdr;
Chris@10 47 if (t) {
Chris@10 48 ++t->refcnt;
Chris@10 49 return t->W;
Chris@10 50 } else
Chris@10 51 return 0;
Chris@10 52 }
Chris@10 53
Chris@10 54 void X(rader_tl_delete)(R *W, rader_tl **tl)
Chris@10 55 {
Chris@10 56 if (W) {
Chris@10 57 rader_tl **tp, *t;
Chris@10 58
Chris@10 59 for (tp = tl; (t = *tp) && t->W != W; tp = &t->cdr)
Chris@10 60 ;
Chris@10 61
Chris@10 62 if (t && --t->refcnt <= 0) {
Chris@10 63 *tp = t->cdr;
Chris@10 64 X(ifree)(t->W);
Chris@10 65 X(ifree)(t);
Chris@10 66 }
Chris@10 67 }
Chris@10 68 }