Home
last modified time | relevance | path

Searched full:head (Results 1 – 25 of 166) sorted by relevance

1234567

/Zephyr-Core-3.4.0/subsys/bluetooth/controller/util/
Dmemq.c9 * 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 …]
Dmemq.h21 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);
Dmem.c44 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-Core-3.4.0/tests/subsys/usb/desc_sections/src/
Ddesc_sections.c113 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-Core-3.4.0/subsys/usb/device/
Dusb_descriptor.c194 struct usb_desc_header *head = __usb_descriptor_start; in usb_get_str_descriptor_idx() local
198 while (head->bLength != 0U) { in usb_get_str_descriptor_idx()
199 switch (head->bDescriptorType) { in usb_get_str_descriptor_idx()
201 if (head == (struct usb_desc_header *)str) { in usb_get_str_descriptor_idx()
212 head = (struct usb_desc_header *)((uint8_t *)head + head->bLength); in usb_get_str_descriptor_idx()
393 static int usb_fix_descriptor(struct usb_desc_header *head) in usb_fix_descriptor() argument
403 while (head->bLength != 0U) { in usb_fix_descriptor()
404 switch (head->bDescriptorType) { in usb_fix_descriptor()
406 LOG_DBG("Device descriptor %p", head); in usb_fix_descriptor()
407 usb_desc_update_mps0((void *)head); in usb_fix_descriptor()
[all …]
/Zephyr-Core-3.4.0/include/zephyr/sys/
Ddlist.h15 * The lists are expected to be initialized such that both the head and tail
39 struct _dnode *head; /* ptr to head of list (sys_dlist_t) */ member
83 * the head.
89 * it contains the starting node, or NULL to start from the head
130 * @brief Provide the primitive to peek container of the list head
199 list->head = (sys_dnode_t *)list; in sys_dlist_init()
231 * @brief check if a node is the list's head
236 * @return true if node is the head, false otherwise
241 return list->head == node; in sys_dlist_is_head()
268 return list->head == list; in sys_dlist_is_empty()
[all …]
Dslist.h36 sys_snode_t *head; member
78 * the head.
84 * it contains the starting node, or NULL to start from the head
120 * @brief Provide the primitive to peek container of the list head
198 list->head = NULL; in sys_slist_init()
216 list->head = node; in z_slist_head_set()
233 return list->head; in sys_slist_peek_head()
323 * @param head A pointer to the first element of the list to append
327 void *head, void *tail);
394 * (can be NULL, which means the node is the list's head)
Dlist_gen.h116 void *head, void *tail) \
118 if (head != NULL && tail != NULL) { \
121 (sys_ ## __nname ## _t *)head); \
125 (sys_ ## __nname ## _t *)head); \
138 sys_ ## __nname ## _t *head, *tail; \
139 head = sys_ ## __lname ## _peek_head(list_to_append); \
141 sys_ ## __lname ## _append_list(list, head, tail); \
/Zephyr-Core-3.4.0/samples/arch/smp/pktqueue/src/
Dpktqueue.c17 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-Core-3.4.0/include/zephyr/rtio/
Drtio_mpsc.h89 mpsc_ptr_t head; member
103 .head = (struct rtio_mpsc_node *)&symbol.stub, \
117 mpsc_ptr_set(q->head, &q->stub); in rtio_mpsc_init()
136 prev = (struct rtio_mpsc_node *)mpsc_ptr_set_get(q->head, n); in rtio_mpsc_push()
149 struct rtio_mpsc_node *head; in rtio_mpsc_pop() local
170 head = (struct rtio_mpsc_node *)mpsc_ptr_get(q->head); in rtio_mpsc_pop()
172 /* If next is NULL, and the tail != HEAD then the queue has pending in rtio_mpsc_pop()
175 if (tail != head) { in rtio_mpsc_pop()
/Zephyr-Core-3.4.0/tests/kernel/queue/src/
Dtest_queue_fail.c50 * 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-Core-3.4.0/subsys/sip_svc/
Dsip_svc_id_mgr.c59 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-Core-3.4.0/tests/subsys/rtio/rtio_api/src/
Dtest_rtio_mpsc.c29 mpsc_ptr_t node, head; in ZTEST() local
34 head = mpsc_ptr_get(push_pop_q.head); in ZTEST()
39 zassert_equal(head, stub, "Head should point at stub"); in ZTEST()
48 head = mpsc_ptr_get(push_pop_q.head); in ZTEST()
50 zassert_equal(head, &push_pop_nodes[0], "Queue head should point at push_pop_node"); in ZTEST()
/Zephyr-Core-3.4.0/tests/unit/list/
Ddlist.c140 sys_dnode_t *head, in verify_tail_head() argument
144 if (sys_dlist_peek_head(list) != head) { in verify_tail_head()
190 "test_list head/tail are wrong"); in ZTEST()
208 "test_list head/tail are wrong"); in ZTEST()
225 "test_list head/tail are wrong"); in ZTEST()
235 "test_list head/tail are wrong"); in ZTEST()
246 "test_list head/tail are wrong"); in ZTEST()
259 "test_list head/tail are wrong"); in ZTEST()
268 "test_list head/tail are wrong"); in ZTEST()
277 "test_list head/tail are wrong"); in ZTEST()
[all …]
Dslist.c141 sys_snode_t *head, in verify_tail_head() argument
145 if (sys_slist_peek_head(list) != head) { in verify_tail_head()
195 "test_list head/tail are wrong"); in ZTEST()
209 "test_list head/tail are wrong"); in ZTEST()
226 "test_list head/tail are wrong"); in ZTEST()
236 "test_list head/tail are wrong"); in ZTEST()
247 "test_list head/tail are wrong"); in ZTEST()
260 "test_list head/tail are wrong"); in ZTEST()
269 "test_list head/tail are wrong"); in ZTEST()
278 "test_list head/tail are wrong"); in ZTEST()
[all …]
Dsflist.c141 sys_sfnode_t *head, in verify_tail_head() argument
145 if (sys_sflist_peek_head(list) != head) { in verify_tail_head()
195 "test_list head/tail are wrong"); in ZTEST()
209 "test_list head/tail are wrong"); in ZTEST()
226 "test_list head/tail are wrong"); in ZTEST()
236 "test_list head/tail are wrong"); in ZTEST()
247 "test_list head/tail are wrong"); in ZTEST()
260 "test_list head/tail are wrong"); in ZTEST()
269 "test_list head/tail are wrong"); in ZTEST()
278 "test_list head/tail are wrong"); in ZTEST()
/Zephyr-Core-3.4.0/tests/benchmarks/data_structure_perf/dlist_perf/src/
Ddlist_perf.c177 * @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-Core-3.4.0/doc/kernel/data_structures/
Ddlist.rst10 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:struct:`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
Dslist.rst9 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:struct:`sys_snode_t` stores only a
94 and "set" primitives for each of head, tail and next pointers on their
/Zephyr-Core-3.4.0/kernel/
Dqueue.c244 int k_queue_append_list(struct k_queue *queue, void *head, void *tail) in k_queue_append_list() argument
248 /* invalid head or tail of list */ in k_queue_append_list()
249 CHECKIF(head == NULL || tail == NULL) { in k_queue_append_list()
258 if (head != NULL) { in k_queue_append_list()
262 while ((head != NULL) && (thread != NULL)) { in k_queue_append_list()
263 prepare_thread_to_run(thread, head); in k_queue_append_list()
264 head = *(void **)head; in k_queue_append_list()
268 if (head != NULL) { in k_queue_append_list()
269 sys_sflist_append_list(&queue->data_q, head, tail); in k_queue_append_list()
301 ret = k_queue_append_list(queue, list->head, list->tail); in k_queue_merge_slist()
/Zephyr-Core-3.4.0/boards/posix/nrf52_bsim/
Dbstests_entry.c32 struct bst_test_list *head = tests; in bst_add_tests() local
41 head = malloc(sizeof(struct bst_test_list)); in bst_add_tests()
42 head->next = NULL; in bst_add_tests()
43 head->test_instance = (struct bst_test_instance *) in bst_add_tests()
45 tail = head; in bst_add_tests()
57 return head; in bst_add_tests()
/Zephyr-Core-3.4.0/subsys/bluetooth/controller/ll_sw/
Dull_tx_queue.h55 * @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-Core-3.4.0/include/zephyr/debug/
Dobject_tracing.h14 * @brief Head element of the thread monitor list.
16 * @details Access the head element of the thread monitor list.
/Zephyr-Core-3.4.0/.github/workflows/
Dscripts_tests.yml34 ref: ${{ github.event.pull_request.head.sha }}
41 PR_HEAD: ${{ github.event.pull_request.head.sha }}
46 git log --graph --oneline HEAD...${PR_HEAD}
Dcompliance.yml17 ref: ${{ github.event.pull_request.head.sha }}
45 git log --pretty=oneline | head -n 10
58 git log --pretty=oneline | head -n 10

1234567