include/linux/llist.h

77  * init_llist_node - initialize lock-less list node
78  * @node:	the node to be initialised
80  * In cases where there is a need to test if a node is on
81  * a list or not, this initialises the node to clearly
84 static inline void init_llist_node(struct llist_node *node)
86 	node->next = node;
90  * llist_on_list - test if a lock-list list node is on a list
91  * @node:	the node to test
93  * When a node is on a list the ->next pointer will be NULL or
94  * some other node.  It can never point to itself.  We use that
95  * in init_llist_node() to record that a node is not on any list,
98 static inline bool llist_on_list(const struct llist_node *node)
100 	return node->next != node;
132  * @node:	the first entry of deleted list entries
143 #define llist_for_each(pos, node)			\
144 	for ((pos) = (node); pos; (pos) = (pos)->next)
151  * @node:	the first entry of deleted list entries
162 #define llist_for_each_safe(pos, n, node)			\
163 	for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
168  * @node:	the fist entry of deleted list entries.
180 #define llist_for_each_entry(pos, node, member)				\
181 	for ((pos) = llist_entry((node), typeof(*(pos)), member);	\
190  * @node:	the first entry of deleted list entries.
202 #define llist_for_each_entry_safe(pos, n, node, member)			       \
203 	for (pos = llist_entry((node), typeof(*pos), member);		       \
221 static inline struct llist_node *llist_next(struct llist_node *node)
223 	return node->next;
284  * on the returned node so that llist_on_list() will report false for the node.