112 static inline bool xskq_cons_read_addr_unchecked(struct xsk_queue *q, u64 *addr)  in xskq_cons_read_addr_unchecked()  argument
114 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_cons_read_addr_unchecked()
116 	if (q->cached_cons != q->cached_prod) {  in xskq_cons_read_addr_unchecked()
117 		u32 idx = q->cached_cons & q->ring_mask;  in xskq_cons_read_addr_unchecked()
171 static inline bool xskq_cons_is_valid_desc(struct xsk_queue *q,  in xskq_cons_is_valid_desc()  argument
176 		q->invalid_descs++;  in xskq_cons_is_valid_desc()
182 static inline bool xskq_cons_read_desc(struct xsk_queue *q,  in xskq_cons_read_desc()  argument
186 	while (q->cached_cons != q->cached_prod) {  in xskq_cons_read_desc()
187 		struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_cons_read_desc()
188 		u32 idx = q->cached_cons & q->ring_mask;  in xskq_cons_read_desc()
191 		if (xskq_cons_is_valid_desc(q, desc, pool))  in xskq_cons_read_desc()
194 		q->cached_cons++;  in xskq_cons_read_desc()
202 static inline void __xskq_cons_release(struct xsk_queue *q)  in __xskq_cons_release()  argument
205 	WRITE_ONCE(q->ring->consumer, q->cached_cons);  in __xskq_cons_release()
208 static inline void __xskq_cons_peek(struct xsk_queue *q)  in __xskq_cons_peek()  argument
211 	q->cached_prod = READ_ONCE(q->ring->producer);  in __xskq_cons_peek()
215 static inline void xskq_cons_get_entries(struct xsk_queue *q)  in xskq_cons_get_entries()  argument
217 	__xskq_cons_release(q);  in xskq_cons_get_entries()
218 	__xskq_cons_peek(q);  in xskq_cons_get_entries()
221 static inline bool xskq_cons_has_entries(struct xsk_queue *q, u32 cnt)  in xskq_cons_has_entries()  argument
223 	u32 entries = q->cached_prod - q->cached_cons;  in xskq_cons_has_entries()
228 	__xskq_cons_peek(q);  in xskq_cons_has_entries()
229 	entries = q->cached_prod - q->cached_cons;  in xskq_cons_has_entries()
234 static inline bool xskq_cons_peek_addr_unchecked(struct xsk_queue *q, u64 *addr)  in xskq_cons_peek_addr_unchecked()  argument
236 	if (q->cached_prod == q->cached_cons)  in xskq_cons_peek_addr_unchecked()
237 		xskq_cons_get_entries(q);  in xskq_cons_peek_addr_unchecked()
238 	return xskq_cons_read_addr_unchecked(q, addr);  in xskq_cons_peek_addr_unchecked()
241 static inline bool xskq_cons_peek_desc(struct xsk_queue *q,  in xskq_cons_peek_desc()  argument
245 	if (q->cached_prod == q->cached_cons)  in xskq_cons_peek_desc()
246 		xskq_cons_get_entries(q);  in xskq_cons_peek_desc()
247 	return xskq_cons_read_desc(q, desc, pool);  in xskq_cons_peek_desc()
250 static inline void xskq_cons_release(struct xsk_queue *q)  in xskq_cons_release()  argument
257 	q->cached_cons++;  in xskq_cons_release()
260 static inline bool xskq_cons_is_full(struct xsk_queue *q)  in xskq_cons_is_full()  argument
263 	return READ_ONCE(q->ring->producer) - READ_ONCE(q->ring->consumer) ==  in xskq_cons_is_full()
264 		q->nentries;  in xskq_cons_is_full()
267 static inline u32 xskq_cons_present_entries(struct xsk_queue *q)  in xskq_cons_present_entries()  argument
270 	return READ_ONCE(q->ring->producer) - READ_ONCE(q->ring->consumer);  in xskq_cons_present_entries()
275 static inline bool xskq_prod_is_full(struct xsk_queue *q)  in xskq_prod_is_full()  argument
277 	u32 free_entries = q->nentries - (q->cached_prod - q->cached_cons);  in xskq_prod_is_full()
283 	q->cached_cons = READ_ONCE(q->ring->consumer);  in xskq_prod_is_full()
284 	free_entries = q->nentries - (q->cached_prod - q->cached_cons);  in xskq_prod_is_full()
289 static inline int xskq_prod_reserve(struct xsk_queue *q)  in xskq_prod_reserve()  argument
291 	if (xskq_prod_is_full(q))  in xskq_prod_reserve()
295 	q->cached_prod++;  in xskq_prod_reserve()
299 static inline int xskq_prod_reserve_addr(struct xsk_queue *q, u64 addr)  in xskq_prod_reserve_addr()  argument
301 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_prod_reserve_addr()
303 	if (xskq_prod_is_full(q))  in xskq_prod_reserve_addr()
307 	ring->desc[q->cached_prod++ & q->ring_mask] = addr;  in xskq_prod_reserve_addr()
311 static inline int xskq_prod_reserve_desc(struct xsk_queue *q,  in xskq_prod_reserve_desc()  argument
314 	struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_prod_reserve_desc()
317 	if (xskq_prod_is_full(q))  in xskq_prod_reserve_desc()
321 	idx = q->cached_prod++ & q->ring_mask;  in xskq_prod_reserve_desc()
328 static inline void __xskq_prod_submit(struct xsk_queue *q, u32 idx)  in __xskq_prod_submit()  argument
332 	WRITE_ONCE(q->ring->producer, idx);  in __xskq_prod_submit()
335 static inline void xskq_prod_submit(struct xsk_queue *q)  in xskq_prod_submit()  argument
337 	__xskq_prod_submit(q, q->cached_prod);  in xskq_prod_submit()
340 static inline void xskq_prod_submit_addr(struct xsk_queue *q, u64 addr)  in xskq_prod_submit_addr()  argument
342 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_prod_submit_addr()
343 	u32 idx = q->ring->producer;  in xskq_prod_submit_addr()
345 	ring->desc[idx++ & q->ring_mask] = addr;  in xskq_prod_submit_addr()
347 	__xskq_prod_submit(q, idx);  in xskq_prod_submit_addr()
350 static inline void xskq_prod_submit_n(struct xsk_queue *q, u32 nb_entries)  in xskq_prod_submit_n()  argument
352 	__xskq_prod_submit(q, q->ring->producer + nb_entries);  in xskq_prod_submit_n()
355 static inline bool xskq_prod_is_empty(struct xsk_queue *q)  in xskq_prod_is_empty()  argument
358 	return READ_ONCE(q->ring->consumer) == READ_ONCE(q->ring->producer);  in xskq_prod_is_empty()
363 static inline u64 xskq_nb_invalid_descs(struct xsk_queue *q)  in xskq_nb_invalid_descs()  argument
365 	return q ? q->invalid_descs : 0;  in xskq_nb_invalid_descs()
368 static inline u64 xskq_nb_queue_empty_descs(struct xsk_queue *q)  in xskq_nb_queue_empty_descs()  argument
370 	return q ? q->queue_empty_descs : 0;  in xskq_nb_queue_empty_descs()