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