38 /** Single-linked list node structure. */
64  * @param __sn A sys_snode_t pointer to peek each node of the list
70  * @brief Provide the primitive to iterate on a list, from a node in the list
79  * Like SYS_SLIST_FOR_EACH_NODE(), but __dn already contains a node in the list
86  * @param __sn A sys_snode_t pointer to peek each node of the list
87  *             it contains the starting node, or NULL to start from the head
105  * @param __sn A sys_snode_t pointer to peek each node of the list
112  * @brief Provide the primitive to resolve the container of a list node
190  * These are the only functions that do not treat the list/node pointers
211 static inline sys_snode_t *z_snode_next_peek(sys_snode_t *node)  in z_snode_next_peek()  argument
213 	return node->next;  in z_snode_next_peek()
221 static inline void z_slist_head_set(sys_slist_t *list, sys_snode_t *node)  in z_slist_head_set()  argument
223 	list->head = node;  in z_slist_head_set()
226 static inline void z_slist_tail_set(sys_slist_t *list, sys_snode_t *node)  in z_slist_tail_set()  argument
228 	list->tail = node;  in z_slist_tail_set()
232  * @brief Peek the first node from the list
234  * @param list A point on the list to peek the first node from
236  * @return A pointer on the first node of the list (or NULL if none)
244  * @brief Peek the last node from the list
246  * @param list A point on the list to peek the last node from
248  * @return A pointer on the last node of the list (or NULL if none)
271  * @brief Peek the next node from current node, node is not NULL
273  * Faster then sys_slist_peek_next() if node is known not to be NULL.
275  * @param node A pointer on the node where to peek the next node
277  * @return a pointer on the next node (or NULL if none)
279 static inline sys_snode_t *sys_slist_peek_next_no_check(sys_snode_t *node);
284  * @brief Peek the next node from current node
286  * @param node A pointer on the node where to peek the next node
288  * @return a pointer on the next node (or NULL if none)
290 static inline sys_snode_t *sys_slist_peek_next(sys_snode_t *node);
295  * @brief Prepend a node to the given list
300  * @param node A pointer on the node to prepend
303 				     sys_snode_t *node);
308  * @brief Append a node to the given list
313  * @param node A pointer on the node to append
316 				    sys_snode_t *node);
324  * the pointer to the next node as the first element of a node, to @a list.
353  * @brief Insert a node to the given list
358  * @param prev A pointer on the previous node
359  * @param node A pointer on the node to insert
363 				    sys_snode_t *node);
368  * @brief Fetch and remove the first node of the given list
375  * @return A pointer to the first node of the list
382  * @brief Fetch and remove the first node of the given list
388  * @return A pointer to the first node of the list (or NULL if empty)
395  * @brief Remove a node
400  * @param prev_node A pointer on the previous node
401  *        (can be NULL, which means the node is the list's head)
402  * @param node A pointer on the node to remove
406 				    sys_snode_t *node);
411  * @brief Find and remove a node from a list
416  * @param node A pointer on the node to remove from the list
418  * @return true if node was removed
421 					     sys_snode_t *node);
424  * @brief Find if a node is already linked in a singly linked list
429  * @param node A pointer to the node to search in the list
430  * @param[out] prev A pointer to the previous node
432  * @return true if node was found in the list, false otherwise
434 static inline bool sys_slist_find(sys_slist_t *list, sys_snode_t *node,