-
-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathsum8.cpp
232 lines (215 loc) · 4.15 KB
/
sum8.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
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
#include "v128.h"
#include <stdio.h>
#include <xbyak/xbyak.h>
#include <xbyak/xbyak_util.h>
#include "util.hpp"
int sum1(const uint8_t data[8], int n)
{
int sum = 0;
for (int i = 0; i < n; i++) {
sum += data[i];
}
return sum;
}
int sum2(const uint8_t data[8], int n)
{
int sum = 0;
switch (n) {
case 7: sum += data[6];
case 6: sum += data[5];
case 5: sum += data[4];
case 4: sum += data[3];
case 3: sum += data[2];
case 2: sum += data[1];
case 1: sum += data[0];
case 0:
break;
default:
#ifdef _WIN32
__assume(0);
#else
;
#endif
}
return sum;
}
int sum3(const uint8_t data[8], int n)
{
V128 vmask;
vmask = pcmpeqd(vmask, vmask); // all [-1]
V128 shift((8 - n) * 8);
vmask = psrlq(vmask, shift);
V128 v = V128((uint32_t*)data);
v = pand(v, vmask);
v = psadbw(v, Zero());
return movd(v);
}
int sum4_1(const uint8_t data[4], int n)
{
int sum = 0;
for (int i = 0; i < n; i++) {
sum += data[i];
}
return sum;
}
int sum4_2(const uint8_t data[4], int n)
{
int sum = 0;
switch (n) {
case 3: sum += data[2];
case 2: sum += data[1];
case 1: sum += data[0];
}
return sum;
}
int sum4_3(const uint8_t data[4], int n)
{
#if 1
uint32_t x = *reinterpret_cast<const uint32_t*>(data);
x &= (1U << (n * 8)) - 1;
V128 v(x);
v = psadbw(v, Zero());
return movd(v);
#else
V128 vmask;
vmask = pcmpeqd(vmask, vmask); // all [-1]
V128 shift((8 - n) * 8);
vmask = psrlq(vmask, shift);
V128 v = V128(*reinterpret_cast<const int*>(data));
v = pand(v, vmask);
v = psadbw(v, Zero());
return movd(v);
#endif
}
struct Code : Xbyak::CodeGenerator {
Code(char *buf, size_t size)
try
: Xbyak::CodeGenerator(size, buf)
{
Xbyak::CodeArray::protect(buf, size, true);
using namespace Xbyak;
#ifdef _WIN32
const Reg64& data = rcx;
const Reg64& n = rdx;
#else
const Reg64& data = rdi;
const Reg64& n = rsi;
#endif
#if 1
inLocalLabel();
xor(rax, rax);
test(n, n);
jz(".exit");
L(".lp");
popcnt(r8, qword [data]);
add(data, 8);
add(rax, r8);
sub(n, 1);
jnz(".lp");
L(".exit");
outLocalLabel();
#else
const Xmm& vmask = xm0;
const Xmm& shift = xm1;
const Xmm& v = xm2;
neg(n);
add(n, 8);
shl(n, 3);
movq(shift, n);
pcmpeqd(vmask, vmask);
psrlq(vmask, shift);
movq(v, ptr [data]);
pand(v, xm0);
pxor(vmask, vmask);
psadbw(v, vmask);
movq(rax, v);
#endif
ret();
} catch (Xbyak::Error err) {
printf("in ERR:%s(%d)\n", Xbyak::ConvertErrorToString(err), err);
::exit(1);
}
};
template<int dummy = 0>
struct InstanceIsHere {
static MIE_ALIGN(4096) char buf[4096];
static Code code;
};
template<int dummy>
Code InstanceIsHere<dummy>::code(buf, sizeof(buf));
template<int dummy>
char InstanceIsHere<dummy>::buf[4096];
struct DummyCall {
DummyCall() { InstanceIsHere<>::code.getCode(); }
};
int (*sumA)(const uint8_t*, int) = (int (*)(const uint8_t*, int))(char*)InstanceIsHere<>::buf;
template<class F>
void bench(const uint8_t *data, F& f)
{
XorShift128 rg;
const int N = 100000;
const int C = 1000;
Xbyak::util::Clock clk;
int ret = 0;
for (int i = 0; i < N; i++) {
clk.begin();
for (int j = 0; j < C; j++) {
ret += f(data, rg.get() % 8);
}
clk.end();
}
printf("ret=%x clk=%f\n", ret, clk.getClock() / double(N) / C);
}
template<class F>
void bench4(const uint8_t *data, F& f)
{
XorShift128 rg;
const int N = 100000;
const int C = 1000;
Xbyak::util::Clock clk;
int ret = 0;
for (int i = 0; i < N; i++) {
clk.begin();
for (int j = 0; j < C; j++) {
ret += f(data, rg.get() % 4);
}
clk.end();
}
printf("ret=%x clk=%f\n", ret, clk.getClock() / double(N) / C);
}
int dummy(const uint8_t*, int)
{
return 0;
}
int main()
try
{
MIE_ALIGN(16) uint8_t data[64] = {};
for (int i = 1; i <= 8; i++) {
data[i - i] = i * i;
}
#if 0
bench(data, dummy);
puts("dummy");
bench(data, dummy);
puts("sum1");
bench(data, sum1);
puts("sum2");
bench(data, sum2);
puts("sum3");
bench(data, sum3);
#endif
bench4(data, dummy);
puts("----------");
puts("sum4_1");
bench4(data, sum4_1);
puts("sum4_2");
bench4(data, sum4_2);
puts("sum4_3");
bench4(data, sum4_3);
// puts("sumA");
// bench(data, sumA);
} catch (Xbyak::Error err) {
printf("ERR:%s(%d)\n", Xbyak::ConvertErrorToString(err), err);
::exit(1);
}