-
-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathbitrv.cpp
161 lines (153 loc) · 2.84 KB
/
bitrv.cpp
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
#define XBYAK_NO_OP_NAMES
#include <xbyak/xbyak.h>
#include <memory.h>
void change(double * /* a */, int k1, int j1)
{
#if 1
printf("__m128d x = _mm_load_pd(a + %d);\n", j1);
printf("__m128d y = _mm_load_pd(a + %d);\n", k1);
printf("_mm_store_pd(a + %d, y);\n", j1);
printf("_mm_store_pd(a + %d, x);\n", k1);
#else
__m128d x = _mm_load_pd(a + j1);
__m128d y = _mm_load_pd(a + k1);
_mm_store_pd(a + j1, y);
_mm_store_pd(a + k1, x);
#endif
}
void bitrv2_C(int n, int *ip, double *a)
{
int j, j1, k, k1, l, m, m2;
ip[0] = 0;
l = n;
m = 1;
while ((m << 3) < l) {
l >>= 1;
for (j = 0; j < m; j++) {
ip[m + j] = ip[j] + l;
}
m <<= 1;
}
m2 = 2 * m;
if ((m << 3) == l) {
for (k = 0; k < m; k++) {
for (j = 0; j < k; j++) {
j1 = 2 * j + ip[k];
k1 = 2 * k + ip[j];
change(a, j1, k1);
j1 += m2;
k1 += 2 * m2;
change(a, j1, k1);
j1 += m2;
k1 -= m2;
change(a, j1, k1);
j1 += m2;
k1 += 2 * m2;
change(a, j1, k1);
}
j1 = 2 * k + m2 + ip[k];
k1 = j1 + m2;
change(a, j1, k1);
}
} else {
for (k = 1; k < m; k++) {
for (j = 0; j < k; j++) {
j1 = 2 * j + ip[k];
k1 = 2 * k + ip[j];
change(a, j1, k1);
j1 += m2;
k1 += m2;
change(a, j1, k1);
}
}
}
}
struct Code : Xbyak::CodeGenerator {
Code(int n)
{
int ip[512];
gen_bitrv2(n, ip);
}
void change(const Xbyak::Reg32e& a, int k1, int j1)
{
movapd(xm0, ptr [a + j1 * 8]);
movapd(xm1, ptr [a + k1 * 8]);
movapd(ptr [a + j1 * 8], xm1);
movapd(ptr [a + k1 * 8], xm0);
}
// void bitrv2(double *x);
void gen_bitrv2(int n, int *ip)
{
using namespace Xbyak;
#if defined(XBYAK32)
const Reg32& a = eax;
mov(eax, ptr [esp + 4]);
#elif defined(XBYAK64_WIN)
const Reg64& a = r8;
#else
const Reg64& a = rdi;
#endif
int j, j1, k, k1, l, m, m2;
ip[0] = 0;
l = n;
m = 1;
while ((m << 3) < l) {
l >>= 1;
for (j = 0; j < m; j++) {
ip[m + j] = ip[j] + l;
}
m <<= 1;
}
m2 = 2 * m;
if ((m << 3) == l) {
for (k = 0; k < m; k++) {
for (j = 0; j < k; j++) {
j1 = 2 * j + ip[k];
k1 = 2 * k + ip[j];
change(a, j1, k1);
j1 += m2;
k1 += 2 * m2;
change(a, j1, k1);
j1 += m2;
k1 -= m2;
change(a, j1, k1);
j1 += m2;
k1 += 2 * m2;
change(a, j1, k1);
}
j1 = 2 * k + m2 + ip[k];
k1 = j1 + m2;
change(a, j1, k1);
}
} else {
for (k = 1; k < m; k++) {
for (j = 0; j < k; j++) {
j1 = 2 * j + ip[k];
k1 = 2 * k + ip[j];
change(a, j1, k1);
j1 += m2;
k1 += m2;
change(a, j1, k1);
}
}
}
ret();
}
};
int main()
try
{
MIE_ALIGN(16) double a[4096];
{
int ip[512];
bitrv2_C(64, ip, a);
}
Code c(64);
memset(a, 0, sizeof(a));
void (*f)(double *) = (void (*)(double*))c.getCode();
printf("ptr=%p\n", a);
f(a);
} catch (std::exception& e) {
printf("ERR:%s\n", e.what());
return 1;
}