| /Zephyr-latest/subsys/bluetooth/controller/util/ |
| D | memq.c | 9 * FIFO-style "memory queue" permitting enqueue at tail and dequeue from head.
14 * is given by head == tail.
29 * where H is the pointer to Head link-element (oldest element).
47 * @param head[out] Head of queue. Will be updated
51 memq_link_t *memq_init(memq_link_t *link, memq_link_t **head, memq_link_t **tail) in memq_init() argument
53 /* Head and tail pointer to the initial link - forms an empty queue */ in memq_init()
54 *head = *tail = link; in memq_init()
62 * @param head[in,out] Head of queue. Will be updated
64 * @return Head of queue before invalidation; NULL if queue was empty
66 memq_link_t *memq_deinit(memq_link_t **head, memq_link_t **tail) in memq_deinit() argument
[all …]
|
| D | memq.h | 21 memq_link_t *head; \
25 memq_link_t *memq_init(memq_link_t *link, memq_link_t **head,
29 memq_init(link, &memq_##name.head, &memq_##name.tail)
31 memq_link_t *memq_deinit(memq_link_t **head, memq_link_t **tail);
33 memq_link_t *memq_peek(memq_link_t *head, memq_link_t *tail, void **mem);
34 memq_link_t *memq_peek_n(memq_link_t *head, memq_link_t *tail, uint8_t n,
36 memq_link_t *memq_dequeue(memq_link_t *tail, memq_link_t **head, void **mem);
|
| D | mem.c | 44 void *head; in mem_acquire() local
53 memcpy(&head, mem, sizeof(head)); in mem_acquire()
56 if (head) { in mem_acquire()
57 *((uint16_t *)MROUND((uint8_t *)head + sizeof(head))) = in mem_acquire()
61 *mem_head = head; in mem_acquire()
|
| /Zephyr-latest/tests/subsys/usb/desc_sections/src/ |
| D | desc_sections.c | 113 static void interface_config(struct usb_desc_header *head, in interface_config() argument
116 struct usb_if_descriptor *if_desc = (struct usb_if_descriptor *)head; in interface_config()
118 LOG_DBG("head %p iface_num %u", head, iface_num); in interface_config()
160 static void check_endpoint_allocation(struct usb_desc_header *head) in check_endpoint_allocation() argument
166 while (head->bLength != 0) { in check_endpoint_allocation()
167 if (head->bDescriptorType == USB_DESC_INTERFACE) { in check_endpoint_allocation()
168 struct usb_if_descriptor *if_descr = (void *)head; in check_endpoint_allocation()
184 if (head->bDescriptorType == USB_DESC_ENDPOINT) { in check_endpoint_allocation()
186 (struct usb_ep_descriptor *)head; in check_endpoint_allocation()
197 head = (struct usb_desc_header *)((uint8_t *)head + head->bLength); in check_endpoint_allocation()
[all …]
|
| /Zephyr-latest/subsys/usb/device/ |
| D | usb_descriptor.c | 218 struct usb_desc_header *head = __usb_descriptor_start; in usb_get_str_descriptor_idx() local
222 while (head->bLength != 0U) { in usb_get_str_descriptor_idx()
223 switch (head->bDescriptorType) { in usb_get_str_descriptor_idx()
225 if (head == (struct usb_desc_header *)str) { in usb_get_str_descriptor_idx()
236 head = (struct usb_desc_header *)((uint8_t *)head + head->bLength); in usb_get_str_descriptor_idx()
416 static int usb_fix_descriptor(struct usb_desc_header *head) in usb_fix_descriptor() argument
426 while (head->bLength != 0U) { in usb_fix_descriptor()
427 switch (head->bDescriptorType) { in usb_fix_descriptor()
429 LOG_DBG("Device descriptor %p", head); in usb_fix_descriptor()
430 usb_desc_update_mps0((void *)head); in usb_fix_descriptor()
[all …]
|
| /Zephyr-latest/include/zephyr/sys/ |
| D | dlist.h | 18 * The lists are expected to be initialized such that both the head and tail
38 struct _dnode *head; /* ptr to head of list (sys_dlist_t) */ member
88 * the head.
94 * it contains the starting node, or NULL to start from the head
135 * @brief Provide the primitive to peek container of the list head
204 list->head = (sys_dnode_t *)list; in sys_dlist_init()
239 * @brief check if a node is the list's head
244 * @return true if node is the head, false otherwise
249 return list->head == node; in sys_dlist_is_head()
276 return list->head == list; in sys_dlist_is_empty()
[all …]
|
| D | mpsc_lockfree.h | 87 mpsc_ptr_t head; member
101 .head = (struct mpsc_node *)&symbol.stub, \
115 mpsc_ptr_set(q->head, &q->stub); in mpsc_init()
134 prev = (struct mpsc_node *)mpsc_ptr_set_get(q->head, n); in mpsc_push()
147 struct mpsc_node *head; in mpsc_pop() local
168 head = (struct mpsc_node *)mpsc_ptr_get(q->head); in mpsc_pop()
170 /* If next is NULL, and the tail != HEAD then the queue has pending in mpsc_pop()
173 if (tail != head) { in mpsc_pop()
|
| /Zephyr-latest/samples/arch/smp/pktqueue/src/ |
| D | pktqueue.c | 17 queue->head = queue->tail = desc; in phdr_desc_enqueue()
38 return_ptr = queue->head; in phdr_desc_dequeue()
39 queue->head = queue->head->next; in phdr_desc_dequeue()
|
| /Zephyr-latest/tests/kernel/queue/src/ |
| D | test_queue_fail.c | 50 * 1. Verify that the list's head is empty.
63 static qdata_t *head = NULL, *tail = &data_l[1]; in ZTEST() local
68 /* Check if the list of head is equal to null */ in ZTEST()
69 zassert_true(k_queue_append_list(&queue, (uint32_t *)head, in ZTEST()
71 "failed to CHECKIF head == NULL"); in ZTEST()
73 head = &data_l[0]; in ZTEST()
75 zassert_true(k_queue_append_list(&queue, (uint32_t *)head, in ZTEST()
82 head = &data_l[0]; in ZTEST()
83 head->snode.next = NULL; in ZTEST()
86 head, NULL, K_PRIO_PREEMPT(0), 0, K_NO_WAIT); in ZTEST()
[all …]
|
| /Zephyr-latest/subsys/sip_svc/ |
| D | sip_svc_id_mgr.c | 59 id_pool->head = 0; in sip_svc_id_mgr_create()
91 if (id_pool->head == SIP_SVC_ID_INVALID) { in sip_svc_id_mgr_alloc()
95 id = id_pool->id_list[id_pool->head]; in sip_svc_id_mgr_alloc()
102 if (id_pool->head == id_pool->tail) { in sip_svc_id_mgr_alloc()
103 id_pool->head = SIP_SVC_ID_INVALID; in sip_svc_id_mgr_alloc()
106 id_pool->head++; in sip_svc_id_mgr_alloc()
107 if (id_pool->head == id_pool->size) { in sip_svc_id_mgr_alloc()
108 id_pool->head = 0; in sip_svc_id_mgr_alloc()
140 if (id_pool->head == SIP_SVC_ID_INVALID) { in sip_svc_id_mgr_free()
141 id_pool->head = 0; in sip_svc_id_mgr_free()
[all …]
|
| /Zephyr-latest/subsys/demand_paging/eviction/ |
| D | lru.c | 23 * - On page reclammation, the page at the head of the queue is removed for
24 * that purpose. The new head page is marked unaccessible.
26 * - If the new head page is actively used, it will cause a fault and be moved
28 * reclamation victim. Then the new head page is made unaccessible.
30 * This way, unused pages will migrate toward the head of the queue, used
53 * The extra entry is used to store head and tail indexes.
66 /* Slot 0 is for head and tail indexes (actual indexes are offset by 1) */
115 /* make new head PF unaccessible if it exists and it is not alone */ in lru_pf_remove()
|
| /Zephyr-latest/tests/net/lib/http_server/crime/src/ |
| D | index.html | 3 <head>
5 </head>
|
| D | not_found_page.html | 3 <head>
5 </head>
|
| /Zephyr-latest/tests/net/lib/http_server/tls/src/ |
| D | index.html | 3 <head>
5 </head>
|
| /Zephyr-latest/tests/lib/lockfree/src/ |
| D | test_mpsc.c | 28 mpsc_ptr_t node, head; in ZTEST() local
33 head = mpsc_ptr_get(push_pop_q.head); in ZTEST()
38 zassert_equal(head, stub, "Head should point at stub"); in ZTEST()
47 head = mpsc_ptr_get(push_pop_q.head); in ZTEST()
49 zassert_equal(head, &push_pop_nodes[0], "Queue head should point at push_pop_node"); in ZTEST()
|
| /Zephyr-latest/tests/unit/list/ |
| D | dlist.c | 148 sys_dnode_t *head, in verify_tail_head() argument
152 if (sys_dlist_peek_head(list) != head) { in verify_tail_head()
198 "test_list head/tail are wrong"); in ZTEST()
216 "test_list head/tail are wrong"); in ZTEST()
233 "test_list head/tail are wrong"); in ZTEST()
243 "test_list head/tail are wrong"); in ZTEST()
254 "test_list head/tail are wrong"); in ZTEST()
267 "test_list head/tail are wrong"); in ZTEST()
276 "test_list head/tail are wrong"); in ZTEST()
285 "test_list head/tail are wrong"); in ZTEST()
[all …]
|
| D | slist.c | 149 sys_snode_t *head, in verify_tail_head() argument
153 if (sys_slist_peek_head(list) != head) { in verify_tail_head()
203 "test_list head/tail are wrong"); in ZTEST()
224 "test_list head/tail are wrong"); in ZTEST()
241 "test_list head/tail are wrong"); in ZTEST()
251 "test_list head/tail are wrong"); in ZTEST()
262 "test_list head/tail are wrong"); in ZTEST()
283 "test_list head/tail are wrong"); in ZTEST()
292 "test_list head/tail are wrong"); in ZTEST()
301 "test_list head/tail are wrong"); in ZTEST()
[all …]
|
| /Zephyr-latest/tests/benchmarks/data_structure_perf/dlist_perf/src/ |
| D | dlist_perf.c | 177 * @brief Test that access the 'head' and 'tail' in constant time
180 * defined two pointers---'head','tail'.No matter how many nodes
181 * dlist have, get head and tail from the dlist directly.the time
182 * complexity of accessing head and tail is O(1).
190 sys_dnode_t *head, *tail; in ZTEST() local
198 /* Get 'head' node directly, the time complexity is O(1) */ in ZTEST()
199 head = list.head; in ZTEST()
200 zassert_true(head == &node[0], in ZTEST()
201 "dlist can't access 'head' in constant time"); in ZTEST()
|
| /Zephyr-latest/doc/kernel/data_structures/ |
| D | dlist.rst | 10 the head, tail or any internal node). To do this, the list stores two
22 Primitive operations may retrieve the head/tail of a list and the
30 :c:func:`sys_dlist_remove`, by adding a node to the head or tail of a list
54 struct contains "head" and "tail" pointer fields, the :c:type:`sys_dnode_t`
63 * The head and tail of the list can be detected by comparing the
67 of inserting at the head or tail. There are never any NULL pointers
|
| D | slist.rst | 9 constant-time access to the first (head) and last (tail) elements of
10 the list, insertion before the head and after the tail of the list and
11 constant time removal of the head. Removal of subsequent nodes
35 Lists may be modified by adding a single node at the head or tail with
70 "head" and "tail" pointer fields. And a :c:type:`sys_snode_t` stores only a
94 and "set" primitives for each of head, tail and next pointers on their
|
| /Zephyr-latest/subsys/bluetooth/controller/ll_sw/ |
| D | ull_tx_queue.h | 55 * @brief Peek head tx node of tx queue.
59 * @return Head tx node of the tx queue.
68 * @return Head tx node of the tx queue.
|
| /Zephyr-latest/include/zephyr/debug/ |
| D | object_tracing.h | 14 * @brief Head element of the thread monitor list.
16 * @details Access the head element of the thread monitor list.
|
| /Zephyr-latest/kernel/ |
| D | queue.c | 247 int k_queue_append_list(struct k_queue *queue, void *head, void *tail) in k_queue_append_list() argument
251 /* invalid head or tail of list */ in k_queue_append_list()
252 CHECKIF((head == NULL) || (tail == NULL)) { in k_queue_append_list()
261 if (head != NULL) { in k_queue_append_list()
265 while ((head != NULL) && (thread != NULL)) { in k_queue_append_list()
266 prepare_thread_to_run(thread, head); in k_queue_append_list()
267 head = *(void **)head; in k_queue_append_list()
271 if (head != NULL) { in k_queue_append_list()
272 sys_sflist_append_list(&queue->data_q, head, tail); in k_queue_append_list()
304 ret = k_queue_append_list(queue, list->head, list->tail); in k_queue_merge_slist()
|
| /Zephyr-latest/.github/workflows/ |
| D | scripts_tests.yml | 34 ref: ${{ github.event.pull_request.head.sha }}
41 PR_HEAD: ${{ github.event.pull_request.head.sha }}
49 git log --graph --oneline HEAD...${PR_HEAD}
|
| /Zephyr-latest/boards/native/nrf_bsim/common/ |
| D | bstests_entry.c | 34 struct bst_test_list *head = tests; in bst_add_tests() local
43 head = bs_malloc(sizeof(struct bst_test_list)); in bst_add_tests()
44 head->next = NULL; in bst_add_tests()
45 head->test_instance = (struct bst_test_instance *) in bst_add_tests()
47 tail = head; in bst_add_tests()
59 return head; in bst_add_tests()
|
