| /hyp/interfaces/util/include/ |
| A D | list.h | 15 list_init(list_t *list);
18 list_get_head(list_t *list);
21 list_is_empty(list_t *list);
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,
48 list_insert_at_tail_release(list_t *list, list_node_t *node);
58 list_delete_node(list_t *list, list_node_t *node);
63 for ((node) = atomic_load_relaxed(&(list)->head.next); \
64 (node) != &(list)->head; \
[all …]
|
| /hyp/core/util/src/ |
| A D | list.c | 11 list_init(list_t *list) in list_init() argument
13 assert(list != NULL); in list_init()
22 list_is_empty(list_t *list) in list_is_empty() argument
24 assert(list != NULL); in list_is_empty()
26 return (atomic_load_relaxed(&list->head.next) == &list->head); in list_is_empty()
32 assert(list != NULL); in list_get_head()
43 assert(list != NULL); in list_insert_at_head_explicit()
66 assert(list != NULL); in list_insert_at_tail_explicit()
97 assert(list != NULL); in list_insert_in_order_explicit()
143 (void)list; in list_insert_after_node_explicit()
[all …]
|
| /hyp/core/wait_queue_broadcast/src/ |
| A D | wait_queue.c | 41 list_init(&wait_queue->list); in wait_queue_init()
58 list_insert_at_tail(&wait_queue->list, node); in wait_queue_prepare()
75 (void)list_delete_node(&wait_queue->list, node); in wait_queue_finish()
127 list_t *list = &wait_queue->list; in wait_queue_wakeup() local
129 list_foreach_container (thread, list, thread, wait_queue_list_node) { in wait_queue_wakeup()
|
| /hyp/vm/psci/src/ |
| A D | psci_pm_list.c | 37 list_t *list = &CPULOCAL_BY_INDEX(vcpu_pm_list, cpu_index); in psci_pm_list_insert() local
40 list_insert_at_tail_release(list, &vcpu->psci_pm_list_node); in psci_pm_list_insert()
47 list_t *list = &CPULOCAL_BY_INDEX(vcpu_pm_list, cpu_index); in psci_pm_list_delete() local
50 (void)list_delete_node(list, &vcpu->psci_pm_list_node); in psci_pm_list_delete()
|
| /hyp/core/timer_lp/src/ |
| A D | timer_lp_queue.c | 31 list_init(&timer_lp_queue.list); in timer_lp_queue_handle_boot_cold_init()
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()
81 list_node_t *head = list_get_head(&timer_lp_queue.list); in timer_lp_dequeue()
86 } else if (list_is_empty(&timer_lp_queue.list)) { in timer_lp_dequeue()
144 list_node_t *head = list_get_head(&timer_lp_queue.list); in timer_lp_sync()
163 list_node_t *head = list_get_head(&timer_lp_queue.list); in timer_lp_sync()
|
| /hyp/core/timer/src/ |
| A D | timer_queue.c | 41 list_init(&tq->list); in timer_handle_boot_cold_init()
156 bool new_head = list_insert_in_order(&tq->list, &timer->list_node, in timer_enqueue_internal()
176 bool new_head = list_delete_node(&tq->list, &timer->list_node); in timer_dequeue_internal()
178 list_node_t *head = list_get_head(&tq->list); in timer_dequeue_internal()
182 } else if (list_is_empty(&tq->list)) { in timer_dequeue_internal()
219 list_delete_node(&tq->list, &timer->list_node); in timer_update_internal()
224 list_insert_in_order(&tq->list, &timer->list_node, in timer_update_internal()
228 list_node_t *head = list_get_head(&tq->list); in timer_update_internal()
308 list_node_t *head = list_get_head(&tq->list); in timer_dequeue_expired()
392 list_insert_in_order(&ttq->list, &timer->list_node, in timer_try_move_to_cpu()
[all …]
|
| /hyp/interfaces/util/ |
| A D | build.conf | 6 types list.tc
|
| /hyp/core/util/ |
| A D | build.conf | 11 source list.c
|
| /hyp/vm/rootvm_package/src/ |
| A D | package.c | 283 (rootvm_package_image_type_t)pkg_hdr->list[i].type; in rootvm_package_handle_rootvm_init()
292 pkg_hdr->list[i].offset); in rootvm_package_handle_rootvm_init()
294 if (pkg_hdr->list[i].offset > map_size) { in rootvm_package_handle_rootvm_init()
299 map_size - pkg_hdr->list[i].offset; in rootvm_package_handle_rootvm_init()
|
| /hyp/core/scheduler_fprr/src/ |
| A D | scheduler_fprr.c | 130 list_t *list = &scheduler->runqueue[i]; in add_to_runqueue() local
131 bool was_empty = list_is_empty(list); in add_to_runqueue()
136 list_insert_at_tail(list, &target->scheduler_list_node); in add_to_runqueue()
138 list_insert_at_head(list, &target->scheduler_list_node); in add_to_runqueue()
153 list_t *list = &scheduler->runqueue[i]; 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()
160 assert(list_is_empty(list)); in remove_from_runqueue()
172 list_t *list = &scheduler->runqueue[i]; in pop_runqueue_head() local
173 assert(!list_is_empty(list)); in pop_runqueue_head()
[all …]
|
| /hyp/core/cspace_twolevel/src/ |
| A D | cspace_twolevel.c | 806 list_t *list = &header->cap_list; in cspace_revoke_caps() local
807 assert(list_get_head(list) == &master_cap->cap_list_node); in cspace_revoke_caps()
812 list_foreach_container_maydelete (curr_cap, list, cap, cap_list_node) { in cspace_revoke_caps()
|
| /hyp/mem/memextent/src/ |
| A D | memextent_basic.c | 1011 list_t *list = &addrspace->basic_mapping_list; in memextent_deactivate_addrspace_basic() local
1015 list_foreach_container_maydelete (map, list, memextent_basic_mapping, in memextent_deactivate_addrspace_basic()
1017 (void)list_delete_node(list, &map->mapping_list_node); in memextent_deactivate_addrspace_basic()
|
| /hyp/mem/memextent_sparse/src/ |
| A D | memextent_sparse.c | 1504 list_t *list = &addrspace->sparse_mapping_list; in memextent_deactivate_addrspace_sparse() local
1507 list_foreach_container_maydelete (map, list, memextent_sparse_mapping, in memextent_deactivate_addrspace_sparse()
1517 (void)list_delete_node(list, &map->mapping_list_node); in memextent_deactivate_addrspace_sparse()
|