annotate src/fftw-3.3.3/libbench2/tensor.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 89f5e221ed7b
children
rev   line source
cannam@95 1 /*
cannam@95 2 * Copyright (c) 2001 Matteo Frigo
cannam@95 3 * Copyright (c) 2001 Massachusetts Institute of Technology
cannam@95 4 *
cannam@95 5 * This program is free software; you can redistribute it and/or modify
cannam@95 6 * it under the terms of the GNU General Public License as published by
cannam@95 7 * the Free Software Foundation; either version 2 of the License, or
cannam@95 8 * (at your option) any later version.
cannam@95 9 *
cannam@95 10 * This program is distributed in the hope that it will be useful,
cannam@95 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@95 13 * GNU General Public License for more details.
cannam@95 14 *
cannam@95 15 * You should have received a copy of the GNU General Public License
cannam@95 16 * along with this program; if not, write to the Free Software
cannam@95 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@95 18 *
cannam@95 19 */
cannam@95 20
cannam@95 21 #include "bench.h"
cannam@95 22 #include <stdlib.h>
cannam@95 23
cannam@95 24 bench_tensor *mktensor(int rnk)
cannam@95 25 {
cannam@95 26 bench_tensor *x;
cannam@95 27
cannam@95 28 BENCH_ASSERT(rnk >= 0);
cannam@95 29
cannam@95 30 x = (bench_tensor *)bench_malloc(sizeof(bench_tensor));
cannam@95 31 if (FINITE_RNK(rnk) && rnk > 0)
cannam@95 32 x->dims = (bench_iodim *)bench_malloc(sizeof(bench_iodim) * rnk);
cannam@95 33 else
cannam@95 34 x->dims = 0;
cannam@95 35
cannam@95 36 x->rnk = rnk;
cannam@95 37 return x;
cannam@95 38 }
cannam@95 39
cannam@95 40 void tensor_destroy(bench_tensor *sz)
cannam@95 41 {
cannam@95 42 bench_free0(sz->dims);
cannam@95 43 bench_free(sz);
cannam@95 44 }
cannam@95 45
cannam@95 46 int tensor_sz(const bench_tensor *sz)
cannam@95 47 {
cannam@95 48 int i, n = 1;
cannam@95 49
cannam@95 50 if (!FINITE_RNK(sz->rnk))
cannam@95 51 return 0;
cannam@95 52
cannam@95 53 for (i = 0; i < sz->rnk; ++i)
cannam@95 54 n *= sz->dims[i].n;
cannam@95 55 return n;
cannam@95 56 }
cannam@95 57
cannam@95 58
cannam@95 59 /* total order among bench_iodim's */
cannam@95 60 static int dimcmp(const bench_iodim *a, const bench_iodim *b)
cannam@95 61 {
cannam@95 62 if (b->is != a->is)
cannam@95 63 return (b->is - a->is); /* shorter strides go later */
cannam@95 64 if (b->os != a->os)
cannam@95 65 return (b->os - a->os); /* shorter strides go later */
cannam@95 66 return (int)(a->n - b->n); /* larger n's go later */
cannam@95 67 }
cannam@95 68
cannam@95 69 bench_tensor *tensor_compress(const bench_tensor *sz)
cannam@95 70 {
cannam@95 71 int i, rnk;
cannam@95 72 bench_tensor *x;
cannam@95 73
cannam@95 74 BENCH_ASSERT(FINITE_RNK(sz->rnk));
cannam@95 75 for (i = rnk = 0; i < sz->rnk; ++i) {
cannam@95 76 BENCH_ASSERT(sz->dims[i].n > 0);
cannam@95 77 if (sz->dims[i].n != 1)
cannam@95 78 ++rnk;
cannam@95 79 }
cannam@95 80
cannam@95 81 x = mktensor(rnk);
cannam@95 82 for (i = rnk = 0; i < sz->rnk; ++i) {
cannam@95 83 if (sz->dims[i].n != 1)
cannam@95 84 x->dims[rnk++] = sz->dims[i];
cannam@95 85 }
cannam@95 86
cannam@95 87 if (rnk) {
cannam@95 88 /* God knows how qsort() behaves if n==0 */
cannam@95 89 qsort(x->dims, (size_t)x->rnk, sizeof(bench_iodim),
cannam@95 90 (int (*)(const void *, const void *))dimcmp);
cannam@95 91 }
cannam@95 92
cannam@95 93 return x;
cannam@95 94 }
cannam@95 95
cannam@95 96 int tensor_unitstridep(bench_tensor *t)
cannam@95 97 {
cannam@95 98 BENCH_ASSERT(FINITE_RNK(t->rnk));
cannam@95 99 return (t->rnk == 0 ||
cannam@95 100 (t->dims[t->rnk - 1].is == 1 && t->dims[t->rnk - 1].os == 1));
cannam@95 101 }
cannam@95 102
cannam@95 103 /* detect screwy real padded rowmajor... ugh */
cannam@95 104 int tensor_real_rowmajorp(bench_tensor *t, int sign, int in_place)
cannam@95 105 {
cannam@95 106 int i;
cannam@95 107
cannam@95 108 BENCH_ASSERT(FINITE_RNK(t->rnk));
cannam@95 109
cannam@95 110 i = t->rnk - 1;
cannam@95 111
cannam@95 112 if (--i >= 0) {
cannam@95 113 bench_iodim *d = t->dims + i;
cannam@95 114 if (sign < 0) {
cannam@95 115 if (d[0].is != d[1].is * (in_place ? 2*(d[1].n/2 + 1) : d[1].n))
cannam@95 116 return 0;
cannam@95 117 if (d[0].os != d[1].os * (d[1].n/2 + 1))
cannam@95 118 return 0;
cannam@95 119 }
cannam@95 120 else {
cannam@95 121 if (d[0].is != d[1].is * (d[1].n/2 + 1))
cannam@95 122 return 0;
cannam@95 123 if (d[0].os != d[1].os * (in_place ? 2*(d[1].n/2 + 1) : d[1].n))
cannam@95 124 return 0;
cannam@95 125 }
cannam@95 126 }
cannam@95 127
cannam@95 128 while (--i >= 0) {
cannam@95 129 bench_iodim *d = t->dims + i;
cannam@95 130 if (d[0].is != d[1].is * d[1].n)
cannam@95 131 return 0;
cannam@95 132 if (d[0].os != d[1].os * d[1].n)
cannam@95 133 return 0;
cannam@95 134 }
cannam@95 135 return 1;
cannam@95 136 }
cannam@95 137
cannam@95 138 int tensor_rowmajorp(bench_tensor *t)
cannam@95 139 {
cannam@95 140 int i;
cannam@95 141
cannam@95 142 BENCH_ASSERT(FINITE_RNK(t->rnk));
cannam@95 143
cannam@95 144 i = t->rnk - 1;
cannam@95 145 while (--i >= 0) {
cannam@95 146 bench_iodim *d = t->dims + i;
cannam@95 147 if (d[0].is != d[1].is * d[1].n)
cannam@95 148 return 0;
cannam@95 149 if (d[0].os != d[1].os * d[1].n)
cannam@95 150 return 0;
cannam@95 151 }
cannam@95 152 return 1;
cannam@95 153 }
cannam@95 154
cannam@95 155 static void dimcpy(bench_iodim *dst, const bench_iodim *src, int rnk)
cannam@95 156 {
cannam@95 157 int i;
cannam@95 158 if (FINITE_RNK(rnk))
cannam@95 159 for (i = 0; i < rnk; ++i)
cannam@95 160 dst[i] = src[i];
cannam@95 161 }
cannam@95 162
cannam@95 163 bench_tensor *tensor_append(const bench_tensor *a, const bench_tensor *b)
cannam@95 164 {
cannam@95 165 if (!FINITE_RNK(a->rnk) || !FINITE_RNK(b->rnk)) {
cannam@95 166 return mktensor(RNK_MINFTY);
cannam@95 167 } else {
cannam@95 168 bench_tensor *x = mktensor(a->rnk + b->rnk);
cannam@95 169 dimcpy(x->dims, a->dims, a->rnk);
cannam@95 170 dimcpy(x->dims + a->rnk, b->dims, b->rnk);
cannam@95 171 return x;
cannam@95 172 }
cannam@95 173 }
cannam@95 174
cannam@95 175 static int imax(int a, int b)
cannam@95 176 {
cannam@95 177 return (a > b) ? a : b;
cannam@95 178 }
cannam@95 179
cannam@95 180 static int imin(int a, int b)
cannam@95 181 {
cannam@95 182 return (a < b) ? a : b;
cannam@95 183 }
cannam@95 184
cannam@95 185 #define DEFBOUNDS(name, xs) \
cannam@95 186 void name(bench_tensor *t, int *lbp, int *ubp) \
cannam@95 187 { \
cannam@95 188 int lb = 0; \
cannam@95 189 int ub = 1; \
cannam@95 190 int i; \
cannam@95 191 \
cannam@95 192 BENCH_ASSERT(FINITE_RNK(t->rnk)); \
cannam@95 193 \
cannam@95 194 for (i = 0; i < t->rnk; ++i) { \
cannam@95 195 bench_iodim *d = t->dims + i; \
cannam@95 196 int n = d->n; \
cannam@95 197 int s = d->xs; \
cannam@95 198 lb = imin(lb, lb + s * (n - 1)); \
cannam@95 199 ub = imax(ub, ub + s * (n - 1)); \
cannam@95 200 } \
cannam@95 201 \
cannam@95 202 *lbp = lb; \
cannam@95 203 *ubp = ub; \
cannam@95 204 }
cannam@95 205
cannam@95 206 DEFBOUNDS(tensor_ibounds, is)
cannam@95 207 DEFBOUNDS(tensor_obounds, os)
cannam@95 208
cannam@95 209 bench_tensor *tensor_copy(const bench_tensor *sz)
cannam@95 210 {
cannam@95 211 bench_tensor *x = mktensor(sz->rnk);
cannam@95 212 dimcpy(x->dims, sz->dims, sz->rnk);
cannam@95 213 return x;
cannam@95 214 }
cannam@95 215
cannam@95 216 /* Like tensor_copy, but copy only rnk dimensions starting with start_dim. */
cannam@95 217 bench_tensor *tensor_copy_sub(const bench_tensor *sz, int start_dim, int rnk)
cannam@95 218 {
cannam@95 219 bench_tensor *x;
cannam@95 220
cannam@95 221 BENCH_ASSERT(FINITE_RNK(sz->rnk) && start_dim + rnk <= sz->rnk);
cannam@95 222 x = mktensor(rnk);
cannam@95 223 dimcpy(x->dims, sz->dims + start_dim, rnk);
cannam@95 224 return x;
cannam@95 225 }
cannam@95 226
cannam@95 227 bench_tensor *tensor_copy_swapio(const bench_tensor *sz)
cannam@95 228 {
cannam@95 229 bench_tensor *x = tensor_copy(sz);
cannam@95 230 int i;
cannam@95 231 if (FINITE_RNK(x->rnk))
cannam@95 232 for (i = 0; i < x->rnk; ++i) {
cannam@95 233 int s;
cannam@95 234 s = x->dims[i].is;
cannam@95 235 x->dims[i].is = x->dims[i].os;
cannam@95 236 x->dims[i].os = s;
cannam@95 237 }
cannam@95 238 return x;
cannam@95 239 }