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
|
/**********************************************************************
Copyright(c) 2011-2018 Intel Corporation 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 Intel Corporation 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 THE COPYRIGHT
OWNER OR CONTRIBUTORS 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.
**********************************************************************/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <limits.h>
#include "mem_routines.h"
#include "test.h"
#define TEST_MEM 10 * 1024 * 1024
#define TEST_LEN 8 * 1024
#define RAND_ALIGN 32
#define BORDER_BYTES (5 * RAND_ALIGN + 7)
#ifndef RANDOMS
#define RANDOMS 2000
#endif
#ifndef TEST_SEED
#define TEST_SEED 0x1234
#endif
int
main(int argc, char *argv[])
{
int i, j, sign;
long long r, l;
void *buf = NULL;
unsigned char *a;
int failures = 0, ret_neg = 1;
printf("mem_zero_detect_test %d bytes, %d randoms, seed=0x%x ", TEST_MEM, RANDOMS,
TEST_SEED);
if (posix_memalign(&buf, 64, TEST_MEM)) {
printf("alloc error: Fail");
return -1;
}
srand(TEST_SEED);
// Test full zero buffer
memset(buf, 0, TEST_MEM);
failures = isal_zero_detect(buf, TEST_MEM);
if (failures) {
printf("Fail large buf test\n");
goto exit;
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
// Test to help memory checkers
for (i = 1; i < 2345; i++) {
uint8_t *newbuf = (uint8_t *) malloc(i);
if (newbuf == NULL) {
printf("Fail alloc test - not enough memory\n");
failures = -1;
goto exit;
}
memset(newbuf, 0, i);
failures = isal_zero_detect(newbuf, i);
free(newbuf);
if (failures) {
printf("Fail alloc test\n");
goto exit;
}
}
// Test small buffers
for (i = 0; i < TEST_LEN; i++) {
failures |= isal_zero_detect(buf, i);
if (failures) {
printf("Fail len=%d\n", i);
goto exit;
}
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
// Test small buffers near end of alloc region
a = buf;
for (i = 0; i < TEST_LEN; i++)
failures |= isal_zero_detect(&a[TEST_LEN - i], i);
if (failures) {
printf("Fail:\n");
goto exit;
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
// Test for detect non zero
a[TEST_MEM / 2] = 1;
ret_neg = isal_zero_detect(a, TEST_MEM);
if (ret_neg == 0) {
printf("Fail on not detect\n");
failures = -1;
goto exit;
}
a[TEST_MEM / 2] = 0;
#ifdef TEST_VERBOSE
putchar('.');
#endif
// Test various non-zero offsets
for (i = 0; i < BORDER_BYTES; i++) {
for (j = 0; j < CHAR_BIT; j++) {
a[i] = 1 << j;
ret_neg = isal_zero_detect(a, TEST_MEM);
if (ret_neg == 0) {
printf("Fail on not detect offsets %d, %d\n", i, j);
failures = -1;
goto exit;
}
a[i] = 0;
}
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
fflush(0);
// Test random non-zero offsets
for (i = 0; i < RANDOMS; i++) {
r = rand();
r = (r % TEST_LEN) ^ (r & (RAND_ALIGN - 1));
if (r >= TEST_LEN)
continue;
a[r] = 1 << (r & (CHAR_BIT - 1));
ret_neg = isal_zero_detect(a, TEST_MEM);
if (ret_neg == 0) {
printf("Fail on not detect rand %d, e=%lld\n", i, r);
failures = -1;
goto exit;
}
a[r] = 0;
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
fflush(0);
// Test putting non-zero byte at end of buffer
for (i = 1; i < BORDER_BYTES; i++) {
for (j = 0; j < CHAR_BIT; j++) {
a[TEST_MEM - i] = 1 << j;
ret_neg = isal_zero_detect(a, TEST_MEM);
if (ret_neg == 0) {
printf("Fail on not detect rand offset=%d, idx=%d\n", i, j);
failures = -1;
goto exit;
}
a[TEST_MEM - i] = 0;
}
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
// Test various size buffers and non-zero offsets
for (l = 1; l < TEST_LEN; l++) {
for (i = 0; i < l + BORDER_BYTES; i++) {
failures = isal_zero_detect(a, l);
if (failures) {
printf("Fail on detect non-zero with l=%lld\n", l);
goto exit;
}
a[i] = 1;
ret_neg = isal_zero_detect(a, l);
if ((i < l) && (ret_neg == 0)) {
printf("Fail on non-zero buffer l=%lld err=%d\n", l, i);
failures = -1;
goto exit;
}
if ((i >= l) && (ret_neg != 0)) {
printf("Fail on bad pass detect l=%lld err=%d\n", l, i);
failures = -1;
goto exit;
}
a[i] = 0;
}
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
// Test random test size and non-zero error offsets
for (i = 0; i < RANDOMS; i++) {
r = rand();
r = (r % TEST_LEN) ^ (r & (RAND_ALIGN - 1));
l = r + 1 + (rand() & (CHAR_BIT - 1));
a[r] = 1 << (r & (CHAR_BIT - 1));
ret_neg = isal_zero_detect(a, l);
if (ret_neg == 0) {
printf("Fail on not detect rand %d, l=%lld, e=%lld\n", i, l, r);
failures = -1;
goto exit;
}
a[r] = 0;
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
fflush(0);
// Test combinations of zero and non-zero buffers
for (i = 0; i < RANDOMS; i++) {
r = rand();
r = (r % TEST_LEN) ^ (r & (RAND_ALIGN - 1));
sign = rand() & 1 ? 1 : -1;
l = r + sign * (rand() & (2 * RAND_ALIGN - 1));
if ((l >= TEST_LEN) || (l < 0) || (r >= TEST_LEN))
continue;
a[r] = 1 << (r & (CHAR_BIT - 1));
ret_neg = isal_zero_detect(a, l);
if ((r < l) && (ret_neg == 0)) {
printf("Fail on non-zero rand buffer %d, l=%lld, e=%lld\n", i, l, r);
failures = -1;
goto exit;
}
if ((r >= l) && (ret_neg != 0)) {
printf("Fail on bad pass zero detect rand %d, l=%lld, e=%lld\n", i, l, r);
failures = -1;
goto exit;
}
a[r] = 0;
}
#ifdef TEST_VERBOSE
putchar('.');
#endif
fflush(0);
exit:
aligned_free(buf);
printf(failures == 0 ? " Pass\n" : " Fail\n");
return failures;
}
|
