Linked list

include/structures/list.h View source View on GitHub

Structs

list_head

struct list_head {
    struct list_head  *next;
};

slist_node

struct slist_node {
    struct slist_node  *next;
};

slist_head

struct slist_head {
    struct slist_node  *first;
    struct slist_node  *last;
};

Functions

INIT_LIST_HEAD

void INIT_LIST_HEAD(struct list_head *list);

__list_add

void __list_add(struct list_head *new, struct list_head *prev, struct list_head *next);

list_add

void list_add(struct list_head *new, struct list_head *head);

list_add_tail

void list_add_tail(struct list_head *new, struct list_head *head);

__list_del

void __list_del(struct list_head *prev, struct list_head *next);

list_del

void list_del(struct list_head *entry);

list_del_init

void list_del_init(struct list_head *entry);

list_empty

int list_empty(const struct list_head *head);

list_peek_front

struct list_head list_peek_front(struct list_head *head);

list_peek_tail

struct list_head list_peek_tail(struct list_head *head);

list_pop_front

struct list_head list_pop_front(struct list_head *head);

list_pop_front_init

struct list_head list_pop_front_init(struct list_head *head);

list_pop_tail

struct list_head list_pop_tail(struct list_head *head);

list_pop_tail_init

struct list_head list_pop_tail_init(struct list_head *head);

__list_splice

void __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next);

list_splice_init

void list_splice_init(struct list_head *src, struct list_head *dst);

list_splice_tail_init

void list_splice_tail_init(struct list_head *list, struct list_head *head);

list_sort

void list_sort(struct list_head *head, int (*cmp)(struct list_head *, struct list_head *));

slist_head_init

void slist_head_init(struct slist_head *h);

slist_empty

int slist_empty(const struct slist_head *h);

slist_push_head

void slist_push_head(struct slist_head *h, struct slist_node *n);

slist_push_tail

void slist_push_tail(struct slist_head *h, struct slist_node *n);

slist_pop_head

struct slist_node slist_pop_head(struct slist_head *h);

slist_remove_node_after

void slist_remove_node_after(struct slist_head *h, struct slist_node *prev, struct slist_node *target);

Macros

LIST_HEAD_INIT

#define LIST_HEAD_INIT(name) {&(name), &(name)}

LIST_HEAD

#define LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name)

list_entry

#define list_entry(ptr, type, member) \
    ((type *) ((char *) (ptr) - (offsetof(type, member))))

list_for_each

#define list_for_each(pos, head) \
    for (pos = (head)->next; pos != (head); pos = pos->next)

list_for_each_safe

#define list_for_each_safe(pos, n, head) \
    for (pos = (head)->next, n = pos->next; pos != (head); \
         pos = n, n = pos->next)

list_for_each_entry

#define list_for_each_entry(pos, head, member) \
    for (pos = list_entry((head)->next, typeof(*pos), member); \
         &pos->member != (head); \
         pos = list_entry(pos->member.next, typeof(*pos), member))

list_first_entry

#define list_first_entry(ptr, type, member) \
    list_entry((ptr)->next, type, member)

list_for_each_entry_safe

#define list_for_each_entry_safe(pos, n, head, member) \
    for (pos = list_entry((head)->next, typeof(*pos), member), \
        n = list_entry(pos->member.next, typeof(*pos), member); \
         &pos->member != (head); \
         pos = n, n = list_entry(n->member.next, typeof(*n), member))

list_for_each_entry_safe_continue

#define list_for_each_entry_safe_continue(pos, n, head, member) \
    for (pos = list_entry(pos->member.next, typeof(*pos), member), \
        n = list_entry(pos->member.next, typeof(*pos), member); \
         &pos->member != (head); \
         pos = n, n = list_entry(n->member.next, typeof(*n), member))

---