radare2/test/unit/test_skiplist.c

#include <r_th.h>
#include <r_skiplist.h>
#include "minunit.h"

int cmp_int(int a, int b) {
	return (a > b) - (a < b);
}

bool test_empty(void) {
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	RSkipListNode *it;
	void *data;

	r_skiplist_foreach (list, it, data) {
		mu_fail ("there shouldn't be any element in the list");
	}
	mu_assert_eq (r_skiplist_length (list), 0, "No element in the list");
	r_skiplist_free (list);
	mu_end;
}

bool test_oneelement(void) {
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	RSkipListNode *it;
	void *data;

	r_skiplist_insert (list, (void *)(intptr_t)(3));
	r_skiplist_foreach (list, it, data) {
		if ((int)(intptr_t)data != 3) {
			mu_fail ("there shouldn't be any element apart from 3");
		}
	}
	mu_assert_eq (r_skiplist_length (list), 1, "Only one element in the list");
	r_skiplist_free (list);
	mu_end;
}

bool test_insert(void) {
	int i;
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	RSkipListNode *n;
	// Add 100 items.
	for (i = 0; i < 100; i++) {
		r_skiplist_insert (list, (void *)(intptr_t)i);
	}

	n = r_skiplist_find (list, (void *)(intptr_t)33);
	mu_assert_notnull (n, "33 should be in the list");
	mu_assert_eq ((int)(intptr_t)n->data, 33, "33 should be the data");
	n = r_skiplist_find (list, (void *)(intptr_t)50);
	mu_assert_notnull (n, "50 should be in the list");
	mu_assert_eq ((int)(intptr_t)n->data, 50, "50 should be the data");
	// check first element
	n = r_skiplist_find (list, (void *)(intptr_t)0);
	mu_assert_notnull (n, "0 should be in the list");
	mu_assert_eq ((int)(intptr_t)n->data, 0, "0 should be the data");
	// check last element
	n = r_skiplist_find (list, (void *)(intptr_t)99);
	mu_assert_notnull (n, "99 should be in the list");
	mu_assert_eq ((int)(intptr_t)n->data, 99, "99 should be the data");
	mu_assert_eq (r_skiplist_length (list), 100, "Four elements in the list");

	// check non existing items
	n = r_skiplist_find (list, (void *)(intptr_t)150);
	mu_assert_null (n, "150 shouldn't be in the list");
	n = r_skiplist_find (list, (void *)(intptr_t)(-10));
	mu_assert_null (n, "-10 shouldn't be in the list");

	r_skiplist_free (list);
	mu_end;
}

bool test_insert_existing(void) {
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	int i;
	// Add 100 items.
	for (i = 0; i < 100; i++) {
		r_skiplist_insert (list, (void *)(intptr_t)i);
	}

	mu_assert_eq (r_skiplist_length (list), 100, "list should contain 100 elements");
	// try to insert again the element 0
	r_skiplist_insert (list, (void *)(intptr_t)0);
	mu_assert_eq (r_skiplist_length (list), 100, "list should still contain 100 elements");
	// try to insert again the element 50
	r_skiplist_insert (list, (void *)(intptr_t)50);
	mu_assert_eq (r_skiplist_length (list), 100, "list should still contain 100 elements");
	// try to insert again the element 99
	r_skiplist_insert (list, (void *)(intptr_t)99);
	mu_assert_eq (r_skiplist_length (list), 100, "list should still contain 100 elements");

	r_skiplist_free (list);
	mu_end;
}

bool test_purge(void) {
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	r_skiplist_insert (list, (void *)(intptr_t)3);
	r_skiplist_insert (list, (void *)(intptr_t)1);
	r_skiplist_insert (list, (void *)(intptr_t)30);
	r_skiplist_insert (list, (void *)(intptr_t)40);
	mu_assert_eq (r_skiplist_length (list), 4, "the list should contain four elements");
	r_skiplist_purge (list);
	mu_assert_eq (r_skiplist_length (list), 0, "the list should be empty at this point");
	r_skiplist_insert (list, (void *)(intptr_t)4);
	r_skiplist_insert (list, (void *)(intptr_t)2);
	mu_assert_eq (r_skiplist_length (list), 2, "the list should contain two new elements");
	r_skiplist_free (list);
	mu_end;
}

