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
|
// SPDX-License-Identifier: MIT
/*
* speed test HX_memmem
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <libHX/defs.h>
#include <libHX/init.h>
#include <libHX/misc.h>
#include <libHX/string.h>
static unsigned int size = 1048576 * 64;
static const char filler_text[] =
"Slhrdlu cringle tongle flonging blobbity bleep blingmangl";
static void long_scan(void)
{
struct timespec start, stop, delta;
char *filler2, *p;
filler2 = malloc(size);
if (filler2 == NULL)
abort();
memset(filler2, 'l', size);
filler2[size-2] = 'a';
clock_gettime(CLOCK_THREAD_CPUTIME_ID, &start);
p = HX_memmem(filler2, strlen(filler2), "al", 2);
clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stop);
printf("long_scan: filler2=%p p=%p\n", filler2, p);
HX_timespec_sub(&delta, &stop, &start);
printf("long_scan: " HX_TIMESPEC_FMT "\n", HX_TIMESPEC_EXP(&delta));
free(filler2);
}
int main(void)
{
unsigned int i;
char *haystack;
struct timespec start, stop, delta;
if (HX_init() <= 0)
abort();
haystack = malloc(size);
if (haystack == NULL)
abort();
memset(haystack, 'A', size);
haystack[size-1] = haystack[size-2] = 'Z';
printf("Init done\n");
printf("Start=%p End=%p\n", filler_text,
filler_text + ARRAY_SIZE(filler_text));
printf("%p\n", HX_memmem(filler_text, strlen(filler_text), "nangl", 5));
printf("%p\n", HX_memmem(filler_text, strlen(filler_text), "angl", 4));
printf("%p\n", HX_memmem(filler_text, strlen(filler_text), "ngl", 3));
printf("%p\n", HX_memmem(filler_text, strlen(filler_text), "ngl", 3));
long_scan();
for (i = 0; i < 10; ++i) {
printf("Search length %u...", i);
clock_gettime(CLOCK_THREAD_CPUTIME_ID, &start);
HX_memmem(haystack, size, haystack + size - i, i);
clock_gettime(CLOCK_THREAD_CPUTIME_ID, &stop);
HX_timespec_sub(&delta, &stop, &start);
printf(HX_TIMESPEC_FMT "\n", HX_TIMESPEC_EXP(&delta));
}
HX_exit();
return EXIT_SUCCESS;
}
|