Searched refs:next (Results 1 – 5 of 5) sorted by relevance
64 n->next = l->next; in rt_list_insert_after()66 l->next = n; in rt_list_insert_after()92 n->prev->next = n->next; in rt_list_remove()138 for (pos = (head)->next; pos != (head); pos = pos->next)147 for (pos = (head)->next, n = pos->next; pos != (head); \202 while (node->next) node = node->next; in rt_slist_append()211 n->next = l->next; in rt_slist_insert()236 ((struct rt_slist_node *)l)->next = node->next; in rt_slist_pop()247 while (node->next && node->next != n) node = node->next; in rt_slist_remove()252 node->next = node->next->next; in rt_slist_remove()[all …]
240 l->next = 0; in rt_ll_slist_init()246 exp = rt_atomic_load(&l->next); in rt_ll_slist_enqueue()249 n->next = exp; in rt_ll_slist_enqueue()250 } while (!rt_atomic_compare_exchange_strong(&l->next, &exp, (rt_base_t)n)); in rt_ll_slist_enqueue()258 exp = rt_atomic_load(&l->next); in rt_ll_slist_dequeue()262 … } while (head && !rt_atomic_compare_exchange_strong(&l->next, &exp, rt_atomic_load(&head->next))); in rt_ll_slist_dequeue()
127 struct rt_list_node *next; /**< point to next node. */ member137 struct rt_slist_node *next; /**< point to next node. */ member146 rt_atomic_t next; /**< point to next node. */ member
488 nodetype iter, next; \494 rt_list_for_each_entry_safe(iter, next, &list, list_node) \1180 struct rt_memheap_item *next; /**< next memheap item */ member
569 struct rt_mq_message *next; member
Completed in 13 milliseconds