Searched refs:node (Results 1 – 6 of 6) sorted by relevance
| /hyp/core/util/src/ |
| A D | list.c | 36 return (node != &list->head) ? node : NULL; in list_get_head()
44 assert(node != NULL); in list_insert_at_head_explicit()
49 node->prev = prev; in list_insert_at_head_explicit()
53 next->prev = node; in list_insert_at_head_explicit()
67 assert(node != NULL); in list_insert_at_tail_explicit()
72 node->prev = prev; in list_insert_at_tail_explicit()
76 next->prev = node; in list_insert_at_tail_explicit()
119 node->prev = prev; in list_insert_in_order_explicit()
123 next->prev = node; in list_insert_in_order_explicit()
147 node->prev = prev; in list_insert_after_node_explicit()
[all …]
|
| /hyp/interfaces/util/include/ |
| A D | list.h | 24 list_insert_at_head(list_t *list, list_node_t *node);
27 list_insert_at_tail(list_t *list, list_node_t *node);
39 list_insert_in_order(list_t *list, list_node_t *node,
43 list_insert_after_node(list_t *list, list_node_t *prev, list_node_t *node);
48 list_insert_at_tail_release(list_t *list, list_node_t *node);
58 list_delete_node(list_t *list, list_node_t *node);
62 #define list_foreach(node, list) \ argument
63 for ((node) = atomic_load_relaxed(&(list)->head.next); \
64 (node) != &(list)->head; \
65 (node) = atomic_load_relaxed(&(node)->next))
[all …]
|
| /hyp/mem/allocator_list/src/ |
| A D | freelist.c | 169 *head = node; in list_add()
174 node->next = *head; in list_add()
175 node->size = size; in list_add()
176 *head = node; in list_add()
181 *head = node; in list_add()
194 (uint64_t)node)) { in list_add()
207 (uint64_t)node) { in list_add()
228 (uint64_t)node) { in list_add()
232 (uint64_t)node) { in list_add()
234 node->next = NULL; in list_add()
[all …]
|
| /hyp/core/wait_queue_broadcast/src/ |
| A D | wait_queue.c | 48 list_node_t *node = &self->wait_queue_list_node; in wait_queue_prepare() local
58 list_insert_at_tail(&wait_queue->list, node); in wait_queue_prepare()
73 list_node_t *node = &self->wait_queue_list_node; in wait_queue_finish() local
75 (void)list_delete_node(&wait_queue->list, node); in wait_queue_finish()
|
| /hyp/core/timer_lp/src/ |
| A D | timer_lp_queue.c | 64 bool new_head = list_insert_in_order(&timer_lp_queue.list, &timer->node, in timer_lp_enqueue()
77 bool new_head = list_delete_node(&timer_lp_queue.list, &timer->node); in timer_lp_dequeue()
|
| /hyp/core/scheduler_fprr/src/ |
| A D | scheduler_fprr.c | 154 list_node_t *node = &target->scheduler_list_node; in remove_from_runqueue() local
155 bool was_head = node == list_get_head(list); in remove_from_runqueue()
159 if (!list_delete_node(list, node) && was_head) { in remove_from_runqueue()
175 list_node_t *node = list_get_head(list); in pop_runqueue_head() local
176 assert(node != NULL); in pop_runqueue_head()
178 thread_t *head = thread_container_of_scheduler_list_node(node); in pop_runqueue_head()
|
Completed in 31 milliseconds