Home
last modified time | relevance | path

Searched defs:node (Results 1 – 5 of 5) sorted by relevance

/hyp/core/util/src/
A Dlist.c34 list_node_t *node = atomic_load_relaxed(&list->head.next); in list_get_head() local
40 list_insert_at_head_explicit(list_t *list, list_node_t *node, in list_insert_at_head_explicit()
57 list_insert_at_head(list_t *list, list_node_t *node) in list_insert_at_head()
63 list_insert_at_tail_explicit(list_t *list, list_node_t *node, in list_insert_at_tail_explicit()
80 list_insert_at_tail(list_t *list, list_node_t *node) in list_insert_at_tail()
86 list_insert_at_tail_release(list_t *list, list_node_t *node) in list_insert_at_tail_release()
92 list_insert_in_order_explicit(list_t *list, list_node_t *node, in list_insert_in_order_explicit()
129 list_insert_in_order(list_t *list, list_node_t *node, in list_insert_in_order()
138 list_node_t *node, memory_order order) in list_insert_after_node_explicit()
155 list_insert_after_node(list_t *list, list_node_t *prev, list_node_t *node) in list_insert_after_node()
[all …]
/hyp/core/wait_queue_broadcast/src/
A Dwait_queue.c48 list_node_t *node = &self->wait_queue_list_node; in wait_queue_prepare() local
73 list_node_t *node = &self->wait_queue_list_node; in wait_queue_finish() local
/hyp/interfaces/util/include/
A Dlist.h62 #define list_foreach(node, list) \ argument
/hyp/mem/allocator_list/src/
A Dfreelist.c163 list_add(allocator_node_t **head, allocator_node_t *node, size_t size) in list_add()
/hyp/core/scheduler_fprr/src/
A Dscheduler_fprr.c154 list_node_t *node = &target->scheduler_list_node; in remove_from_runqueue() local
175 list_node_t *node = list_get_head(list); in pop_runqueue_head() local

Completed in 12 milliseconds