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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
|
/*
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
Copyright (c) 2018, Jukka Ojanen <jukka.ojanen@kolumbus.fi>
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_MACROS_SSE_H
#define FFTS_MACROS_SSE_H
#if defined (_MSC_VER) && (_MSC_VER >= 1020)
#pragma once
#endif
#include <xmmintrin.h>
typedef __m128 V4SF;
#define V4SF_ADD _mm_add_ps
#define V4SF_SUB _mm_sub_ps
#define V4SF_MUL _mm_mul_ps
#define V4SF_LIT4 _mm_set_ps
#define V4SF_XOR _mm_xor_ps
#define V4SF_ST _mm_store_ps
#define V4SF_LD _mm_load_ps
#define V4SF_SWAP_PAIRS(x) \
(_mm_shuffle_ps(x, x, _MM_SHUFFLE(2,3,0,1)))
/* note: order is swapped */
#define V4SF_UNPACK_HI(x,y) \
(_mm_movehl_ps(y, x))
#define V4SF_UNPACK_LO(x,y) \
(_mm_movelh_ps(x, y))
#define V4SF_BLEND(x, y) \
(_mm_shuffle_ps(x, y, _MM_SHUFFLE(3,2,1,0)))
#define V4SF_DUPLICATE_RE(r) \
(_mm_shuffle_ps(r, r, _MM_SHUFFLE(2,2,0,0)))
#define V4SF_DUPLICATE_IM(r) \
(_mm_shuffle_ps(r, r, _MM_SHUFFLE(3,3,1,1)))
static FFTS_ALWAYS_INLINE V4SF
V4SF_IMULI(int inv, V4SF a)
{
if (inv) {
return V4SF_SWAP_PAIRS(V4SF_XOR(a, V4SF_LIT4(0.0f, -0.0f, 0.0f, -0.0f)));
} else {
return V4SF_SWAP_PAIRS(V4SF_XOR(a, V4SF_LIT4(-0.0f, 0.0f, -0.0f, 0.0f)));
}
}
static FFTS_ALWAYS_INLINE V4SF
V4SF_IMUL(V4SF d, V4SF re, V4SF im)
{
re = V4SF_MUL(re, d);
im = V4SF_MUL(im, V4SF_SWAP_PAIRS(d));
return V4SF_SUB(re, im);
}
static FFTS_ALWAYS_INLINE V4SF
V4SF_IMULJ(V4SF d, V4SF re, V4SF im)
{
re = V4SF_MUL(re, d);
im = V4SF_MUL(im, V4SF_SWAP_PAIRS(d));
return V4SF_ADD(re, im);
}
#ifdef FFTS_DOUBLE
typedef union {
struct {
double r1;
double i1;
double r2;
double i2;
} r;
uint32_t u[8];
} V4DF;
static FFTS_ALWAYS_INLINE V4DF
V4DF_LIT4(double f3, double f2, double f1, double f0)
{
V4DF z;
z.r.r1 = f0;
z.r.i1 = f1;
z.r.r2 = f2;
z.r.i2 = f3;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_ADD(V4DF x, V4DF y)
{
V4DF z;
z.r.r1 = x.r.r1 + y.r.r1;
z.r.i1 = x.r.i1 + y.r.i1;
z.r.r2 = x.r.r2 + y.r.r2;
z.r.i2 = x.r.i2 + y.r.i2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_SUB(V4DF x, V4DF y)
{
V4DF z;
z.r.r1 = x.r.r1 - y.r.r1;
z.r.i1 = x.r.i1 - y.r.i1;
z.r.r2 = x.r.r2 - y.r.r2;
z.r.i2 = x.r.i2 - y.r.i2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_MUL(V4DF x, V4DF y)
{
V4DF z;
z.r.r1 = x.r.r1 * y.r.r1;
z.r.i1 = x.r.i1 * y.r.i1;
z.r.r2 = x.r.r2 * y.r.r2;
z.r.i2 = x.r.i2 * y.r.i2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_XOR(V4DF x, V4DF y)
{
V4DF z;
z.u[0] = x.u[0] ^ y.u[0];
z.u[1] = x.u[1] ^ y.u[1];
z.u[2] = x.u[2] ^ y.u[2];
z.u[3] = x.u[3] ^ y.u[3];
z.u[4] = x.u[4] ^ y.u[4];
z.u[5] = x.u[5] ^ y.u[5];
z.u[6] = x.u[6] ^ y.u[6];
z.u[7] = x.u[7] ^ y.u[7];
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_SWAP_PAIRS(V4DF x)
{
V4DF z;
z.r.r1 = x.r.i1;
z.r.i1 = x.r.r1;
z.r.r2 = x.r.i2;
z.r.i2 = x.r.r2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_BLEND(V4DF x, V4DF y)
{
V4DF z;
z.r.r1 = x.r.r1;
z.r.i1 = x.r.i1;
z.r.r2 = y.r.r2;
z.r.i2 = y.r.i2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_UNPACK_HI(V4DF x, V4DF y)
{
V4DF z;
z.r.r1 = x.r.r2;
z.r.i1 = x.r.i2;
z.r.r2 = y.r.r2;
z.r.i2 = y.r.i2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_UNPACK_LO(V4DF x, V4DF y)
{
V4DF z;
z.r.r1 = x.r.r1;
z.r.i1 = x.r.i1;
z.r.r2 = y.r.r1;
z.r.i2 = y.r.i1;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_DUPLICATE_RE(V4DF x)
{
V4DF z;
z.r.r1 = x.r.r1;
z.r.i1 = x.r.r1;
z.r.r2 = x.r.r2;
z.r.i2 = x.r.r2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_DUPLICATE_IM(V4DF x)
{
V4DF z;
z.r.r1 = x.r.i1;
z.r.i1 = x.r.i1;
z.r.r2 = x.r.i2;
z.r.i2 = x.r.i2;
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_IMUL(V4DF d, V4DF re, V4DF im)
{
re = V4DF_MUL(re, d);
im = V4DF_MUL(im, V4DF_SWAP_PAIRS(d));
return V4DF_SUB(re, im);
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_IMULJ(V4DF d, V4DF re, V4DF im)
{
re = V4DF_MUL(re, d);
im = V4DF_MUL(im, V4DF_SWAP_PAIRS(d));
return V4DF_ADD(re, im);
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_MULI(int inv, V4DF x)
{
V4DF z;
if (inv) {
z.r.r1 = -x.r.r1;
z.r.i1 = x.r.i1;
z.r.r2 = -x.r.r2;
z.r.i2 = x.r.i2;
} else {
z.r.r1 = x.r.r1;
z.r.i1 = -x.r.i1;
z.r.r2 = x.r.r2;
z.r.i2 = -x.r.i2;
}
return z;
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_IMULI(int inv, V4DF x)
{
return V4DF_SWAP_PAIRS(V4DF_MULI(inv, x));
}
static FFTS_ALWAYS_INLINE V4DF
V4DF_LD(const void *s)
{
V4DF z;
memcpy(&z, s, sizeof(z));
return z;
}
static FFTS_ALWAYS_INLINE void
V4DF_ST(void *d, V4DF s)
{
V4DF *r = (V4DF*) d;
*r = s;
}
#endif
#endif /* FFTS_MACROS_SSE_H */
|
