annotate src/fftw-3.3.3/kernel/tensor.c @ 23:619f715526df sv_v2.1

Update Vamp plugin SDK to 2.5
author Chris Cannam
date Thu, 09 May 2013 10:52:46 +0100
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 /*
Chris@10 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 4 *
Chris@10 5 * This program is free software; you can redistribute it and/or modify
Chris@10 6 * it under the terms of the GNU General Public License as published by
Chris@10 7 * the Free Software Foundation; either version 2 of the License, or
Chris@10 8 * (at your option) any later version.
Chris@10 9 *
Chris@10 10 * This program is distributed in the hope that it will be useful,
Chris@10 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 13 * GNU General Public License for more details.
Chris@10 14 *
Chris@10 15 * You should have received a copy of the GNU General Public License
Chris@10 16 * along with this program; if not, write to the Free Software
Chris@10 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 18 *
Chris@10 19 */
Chris@10 20
Chris@10 21
Chris@10 22 #include "ifftw.h"
Chris@10 23
Chris@10 24 tensor *X(mktensor)(int rnk)
Chris@10 25 {
Chris@10 26 tensor *x;
Chris@10 27
Chris@10 28 A(rnk >= 0);
Chris@10 29
Chris@10 30 #if defined(STRUCT_HACK_KR)
Chris@10 31 if (FINITE_RNK(rnk) && rnk > 1)
Chris@10 32 x = (tensor *)MALLOC(sizeof(tensor) + (rnk - 1) * sizeof(iodim),
Chris@10 33 TENSORS);
Chris@10 34 else
Chris@10 35 x = (tensor *)MALLOC(sizeof(tensor), TENSORS);
Chris@10 36 #elif defined(STRUCT_HACK_C99)
Chris@10 37 if (FINITE_RNK(rnk))
Chris@10 38 x = (tensor *)MALLOC(sizeof(tensor) + rnk * sizeof(iodim),
Chris@10 39 TENSORS);
Chris@10 40 else
Chris@10 41 x = (tensor *)MALLOC(sizeof(tensor), TENSORS);
Chris@10 42 #else
Chris@10 43 x = (tensor *)MALLOC(sizeof(tensor), TENSORS);
Chris@10 44 if (FINITE_RNK(rnk) && rnk > 0)
Chris@10 45 x->dims = (iodim *)MALLOC(sizeof(iodim) * rnk, TENSORS);
Chris@10 46 else
Chris@10 47 x->dims = 0;
Chris@10 48 #endif
Chris@10 49
Chris@10 50 x->rnk = rnk;
Chris@10 51 return x;
Chris@10 52 }
Chris@10 53
Chris@10 54 void X(tensor_destroy)(tensor *sz)
Chris@10 55 {
Chris@10 56 #if !defined(STRUCT_HACK_C99) && !defined(STRUCT_HACK_KR)
Chris@10 57 X(ifree0)(sz->dims);
Chris@10 58 #endif
Chris@10 59 X(ifree)(sz);
Chris@10 60 }
Chris@10 61
Chris@10 62 INT X(tensor_sz)(const tensor *sz)
Chris@10 63 {
Chris@10 64 int i;
Chris@10 65 INT n = 1;
Chris@10 66
Chris@10 67 if (!FINITE_RNK(sz->rnk))
Chris@10 68 return 0;
Chris@10 69
Chris@10 70 for (i = 0; i < sz->rnk; ++i)
Chris@10 71 n *= sz->dims[i].n;
Chris@10 72 return n;
Chris@10 73 }
Chris@10 74
Chris@10 75 void X(tensor_md5)(md5 *p, const tensor *t)
Chris@10 76 {
Chris@10 77 int i;
Chris@10 78 X(md5int)(p, t->rnk);
Chris@10 79 if (FINITE_RNK(t->rnk)) {
Chris@10 80 for (i = 0; i < t->rnk; ++i) {
Chris@10 81 const iodim *q = t->dims + i;
Chris@10 82 X(md5INT)(p, q->n);
Chris@10 83 X(md5INT)(p, q->is);
Chris@10 84 X(md5INT)(p, q->os);
Chris@10 85 }
Chris@10 86 }
Chris@10 87 }
Chris@10 88
Chris@10 89 /* treat a (rank <= 1)-tensor as a rank-1 tensor, extracting
Chris@10 90 appropriate n, is, and os components */
Chris@10 91 int X(tensor_tornk1)(const tensor *t, INT *n, INT *is, INT *os)
Chris@10 92 {
Chris@10 93 A(t->rnk <= 1);
Chris@10 94 if (t->rnk == 1) {
Chris@10 95 const iodim *vd = t->dims;
Chris@10 96 *n = vd[0].n;
Chris@10 97 *is = vd[0].is;
Chris@10 98 *os = vd[0].os;
Chris@10 99 } else {
Chris@10 100 *n = 1;
Chris@10 101 *is = *os = 0;
Chris@10 102 }
Chris@10 103 return 1;
Chris@10 104 }
Chris@10 105
Chris@10 106 void X(tensor_print)(const tensor *x, printer *p)
Chris@10 107 {
Chris@10 108 if (FINITE_RNK(x->rnk)) {
Chris@10 109 int i;
Chris@10 110 int first = 1;
Chris@10 111 p->print(p, "(");
Chris@10 112 for (i = 0; i < x->rnk; ++i) {
Chris@10 113 const iodim *d = x->dims + i;
Chris@10 114 p->print(p, "%s(%D %D %D)",
Chris@10 115 first ? "" : " ",
Chris@10 116 d->n, d->is, d->os);
Chris@10 117 first = 0;
Chris@10 118 }
Chris@10 119 p->print(p, ")");
Chris@10 120 } else {
Chris@10 121 p->print(p, "rank-minfty");
Chris@10 122 }
Chris@10 123 }