list.h

Go to the documentation of this file.

#ifndef __TOOLS_LIST_H
#define __TOOLS_LIST_H

#include <stddef.h>

struct list {
        struct list *prev;

        struct list *next;
};

/*------------------------------------------------------------------------*/

#define list_initializer(list) { .prev = list, .next = list, }

/*------------------------------------------------------------------------*/

#define list_init(list)                                                   \
        do {                                                              \
                (list)->prev = (list)->next = (list);                     \
        } while (0)

/*------------------------------------------------------------------------*/

#define containerof(ptr, type, field)                                     \
        ((type*)((size_t)(ptr) - offsetof(type, field)))

/*------------------------------------------------------------------------*/

#define list_foreach(list, node, type, field)                             \
        for((node) = containerof((list)->next, type, field);              \
                &(node)->field != (list);                                 \
                (node) = containerof((node)->field.next, type, field))

/*------------------------------------------------------------------------*/

#define list_foreach_safe(l, i, t, type, f)                               \
        for (                                                             \
                (i) = containerof((l)->next, type, f),                    \
                (t) = containerof((i)->f.next, type, f);                  \
                &(i)->f != (l);                                           \
                i = (t), (t) = containerof((t)->f.next, type, f)          \
        )

/*------------------------------------------------------------------------*/

#define list_add_head(list, node)                                         \
        do {                                                              \
                (node)->next = (list)->next;                              \
                (node)->prev = (list);                                    \
                (list)->next->prev = (node);                              \
                (list)->next = (node);                                    \
        } while(0);                                                       \

/*------------------------------------------------------------------------*/

#define list_add_tail(list, node)                                         \
        do {                                                              \
                (node)->prev = (list)->prev;                              \
                (node)->next = (list);                                    \
                (list)->prev->next = (node);                              \
                (list)->prev = (node);                                    \
        } while(0);                                                       \

/*------------------------------------------------------------------------*/

#define list_del_node(node)                                               \
        do {                                                              \
                (node)->next->prev = (node)->prev;                        \
                (node)->prev->next = (node)->next;                        \
                (node)->prev = (node)->next = NULL;                       \
        } while(0);

/*------------------------------------------------------------------------*/

#define list_is_empty(list)                                               \
        ((list)->prev == (list) && (list) == (list)->next)

#endif /* __TOOLS_LIST_H */