Searched refs:head (Results 1 – 15 of 15) sorted by relevance
/SCP-firmware-master/framework/src/ |
A D | fwk_ring.c | 46 if ((ring->tail >= ring->head) && !ring->full) { in fwk_ring_get_length() 47 return (ring->tail - ring->head); in fwk_ring_get_length() 49 return ((ring->capacity - ring->head) + ring->tail); in fwk_ring_get_length() 71 return ((ring->head == ring->tail) && !ring->full); in fwk_ring_is_empty() 83 ring->head = fwk_ring_offset(ring, ring->head + buffer_size); in fwk_ring_pop() 104 if (fwk_ring_offset(ring, ring->head + buffer_size) > ring->head) { in fwk_ring_peek() 105 (void)memcpy(buffer, ring->storage + ring->head, buffer_size); in fwk_ring_peek() 107 size_t chunk_size = ring->capacity - ring->head; in fwk_ring_peek() 109 (void)memcpy(buffer, ring->storage + ring->head, chunk_size); in fwk_ring_peek() 156 ring->head = ring->tail; in fwk_ring_push() [all …]
|
A D | fwk_slist.c | 22 list->head = (struct fwk_slist_node *)list; in __fwk_slist_init() 34 return list->head; in __fwk_slist_head() 43 is_empty = list->head == (struct fwk_slist_node *)list; in __fwk_slist_is_empty() 46 fwk_assert(list->tail == list->head); in __fwk_slist_is_empty() 60 new->next = list->head; in __fwk_slist_push_head() 62 list->head = new; in __fwk_slist_push_head() 92 popped = list->head; in __fwk_slist_pop_head() 97 list->head = popped->next; in __fwk_slist_pop_head() 167 static_assert(offsetof(struct fwk_slist, head) ==
|
A D | fwk_dlist.c | 26 list->head->prev = new; in __fwk_dlist_push_head() 57 list->head->prev = (struct fwk_dlist_node *)list; in __fwk_dlist_pop_head() 117 static_assert(offsetof(struct fwk_dlist, head) == 118 offsetof(struct fwk_slist, head), 125 static_assert(offsetof(struct fwk_dlist, head) == 129 static_assert(offsetof(struct fwk_dlist, head) ==
|
/SCP-firmware-master/framework/test/ |
A D | test_fwk_list_pop.c | 31 assert(slist.head == (struct fwk_slist_node *)&slist); in test_slist_pop_head_on_empty() 39 assert(dlist.head == (struct fwk_dlist_node *)&dlist); in test_dlist_pop_head_on_empty() 49 assert(slist.head == (struct fwk_slist_node *)&slist); in test_slist_pop_head_on_one() 59 assert(dlist.head == (struct fwk_dlist_node *)&dlist); in test_dlist_pop_head_on_one() 70 assert(slist.head == &snodes[1]); in test_slist_pop_head_on_two() 83 assert(dlist.head == &dnodes[1]); in test_dlist_pop_head_on_two() 98 assert(slist.head == &snodes[1]); in test_slist_pop_head_on_many() 113 assert(dlist.head == &dnodes[1]); in test_dlist_pop_head_on_many()
|
A D | test_fwk_list_push.c | 36 assert(slist.head == &snodes[0]); in test_slist_push_head_from_empty() 46 assert(dlist.head == &dnodes[0]); in test_dlist_push_head_from_empty() 57 assert(slist.head == &snodes[0]); in test_slist_push_back_from_empty() 67 assert(dlist.head == &dnodes[0]); in test_dlist_push_back_from_empty() 79 assert(slist.head == &snodes[1]); in test_slist_push_head() 91 assert(dlist.head == &dnodes[1]); in test_dlist_push_head() 106 assert(slist.head == &snodes[0]); in test_slist_push_back() 118 assert(dlist.head == &dnodes[0]); in test_dlist_push_back()
|
A D | test_fwk_list_remove.c | 37 assert(slist.head == (struct fwk_slist_node *)&slist); in test_slist_remove_on_one() 47 assert(slist.head == &snodes[1]); in test_slist_remove_first_of_two() 58 assert(slist.head == &snodes[0]); in test_slist_remove_second_of_two() 70 assert(slist.head == &snodes[0]); in test_slist_remove_second_of_three() 80 assert(dlist.head == (struct fwk_dlist_node *)&dlist); in test_dlist_remove_on_one() 90 assert(dlist.head == &dnodes[1]); in test_dlist_remove_first_of_two() 102 assert(dlist.head == &dnodes[0]); in test_dlist_remove_second_of_two() 115 assert(dlist.head == &dnodes[0]); in test_dlist_remove_second_of_three()
|
A D | test_fwk_list_insert.c | 41 assert(list.head == &node[0]); in test_list_insert() 49 assert(list.head == &node[0]); in test_list_insert_empty() 60 assert(list.head == &node[0]); in test_list_insert_tail_implicit() 65 assert(list.head == &node[0]); in test_list_insert_tail_implicit()
|
A D | test_fwk_list_init.c | 19 assert(list.head == (struct fwk_slist_node *)&list); in test_slist_init() 29 assert(list.head == (struct fwk_dlist_node *)&list); in test_dlist_init()
|
A D | test_fwk_core.c | 159 ctx->free_event_queue.head == in test___fwk_init() 222 assert(ctx->isr_event_queue.head == &(event3.slist_node)); in test___fwk_run_main_loop() 224 assert(ctx->event_queue.head == &(event2.slist_node)); in test___fwk_run_main_loop() 241 assert(ctx->isr_event_queue.head == &(event3.slist_node)); in test___fwk_run_main_loop() 243 assert(ctx->event_queue.head == &(allocated_event->slist_node)); in test___fwk_run_main_loop() 260 assert(ctx->isr_event_queue.head == &(event3.slist_node)); in test___fwk_run_main_loop() 280 assert(ctx->isr_event_queue.head == &(notification1.slist_node)); in test___fwk_run_main_loop() 301 assert(ctx->event_queue.head == &(allocated_event->slist_node)); in test___fwk_run_main_loop()
|
/SCP-firmware-master/tools/ |
A D | check_copyright.py | 132 head = '' 134 head += line 136 match = pattern.search(head)
|
/SCP-firmware-master/framework/include/ |
A D | fwk_ring.h | 52 size_t head; member
|
A D | fwk_dlist.h | 35 struct fwk_dlist_node *head; member
|
A D | fwk_slist.h | 36 struct fwk_slist_node *head; member
|
/SCP-firmware-master/module/i2c/doc/ |
A D | module_i2c_architecture.md | 27 is completed, the processing of the transaction request at the head of the 122 of the request associated to the head of the queue is then initiated. This is
|
/SCP-firmware-master/ |
A D | change_log.md | 480 thread: Get head of delayed response list
|
Completed in 11 milliseconds