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: 
Chris@19: /* Twiddle manipulation */
Chris@19: 
Chris@19: #include "ifftw.h"
Chris@19: #include <math.h>
Chris@19: 
Chris@19: #define HASHSZ 109
Chris@19: 
Chris@19: /* hash table of known twiddle factors */
Chris@19: static twid *twlist[HASHSZ];
Chris@19: 
Chris@19: static INT hash(INT n, INT r)
Chris@19: {
Chris@19:      INT h = n * 17 + r;
Chris@19: 
Chris@19:      if (h < 0) h = -h;
Chris@19: 
Chris@19:      return (h % HASHSZ);
Chris@19: }
Chris@19: 
Chris@19: static int equal_instr(const tw_instr *p, const tw_instr *q)
Chris@19: {
Chris@19:      if (p == q)
Chris@19:           return 1;
Chris@19: 
Chris@19:      for (;; ++p, ++q) {
Chris@19:           if (p->op != q->op)
Chris@19: 	       return 0;
Chris@19: 
Chris@19: 	  switch (p->op) {
Chris@19: 	      case TW_NEXT:
Chris@19: 		   return (p->v == q->v); /* p->i is ignored */
Chris@19: 
Chris@19: 	      case TW_FULL:
Chris@19: 	      case TW_HALF:
Chris@19: 		   if (p->v != q->v) return 0; /* p->i is ignored */
Chris@19: 		   break;
Chris@19: 
Chris@19: 	      default:
Chris@19: 		   if (p->v != q->v || p->i != q->i) return 0;
Chris@19: 		   break;
Chris@19: 	  }
Chris@19:      }
Chris@19:      A(0 /* can't happen */);
Chris@19: }
Chris@19: 
Chris@19: static int ok_twid(const twid *t, 
Chris@19: 		   enum wakefulness wakefulness,
Chris@19: 		   const tw_instr *q, INT n, INT r, INT m)
Chris@19: {
Chris@19:      return (wakefulness == t->wakefulness &&
Chris@19: 	     n == t->n &&
Chris@19: 	     r == t->r && 
Chris@19: 	     m <= t->m && 
Chris@19: 	     equal_instr(t->instr, q));
Chris@19: }
Chris@19: 
Chris@19: static twid *lookup(enum wakefulness wakefulness,
Chris@19: 		    const tw_instr *q, INT n, INT r, INT m)
Chris@19: {
Chris@19:      twid *p;
Chris@19: 
Chris@19:      for (p = twlist[hash(n,r)]; 
Chris@19: 	  p && !ok_twid(p, wakefulness, q, n, r, m); 
Chris@19: 	  p = p->cdr)
Chris@19:           ;
Chris@19:      return p;
Chris@19: }
Chris@19: 
Chris@19: static INT twlen0(INT r, const tw_instr *p, INT *vl)
Chris@19: {
Chris@19:      INT ntwiddle = 0;
Chris@19: 
Chris@19:      /* compute length of bytecode program */
Chris@19:      A(r > 0);
Chris@19:      for ( ; p->op != TW_NEXT; ++p) {
Chris@19: 	  switch (p->op) {
Chris@19: 	      case TW_FULL:
Chris@19: 		   ntwiddle += (r - 1) * 2;
Chris@19: 		   break;
Chris@19: 	      case TW_HALF:
Chris@19: 		   ntwiddle += (r - 1);
Chris@19: 		   break;
Chris@19: 	      case TW_CEXP:
Chris@19: 		   ntwiddle += 2;
Chris@19: 		   break;
Chris@19: 	      case TW_COS:
Chris@19: 	      case TW_SIN:
Chris@19: 		   ntwiddle += 1;
Chris@19: 		   break;
Chris@19: 	  }
Chris@19:      }
Chris@19: 
Chris@19:      *vl = (INT)p->v;
Chris@19:      return ntwiddle;
Chris@19: }
Chris@19: 
Chris@19: INT X(twiddle_length)(INT r, const tw_instr *p)
Chris@19: {
Chris@19:      INT vl;
Chris@19:      return twlen0(r, p, &vl);
Chris@19: }
Chris@19: 
Chris@19: static R *compute(enum wakefulness wakefulness,
Chris@19: 		  const tw_instr *instr, INT n, INT r, INT m)
Chris@19: {
Chris@19:      INT ntwiddle, j, vl;
Chris@19:      R *W, *W0;
Chris@19:      const tw_instr *p;
Chris@19:      triggen *t = X(mktriggen)(wakefulness, n);
Chris@19: 
Chris@19:      p = instr;
Chris@19:      ntwiddle = twlen0(r, p, &vl);
Chris@19: 
Chris@19:      A(m % vl == 0);
Chris@19: 
Chris@19:      W0 = W = (R *)MALLOC((ntwiddle * (m / vl)) * sizeof(R), TWIDDLES);
Chris@19: 
Chris@19:      for (j = 0; j < m; j += vl) {
Chris@19:           for (p = instr; p->op != TW_NEXT; ++p) {
Chris@19: 	       switch (p->op) {
Chris@19: 		   case TW_FULL: {
Chris@19: 			INT i;
Chris@19: 			for (i = 1; i < r; ++i) {
Chris@19: 			     A((j + (INT)p->v) * i < n);
Chris@19: 			     A((j + (INT)p->v) * i > -n);
Chris@19: 			     t->cexp(t, (j + (INT)p->v) * i, W);
Chris@19: 			     W += 2;
Chris@19: 			}
Chris@19: 			break;
Chris@19: 		   }
Chris@19: 
Chris@19: 		   case TW_HALF: {
Chris@19: 			INT i;
Chris@19: 			A((r % 2) == 1);
Chris@19: 			for (i = 1; i + i < r; ++i) {
Chris@19: 			     t->cexp(t, MULMOD(i, (j + (INT)p->v), n), W);
Chris@19: 			     W += 2;
Chris@19: 			}
Chris@19: 			break;
Chris@19: 		   }
Chris@19: 
Chris@19: 		   case TW_COS: {
Chris@19: 			R d[2];
Chris@19: 
Chris@19: 			A((j + (INT)p->v) * p->i < n);
Chris@19: 			A((j + (INT)p->v) * p->i > -n);
Chris@19: 			t->cexp(t, (j + (INT)p->v) * (INT)p->i, d);
Chris@19: 			*W++ = d[0];
Chris@19: 			break;
Chris@19: 		   }
Chris@19: 
Chris@19: 		   case TW_SIN: {
Chris@19: 			R d[2];
Chris@19: 
Chris@19: 			A((j + (INT)p->v) * p->i < n);
Chris@19: 			A((j + (INT)p->v) * p->i > -n);
Chris@19: 			t->cexp(t, (j + (INT)p->v) * (INT)p->i, d);
Chris@19: 			*W++ = d[1];
Chris@19: 			break;
Chris@19: 		   }
Chris@19: 
Chris@19: 		   case TW_CEXP:
Chris@19: 			A((j + (INT)p->v) * p->i < n);
Chris@19: 			A((j + (INT)p->v) * p->i > -n);
Chris@19: 			t->cexp(t, (j + (INT)p->v) * (INT)p->i, W);
Chris@19: 			W += 2;
Chris@19: 			break;
Chris@19: 	       }
Chris@19: 	  }
Chris@19:      }
Chris@19: 
Chris@19:      X(triggen_destroy)(t);
Chris@19:      return W0;
Chris@19: }
Chris@19: 
Chris@19: static void mktwiddle(enum wakefulness wakefulness,
Chris@19: 		      twid **pp, const tw_instr *instr, INT n, INT r, INT m)
Chris@19: {
Chris@19:      twid *p;
Chris@19:      INT h;
Chris@19: 
Chris@19:      if ((p = lookup(wakefulness, instr, n, r, m))) {
Chris@19:           ++p->refcnt;
Chris@19:      } else {
Chris@19: 	  p = (twid *) MALLOC(sizeof(twid), TWIDDLES);
Chris@19: 	  p->n = n;
Chris@19: 	  p->r = r;
Chris@19: 	  p->m = m;
Chris@19: 	  p->instr = instr;
Chris@19: 	  p->refcnt = 1;
Chris@19: 	  p->wakefulness = wakefulness;
Chris@19: 	  p->W = compute(wakefulness, instr, n, r, m);
Chris@19: 
Chris@19: 	  /* cons! onto twlist */
Chris@19: 	  h = hash(n, r);
Chris@19: 	  p->cdr = twlist[h];
Chris@19: 	  twlist[h] = p;
Chris@19:      }
Chris@19: 
Chris@19:      *pp = p;
Chris@19: }
Chris@19: 
Chris@19: static void twiddle_destroy(twid **pp)
Chris@19: {
Chris@19:      twid *p = *pp;
Chris@19:      twid **q;
Chris@19: 
Chris@19:      if ((--p->refcnt) == 0) {
Chris@19: 	  /* remove p from twiddle list */
Chris@19: 	  for (q = &twlist[hash(p->n, p->r)]; *q; q = &((*q)->cdr)) {
Chris@19: 	       if (*q == p) {
Chris@19: 		    *q = p->cdr;
Chris@19: 		    X(ifree)(p->W);
Chris@19: 		    X(ifree)(p);
Chris@19: 		    *pp = 0;
Chris@19: 		    return;
Chris@19: 	       }
Chris@19: 	  }
Chris@19: 	  A(0 /* can't happen */ );
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: 
Chris@19: void X(twiddle_awake)(enum wakefulness wakefulness, twid **pp, 
Chris@19: 		      const tw_instr *instr, INT n, INT r, INT m)
Chris@19: {
Chris@19:      switch (wakefulness) {
Chris@19: 	 case SLEEPY: 
Chris@19: 	      twiddle_destroy(pp);
Chris@19: 	      break;
Chris@19: 	 default:
Chris@19: 	      mktwiddle(wakefulness, pp, instr, n, r, m);
Chris@19: 	      break;
Chris@19:      }
Chris@19: }