net/bnxt: refactor Rx ring cleanup for representors

Rx ring for representors does not use aggregation rings for Rx.
Instead they use simple software buffers for handling Rx packets.
So there is no need to use the same cleanup routine as done by
the non-representor code path.

Signed-off-by: Ajit Khaparde <ajit.khaparde@broadcom.com>
Acked-by: Kalesh AP <kalesh-anakkur.purayil@broadcom.com>
Acked-by: Somnath Kotur <somnath.kotur@broadcom.com>
This commit is contained in:
Ajit Khaparde 2021-10-25 22:14:55 -07:00
parent df07aa22d1
commit 43e7d2a30d

View File

@ -386,6 +386,26 @@ static int bnxt_vfr_alloc(struct rte_eth_dev *vfr_ethdev)
return rc;
}
static void bnxt_vfr_rx_queue_release_mbufs(struct bnxt_rx_queue *rxq)
{
struct rte_mbuf **sw_ring;
unsigned int i;
if (!rxq || !rxq->rx_ring)
return;
sw_ring = rxq->rx_ring->rx_buf_ring;
if (sw_ring) {
for (i = 0; i < rxq->rx_ring->rx_ring_struct->ring_size; i++) {
if (sw_ring[i]) {
if (sw_ring[i] != &rxq->fake_mbuf)
rte_pktmbuf_free_seg(sw_ring[i]);
sw_ring[i] = NULL;
}
}
}
}
static void bnxt_rep_free_rx_mbufs(struct bnxt_representor *rep_bp)
{
struct bnxt_rx_queue *rxq;
@ -393,7 +413,7 @@ static void bnxt_rep_free_rx_mbufs(struct bnxt_representor *rep_bp)
for (i = 0; i < rep_bp->rx_nr_rings; i++) {
rxq = rep_bp->rx_queues[i];
bnxt_rx_queue_release_mbufs(rxq);
bnxt_vfr_rx_queue_release_mbufs(rxq);
}
}