llist.h File Reference

#include "utilities/vsf_utilities.h"

Go to the source code of this file.

Data Structures
struct	llist_node
struct	llist_head

Macros
#define	LLIST_HEAD_INIT(name)   { NULL }
#define	LLIST_HEAD(name)   struct llist_head name = LLIST_HEAD_INIT(name)
#define	llist_entry(p, t, m)   vsf_container_of(p, t, m)
#define	llist_for_each(pos, node)    for ((pos) = (node); pos; (pos) = (pos)->next)
#define	llist_for_each_safe(pos, n, node)    for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
#define	llist_for_each_entry(pos, node, member)
#define	llist_for_each_entry_safe(pos, n, node, member)

Macro Definition Documentation

LLIST_HEAD_INIT

#define LLIST_HEAD_INIT

(

name

)

{ NULL }

LLIST_HEAD

#define LLIST_HEAD

(

name

)

struct llist_head name = LLIST_HEAD_INIT(name)

llist_entry

#define llist_entry	(		p,
			t,
			m
	)		vsf_container_of(p, t, m)

llist_for_each

#define llist_for_each	(		pos,
			node
	)		for ((pos) = (node); pos; (pos) = (pos)->next)

llist_for_each_safe

#define llist_for_each_safe	(		pos,
			n,
			node
	)		for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))

llist_for_each_entry

#define llist_for_each_entry	(		pos,
			node,
			member
	)

Value:

    for ((pos) = llist_entry((node), typeof(*(pos)), member);                   \
         member_address_is_nonnull(pos, member);                                \
         (pos) = llist_entry((pos)->member.next, typeof(*(pos)), member))

llist_for_each_entry_safe

#define llist_for_each_entry_safe	(		pos,
			n,
			node,
			member
	)

Value:

    for (pos = llist_entry((node), typeof(*pos), member);                       \
         member_address_is_nonnull(pos, member) &&                              \
            (n = llist_entry(pos->member.next, typeof(*n), member), true);      \
         pos = n)