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
|
/*
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_MACROS_SSE_H
#define FFTS_MACROS_SSE_H
#if defined (_MSC_VER) && (_MSC_VER >= 1020)
#pragma once
#endif
#include <xmmintrin.h>
#define FFTS_MALLOC(d,a) (_mm_malloc(d,a))
#define FFTS_FREE(d) (_mm_free(d))
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)))
#define V4SF_UNPACK_HI(x,y) \
(_mm_shuffle_ps(x, y, _MM_SHUFFLE(3,2,3,2)))
#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);
}
#endif /* FFTS_MACROS_SSE_H */
|
