1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2010-2016 Intel Corporation
7 #include <linux/virtio_net.h>
10 #include <rte_memcpy.h>
11 #include <rte_ether.h>
13 #include <rte_vhost.h>
18 #include <rte_spinlock.h>
19 #include <rte_malloc.h>
24 #define MAX_PKT_BURST 32
26 #define MAX_BATCH_LEN 256
28 static __rte_always_inline bool
29 rxvq_is_mergeable(struct virtio_net *dev)
31 return dev->features & (1ULL << VIRTIO_NET_F_MRG_RXBUF);
35 is_valid_virt_queue_idx(uint32_t idx, int is_tx, uint32_t nr_vring)
37 return (is_tx ^ (idx & 1)) == 0 && idx < nr_vring;
40 static __rte_always_inline void
41 do_flush_shadow_used_ring_split(struct virtio_net *dev,
42 struct vhost_virtqueue *vq,
43 uint16_t to, uint16_t from, uint16_t size)
45 rte_memcpy(&vq->used->ring[to],
46 &vq->shadow_used_split[from],
47 size * sizeof(struct vring_used_elem));
48 vhost_log_cache_used_vring(dev, vq,
49 offsetof(struct vring_used, ring[to]),
50 size * sizeof(struct vring_used_elem));
53 static __rte_always_inline void
54 flush_shadow_used_ring_split(struct virtio_net *dev, struct vhost_virtqueue *vq)
56 uint16_t used_idx = vq->last_used_idx & (vq->size - 1);
58 if (used_idx + vq->shadow_used_idx <= vq->size) {
59 do_flush_shadow_used_ring_split(dev, vq, used_idx, 0,
64 /* update used ring interval [used_idx, vq->size] */
65 size = vq->size - used_idx;
66 do_flush_shadow_used_ring_split(dev, vq, used_idx, 0, size);
68 /* update the left half used ring interval [0, left_size] */
69 do_flush_shadow_used_ring_split(dev, vq, 0, size,
70 vq->shadow_used_idx - size);
72 vq->last_used_idx += vq->shadow_used_idx;
76 vhost_log_cache_sync(dev, vq);
78 *(volatile uint16_t *)&vq->used->idx += vq->shadow_used_idx;
79 vq->shadow_used_idx = 0;
80 vhost_log_used_vring(dev, vq, offsetof(struct vring_used, idx),
81 sizeof(vq->used->idx));
84 static __rte_always_inline void
85 update_shadow_used_ring_split(struct vhost_virtqueue *vq,
86 uint16_t desc_idx, uint32_t len)
88 uint16_t i = vq->shadow_used_idx++;
90 vq->shadow_used_split[i].id = desc_idx;
91 vq->shadow_used_split[i].len = len;
94 static __rte_always_inline void
95 flush_shadow_used_ring_packed(struct virtio_net *dev,
96 struct vhost_virtqueue *vq)
99 uint16_t used_idx = vq->last_used_idx;
100 uint16_t head_idx = vq->last_used_idx;
101 uint16_t head_flags = 0;
103 /* Split loop in two to save memory barriers */
104 for (i = 0; i < vq->shadow_used_idx; i++) {
105 vq->desc_packed[used_idx].id = vq->shadow_used_packed[i].id;
106 vq->desc_packed[used_idx].len = vq->shadow_used_packed[i].len;
108 used_idx += vq->shadow_used_packed[i].count;
109 if (used_idx >= vq->size)
110 used_idx -= vq->size;
113 for (i = 0; i < vq->shadow_used_idx; i++) {
116 if (vq->shadow_used_packed[i].len)
117 flags = VRING_DESC_F_WRITE;
121 if (vq->used_wrap_counter) {
122 flags |= VRING_DESC_F_USED;
123 flags |= VRING_DESC_F_AVAIL;
125 flags &= ~VRING_DESC_F_USED;
126 flags &= ~VRING_DESC_F_AVAIL;
130 vq->desc_packed[vq->last_used_idx].flags = flags;
132 vhost_log_cache_used_vring(dev, vq,
134 sizeof(struct vring_packed_desc),
135 sizeof(struct vring_packed_desc));
137 head_idx = vq->last_used_idx;
141 vq_inc_last_used_packed(vq, vq->shadow_used_packed[i].count);
144 __atomic_store_n(&vq->desc_packed[head_idx].flags, head_flags,
147 vhost_log_cache_used_vring(dev, vq,
149 sizeof(struct vring_packed_desc),
150 sizeof(struct vring_packed_desc));
152 vq->shadow_used_idx = 0;
153 vhost_log_cache_sync(dev, vq);
156 static __rte_always_inline void
157 update_shadow_used_ring_packed(struct vhost_virtqueue *vq,
158 uint16_t desc_idx, uint32_t len, uint16_t count)
160 uint16_t i = vq->shadow_used_idx++;
162 vq->shadow_used_packed[i].id = desc_idx;
163 vq->shadow_used_packed[i].len = len;
164 vq->shadow_used_packed[i].count = count;
168 do_data_copy_enqueue(struct virtio_net *dev, struct vhost_virtqueue *vq)
170 struct batch_copy_elem *elem = vq->batch_copy_elems;
171 uint16_t count = vq->batch_copy_nb_elems;
174 for (i = 0; i < count; i++) {
175 rte_memcpy(elem[i].dst, elem[i].src, elem[i].len);
176 vhost_log_cache_write_iova(dev, vq, elem[i].log_addr,
178 PRINT_PACKET(dev, (uintptr_t)elem[i].dst, elem[i].len, 0);
181 vq->batch_copy_nb_elems = 0;
185 do_data_copy_dequeue(struct vhost_virtqueue *vq)
187 struct batch_copy_elem *elem = vq->batch_copy_elems;
188 uint16_t count = vq->batch_copy_nb_elems;
191 for (i = 0; i < count; i++)
192 rte_memcpy(elem[i].dst, elem[i].src, elem[i].len);
194 vq->batch_copy_nb_elems = 0;
197 /* avoid write operation when necessary, to lessen cache issues */
198 #define ASSIGN_UNLESS_EQUAL(var, val) do { \
199 if ((var) != (val)) \
203 static __rte_always_inline void
204 virtio_enqueue_offload(struct rte_mbuf *m_buf, struct virtio_net_hdr *net_hdr)
206 uint64_t csum_l4 = m_buf->ol_flags & PKT_TX_L4_MASK;
208 if (m_buf->ol_flags & PKT_TX_TCP_SEG)
209 csum_l4 |= PKT_TX_TCP_CKSUM;
212 net_hdr->flags = VIRTIO_NET_HDR_F_NEEDS_CSUM;
213 net_hdr->csum_start = m_buf->l2_len + m_buf->l3_len;
216 case PKT_TX_TCP_CKSUM:
217 net_hdr->csum_offset = (offsetof(struct rte_tcp_hdr,
220 case PKT_TX_UDP_CKSUM:
221 net_hdr->csum_offset = (offsetof(struct rte_udp_hdr,
224 case PKT_TX_SCTP_CKSUM:
225 net_hdr->csum_offset = (offsetof(struct rte_sctp_hdr,
230 ASSIGN_UNLESS_EQUAL(net_hdr->csum_start, 0);
231 ASSIGN_UNLESS_EQUAL(net_hdr->csum_offset, 0);
232 ASSIGN_UNLESS_EQUAL(net_hdr->flags, 0);
235 /* IP cksum verification cannot be bypassed, then calculate here */
236 if (m_buf->ol_flags & PKT_TX_IP_CKSUM) {
237 struct rte_ipv4_hdr *ipv4_hdr;
239 ipv4_hdr = rte_pktmbuf_mtod_offset(m_buf, struct rte_ipv4_hdr *,
241 ipv4_hdr->hdr_checksum = rte_ipv4_cksum(ipv4_hdr);
244 if (m_buf->ol_flags & PKT_TX_TCP_SEG) {
245 if (m_buf->ol_flags & PKT_TX_IPV4)
246 net_hdr->gso_type = VIRTIO_NET_HDR_GSO_TCPV4;
248 net_hdr->gso_type = VIRTIO_NET_HDR_GSO_TCPV6;
249 net_hdr->gso_size = m_buf->tso_segsz;
250 net_hdr->hdr_len = m_buf->l2_len + m_buf->l3_len
252 } else if (m_buf->ol_flags & PKT_TX_UDP_SEG) {
253 net_hdr->gso_type = VIRTIO_NET_HDR_GSO_UDP;
254 net_hdr->gso_size = m_buf->tso_segsz;
255 net_hdr->hdr_len = m_buf->l2_len + m_buf->l3_len +
258 ASSIGN_UNLESS_EQUAL(net_hdr->gso_type, 0);
259 ASSIGN_UNLESS_EQUAL(net_hdr->gso_size, 0);
260 ASSIGN_UNLESS_EQUAL(net_hdr->hdr_len, 0);
264 static __rte_always_inline int
265 map_one_desc(struct virtio_net *dev, struct vhost_virtqueue *vq,
266 struct buf_vector *buf_vec, uint16_t *vec_idx,
267 uint64_t desc_iova, uint64_t desc_len, uint8_t perm)
269 uint16_t vec_id = *vec_idx;
273 uint64_t desc_chunck_len = desc_len;
275 if (unlikely(vec_id >= BUF_VECTOR_MAX))
278 desc_addr = vhost_iova_to_vva(dev, vq,
282 if (unlikely(!desc_addr))
285 rte_prefetch0((void *)(uintptr_t)desc_addr);
287 buf_vec[vec_id].buf_iova = desc_iova;
288 buf_vec[vec_id].buf_addr = desc_addr;
289 buf_vec[vec_id].buf_len = desc_chunck_len;
291 desc_len -= desc_chunck_len;
292 desc_iova += desc_chunck_len;
300 static __rte_always_inline int
301 fill_vec_buf_split(struct virtio_net *dev, struct vhost_virtqueue *vq,
302 uint32_t avail_idx, uint16_t *vec_idx,
303 struct buf_vector *buf_vec, uint16_t *desc_chain_head,
304 uint32_t *desc_chain_len, uint8_t perm)
306 uint16_t idx = vq->avail->ring[avail_idx & (vq->size - 1)];
307 uint16_t vec_id = *vec_idx;
310 uint32_t nr_descs = vq->size;
312 struct vring_desc *descs = vq->desc;
313 struct vring_desc *idesc = NULL;
315 if (unlikely(idx >= vq->size))
318 *desc_chain_head = idx;
320 if (vq->desc[idx].flags & VRING_DESC_F_INDIRECT) {
321 dlen = vq->desc[idx].len;
322 nr_descs = dlen / sizeof(struct vring_desc);
323 if (unlikely(nr_descs > vq->size))
326 descs = (struct vring_desc *)(uintptr_t)
327 vhost_iova_to_vva(dev, vq, vq->desc[idx].addr,
330 if (unlikely(!descs))
333 if (unlikely(dlen < vq->desc[idx].len)) {
335 * The indirect desc table is not contiguous
336 * in process VA space, we have to copy it.
338 idesc = vhost_alloc_copy_ind_table(dev, vq,
339 vq->desc[idx].addr, vq->desc[idx].len);
340 if (unlikely(!idesc))
350 if (unlikely(idx >= nr_descs || cnt++ >= nr_descs)) {
351 free_ind_table(idesc);
355 len += descs[idx].len;
357 if (unlikely(map_one_desc(dev, vq, buf_vec, &vec_id,
358 descs[idx].addr, descs[idx].len,
360 free_ind_table(idesc);
364 if ((descs[idx].flags & VRING_DESC_F_NEXT) == 0)
367 idx = descs[idx].next;
370 *desc_chain_len = len;
373 if (unlikely(!!idesc))
374 free_ind_table(idesc);
380 * Returns -1 on fail, 0 on success
383 reserve_avail_buf_split(struct virtio_net *dev, struct vhost_virtqueue *vq,
384 uint32_t size, struct buf_vector *buf_vec,
385 uint16_t *num_buffers, uint16_t avail_head,
389 uint16_t vec_idx = 0;
390 uint16_t max_tries, tries = 0;
392 uint16_t head_idx = 0;
396 cur_idx = vq->last_avail_idx;
398 if (rxvq_is_mergeable(dev))
399 max_tries = vq->size - 1;
404 if (unlikely(cur_idx == avail_head))
407 * if we tried all available ring items, and still
408 * can't get enough buf, it means something abnormal
411 if (unlikely(++tries > max_tries))
414 if (unlikely(fill_vec_buf_split(dev, vq, cur_idx,
417 VHOST_ACCESS_RW) < 0))
419 len = RTE_MIN(len, size);
420 update_shadow_used_ring_split(vq, head_idx, len);
432 static __rte_always_inline int
433 fill_vec_buf_packed_indirect(struct virtio_net *dev,
434 struct vhost_virtqueue *vq,
435 struct vring_packed_desc *desc, uint16_t *vec_idx,
436 struct buf_vector *buf_vec, uint32_t *len, uint8_t perm)
440 uint16_t vec_id = *vec_idx;
442 struct vring_packed_desc *descs, *idescs = NULL;
445 descs = (struct vring_packed_desc *)(uintptr_t)
446 vhost_iova_to_vva(dev, vq, desc->addr, &dlen, VHOST_ACCESS_RO);
447 if (unlikely(!descs))
450 if (unlikely(dlen < desc->len)) {
452 * The indirect desc table is not contiguous
453 * in process VA space, we have to copy it.
455 idescs = vhost_alloc_copy_ind_table(dev,
456 vq, desc->addr, desc->len);
457 if (unlikely(!idescs))
463 nr_descs = desc->len / sizeof(struct vring_packed_desc);
464 if (unlikely(nr_descs >= vq->size)) {
465 free_ind_table(idescs);
469 for (i = 0; i < nr_descs; i++) {
470 if (unlikely(vec_id >= BUF_VECTOR_MAX)) {
471 free_ind_table(idescs);
475 *len += descs[i].len;
476 if (unlikely(map_one_desc(dev, vq, buf_vec, &vec_id,
477 descs[i].addr, descs[i].len,
483 if (unlikely(!!idescs))
484 free_ind_table(idescs);
489 static __rte_always_inline int
490 fill_vec_buf_packed(struct virtio_net *dev, struct vhost_virtqueue *vq,
491 uint16_t avail_idx, uint16_t *desc_count,
492 struct buf_vector *buf_vec, uint16_t *vec_idx,
493 uint16_t *buf_id, uint32_t *len, uint8_t perm)
495 bool wrap_counter = vq->avail_wrap_counter;
496 struct vring_packed_desc *descs = vq->desc_packed;
497 uint16_t vec_id = *vec_idx;
499 if (avail_idx < vq->last_avail_idx)
503 * Perform a load-acquire barrier in desc_is_avail to
504 * enforce the ordering between desc flags and desc
507 if (unlikely(!desc_is_avail(&descs[avail_idx], wrap_counter)))
514 if (unlikely(vec_id >= BUF_VECTOR_MAX))
517 if (unlikely(*desc_count >= vq->size))
521 *buf_id = descs[avail_idx].id;
523 if (descs[avail_idx].flags & VRING_DESC_F_INDIRECT) {
524 if (unlikely(fill_vec_buf_packed_indirect(dev, vq,
530 *len += descs[avail_idx].len;
532 if (unlikely(map_one_desc(dev, vq, buf_vec, &vec_id,
533 descs[avail_idx].addr,
534 descs[avail_idx].len,
539 if ((descs[avail_idx].flags & VRING_DESC_F_NEXT) == 0)
542 if (++avail_idx >= vq->size) {
543 avail_idx -= vq->size;
554 * Returns -1 on fail, 0 on success
557 reserve_avail_buf_packed(struct virtio_net *dev, struct vhost_virtqueue *vq,
558 uint32_t size, struct buf_vector *buf_vec,
559 uint16_t *nr_vec, uint16_t *num_buffers,
563 uint16_t vec_idx = 0;
564 uint16_t max_tries, tries = 0;
571 avail_idx = vq->last_avail_idx;
573 if (rxvq_is_mergeable(dev))
574 max_tries = vq->size - 1;
580 * if we tried all available ring items, and still
581 * can't get enough buf, it means something abnormal
584 if (unlikely(++tries > max_tries))
587 if (unlikely(fill_vec_buf_packed(dev, vq,
588 avail_idx, &desc_count,
591 VHOST_ACCESS_RW) < 0))
594 len = RTE_MIN(len, size);
595 update_shadow_used_ring_packed(vq, buf_id, len, desc_count);
598 avail_idx += desc_count;
599 if (avail_idx >= vq->size)
600 avail_idx -= vq->size;
602 *nr_descs += desc_count;
611 static __rte_noinline void
612 copy_vnet_hdr_to_desc(struct virtio_net *dev, struct vhost_virtqueue *vq,
613 struct buf_vector *buf_vec,
614 struct virtio_net_hdr_mrg_rxbuf *hdr)
617 uint64_t remain = dev->vhost_hlen;
618 uint64_t src = (uint64_t)(uintptr_t)hdr, dst;
619 uint64_t iova = buf_vec->buf_iova;
622 len = RTE_MIN(remain,
624 dst = buf_vec->buf_addr;
625 rte_memcpy((void *)(uintptr_t)dst,
626 (void *)(uintptr_t)src,
629 PRINT_PACKET(dev, (uintptr_t)dst,
631 vhost_log_cache_write_iova(dev, vq,
641 static __rte_always_inline int
642 copy_mbuf_to_desc(struct virtio_net *dev, struct vhost_virtqueue *vq,
643 struct rte_mbuf *m, struct buf_vector *buf_vec,
644 uint16_t nr_vec, uint16_t num_buffers)
646 uint32_t vec_idx = 0;
647 uint32_t mbuf_offset, mbuf_avail;
648 uint32_t buf_offset, buf_avail;
649 uint64_t buf_addr, buf_iova, buf_len;
652 struct rte_mbuf *hdr_mbuf;
653 struct batch_copy_elem *batch_copy = vq->batch_copy_elems;
654 struct virtio_net_hdr_mrg_rxbuf tmp_hdr, *hdr = NULL;
657 if (unlikely(m == NULL)) {
662 buf_addr = buf_vec[vec_idx].buf_addr;
663 buf_iova = buf_vec[vec_idx].buf_iova;
664 buf_len = buf_vec[vec_idx].buf_len;
666 if (unlikely(buf_len < dev->vhost_hlen && nr_vec <= 1)) {
673 if (unlikely(buf_len < dev->vhost_hlen))
676 hdr = (struct virtio_net_hdr_mrg_rxbuf *)(uintptr_t)hdr_addr;
678 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) RX: num merge buffers %d\n",
679 dev->vid, num_buffers);
681 if (unlikely(buf_len < dev->vhost_hlen)) {
682 buf_offset = dev->vhost_hlen - buf_len;
684 buf_addr = buf_vec[vec_idx].buf_addr;
685 buf_iova = buf_vec[vec_idx].buf_iova;
686 buf_len = buf_vec[vec_idx].buf_len;
687 buf_avail = buf_len - buf_offset;
689 buf_offset = dev->vhost_hlen;
690 buf_avail = buf_len - dev->vhost_hlen;
693 mbuf_avail = rte_pktmbuf_data_len(m);
695 while (mbuf_avail != 0 || m->next != NULL) {
696 /* done with current buf, get the next one */
697 if (buf_avail == 0) {
699 if (unlikely(vec_idx >= nr_vec)) {
704 buf_addr = buf_vec[vec_idx].buf_addr;
705 buf_iova = buf_vec[vec_idx].buf_iova;
706 buf_len = buf_vec[vec_idx].buf_len;
712 /* done with current mbuf, get the next one */
713 if (mbuf_avail == 0) {
717 mbuf_avail = rte_pktmbuf_data_len(m);
721 virtio_enqueue_offload(hdr_mbuf, &hdr->hdr);
722 if (rxvq_is_mergeable(dev))
723 ASSIGN_UNLESS_EQUAL(hdr->num_buffers,
726 if (unlikely(hdr == &tmp_hdr)) {
727 copy_vnet_hdr_to_desc(dev, vq, buf_vec, hdr);
729 PRINT_PACKET(dev, (uintptr_t)hdr_addr,
731 vhost_log_cache_write_iova(dev, vq,
739 cpy_len = RTE_MIN(buf_avail, mbuf_avail);
741 if (likely(cpy_len > MAX_BATCH_LEN ||
742 vq->batch_copy_nb_elems >= vq->size)) {
743 rte_memcpy((void *)((uintptr_t)(buf_addr + buf_offset)),
744 rte_pktmbuf_mtod_offset(m, void *, mbuf_offset),
746 vhost_log_cache_write_iova(dev, vq,
747 buf_iova + buf_offset,
749 PRINT_PACKET(dev, (uintptr_t)(buf_addr + buf_offset),
752 batch_copy[vq->batch_copy_nb_elems].dst =
753 (void *)((uintptr_t)(buf_addr + buf_offset));
754 batch_copy[vq->batch_copy_nb_elems].src =
755 rte_pktmbuf_mtod_offset(m, void *, mbuf_offset);
756 batch_copy[vq->batch_copy_nb_elems].log_addr =
757 buf_iova + buf_offset;
758 batch_copy[vq->batch_copy_nb_elems].len = cpy_len;
759 vq->batch_copy_nb_elems++;
762 mbuf_avail -= cpy_len;
763 mbuf_offset += cpy_len;
764 buf_avail -= cpy_len;
765 buf_offset += cpy_len;
773 static __rte_noinline uint32_t
774 virtio_dev_rx_split(struct virtio_net *dev, struct vhost_virtqueue *vq,
775 struct rte_mbuf **pkts, uint32_t count)
777 uint32_t pkt_idx = 0;
778 uint16_t num_buffers;
779 struct buf_vector buf_vec[BUF_VECTOR_MAX];
782 avail_head = *((volatile uint16_t *)&vq->avail->idx);
785 * The ordering between avail index and
786 * desc reads needs to be enforced.
790 rte_prefetch0(&vq->avail->ring[vq->last_avail_idx & (vq->size - 1)]);
792 for (pkt_idx = 0; pkt_idx < count; pkt_idx++) {
793 uint32_t pkt_len = pkts[pkt_idx]->pkt_len + dev->vhost_hlen;
796 if (unlikely(reserve_avail_buf_split(dev, vq,
797 pkt_len, buf_vec, &num_buffers,
798 avail_head, &nr_vec) < 0)) {
799 VHOST_LOG_DEBUG(VHOST_DATA,
800 "(%d) failed to get enough desc from vring\n",
802 vq->shadow_used_idx -= num_buffers;
806 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) current index %d | end index %d\n",
807 dev->vid, vq->last_avail_idx,
808 vq->last_avail_idx + num_buffers);
810 if (copy_mbuf_to_desc(dev, vq, pkts[pkt_idx],
813 vq->shadow_used_idx -= num_buffers;
817 vq->last_avail_idx += num_buffers;
820 do_data_copy_enqueue(dev, vq);
822 if (likely(vq->shadow_used_idx)) {
823 flush_shadow_used_ring_split(dev, vq);
824 vhost_vring_call_split(dev, vq);
830 static __rte_noinline uint32_t
831 virtio_dev_rx_packed(struct virtio_net *dev, struct vhost_virtqueue *vq,
832 struct rte_mbuf **pkts, uint32_t count)
834 uint32_t pkt_idx = 0;
835 uint16_t num_buffers;
836 struct buf_vector buf_vec[BUF_VECTOR_MAX];
838 for (pkt_idx = 0; pkt_idx < count; pkt_idx++) {
839 uint32_t pkt_len = pkts[pkt_idx]->pkt_len + dev->vhost_hlen;
841 uint16_t nr_descs = 0;
843 if (unlikely(reserve_avail_buf_packed(dev, vq,
844 pkt_len, buf_vec, &nr_vec,
845 &num_buffers, &nr_descs) < 0)) {
846 VHOST_LOG_DEBUG(VHOST_DATA,
847 "(%d) failed to get enough desc from vring\n",
849 vq->shadow_used_idx -= num_buffers;
853 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) current index %d | end index %d\n",
854 dev->vid, vq->last_avail_idx,
855 vq->last_avail_idx + num_buffers);
857 if (copy_mbuf_to_desc(dev, vq, pkts[pkt_idx],
860 vq->shadow_used_idx -= num_buffers;
864 vq_inc_last_avail_packed(vq, nr_descs);
867 do_data_copy_enqueue(dev, vq);
869 if (likely(vq->shadow_used_idx)) {
870 flush_shadow_used_ring_packed(dev, vq);
871 vhost_vring_call_packed(dev, vq);
877 static __rte_always_inline uint32_t
878 virtio_dev_rx(struct virtio_net *dev, uint16_t queue_id,
879 struct rte_mbuf **pkts, uint32_t count)
881 struct vhost_virtqueue *vq;
884 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) %s\n", dev->vid, __func__);
885 if (unlikely(!is_valid_virt_queue_idx(queue_id, 0, dev->nr_vring))) {
886 RTE_LOG(ERR, VHOST_DATA, "(%d) %s: invalid virtqueue idx %d.\n",
887 dev->vid, __func__, queue_id);
891 vq = dev->virtqueue[queue_id];
893 rte_spinlock_lock(&vq->access_lock);
895 if (unlikely(vq->enabled == 0))
896 goto out_access_unlock;
898 if (dev->features & (1ULL << VIRTIO_F_IOMMU_PLATFORM))
899 vhost_user_iotlb_rd_lock(vq);
901 if (unlikely(vq->access_ok == 0))
902 if (unlikely(vring_translate(dev, vq) < 0))
905 count = RTE_MIN((uint32_t)MAX_PKT_BURST, count);
909 if (vq_is_packed(dev))
910 nb_tx = virtio_dev_rx_packed(dev, vq, pkts, count);
912 nb_tx = virtio_dev_rx_split(dev, vq, pkts, count);
915 if (dev->features & (1ULL << VIRTIO_F_IOMMU_PLATFORM))
916 vhost_user_iotlb_rd_unlock(vq);
919 rte_spinlock_unlock(&vq->access_lock);
925 rte_vhost_enqueue_burst(int vid, uint16_t queue_id,
926 struct rte_mbuf **pkts, uint16_t count)
928 struct virtio_net *dev = get_device(vid);
933 if (unlikely(!(dev->flags & VIRTIO_DEV_BUILTIN_VIRTIO_NET))) {
934 RTE_LOG(ERR, VHOST_DATA,
935 "(%d) %s: built-in vhost net backend is disabled.\n",
940 return virtio_dev_rx(dev, queue_id, pkts, count);
944 virtio_net_with_host_offload(struct virtio_net *dev)
947 ((1ULL << VIRTIO_NET_F_CSUM) |
948 (1ULL << VIRTIO_NET_F_HOST_ECN) |
949 (1ULL << VIRTIO_NET_F_HOST_TSO4) |
950 (1ULL << VIRTIO_NET_F_HOST_TSO6) |
951 (1ULL << VIRTIO_NET_F_HOST_UFO)))
958 parse_ethernet(struct rte_mbuf *m, uint16_t *l4_proto, void **l4_hdr)
960 struct rte_ipv4_hdr *ipv4_hdr;
961 struct rte_ipv6_hdr *ipv6_hdr;
963 struct rte_ether_hdr *eth_hdr;
966 eth_hdr = rte_pktmbuf_mtod(m, struct rte_ether_hdr *);
968 m->l2_len = sizeof(struct rte_ether_hdr);
969 ethertype = rte_be_to_cpu_16(eth_hdr->ether_type);
971 if (ethertype == RTE_ETHER_TYPE_VLAN) {
972 struct rte_vlan_hdr *vlan_hdr =
973 (struct rte_vlan_hdr *)(eth_hdr + 1);
975 m->l2_len += sizeof(struct rte_vlan_hdr);
976 ethertype = rte_be_to_cpu_16(vlan_hdr->eth_proto);
979 l3_hdr = (char *)eth_hdr + m->l2_len;
982 case RTE_ETHER_TYPE_IPV4:
984 *l4_proto = ipv4_hdr->next_proto_id;
985 m->l3_len = (ipv4_hdr->version_ihl & 0x0f) * 4;
986 *l4_hdr = (char *)l3_hdr + m->l3_len;
987 m->ol_flags |= PKT_TX_IPV4;
989 case RTE_ETHER_TYPE_IPV6:
991 *l4_proto = ipv6_hdr->proto;
992 m->l3_len = sizeof(struct rte_ipv6_hdr);
993 *l4_hdr = (char *)l3_hdr + m->l3_len;
994 m->ol_flags |= PKT_TX_IPV6;
1004 static __rte_always_inline void
1005 vhost_dequeue_offload(struct virtio_net_hdr *hdr, struct rte_mbuf *m)
1007 uint16_t l4_proto = 0;
1008 void *l4_hdr = NULL;
1009 struct rte_tcp_hdr *tcp_hdr = NULL;
1011 if (hdr->flags == 0 && hdr->gso_type == VIRTIO_NET_HDR_GSO_NONE)
1014 parse_ethernet(m, &l4_proto, &l4_hdr);
1015 if (hdr->flags == VIRTIO_NET_HDR_F_NEEDS_CSUM) {
1016 if (hdr->csum_start == (m->l2_len + m->l3_len)) {
1017 switch (hdr->csum_offset) {
1018 case (offsetof(struct rte_tcp_hdr, cksum)):
1019 if (l4_proto == IPPROTO_TCP)
1020 m->ol_flags |= PKT_TX_TCP_CKSUM;
1022 case (offsetof(struct rte_udp_hdr, dgram_cksum)):
1023 if (l4_proto == IPPROTO_UDP)
1024 m->ol_flags |= PKT_TX_UDP_CKSUM;
1026 case (offsetof(struct rte_sctp_hdr, cksum)):
1027 if (l4_proto == IPPROTO_SCTP)
1028 m->ol_flags |= PKT_TX_SCTP_CKSUM;
1036 if (l4_hdr && hdr->gso_type != VIRTIO_NET_HDR_GSO_NONE) {
1037 switch (hdr->gso_type & ~VIRTIO_NET_HDR_GSO_ECN) {
1038 case VIRTIO_NET_HDR_GSO_TCPV4:
1039 case VIRTIO_NET_HDR_GSO_TCPV6:
1041 m->ol_flags |= PKT_TX_TCP_SEG;
1042 m->tso_segsz = hdr->gso_size;
1043 m->l4_len = (tcp_hdr->data_off & 0xf0) >> 2;
1045 case VIRTIO_NET_HDR_GSO_UDP:
1046 m->ol_flags |= PKT_TX_UDP_SEG;
1047 m->tso_segsz = hdr->gso_size;
1048 m->l4_len = sizeof(struct rte_udp_hdr);
1051 RTE_LOG(WARNING, VHOST_DATA,
1052 "unsupported gso type %u.\n", hdr->gso_type);
1058 static __rte_noinline void
1059 copy_vnet_hdr_from_desc(struct virtio_net_hdr *hdr,
1060 struct buf_vector *buf_vec)
1063 uint64_t remain = sizeof(struct virtio_net_hdr);
1065 uint64_t dst = (uint64_t)(uintptr_t)hdr;
1068 len = RTE_MIN(remain, buf_vec->buf_len);
1069 src = buf_vec->buf_addr;
1070 rte_memcpy((void *)(uintptr_t)dst,
1071 (void *)(uintptr_t)src, len);
1079 static __rte_always_inline int
1080 copy_desc_to_mbuf(struct virtio_net *dev, struct vhost_virtqueue *vq,
1081 struct buf_vector *buf_vec, uint16_t nr_vec,
1082 struct rte_mbuf *m, struct rte_mempool *mbuf_pool)
1084 uint32_t buf_avail, buf_offset;
1085 uint64_t buf_addr, buf_iova, buf_len;
1086 uint32_t mbuf_avail, mbuf_offset;
1088 struct rte_mbuf *cur = m, *prev = m;
1089 struct virtio_net_hdr tmp_hdr;
1090 struct virtio_net_hdr *hdr = NULL;
1091 /* A counter to avoid desc dead loop chain */
1092 uint16_t vec_idx = 0;
1093 struct batch_copy_elem *batch_copy = vq->batch_copy_elems;
1096 buf_addr = buf_vec[vec_idx].buf_addr;
1097 buf_iova = buf_vec[vec_idx].buf_iova;
1098 buf_len = buf_vec[vec_idx].buf_len;
1100 if (unlikely(buf_len < dev->vhost_hlen && nr_vec <= 1)) {
1105 if (virtio_net_with_host_offload(dev)) {
1106 if (unlikely(buf_len < sizeof(struct virtio_net_hdr))) {
1108 * No luck, the virtio-net header doesn't fit
1109 * in a contiguous virtual area.
1111 copy_vnet_hdr_from_desc(&tmp_hdr, buf_vec);
1114 hdr = (struct virtio_net_hdr *)((uintptr_t)buf_addr);
1119 * A virtio driver normally uses at least 2 desc buffers
1120 * for Tx: the first for storing the header, and others
1121 * for storing the data.
1123 if (unlikely(buf_len < dev->vhost_hlen)) {
1124 buf_offset = dev->vhost_hlen - buf_len;
1126 buf_addr = buf_vec[vec_idx].buf_addr;
1127 buf_iova = buf_vec[vec_idx].buf_iova;
1128 buf_len = buf_vec[vec_idx].buf_len;
1129 buf_avail = buf_len - buf_offset;
1130 } else if (buf_len == dev->vhost_hlen) {
1131 if (unlikely(++vec_idx >= nr_vec))
1133 buf_addr = buf_vec[vec_idx].buf_addr;
1134 buf_iova = buf_vec[vec_idx].buf_iova;
1135 buf_len = buf_vec[vec_idx].buf_len;
1138 buf_avail = buf_len;
1140 buf_offset = dev->vhost_hlen;
1141 buf_avail = buf_vec[vec_idx].buf_len - dev->vhost_hlen;
1145 (uintptr_t)(buf_addr + buf_offset),
1146 (uint32_t)buf_avail, 0);
1149 mbuf_avail = m->buf_len - RTE_PKTMBUF_HEADROOM;
1153 cpy_len = RTE_MIN(buf_avail, mbuf_avail);
1156 * A desc buf might across two host physical pages that are
1157 * not continuous. In such case (gpa_to_hpa returns 0), data
1158 * will be copied even though zero copy is enabled.
1160 if (unlikely(dev->dequeue_zero_copy && (hpa = gpa_to_hpa(dev,
1161 buf_iova + buf_offset, cpy_len)))) {
1162 cur->data_len = cpy_len;
1165 (void *)(uintptr_t)(buf_addr + buf_offset);
1166 cur->buf_iova = hpa;
1169 * In zero copy mode, one mbuf can only reference data
1170 * for one or partial of one desc buff.
1172 mbuf_avail = cpy_len;
1174 if (likely(cpy_len > MAX_BATCH_LEN ||
1175 vq->batch_copy_nb_elems >= vq->size ||
1176 (hdr && cur == m))) {
1177 rte_memcpy(rte_pktmbuf_mtod_offset(cur, void *,
1179 (void *)((uintptr_t)(buf_addr +
1183 batch_copy[vq->batch_copy_nb_elems].dst =
1184 rte_pktmbuf_mtod_offset(cur, void *,
1186 batch_copy[vq->batch_copy_nb_elems].src =
1187 (void *)((uintptr_t)(buf_addr +
1189 batch_copy[vq->batch_copy_nb_elems].len =
1191 vq->batch_copy_nb_elems++;
1195 mbuf_avail -= cpy_len;
1196 mbuf_offset += cpy_len;
1197 buf_avail -= cpy_len;
1198 buf_offset += cpy_len;
1200 /* This buf reaches to its end, get the next one */
1201 if (buf_avail == 0) {
1202 if (++vec_idx >= nr_vec)
1205 buf_addr = buf_vec[vec_idx].buf_addr;
1206 buf_iova = buf_vec[vec_idx].buf_iova;
1207 buf_len = buf_vec[vec_idx].buf_len;
1210 buf_avail = buf_len;
1212 PRINT_PACKET(dev, (uintptr_t)buf_addr,
1213 (uint32_t)buf_avail, 0);
1217 * This mbuf reaches to its end, get a new one
1218 * to hold more data.
1220 if (mbuf_avail == 0) {
1221 cur = rte_pktmbuf_alloc(mbuf_pool);
1222 if (unlikely(cur == NULL)) {
1223 RTE_LOG(ERR, VHOST_DATA, "Failed to "
1224 "allocate memory for mbuf.\n");
1228 if (unlikely(dev->dequeue_zero_copy))
1229 rte_mbuf_refcnt_update(cur, 1);
1232 prev->data_len = mbuf_offset;
1234 m->pkt_len += mbuf_offset;
1238 mbuf_avail = cur->buf_len - RTE_PKTMBUF_HEADROOM;
1242 prev->data_len = mbuf_offset;
1243 m->pkt_len += mbuf_offset;
1246 vhost_dequeue_offload(hdr, m);
1253 static __rte_always_inline struct zcopy_mbuf *
1254 get_zmbuf(struct vhost_virtqueue *vq)
1260 /* search [last_zmbuf_idx, zmbuf_size) */
1261 i = vq->last_zmbuf_idx;
1262 last = vq->zmbuf_size;
1265 for (; i < last; i++) {
1266 if (vq->zmbufs[i].in_use == 0) {
1267 vq->last_zmbuf_idx = i + 1;
1268 vq->zmbufs[i].in_use = 1;
1269 return &vq->zmbufs[i];
1275 /* search [0, last_zmbuf_idx) */
1277 last = vq->last_zmbuf_idx;
1285 virtio_dev_extbuf_free(void *addr __rte_unused, void *opaque)
1291 virtio_dev_extbuf_alloc(struct rte_mbuf *pkt, uint32_t size)
1293 struct rte_mbuf_ext_shared_info *shinfo = NULL;
1294 uint32_t total_len = RTE_PKTMBUF_HEADROOM + size;
1299 /* Try to use pkt buffer to store shinfo to reduce the amount of memory
1300 * required, otherwise store shinfo in the new buffer.
1302 if (rte_pktmbuf_tailroom(pkt) >= sizeof(*shinfo))
1303 shinfo = rte_pktmbuf_mtod(pkt,
1304 struct rte_mbuf_ext_shared_info *);
1306 total_len += sizeof(*shinfo) + sizeof(uintptr_t);
1307 total_len = RTE_ALIGN_CEIL(total_len, sizeof(uintptr_t));
1310 if (unlikely(total_len > UINT16_MAX))
1313 buf_len = total_len;
1314 buf = rte_malloc(NULL, buf_len, RTE_CACHE_LINE_SIZE);
1315 if (unlikely(buf == NULL))
1318 /* Initialize shinfo */
1320 shinfo->free_cb = virtio_dev_extbuf_free;
1321 shinfo->fcb_opaque = buf;
1322 rte_mbuf_ext_refcnt_set(shinfo, 1);
1324 shinfo = rte_pktmbuf_ext_shinfo_init_helper(buf, &buf_len,
1325 virtio_dev_extbuf_free, buf);
1326 if (unlikely(shinfo == NULL)) {
1328 RTE_LOG(ERR, VHOST_DATA, "Failed to init shinfo\n");
1333 iova = rte_malloc_virt2iova(buf);
1334 rte_pktmbuf_attach_extbuf(pkt, buf, iova, buf_len, shinfo);
1335 rte_pktmbuf_reset_headroom(pkt);
1341 * Allocate a host supported pktmbuf.
1343 static __rte_always_inline struct rte_mbuf *
1344 virtio_dev_pktmbuf_alloc(struct virtio_net *dev, struct rte_mempool *mp,
1347 struct rte_mbuf *pkt = rte_pktmbuf_alloc(mp);
1349 if (unlikely(pkt == NULL))
1352 if (rte_pktmbuf_tailroom(pkt) >= data_len)
1355 /* attach an external buffer if supported */
1356 if (dev->extbuf && !virtio_dev_extbuf_alloc(pkt, data_len))
1359 /* check if chained buffers are allowed */
1360 if (!dev->linearbuf)
1363 /* Data doesn't fit into the buffer and the host supports
1364 * only linear buffers
1366 rte_pktmbuf_free(pkt);
1371 static __rte_noinline uint16_t
1372 virtio_dev_tx_split(struct virtio_net *dev, struct vhost_virtqueue *vq,
1373 struct rte_mempool *mbuf_pool, struct rte_mbuf **pkts, uint16_t count)
1376 uint16_t free_entries;
1378 if (unlikely(dev->dequeue_zero_copy)) {
1379 struct zcopy_mbuf *zmbuf, *next;
1381 for (zmbuf = TAILQ_FIRST(&vq->zmbuf_list);
1382 zmbuf != NULL; zmbuf = next) {
1383 next = TAILQ_NEXT(zmbuf, next);
1385 if (mbuf_is_consumed(zmbuf->mbuf)) {
1386 update_shadow_used_ring_split(vq,
1387 zmbuf->desc_idx, 0);
1388 TAILQ_REMOVE(&vq->zmbuf_list, zmbuf, next);
1389 restore_mbuf(zmbuf->mbuf);
1390 rte_pktmbuf_free(zmbuf->mbuf);
1396 if (likely(vq->shadow_used_idx)) {
1397 flush_shadow_used_ring_split(dev, vq);
1398 vhost_vring_call_split(dev, vq);
1402 free_entries = *((volatile uint16_t *)&vq->avail->idx) -
1404 if (free_entries == 0)
1408 * The ordering between avail index and
1409 * desc reads needs to be enforced.
1413 rte_prefetch0(&vq->avail->ring[vq->last_avail_idx & (vq->size - 1)]);
1415 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) %s\n", dev->vid, __func__);
1417 count = RTE_MIN(count, MAX_PKT_BURST);
1418 count = RTE_MIN(count, free_entries);
1419 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) about to dequeue %u buffers\n",
1422 for (i = 0; i < count; i++) {
1423 struct buf_vector buf_vec[BUF_VECTOR_MAX];
1426 uint16_t nr_vec = 0;
1429 if (unlikely(fill_vec_buf_split(dev, vq,
1430 vq->last_avail_idx + i,
1432 &head_idx, &buf_len,
1433 VHOST_ACCESS_RO) < 0))
1436 if (likely(dev->dequeue_zero_copy == 0))
1437 update_shadow_used_ring_split(vq, head_idx, 0);
1439 pkts[i] = virtio_dev_pktmbuf_alloc(dev, mbuf_pool, buf_len);
1440 if (unlikely(pkts[i] == NULL))
1443 err = copy_desc_to_mbuf(dev, vq, buf_vec, nr_vec, pkts[i],
1445 if (unlikely(err)) {
1446 rte_pktmbuf_free(pkts[i]);
1450 if (unlikely(dev->dequeue_zero_copy)) {
1451 struct zcopy_mbuf *zmbuf;
1453 zmbuf = get_zmbuf(vq);
1455 rte_pktmbuf_free(pkts[i]);
1458 zmbuf->mbuf = pkts[i];
1459 zmbuf->desc_idx = head_idx;
1462 * Pin lock the mbuf; we will check later to see
1463 * whether the mbuf is freed (when we are the last
1464 * user) or not. If that's the case, we then could
1465 * update the used ring safely.
1467 rte_mbuf_refcnt_update(pkts[i], 1);
1470 TAILQ_INSERT_TAIL(&vq->zmbuf_list, zmbuf, next);
1473 vq->last_avail_idx += i;
1475 if (likely(dev->dequeue_zero_copy == 0)) {
1476 do_data_copy_dequeue(vq);
1477 if (unlikely(i < count))
1478 vq->shadow_used_idx = i;
1479 if (likely(vq->shadow_used_idx)) {
1480 flush_shadow_used_ring_split(dev, vq);
1481 vhost_vring_call_split(dev, vq);
1488 static __rte_noinline uint16_t
1489 virtio_dev_tx_packed(struct virtio_net *dev, struct vhost_virtqueue *vq,
1490 struct rte_mempool *mbuf_pool, struct rte_mbuf **pkts, uint16_t count)
1494 if (unlikely(dev->dequeue_zero_copy)) {
1495 struct zcopy_mbuf *zmbuf, *next;
1497 for (zmbuf = TAILQ_FIRST(&vq->zmbuf_list);
1498 zmbuf != NULL; zmbuf = next) {
1499 next = TAILQ_NEXT(zmbuf, next);
1501 if (mbuf_is_consumed(zmbuf->mbuf)) {
1502 update_shadow_used_ring_packed(vq,
1507 TAILQ_REMOVE(&vq->zmbuf_list, zmbuf, next);
1508 restore_mbuf(zmbuf->mbuf);
1509 rte_pktmbuf_free(zmbuf->mbuf);
1515 if (likely(vq->shadow_used_idx)) {
1516 flush_shadow_used_ring_packed(dev, vq);
1517 vhost_vring_call_packed(dev, vq);
1521 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) %s\n", dev->vid, __func__);
1523 count = RTE_MIN(count, MAX_PKT_BURST);
1524 VHOST_LOG_DEBUG(VHOST_DATA, "(%d) about to dequeue %u buffers\n",
1527 for (i = 0; i < count; i++) {
1528 struct buf_vector buf_vec[BUF_VECTOR_MAX];
1531 uint16_t desc_count, nr_vec = 0;
1534 if (unlikely(fill_vec_buf_packed(dev, vq,
1535 vq->last_avail_idx, &desc_count,
1538 VHOST_ACCESS_RO) < 0))
1541 if (likely(dev->dequeue_zero_copy == 0))
1542 update_shadow_used_ring_packed(vq, buf_id, 0,
1545 pkts[i] = virtio_dev_pktmbuf_alloc(dev, mbuf_pool, buf_len);
1546 if (unlikely(pkts[i] == NULL))
1549 err = copy_desc_to_mbuf(dev, vq, buf_vec, nr_vec, pkts[i],
1551 if (unlikely(err)) {
1552 rte_pktmbuf_free(pkts[i]);
1556 if (unlikely(dev->dequeue_zero_copy)) {
1557 struct zcopy_mbuf *zmbuf;
1559 zmbuf = get_zmbuf(vq);
1561 rte_pktmbuf_free(pkts[i]);
1564 zmbuf->mbuf = pkts[i];
1565 zmbuf->desc_idx = buf_id;
1566 zmbuf->desc_count = desc_count;
1569 * Pin lock the mbuf; we will check later to see
1570 * whether the mbuf is freed (when we are the last
1571 * user) or not. If that's the case, we then could
1572 * update the used ring safely.
1574 rte_mbuf_refcnt_update(pkts[i], 1);
1577 TAILQ_INSERT_TAIL(&vq->zmbuf_list, zmbuf, next);
1580 vq_inc_last_avail_packed(vq, desc_count);
1583 if (likely(dev->dequeue_zero_copy == 0)) {
1584 do_data_copy_dequeue(vq);
1585 if (unlikely(i < count))
1586 vq->shadow_used_idx = i;
1587 if (likely(vq->shadow_used_idx)) {
1588 flush_shadow_used_ring_packed(dev, vq);
1589 vhost_vring_call_packed(dev, vq);
1597 rte_vhost_dequeue_burst(int vid, uint16_t queue_id,
1598 struct rte_mempool *mbuf_pool, struct rte_mbuf **pkts, uint16_t count)
1600 struct virtio_net *dev;
1601 struct rte_mbuf *rarp_mbuf = NULL;
1602 struct vhost_virtqueue *vq;
1604 dev = get_device(vid);
1608 if (unlikely(!(dev->flags & VIRTIO_DEV_BUILTIN_VIRTIO_NET))) {
1609 RTE_LOG(ERR, VHOST_DATA,
1610 "(%d) %s: built-in vhost net backend is disabled.\n",
1611 dev->vid, __func__);
1615 if (unlikely(!is_valid_virt_queue_idx(queue_id, 1, dev->nr_vring))) {
1616 RTE_LOG(ERR, VHOST_DATA, "(%d) %s: invalid virtqueue idx %d.\n",
1617 dev->vid, __func__, queue_id);
1621 vq = dev->virtqueue[queue_id];
1623 if (unlikely(rte_spinlock_trylock(&vq->access_lock) == 0))
1626 if (unlikely(vq->enabled == 0)) {
1628 goto out_access_unlock;
1631 if (dev->features & (1ULL << VIRTIO_F_IOMMU_PLATFORM))
1632 vhost_user_iotlb_rd_lock(vq);
1634 if (unlikely(vq->access_ok == 0))
1635 if (unlikely(vring_translate(dev, vq) < 0)) {
1641 * Construct a RARP broadcast packet, and inject it to the "pkts"
1642 * array, to looks like that guest actually send such packet.
1644 * Check user_send_rarp() for more information.
1646 * broadcast_rarp shares a cacheline in the virtio_net structure
1647 * with some fields that are accessed during enqueue and
1648 * rte_atomic16_cmpset() causes a write if using cmpxchg. This could
1649 * result in false sharing between enqueue and dequeue.
1651 * Prevent unnecessary false sharing by reading broadcast_rarp first
1652 * and only performing cmpset if the read indicates it is likely to
1655 if (unlikely(rte_atomic16_read(&dev->broadcast_rarp) &&
1656 rte_atomic16_cmpset((volatile uint16_t *)
1657 &dev->broadcast_rarp.cnt, 1, 0))) {
1659 rarp_mbuf = rte_net_make_rarp_packet(mbuf_pool, &dev->mac);
1660 if (rarp_mbuf == NULL) {
1661 RTE_LOG(ERR, VHOST_DATA,
1662 "Failed to make RARP packet.\n");
1669 if (vq_is_packed(dev))
1670 count = virtio_dev_tx_packed(dev, vq, mbuf_pool, pkts, count);
1672 count = virtio_dev_tx_split(dev, vq, mbuf_pool, pkts, count);
1675 if (dev->features & (1ULL << VIRTIO_F_IOMMU_PLATFORM))
1676 vhost_user_iotlb_rd_unlock(vq);
1679 rte_spinlock_unlock(&vq->access_lock);
1681 if (unlikely(rarp_mbuf != NULL)) {
1683 * Inject it to the head of "pkts" array, so that switch's mac
1684 * learning table will get updated first.
1686 memmove(&pkts[1], pkts, count * sizeof(struct rte_mbuf *));
1687 pkts[0] = rarp_mbuf;