list.h File Reference

#include <zrtos/types.h>

Include dependency graph for list.h:

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

Go to the source code of this file.

Data Structures
struct	_zrtos_list_node_t
struct	_zrtos_list_t

Typedefs
typedef struct _zrtos_list_node_t	zrtos_list_node_t
typedef struct _zrtos_list_t	zrtos_list_t

Functions
zrtos_list_node_t *	zrtos_list__get_first_node (zrtos_list_t *thiz)
zrtos_list_node_t *	zrtos_list__get_last_node (zrtos_list_t *thiz)
bool	zrtos_list_node__init (zrtos_list_node_t *thiz)
zrtos_list_node_t *	zrtos_list_node__get_next_node (zrtos_list_node_t *node)
bool	zrtos_list_node__has_next_node (zrtos_list_node_t *node)
bool	zrtos_list__init (zrtos_list_t *thiz)
bool	zrtos_list__push (zrtos_list_t *thiz, zrtos_list_node_t *node)
bool	zrtos_list__unshift (zrtos_list_t *thiz, zrtos_list_node_t *node)
zrtos_list_node_t *	zrtos_list__shift (zrtos_list_t *thiz)
void	zrtos_list__shift_and_push (zrtos_list_t *thiz)
void	zrtos_list__delete (zrtos_list_t *thiz, zrtos_list_node_t *node)
bool	zrtos_list__is_empty (zrtos_list_t *thiz)
void	zrtos_list__deinit (zrtos_list_t *thiz, void(*callback)(zrtos_list_t *thiz, zrtos_list_node_t *node))
void	zrtos_list__each (zrtos_list_t *thiz, bool(*callback)(zrtos_list_node_t *node, void *arg), void *arg)

Typedef Documentation

zrtos_list_node_t

typedef struct _zrtos_list_node_t zrtos_list_node_t

zrtos_list_t

typedef struct _zrtos_list_t zrtos_list_t

Function Documentation

zrtos_list__deinit()

void zrtos_list__deinit	(	zrtos_list_t *	thiz,
		void(*)(zrtos_list_t *thiz, zrtos_list_node_t *node)	callback
	)

Definition at line 115 of file list.h.

 {
    while(!zrtos_list__is_empty(thiz)){
        zrtos_list_node_t *node = zrtos_list__shift(thiz);
        callback(thiz,node);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

zrtos_list__delete()

void zrtos_list__delete	(	zrtos_list_t *	thiz,
		zrtos_list_node_t *	node
	)

Definition at line 96 of file list.h.

                                                                   {
    zrtos_list_node_t *next;
    zrtos_list_node_t *prev = zrtos_list__get_first_node(thiz);
    if(node == prev){
        zrtos_list__shift(thiz);
    }else{
        while((next = prev->next) != node){
            prev = next;
        }
        if((prev->next = node->next) == 0){
            thiz->last = prev;
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

zrtos_list__each()

void zrtos_list__each	(	zrtos_list_t *	thiz,
		bool(*)(zrtos_list_node_t *node, void *arg)	callback,
		void *	arg
	)

Definition at line 125 of file list.h.

 {
    zrtos_list_node_t *node = zrtos_list__get_first_node(thiz);
    zrtos_list_node_t *root = node;
    if(node){
        zrtos_list_node_t *next;
        do{
            next = node->next;
        }while(callback(node,arg) && (node = next) != root);
    }
}

Here is the call graph for this function:

zrtos_list__get_first_node()

zrtos_list_node_t* zrtos_list__get_first_node

(

zrtos_list_t *

thiz

)

Definition at line 26 of file list.h.

                                                                 {
    return thiz->first;
}

Here is the caller graph for this function:

zrtos_list__get_last_node()

zrtos_list_node_t* zrtos_list__get_last_node

(

zrtos_list_t *

thiz

)

Definition at line 30 of file list.h.

                                                                {
    return thiz->last;
}

Here is the caller graph for this function:

zrtos_list__init()

bool zrtos_list__init

(

zrtos_list_t *

thiz

)

Definition at line 51 of file list.h.

                                         {
    thiz->first = 0;
    thiz->last = 0;
    return true;
}

Here is the caller graph for this function:

zrtos_list__is_empty()

bool zrtos_list__is_empty

(

zrtos_list_t *

thiz

)

Definition at line 111 of file list.h.

                                             {
    return zrtos_list__get_first_node(thiz) == 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

zrtos_list__push()

bool zrtos_list__push	(	zrtos_list_t *	thiz,
		zrtos_list_node_t *	node
	)

Definition at line 57 of file list.h.

                                                                 {
    zrtos_list_node_t *last = zrtos_list__get_last_node(thiz);
    if(last){
        thiz->last = last->next = node;
    }else{
        thiz->first = thiz->last = node;
    }
    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

zrtos_list__shift()

zrtos_list_node_t* zrtos_list__shift

(

zrtos_list_t *

thiz

)

Definition at line 78 of file list.h.

                                                        {
    zrtos_list_node_t *ret = zrtos_list__get_first_node(thiz);
    if(ret){
        thiz->first = ret->next;
        if(thiz->first == 0){
            thiz->last = 0;
        }
    }
    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

zrtos_list__shift_and_push()

void zrtos_list__shift_and_push

(

zrtos_list_t *

thiz

)

Definition at line 89 of file list.h.

                                                   {
    zrtos_list_node_t *node = zrtos_list__shift(thiz);
    if(node){
        zrtos_list__push(thiz,node);
    }
}

Here is the call graph for this function:

zrtos_list__unshift()

bool zrtos_list__unshift	(	zrtos_list_t *	thiz,
		zrtos_list_node_t *	node
	)

Definition at line 67 of file list.h.

                                                                    {
    zrtos_list_node_t *first = zrtos_list__get_first_node(thiz);
    if(first){
        thiz->first = node;
        node->next = first;
    }else{
        thiz->first = thiz->last = node;
    }
    return true;
}

Here is the call graph for this function:

zrtos_list_node__get_next_node()

zrtos_list_node_t* zrtos_list_node__get_next_node

(

zrtos_list_node_t *

node

)

Definition at line 39 of file list.h.

 {
    return node->next;
}

Here is the caller graph for this function:

zrtos_list_node__has_next_node()

bool zrtos_list_node__has_next_node

(

zrtos_list_node_t *

node

)

Definition at line 45 of file list.h.

 {
    return node->next != 0;
}

Here is the caller graph for this function:

zrtos_list_node__init()

bool zrtos_list_node__init

(

zrtos_list_node_t *

thiz

)

Definition at line 34 of file list.h.

                                                   {
    thiz->next = 0;
    return true;
}

Here is the caller graph for this function: