cannam@127: /* cannam@127: * Copyright (c) 2003, 2007-14 Matteo Frigo cannam@127: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology cannam@127: * cannam@127: * This program is free software; you can redistribute it and/or modify cannam@127: * it under the terms of the GNU General Public License as published by cannam@127: * the Free Software Foundation; either version 2 of the License, or cannam@127: * (at your option) any later version. cannam@127: * cannam@127: * This program is distributed in the hope that it will be useful, cannam@127: * but WITHOUT ANY WARRANTY; without even the implied warranty of cannam@127: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the cannam@127: * GNU General Public License for more details. cannam@127: * cannam@127: * You should have received a copy of the GNU General Public License cannam@127: * along with this program; if not, write to the Free Software cannam@127: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA cannam@127: * cannam@127: */ cannam@127: cannam@127: cannam@127: #include "verify.h" cannam@127: cannam@127: static void recur(int rnk, const bench_iodim *dims0, const bench_iodim *dims1, cannam@127: dotens2_closure *k, cannam@127: int indx0, int ondx0, int indx1, int ondx1) cannam@127: { cannam@127: if (rnk == 0) cannam@127: k->apply(k, indx0, ondx0, indx1, ondx1); cannam@127: else { cannam@127: int i, n = dims0[0].n; cannam@127: int is0 = dims0[0].is; cannam@127: int os0 = dims0[0].os; cannam@127: int is1 = dims1[0].is; cannam@127: int os1 = dims1[0].os; cannam@127: cannam@127: BENCH_ASSERT(n == dims1[0].n); cannam@127: cannam@127: for (i = 0; i < n; ++i) { cannam@127: recur(rnk - 1, dims0 + 1, dims1 + 1, k, cannam@127: indx0, ondx0, indx1, ondx1); cannam@127: indx0 += is0; ondx0 += os0; cannam@127: indx1 += is1; ondx1 += os1; cannam@127: } cannam@127: } cannam@127: } cannam@127: cannam@127: void bench_dotens2(const bench_tensor *sz0, const bench_tensor *sz1, dotens2_closure *k) cannam@127: { cannam@127: BENCH_ASSERT(sz0->rnk == sz1->rnk); cannam@127: if (sz0->rnk == BENCH_RNK_MINFTY) cannam@127: return; cannam@127: recur(sz0->rnk, sz0->dims, sz1->dims, k, 0, 0, 0, 0); cannam@127: }