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()
189 static inline bool xskq_has_descs(struct xsk_queue *q)  in xskq_has_descs()  argument
191 	return q->cached_cons != q->cached_prod;  in xskq_has_descs()
194 static inline bool xskq_cons_is_valid_desc(struct xsk_queue *q,  in xskq_cons_is_valid_desc()  argument
199 		q->invalid_descs++;  in xskq_cons_is_valid_desc()
205 static inline bool xskq_cons_read_desc(struct xsk_queue *q,  in xskq_cons_read_desc()  argument
209 	if (q->cached_cons != q->cached_prod) {  in xskq_cons_read_desc()
210 		struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_cons_read_desc()
211 		u32 idx = q->cached_cons & q->ring_mask;  in xskq_cons_read_desc()
214 		return xskq_cons_is_valid_desc(q, desc, pool);  in xskq_cons_read_desc()
217 	q->queue_empty_descs++;  in xskq_cons_read_desc()
221 static inline void xskq_cons_release_n(struct xsk_queue *q, u32 cnt)  in xskq_cons_release_n()  argument
223 	q->cached_cons += cnt;  in xskq_cons_release_n()
226 static inline void parse_desc(struct xsk_queue *q, struct xsk_buff_pool *pool,  in parse_desc()  argument
229 	parsed->valid = xskq_cons_is_valid_desc(q, desc, pool);  in parse_desc()
234 u32 xskq_cons_read_desc_batch(struct xsk_queue *q, struct xsk_buff_pool *pool,  in xskq_cons_read_desc_batch()  argument
237 	u32 cached_cons = q->cached_cons, nb_entries = 0;  in xskq_cons_read_desc_batch()
244 	while (cached_cons != q->cached_prod && nb_entries < max) {  in xskq_cons_read_desc_batch()
245 		struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_cons_read_desc_batch()
246 		u32 idx = cached_cons & q->ring_mask;  in xskq_cons_read_desc_batch()
251 		parse_desc(q, pool, &descs[nb_entries], &parsed);  in xskq_cons_read_desc_batch()
270 	xskq_cons_release_n(q, cached_cons - q->cached_cons);  in xskq_cons_read_desc_batch()
276 static inline void __xskq_cons_release(struct xsk_queue *q)  in __xskq_cons_release()  argument
278 	smp_store_release(&q->ring->consumer, q->cached_cons); /* D, matchees A */  in __xskq_cons_release()
281 static inline void __xskq_cons_peek(struct xsk_queue *q)  in __xskq_cons_peek()  argument
284 	q->cached_prod = smp_load_acquire(&q->ring->producer);  /* C, matches B */  in __xskq_cons_peek()
287 static inline void xskq_cons_get_entries(struct xsk_queue *q)  in xskq_cons_get_entries()  argument
289 	__xskq_cons_release(q);  in xskq_cons_get_entries()
290 	__xskq_cons_peek(q);  in xskq_cons_get_entries()
293 static inline u32 xskq_cons_nb_entries(struct xsk_queue *q, u32 max)  in xskq_cons_nb_entries()  argument
295 	u32 entries = q->cached_prod - q->cached_cons;  in xskq_cons_nb_entries()
300 	__xskq_cons_peek(q);  in xskq_cons_nb_entries()
301 	entries = q->cached_prod - q->cached_cons;  in xskq_cons_nb_entries()
306 static inline bool xskq_cons_has_entries(struct xsk_queue *q, u32 cnt)  in xskq_cons_has_entries()  argument
308 	return xskq_cons_nb_entries(q, cnt) >= cnt;  in xskq_cons_has_entries()
311 static inline bool xskq_cons_peek_addr_unchecked(struct xsk_queue *q, u64 *addr)  in xskq_cons_peek_addr_unchecked()  argument
313 	if (q->cached_prod == q->cached_cons)  in xskq_cons_peek_addr_unchecked()
314 		xskq_cons_get_entries(q);  in xskq_cons_peek_addr_unchecked()
315 	return xskq_cons_read_addr_unchecked(q, addr);  in xskq_cons_peek_addr_unchecked()
318 static inline bool xskq_cons_peek_desc(struct xsk_queue *q,  in xskq_cons_peek_desc()  argument
322 	if (q->cached_prod == q->cached_cons)  in xskq_cons_peek_desc()
323 		xskq_cons_get_entries(q);  in xskq_cons_peek_desc()
324 	return xskq_cons_read_desc(q, desc, pool);  in xskq_cons_peek_desc()
331 static inline void xskq_cons_release(struct xsk_queue *q)  in xskq_cons_release()  argument
333 	q->cached_cons++;  in xskq_cons_release()
336 static inline void xskq_cons_cancel_n(struct xsk_queue *q, u32 cnt)  in xskq_cons_cancel_n()  argument
338 	q->cached_cons -= cnt;  in xskq_cons_cancel_n()
341 static inline u32 xskq_cons_present_entries(struct xsk_queue *q)  in xskq_cons_present_entries()  argument
344 	return READ_ONCE(q->ring->producer) - READ_ONCE(q->ring->consumer);  in xskq_cons_present_entries()
349 static inline u32 xskq_prod_nb_free(struct xsk_queue *q, u32 max)  in xskq_prod_nb_free()  argument
351 	u32 free_entries = q->nentries - (q->cached_prod - q->cached_cons);  in xskq_prod_nb_free()
357 	q->cached_cons = READ_ONCE(q->ring->consumer);  in xskq_prod_nb_free()
358 	free_entries = q->nentries - (q->cached_prod - q->cached_cons);  in xskq_prod_nb_free()
363 static inline bool xskq_prod_is_full(struct xsk_queue *q)  in xskq_prod_is_full()  argument
365 	return xskq_prod_nb_free(q, 1) ? false : true;  in xskq_prod_is_full()
368 static inline void xskq_prod_cancel_n(struct xsk_queue *q, u32 cnt)  in xskq_prod_cancel_n()  argument
370 	q->cached_prod -= cnt;  in xskq_prod_cancel_n()
373 static inline int xskq_prod_reserve(struct xsk_queue *q)  in xskq_prod_reserve()  argument
375 	if (xskq_prod_is_full(q))  in xskq_prod_reserve()
379 	q->cached_prod++;  in xskq_prod_reserve()
383 static inline int xskq_prod_reserve_addr(struct xsk_queue *q, u64 addr)  in xskq_prod_reserve_addr()  argument
385 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_prod_reserve_addr()
387 	if (xskq_prod_is_full(q))  in xskq_prod_reserve_addr()
391 	ring->desc[q->cached_prod++ & q->ring_mask] = addr;  in xskq_prod_reserve_addr()
395 static inline void xskq_prod_write_addr_batch(struct xsk_queue *q, struct xdp_desc *descs,  in xskq_prod_write_addr_batch()  argument
398 	struct xdp_umem_ring *ring = (struct xdp_umem_ring *)q->ring;  in xskq_prod_write_addr_batch()
402 	cached_prod = q->cached_prod;  in xskq_prod_write_addr_batch()
404 		ring->desc[cached_prod++ & q->ring_mask] = descs[i].addr;  in xskq_prod_write_addr_batch()
405 	q->cached_prod = cached_prod;  in xskq_prod_write_addr_batch()
408 static inline int xskq_prod_reserve_desc(struct xsk_queue *q,  in xskq_prod_reserve_desc()  argument
411 	struct xdp_rxtx_ring *ring = (struct xdp_rxtx_ring *)q->ring;  in xskq_prod_reserve_desc()
414 	if (xskq_prod_is_full(q))  in xskq_prod_reserve_desc()
418 	idx = q->cached_prod++ & q->ring_mask;  in xskq_prod_reserve_desc()
426 static inline void __xskq_prod_submit(struct xsk_queue *q, u32 idx)  in __xskq_prod_submit()  argument
428 	smp_store_release(&q->ring->producer, idx); /* B, matches C */  in __xskq_prod_submit()
431 static inline void xskq_prod_submit(struct xsk_queue *q)  in xskq_prod_submit()  argument
433 	__xskq_prod_submit(q, q->cached_prod);  in xskq_prod_submit()
436 static inline void xskq_prod_submit_n(struct xsk_queue *q, u32 nb_entries)  in xskq_prod_submit_n()  argument
438 	__xskq_prod_submit(q, q->ring->producer + nb_entries);  in xskq_prod_submit_n()
441 static inline bool xskq_prod_is_empty(struct xsk_queue *q)  in xskq_prod_is_empty()  argument
444 	return READ_ONCE(q->ring->consumer) == READ_ONCE(q->ring->producer);  in xskq_prod_is_empty()
449 static inline u64 xskq_nb_invalid_descs(struct xsk_queue *q)  in xskq_nb_invalid_descs()  argument
451 	return q ? q->invalid_descs : 0;  in xskq_nb_invalid_descs()
454 static inline u64 xskq_nb_queue_empty_descs(struct xsk_queue *q)  in xskq_nb_queue_empty_descs()  argument
456 	return q ? q->queue_empty_descs : 0;  in xskq_nb_queue_empty_descs()