bool test_delete(void) {
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	r_skiplist_insert (list, (void *)(intptr_t)3);
	r_skiplist_insert (list, (void *)(intptr_t)1);
	r_skiplist_insert (list, (void *)(intptr_t)30);
	r_skiplist_insert (list, (void *)(intptr_t)40);

	// remove an element in the middle of the list
	r_skiplist_delete (list, (void *)(intptr_t)3);
	mu_assert_eq (r_skiplist_length (list), 3, "element 3 should be deleted");
	// remove last element of the list
	r_skiplist_delete (list, (void *)(intptr_t)40);
	mu_assert_eq (r_skiplist_length (list), 2, "element 40 should be deleted");
	// remove first element of the list
	r_skiplist_delete (list, (void *)(intptr_t)1);
	mu_assert_eq (r_skiplist_length (list), 1, "element 1 should be deleted");

	r_skiplist_insert (list, (void *)(intptr_t)50);
	mu_assert_eq (r_skiplist_length (list), 2, "element 50 should be inserted after deleting other elements");

	// remove non existing element
	r_skiplist_delete (list, (void *)(intptr_t)200);
	mu_assert_eq (r_skiplist_length (list), 2, "no element should be deleted");

	r_skiplist_free (list);
	mu_end;
}

// #define MY_NINS 0xfffff
#define MY_NINS 123
static RThreadFunctionRet bench_skiplist(struct r_th_t *user) {
	RSkipList *list = r_skiplist_new (NULL, (RListComparator)cmp_int);
	int i;
	for (i = 0; i < MY_NINS; i++) {
		r_skiplist_insert (list, (void *)(intptr_t)(i * (i + 3)));
	}
	r_skiplist_free (list);
	return R_TH_STOP;
}

bool test_bench(void) {
#define R2R_NTH 32
	RThread *th[R2R_NTH];
	int i;
	for (i = 0; i < R2R_NTH; i++) {
		th[i] = r_th_new (bench_skiplist, NULL, 0);
		r_th_start (th[i], false);
		// r_th_start (th[i], true);
	}
	for (i = 0; i < R2R_NTH; i++) {
		r_th_wait (th[i]);
		r_th_free (th[i]);
	}
	mu_end;
}

bool test_join(void) {
	RSkipList *l1 = r_skiplist_new (NULL, (RListComparator)cmp_int);
	r_skiplist_insert (l1, (void *)(intptr_t)3);
	r_skiplist_insert (l1, (void *)(intptr_t)1);
	r_skiplist_insert (l1, (void *)(intptr_t)30);
	r_skiplist_insert (l1, (void *)(intptr_t)40);

	RSkipList *l2 = r_skiplist_new (NULL, (RListComparator)cmp_int);
	r_skiplist_insert (l2, (void *)(intptr_t)10);
	r_skiplist_insert (l2, (void *)(intptr_t)4);
	r_skiplist_insert (l2, (void *)(intptr_t)1);

	r_skiplist_join (l1, l2);
	mu_assert ("10 is in l1", r_skiplist_find (l1, (void *)(intptr_t)10));
	mu_assert ("4 is in l1", r_skiplist_find (l1, (void *)(intptr_t)4));
	mu_assert ("1 is in l1", r_skiplist_find (l1, (void *)(intptr_t)1));
	mu_assert ("3 is still in l1", r_skiplist_find (l1, (void *)(intptr_t)3));
	mu_assert_eq (r_skiplist_length (l1), 6, "no double elements when joining");

	r_skiplist_free (l1);
	r_skiplist_free (l2);
	mu_end;
}

int all_tests() {
	mu_run_test(test_empty);
	mu_run_test(test_oneelement);
	mu_run_test(test_insert);
	mu_run_test(test_insert_existing);
	mu_run_test(test_purge);
	mu_run_test(test_delete);
	mu_run_test(test_join);
	mu_run_test(test_bench);
	return tests_passed != tests_run;
}

int main(int argc, char **argv) {
	return all_tests();
}