48 bool btstack_linked_queue_empty(btstack_linked_queue_t * queue){  in btstack_linked_queue_empty()  argument
49     return queue->head == NULL;  in btstack_linked_queue_empty()
57 void btstack_linked_queue_enqueue(btstack_linked_queue_t * queue, btstack_linked_item_t * item){  in btstack_linked_queue_enqueue()  argument
58     if (queue->head == NULL){  in btstack_linked_queue_enqueue()
61         queue->head = item;  in btstack_linked_queue_enqueue()
62         queue->tail = item;  in btstack_linked_queue_enqueue()
66         queue->tail->next = item;  in btstack_linked_queue_enqueue()
67         queue->tail = item;  in btstack_linked_queue_enqueue()
76 btstack_linked_item_t * btstack_linked_queue_first(btstack_linked_queue_t * queue){  in btstack_linked_queue_first()  argument
77     return queue->head;  in btstack_linked_queue_first()
85 btstack_linked_item_t * btstack_linked_queue_dequeue(btstack_linked_queue_t * queue){  in btstack_linked_queue_dequeue()  argument
86     if (queue->head == NULL){  in btstack_linked_queue_dequeue()
89     btstack_linked_item_t * item = queue->head;  in btstack_linked_queue_dequeue()
90     queue->head = item->next;  in btstack_linked_queue_dequeue()
92     if (queue->head == NULL){  in btstack_linked_queue_dequeue()
93         queue->tail = NULL;  in btstack_linked_queue_dequeue()