Chris@19: /*
Chris@19:  * Copyright (c) 2001 Matteo Frigo
Chris@19:  * Copyright (c) 2001 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 "bench.h"
Chris@19: #include <stdlib.h>
Chris@19: 
Chris@19: bench_tensor *mktensor(int rnk) 
Chris@19: {
Chris@19:      bench_tensor *x;
Chris@19: 
Chris@19:      BENCH_ASSERT(rnk >= 0);
Chris@19: 
Chris@19:      x = (bench_tensor *)bench_malloc(sizeof(bench_tensor));
Chris@19:      if (FINITE_RNK(rnk) && rnk > 0)
Chris@19:           x->dims = (bench_iodim *)bench_malloc(sizeof(bench_iodim) * rnk);
Chris@19:      else
Chris@19:           x->dims = 0;
Chris@19: 
Chris@19:      x->rnk = rnk;
Chris@19:      return x;
Chris@19: }
Chris@19: 
Chris@19: void tensor_destroy(bench_tensor *sz)
Chris@19: {
Chris@19:      bench_free0(sz->dims);
Chris@19:      bench_free(sz);
Chris@19: }
Chris@19: 
Chris@19: int tensor_sz(const bench_tensor *sz)
Chris@19: {
Chris@19:      int i, n = 1;
Chris@19: 
Chris@19:      if (!FINITE_RNK(sz->rnk))
Chris@19:           return 0;
Chris@19: 
Chris@19:      for (i = 0; i < sz->rnk; ++i)
Chris@19:           n *= sz->dims[i].n;
Chris@19:      return n;
Chris@19: }
Chris@19: 
Chris@19: 
Chris@19: /* total order among bench_iodim's */
Chris@19: static int dimcmp(const bench_iodim *a, const bench_iodim *b)
Chris@19: {
Chris@19:      if (b->is != a->is)
Chris@19:           return (b->is - a->is);	/* shorter strides go later */
Chris@19:      if (b->os != a->os)
Chris@19:           return (b->os - a->os);	/* shorter strides go later */
Chris@19:      return (int)(a->n - b->n);	        /* larger n's go later */
Chris@19: }
Chris@19: 
Chris@19: bench_tensor *tensor_compress(const bench_tensor *sz)
Chris@19: {
Chris@19:      int i, rnk;
Chris@19:      bench_tensor *x;
Chris@19: 
Chris@19:      BENCH_ASSERT(FINITE_RNK(sz->rnk));
Chris@19:      for (i = rnk = 0; i < sz->rnk; ++i) {
Chris@19:           BENCH_ASSERT(sz->dims[i].n > 0);
Chris@19:           if (sz->dims[i].n != 1)
Chris@19:                ++rnk;
Chris@19:      }
Chris@19: 
Chris@19:      x = mktensor(rnk);
Chris@19:      for (i = rnk = 0; i < sz->rnk; ++i) {
Chris@19:           if (sz->dims[i].n != 1)
Chris@19:                x->dims[rnk++] = sz->dims[i];
Chris@19:      }
Chris@19: 
Chris@19:      if (rnk) {
Chris@19: 	  /* God knows how qsort() behaves if n==0 */
Chris@19: 	  qsort(x->dims, (size_t)x->rnk, sizeof(bench_iodim),
Chris@19: 		(int (*)(const void *, const void *))dimcmp);
Chris@19:      }
Chris@19: 
Chris@19:      return x;
Chris@19: }
Chris@19: 
Chris@19: int tensor_unitstridep(bench_tensor *t)
Chris@19: {
Chris@19:      BENCH_ASSERT(FINITE_RNK(t->rnk));
Chris@19:      return (t->rnk == 0 ||
Chris@19: 	     (t->dims[t->rnk - 1].is == 1 && t->dims[t->rnk - 1].os == 1));
Chris@19: }
Chris@19: 
Chris@19: /* detect screwy real padded rowmajor... ugh */
Chris@19: int tensor_real_rowmajorp(bench_tensor *t, int sign, int in_place)
Chris@19: {
Chris@19:      int i;
Chris@19: 
Chris@19:      BENCH_ASSERT(FINITE_RNK(t->rnk));
Chris@19: 
Chris@19:      i = t->rnk - 1;
Chris@19: 
Chris@19:      if (--i >= 0) {
Chris@19:           bench_iodim *d = t->dims + i;
Chris@19: 	  if (sign < 0) {
Chris@19: 	       if (d[0].is != d[1].is * (in_place ? 2*(d[1].n/2 + 1) : d[1].n))
Chris@19: 		    return 0;
Chris@19: 	       if (d[0].os != d[1].os * (d[1].n/2 + 1))
Chris@19: 		    return 0;
Chris@19: 	  }
Chris@19: 	  else {
Chris@19: 	       if (d[0].is != d[1].is * (d[1].n/2 + 1))
Chris@19: 		    return 0;
Chris@19: 	       if (d[0].os != d[1].os * (in_place ? 2*(d[1].n/2 + 1) : d[1].n))
Chris@19: 		    return 0;
Chris@19: 	  }
Chris@19:      }
Chris@19: 
Chris@19:      while (--i >= 0) {
Chris@19:           bench_iodim *d = t->dims + i;
Chris@19:           if (d[0].is != d[1].is * d[1].n)
Chris@19:                return 0;
Chris@19:           if (d[0].os != d[1].os * d[1].n)
Chris@19:                return 0;
Chris@19:      }
Chris@19:      return 1;
Chris@19: }
Chris@19: 
Chris@19: int tensor_rowmajorp(bench_tensor *t)
Chris@19: {
Chris@19:      int i;
Chris@19: 
Chris@19:      BENCH_ASSERT(FINITE_RNK(t->rnk));
Chris@19: 
Chris@19:      i = t->rnk - 1;
Chris@19:      while (--i >= 0) {
Chris@19: 	  bench_iodim *d = t->dims + i;
Chris@19: 	  if (d[0].is != d[1].is * d[1].n)
Chris@19: 	       return 0;
Chris@19: 	  if (d[0].os != d[1].os * d[1].n)
Chris@19: 	       return 0;
Chris@19:      }
Chris@19:      return 1;
Chris@19: }
Chris@19: 
Chris@19: static void dimcpy(bench_iodim *dst, const bench_iodim *src, int rnk)
Chris@19: {
Chris@19:      int i;
Chris@19:      if (FINITE_RNK(rnk))
Chris@19:           for (i = 0; i < rnk; ++i)
Chris@19:                dst[i] = src[i];
Chris@19: }
Chris@19: 
Chris@19: bench_tensor *tensor_append(const bench_tensor *a, const bench_tensor *b)
Chris@19: {
Chris@19:      if (!FINITE_RNK(a->rnk) || !FINITE_RNK(b->rnk)) {
Chris@19:           return mktensor(RNK_MINFTY);
Chris@19:      } else {
Chris@19: 	  bench_tensor *x = mktensor(a->rnk + b->rnk);
Chris@19:           dimcpy(x->dims, a->dims, a->rnk);
Chris@19:           dimcpy(x->dims + a->rnk, b->dims, b->rnk);
Chris@19: 	  return x;
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: static int imax(int a, int b)
Chris@19: {
Chris@19:      return (a > b) ? a : b;
Chris@19: }
Chris@19: 
Chris@19: static int imin(int a, int b)
Chris@19: {
Chris@19:      return (a < b) ? a : b;
Chris@19: }
Chris@19: 
Chris@19: #define DEFBOUNDS(name, xs)			\
Chris@19: void name(bench_tensor *t, int *lbp, int *ubp)	\
Chris@19: {						\
Chris@19:      int lb = 0;				\
Chris@19:      int ub = 1;				\
Chris@19:      int i;					\
Chris@19: 						\
Chris@19:      BENCH_ASSERT(FINITE_RNK(t->rnk));		\
Chris@19: 						\
Chris@19:      for (i = 0; i < t->rnk; ++i) {		\
Chris@19: 	  bench_iodim *d = t->dims + i;		\
Chris@19: 	  int n = d->n;				\
Chris@19: 	  int s = d->xs;			\
Chris@19: 	  lb = imin(lb, lb + s * (n - 1));	\
Chris@19: 	  ub = imax(ub, ub + s * (n - 1));	\
Chris@19:      }						\
Chris@19: 						\
Chris@19:      *lbp = lb;					\
Chris@19:      *ubp = ub;					\
Chris@19: }
Chris@19: 
Chris@19: DEFBOUNDS(tensor_ibounds, is)
Chris@19: DEFBOUNDS(tensor_obounds, os)
Chris@19: 
Chris@19: bench_tensor *tensor_copy(const bench_tensor *sz)
Chris@19: {
Chris@19:      bench_tensor *x = mktensor(sz->rnk);
Chris@19:      dimcpy(x->dims, sz->dims, sz->rnk);
Chris@19:      return x;
Chris@19: }
Chris@19: 
Chris@19: /* Like tensor_copy, but copy only rnk dimensions starting with start_dim. */
Chris@19: bench_tensor *tensor_copy_sub(const bench_tensor *sz, int start_dim, int rnk)
Chris@19: {
Chris@19:      bench_tensor *x;
Chris@19: 
Chris@19:      BENCH_ASSERT(FINITE_RNK(sz->rnk) && start_dim + rnk <= sz->rnk);
Chris@19:      x = mktensor(rnk);
Chris@19:      dimcpy(x->dims, sz->dims + start_dim, rnk);
Chris@19:      return x;
Chris@19: }
Chris@19: 
Chris@19: bench_tensor *tensor_copy_swapio(const bench_tensor *sz)
Chris@19: {
Chris@19:      bench_tensor *x = tensor_copy(sz);
Chris@19:      int i;
Chris@19:      if (FINITE_RNK(x->rnk))
Chris@19: 	  for (i = 0; i < x->rnk; ++i) {
Chris@19: 	       int s;
Chris@19: 	       s = x->dims[i].is;
Chris@19: 	       x->dims[i].is = x->dims[i].os;
Chris@19: 	       x->dims[i].os = s;
Chris@19: 	  }
Chris@19:      return x;
Chris@19: }