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