2024-03-15 18:35:47 +00:00
|
|
|
/*
|
|
|
|
* skiplist is MIT-licensed, but for this file:
|
|
|
|
*
|
|
|
|
* To the extent possible under law, the author(s) of this file have
|
|
|
|
* waived all copyright and related or neighboring rights to this
|
|
|
|
* work. See <https://creativecommons.org/publicdomain/zero/1.0/> for
|
|
|
|
* details.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define MUNIT_ENABLE_ASSERT_ALIASES (1)
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
#define __SL_DEBUG 0
|
|
|
|
#if __SL_DEBUG > 0
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <pthread.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
|
|
|
#if __SL_DEBUG >= 1
|
|
|
|
#define __SLD_ASSERT(cond) assert(cond)
|
|
|
|
#define __SLD_(b) b
|
|
|
|
#elif __SL_DEBUG >= 2
|
|
|
|
#define __SLD_P(...) printf(__VA_ARGS__)
|
|
|
|
#elif __SL_DEBUG >= 3
|
|
|
|
typedef struct dbg_node {
|
|
|
|
sl_node snode;
|
|
|
|
int value;
|
|
|
|
} dbg_node_t;
|
|
|
|
|
|
|
|
inline void
|
|
|
|
__sld_rt_ins(int error_code, sl_node *node, int top_layer, int cur_layer)
|
|
|
|
{
|
|
|
|
dbg_node_t *ddd = sl_get_entry(node, dbg_node_t, snode);
|
|
|
|
printf("[INS] retry (code %d) "
|
|
|
|
"%p (top %d, cur %d) %d\n",
|
|
|
|
error_code, node, top_layer, cur_layer, ddd->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void
|
|
|
|
__sld_nc_ins(sl_node *node, sl_node *next_node, int top_layer, int cur_layer)
|
|
|
|
{
|
|
|
|
dbg_node_t *ddd = sl_get_entry(node, dbg_node_t, snode);
|
|
|
|
dbg_node_t *ddd_next = sl_get_entry(next_node, dbg_node_t, snode);
|
|
|
|
|
|
|
|
printf("[INS] next node changed, "
|
|
|
|
"%p %p (top %d, cur %d) %d %d\n",
|
|
|
|
node, next_node, top_layer, cur_layer, ddd->value, ddd_next->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void
|
|
|
|
__sld_rt_rmv(int error_code, sl_node *node, int top_layer, int cur_layer)
|
|
|
|
{
|
|
|
|
dbg_node_t *ddd = sl_get_entry(node, dbg_node_t, snode);
|
|
|
|
printf("[RMV] retry (code %d) "
|
|
|
|
"%p (top %d, cur %d) %d\n",
|
|
|
|
error_code, node, top_layer, cur_layer, ddd->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void
|
|
|
|
__sld_nc_rmv(sl_node *node, sl_node *next_node, int top_layer, int cur_layer)
|
|
|
|
{
|
|
|
|
dbg_node_t *ddd = sl_get_entry(node, dbg_node_t, snode);
|
|
|
|
dbg_node_t *ddd_next = sl_get_entry(next_node, dbg_node_t, snode);
|
|
|
|
|
|
|
|
printf("[RMV] next node changed, "
|
|
|
|
"%p %p (top %d, cur %d) %d %d\n",
|
|
|
|
node, next_node, top_layer, cur_layer, ddd->value, ddd_next->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void
|
|
|
|
__sld_bm(sl_node *node)
|
|
|
|
{
|
|
|
|
dbg_node_t *ddd = sl_get_entry(node, dbg_node_t, snode);
|
|
|
|
printf("[RMV] node is being modified %d\n", ddd->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define __SLD_RT_INS(e, n, t, c) __sld_rt_ins(e, n, t, c)
|
|
|
|
#define __SLD_NC_INS(n, nn, t, c) __sld_nc_ins(n, nn, t, c)
|
|
|
|
#define __SLD_RT_RMV(e, n, t, c) __sld_rt_rmv(e, n, t, c)
|
|
|
|
#define __SLD_NC_RMV(n, nn, t, c) __sld_nc_rmv(n, nn, t, c)
|
|
|
|
#define __SLD_BM(n) __sld_bm(n)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "../include/skiplist.h"
|
|
|
|
#include "munit.h"
|
|
|
|
|
|
|
|
#if defined(_MSC_VER)
|
|
|
|
#pragma warning(disable : 4127)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
struct user_data {
|
|
|
|
size_t n_ele;
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct ex_node {
|
|
|
|
sl_node snode;
|
|
|
|
uint32_t key;
|
|
|
|
uint32_t value;
|
|
|
|
} ex_node_t;
|
|
|
|
|
|
|
|
typedef sl_raw ex_sl_t;
|
|
|
|
|
|
|
|
static int
|
|
|
|
uint32_key_cmp(sl_node *a, sl_node *b, void *aux)
|
|
|
|
{
|
|
|
|
ex_node_t *aa, *bb;
|
|
|
|
(void)aux;
|
|
|
|
aa = sl_get_entry(a, ex_node_t, snode);
|
|
|
|
bb = sl_get_entry(b, ex_node_t, snode);
|
|
|
|
|
|
|
|
if (aa->key < bb->key)
|
|
|
|
return -1;
|
|
|
|
if (aa->key > bb->key)
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2024-03-15 18:40:01 +00:00
|
|
|
#include "api.c"
|
2024-03-15 18:35:47 +00:00
|
|
|
static MunitTest api_test_suite[] = {
|
|
|
|
{ (char *)"/api/insert", test_api_insert, test_api_insert_setup,
|
|
|
|
test_api_insert_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/remove", test_api_remove, test_api_remove_setup,
|
|
|
|
test_api_remove_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/find", test_api_find, test_api_find_setup,
|
|
|
|
test_api_find_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/update", test_api_update, test_api_update_setup,
|
|
|
|
test_api_update_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/delete", test_api_delete, test_api_delete_setup,
|
|
|
|
test_api_delete_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/duplicates", test_api_duplicates, test_api_duplicates_setup,
|
|
|
|
test_api_duplicates_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/size", test_api_size, test_api_size_setup,
|
|
|
|
test_api_size_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ (char *)"/api/iterators", test_api_iterators, test_api_iterators_setup,
|
|
|
|
test_api_iterators_tear_down, MUNIT_TEST_OPTION_NONE, NULL },
|
|
|
|
{ NULL, NULL, NULL, NULL, MUNIT_TEST_OPTION_NONE, NULL }
|
|
|
|
};
|
|
|
|
|
|
|
|
#include "mt.c"
|
|
|
|
#include "scale.c"
|
|
|
|
static MunitSuite other_test_suite[] = {
|
|
|
|
{ "/mt", mt_tests, NULL, 1, MUNIT_SUITE_OPTION_NONE },
|
|
|
|
{ "/scale", scale_tests, NULL, 1, MUNIT_SUITE_OPTION_NONE },
|
|
|
|
{ NULL, NULL, NULL, 0, MUNIT_SUITE_OPTION_NONE}
|
|
|
|
};
|
|
|
|
|
|
|
|
static const MunitSuite main_test_suite = {
|
|
|
|
(char *)"/api", api_test_suite,other_test_suite, 1, MUNIT_SUITE_OPTION_NONE
|
|
|
|
};
|
2024-03-13 19:07:17 +00:00
|
|
|
|
2024-03-14 18:45:04 +00:00
|
|
|
int
|
2024-03-15 18:35:47 +00:00
|
|
|
main(int argc, char *argv[MUNIT_ARRAY_PARAM(argc + 1)])
|
2024-03-13 19:07:17 +00:00
|
|
|
{
|
2024-03-15 18:35:47 +00:00
|
|
|
struct user_data info;
|
|
|
|
return munit_suite_main(&main_test_suite, (void *)&info, argc, argv);
|
2024-03-13 19:07:17 +00:00
|
|
|
}
|