queue.c File Reference

#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include "queue.h"
#include "types.h"

Include dependency graph for queue.c:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
queue_t *	create_queue ()
void	enqueue_item (queue_t *q, void *item)
void *	dequeue_item (queue_t *q)
void	destroy_queue (queue_t *q)
int	is_empty (queue_t *q)

---

Function Documentation

queue_t* create_queue

(

)

Definition at line 35 of file queue.c.

{
        queue_t *q = (queue_t *)malloc(sizeof(queue_t));
        q->head = NULL;
        q->tail = NULL;
        q->count = 0;

        return q;
}

Here is the caller graph for this function:

void* dequeue_item

(

queue_t *

q

)

Definition at line 81 of file queue.c.

{
        void *item;
        queue_node_t *node;

        oassert(q != NULL);
        oassert(q->head != NULL);

        q->count--;

        node = q->head;
        item = node->item;
        q->head = q->head->next;
        if (q->head == NULL)
                q->tail = NULL;

        free(node);

        return item;
}

Here is the caller graph for this function:

void destroy_queue

(

queue_t *

q

)

Definition at line 107 of file queue.c.

{
        while (!is_empty(q))
                dequeue_item(q);
        free(q);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void enqueue_item	(	queue_t *	q,
		void *	item
	)

Definition at line 48 of file queue.c.

{
        queue_node_t *node;
        
//      node = q->head;
//      while (node != NULL)
//      {
//              if (node->item == item)
//                      return;
//              node = node->next;
//      }
        oassert(item != NULL);
        oassert(q != NULL);
        node = (queue_node_t *)malloc(sizeof(queue_node_t));
        node->next = NULL;
        node->item = item;

        q->count++;

        /* add the new node to the end */
        if (q->tail == NULL)
                q->tail = node;
        else
                q->tail->next = node;
        q->tail = node;

        if (q->head == NULL)
                q->head = node;
}

Here is the caller graph for this function:

int is_empty

(

queue_t *

q

)

Definition at line 117 of file queue.c.

{
        return q->head == NULL;
}

Here is the caller graph for this function: