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