53  * @brief insert a node after a list
56  * @param n new node to be inserted
68  * @brief insert a node before a list
70  * @param n new node to be inserted
83  * @brief remove node from list.
84  * @param n the node to remove from the list.
122  * @param node the entry point
126 #define rt_list_entry(node, type, member) \  argument
127     rt_container_of(node, type, member)
196     struct rt_slist_node *node;  in rt_slist_append()  local
198     node = l;  in rt_slist_append()
199     while (node->next) node = node->next;  in rt_slist_append()
201     /* append the node to the tail */  in rt_slist_append()
202     node->next = n;  in rt_slist_append()
228     struct rt_slist_node *node = l;  in rt_slist_remove()  local
229     while (node->next && node->next != n) node = node->next;  in rt_slist_remove()
231     /* remove node */  in rt_slist_remove()
232     if (node->next != (rt_slist_t *)0) node->next = node->next->next;  in rt_slist_remove()
260  * @brief get the struct for this single list node
261  * @param node the entry point
265 #define rt_slist_entry(node, type, member) \  argument
266     rt_container_of(node, type, member)