icl_deque.c File Reference

#include "icl_deque.h"

Include dependency graph for icl_deque.c:

Go to the source code of this file.

Functions
icl_deque_t *	icl_deque_new ()
	deque constructor More...
int	icl_deque_destroy (icl_deque_t *deque, void(*free_func)(void *))
	deque destructor More...
icl_node_t *	icl_deque_first (icl_deque_t *deque)
	Get the first node in the deque. More...
icl_node_t *	icl_deque_next (icl_deque_t *deque, icl_node_t *node)
	Get the next node in the deque. More...
icl_node_t *	icl_deque_append (icl_deque_t *deque, void *data)
	Insert the node at the end of the deque. More...
icl_node_t *	icl_deque_prepend (icl_deque_t *deque, void *data)
	Insert the node at the front of the deque. More...
int	icl_deque_delete (icl_deque_t *deque, icl_node_t *node, void(*free_func)(void *))
	Delete the node from the deque. More...
int	icl_deque_size (icl_deque_t *deque)
	Return the deque size. More...

Function Documentation

icl_node_t* icl_deque_append	(	icl_deque_t *	deque,
		void *	data
	)

Insert the node at the end of the deque.

Parameters

deque
data

Returns

the new node. NULL on error.

Definition at line 118 of file icl_deque.c.

References icl_list_append(), icl_deque_s::list, icl_deque_s::size, and icl_deque_s::spinlock.

{
    if (deque == NULL || data == NULL)
        return NULL;

    pthread_spin_lock(&deque->spinlock);
    icl_node_t *node = icl_list_append(deque->list, data);
    deque->size++;
    pthread_spin_unlock(&deque->spinlock);

    return node;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int icl_deque_delete	(	icl_deque_t *	deque,
		icl_node_t *	node,
		void(*)(void *)	free_func
	)

Delete the node from the deque.

Parameters

deque
node
free_func	function that frees the node's data

Return values

0	success
-1	failure

Definition at line 164 of file icl_deque.c.

References icl_list_delete(), icl_deque_s::list, icl_deque_s::size, and icl_deque_s::spinlock.

{
    if (deque == NULL || node == NULL)
        return -1;

    pthread_spin_lock(&deque->spinlock);
    if (icl_list_delete(deque->list, node, free_func) == 0) {
        pthread_spin_unlock(&deque->spinlock);
        deque->size--;
        return 0;
    }
    else {
        pthread_spin_unlock(&deque->spinlock);
        return -1;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

int icl_deque_destroy	(	icl_deque_t *	deque,
		void(*)(void *)	free_func
	)

deque destructor

Parameters

deque
free_func	function that frees the node's data

Return values

0	success
-1	failure

Definition at line 53 of file icl_deque.c.

References icl_list_destroy(), icl_deque_s::list, and icl_deque_s::spinlock.

{
    if (deque == NULL)
        return -1;

    if (pthread_spin_destroy(&deque->spinlock) != 0)
        return -1;

    if (icl_list_destroy(deque->list, free_func) != 0)
        return -1;

    free(deque);
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

icl_node_t* icl_deque_first

(

icl_deque_t *

deque

)

Get the first node in the deque.

Parameters

deque

Returns

the node at the front of the deque. NULL if empty or error.

Definition at line 76 of file icl_deque.c.

References icl_list_first(), icl_deque_s::list, and icl_deque_s::spinlock.

{
    if (deque == NULL)
        return NULL;

    pthread_spin_lock(&deque->spinlock);
    icl_node_t *node = icl_list_first(deque->list);
    pthread_spin_unlock(&deque->spinlock);

    return node;
}

Here is the call graph for this function:

Here is the caller graph for this function:

icl_deque_t* icl_deque_new

(

)

deque constructor

Returns

new deque. NULL on error.

Definition at line 23 of file icl_deque.c.

References icl_list_new(), icl_deque_s::list, icl_deque_s::size, and icl_deque_s::spinlock.

{
    icl_deque_t *deque = (icl_deque_t*)malloc(sizeof(icl_deque_t));
    if (deque == NULL)
        return NULL;

    deque->list = icl_list_new();
    if (deque->list == NULL) {
        free(deque);
        return NULL;
    }
    if (pthread_spin_init(&deque->spinlock, PTHREAD_PROCESS_PRIVATE) != 0) {
        free(deque->list);
        free(deque);
        return NULL;
    }
    deque->size = 0;
    return deque;
}

Here is the call graph for this function:

Here is the caller graph for this function:

icl_node_t* icl_deque_next	(	icl_deque_t *	deque,
		icl_node_t *	node
	)

Get the next node in the deque.

Parameters

deque
node

Returns

next node. NULL if empty or error.

Definition at line 97 of file icl_deque.c.

References icl_list_next(), icl_deque_s::list, and icl_deque_s::spinlock.

{
    if (deque == NULL)
        return NULL;

    pthread_spin_lock(&deque->spinlock);
    icl_node_t *next = icl_list_next(deque->list, node);
    pthread_spin_unlock(&deque->spinlock);

    return next;
}

Here is the call graph for this function:

icl_node_t* icl_deque_prepend	(	icl_deque_t *	deque,
		void *	data
	)

Insert the node at the front of the deque.

Parameters

deque
data

Returns

the new node. NULL on error.

Definition at line 140 of file icl_deque.c.

References icl_list_prepend(), icl_deque_s::list, icl_deque_s::size, and icl_deque_s::spinlock.

{
    if (deque == NULL || data == NULL)
        return NULL;

    pthread_spin_lock(&deque->spinlock);
    icl_node_t *node = icl_list_prepend(deque->list, data);
    deque->size++;
    pthread_spin_unlock(&deque->spinlock);

    return node;
}

Here is the call graph for this function:

int icl_deque_size

(

icl_deque_t *

deque

)

Return the deque size.

Parameters

deque

Returns

size of the deque. -1 on error.

Definition at line 189 of file icl_deque.c.

References icl_deque_s::size, and icl_deque_s::spinlock.

{
    if (deque == NULL)
        return -1;

    pthread_spin_lock(&deque->spinlock);
    int size = deque->size;
    pthread_spin_unlock(&deque->spinlock);
    return size;
}

Here is the caller graph for this function: