46 lines
1.2 KiB
C
46 lines
1.2 KiB
C
/*
|
|
* Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
* Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*
|
|
*/
|
|
|
|
#include "kernel/ifftw.h"
|
|
|
|
const INT X(an_INT_guaranteed_to_be_zero) = 0;
|
|
|
|
#ifdef PRECOMPUTE_ARRAY_INDICES
|
|
stride X(mkstride)(INT n, INT s)
|
|
{
|
|
int i;
|
|
INT *p;
|
|
|
|
A(n >= 0);
|
|
p = (INT *) MALLOC((size_t)n * sizeof(INT), STRIDES);
|
|
|
|
for (i = 0; i < n; ++i)
|
|
p[i] = s * i;
|
|
|
|
return p;
|
|
}
|
|
|
|
void X(stride_destroy)(stride p)
|
|
{
|
|
X(ifree0)(p);
|
|
}
|
|
|
|
#endif
|