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