1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
/*
This file is part of FFTS -- The Fastest Fourier Transform in the South
Copyright (c) 2012, Anthony M. Blake <amb@anthonix.com>
Copyright (c) 2012, The University of Waikato
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the organization nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL ANTHONY M. BLAKE BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef FFTS_INTERNAL_H
#define FFTS_INTERNAL_H
//#include "config.h"
//#include "codegen.h"
#include "ffts_attributes.h"
#include "types.h"
#include <malloc.h>
#include <math.h>
#include <stddef.h>
#ifdef HAVE_STDINT_H
#include <stdint.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#include <stdio.h>
#define FFTS_PREFIX ffts
#ifndef FFTS_CAT_PREFIX2
#define FFTS_CAT_PREFIX2(a,b) a ## b
#endif
#ifndef FFTS_CAT_PREFIX
#define FFTS_CAT_PREFIX(a,b) FFTS_CAT_PREFIX2(a ## _, b)
#endif
/* prevent symbol name clashes */
#ifdef FFTS_PREFIX
#define FUNC_TO_REWRITE FFTS_CAT_PREFIX(FFTS_PREFIX, FUNC_TO_REWRITE)
#endif
#ifdef __ANDROID__
#include <android/log.h>
#define LOG(s) __android_log_print(ANDROID_LOG_ERROR, "FFTS", s)
#else
#define LOG(s) fprintf(stderr, s)
#endif
#ifndef M_PI
#define M_PI 3.1415926535897932384626433832795028841971693993751058209
#endif
typedef void (*transform_func_t)(ffts_plan_t *p, const void *in, void *out);
/**
* Contains all the Information need to perform FFT
*
*
* DO NOT CHANGE THE ORDER OF MEMBERS
* ASSEMBLY CODE USES HARD CODED OFFSETS TO REFERENCE
* SOME OF THESE VARIABES!!
*/
struct _ffts_plan_t {
/**
*
*/
ptrdiff_t *offsets;
#ifdef DYNAMIC_DISABLED
/**
* Twiddle factors
*/
void *ws;
/**
* ee - 2 size x size8
* oo - 2 x size4 in parallel
* oe -
*/
void *oe_ws, *eo_ws, *ee_ws;
#else
void FFTS_ALIGN(32) *ws;
void FFTS_ALIGN(32) *oe_ws, *eo_ws, *ee_ws;
#endif
/**
* Pointer into an array of precomputed indexes for the input data array
*/
ptrdiff_t *is;
/**
* Twiddle Factor Indexes
*/
size_t *ws_is;
/**
* Size of the loops for the base cases
*/
size_t i0, i1, n_luts;
/**
* Size fo the Transform
*/
size_t N;
void *lastlut;
size_t *temporary_fix_as_dynamic_code_assumes_fixed_offset;
/**
* Pointer to the dynamically generated function
* that will execute the FFT
*/
transform_func_t transform;
/**
* Pointer to the base memory address of
* of the transform function
*/
void *transform_base;
/**
* Size of the memory block contain the
* generated code
*/
size_t transform_size;
/**
* Points to the cosnant variables used by
* the Assembly Code
*/
void *constants;
// multi-dimensional stuff:
struct _ffts_plan_t **plans;
int rank;
size_t *Ns, *Ms;
void *buf;
void *transpose_buf;
/**
* Pointer to the destroy function
* to clean up the plan after use
* (differs for real and multi dimension transforms
*/
void (*destroy)(ffts_plan_t *);
/**
* Coefficiants for the real valued transforms
*/
float *A, *B;
size_t i2;
};
static FFTS_INLINE void *ffts_aligned_malloc(size_t size)
{
#if defined(_WIN32)
return _aligned_malloc(size, 32);
#else
return valloc(size);
#endif
}
static FFTS_INLINE void ffts_aligned_free(void *p)
{
#if defined(_MSC_VER)
_aligned_free(p);
#else
free(p);
#endif
}
#if GCC_VERSION_AT_LEAST(3,3)
#define ffts_ctzl __builtin_ctzl
#elif defined(_MSC_VER)
#include <intrin.h>
#ifdef _M_X64
#pragma intrinsic(_BitScanForward64)
static __inline unsigned long ffts_ctzl(size_t N)
{
unsigned long count;
_BitScanForward64((unsigned long*) &count, N);
return count;
}
#else
#pragma intrinsic(_BitScanForward)
static __inline unsigned long ffts_ctzl(size_t N)
{
unsigned long count;
_BitScanForward((unsigned long*) &count, N);
return count;
}
#endif /* _WIN64 */
#endif /* _MSC_VER */
#endif /* FFTS_INTERNAL_H */
|
