Searched refs:nb_entries (Results 1 – 3 of 3) sorted by relevance
| /linux/net/xdp/ |
| H A D | xsk_queue.h | 282 u32 cached_cons, nb_entries = 0; in xskq_cons_read_desc_batch() local
289 while (cached_cons != q->cached_prod && nb_entries < max) { in xskq_cons_read_desc_batch()
294 descs[nb_entries] = ring->desc[idx]; in xskq_cons_read_desc_batch()
296 parse_desc(q, pool, &descs[nb_entries], &parsed); in xskq_cons_read_desc_batch()
301 nb_entries++; in xskq_cons_read_desc_batch()
325 if (nb_entries == max) in xskq_cons_read_desc_batch()
465 u32 nb_entries) in xskq_prod_write_addr_batch() argument
472 for (i = 0; i < nb_entries; i++) in xskq_prod_write_addr_batch()
511 static inline void xskq_prod_submit_n(struct xsk_queue *q, u32 nb_entries) in xskq_prod_submit_n() argument
513 __xskq_prod_submit(q, q->ring->producer + nb_entries); in xskq_prod_submit_n()
|
| H A D | xsk_buff_pool.c | 611 u32 i, cached_cons, nb_entries; in xp_alloc_new_from_fq() local
618 nb_entries = max; in xp_alloc_new_from_fq()
631 nb_entries--; in xp_alloc_new_from_fq()
642 return nb_entries; in xp_alloc_new_from_fq()
645 static u32 xp_alloc_reused(struct xsk_buff_pool *pool, struct xdp_buff **xdp, u32 nb_entries) in xp_alloc_reused() argument
650 nb_entries = min_t(u32, nb_entries, pool->free_list_cnt); in xp_alloc_reused()
652 i = nb_entries; in xp_alloc_reused()
660 pool->free_list_cnt -= nb_entries; in xp_alloc_reused()
662 return nb_entries; in xp_alloc_reused()
[all...] |
| H A D | xsk.c | 524 void xsk_tx_completed(struct xsk_buff_pool *pool, u32 nb_entries) in xsk_tx_release()
531 if (nb_entries < pending_descs) { in xsk_tx_release()
533 pending_descs - nb_entries);
534 xskq_prod_submit_n(pool->cq, nb_entries); in xsk_tx_peek_desc()
539 nb_entries += reclaim_descs; in xsk_tx_peek_desc()
543 xskq_prod_submit_n(pool->cq, nb_entries); in xsk_tx_peek_desc()
500 xsk_tx_completed(struct xsk_buff_pool * pool,u32 nb_entries) xsk_tx_completed() argument
|