list.h File Reference

#include <stddef.h>
#include <stdbool.h>

Go to the source code of this file.

Data Structures
struct	list_head

Macros
#define	prefetch(x)
#define	container_of(ptr, type, member)
#define	container_of_safe(ptr, type, member)
#define	LIST_HEAD_INIT(name)   { &(name), &(name) }
#define	LIST_HEAD(name)   struct list_head name = LIST_HEAD_INIT(name)
#define	list_entry(ptr, type, field)   container_of(ptr, type, field)
#define	list_first_entry(ptr, type, field)   list_entry((ptr)->next, type, field)
#define	list_last_entry(ptr, type, field)   list_entry((ptr)->prev, type, field)
#define	list_next_entry(pos, member)   list_entry((pos)->member.next, typeof(*(pos)), member)
#define	list_entry_is_h(p, h, field)   (&p->field == (h))
#define	list_for_each(p, head)    for (p = (head)->next; p != (head); p = p->next)
#define	list_for_each_safe(p, n, head)    for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)
#define	list_for_each_entry(p, h, field)
#define	list_for_each_entry_continue(p, h, field)
#define	list_for_each_entry_continue_reverse(p, h, field)
#define	list_for_each_entry_safe(p, n, h, field)
#define	list_for_each_entry_reverse(p, h, field)
#define	list_for_each_prev(p, h)   for (p = (h)->prev; p != (h); p = p->prev)
#define	list_for_each_prev_safe(p, n, h)   for (p = (h)->prev, n = p->prev; p != (h); p = n, n = p->prev)

Functions
static void	INIT_LIST_HEAD (struct list_head *list)
static bool	list_empty (const struct list_head *head)
static bool	list_is_first (const struct list_head *list, const struct list_head *head)
static bool	list_is_last (const struct list_head *list, const struct list_head *head)
static void	_list_del (struct list_head *entry)
static void	list_del (struct list_head *entry)
static void	_list_add (struct list_head *_new, struct list_head *prev, struct list_head *next)
static void	list_del_init (struct list_head *entry)
static void	list_add (struct list_head *_new, struct list_head *head)
static void	list_add_tail (struct list_head *_new, struct list_head *head)
static void	list_move (struct list_head *list, struct list_head *head)
static void	list_move_tail (struct list_head *entry, struct list_head *head)
static void	_list_splice (const struct list_head *list, struct list_head *prev, struct list_head *next)
static void	list_splice (const struct list_head *list, struct list_head *head)
static void	list_splice_tail (struct list_head *list, struct list_head *head)
static void	list_splice_init (struct list_head *list, struct list_head *head)
static void	list_splice_tail_init (struct list_head *list, struct list_head *head)

Macro Definition Documentation

container_of

#define container_of	(		ptr,
			type,
			member
	)

Value:

        ({                                                              \
                const __typeof__(((type *) NULL)->member) *__mptr = (ptr);      \
                (type *) ((char *) __mptr - offsetof(type, member));    \
        })

Definition at line 38 of file list.h.

container_of_safe

#define container_of_safe	(		ptr,
			type,
			member
	)

Value:

        ({                                                                              \
                const __typeof__(((type *) NULL)->member) *__mptr = (ptr);              \
                __mptr ? (type *)((char *) __mptr - offsetof(type, member)) : NULL;     \
        })

Definition at line 46 of file list.h.

list_entry

#define list_entry	(		ptr,
			type,
			field
	)		container_of(ptr, type, field)

Definition at line 120 of file list.h.

list_entry_is_h

#define list_entry_is_h	(		p,
			h,
			field
	)		(&p->field == (h))

Definition at line 124 of file list.h.

list_first_entry

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

Definition at line 121 of file list.h.

list_for_each

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

Definition at line 126 of file list.h.

list_for_each_entry

#define list_for_each_entry	(		p,
			h,
			field
	)

Value:

        for (p = list_first_entry(h, __typeof__(*p), field); &p->field != (h); \
            p = list_entry(p->field.next, __typeof__(*p), field))

Definition at line 132 of file list.h.

list_for_each_entry_continue

#define list_for_each_entry_continue	(		p,
			h,
			field
	)

Value:

        for (p = list_next_entry(p, field);                             \
             !list_entry_is_h(p, h, field);                             \
             p = list_next_entry(p, field))

Definition at line 136 of file list.h.

list_for_each_entry_continue_reverse

#define list_for_each_entry_continue_reverse	(		p,
			h,
			field
	)

Value:

        for (p = list_prev_entry(p, field);                             \
             !list_entry_is_h(p, h, field);                             \
             p = list_prev_entry(p, field))

Definition at line 141 of file list.h.

list_for_each_entry_reverse

#define list_for_each_entry_reverse	(		p,
			h,
			field
	)

Value:

        for (p = list_last_entry(h, __typeof__(*p), field); &p->field != (h); \
            p = list_entry(p->field.prev, __typeof__(*p), field))

Definition at line 151 of file list.h.

list_for_each_entry_safe

#define list_for_each_entry_safe	(		p,
			n,
			h,
			field
	)

Value:

        for (p = list_first_entry(h, __typeof__(*p), field),            \
            n = list_entry(p->field.next, __typeof__(*p), field); &p->field != (h);\
            p = n, n = list_entry(n->field.next, __typeof__(*n), field))

Definition at line 146 of file list.h.

list_for_each_prev

