safe_list.h File Reference

#include <stdbool.h>
#include "list.h"
#include "utils.h"

Go to the source code of this file.

Data Structures
struct	safe_list

Macros
#define	INIT_SAFE_LIST(_head)
#define	SAFE_LIST_INIT(_name)   { LIST_HEAD_INIT(_name.list), NULL }
#define	SAFE_LIST(_name)   struct safe_list _name = SAFE_LIST_INIT(_name)

Functions
int	safe_list_for_each (struct safe_list *list, int(*cb)(void *ctx, struct safe_list *list), void *ctx)
void	safe_list_add (struct safe_list *list, struct safe_list *head)
void	safe_list_add_first (struct safe_list *list, struct safe_list *head)
void	safe_list_del (struct safe_list *list)
static bool	safe_list_empty (struct safe_list *head)

Macro Definition Documentation

INIT_SAFE_LIST

#define INIT_SAFE_LIST

(

_head

)

Value:

        do { \
                INIT_LIST_HEAD(_head.list); \
                (_head)->i = NULL; \
        } while (0)

Definition at line 48 of file safe_list.h.

SAFE_LIST

#define SAFE_LIST

(

_name

)

struct safe_list _name = SAFE_LIST_INIT(_name)

Definition at line 55 of file safe_list.h.

SAFE_LIST_INIT

#define SAFE_LIST_INIT

(

_name

)

{ LIST_HEAD_INIT(_name.list), NULL }

Definition at line 54 of file safe_list.h.

Function Documentation

safe_list_add()

void safe_list_add	(	struct safe_list *	list,
		struct safe_list *	head
	)

Definition at line 83 of file safe_list.c.

{
        list->i = NULL;
        list_add_tail(&list->list, &head->list);
}

Here is the call graph for this function:

Here is the caller graph for this function:

safe_list_add_first()

void safe_list_add_first	(	struct safe_list *	list,
		struct safe_list *	head
	)

Definition at line 89 of file safe_list.c.

{
        list->i = NULL;
        list_add(&list->list, &head->list);
}

Here is the call graph for this function:

Here is the caller graph for this function:

safe_list_del()

void safe_list_del

(

struct safe_list *

list

)

Definition at line 95 of file safe_list.c.

{
        struct safe_list_iterator *i, *next_i, **tail;
        struct safe_list *next;
 
        next = list_entry(list->list.next, struct safe_list, list);
        list_del(&list->list);
 
        if (!list->i)
                return;
 
        next_i = next->i;
        tail = &next->i;
 
        for (i = list->i; i; i = i->next_i) {
                tail = &i->next_i;
                i->next = next;
        }
 
        next->i = list->i;
        list->i->head = &next->i;
        *tail = next_i;
        if (next_i)
                next_i->head = tail;
 
        list->i = NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

safe_list_empty()

static bool safe_list_empty ( struct safe_list *  head )

inlinestatic

Definition at line 57 of file safe_list.h.

{
        return list_empty(&head->list);
}

safe_list_for_each()

int safe_list_for_each	(	struct safe_list *	list,
		int(*)(void *ctx, struct safe_list *list)	cb,
		void *	ctx
	)

Definition at line 62 of file safe_list.c.

{
        struct safe_list_iterator i;
        struct safe_list *cur;
        int ret = 0;
 
        for (cur = list_entry(head->list.next, struct safe_list, list),
             __safe_list_set_iterator(cur, &i);
             cur != head;
             cur = i.next, __safe_list_move_iterator(cur, &i)) {
                ret = cb(ctx, cur);
                if (ret)
                        break;
        }
 
        __safe_list_del_iterator(&i);
        return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function: