//
|
// Copyright 2020 Staysail Systems, Inc. <info@staysail.tech>
|
//
|
// This software is supplied under the terms of the MIT License, a
|
// copy of which should be located in the distribution where this
|
// file was obtained (LICENSE.txt). A copy of the license may also be
|
// found online at https://opensource.org/licenses/MIT.
|
//
|
|
#include <nuts.h>
|
|
#include "idhash.h"
|
|
void
|
test_basic(void)
|
{
|
nni_id_map m;
|
char * five = "five";
|
char * four = "four";
|
|
nni_id_map_init(&m, 0, 0, false);
|
|
// insert it
|
NUTS_PASS(nni_id_set(&m, 5, five));
|
// retrieve it
|
NUTS_TRUE(nni_id_get(&m, 5) == five);
|
|
// change it
|
NUTS_PASS(nni_id_set(&m, 5, four));
|
NUTS_TRUE(nni_id_get(&m, 5) == four);
|
|
// delete
|
NUTS_PASS(nni_id_remove(&m, 5));
|
|
nni_id_map_fini(&m);
|
}
|
|
void
|
test_random(void)
|
{
|
int i;
|
uint32_t id;
|
for (i = 0; i < 2; i++) {
|
nni_id_map m;
|
nni_id_map_init(&m, 0, 0, true);
|
NUTS_PASS(nni_id_alloc(&m, &id, &id));
|
nni_id_map_fini(&m);
|
NUTS_TRUE(id != 0);
|
if (id != 1) {
|
break;
|
}
|
// one chance in 4 billion, but try again
|
}
|
|
NUTS_TRUE(id != 1);
|
NUTS_TRUE(i < 2);
|
}
|
|
void
|
test_collision(void)
|
{
|
nni_id_map m;
|
char * five = "five";
|
char * four = "four";
|
|
nni_id_map_init(&m, 0, 0, false);
|
|
// Carefully crafted -- 13 % 8 == 5.
|
NUTS_PASS(nni_id_set(&m, 5, five));
|
NUTS_PASS(nni_id_set(&m, 13, four));
|
NUTS_TRUE(nni_id_get(&m, 5) == five);
|
NUTS_TRUE(nni_id_get(&m, 13) == four);
|
|
// Delete the intermediate
|
NUTS_PASS(nni_id_remove(&m, 5));
|
NUTS_TRUE(nni_id_get(&m, 13) == four);
|
|
nni_id_map_fini(&m);
|
}
|
|
void
|
test_empty(void)
|
{
|
nni_id_map m;
|
nni_id_map_init(&m, 0, 0, false);
|
|
NUTS_TRUE(nni_id_get(&m, 42) == NULL);
|
NUTS_FAIL(nni_id_remove(&m, 42), NNG_ENOENT);
|
NUTS_FAIL(nni_id_remove(&m, 1), NNG_ENOENT);
|
nni_id_map_fini(&m);
|
}
|
|
void
|
test_not_found(void)
|
{
|
nni_id_map m;
|
uint32_t id;
|
nni_id_map_init(&m, 0, 0, false);
|
|
NUTS_PASS(nni_id_alloc(&m, &id, &id));
|
NUTS_FAIL(nni_id_remove(&m, 42), NNG_ENOENT);
|
NUTS_FAIL(nni_id_remove(&m, 2), NNG_ENOENT);
|
NUTS_PASS(nni_id_remove(&m, id));
|
nni_id_map_fini(&m);
|
}
|
|
void
|
test_resize(void)
|
{
|
nni_id_map m;
|
int rv;
|
int i;
|
int expect[1024];
|
|
for (i = 0; i < 1024; i++) {
|
expect[i] = i;
|
}
|
|
nni_id_map_init(&m, 0, 0, false);
|
|
for (i = 0; i < 1024; i++) {
|
if ((rv = nni_id_set(&m, i, &expect[i])) != 0) {
|
NUTS_PASS(rv);
|
}
|
}
|
|
for (i = 0; i < 1024; i++) {
|
if ((rv = nni_id_remove(&m, i)) != 0) {
|
NUTS_PASS(rv);
|
}
|
}
|
nni_id_map_fini(&m);
|
}
|
|
void
|
test_dynamic(void)
|
{
|
nni_id_map m;
|
int expect[5];
|
uint32_t id;
|
|
nni_id_map_init(&m, 10, 13, false);
|
|
// We can fill the table.
|
NUTS_PASS(nni_id_alloc(&m, &id, &expect[0]));
|
NUTS_TRUE(id == 10);
|
NUTS_PASS(nni_id_alloc(&m, &id, &expect[1]));
|
NUTS_TRUE(id == 11);
|
NUTS_PASS(nni_id_alloc(&m, &id, &expect[2]));
|
NUTS_TRUE(id == 12);
|
NUTS_PASS(nni_id_alloc(&m, &id, &expect[3]));
|
NUTS_TRUE(id == 13);
|
|
// Adding another fails.
|
NUTS_FAIL(nni_id_alloc(&m, &id, &expect[4]), NNG_ENOMEM);
|
|
// Delete one.
|
NUTS_PASS(nni_id_remove(&m, 11));
|
|
// And now we can allocate one.
|
NUTS_PASS(nni_id_alloc(&m, &id, &expect[4]));
|
NUTS_TRUE(id == 11);
|
nni_id_map_fini(&m);
|
}
|
|
void
|
test_set_out_of_range(void)
|
{
|
nni_id_map m;
|
int x;
|
uint32_t id;
|
|
nni_id_map_init(&m, 10, 13, false);
|
|
// We can insert outside the range forcibly.
|
NUTS_PASS(nni_id_set(&m, 1, &x));
|
NUTS_PASS(nni_id_set(&m, 100, &x));
|
NUTS_PASS(nni_id_alloc(&m, &id, &x));
|
NUTS_TRUE(id == 10);
|
nni_id_map_fini(&m);
|
}
|
|
#define STRESS_LOAD 50000
|
#define NUM_VALUES 1000
|
|
void
|
test_stress(void)
|
{
|
void * values[NUM_VALUES];
|
nni_id_map m;
|
size_t i;
|
int rv;
|
void * x;
|
int v;
|
|
nni_id_map_init(&m, 0, 0, false);
|
for (i = 0; i < NUM_VALUES; i++) {
|
values[i] = NULL;
|
}
|
|
for (i = 0; i < STRESS_LOAD; i++) {
|
v = rand() % NUM_VALUES; // Keep it constrained
|
|
switch (rand() & 3) {
|
case 0:
|
x = &values[rand() % NUM_VALUES];
|
values[v] = x;
|
if ((rv = nni_id_set(&m, v, x)) != 0) {
|
NUTS_PASS(rv);
|
goto out;
|
}
|
break;
|
|
case 1:
|
rv = nni_id_remove(&m, v);
|
if (values[v] == NULL) {
|
if (rv != NNG_ENOENT) {
|
NUTS_FAIL(rv, NNG_ENOENT);
|
goto out;
|
}
|
} else {
|
values[v] = NULL;
|
if (rv != 0) {
|
NUTS_PASS(rv);
|
goto out;
|
}
|
}
|
break;
|
case 2:
|
x = nni_id_get(&m, v);
|
if (x != values[v]) {
|
NUTS_TRUE(x == values[v]);
|
goto out;
|
}
|
break;
|
}
|
}
|
out:
|
NUTS_TRUE(i == STRESS_LOAD);
|
|
// Post stress check.
|
for (i = 0; i < NUM_VALUES; i++) {
|
x = nni_id_get(&m, i);
|
if (x != values[i]) {
|
NUTS_TRUE(x == values[i]);
|
break;
|
}
|
|
// We only use the test macros if we know they are going
|
// to fail. Otherwise there will be too many errors reported.
|
rv = nni_id_remove(&m, i);
|
if ((x == NULL) && (rv != NNG_ENOENT)) {
|
NUTS_FAIL(rv, NNG_ENOENT);
|
} else if ((x != NULL) && (rv != 0)) {
|
NUTS_PASS(rv);
|
}
|
}
|
NUTS_TRUE(i == NUM_VALUES);
|
|
nni_id_map_fini(&m);
|
}
|
|
NUTS_TESTS = {
|
{ "basic", test_basic },
|
{ "random", test_random },
|
{ "collision", test_collision },
|
{ "empty", test_empty },
|
{ "not found", test_not_found },
|
{ "resize", test_resize },
|
{ "dynamic", test_dynamic },
|
{ "set out of range", test_set_out_of_range },
|
{ "stress", test_stress },
|
{ NULL, NULL },
|
};
|
