Lines Matching refs:n
61 rt_inline void rt_list_insert_after(rt_list_t *l, rt_list_t *n) in rt_list_insert_after() argument
63 l->next->prev = n; in rt_list_insert_after()
64 n->next = l->next; in rt_list_insert_after()
66 l->next = n; in rt_list_insert_after()
67 n->prev = l; in rt_list_insert_after()
76 rt_inline void rt_list_insert_before(rt_list_t *l, rt_list_t *n) in rt_list_insert_before() argument
78 l->prev->next = n; in rt_list_insert_before()
79 n->prev = l->prev; in rt_list_insert_before()
81 l->prev = n; in rt_list_insert_before()
82 n->next = l; in rt_list_insert_before()
89 rt_inline void rt_list_remove(rt_list_t *n) in rt_list_remove() argument
91 n->next->prev = n->prev; in rt_list_remove()
92 n->prev->next = n->next; in rt_list_remove()
94 n->next = n->prev = n; in rt_list_remove()
146 #define rt_list_for_each_safe(pos, n, head) \ argument
147 for (pos = (head)->next, n = pos->next; pos != (head); \
148 pos = n, n = pos->next)
168 #define rt_list_for_each_entry_safe(pos, n, head, member) \ argument
170 n = rt_list_entry(pos->member.next, rt_typeof(*pos), member); \
172 pos = n, n = rt_list_entry(n->member.next, rt_typeof(*n), member))
197 rt_inline void rt_slist_append(rt_slist_t *l, rt_slist_t *n) in rt_slist_append() argument
205 node->next = n; in rt_slist_append()
206 n->next = RT_NULL; in rt_slist_append()
209 rt_inline void rt_slist_insert(rt_slist_t *l, rt_slist_t *n) in rt_slist_insert() argument
211 n->next = l->next; in rt_slist_insert()
212 l->next = n; in rt_slist_insert()
243 rt_inline rt_slist_t *rt_slist_remove(rt_slist_t *l, rt_slist_t *n) in rt_slist_remove() argument
247 while (node->next && node->next != n) node = node->next; in rt_slist_remove()
253 n->next = RT_NULL; in rt_slist_remove()
271 rt_inline rt_slist_t *rt_slist_next(rt_slist_t *n) in rt_slist_next() argument
273 return n->next; in rt_slist_next()