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