51 return (head->
next == head);
95 #define TFM_LIST_FOR_EACH(node, head) \
96 for (node = (head)->next; node != head; node = node->next)
__STATIC_INLINE void tfm_list_del_node(struct tfm_list_node_t *node)
Delete one node from list.
struct tfm_list_node_t * next
__STATIC_INLINE struct tfm_list_node_t * tfm_list_first_node(struct tfm_list_node_t *head)
Retrieve the fist node from list.
__STATIC_INLINE void tfm_list_insert_first(struct tfm_list_node_t *head, struct tfm_list_node_t *node)
Insert one node to list head.
struct tfm_list_node_t * prev
__STATIC_INLINE void tfm_list_init(struct tfm_list_node_t *head)
Initialize list head.
__STATIC_INLINE int32_t tfm_list_is_empty(struct tfm_list_node_t *head)
Check if a list is empty.
__STATIC_INLINE void tfm_list_add_tail(struct tfm_list_node_t *head, struct tfm_list_node_t *node)
Add one node to list tail.