Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: #include "ifftw-mpi.h"
Chris@42: 
Chris@42: dtensor *XM(mkdtensor)(int rnk) 
Chris@42: {
Chris@42:      dtensor *x;
Chris@42: 
Chris@42:      A(rnk >= 0);
Chris@42: 
Chris@42: #if defined(STRUCT_HACK_KR)
Chris@42:      if (FINITE_RNK(rnk) && rnk > 1)
Chris@42: 	  x = (dtensor *)MALLOC(sizeof(dtensor) + (rnk - 1) * sizeof(ddim),
Chris@42: 				    TENSORS);
Chris@42:      else
Chris@42: 	  x = (dtensor *)MALLOC(sizeof(dtensor), TENSORS);
Chris@42: #elif defined(STRUCT_HACK_C99)
Chris@42:      if (FINITE_RNK(rnk))
Chris@42: 	  x = (dtensor *)MALLOC(sizeof(dtensor) + rnk * sizeof(ddim),
Chris@42: 				    TENSORS);
Chris@42:      else
Chris@42: 	  x = (dtensor *)MALLOC(sizeof(dtensor), TENSORS);
Chris@42: #else
Chris@42:      x = (dtensor *)MALLOC(sizeof(dtensor), TENSORS);
Chris@42:      if (FINITE_RNK(rnk) && rnk > 0)
Chris@42:           x->dims = (ddim *)MALLOC(sizeof(ddim) * rnk, TENSORS);
Chris@42:      else
Chris@42:           x->dims = 0;
Chris@42: #endif
Chris@42: 
Chris@42:      x->rnk = rnk;
Chris@42:      return x;
Chris@42: }
Chris@42: 
Chris@42: void XM(dtensor_destroy)(dtensor *sz)
Chris@42: {
Chris@42: #if !defined(STRUCT_HACK_C99) && !defined(STRUCT_HACK_KR)
Chris@42:      X(ifree0)(sz->dims);
Chris@42: #endif
Chris@42:      X(ifree)(sz);
Chris@42: }
Chris@42: 
Chris@42: void XM(dtensor_md5)(md5 *p, const dtensor *t)
Chris@42: {
Chris@42:      int i;
Chris@42:      X(md5int)(p, t->rnk);
Chris@42:      if (FINITE_RNK(t->rnk)) {
Chris@42:           for (i = 0; i < t->rnk; ++i) {
Chris@42:                const ddim *q = t->dims + i;
Chris@42:                X(md5INT)(p, q->n);
Chris@42:                X(md5INT)(p, q->b[IB]);
Chris@42:                X(md5INT)(p, q->b[OB]);
Chris@42:           }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: dtensor *XM(dtensor_copy)(const dtensor *sz)
Chris@42: {
Chris@42:      dtensor *x = XM(mkdtensor)(sz->rnk);
Chris@42:      int i;
Chris@42:      if (FINITE_RNK(sz->rnk))
Chris@42:           for (i = 0; i < sz->rnk; ++i)
Chris@42:                x->dims[i] = sz->dims[i];
Chris@42:      return x;
Chris@42: }
Chris@42: 
Chris@42: dtensor *XM(dtensor_canonical)(const dtensor *sz, int compress)
Chris@42: {
Chris@42:      int i, rnk;
Chris@42:      dtensor *x;
Chris@42:      block_kind k;
Chris@42: 
Chris@42:      if (!FINITE_RNK(sz->rnk))
Chris@42: 	  return XM(mkdtensor)(sz->rnk);
Chris@42:      for (i = rnk = 0; i < sz->rnk; ++i) {
Chris@42: 	  if (sz->dims[i].n <= 0)
Chris@42: 	       return XM(mkdtensor)(RNK_MINFTY);
Chris@42: 	  else if (!compress || sz->dims[i].n > 1)
Chris@42: 	       ++rnk;
Chris@42:      }
Chris@42:      x = XM(mkdtensor)(rnk);
Chris@42:      for (i = rnk = 0; i < sz->rnk; ++i) {
Chris@42: 	  if (!compress || sz->dims[i].n > 1) {
Chris@42:                x->dims[rnk].n = sz->dims[i].n;
Chris@42: 	       FORALL_BLOCK_KIND(k) {
Chris@42: 		    if (XM(num_blocks)(sz->dims[i].n, sz->dims[i].b[k]) == 1)
Chris@42: 			 x->dims[rnk].b[k] = sz->dims[i].n;
Chris@42: 		    else
Chris@42: 			 x->dims[rnk].b[k] = sz->dims[i].b[k];
Chris@42: 	       }
Chris@42: 	       ++rnk;
Chris@42: 	  }
Chris@42:      }
Chris@42:      return x;
Chris@42: }
Chris@42: 
Chris@42: int XM(dtensor_validp)(const dtensor *sz)
Chris@42: {
Chris@42:      int i;
Chris@42:      if (sz->rnk < 0) return 0;
Chris@42:      if (FINITE_RNK(sz->rnk))
Chris@42: 	  for (i = 0; i < sz->rnk; ++i)
Chris@42: 	       if (sz->dims[i].n < 0
Chris@42: 		   || sz->dims[i].b[IB] <= 0
Chris@42: 		   || sz->dims[i].b[OB] <= 0)
Chris@42: 		    return 0;
Chris@42:      return 1;
Chris@42: }
Chris@42: 
Chris@42: void XM(dtensor_print)(const dtensor *t, printer *p)
Chris@42: {
Chris@42:      if (FINITE_RNK(t->rnk)) {
Chris@42:           int i;
Chris@42:           int first = 1;
Chris@42:           p->print(p, "(");
Chris@42:           for (i = 0; i < t->rnk; ++i) {
Chris@42:                const ddim *d = t->dims + i;
Chris@42:                p->print(p, "%s(%D %D %D)",
Chris@42:                         first ? "" : " ",
Chris@42:                         d->n, d->b[IB], d->b[OB]);
Chris@42:                first = 0;
Chris@42:           }
Chris@42:           p->print(p, ")");
Chris@42:      } else {
Chris@42:           p->print(p, "rank-minfty");
Chris@42:      }
Chris@42: 
Chris@42: }