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
|
#include <malloc.h>
#include <stdlib.h>
#include <string.h>
#include "utils.h"
#define SIZE 256
#define ITERATIONS 10000
int test_memcmp(const void *s1, const void *s2, size_t n);
/* test all offsets and lengths */
static void test_one(char *s1, char *s2)
{
unsigned long offset, size;
for (offset = 0; offset < SIZE; offset++) {
for (size = 0; size < (SIZE-offset); size++) {
int x, y;
unsigned long i;
y = memcmp(s1+offset, s2+offset, size);
x = test_memcmp(s1+offset, s2+offset, size);
if (((x ^ y) < 0) && /* Trick to compare sign */
((x | y) != 0)) { /* check for zero */
printf("memcmp returned %d, should have returned %d (offset %ld size %ld)\n", x, y, offset, size);
for (i = offset; i < offset+size; i++)
printf("%02x ", s1[i]);
printf("\n");
for (i = offset; i < offset+size; i++)
printf("%02x ", s2[i]);
printf("\n");
abort();
}
}
}
}
static int testcase(void)
{
char *s1;
char *s2;
unsigned long i;
s1 = memalign(128, SIZE);
if (!s1) {
perror("memalign");
exit(1);
}
s2 = memalign(128, SIZE);
if (!s2) {
perror("memalign");
exit(1);
}
srandom(1);
for (i = 0; i < ITERATIONS; i++) {
unsigned long j;
unsigned long change;
for (j = 0; j < SIZE; j++)
s1[j] = random();
memcpy(s2, s1, SIZE);
/* change one byte */
change = random() % SIZE;
s2[change] = random() & 0xff;
test_one(s1, s2);
}
srandom(1);
for (i = 0; i < ITERATIONS; i++) {
unsigned long j;
unsigned long change;
for (j = 0; j < SIZE; j++)
s1[j] = random();
memcpy(s2, s1, SIZE);
/* change multiple bytes, 1/8 of total */
for (j = 0; j < SIZE / 8; j++) {
change = random() % SIZE;
s2[change] = random() & 0xff;
}
test_one(s1, s2);
}
return 0;
}
int main(void)
{
return test_harness(testcase, "memcmp");
}
|
