42     pkt_linked_item_t *item = STAILQ_FIRST(header);  in pkt_queue_cleanup()  local
47     while (item != NULL) {  in pkt_queue_cleanup()
48         tmp = STAILQ_NEXT(item, next);  in pkt_queue_cleanup()
49         free_func(item);  in pkt_queue_cleanup()
50         item = tmp;  in pkt_queue_cleanup()
86     struct pkt_linked_item *item;  in pkt_queue_dequeue()  local
90     item = STAILQ_FIRST(header);  in pkt_queue_dequeue()
91     if (item != NULL) {  in pkt_queue_dequeue()
99     return item;  in pkt_queue_dequeue()
102 bool pkt_queue_enqueue(struct pkt_queue *queue, pkt_linked_item_t *item)  in pkt_queue_enqueue()  argument
104     if (queue == NULL || item == NULL) {  in pkt_queue_enqueue()
111     STAILQ_INSERT_TAIL(header, item, next);  in pkt_queue_enqueue()
138     pkt_linked_item_t *item;  in pkt_queue_try_peek_first()  local
140     item = STAILQ_FIRST(header);  in pkt_queue_try_peek_first()
143     return item;  in pkt_queue_try_peek_first()