1 /* (c) 2008, Jack Lange <jarusl@cs.northwestern.edu> */
2 /* (c) 2008, The V3VEE Project <http://www.v3vee.org> */
4 #include <geekos/queue.h>
8 void init_queue(struct gen_queue * queue) {
9 queue->num_entries = 0;
10 INIT_LIST_HEAD(&(queue->entries));
14 struct gen_queue * create_queue() {
15 struct gen_queue * tmp_queue = Malloc(sizeof(struct gen_queue));
16 init_queue(tmp_queue);
20 void enqueue(struct gen_queue * queue, void * entry) {
21 struct queue_entry * q_entry = Malloc(sizeof(struct queue_entry));
23 q_entry->entry = entry;
24 list_add_tail(&(q_entry->entry_list), &(queue->entries));
29 void * dequeue(struct gen_queue * queue) {
32 if (!list_empty(&(queue->entries))) {
33 struct list_head * q_entry = queue->entries.next;
34 struct queue_entry * tmp_entry = list_entry(q_entry, struct queue_entry, entry_list);
36 entry_val = tmp_entry->entry;