annotate fft/fftw/fftw-3.3.4/kernel/rader.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 #include "ifftw.h"
Chris@19 22
Chris@19 23 /*
Chris@19 24 common routines for Rader solvers
Chris@19 25 */
Chris@19 26
Chris@19 27
Chris@19 28 /* shared twiddle and omega lists, keyed by two/three integers. */
Chris@19 29 struct rader_tls {
Chris@19 30 INT k1, k2, k3;
Chris@19 31 R *W;
Chris@19 32 int refcnt;
Chris@19 33 rader_tl *cdr;
Chris@19 34 };
Chris@19 35
Chris@19 36 void X(rader_tl_insert)(INT k1, INT k2, INT k3, R *W, rader_tl **tl)
Chris@19 37 {
Chris@19 38 rader_tl *t = (rader_tl *) MALLOC(sizeof(rader_tl), TWIDDLES);
Chris@19 39 t->k1 = k1; t->k2 = k2; t->k3 = k3; t->W = W;
Chris@19 40 t->refcnt = 1; t->cdr = *tl; *tl = t;
Chris@19 41 }
Chris@19 42
Chris@19 43 R *X(rader_tl_find)(INT k1, INT k2, INT k3, rader_tl *t)
Chris@19 44 {
Chris@19 45 while (t && (t->k1 != k1 || t->k2 != k2 || t->k3 != k3))
Chris@19 46 t = t->cdr;
Chris@19 47 if (t) {
Chris@19 48 ++t->refcnt;
Chris@19 49 return t->W;
Chris@19 50 } else
Chris@19 51 return 0;
Chris@19 52 }
Chris@19 53
Chris@19 54 void X(rader_tl_delete)(R *W, rader_tl **tl)
Chris@19 55 {
Chris@19 56 if (W) {
Chris@19 57 rader_tl **tp, *t;
Chris@19 58
Chris@19 59 for (tp = tl; (t = *tp) && t->W != W; tp = &t->cdr)
Chris@19 60 ;
Chris@19 61
Chris@19 62 if (t && --t->refcnt <= 0) {
Chris@19 63 *tp = t->cdr;
Chris@19 64 X(ifree)(t->W);
Chris@19 65 X(ifree)(t);
Chris@19 66 }
Chris@19 67 }
Chris@19 68 }