list.h

Go to the documentation of this file.

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

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

#define LIST_NEXT(name) ((name)->next)

#define LIST_PREV(name) ((name)->prev)

struct list_head {
        struct list_head *next;
        struct list_head *prev;
};

#define list_entry(ptr, type, member) \
        container_of(ptr, type, member)

#define list_next_entry(ptr, type, member) \
        (((ptr)->next == (ptr)) ? NULL : \
        list_entry((ptr)->next, type, member))

#define list_prev_entry(ptr, type, member) \
        (((ptr)->prev == (ptr)) ? NULL : \
        list_entry((ptr)->prev, type, member))

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

#define list_for_each_prev(pos, head) \
        for (pos = (head)->prev; \
        prefetch(pos->prev), pos != (head); pos = pos->prev)

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

#define list_for_each_prev_safe(pos, n, head) \
        for (pos = (head)->prev, n = pos->prev; \
        prefetch(pos->prev), pos != (head); pos = n, n = pos->prev)

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

static inline void INIT_LIST_HEAD(struct list_head *list)
{
        list->next = list;
        list->prev = list;
}

static inline void __list_add(struct list_head *new,
                        struct list_head *prev, struct list_head *next)
{
        next->prev = new;
        new->next = next;
        new->prev = prev;
        prev->next = new;
}

static inline void list_add(struct list_head *new, struct list_head *head)
{
        __list_add(new, head, head->next);
}

static inline void list_add_tail(struct list_head *new, struct list_head *head)
{
        __list_add(new, head->prev, head);
}

static inline void list_insert_after(struct list_head *new,
                                                struct list_head *head)
{
        new->next = head->next;
        new->prev = head;

        new->next->prev = new;
        head->next = new;
}

static inline void list_insert_before(struct list_head *new,
                                                struct list_head *head)
{
        new->next = head;
        new->prev = head->prev;

        new->prev->next = new;
        head->prev = new;
}

static inline void __list_del(struct list_head *prev, struct list_head *next)
{
        next->prev = prev;
        prev->next = next;
}

static inline void list_del(struct list_head *entry)
{
        __list_del(entry->prev, entry->next);
        entry->next = NULL;
        entry->prev = NULL;
}

static inline void list_replace(struct list_head *new, struct list_head *old)
{
        if (old->next) {
                old->next->prev = new;
        }

        if (old->prev) {
                old->prev->next = new;
        }

        new->next = old->next;
        new->prev = old->prev;
}

static inline void list_link(struct list_head *h_o_n, struct list_head *t_o_o)
{
        struct list_head *h_o_o = t_o_o->next;
        struct list_head *t_o_n = h_o_n->prev;

        t_o_o->next = h_o_n;
        h_o_n->prev = t_o_o;

        h_o_o->prev = t_o_n;
        t_o_n->next = h_o_o;
}