Searched refs:l (Results 1 – 2 of 2) sorted by relevance
52 l->next = l->prev = l; in rt_list_init()66 l->next = n; in rt_list_insert_after()67 n->prev = l; in rt_list_insert_after()81 l->prev = n; in rt_list_insert_before()82 n->next = l; in rt_list_insert_before()103 return l->next == l; in rt_list_isempty()201 node = l; in rt_slist_append()212 l->next = n; in rt_slist_insert()256 return l; in rt_slist_remove()266 while (l->next) l = l->next; in rt_slist_tail()[all …]
238 rt_inline void rt_ll_slist_init(rt_ll_slist_t *l) in rt_ll_slist_init() argument240 l->next = 0; in rt_ll_slist_init()243 rt_inline void rt_ll_slist_enqueue(rt_ll_slist_t *l, rt_ll_slist_t *n) in rt_ll_slist_enqueue() argument246 exp = rt_atomic_load(&l->next); in rt_ll_slist_enqueue()250 } while (!rt_atomic_compare_exchange_strong(&l->next, &exp, (rt_base_t)n)); in rt_ll_slist_enqueue()253 rt_inline rt_ll_slist_t *rt_ll_slist_dequeue(rt_ll_slist_t *l) in rt_ll_slist_dequeue() argument258 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()
Completed in 3 milliseconds