51 memq_link_t *memq_init(memq_link_t *link, memq_link_t **head, memq_link_t **tail)  in memq_init()  argument
54 	*head = *tail = link;  in memq_init()
66 memq_link_t *memq_deinit(memq_link_t **head, memq_link_t **tail)  in memq_deinit()  argument
71 	if (*head != *tail) {  in memq_deinit()
75 	old_head = *head;  in memq_deinit()
76 	*head = *tail = NULL;  in memq_deinit()
117 memq_link_t *memq_peek(memq_link_t *head, memq_link_t *tail, void **mem)  in memq_peek()  argument
120 	if (head == tail) {  in memq_peek()
126 		*mem = head->mem;  in memq_peek()
129 	return head; /* queue was not empty */  in memq_peek()
141 memq_link_t *memq_peek_n(memq_link_t *head, memq_link_t *tail, uint8_t n,  in memq_peek_n()  argument
147 		head = memq_peek(head, tail, mem);  in memq_peek_n()
148 		if (head == NULL) {  in memq_peek_n()
153 		head = head->next;  in memq_peek_n()
156 	return head; /*  queue was not empty */  in memq_peek_n()
168 memq_link_t *memq_dequeue(memq_link_t *tail, memq_link_t **head, void **mem)  in memq_dequeue()  argument
173 	old_head = memq_peek(*head, tail, mem);  in memq_dequeue()
179 	*head = old_head->next;  in memq_dequeue()