a8d7d971b1
This is the version of CCAN which CLN was using at the time these were taken. Unfortunately lots of whitespace has been changed, but AFAICT no source changes. Here's the command I ran (with ../ccan checked out to 1ae4c432): ``` make update-ccan CCAN_NEW="alignof array_size build_assert check_type container_of cppmagic likely list mem short_types str structeq take tal tal/str typesafe_cb utf8 endian crypto/sha256" ``` Signed-off-by: Rusty Russell <rusty@rustcorp.com.au> Signed-off-by: William Casarin <jb55@jb55.com>
96 lines
2.4 KiB
C
96 lines
2.4 KiB
C
/* Simple speed tests for a hash of strings using hsearch */
|
|
#include <ccan/htable/htable_type.h>
|
|
#include <ccan/htable/htable.c>
|
|
#include <ccan/tal/str/str.h>
|
|
#include <ccan/tal/grab_file/grab_file.h>
|
|
#include <ccan/tal/tal.h>
|
|
#include <ccan/hash/hash.h>
|
|
#include <ccan/time/time.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <time.h>
|
|
#include <unistd.h>
|
|
#include <sys/time.h>
|
|
#include <search.h>
|
|
|
|
/* Nanoseconds per operation */
|
|
static size_t normalize(const struct timeabs *start,
|
|
const struct timeabs *stop,
|
|
unsigned int num)
|
|
{
|
|
return time_to_nsec(time_divide(time_between(*stop, *start), num));
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
size_t i, j, num;
|
|
struct timeabs start, stop;
|
|
char **w;
|
|
ENTRY *words, *misswords;
|
|
|
|
w = tal_strsplit(NULL, grab_file(NULL,
|
|
argv[1] ? argv[1] : "/usr/share/dict/words"), "\n", STR_NO_EMPTY);
|
|
num = tal_count(w) - 1;
|
|
printf("%zu words\n", num);
|
|
|
|
hcreate(num+num/3);
|
|
|
|
words = tal_arr(w, ENTRY, num);
|
|
for (i = 0; i < num; i++) {
|
|
words[i].key = w[i];
|
|
words[i].data = words[i].key;
|
|
}
|
|
|
|
/* Append and prepend last char for miss testing. */
|
|
misswords = tal_arr(w, ENTRY, num);
|
|
for (i = 0; i < num; i++) {
|
|
char lastc;
|
|
if (strlen(w[i]))
|
|
lastc = w[i][strlen(w[i])-1];
|
|
else
|
|
lastc = 'z';
|
|
misswords[i].key = tal_fmt(misswords, "%c%s%c%c",
|
|
lastc, w[i], lastc, lastc);
|
|
}
|
|
|
|
printf("#01: Initial insert: ");
|
|
fflush(stdout);
|
|
start = time_now();
|
|
for (i = 0; i < num; i++)
|
|
hsearch(words[i], ENTER);
|
|
stop = time_now();
|
|
printf(" %zu ns\n", normalize(&start, &stop, num));
|
|
|
|
printf("#02: Initial lookup (match): ");
|
|
fflush(stdout);
|
|
start = time_now();
|
|
for (i = 0; i < num; i++)
|
|
if (hsearch(words[i], FIND)->data != words[i].data)
|
|
abort();
|
|
stop = time_now();
|
|
printf(" %zu ns\n", normalize(&start, &stop, num));
|
|
|
|
printf("#03: Initial lookup (miss): ");
|
|
fflush(stdout);
|
|
start = time_now();
|
|
for (i = 0; i < num; i++) {
|
|
if (hsearch(misswords[i], FIND))
|
|
abort();
|
|
}
|
|
stop = time_now();
|
|
printf(" %zu ns\n", normalize(&start, &stop, num));
|
|
|
|
/* Lookups in order are very cache-friendly for judy; try random */
|
|
printf("#04: Initial lookup (random): ");
|
|
fflush(stdout);
|
|
start = time_now();
|
|
for (i = 0, j = 0; i < num; i++, j = (j + 10007) % num)
|
|
if (hsearch(words[i], FIND)->data != words[i].data)
|
|
abort();
|
|
stop = time_now();
|
|
printf(" %zu ns\n", normalize(&start, &stop, num));
|
|
|
|
return 0;
|
|
}
|