annotate fft/fftw/fftw-3.3.4/kernel/stride.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 #include "ifftw.h"
Chris@19 22
Chris@19 23 const INT X(an_INT_guaranteed_to_be_zero) = 0;
Chris@19 24
Chris@19 25 #ifdef PRECOMPUTE_ARRAY_INDICES
Chris@19 26 stride X(mkstride)(INT n, INT s)
Chris@19 27 {
Chris@19 28 int i;
Chris@19 29 INT *p = (INT *) MALLOC(n * sizeof(INT), STRIDES);
Chris@19 30
Chris@19 31 for (i = 0; i < n; ++i)
Chris@19 32 p[i] = s * i;
Chris@19 33
Chris@19 34 return p;
Chris@19 35 }
Chris@19 36
Chris@19 37 void X(stride_destroy)(stride p)
Chris@19 38 {
Chris@19 39 X(ifree0)(p);
Chris@19 40 }
Chris@19 41
Chris@19 42 #endif