96 _lthread_queue_empty(struct lthread_queue *q)  in _lthread_queue_empty()  argument
98 	return q->tail == q->head;  in _lthread_queue_empty()
107 static inline int _lthread_queue_destroy(struct lthread_queue *q)  in _lthread_queue_destroy()  argument
109 	if (q == NULL)  in _lthread_queue_destroy()
112 	if (!_lthread_queue_empty(q))  in _lthread_queue_destroy()
115 	_qnode_free(q->head);  in _lthread_queue_destroy()
116 	rte_free(q);  in _lthread_queue_destroy()
128 							  *q, void *data)  in _lthread_queue_insert_mp()
143 	    (struct qnode *)__sync_lock_test_and_set((uint64_t *) &(q)->head,  in _lthread_queue_insert_mp()
150 	DIAG_COUNT_INC(q, wr);  in _lthread_queue_insert_mp()
151 	DIAG_COUNT_INC(q, size);  in _lthread_queue_insert_mp()
162 							  *q, void *data)  in _lthread_queue_insert_sp()
176 	prev = q->head;  in _lthread_queue_insert_sp()
177 	prev->next = q->head = n;  in _lthread_queue_insert_sp()
179 	DIAG_COUNT_INC(q, wr);  in _lthread_queue_insert_sp()
180 	DIAG_COUNT_INC(q, size);  in _lthread_queue_insert_sp()
189 _lthread_queue_poll(struct lthread_queue *q)  in _lthread_queue_poll()  argument
192 	struct qnode *tail = q->tail;  in _lthread_queue_poll()
202 		q->tail = next;  in _lthread_queue_poll()
209 		DIAG_COUNT_INC(q, rd);  in _lthread_queue_poll()
210 		DIAG_COUNT_DEC(q, size);  in _lthread_queue_poll()
220 _lthread_queue_remove(struct lthread_queue *q)  in _lthread_queue_remove()  argument
230 		data = _lthread_queue_poll(q);  in _lthread_queue_remove()
234 			DIAG_COUNT_INC(q, rd);  in _lthread_queue_remove()
235 			DIAG_COUNT_DEC(q, size);  in _lthread_queue_remove()
239 	} while (unlikely(!_lthread_queue_empty(q)));  in _lthread_queue_remove()