void test_inserting_and_finding()
{
struct avl_tree_node* root;
int* value;
root = avl_tree_create();
root = avl_tree_insert(root, "esa", 3);
root = avl_tree_insert(root, "vesa", 4);
root = avl_tree_insert(root, "vvv", 5);
root = avl_tree_insert(root, "aaa", 7);
value = avl_tree_find(root, "vesa");
assertIntEquals(4, *value);
value = avl_tree_find(root, "esa");
assertIntEquals(3, *value);
value = avl_tree_find(root, "vvv");
assertIntEquals(5, *value);
value = avl_tree_find(root, "aaa");
assertIntEquals(7, *value);
value = avl_tree_find(root, "bbb");
assertNull(value);
avl_tree_destroy(root);
}
/* process module init */
status_t process_init(kernel_args_t *kargs)
{
status_t err;
proc_id pid;
/* call arch-specific init */
err = arch_process_init(kargs);
if(err != NO_ERROR)
return err;
/* valid process ids and processes group ids starts from 1 */
next_process_id = 1;
/* data structures spinlock init */
spin_init(&processes_lock);
/* list init */
xlist_init(&processes_list);
/* tree init */
avl_tree_create( &processes_tree, compare_process_id,
sizeof(process_t),
offsetof(process_t, procs_tree_node) );
/* create kernel process */
pid = proc_create_kernel_process("kernel_process");
if(pid == INVALID_PROCESSID)
return ERR_MT_GENERAL;
return NO_ERROR;
}
void test_insertion()
{
struct avl_tree_node* root;
root = avl_tree_create();
root = avl_tree_insert(root, "esa", 0);
root = avl_tree_insert(root, "vesa", 1);
root = avl_tree_insert(root, "hesa", 2);
avl_tree_destroy(root);
}
void test_inserting()
{
struct avl_tree_node* root;
root = avl_tree_create();
root = avl_tree_insert(root, "esa", 3);
root = avl_tree_insert(root, "vesa", 4);
root = avl_tree_insert(root, "vvv", 5);
root = avl_tree_insert(root, "aaa", 7);
avl_tree_destroy(root);
}
void test_for_each()
{
struct avl_tree_node* root;
root = avl_tree_create();
root = avl_tree_insert(root, "aaa", 3);
root = avl_tree_insert(root, "vesa", 5);
root = avl_tree_insert(root, "esa", 7);
TOTAL = 1;
avl_tree_for_each(root, test_function);
assertIntEquals(3*5*7, TOTAL);
avl_tree_destroy(root);
}
void test_finding()
{
struct avl_tree_node* root;
int* value;
root = avl_tree_create();
root = avl_tree_insert(root, "esa", 3);
value = avl_tree_find(root, "vesa");
assertNull(value);
value = avl_tree_find(root, "esa");
assertIntEquals(3, *value);
avl_tree_destroy(root);
}
void test_that_keys_are_copied()
{
struct avl_tree_node* root;
int* value;
char key[] = "esa";
root = avl_tree_create();
root = avl_tree_insert(root, key, 3);
value = avl_tree_find(root, "esa");
assertIntEquals(3, *value);
key[0] = 'a';
value = avl_tree_find(root, "esa");
assertIntEquals(3, *value);
avl_tree_destroy(root);
}
void test_increasing()
{
struct avl_tree_node* root;
root = avl_tree_create();
root = avl_tree_increase(root, "moi");
root = avl_tree_increase(root, "hello");
root = avl_tree_increase(root, "abc");
root = avl_tree_increase(root, "hello");
root = avl_tree_increase(root, "hello");
root = avl_tree_increase(root, "eee");
root = avl_tree_increase(root, "moi");
assertIntEquals(3, *avl_tree_find(root, "hello"));
assertIntEquals(1, *avl_tree_find(root, "abc"));
assertIntEquals(2, *avl_tree_find(root, "moi"));
assertIntEquals(1, *avl_tree_find(root, "eee"));
assertNull(avl_tree_find(root, "dummy"));
avl_tree_destroy(root);
}
void test_creation()
{
struct avl_tree_node* root;
root = avl_tree_create();
avl_tree_destroy(root);
}
