void run_linked_list_tests() {
char* inputs[] = {
"item1",
"item2",
"item3",
};
int num_inputs = sizeof(inputs) / sizeof(char*);
char* data;
// after init
LinkedList *ll = ll_new();
assert("Starts empty", ll_is_empty(ll));
assert("Initial size is 0", ll_size(ll)==0);
assert("Peek returns null", ll_peek(ll)==NULL);
// after pushing one item
ll_push(ll, inputs[0]);
assert("Is not empty after pushing an item", !ll_is_empty(ll));
assert("Has size of 1 after pushing an item", ll_size(ll)==1);
assert("Peeking returns the item we pushed", ll_peek(ll)==inputs[0]);
// after two items
ll_push(ll, inputs[1]);
assert("Is not empty after pushing a second item", !ll_is_empty(ll));
assert("Has size of 2 after pushing a second item", ll_size(ll)==2);
assert("Peeking returns the second item", ll_peek(ll)==inputs[1]);
// after three items
ll_push(ll, inputs[2]);
assert("Is not empty after pushing a third item", !ll_is_empty(ll));
assert("Has size of 3 after pushing a third item", ll_size(ll)==3);
assert("Peeking returns the third item", ll_peek(ll)==inputs[2]);
// iterating through the items
int index = num_inputs;
int all_match = 1;
ll_each(ll, char* input, ({
all_match &= (inputs[--index] == input);
}));
assert("It iterates the correct number of times", index==0);
assert("The item provided matched each time", all_match);
// popping an item
data = ll_pop(ll);
assert("It is not empty after popping the third item", !ll_is_empty(ll));
assert("Has size of 2 after popping the third item", ll_size(ll)==2);
assert("Peeking returns the second item", ll_peek(ll)==inputs[1]);
// cleanup
ll_free(ll);
}
int __KT_try_releasing_tasks()
{
struct llistnode *cur;
rwlock_acquire(&kill_queue->rwl, RWL_WRITER);
if(ll_is_empty(kill_queue))
{
rwlock_release(&kill_queue->rwl, RWL_WRITER);
return 0;
}
task_t *t=0;
ll_for_each_entry(kill_queue, cur, task_t *, t)
{
/* need to check for orphaned zombie tasks */
if(t->flags & TF_BURIED && (t != ((cpu_t *)t->cpu)->cur)) {
if(t->parent == 0 || t->parent->state == TASK_DEAD || (t->parent->flags & TF_KTASK) || t->parent == kernel_task)
move_task_to_kill_queue(t, 0);
if(t->flags & TF_KILLREADY)
break;
}
}
if(!t || !((t->flags & TF_BURIED) && (t->flags & TF_KILLREADY)))
{
rwlock_release(&kill_queue->rwl, RWL_WRITER);
return 0;
}
assert(cur->entry == t);
void *node = ll_do_remove(kill_queue, cur, 1);
assert(node == cur);
int ret = 0;
if(!ll_is_empty(kill_queue))
ret = 1;
rwlock_release(&kill_queue->rwl, RWL_WRITER);
release_task(t);
kfree(cur);
return ret;
}
