cannam@95: /*
cannam@95:  * Copyright (c) 2003, 2007-11 Matteo Frigo
cannam@95:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: 
cannam@95: #include "ifftw.h"
cannam@95: 
cannam@95: tensor *X(mktensor)(int rnk) 
cannam@95: {
cannam@95:      tensor *x;
cannam@95: 
cannam@95:      A(rnk >= 0);
cannam@95: 
cannam@95: #if defined(STRUCT_HACK_KR)
cannam@95:      if (FINITE_RNK(rnk) && rnk > 1)
cannam@95: 	  x = (tensor *)MALLOC(sizeof(tensor) + (rnk - 1) * sizeof(iodim),
cannam@95: 				    TENSORS);
cannam@95:      else
cannam@95: 	  x = (tensor *)MALLOC(sizeof(tensor), TENSORS);
cannam@95: #elif defined(STRUCT_HACK_C99)
cannam@95:      if (FINITE_RNK(rnk))
cannam@95: 	  x = (tensor *)MALLOC(sizeof(tensor) + rnk * sizeof(iodim),
cannam@95: 				    TENSORS);
cannam@95:      else
cannam@95: 	  x = (tensor *)MALLOC(sizeof(tensor), TENSORS);
cannam@95: #else
cannam@95:      x = (tensor *)MALLOC(sizeof(tensor), TENSORS);
cannam@95:      if (FINITE_RNK(rnk) && rnk > 0)
cannam@95:           x->dims = (iodim *)MALLOC(sizeof(iodim) * rnk, TENSORS);
cannam@95:      else
cannam@95:           x->dims = 0;
cannam@95: #endif
cannam@95: 
cannam@95:      x->rnk = rnk;
cannam@95:      return x;
cannam@95: }
cannam@95: 
cannam@95: void X(tensor_destroy)(tensor *sz)
cannam@95: {
cannam@95: #if !defined(STRUCT_HACK_C99) && !defined(STRUCT_HACK_KR)
cannam@95:      X(ifree0)(sz->dims);
cannam@95: #endif
cannam@95:      X(ifree)(sz);
cannam@95: }
cannam@95: 
cannam@95: INT X(tensor_sz)(const tensor *sz)
cannam@95: {
cannam@95:      int i;
cannam@95:      INT n = 1;
cannam@95: 
cannam@95:      if (!FINITE_RNK(sz->rnk))
cannam@95:           return 0;
cannam@95: 
cannam@95:      for (i = 0; i < sz->rnk; ++i)
cannam@95:           n *= sz->dims[i].n;
cannam@95:      return n;
cannam@95: }
cannam@95: 
cannam@95: void X(tensor_md5)(md5 *p, const tensor *t)
cannam@95: {
cannam@95:      int i;
cannam@95:      X(md5int)(p, t->rnk);
cannam@95:      if (FINITE_RNK(t->rnk)) {
cannam@95: 	  for (i = 0; i < t->rnk; ++i) {
cannam@95: 	       const iodim *q = t->dims + i;
cannam@95: 	       X(md5INT)(p, q->n);
cannam@95: 	       X(md5INT)(p, q->is);
cannam@95: 	       X(md5INT)(p, q->os);
cannam@95: 	  }
cannam@95:      }
cannam@95: }
cannam@95: 
cannam@95: /* treat a (rank <= 1)-tensor as a rank-1 tensor, extracting
cannam@95:    appropriate n, is, and os components */
cannam@95: int X(tensor_tornk1)(const tensor *t, INT *n, INT *is, INT *os)
cannam@95: {
cannam@95:      A(t->rnk <= 1);
cannam@95:      if (t->rnk == 1) {
cannam@95: 	  const iodim *vd = t->dims;
cannam@95:           *n = vd[0].n;
cannam@95:           *is = vd[0].is;
cannam@95:           *os = vd[0].os;
cannam@95:      } else {
cannam@95:           *n = 1;
cannam@95:           *is = *os = 0;
cannam@95:      }
cannam@95:      return 1;
cannam@95: }
cannam@95: 
cannam@95: void X(tensor_print)(const tensor *x, printer *p)
cannam@95: {
cannam@95:      if (FINITE_RNK(x->rnk)) {
cannam@95: 	  int i;
cannam@95: 	  int first = 1;
cannam@95: 	  p->print(p, "(");
cannam@95: 	  for (i = 0; i < x->rnk; ++i) {
cannam@95: 	       const iodim *d = x->dims + i;
cannam@95: 	       p->print(p, "%s(%D %D %D)", 
cannam@95: 			first ? "" : " ",
cannam@95: 			d->n, d->is, d->os);
cannam@95: 	       first = 0;
cannam@95: 	  }
cannam@95: 	  p->print(p, ")");
cannam@95:      } else {
cannam@95: 	  p->print(p, "rank-minfty"); 
cannam@95:      }
cannam@95: }