120 static inline void __xskq_cons_read_addr_unchecked(struct xsk_queue *q, u32 cached_cons, u64 *addr)  in __xskq_cons_read_addr_unchecked()  argument
122 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in __xskq_cons_read_addr_unchecked()
123 	u32 idx = cached_cons & q->ring_mask;  in __xskq_cons_read_addr_unchecked()
128 static inline bool xskq_cons_read_addr_unchecked(struct xsk_queue *q, u64 *addr)  in xskq_cons_read_addr_unchecked()  argument
130 	if (q->cached_cons != q->cached_prod) {  in xskq_cons_read_addr_unchecked()
131 		__xskq_cons_read_addr_unchecked(q, q->cached_cons, addr);  in xskq_cons_read_addr_unchecked()
192 static inline bool xskq_has_descs(struct xsk_queue *q)  in xskq_has_descs()  argument
194 	return q->cached_cons != q->cached_prod;  in xskq_has_descs()
197 static inline bool xskq_cons_is_valid_desc(struct xsk_queue *q,  in xskq_cons_is_valid_desc()  argument
202 		q->invalid_descs++;  in xskq_cons_is_valid_desc()
208 static inline bool xskq_cons_read_desc(struct xsk_queue *q,  in xskq_cons_read_desc()  argument
212 	if (q->cached_cons != q->cached_prod) {  in xskq_cons_read_desc()
213 		struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_cons_read_desc()
214 		u32 idx = q->cached_cons & q->ring_mask;  in xskq_cons_read_desc()
217 		return xskq_cons_is_valid_desc(q, desc, pool);  in xskq_cons_read_desc()
220 	q->queue_empty_descs++;  in xskq_cons_read_desc()
224 static inline void xskq_cons_release_n(struct xsk_queue *q, u32 cnt)  in xskq_cons_release_n()  argument
226 	q->cached_cons += cnt;  in xskq_cons_release_n()
229 static inline void parse_desc(struct xsk_queue *q, struct xsk_buff_pool *pool,  in parse_desc()  argument
232 	parsed->valid = xskq_cons_is_valid_desc(q, desc, pool);  in parse_desc()
237 u32 xskq_cons_read_desc_batch(struct xsk_queue *q, struct xsk_buff_pool *pool,  in xskq_cons_read_desc_batch()  argument
240 	u32 cached_cons = q->cached_cons, nb_entries = 0;  in xskq_cons_read_desc_batch()
247 	while (cached_cons != q->cached_prod && nb_entries < max) {  in xskq_cons_read_desc_batch()
248 		struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_cons_read_desc_batch()
249 		u32 idx = cached_cons & q->ring_mask;  in xskq_cons_read_desc_batch()
254 		parse_desc(q, pool, &descs[nb_entries], &parsed);  in xskq_cons_read_desc_batch()
273 	xskq_cons_release_n(q, cached_cons - q->cached_cons);  in xskq_cons_read_desc_batch()
279 static inline void __xskq_cons_release(struct xsk_queue *q)  in __xskq_cons_release()  argument
281 	smp_store_release(&q->ring->consumer, q->cached_cons); /* D, matchees A */  in __xskq_cons_release()
284 static inline void __xskq_cons_peek(struct xsk_queue *q)  in __xskq_cons_peek()  argument
287 	q->cached_prod = smp_load_acquire(&q->ring->producer);  /* C, matches B */  in __xskq_cons_peek()
290 static inline void xskq_cons_get_entries(struct xsk_queue *q)  in xskq_cons_get_entries()  argument
292 	__xskq_cons_release(q);  in xskq_cons_get_entries()
293 	__xskq_cons_peek(q);  in xskq_cons_get_entries()
296 static inline u32 xskq_cons_nb_entries(struct xsk_queue *q, u32 max)  in xskq_cons_nb_entries()  argument
298 	u32 entries = q->cached_prod - q->cached_cons;  in xskq_cons_nb_entries()
303 	__xskq_cons_peek(q);  in xskq_cons_nb_entries()
304 	entries = q->cached_prod - q->cached_cons;  in xskq_cons_nb_entries()
309 static inline bool xskq_cons_peek_addr_unchecked(struct xsk_queue *q, u64 *addr)  in xskq_cons_peek_addr_unchecked()  argument
311 	if (q->cached_prod == q->cached_cons)  in xskq_cons_peek_addr_unchecked()
312 		xskq_cons_get_entries(q);  in xskq_cons_peek_addr_unchecked()
313 	return xskq_cons_read_addr_unchecked(q, addr);  in xskq_cons_peek_addr_unchecked()
316 static inline bool xskq_cons_peek_desc(struct xsk_queue *q,  in xskq_cons_peek_desc()  argument
320 	if (q->cached_prod == q->cached_cons)  in xskq_cons_peek_desc()
321 		xskq_cons_get_entries(q);  in xskq_cons_peek_desc()
322 	return xskq_cons_read_desc(q, desc, pool);  in xskq_cons_peek_desc()
329 static inline void xskq_cons_release(struct xsk_queue *q)  in xskq_cons_release()  argument
331 	q->cached_cons++;  in xskq_cons_release()
334 static inline void xskq_cons_cancel_n(struct xsk_queue *q, u32 cnt)  in xskq_cons_cancel_n()  argument
336 	q->cached_cons -= cnt;  in xskq_cons_cancel_n()
339 static inline u32 xskq_cons_present_entries(struct xsk_queue *q)  in xskq_cons_present_entries()  argument
342 	return READ_ONCE(q->ring->producer) - READ_ONCE(q->ring->consumer);  in xskq_cons_present_entries()
347 static inline u32 xskq_prod_nb_free(struct xsk_queue *q, u32 max)  in xskq_prod_nb_free()  argument
349 	u32 free_entries = q->nentries - (q->cached_prod - q->cached_cons);  in xskq_prod_nb_free()
355 	q->cached_cons = READ_ONCE(q->ring->consumer);  in xskq_prod_nb_free()
356 	free_entries = q->nentries - (q->cached_prod - q->cached_cons);  in xskq_prod_nb_free()
361 static inline bool xskq_prod_is_full(struct xsk_queue *q)  in xskq_prod_is_full()  argument
363 	return xskq_prod_nb_free(q, 1) ? false : true;  in xskq_prod_is_full()
366 static inline void xskq_prod_cancel_n(struct xsk_queue *q, u32 cnt)  in xskq_prod_cancel_n()  argument
368 	q->cached_prod -= cnt;  in xskq_prod_cancel_n()
371 static inline int xskq_prod_reserve(struct xsk_queue *q)  in xskq_prod_reserve()  argument
373 	if (xskq_prod_is_full(q))  in xskq_prod_reserve()
377 	q->cached_prod++;  in xskq_prod_reserve()
381 static inline int xskq_prod_reserve_addr(struct xsk_queue *q, u64 addr)  in xskq_prod_reserve_addr()  argument
383 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_prod_reserve_addr()
385 	if (xskq_prod_is_full(q))  in xskq_prod_reserve_addr()
389 	ring->desc[q->cached_prod++ & q->ring_mask] = addr;  in xskq_prod_reserve_addr()
393 static inline void xskq_prod_write_addr_batch(struct xsk_queue *q, struct xdp_desc *descs,  in xskq_prod_write_addr_batch()  argument
396 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_prod_write_addr_batch()
400 	cached_prod = q->cached_prod;  in xskq_prod_write_addr_batch()
402 		ring->desc[cached_prod++ & q->ring_mask] = descs[i].addr;  in xskq_prod_write_addr_batch()
403 	q->cached_prod = cached_prod;  in xskq_prod_write_addr_batch()
406 static inline int xskq_prod_reserve_desc(struct xsk_queue *q,  in xskq_prod_reserve_desc()  argument
409 	struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_prod_reserve_desc()
412 	if (xskq_prod_is_full(q))  in xskq_prod_reserve_desc()
416 	idx = q->cached_prod++ & q->ring_mask;  in xskq_prod_reserve_desc()
424 static inline void __xskq_prod_submit(struct xsk_queue *q, u32 idx)  in __xskq_prod_submit()  argument
426 	smp_store_release(&q->ring->producer, idx); /* B, matches C */  in __xskq_prod_submit()
429 static inline void xskq_prod_submit(struct xsk_queue *q)  in xskq_prod_submit()  argument
431 	__xskq_prod_submit(q, q->cached_prod);  in xskq_prod_submit()
434 static inline void xskq_prod_submit_n(struct xsk_queue *q, u32 nb_entries)  in xskq_prod_submit_n()  argument
436 	__xskq_prod_submit(q, q->ring->producer + nb_entries);  in xskq_prod_submit_n()
439 static inline bool xskq_prod_is_empty(struct xsk_queue *q)  in xskq_prod_is_empty()  argument
442 	return READ_ONCE(q->ring->consumer) == READ_ONCE(q->ring->producer);  in xskq_prod_is_empty()
447 static inline u64 xskq_nb_invalid_descs(struct xsk_queue *q)  in xskq_nb_invalid_descs()  argument
449 	return q ? q->invalid_descs : 0;  in xskq_nb_invalid_descs()
452 static inline u64 xskq_nb_queue_empty_descs(struct xsk_queue *q)  in xskq_nb_queue_empty_descs()  argument
454 	return q ? q->queue_empty_descs : 0;  in xskq_nb_queue_empty_descs()