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
|
/******************************************************************************
* Copyright (c) Intel Corporation - All rights reserved. *
* This file is part of the LIBXSMM library. *
* *
* For information on the license, see the LICENSE file. *
* Further information: https://github.com/hfp/libxsmm/ *
* SPDX-License-Identifier: BSD-3-Clause *
******************************************************************************/
/* Hans Pabst (Intel Corp.)
******************************************************************************/
#include <libxsmm.h>
#include <string.h>
#include <stdio.h>
#include <math.h>
int main(int argc, char* argv[])
{
const int insize = (1 < argc ? atoi(argv[1]) : 0);
const int incrmt = (2 < argc ? atoi(argv[2]) : 0);
const int nelems = (3 < argc ? atoi(argv[3]) : 0);
const int niters = (4 < argc ? atoi(argv[4]) : 7);
const int elsize = (0 >= insize ? LIBXSMM_DESCRIPTOR_SIGSIZE : insize);
const int stride = (0 >= incrmt ? LIBXSMM_MAX(LIBXSMM_DESCRIPTOR_MAXSIZE, elsize) : LIBXSMM_MAX(incrmt, elsize));
const size_t n = (0 >= nelems ? (((size_t)2 << 30/*2 GB*/) / stride) : ((size_t)nelems));
const char *const env_strided = getenv("STRIDED"), *const env_check = getenv("CHECK");
const int strided = (NULL == env_strided || 0 == *env_strided) ? 0/*default*/ : atoi(env_strided);
const int check = (NULL == env_check || 0 == *env_check) ? 0/*default*/ : atoi(env_check);
double d0, d1 = 0, d2 = 0, d3 = 0;
size_t nbytes, size, nrpt, i;
int result = EXIT_SUCCESS;
unsigned char *a, *b;
LIBXSMM_ASSERT(elsize <= stride);
if (0 < niters) {
size = n;
nrpt = niters;
}
else {
size = LIBXSMM_MAX(LIBXSMM_ABS(niters), 1);
nrpt = n;
}
nbytes = size * stride;
libxsmm_init();
a = (unsigned char*)(0 != nbytes ? malloc(nbytes) : NULL);
b = (unsigned char*)(0 != nbytes ? malloc(nbytes) : NULL);
if (NULL != a && NULL != b) {
size_t diff = 0, j;
for (i = 0; i < nrpt; ++i) {
printf("-------------------------------------------------\n");
/* initialize the data */
libxsmm_rng_seq(a, (libxsmm_blasint)nbytes);
memcpy(b, a, nbytes); /* same content */
/* benchmark libxsmm_diff (always strided) */
if (elsize < 256) {
const libxsmm_timer_tickint start = libxsmm_timer_tick();
for (j = 0; j < nbytes; j += stride) {
const void *const aj = a + j, *const bj = b + j;
diff += libxsmm_diff(aj, bj, (unsigned char)elsize);
}
d0 = libxsmm_timer_duration(start, libxsmm_timer_tick());
if (0 < d0) printf("libxsmm_diff:\t\t%.8f s (%i MB/s)\n", d0,
(int)LIBXSMM_ROUND((2.0 * nbytes) / ((1024.0 * 1024.0) * d0)));
result += (int)diff * ((int)stride / ((int)stride + 1)); /* ignore result */
d1 += d0;
}
{ /* benchmark libxsmm_memcmp */
libxsmm_timer_tickint start;
/* reinitialize the data (flush caches) */
libxsmm_rng_seq(a, (libxsmm_blasint)nbytes);
memcpy(b, a, nbytes); /* same content */
start = libxsmm_timer_tick();
if (stride == elsize && 0 == strided) {
diff += libxsmm_memcmp(a, b, nbytes);
}
else {
for (j = 0; j < nbytes; j += stride) {
const void *const aj = a + j, *const bj = b + j;
diff += libxsmm_memcmp(aj, bj, elsize);
}
}
d0 = libxsmm_timer_duration(start, libxsmm_timer_tick());
if (0 < d0) printf("libxsmm_memcmp:\t\t%.8f s (%i MB/s)\n", d0,
(int)LIBXSMM_ROUND((2.0 * nbytes) / ((1024.0 * 1024.0) * d0)));
result += (int)diff * ((int)stride / ((int)stride + 1)); /* ignore result */
d2 += d0;
}
{ /* benchmark stdlib's memcmp */
libxsmm_timer_tickint start;
/* reinitialize the data (flush caches) */
libxsmm_rng_seq(a, (libxsmm_blasint)nbytes);
memcpy(b, a, nbytes); /* same content */
start = libxsmm_timer_tick();
if (stride == elsize && 0 == strided) {
diff += (0 != memcmp(a, b, nbytes));
}
else {
for (j = 0; j < nbytes; j += stride) {
const void *const aj = a + j, *const bj = b + j;
#if defined(_MSC_VER)
# pragma warning(push)
# pragma warning(disable: 6385)
#endif
diff += (0 != memcmp(aj, bj, elsize));
#if defined(_MSC_VER)
# pragma warning(pop)
#endif
}
}
d0 = libxsmm_timer_duration(start, libxsmm_timer_tick());
if (0 < d0) printf("stdlib memcmp:\t\t%.8f s (%i MB/s)\n", d0,
(int)LIBXSMM_ROUND((2.0 * nbytes) / ((1024.0 * 1024.0) * d0)));
result += (int)diff * ((int)stride / ((int)stride + 1)); /* ignore result */
d3 += d0;
}
}
if (1 < nrpt) {
printf("-------------------------------------------------\n");
printf("Arithmetic average of %llu iterations\n", (unsigned long long)nrpt);
printf("-------------------------------------------------\n");
d1 /= nrpt; d2 /= nrpt; d3 /= nrpt;
if (0 < d1) printf("libxsmm_diff:\t\t%.8f s (%i MB/s)\n", d1,
(int)LIBXSMM_ROUND((2.0 * nbytes) / ((1024.0 * 1024.0) * d1)));
if (0 < d2) printf("libxsmm_memcmp:\t\t%.8f s (%i MB/s)\n", d2,
(int)LIBXSMM_ROUND((2.0 * nbytes) / ((1024.0 * 1024.0) * d2)));
if (0 < d3) printf("stdlib memcmp:\t\t%.8f s (%i MB/s)\n", d3,
(int)LIBXSMM_ROUND((2.0 * nbytes) / ((1024.0 * 1024.0) * d3)));
}
if (0 < nrpt) {
printf("-------------------------------------------------\n");
}
if (0 != check) { /* validation */
size_t k;
for (i = 0; i < nrpt; ++i) {
for (j = 0; j < nbytes; j += stride) {
unsigned char *const aj = a + j, *const bj = b + j;
for (k = 0; k < 2; ++k) {
const int r = rand() % elsize;
#if defined(_MSC_VER)
# pragma warning(push)
# pragma warning(disable: 6385)
#endif
if (0 != memcmp(aj, bj, elsize)) {
if (elsize < 256 && 0 == libxsmm_diff(aj, bj, (unsigned char)elsize)) ++diff;
if (0 == libxsmm_memcmp(aj, bj, elsize)) ++diff;
}
else {
if (elsize < 256 && 0 != libxsmm_diff(aj, bj, (unsigned char)elsize)) ++diff;
if (0 != libxsmm_memcmp(aj, bj, elsize)) ++diff;
}
#if defined(_MSC_VER)
# pragma warning(pop)
#endif
/* inject difference into a or b */
if (0 != (rand() & 1)) {
aj[r] = (unsigned char)(rand() % 256);
}
else {
bj[r] = (unsigned char)(rand() % 256);
}
}
}
}
if (0 != diff) {
fprintf(stderr, "ERROR: errors=%i - validation failed!\n", (int)diff);
result = EXIT_FAILURE;
}
}
}
else {
result = EXIT_FAILURE;
}
free(a);
free(b);
return result;
}
|