#define list_for_each_prev	(		p,
			h
	)		for (p = (h)->prev; p != (h); p = p->prev)

Definition at line 155 of file list.h.

list_for_each_prev_safe

#define list_for_each_prev_safe	(		p,
			n,
			h
	)		for (p = (h)->prev, n = p->prev; p != (h); p = n, n = p->prev)

Definition at line 156 of file list.h.

list_for_each_safe

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

Definition at line 129 of file list.h.

LIST_HEAD

#define LIST_HEAD

(

name

)

struct list_head name = LIST_HEAD_INIT(name)

Definition at line 60 of file list.h.

LIST_HEAD_INIT

#define LIST_HEAD_INIT

(

name

)

{ &(name), &(name) }

Definition at line 58 of file list.h.

list_last_entry

#define list_last_entry	(		ptr,
			type,
			field
	)		list_entry((ptr)->prev, type, field)

Definition at line 122 of file list.h.

list_next_entry

#define list_next_entry	(		pos,
			member
	)		list_entry((pos)->member.next, typeof(*(pos)), member)

Definition at line 123 of file list.h.

prefetch

#define prefetch

(

x

)

Definition at line 35 of file list.h.

Function Documentation

_list_add()

static void _list_add ( struct list_head *  _new, struct list_head *  prev, struct list_head *  next  )

inlinestatic

Definition at line 103 of file list.h.

{
 
        next->prev = _new;
        _new->next = next;
        _new->prev = prev;
        prev->next = _new;
}

Here is the caller graph for this function:

_list_del()

static void _list_del ( struct list_head *  entry )

inlinestatic

Definition at line 89 of file list.h.

{
        entry->next->prev = entry->prev;
        entry->prev->next = entry->next;
}

Here is the caller graph for this function:

_list_splice()

static void _list_splice ( const struct list_head *  list, struct list_head *  prev, struct list_head *  next  )

inlinestatic

Definition at line 185 of file list.h.

{
        struct list_head *first;
        struct list_head *last;
 
        if (list_empty(list))
                return;
 
        first = list->next;
        last = list->prev;
        first->prev = prev;
        prev->next = first;
        last->next = next;
        next->prev = last;
}

Here is the call graph for this function:

Here is the caller graph for this function:

INIT_LIST_HEAD()

static void INIT_LIST_HEAD ( struct list_head *  list )

inlinestatic

Definition at line 63 of file list.h.

{
        list->next = list->prev = list;
}

Here is the caller graph for this function:

list_add()

static void list_add ( struct list_head *  _new, struct list_head *  head  )

inlinestatic

Definition at line 159 of file list.h.

{
        _list_add(_new, head, head->next);
}

Here is the call graph for this function:

Here is the caller graph for this function:

list_add_tail()

static void list_add_tail ( struct list_head *  _new, struct list_head *  head  )

inlinestatic

Definition at line 165 of file list.h.

{
        _list_add(_new, head->prev, head);
}

Here is the call graph for this function:

Here is the caller graph for this function:

list_del()

static void list_del ( struct list_head *  entry )

inlinestatic

Definition at line 96 of file list.h.

{
        _list_del(entry);
        entry->next = entry->prev = NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

list_del_init()

static void list_del_init ( struct list_head *  entry )

inlinestatic

Definition at line 114 of file list.h.

{
        _list_del(entry);
        INIT_LIST_HEAD(entry);
}

Here is the call graph for this function:

list_empty()

static bool list_empty ( const struct list_head *  head )

inlinestatic

Definition at line 69 of file list.h.

{
        return (head->next == head);
}

Here is the caller graph for this function:

list_is_first()

static bool list_is_first ( const struct list_head *  list, const struct list_head *  head  )

inlinestatic

Definition at line 75 of file list.h.

{
        return list->prev == head;
}

Here is the caller graph for this function:

list_is_last()

static bool list_is_last ( const struct list_head *  list, const struct list_head *  head  )

inlinestatic

Definition at line 82 of file list.h.

{
        return list->next == head;
}

Here is the caller graph for this function:

list_move()

static void list_move ( struct list_head *  list, struct list_head *  head  )

inlinestatic

Definition at line 171 of file list.h.

{
        _list_del(list);
        list_add(list, head);
}

Here is the call graph for this function:

list_move_tail()

static void list_move_tail ( struct list_head *  entry, struct list_head *  head  )

inlinestatic

Definition at line 178 of file list.h.

{
        _list_del(entry);
        list_add_tail(entry, head);
}

Here is the call graph for this function:

Here is the caller graph for this function:

list_splice()

static void list_splice ( const struct list_head *  list, struct list_head *  head  )

inlinestatic

Definition at line 203 of file list.h.

{
        _list_splice(list, head, head->next);
}

Here is the call graph for this function:

list_splice_init()

static void list_splice_init ( struct list_head *  list, struct list_head *  head  )

inlinestatic

Definition at line 215 of file list.h.

{
        _list_splice(list, head, head->next);
        INIT_LIST_HEAD(list);
}

Here is the call graph for this function:

list_splice_tail()

static void list_splice_tail ( struct list_head *  list, struct list_head *  head  )

inlinestatic

Definition at line 209 of file list.h.

{
        _list_splice(list, head->prev, head);
}

Here is the call graph for this function:

list_splice_tail_init()

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

inlinestatic

Definition at line 222 of file list.h.

{
        _list_splice(list, head->prev, head);
        INIT_LIST_HEAD(list);
}

Here is the call graph for this function: