cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: #include "kernel/ifftw.h"
cannam@167: 
cannam@167: /*
cannam@167:   common routines for Rader solvers 
cannam@167: */
cannam@167: 
cannam@167: 
cannam@167: /* shared twiddle and omega lists, keyed by two/three integers. */
cannam@167: struct rader_tls {
cannam@167:      INT k1, k2, k3;
cannam@167:      R *W;
cannam@167:      int refcnt;
cannam@167:      rader_tl *cdr; 
cannam@167: };
cannam@167: 
cannam@167: void X(rader_tl_insert)(INT k1, INT k2, INT k3, R *W, rader_tl **tl)
cannam@167: {
cannam@167:      rader_tl *t = (rader_tl *) MALLOC(sizeof(rader_tl), TWIDDLES);
cannam@167:      t->k1 = k1; t->k2 = k2; t->k3 = k3; t->W = W;
cannam@167:      t->refcnt = 1; t->cdr = *tl; *tl = t;
cannam@167: }
cannam@167: 
cannam@167: R *X(rader_tl_find)(INT k1, INT k2, INT k3, rader_tl *t)
cannam@167: {
cannam@167:      while (t && (t->k1 != k1 || t->k2 != k2 || t->k3 != k3))
cannam@167: 	  t = t->cdr;
cannam@167:      if (t) {
cannam@167: 	  ++t->refcnt;
cannam@167: 	  return t->W;
cannam@167:      } else 
cannam@167: 	  return 0;
cannam@167: }
cannam@167: 
cannam@167: void X(rader_tl_delete)(R *W, rader_tl **tl)
cannam@167: {
cannam@167:      if (W) {
cannam@167: 	  rader_tl **tp, *t;
cannam@167: 
cannam@167: 	  for (tp = tl; (t = *tp) && t->W != W; tp = &t->cdr)
cannam@167: 	       ;
cannam@167: 
cannam@167: 	  if (t && --t->refcnt <= 0) {
cannam@167: 	       *tp = t->cdr;
cannam@167: 	       X(ifree)(t->W);
cannam@167: 	       X(ifree)(t);
cannam@167: 	  }
cannam@167:      }
cannam@167: }