list.h File Reference

#include <_null.h>
#include <list.h>

Include dependency graph for list.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	list_head

Macros
#define	LIST_HEAD_INIT(name)   { &(name), &(name) }
#define	LIST_HEAD(name)   struct list_head name = LIST_HEAD_INIT(name)
#define	list_entry(ptr, type, member)    container_of(ptr, type, member)
#define	list_first_entry(ptr, type, member)    list_entry((ptr)->next, type, member)
#define	list_last_entry(ptr, type, member)    list_entry((ptr)->prev, type, member)
#define	list_next_entry(pos, member)    list_entry((pos)->member.next, typeof(*(pos)), member)
#define	list_prev_entry(pos, member)    list_entry((pos)->member.prev, typeof(*(pos)), member)
#define	list_entry_or_null(ptr, type, member)
#define	list_first_entry_or_null(ptr, type, member)    list_entry_or_null(ptr, type, member)
#define	list_last_entry_or_null(ptr, type, member)
#define	list_for_each(pos, head)    for (pos = (head)->next; pos != (head); pos = pos->next)
#define	list_for_each_safe(pos, n, head)
#define	list_for_each_entry(pos, head, member)
#define	list_for_each_entry_safe(pos, n, head, member)
#define	list_for_each_entry_reverse(pos, head, member)
#define	list_entry_is_head(pos, head, member)    (&(pos)->member == (head))
#define	list_for_each_entry_continue(pos, head, member)
#define	list_for_each_entry_continue_reverse(pos, head, member)
#define	list_for_each_entry_from(pos, head, member)
#define	list_for_each_entry_from_reverse(pos, head, member)
#define	list_add(new, head)    _Generic((head), struct list_head*: linux_list_add, default: list_add)((new), (head))

Macro Definition Documentation

list_add

#define list_add	(		new,
			head
	)		_Generic((head), struct list_head*: linux_list_add, default: list_add)((new), (head))

list_entry

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

list_entry_is_head

#define list_entry_is_head	(		pos,
			head,
			member
	)		(&(pos)->member == (head))

list_entry_or_null

#define list_entry_or_null	(		ptr,
			type,
			member
	)

Value:

    ({ \
    struct list_head *head__ = (ptr); \
    struct list_head *pos__ = READ_ONCE(head__->next); \
    pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
    })

list_first_entry

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

list_first_entry_or_null

#define list_first_entry_or_null	(		ptr,
			type,
			member
	)		list_entry_or_null(ptr, type, member)

list_for_each

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

list_for_each_entry

#define list_for_each_entry	(		pos,
			head,
			member
	)

Value:

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

list_for_each_entry_continue

#define list_for_each_entry_continue	(		pos,
			head,
			member
	)

Value:

    for (pos = list_next_entry(pos, member); \
         !list_entry_is_head(pos, head, member); \
         pos = list_next_entry(pos, member))

list_for_each_entry_continue_reverse

#define list_for_each_entry_continue_reverse	(		pos,
			head,
			member
	)

Value:

    for (pos = list_prev_entry(pos, member); \
         !list_entry_is_head(pos, head, member); \
         pos = list_prev_entry(pos, member))

list_for_each_entry_from

#define list_for_each_entry_from	(		pos,
			head,
			member
	)

Value:

    for (; !list_entry_is_head(pos, head, member); \
         pos = list_next_entry(pos, member))

list_for_each_entry_from_reverse

#define list_for_each_entry_from_reverse	(		pos,
			head,
			member
	)

Value:

    for (; !list_entry_is_head(pos, head, member); \
         pos = list_prev_entry(pos, member))

list_for_each_entry_reverse

#define list_for_each_entry_reverse	(		pos,
			head,
			member
	)

Value:

    for (pos = list_entry((head)->prev, typeof(*pos), member); \
         &pos->member != (head); \
         pos = list_entry(pos->member.prev, typeof(*pos), member))

list_for_each_entry_safe

#define list_for_each_entry_safe	(		pos,
			n,
			head,
			member
	)

Value:

    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(*pos), member))

list_for_each_safe

#define list_for_each_safe	(		pos,
			n,
			head
	)

Value:

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

LIST_HEAD

#define LIST_HEAD

(

name

)

struct list_head name = LIST_HEAD_INIT(name)

LIST_HEAD_INIT

#define LIST_HEAD_INIT

(

name

)

{ &(name), &(name) }

list_last_entry

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

list_last_entry_or_null

#define list_last_entry_or_null	(		ptr,
			type,
			member
	)

Value:

    ({ \
    struct list_head *head__ = (ptr); \
    struct list_head *pos__ = READ_ONCE(head__->prev); \
    pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
    })

list_next_entry

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

list_prev_entry

#define list_prev_entry	(		pos,
			member
	)		list_entry((pos)->member.prev, typeof(*(pos)), member)