void BitVecFree(BitVec *b) {
assert(b);
int tb_cnt = table_count(b->n);
for (int i = 0; i < tb_cnt; i++) {
delete[] b->bits[i];
}
delete[] b->bits;
}
static BitVec *BitVecNew(int n) {
BitVec *b = new BitVec();
b->n = n;
int tb_cnt = table_count(n);
b->bits = new unsigned char *[tb_cnt];
for (int i = 0; i < tb_cnt; i++) {
b->bits[i] = new unsigned char[TABLE_SIZE];
std::memset(b->bits[i], 0, TABLE_SIZE);
}
return b;
}
int main(int argc, char **argv)
{
charP_int_Table _t, *t = &_t;
charP_int_TableInit(t, 5);
assert(charP_int_TableNEntries(t) == 0);
assert(table_count(t) == 0);
assert(charP_int_TableSize(t) == 5);
charP_int_TableAdd(t, "foo", 4);
assert(*charP_int_TableGet(t, "foo") == 4);
assert(charP_int_TableNEntries(t) == 1);
assert(table_count(t) == 1);
assert(charP_int_TableSize(t) == 5);
charP_int_TableAdd(t, "bar", 5);
assert(*charP_int_TableGet(t, "foo") == 4);
assert(*charP_int_TableGet(t, "bar") == 5);
assert(charP_int_TableNEntries(t) == 2);
assert(table_count(t) == 2);
assert(charP_int_TableSize(t) == 5);
charP_int_TableStats(t, stdout);
assert(charP_int_TableRemove(t, "foo") == 1);
assert(charP_int_TableGet(t, "foo") == 0);
assert(*charP_int_TableGet(t, "bar") == 5);
assert(charP_int_TableNEntries(t) == 1);
assert(table_count(t) == 1);
assert(charP_int_TableSize(t) == 5);
assert(charP_int_TableRemove(t, "bar") == 1);
assert(charP_int_TableGet(t, "foo") == 0);
assert(charP_int_TableGet(t, "bar") == 0);
assert(charP_int_TableNEntries(t) == 0);
assert(table_count(t) == 0);
assert(charP_int_TableSize(t) == 5);
assert(charP_int_TableRemove(t, "foo") == 0);
assert(charP_int_TableRemove(t, "bar") == 0);
assert(charP_int_TableGet(t, "foo") == 0);
assert(charP_int_TableGet(t, "bar") == 0);
assert(charP_int_TableNEntries(t) == 0);
assert(table_count(t) == 0);
assert(charP_int_TableSize(t) == 5);
printf("OK\n");
return 0;
}
int
main(int argc, char *argv[])
{
FILE *fp;
char buffer[512];
size_t i, j, r;
unsigned int d = 0;
uint64_t s, e, a, ri, si, ai, sr, rg, sg, ag, sd, ng;
char **t;
struct ck_ht_stat st;
r = 20;
s = 8;
srand(time(NULL));
if (argc < 2) {
ck_error("Usage: ck_ht <dictionary> [<repetitions> <initial size>]\n");
}
if (argc >= 3)
r = atoi(argv[2]);
if (argc >= 4)
s = (uint64_t)atoi(argv[3]);
keys = malloc(sizeof(char *) * keys_capacity);
assert(keys != NULL);
fp = fopen(argv[1], "r");
assert(fp != NULL);
while (fgets(buffer, sizeof(buffer), fp) != NULL) {
buffer[strlen(buffer) - 1] = '\0';
keys[keys_length++] = strdup(buffer);
assert(keys[keys_length - 1] != NULL);
if (keys_length == keys_capacity) {
t = realloc(keys, sizeof(char *) * (keys_capacity *= 2));
assert(t != NULL);
keys = t;
}
}
t = realloc(keys, sizeof(char *) * keys_length);
assert(t != NULL);
keys = t;
table_init();
for (i = 0; i < keys_length; i++)
d += table_insert(keys[i]) == false;
ck_ht_stat(&ht, &st);
fprintf(stderr, "# %zu entries stored, %u duplicates, %" PRIu64 " probe.\n",
table_count(), d, st.probe_maximum);
fprintf(stderr, "# reverse_insertion serial_insertion random_insertion serial_replace reverse_get serial_get random_get serial_remove negative_get\n\n");
a = 0;
for (j = 0; j < r; j++) {
if (table_reset() == false) {
ck_error("ERROR: Failed to reset hash table.\n");
}
s = rdtsc();
for (i = keys_length; i > 0; i--)
d += table_insert(keys[i - 1]) == false;
e = rdtsc();
a += e - s;
}
ri = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
if (table_reset() == false) {
ck_error("ERROR: Failed to reset hash table.\n");
}
s = rdtsc();
for (i = 0; i < keys_length; i++)
d += table_insert(keys[i]) == false;
e = rdtsc();
a += e - s;
}
si = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
keys_shuffle(keys);
if (table_reset() == false) {
ck_error("ERROR: Failed to reset hash table.\n");
}
s = rdtsc();
for (i = 0; i < keys_length; i++)
d += table_insert(keys[i]) == false;
e = rdtsc();
a += e - s;
}
ai = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
s = rdtsc();
for (i = 0; i < keys_length; i++)
table_replace(keys[i]);
e = rdtsc();
a += e - s;
}
sr = a / (r * keys_length);
table_reset();
for (i = 0; i < keys_length; i++)
table_insert(keys[i]);
a = 0;
for (j = 0; j < r; j++) {
s = rdtsc();
for (i = keys_length; i > 0; i--) {
if (table_get(keys[i - 1]) == NULL) {
ck_error("ERROR: Unexpected NULL value.\n");
}
}
e = rdtsc();
a += e - s;
}
rg = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
s = rdtsc();
for (i = 0; i < keys_length; i++) {
if (table_get(keys[i]) == NULL) {
ck_error("ERROR: Unexpected NULL value.\n");
}
}
e = rdtsc();
a += e - s;
}
sg = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
keys_shuffle(keys);
s = rdtsc();
for (i = 0; i < keys_length; i++) {
if (table_get(keys[i]) == NULL) {
ck_error("ERROR: Unexpected NULL value.\n");
}
}
e = rdtsc();
a += e - s;
}
ag = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
s = rdtsc();
for (i = 0; i < keys_length; i++)
table_remove(keys[i]);
e = rdtsc();
a += e - s;
for (i = 0; i < keys_length; i++)
table_insert(keys[i]);
}
sd = a / (r * keys_length);
a = 0;
for (j = 0; j < r; j++) {
s = rdtsc();
for (i = 0; i < keys_length; i++) {
table_get("\x50\x03\x04\x05\x06\x10");
}
e = rdtsc();
a += e - s;
}
ng = a / (r * keys_length);
printf("%zu "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 " "
"%" PRIu64 "\n",
keys_length, ri, si, ai, sr, rg, sg, ag, sd, ng);
return 0;
}
