Chris@82: /* Chris@82: * Copyright (c) 2001 Matteo Frigo Chris@82: * Copyright (c) 2001 Massachusetts Institute of Technology Chris@82: * Chris@82: * This program is free software; you can redistribute it and/or modify Chris@82: * it under the terms of the GNU General Public License as published by Chris@82: * the Free Software Foundation; either version 2 of the License, or Chris@82: * (at your option) any later version. Chris@82: * Chris@82: * This program is distributed in the hope that it will be useful, Chris@82: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@82: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@82: * GNU General Public License for more details. Chris@82: * Chris@82: * You should have received a copy of the GNU General Public License Chris@82: * along with this program; if not, write to the Free Software Chris@82: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@82: * Chris@82: */ Chris@82: Chris@82: #include "libbench2/bench.h" Chris@82: #include Chris@82: Chris@82: bench_tensor *mktensor(int rnk) Chris@82: { Chris@82: bench_tensor *x; Chris@82: Chris@82: BENCH_ASSERT(rnk >= 0); Chris@82: Chris@82: x = (bench_tensor *)bench_malloc(sizeof(bench_tensor)); Chris@82: if (BENCH_FINITE_RNK(rnk) && rnk > 0) Chris@82: x->dims = (bench_iodim *)bench_malloc(sizeof(bench_iodim) * rnk); Chris@82: else Chris@82: x->dims = 0; Chris@82: Chris@82: x->rnk = rnk; Chris@82: return x; Chris@82: } Chris@82: Chris@82: void tensor_destroy(bench_tensor *sz) Chris@82: { Chris@82: bench_free0(sz->dims); Chris@82: bench_free(sz); Chris@82: } Chris@82: Chris@82: size_t tensor_sz(const bench_tensor *sz) Chris@82: { Chris@82: int i; Chris@82: size_t n = 1; Chris@82: Chris@82: if (!BENCH_FINITE_RNK(sz->rnk)) Chris@82: return 0; Chris@82: Chris@82: for (i = 0; i < sz->rnk; ++i) Chris@82: n *= sz->dims[i].n; Chris@82: return n; Chris@82: } Chris@82: Chris@82: Chris@82: /* total order among bench_iodim's */ Chris@82: static int dimcmp(const bench_iodim *a, const bench_iodim *b) Chris@82: { Chris@82: if (b->is != a->is) Chris@82: return (b->is - a->is); /* shorter strides go later */ Chris@82: if (b->os != a->os) Chris@82: return (b->os - a->os); /* shorter strides go later */ Chris@82: return (int)(a->n - b->n); /* larger n's go later */ Chris@82: } Chris@82: Chris@82: bench_tensor *tensor_compress(const bench_tensor *sz) Chris@82: { Chris@82: int i, rnk; Chris@82: bench_tensor *x; Chris@82: Chris@82: BENCH_ASSERT(BENCH_FINITE_RNK(sz->rnk)); Chris@82: for (i = rnk = 0; i < sz->rnk; ++i) { Chris@82: BENCH_ASSERT(sz->dims[i].n > 0); Chris@82: if (sz->dims[i].n != 1) Chris@82: ++rnk; Chris@82: } Chris@82: Chris@82: x = mktensor(rnk); Chris@82: for (i = rnk = 0; i < sz->rnk; ++i) { Chris@82: if (sz->dims[i].n != 1) Chris@82: x->dims[rnk++] = sz->dims[i]; Chris@82: } Chris@82: Chris@82: if (rnk) { Chris@82: /* God knows how qsort() behaves if n==0 */ Chris@82: qsort(x->dims, (size_t)x->rnk, sizeof(bench_iodim), Chris@82: (int (*)(const void *, const void *))dimcmp); Chris@82: } Chris@82: Chris@82: return x; Chris@82: } Chris@82: Chris@82: int tensor_unitstridep(bench_tensor *t) Chris@82: { Chris@82: BENCH_ASSERT(BENCH_FINITE_RNK(t->rnk)); Chris@82: return (t->rnk == 0 || Chris@82: (t->dims[t->rnk - 1].is == 1 && t->dims[t->rnk - 1].os == 1)); Chris@82: } Chris@82: Chris@82: /* detect screwy real padded rowmajor... ugh */ Chris@82: int tensor_real_rowmajorp(bench_tensor *t, int sign, int in_place) Chris@82: { Chris@82: int i; Chris@82: Chris@82: BENCH_ASSERT(BENCH_FINITE_RNK(t->rnk)); Chris@82: Chris@82: i = t->rnk - 1; Chris@82: Chris@82: if (--i >= 0) { Chris@82: bench_iodim *d = t->dims + i; Chris@82: if (sign < 0) { Chris@82: if (d[0].is != d[1].is * (in_place ? 2*(d[1].n/2 + 1) : d[1].n)) Chris@82: return 0; Chris@82: if (d[0].os != d[1].os * (d[1].n/2 + 1)) Chris@82: return 0; Chris@82: } Chris@82: else { Chris@82: if (d[0].is != d[1].is * (d[1].n/2 + 1)) Chris@82: return 0; Chris@82: if (d[0].os != d[1].os * (in_place ? 2*(d[1].n/2 + 1) : d[1].n)) Chris@82: return 0; Chris@82: } Chris@82: } Chris@82: Chris@82: while (--i >= 0) { Chris@82: bench_iodim *d = t->dims + i; Chris@82: if (d[0].is != d[1].is * d[1].n) Chris@82: return 0; Chris@82: if (d[0].os != d[1].os * d[1].n) Chris@82: return 0; Chris@82: } Chris@82: return 1; Chris@82: } Chris@82: Chris@82: int tensor_rowmajorp(bench_tensor *t) Chris@82: { Chris@82: int i; Chris@82: Chris@82: BENCH_ASSERT(BENCH_FINITE_RNK(t->rnk)); Chris@82: Chris@82: i = t->rnk - 1; Chris@82: while (--i >= 0) { Chris@82: bench_iodim *d = t->dims + i; Chris@82: if (d[0].is != d[1].is * d[1].n) Chris@82: return 0; Chris@82: if (d[0].os != d[1].os * d[1].n) Chris@82: return 0; Chris@82: } Chris@82: return 1; Chris@82: } Chris@82: Chris@82: static void dimcpy(bench_iodim *dst, const bench_iodim *src, int rnk) Chris@82: { Chris@82: int i; Chris@82: if (BENCH_FINITE_RNK(rnk)) Chris@82: for (i = 0; i < rnk; ++i) Chris@82: dst[i] = src[i]; Chris@82: } Chris@82: Chris@82: bench_tensor *tensor_append(const bench_tensor *a, const bench_tensor *b) Chris@82: { Chris@82: if (!BENCH_FINITE_RNK(a->rnk) || !BENCH_FINITE_RNK(b->rnk)) { Chris@82: return mktensor(BENCH_RNK_MINFTY); Chris@82: } else { Chris@82: bench_tensor *x = mktensor(a->rnk + b->rnk); Chris@82: dimcpy(x->dims, a->dims, a->rnk); Chris@82: dimcpy(x->dims + a->rnk, b->dims, b->rnk); Chris@82: return x; Chris@82: } Chris@82: } Chris@82: Chris@82: static int imax(int a, int b) Chris@82: { Chris@82: return (a > b) ? a : b; Chris@82: } Chris@82: Chris@82: static int imin(int a, int b) Chris@82: { Chris@82: return (a < b) ? a : b; Chris@82: } Chris@82: Chris@82: #define DEFBOUNDS(name, xs) \ Chris@82: void name(bench_tensor *t, int *lbp, int *ubp) \ Chris@82: { \ Chris@82: int lb = 0; \ Chris@82: int ub = 1; \ Chris@82: int i; \ Chris@82: \ Chris@82: BENCH_ASSERT(BENCH_FINITE_RNK(t->rnk)); \ Chris@82: \ Chris@82: for (i = 0; i < t->rnk; ++i) { \ Chris@82: bench_iodim *d = t->dims + i; \ Chris@82: int n = d->n; \ Chris@82: int s = d->xs; \ Chris@82: lb = imin(lb, lb + s * (n - 1)); \ Chris@82: ub = imax(ub, ub + s * (n - 1)); \ Chris@82: } \ Chris@82: \ Chris@82: *lbp = lb; \ Chris@82: *ubp = ub; \ Chris@82: } Chris@82: Chris@82: DEFBOUNDS(tensor_ibounds, is) Chris@82: DEFBOUNDS(tensor_obounds, os) Chris@82: Chris@82: bench_tensor *tensor_copy(const bench_tensor *sz) Chris@82: { Chris@82: bench_tensor *x = mktensor(sz->rnk); Chris@82: dimcpy(x->dims, sz->dims, sz->rnk); Chris@82: return x; Chris@82: } Chris@82: Chris@82: /* Like tensor_copy, but copy only rnk dimensions starting with start_dim. */ Chris@82: bench_tensor *tensor_copy_sub(const bench_tensor *sz, int start_dim, int rnk) Chris@82: { Chris@82: bench_tensor *x; Chris@82: Chris@82: BENCH_ASSERT(BENCH_FINITE_RNK(sz->rnk) && start_dim + rnk <= sz->rnk); Chris@82: x = mktensor(rnk); Chris@82: dimcpy(x->dims, sz->dims + start_dim, rnk); Chris@82: return x; Chris@82: } Chris@82: Chris@82: bench_tensor *tensor_copy_swapio(const bench_tensor *sz) Chris@82: { Chris@82: bench_tensor *x = tensor_copy(sz); Chris@82: int i; Chris@82: if (BENCH_FINITE_RNK(x->rnk)) Chris@82: for (i = 0; i < x->rnk; ++i) { Chris@82: int s; Chris@82: s = x->dims[i].is; Chris@82: x->dims[i].is = x->dims[i].os; Chris@82: x->dims[i].os = s; Chris@82: } Chris@82: return x; Chris@82: }