/
testintdiv.cpp
executable file
·453 lines (390 loc) · 16.3 KB
/
testintdiv.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
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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
/**
* This code is released under the
* Apache License Version 2.0 http://www.apache.org/licenses/.
*
* (c) Leonid Boytsov, http://boytsov.info
*
* Implementing ideas of Nathan Kurz: let's vectorize integer division
* by converting integers to floating-point numbers
*/
#include "cmn.h"
#if defined __SSE2__
#include "vectori128.h"
#endif
using namespace std;
void testDiv16Scalar(size_t N, size_t rep,
uint16_t b1, uint16_t b2, uint16_t b3, uint16_t b4,
uint16_t b5, uint16_t b6, uint16_t b7, uint16_t b8,
uint16_t c1, uint16_t c2, uint16_t c3, uint16_t c4,
uint16_t c5, uint16_t c6, uint16_t c7, uint16_t c8
) {
uint32_t sum = 0;
WallClockTimer timer;
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
sum += b1/c1; b1++;
sum += b2/c2; b2++;
sum += b3/c3; b3++;
sum += b4/c4; b4++;
sum += b5/c5; b5++;
sum += b6/c6; b6++;
sum += b7/c7; b7++;
sum += b8/c8; b8++;
}
}
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 8;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "16-bit Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint16_t).name() << endl;
cout << "Milllions of 16-bit integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv16VectorFloat(size_t N, size_t rep,
uint16_t b1, uint16_t b2, uint16_t b3, uint16_t b4,
uint16_t b5, uint16_t b6, uint16_t b7, uint16_t b8,
uint16_t c1, uint16_t c2, uint16_t c3, uint16_t c4,
uint16_t c5, uint16_t c6, uint16_t c7, uint16_t c8) {
uint32_t sum = 0;
WallClockTimer timer;
#if defined __SSE4_1__
__m128 B, C, R;
__m128i Bi;
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
B = _mm_cvtepi32_ps(_mm_set_epi32(b4, b3, b2, b1));
b1++; b2++; b3++; b4++;
C = _mm_cvtepi32_ps(_mm_set_epi32(c4, c3, c2, c1));
R = _mm_div_ps(B, C);
Bi = _mm_cvttps_epi32(R);
sum += _mm_extract_epi32(Bi, 0);
sum += _mm_extract_epi32(Bi, 1);
sum += _mm_extract_epi32(Bi, 2);
sum += _mm_extract_epi32(Bi, 3);
B = _mm_cvtepi32_ps(_mm_set_epi32(b8, b7, b6, b5));
b5++; b6++; b7++; b8++;
C = _mm_cvtepi32_ps(_mm_set_epi32(c8, c7, c6, c5));
R = _mm_div_ps(B, C);
Bi = _mm_cvttps_epi32(R);
sum += _mm_extract_epi32(Bi, 0);
sum += _mm_extract_epi32(Bi, 1);
sum += _mm_extract_epi32(Bi, 2);
sum += _mm_extract_epi32(Bi, 3);
}
}
#endif
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 8;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "Integer 16-bit DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of 16-bit integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv16VectorFloatAvx(size_t N, size_t rep,
uint16_t b1, uint16_t b2, uint16_t b3, uint16_t b4,
uint16_t b5, uint16_t b6, uint16_t b7, uint16_t b8,
uint16_t c1, uint16_t c2, uint16_t c3, uint16_t c4,
uint16_t c5, uint16_t c6, uint16_t c7, uint16_t c8) {
uint32_t sum = 0;
WallClockTimer timer;
#if defined __AVX__
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
__m256 B = _mm256_cvtepi32_ps(_mm256_set_epi32(b8, b7, b6, b5, b4, b3, b2, b1));
b1++; b2++; b3++; b4++; b5++; b6++; b7++; b8++;
__m256 C = _mm256_cvtepi32_ps(_mm256_set_epi32(c8, c7, c6, c5, c4, c3, c2, c1));
__m256 R = _mm256_div_ps(B, C);
__m128 v1 = _mm256_extractf128_ps(R, 0);
__m128i Bi1 = _mm_cvttps_epi32(v1);
sum += _mm_extract_epi32(Bi1, 0);
sum += _mm_extract_epi32(Bi1, 1);
sum += _mm_extract_epi32(Bi1, 2);
sum += _mm_extract_epi32(Bi1, 3);
__m128 v2 = _mm256_extractf128_ps(R, 1);
__m128i Bi2 = _mm_cvttps_epi32(v2);
sum += _mm_extract_epi32(Bi2, 0);
sum += _mm_extract_epi32(Bi2, 1);
sum += _mm_extract_epi32(Bi2, 2);
sum += _mm_extract_epi32(Bi2, 3);
}
}
#endif
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 8;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "Integer 16-bit DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of 16-bit integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
/*
* This function uses files from the Agner's vector class library:
* http://www.agner.org/optimize/#vectorclass
*
* These files are distributed under the GNU license v 3, for details see:
* http://www.gnu.org/licenses/quick-guide-gplv3.html
*
*/
void testDiv32AgnerOneDiv(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c) {
uint32_t sum = 0;
WallClockTimer timer;
#if __SSE2__
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
Vec4ui B(b4, b3, b2, b1);
Vec4ui D = B / c;
b1++; b2++; b3++; b4++;
sum += D[0] + D[1] + D[2] + D[3];
}
}
#endif
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "32-bit Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of 32-bit integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv32ScalarOneDiv(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c) {
uint32_t sum = 0;
WallClockTimer timer;
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
sum += b1/c; b1++;
sum += b2/c; b2++;
sum += b3/c; b3++;
sum += b4/c; b4++;
}
}
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "32-bit Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of 32-bit integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv32Scalar(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c1, uint32_t c2, uint32_t c3, uint32_t c4) {
uint32_t sum = 0;
WallClockTimer timer;
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
sum += b1/c1; b1++;
sum += b2/c2; b2++;
sum += b3/c3; b3++;
sum += b4/c4; b4++;
}
}
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "32-bit Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of 32-bit integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv32Double(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c1, uint32_t c2, uint32_t c3, uint32_t c4) {
uint32_t sum = 0;
WallClockTimer timer;
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
sum += uint32_t(double(b1)/c1); b1++;
sum += uint32_t(double(b2)/c2); b2++;
sum += uint32_t(double(b3)/c3); b3++;
sum += uint32_t(double(b4)/c4); b4++;
}
}
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "32-bit Integer DIVs computed via conversion to double: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of 32-bit integer DIVs via conversion to double per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv32VectorDouble(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c1, uint32_t c2, uint32_t c3, uint32_t c4) {
uint32_t sum = 0;
WallClockTimer timer;
#if defined __SSE4_1__
__m128d B, C, R;
__m128i Bi;
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
B = _mm_cvtepi32_pd(_mm_set_epi32(0, 0, b2, b1));
b1++; b2++;
C = _mm_cvtepi32_pd(_mm_set_epi32(0, 0, c2, c1));
R = _mm_div_pd(B, C);
Bi = _mm_cvttpd_epi32(R);
sum += _mm_extract_epi32(Bi, 0);
sum += _mm_extract_epi32(Bi, 1);
B = _mm_cvtepi32_pd(_mm_set_epi32(0, 0, b4, b3));
b3++; b4++;
C = _mm_cvtepi32_pd(_mm_set_epi32(0, 0, c4, c3));
R = _mm_div_pd(B, C);
Bi = _mm_cvttpd_epi32(R);
sum += _mm_extract_epi32(Bi, 0);
sum += _mm_extract_epi32(Bi, 1);
}
}
#endif
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
void testDiv32VectorAVXDouble(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c1, uint32_t c2, uint32_t c3, uint32_t c4) {
uint32_t sum = 0;
WallClockTimer timer;
#if defined __AVX__
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
__m256d B = _mm256_cvtepi32_pd(_mm_set_epi32(b4, b3, b2, b1));
b1++; b2++; b3++; b4++;
__m256d C = _mm256_cvtepi32_pd(_mm_set_epi32(c4, c3, c2, c1));
__m256d R = _mm256_div_pd(B, C);
__m128i Bi = _mm256_cvttpd_epi32(R);
sum += _mm_extract_epi32(Bi, 0);
sum += _mm_extract_epi32(Bi, 1);
sum += _mm_extract_epi32(Bi, 2);
sum += _mm_extract_epi32(Bi, 3);
}
}
#endif
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
#ifdef __INTEL_COMPILER
void testDiv32VectorIntel(size_t N, size_t rep,
uint32_t b1, uint32_t b2, uint32_t b3, uint32_t b4,
uint32_t c1, uint32_t c2, uint32_t c3, uint32_t c4) {
uint32_t sum = 0;
WallClockTimer timer;
__m128i C = _mm_set_epi32(c4, c3, c2, c1);
for(size_t j = 0; j < N; j++){
for(size_t i = 0; i < rep; ++i) {
__m128i B = _mm_set_epi32(b4, b3, b2, b1);
b1++; b2++; b3++; b4++;
__m128i R = _mm_div_epi32(B, C);
sum += _mm_extract_epi32(R, 0);
sum += _mm_extract_epi32(R, 1);
sum += _mm_extract_epi32(R, 2);
sum += _mm_extract_epi32(R, 3);
}
}
timer.split();
uint64_t t = timer.elapsed();
uint64_t TotalQty = rep * N * 4;
cout << __func__ << endl;
cout << "Ignore: " << sum << endl;
cout << "Integer DIVs computed: " << TotalQty << ", time " << t / 1e3 << " ms, type: " << typeid(uint32_t).name() << endl;
cout << "Milllions of integer DIVs per sec: " << (float(TotalQty) / t) << endl;
cout << "=============================" << endl;
}
#endif
void TestSmallNum() {
/*
* A catch: doesn't work with large unsigned integers,
* because all conversion routines assume integers being signed
*/
const uint32_t MULT= 128;
uint32_t b1=MULT * (rand() % 256) + rand() % 256;
uint32_t b2=MULT * (rand() % 256) + rand() % 256;
uint32_t b3=MULT * (rand() % 256) + rand() % 256;
uint32_t b4=MULT * (rand() % 256) + rand() % 256;
uint32_t b5=MULT * (rand() % 256) + rand() % 256;
uint32_t b6=MULT * (rand() % 256) + rand() % 256;
uint32_t b7=MULT * (rand() % 256) + rand() % 256;
uint32_t b8=MULT * (rand() % 256) + rand() % 256;
uint32_t c1=4 * (rand() % 256) + rand() % 256;
uint32_t c2=4 * (rand() % 256) + rand() % 256;
uint32_t c3=4 * (rand() % 256) + rand() % 256;
uint32_t c4=4 * (rand() % 256) + rand() % 256;
uint32_t c5=4 * (rand() % 256) + rand() % 256;
uint32_t c6=4 * (rand() % 256) + rand() % 256;
uint32_t c7=4 * (rand() % 256) + rand() % 256;
uint32_t c8=4 * (rand() % 256) + rand() % 256;
cout << b1 << " -> " << c1 << ": " << b1/c1 << endl;
cout << b2 << " -> " << c2 << ": " << b2/c2 << endl;
cout << b3 << " -> " << c3 << ": " << b3/c3 << endl;
cout << b4 << " -> " << c4 << ": " << b4/c4 << endl;
cout << b5 << " -> " << c5 << ": " << b5/c5 << endl;
cout << b6 << " -> " << c6 << ": " << b6/c6 << endl;
cout << b7 << " -> " << c7 << ": " << b7/c7 << endl;
cout << b8 << " -> " << c8 << ": " << b8/c8 << endl;
cout << "=============================" << endl;
testDiv16Scalar(2000000, 16, b1, b2, b3, b4, b5, b6, b7, b8,
c1, c2, c3, c4, c5, c6, c7, c8);
testDiv16VectorFloat(2000000, 16, b1, b2, b3, b4, b5, b6, b7, b8,
c1, c2, c3, c4, c5, c6, c7, c8);
testDiv16VectorFloatAvx(2000000, 16, b1, b2, b3, b4, b5, b6, b7, b8,
c1, c2, c3, c4, c5, c6, c7, c8);
}
void TestLargeNum() {
/*
* A catch: doesn't work with large unsigned integers,
* because all conversion routines assume integers being signed
*/
#if 0
const uint32_t MULT= 65536;
#else
const uint32_t MULT= 32768;
#endif
uint32_t b1=MULT * (rand() % 65536) + rand() % 65536;
uint32_t b2=MULT * (rand() % 65536) + rand() % 65536;
uint32_t b3=MULT * (rand() % 65536) + rand() % 65536;
uint32_t b4=MULT * (rand() % 65536) + rand() % 65536;
uint32_t c1=128 * (rand() % 65536) + rand() % 65536;
uint32_t c2=128 * (rand() % 65536) + rand() % 65536;
uint32_t c3=128 * (rand() % 65536) + rand() % 65536;
uint32_t c4=128 * (rand() % 65536) + rand() % 65536;
cout << b1 << " -> " << c1 << ": " << b1/c1 << endl;
cout << b2 << " -> " << c2 << ": " << b2/c2 << endl;
cout << b3 << " -> " << c3 << ": " << b3/c3 << endl;
cout << b4 << " -> " << c4 << ": " << b4/c4 << endl;
cout << "=============================" << endl;
testDiv32Scalar(2000000, 16, b1, b2, b3, b4, c1, c2, c3, c4);
testDiv32Double(2000000, 16, b1, b2, b3, b4, c1, c2, c3, c4);
#ifdef __INTEL_COMPILER
testDiv32VectorIntel(2000000, 16, b1, b2, b3, b4, c1, c2, c3, c4);
#endif
testDiv32VectorDouble(2000000, 16, b1, b2, b3, b4, c1, c2, c3, c4);
testDiv32VectorAVXDouble(2000000, 16, b1, b2, b3, b4, c1, c2, c3, c4);
testDiv32ScalarOneDiv(2000000, 16, b1, b2, b3, b4, c1);
testDiv32AgnerOneDiv(2000000, 16, b1, b2, b3, b4, c1);
}
int main() {
SetHighAccuracy();
TestSmallNum();
TestLargeNum();
}