1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2015 6WIND S.A.
3 * Copyright 2015 Mellanox Technologies, Ltd
12 /* ISO C doesn't support unnamed structs/unions, disabling -pedantic. */
14 #pragma GCC diagnostic ignored "-Wpedantic"
16 #include <infiniband/verbs.h>
17 #include <infiniband/mlx5dv.h>
19 #pragma GCC diagnostic error "-Wpedantic"
23 #include <rte_mempool.h>
24 #include <rte_prefetch.h>
25 #include <rte_common.h>
26 #include <rte_branch_prediction.h>
27 #include <rte_ether.h>
30 #include "mlx5_utils.h"
31 #include "mlx5_rxtx.h"
32 #include "mlx5_autoconf.h"
33 #include "mlx5_defs.h"
36 static __rte_always_inline uint32_t
37 rxq_cq_to_pkt_type(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe);
39 static __rte_always_inline int
40 mlx5_rx_poll_len(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe,
41 uint16_t cqe_cnt, uint32_t *rss_hash);
43 static __rte_always_inline uint32_t
44 rxq_cq_to_ol_flags(volatile struct mlx5_cqe *cqe);
46 static __rte_always_inline void
47 rxq_cq_to_mbuf(struct mlx5_rxq_data *rxq, struct rte_mbuf *pkt,
48 volatile struct mlx5_cqe *cqe, uint32_t rss_hash_res);
50 static __rte_always_inline void
51 mprq_buf_replace(struct mlx5_rxq_data *rxq, uint16_t rq_idx);
53 uint32_t mlx5_ptype_table[] __rte_cache_aligned = {
54 [0xff] = RTE_PTYPE_ALL_MASK, /* Last entry for errored packet. */
57 uint8_t mlx5_cksum_table[1 << 10] __rte_cache_aligned;
58 uint8_t mlx5_swp_types_table[1 << 10] __rte_cache_aligned;
61 * Build a table to translate Rx completion flags to packet type.
63 * @note: fix mlx5_dev_supported_ptypes_get() if any change here.
66 mlx5_set_ptype_table(void)
69 uint32_t (*p)[RTE_DIM(mlx5_ptype_table)] = &mlx5_ptype_table;
71 /* Last entry must not be overwritten, reserved for errored packet. */
72 for (i = 0; i < RTE_DIM(mlx5_ptype_table) - 1; ++i)
73 (*p)[i] = RTE_PTYPE_UNKNOWN;
75 * The index to the array should have:
76 * bit[1:0] = l3_hdr_type
77 * bit[4:2] = l4_hdr_type
80 * bit[7] = outer_l3_type
83 (*p)[0x00] = RTE_PTYPE_L2_ETHER;
85 (*p)[0x01] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
87 (*p)[0x02] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
90 (*p)[0x21] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
92 (*p)[0x22] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
95 (*p)[0x05] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
97 (*p)[0x06] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
99 (*p)[0x0d] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
101 (*p)[0x0e] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
103 (*p)[0x11] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
105 (*p)[0x12] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
108 (*p)[0x09] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
110 (*p)[0x0a] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
112 /* Repeat with outer_l3_type being set. Just in case. */
113 (*p)[0x81] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
114 RTE_PTYPE_L4_NONFRAG;
115 (*p)[0x82] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
116 RTE_PTYPE_L4_NONFRAG;
117 (*p)[0xa1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
119 (*p)[0xa2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
121 (*p)[0x85] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
123 (*p)[0x86] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
125 (*p)[0x8d] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
127 (*p)[0x8e] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
129 (*p)[0x91] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
131 (*p)[0x92] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
133 (*p)[0x89] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
135 (*p)[0x8a] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
138 (*p)[0x40] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN;
139 (*p)[0x41] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
140 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
141 RTE_PTYPE_INNER_L4_NONFRAG;
142 (*p)[0x42] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
143 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
144 RTE_PTYPE_INNER_L4_NONFRAG;
145 (*p)[0xc0] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN;
146 (*p)[0xc1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
147 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
148 RTE_PTYPE_INNER_L4_NONFRAG;
149 (*p)[0xc2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
150 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
151 RTE_PTYPE_INNER_L4_NONFRAG;
152 /* Tunneled - Fragmented */
153 (*p)[0x61] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
154 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
155 RTE_PTYPE_INNER_L4_FRAG;
156 (*p)[0x62] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
157 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
158 RTE_PTYPE_INNER_L4_FRAG;
159 (*p)[0xe1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
160 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
161 RTE_PTYPE_INNER_L4_FRAG;
162 (*p)[0xe2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
163 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
164 RTE_PTYPE_INNER_L4_FRAG;
166 (*p)[0x45] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
167 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
168 RTE_PTYPE_INNER_L4_TCP;
169 (*p)[0x46] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
170 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
171 RTE_PTYPE_INNER_L4_TCP;
172 (*p)[0x4d] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
173 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
174 RTE_PTYPE_INNER_L4_TCP;
175 (*p)[0x4e] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
176 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
177 RTE_PTYPE_INNER_L4_TCP;
178 (*p)[0x51] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
179 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
180 RTE_PTYPE_INNER_L4_TCP;
181 (*p)[0x52] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
182 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
183 RTE_PTYPE_INNER_L4_TCP;
184 (*p)[0xc5] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
185 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
186 RTE_PTYPE_INNER_L4_TCP;
187 (*p)[0xc6] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
188 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
189 RTE_PTYPE_INNER_L4_TCP;
190 (*p)[0xcd] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
191 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
192 RTE_PTYPE_INNER_L4_TCP;
193 (*p)[0xce] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
194 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
195 RTE_PTYPE_INNER_L4_TCP;
196 (*p)[0xd1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
197 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
198 RTE_PTYPE_INNER_L4_TCP;
199 (*p)[0xd2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
200 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
201 RTE_PTYPE_INNER_L4_TCP;
203 (*p)[0x49] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
204 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
205 RTE_PTYPE_INNER_L4_UDP;
206 (*p)[0x4a] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
207 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
208 RTE_PTYPE_INNER_L4_UDP;
209 (*p)[0xc9] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
210 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
211 RTE_PTYPE_INNER_L4_UDP;
212 (*p)[0xca] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
213 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
214 RTE_PTYPE_INNER_L4_UDP;
218 * Build a table to translate packet to checksum type of Verbs.
221 mlx5_set_cksum_table(void)
227 * The index should have:
228 * bit[0] = PKT_TX_TCP_SEG
229 * bit[2:3] = PKT_TX_UDP_CKSUM, PKT_TX_TCP_CKSUM
230 * bit[4] = PKT_TX_IP_CKSUM
231 * bit[8] = PKT_TX_OUTER_IP_CKSUM
234 for (i = 0; i < RTE_DIM(mlx5_cksum_table); ++i) {
237 /* Tunneled packet. */
238 if (i & (1 << 8)) /* Outer IP. */
239 v |= MLX5_ETH_WQE_L3_CSUM;
240 if (i & (1 << 4)) /* Inner IP. */
241 v |= MLX5_ETH_WQE_L3_INNER_CSUM;
242 if (i & (3 << 2 | 1 << 0)) /* L4 or TSO. */
243 v |= MLX5_ETH_WQE_L4_INNER_CSUM;
246 if (i & (1 << 4)) /* IP. */
247 v |= MLX5_ETH_WQE_L3_CSUM;
248 if (i & (3 << 2 | 1 << 0)) /* L4 or TSO. */
249 v |= MLX5_ETH_WQE_L4_CSUM;
251 mlx5_cksum_table[i] = v;
256 * Build a table to translate packet type of mbuf to SWP type of Verbs.
259 mlx5_set_swp_types_table(void)
265 * The index should have:
266 * bit[0:1] = PKT_TX_L4_MASK
267 * bit[4] = PKT_TX_IPV6
268 * bit[8] = PKT_TX_OUTER_IPV6
269 * bit[9] = PKT_TX_OUTER_UDP
271 for (i = 0; i < RTE_DIM(mlx5_swp_types_table); ++i) {
274 v |= MLX5_ETH_WQE_L3_OUTER_IPV6;
276 v |= MLX5_ETH_WQE_L4_OUTER_UDP;
278 v |= MLX5_ETH_WQE_L3_INNER_IPV6;
279 if ((i & 3) == (PKT_TX_UDP_CKSUM >> 52))
280 v |= MLX5_ETH_WQE_L4_INNER_UDP;
281 mlx5_swp_types_table[i] = v;
286 * Return the size of tailroom of WQ.
289 * Pointer to TX queue structure.
291 * Pointer to tail of WQ.
297 tx_mlx5_wq_tailroom(struct mlx5_txq_data *txq, void *addr)
300 tailroom = (uintptr_t)(txq->wqes) +
301 (1 << txq->wqe_n) * MLX5_WQE_SIZE -
307 * Copy data to tailroom of circular queue.
310 * Pointer to destination.
314 * Number of bytes to copy.
316 * Pointer to head of queue.
318 * Size of tailroom from dst.
321 * Pointer after copied data.
324 mlx5_copy_to_wq(void *dst, const void *src, size_t n,
325 void *base, size_t tailroom)
330 rte_memcpy(dst, src, tailroom);
331 rte_memcpy(base, (void *)((uintptr_t)src + tailroom),
333 ret = (uint8_t *)base + n - tailroom;
335 rte_memcpy(dst, src, n);
336 ret = (n == tailroom) ? base : (uint8_t *)dst + n;
342 * Inline TSO headers into WQE.
345 * 0 on success, negative errno value on failure.
348 inline_tso(struct mlx5_txq_data *txq, struct rte_mbuf *buf,
351 uint16_t *pkt_inline_sz,
355 uint16_t *tso_header_sz)
357 uintptr_t end = (uintptr_t)(((uintptr_t)txq->wqes) +
358 (1 << txq->wqe_n) * MLX5_WQE_SIZE);
360 uint8_t vlan_sz = (buf->ol_flags & PKT_TX_VLAN_PKT) ? 4 : 0;
361 const uint8_t tunneled = txq->tunnel_en && (buf->ol_flags &
365 *tso_segsz = buf->tso_segsz;
366 *tso_header_sz = buf->l2_len + vlan_sz + buf->l3_len + buf->l4_len;
367 if (unlikely(*tso_segsz == 0 || *tso_header_sz == 0)) {
368 txq->stats.oerrors++;
372 *tso_header_sz += buf->outer_l2_len + buf->outer_l3_len;
373 /* First seg must contain all TSO headers. */
374 if (unlikely(*tso_header_sz > MLX5_MAX_TSO_HEADER) ||
375 *tso_header_sz > DATA_LEN(buf)) {
376 txq->stats.oerrors++;
379 copy_b = *tso_header_sz - *pkt_inline_sz;
380 if (!copy_b || ((end - (uintptr_t)*raw) < copy_b))
382 n_wqe = (MLX5_WQE_DS(copy_b) - 1 + 3) / 4;
383 if (unlikely(*max_wqe < n_wqe))
386 rte_memcpy((void *)*raw, (void *)*addr, copy_b);
389 copy_b = MLX5_WQE_DS(copy_b) * MLX5_WQE_DWORD_SIZE;
390 *pkt_inline_sz += copy_b;
396 * DPDK callback to check the status of a tx descriptor.
401 * The index of the descriptor in the ring.
404 * The status of the tx descriptor.
407 mlx5_tx_descriptor_status(void *tx_queue, uint16_t offset)
409 struct mlx5_txq_data *txq = tx_queue;
412 mlx5_tx_complete(txq);
413 used = txq->elts_head - txq->elts_tail;
415 return RTE_ETH_TX_DESC_FULL;
416 return RTE_ETH_TX_DESC_DONE;
420 * DPDK callback to check the status of a rx descriptor.
425 * The index of the descriptor in the ring.
428 * The status of the tx descriptor.
431 mlx5_rx_descriptor_status(void *rx_queue, uint16_t offset)
433 struct mlx5_rxq_data *rxq = rx_queue;
434 struct rxq_zip *zip = &rxq->zip;
435 volatile struct mlx5_cqe *cqe;
436 const unsigned int cqe_n = (1 << rxq->cqe_n);
437 const unsigned int cqe_cnt = cqe_n - 1;
441 /* if we are processing a compressed cqe */
443 used = zip->cqe_cnt - zip->ca;
449 cqe = &(*rxq->cqes)[cq_ci & cqe_cnt];
450 while (check_cqe(cqe, cqe_n, cq_ci) == 0) {
454 op_own = cqe->op_own;
455 if (MLX5_CQE_FORMAT(op_own) == MLX5_COMPRESSED)
456 n = rte_be_to_cpu_32(cqe->byte_cnt);
461 cqe = &(*rxq->cqes)[cq_ci & cqe_cnt];
463 used = RTE_MIN(used, (1U << rxq->elts_n) - 1);
465 return RTE_ETH_RX_DESC_DONE;
466 return RTE_ETH_RX_DESC_AVAIL;
470 * DPDK callback for TX.
473 * Generic pointer to TX queue structure.
475 * Packets to transmit.
477 * Number of packets in array.
480 * Number of packets successfully transmitted (<= pkts_n).
483 mlx5_tx_burst(void *dpdk_txq, struct rte_mbuf **pkts, uint16_t pkts_n)
485 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
486 uint16_t elts_head = txq->elts_head;
487 const uint16_t elts_n = 1 << txq->elts_n;
488 const uint16_t elts_m = elts_n - 1;
495 volatile struct mlx5_wqe_ctrl *last_wqe = NULL;
496 unsigned int segs_n = 0;
497 const unsigned int max_inline = txq->max_inline;
499 if (unlikely(!pkts_n))
501 /* Prefetch first packet cacheline. */
502 rte_prefetch0(*pkts);
503 /* Start processing. */
504 mlx5_tx_complete(txq);
505 max_elts = (elts_n - (elts_head - txq->elts_tail));
506 /* A CQE slot must always be available. */
507 assert((1u << txq->cqe_n) - (txq->cq_pi - txq->cq_ci));
508 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
509 if (unlikely(!max_wqe))
512 struct rte_mbuf *buf = *pkts; /* First_seg. */
514 volatile struct mlx5_wqe_v *wqe = NULL;
515 volatile rte_v128u32_t *dseg = NULL;
518 unsigned int sg = 0; /* counter of additional segs attached. */
520 uint16_t pkt_inline_sz = MLX5_WQE_DWORD_SIZE + 2;
521 uint16_t tso_header_sz = 0;
524 uint8_t tso = txq->tso_en && (buf->ol_flags & PKT_TX_TCP_SEG);
525 uint8_t is_vlan = !!(buf->ol_flags & PKT_TX_VLAN_PKT);
526 uint32_t swp_offsets = 0;
527 uint8_t swp_types = 0;
528 uint16_t tso_segsz = 0;
529 #ifdef MLX5_PMD_SOFT_COUNTERS
530 uint32_t total_length = 0;
534 segs_n = buf->nb_segs;
536 * Make sure there is enough room to store this packet and
537 * that one ring entry remains unused.
540 if (max_elts < segs_n)
544 if (unlikely(--max_wqe == 0))
546 wqe = (volatile struct mlx5_wqe_v *)
547 tx_mlx5_wqe(txq, txq->wqe_ci);
548 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
550 rte_prefetch0(*(pkts + 1));
551 addr = rte_pktmbuf_mtod(buf, uintptr_t);
552 length = DATA_LEN(buf);
553 ehdr = (((uint8_t *)addr)[1] << 8) |
554 ((uint8_t *)addr)[0];
555 #ifdef MLX5_PMD_SOFT_COUNTERS
556 total_length = length;
558 if (length < (MLX5_WQE_DWORD_SIZE + 2)) {
559 txq->stats.oerrors++;
562 /* Update element. */
563 (*txq->elts)[elts_head & elts_m] = buf;
564 /* Prefetch next buffer data. */
567 rte_pktmbuf_mtod(*(pkts + 1), volatile void *));
568 cs_flags = txq_ol_cksum_to_cs(buf);
569 txq_mbuf_to_swp(txq, buf, tso, is_vlan,
570 (uint8_t *)&swp_offsets, &swp_types);
571 raw = ((uint8_t *)(uintptr_t)wqe) + 2 * MLX5_WQE_DWORD_SIZE;
572 /* Replace the Ethernet type by the VLAN if necessary. */
574 uint32_t vlan = rte_cpu_to_be_32(0x81000000 |
576 unsigned int len = 2 * ETHER_ADDR_LEN - 2;
580 /* Copy Destination and source mac address. */
581 memcpy((uint8_t *)raw, ((uint8_t *)addr), len);
583 memcpy((uint8_t *)raw + len, &vlan, sizeof(vlan));
584 /* Copy missing two bytes to end the DSeg. */
585 memcpy((uint8_t *)raw + len + sizeof(vlan),
586 ((uint8_t *)addr) + len, 2);
590 memcpy((uint8_t *)raw, ((uint8_t *)addr) + 2,
591 MLX5_WQE_DWORD_SIZE);
592 length -= pkt_inline_sz;
593 addr += pkt_inline_sz;
595 raw += MLX5_WQE_DWORD_SIZE;
597 ret = inline_tso(txq, buf, &length,
598 &addr, &pkt_inline_sz,
600 &tso_segsz, &tso_header_sz);
601 if (ret == -EINVAL) {
603 } else if (ret == -EAGAIN) {
605 wqe->ctrl = (rte_v128u32_t){
606 rte_cpu_to_be_32(txq->wqe_ci << 8),
607 rte_cpu_to_be_32(txq->qp_num_8s | 1),
612 #ifdef MLX5_PMD_SOFT_COUNTERS
619 /* Inline if enough room. */
620 if (max_inline || tso) {
622 uintptr_t end = (uintptr_t)
623 (((uintptr_t)txq->wqes) +
624 (1 << txq->wqe_n) * MLX5_WQE_SIZE);
625 unsigned int inline_room = max_inline *
626 RTE_CACHE_LINE_SIZE -
627 (pkt_inline_sz - 2) -
633 addr_end = RTE_ALIGN_FLOOR(addr + inline_room,
634 RTE_CACHE_LINE_SIZE);
635 copy_b = (addr_end > addr) ?
636 RTE_MIN((addr_end - addr), length) : 0;
637 if (copy_b && ((end - (uintptr_t)raw) > copy_b)) {
639 * One Dseg remains in the current WQE. To
640 * keep the computation positive, it is
641 * removed after the bytes to Dseg conversion.
643 uint16_t n = (MLX5_WQE_DS(copy_b) - 1 + 3) / 4;
645 if (unlikely(max_wqe < n))
649 inl = rte_cpu_to_be_32(copy_b |
651 rte_memcpy((void *)raw,
652 (void *)&inl, sizeof(inl));
654 pkt_inline_sz += sizeof(inl);
656 rte_memcpy((void *)raw, (void *)addr, copy_b);
659 pkt_inline_sz += copy_b;
662 * 2 DWORDs consumed by the WQE header + ETH segment +
663 * the size of the inline part of the packet.
665 ds = 2 + MLX5_WQE_DS(pkt_inline_sz - 2);
667 if (ds % (MLX5_WQE_SIZE /
668 MLX5_WQE_DWORD_SIZE) == 0) {
669 if (unlikely(--max_wqe == 0))
671 dseg = (volatile rte_v128u32_t *)
672 tx_mlx5_wqe(txq, txq->wqe_ci +
675 dseg = (volatile rte_v128u32_t *)
677 (ds * MLX5_WQE_DWORD_SIZE));
680 } else if (!segs_n) {
684 inline_room -= copy_b;
688 addr = rte_pktmbuf_mtod(buf, uintptr_t);
689 length = DATA_LEN(buf);
690 #ifdef MLX5_PMD_SOFT_COUNTERS
691 total_length += length;
693 (*txq->elts)[++elts_head & elts_m] = buf;
698 * No inline has been done in the packet, only the
699 * Ethernet Header as been stored.
701 dseg = (volatile rte_v128u32_t *)
702 ((uintptr_t)wqe + (3 * MLX5_WQE_DWORD_SIZE));
705 /* Add the remaining packet as a simple ds. */
706 addr = rte_cpu_to_be_64(addr);
707 *dseg = (rte_v128u32_t){
708 rte_cpu_to_be_32(length),
709 mlx5_tx_mb2mr(txq, buf),
722 * Spill on next WQE when the current one does not have
723 * enough room left. Size of WQE must a be a multiple
724 * of data segment size.
726 assert(!(MLX5_WQE_SIZE % MLX5_WQE_DWORD_SIZE));
727 if (!(ds % (MLX5_WQE_SIZE / MLX5_WQE_DWORD_SIZE))) {
728 if (unlikely(--max_wqe == 0))
730 dseg = (volatile rte_v128u32_t *)
731 tx_mlx5_wqe(txq, txq->wqe_ci + ds / 4);
732 rte_prefetch0(tx_mlx5_wqe(txq,
733 txq->wqe_ci + ds / 4 + 1));
740 length = DATA_LEN(buf);
741 #ifdef MLX5_PMD_SOFT_COUNTERS
742 total_length += length;
744 /* Store segment information. */
745 addr = rte_cpu_to_be_64(rte_pktmbuf_mtod(buf, uintptr_t));
746 *dseg = (rte_v128u32_t){
747 rte_cpu_to_be_32(length),
748 mlx5_tx_mb2mr(txq, buf),
752 (*txq->elts)[++elts_head & elts_m] = buf;
756 if (ds > MLX5_DSEG_MAX) {
757 txq->stats.oerrors++;
764 /* Initialize known and common part of the WQE structure. */
766 wqe->ctrl = (rte_v128u32_t){
767 rte_cpu_to_be_32((txq->wqe_ci << 8) |
769 rte_cpu_to_be_32(txq->qp_num_8s | ds),
773 wqe->eseg = (rte_v128u32_t){
775 cs_flags | (swp_types << 8) |
776 (rte_cpu_to_be_16(tso_segsz) << 16),
778 (ehdr << 16) | rte_cpu_to_be_16(tso_header_sz),
781 wqe->ctrl = (rte_v128u32_t){
782 rte_cpu_to_be_32((txq->wqe_ci << 8) |
784 rte_cpu_to_be_32(txq->qp_num_8s | ds),
788 wqe->eseg = (rte_v128u32_t){
790 cs_flags | (swp_types << 8),
792 (ehdr << 16) | rte_cpu_to_be_16(pkt_inline_sz),
796 txq->wqe_ci += (ds + 3) / 4;
797 /* Save the last successful WQE for completion request */
798 last_wqe = (volatile struct mlx5_wqe_ctrl *)wqe;
799 #ifdef MLX5_PMD_SOFT_COUNTERS
800 /* Increment sent bytes counter. */
801 txq->stats.obytes += total_length;
803 } while (i < pkts_n);
804 /* Take a shortcut if nothing must be sent. */
805 if (unlikely((i + k) == 0))
807 txq->elts_head += (i + j);
808 /* Check whether completion threshold has been reached. */
809 comp = txq->elts_comp + i + j + k;
810 if (comp >= MLX5_TX_COMP_THRESH) {
811 /* Request completion on last WQE. */
812 last_wqe->ctrl2 = rte_cpu_to_be_32(8);
813 /* Save elts_head in unused "immediate" field of WQE. */
814 last_wqe->ctrl3 = txq->elts_head;
820 txq->elts_comp = comp;
822 #ifdef MLX5_PMD_SOFT_COUNTERS
823 /* Increment sent packets counter. */
824 txq->stats.opackets += i;
826 /* Ring QP doorbell. */
827 mlx5_tx_dbrec(txq, (volatile struct mlx5_wqe *)last_wqe);
832 * Open a MPW session.
835 * Pointer to TX queue structure.
837 * Pointer to MPW session structure.
842 mlx5_mpw_new(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw, uint32_t length)
844 uint16_t idx = txq->wqe_ci & ((1 << txq->wqe_n) - 1);
845 volatile struct mlx5_wqe_data_seg (*dseg)[MLX5_MPW_DSEG_MAX] =
846 (volatile struct mlx5_wqe_data_seg (*)[])
847 tx_mlx5_wqe(txq, idx + 1);
849 mpw->state = MLX5_MPW_STATE_OPENED;
853 mpw->wqe = (volatile struct mlx5_wqe *)tx_mlx5_wqe(txq, idx);
854 mpw->wqe->eseg.mss = rte_cpu_to_be_16(length);
855 mpw->wqe->eseg.inline_hdr_sz = 0;
856 mpw->wqe->eseg.rsvd0 = 0;
857 mpw->wqe->eseg.rsvd1 = 0;
858 mpw->wqe->eseg.rsvd2 = 0;
859 mpw->wqe->ctrl[0] = rte_cpu_to_be_32((MLX5_OPC_MOD_MPW << 24) |
862 mpw->wqe->ctrl[2] = 0;
863 mpw->wqe->ctrl[3] = 0;
864 mpw->data.dseg[0] = (volatile struct mlx5_wqe_data_seg *)
865 (((uintptr_t)mpw->wqe) + (2 * MLX5_WQE_DWORD_SIZE));
866 mpw->data.dseg[1] = (volatile struct mlx5_wqe_data_seg *)
867 (((uintptr_t)mpw->wqe) + (3 * MLX5_WQE_DWORD_SIZE));
868 mpw->data.dseg[2] = &(*dseg)[0];
869 mpw->data.dseg[3] = &(*dseg)[1];
870 mpw->data.dseg[4] = &(*dseg)[2];
874 * Close a MPW session.
877 * Pointer to TX queue structure.
879 * Pointer to MPW session structure.
882 mlx5_mpw_close(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw)
884 unsigned int num = mpw->pkts_n;
887 * Store size in multiple of 16 bytes. Control and Ethernet segments
890 mpw->wqe->ctrl[1] = rte_cpu_to_be_32(txq->qp_num_8s | (2 + num));
891 mpw->state = MLX5_MPW_STATE_CLOSED;
896 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci));
897 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
901 * DPDK callback for TX with MPW support.
904 * Generic pointer to TX queue structure.
906 * Packets to transmit.
908 * Number of packets in array.
911 * Number of packets successfully transmitted (<= pkts_n).
914 mlx5_tx_burst_mpw(void *dpdk_txq, struct rte_mbuf **pkts, uint16_t pkts_n)
916 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
917 uint16_t elts_head = txq->elts_head;
918 const uint16_t elts_n = 1 << txq->elts_n;
919 const uint16_t elts_m = elts_n - 1;
925 struct mlx5_mpw mpw = {
926 .state = MLX5_MPW_STATE_CLOSED,
929 if (unlikely(!pkts_n))
931 /* Prefetch first packet cacheline. */
932 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci));
933 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
934 /* Start processing. */
935 mlx5_tx_complete(txq);
936 max_elts = (elts_n - (elts_head - txq->elts_tail));
937 /* A CQE slot must always be available. */
938 assert((1u << txq->cqe_n) - (txq->cq_pi - txq->cq_ci));
939 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
940 if (unlikely(!max_wqe))
943 struct rte_mbuf *buf = *(pkts++);
945 unsigned int segs_n = buf->nb_segs;
949 * Make sure there is enough room to store this packet and
950 * that one ring entry remains unused.
953 if (max_elts < segs_n)
955 /* Do not bother with large packets MPW cannot handle. */
956 if (segs_n > MLX5_MPW_DSEG_MAX) {
957 txq->stats.oerrors++;
962 cs_flags = txq_ol_cksum_to_cs(buf);
963 /* Retrieve packet information. */
964 length = PKT_LEN(buf);
966 /* Start new session if packet differs. */
967 if ((mpw.state == MLX5_MPW_STATE_OPENED) &&
968 ((mpw.len != length) ||
970 (mpw.wqe->eseg.cs_flags != cs_flags)))
971 mlx5_mpw_close(txq, &mpw);
972 if (mpw.state == MLX5_MPW_STATE_CLOSED) {
974 * Multi-Packet WQE consumes at most two WQE.
975 * mlx5_mpw_new() expects to be able to use such
978 if (unlikely(max_wqe < 2))
981 mlx5_mpw_new(txq, &mpw, length);
982 mpw.wqe->eseg.cs_flags = cs_flags;
984 /* Multi-segment packets must be alone in their MPW. */
985 assert((segs_n == 1) || (mpw.pkts_n == 0));
986 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
990 volatile struct mlx5_wqe_data_seg *dseg;
994 (*txq->elts)[elts_head++ & elts_m] = buf;
995 dseg = mpw.data.dseg[mpw.pkts_n];
996 addr = rte_pktmbuf_mtod(buf, uintptr_t);
997 *dseg = (struct mlx5_wqe_data_seg){
998 .byte_count = rte_cpu_to_be_32(DATA_LEN(buf)),
999 .lkey = mlx5_tx_mb2mr(txq, buf),
1000 .addr = rte_cpu_to_be_64(addr),
1002 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1003 length += DATA_LEN(buf);
1009 assert(length == mpw.len);
1010 if (mpw.pkts_n == MLX5_MPW_DSEG_MAX)
1011 mlx5_mpw_close(txq, &mpw);
1012 #ifdef MLX5_PMD_SOFT_COUNTERS
1013 /* Increment sent bytes counter. */
1014 txq->stats.obytes += length;
1018 /* Take a shortcut if nothing must be sent. */
1019 if (unlikely(i == 0))
1021 /* Check whether completion threshold has been reached. */
1022 /* "j" includes both packets and segments. */
1023 comp = txq->elts_comp + j;
1024 if (comp >= MLX5_TX_COMP_THRESH) {
1025 volatile struct mlx5_wqe *wqe = mpw.wqe;
1027 /* Request completion on last WQE. */
1028 wqe->ctrl[2] = rte_cpu_to_be_32(8);
1029 /* Save elts_head in unused "immediate" field of WQE. */
1030 wqe->ctrl[3] = elts_head;
1036 txq->elts_comp = comp;
1038 #ifdef MLX5_PMD_SOFT_COUNTERS
1039 /* Increment sent packets counter. */
1040 txq->stats.opackets += i;
1042 /* Ring QP doorbell. */
1043 if (mpw.state == MLX5_MPW_STATE_OPENED)
1044 mlx5_mpw_close(txq, &mpw);
1045 mlx5_tx_dbrec(txq, mpw.wqe);
1046 txq->elts_head = elts_head;
1051 * Open a MPW inline session.
1054 * Pointer to TX queue structure.
1056 * Pointer to MPW session structure.
1061 mlx5_mpw_inline_new(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw,
1064 uint16_t idx = txq->wqe_ci & ((1 << txq->wqe_n) - 1);
1065 struct mlx5_wqe_inl_small *inl;
1067 mpw->state = MLX5_MPW_INL_STATE_OPENED;
1071 mpw->wqe = (volatile struct mlx5_wqe *)tx_mlx5_wqe(txq, idx);
1072 mpw->wqe->ctrl[0] = rte_cpu_to_be_32((MLX5_OPC_MOD_MPW << 24) |
1073 (txq->wqe_ci << 8) |
1075 mpw->wqe->ctrl[2] = 0;
1076 mpw->wqe->ctrl[3] = 0;
1077 mpw->wqe->eseg.mss = rte_cpu_to_be_16(length);
1078 mpw->wqe->eseg.inline_hdr_sz = 0;
1079 mpw->wqe->eseg.cs_flags = 0;
1080 mpw->wqe->eseg.rsvd0 = 0;
1081 mpw->wqe->eseg.rsvd1 = 0;
1082 mpw->wqe->eseg.rsvd2 = 0;
1083 inl = (struct mlx5_wqe_inl_small *)
1084 (((uintptr_t)mpw->wqe) + 2 * MLX5_WQE_DWORD_SIZE);
1085 mpw->data.raw = (uint8_t *)&inl->raw;
1089 * Close a MPW inline session.
1092 * Pointer to TX queue structure.
1094 * Pointer to MPW session structure.
1097 mlx5_mpw_inline_close(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw)
1100 struct mlx5_wqe_inl_small *inl = (struct mlx5_wqe_inl_small *)
1101 (((uintptr_t)mpw->wqe) + (2 * MLX5_WQE_DWORD_SIZE));
1103 size = MLX5_WQE_SIZE - MLX5_MWQE64_INL_DATA + mpw->total_len;
1105 * Store size in multiple of 16 bytes. Control and Ethernet segments
1108 mpw->wqe->ctrl[1] = rte_cpu_to_be_32(txq->qp_num_8s |
1110 mpw->state = MLX5_MPW_STATE_CLOSED;
1111 inl->byte_cnt = rte_cpu_to_be_32(mpw->total_len | MLX5_INLINE_SEG);
1112 txq->wqe_ci += (size + (MLX5_WQE_SIZE - 1)) / MLX5_WQE_SIZE;
1116 * DPDK callback for TX with MPW inline support.
1119 * Generic pointer to TX queue structure.
1121 * Packets to transmit.
1123 * Number of packets in array.
1126 * Number of packets successfully transmitted (<= pkts_n).
1129 mlx5_tx_burst_mpw_inline(void *dpdk_txq, struct rte_mbuf **pkts,
1132 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
1133 uint16_t elts_head = txq->elts_head;
1134 const uint16_t elts_n = 1 << txq->elts_n;
1135 const uint16_t elts_m = elts_n - 1;
1141 unsigned int inline_room = txq->max_inline * RTE_CACHE_LINE_SIZE;
1142 struct mlx5_mpw mpw = {
1143 .state = MLX5_MPW_STATE_CLOSED,
1146 * Compute the maximum number of WQE which can be consumed by inline
1149 * - 1 control segment,
1150 * - 1 Ethernet segment,
1151 * - N Dseg from the inline request.
1153 const unsigned int wqe_inl_n =
1154 ((2 * MLX5_WQE_DWORD_SIZE +
1155 txq->max_inline * RTE_CACHE_LINE_SIZE) +
1156 RTE_CACHE_LINE_SIZE - 1) / RTE_CACHE_LINE_SIZE;
1158 if (unlikely(!pkts_n))
1160 /* Prefetch first packet cacheline. */
1161 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci));
1162 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
1163 /* Start processing. */
1164 mlx5_tx_complete(txq);
1165 max_elts = (elts_n - (elts_head - txq->elts_tail));
1166 /* A CQE slot must always be available. */
1167 assert((1u << txq->cqe_n) - (txq->cq_pi - txq->cq_ci));
1169 struct rte_mbuf *buf = *(pkts++);
1172 unsigned int segs_n = buf->nb_segs;
1176 * Make sure there is enough room to store this packet and
1177 * that one ring entry remains unused.
1180 if (max_elts < segs_n)
1182 /* Do not bother with large packets MPW cannot handle. */
1183 if (segs_n > MLX5_MPW_DSEG_MAX) {
1184 txq->stats.oerrors++;
1190 * Compute max_wqe in case less WQE were consumed in previous
1193 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
1194 cs_flags = txq_ol_cksum_to_cs(buf);
1195 /* Retrieve packet information. */
1196 length = PKT_LEN(buf);
1197 /* Start new session if packet differs. */
1198 if (mpw.state == MLX5_MPW_STATE_OPENED) {
1199 if ((mpw.len != length) ||
1201 (mpw.wqe->eseg.cs_flags != cs_flags))
1202 mlx5_mpw_close(txq, &mpw);
1203 } else if (mpw.state == MLX5_MPW_INL_STATE_OPENED) {
1204 if ((mpw.len != length) ||
1206 (length > inline_room) ||
1207 (mpw.wqe->eseg.cs_flags != cs_flags)) {
1208 mlx5_mpw_inline_close(txq, &mpw);
1210 txq->max_inline * RTE_CACHE_LINE_SIZE;
1213 if (mpw.state == MLX5_MPW_STATE_CLOSED) {
1214 if ((segs_n != 1) ||
1215 (length > inline_room)) {
1217 * Multi-Packet WQE consumes at most two WQE.
1218 * mlx5_mpw_new() expects to be able to use
1221 if (unlikely(max_wqe < 2))
1224 mlx5_mpw_new(txq, &mpw, length);
1225 mpw.wqe->eseg.cs_flags = cs_flags;
1227 if (unlikely(max_wqe < wqe_inl_n))
1229 max_wqe -= wqe_inl_n;
1230 mlx5_mpw_inline_new(txq, &mpw, length);
1231 mpw.wqe->eseg.cs_flags = cs_flags;
1234 /* Multi-segment packets must be alone in their MPW. */
1235 assert((segs_n == 1) || (mpw.pkts_n == 0));
1236 if (mpw.state == MLX5_MPW_STATE_OPENED) {
1237 assert(inline_room ==
1238 txq->max_inline * RTE_CACHE_LINE_SIZE);
1239 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1243 volatile struct mlx5_wqe_data_seg *dseg;
1246 (*txq->elts)[elts_head++ & elts_m] = buf;
1247 dseg = mpw.data.dseg[mpw.pkts_n];
1248 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1249 *dseg = (struct mlx5_wqe_data_seg){
1251 rte_cpu_to_be_32(DATA_LEN(buf)),
1252 .lkey = mlx5_tx_mb2mr(txq, buf),
1253 .addr = rte_cpu_to_be_64(addr),
1255 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1256 length += DATA_LEN(buf);
1262 assert(length == mpw.len);
1263 if (mpw.pkts_n == MLX5_MPW_DSEG_MAX)
1264 mlx5_mpw_close(txq, &mpw);
1268 assert(mpw.state == MLX5_MPW_INL_STATE_OPENED);
1269 assert(length <= inline_room);
1270 assert(length == DATA_LEN(buf));
1271 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1272 (*txq->elts)[elts_head++ & elts_m] = buf;
1273 /* Maximum number of bytes before wrapping. */
1274 max = ((((uintptr_t)(txq->wqes)) +
1277 (uintptr_t)mpw.data.raw);
1279 rte_memcpy((void *)(uintptr_t)mpw.data.raw,
1282 mpw.data.raw = (volatile void *)txq->wqes;
1283 rte_memcpy((void *)(uintptr_t)mpw.data.raw,
1284 (void *)(addr + max),
1286 mpw.data.raw += length - max;
1288 rte_memcpy((void *)(uintptr_t)mpw.data.raw,
1294 (volatile void *)txq->wqes;
1296 mpw.data.raw += length;
1299 mpw.total_len += length;
1301 if (mpw.pkts_n == MLX5_MPW_DSEG_MAX) {
1302 mlx5_mpw_inline_close(txq, &mpw);
1304 txq->max_inline * RTE_CACHE_LINE_SIZE;
1306 inline_room -= length;
1309 #ifdef MLX5_PMD_SOFT_COUNTERS
1310 /* Increment sent bytes counter. */
1311 txq->stats.obytes += length;
1315 /* Take a shortcut if nothing must be sent. */
1316 if (unlikely(i == 0))
1318 /* Check whether completion threshold has been reached. */
1319 /* "j" includes both packets and segments. */
1320 comp = txq->elts_comp + j;
1321 if (comp >= MLX5_TX_COMP_THRESH) {
1322 volatile struct mlx5_wqe *wqe = mpw.wqe;
1324 /* Request completion on last WQE. */
1325 wqe->ctrl[2] = rte_cpu_to_be_32(8);
1326 /* Save elts_head in unused "immediate" field of WQE. */
1327 wqe->ctrl[3] = elts_head;
1333 txq->elts_comp = comp;
1335 #ifdef MLX5_PMD_SOFT_COUNTERS
1336 /* Increment sent packets counter. */
1337 txq->stats.opackets += i;
1339 /* Ring QP doorbell. */
1340 if (mpw.state == MLX5_MPW_INL_STATE_OPENED)
1341 mlx5_mpw_inline_close(txq, &mpw);
1342 else if (mpw.state == MLX5_MPW_STATE_OPENED)
1343 mlx5_mpw_close(txq, &mpw);
1344 mlx5_tx_dbrec(txq, mpw.wqe);
1345 txq->elts_head = elts_head;
1350 * Open an Enhanced MPW session.
1353 * Pointer to TX queue structure.
1355 * Pointer to MPW session structure.
1360 mlx5_empw_new(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw, int padding)
1362 uint16_t idx = txq->wqe_ci & ((1 << txq->wqe_n) - 1);
1364 mpw->state = MLX5_MPW_ENHANCED_STATE_OPENED;
1366 mpw->total_len = sizeof(struct mlx5_wqe);
1367 mpw->wqe = (volatile struct mlx5_wqe *)tx_mlx5_wqe(txq, idx);
1369 rte_cpu_to_be_32((MLX5_OPC_MOD_ENHANCED_MPSW << 24) |
1370 (txq->wqe_ci << 8) |
1371 MLX5_OPCODE_ENHANCED_MPSW);
1372 mpw->wqe->ctrl[2] = 0;
1373 mpw->wqe->ctrl[3] = 0;
1374 memset((void *)(uintptr_t)&mpw->wqe->eseg, 0, MLX5_WQE_DWORD_SIZE);
1375 if (unlikely(padding)) {
1376 uintptr_t addr = (uintptr_t)(mpw->wqe + 1);
1378 /* Pad the first 2 DWORDs with zero-length inline header. */
1379 *(volatile uint32_t *)addr = rte_cpu_to_be_32(MLX5_INLINE_SEG);
1380 *(volatile uint32_t *)(addr + MLX5_WQE_DWORD_SIZE) =
1381 rte_cpu_to_be_32(MLX5_INLINE_SEG);
1382 mpw->total_len += 2 * MLX5_WQE_DWORD_SIZE;
1383 /* Start from the next WQEBB. */
1384 mpw->data.raw = (volatile void *)(tx_mlx5_wqe(txq, idx + 1));
1386 mpw->data.raw = (volatile void *)(mpw->wqe + 1);
1391 * Close an Enhanced MPW session.
1394 * Pointer to TX queue structure.
1396 * Pointer to MPW session structure.
1399 * Number of consumed WQEs.
1401 static inline uint16_t
1402 mlx5_empw_close(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw)
1406 /* Store size in multiple of 16 bytes. Control and Ethernet segments
1409 mpw->wqe->ctrl[1] = rte_cpu_to_be_32(txq->qp_num_8s |
1410 MLX5_WQE_DS(mpw->total_len));
1411 mpw->state = MLX5_MPW_STATE_CLOSED;
1412 ret = (mpw->total_len + (MLX5_WQE_SIZE - 1)) / MLX5_WQE_SIZE;
1418 * TX with Enhanced MPW support.
1421 * Pointer to TX queue structure.
1423 * Packets to transmit.
1425 * Number of packets in array.
1428 * Number of packets successfully transmitted (<= pkts_n).
1430 static inline uint16_t
1431 txq_burst_empw(struct mlx5_txq_data *txq, struct rte_mbuf **pkts,
1434 uint16_t elts_head = txq->elts_head;
1435 const uint16_t elts_n = 1 << txq->elts_n;
1436 const uint16_t elts_m = elts_n - 1;
1441 unsigned int max_inline = txq->max_inline * RTE_CACHE_LINE_SIZE;
1442 unsigned int mpw_room = 0;
1443 unsigned int inl_pad = 0;
1445 struct mlx5_mpw mpw = {
1446 .state = MLX5_MPW_STATE_CLOSED,
1449 if (unlikely(!pkts_n))
1451 /* Start processing. */
1452 mlx5_tx_complete(txq);
1453 max_elts = (elts_n - (elts_head - txq->elts_tail));
1454 /* A CQE slot must always be available. */
1455 assert((1u << txq->cqe_n) - (txq->cq_pi - txq->cq_ci));
1456 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
1457 if (unlikely(!max_wqe))
1460 struct rte_mbuf *buf = *(pkts++);
1462 unsigned int do_inline = 0; /* Whether inline is possible. */
1466 /* Multi-segmented packet is handled in slow-path outside. */
1467 assert(NB_SEGS(buf) == 1);
1468 /* Make sure there is enough room to store this packet. */
1469 if (max_elts - j == 0)
1471 cs_flags = txq_ol_cksum_to_cs(buf);
1472 /* Retrieve packet information. */
1473 length = PKT_LEN(buf);
1474 /* Start new session if:
1475 * - multi-segment packet
1476 * - no space left even for a dseg
1477 * - next packet can be inlined with a new WQE
1480 if (mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED) {
1481 if ((inl_pad + sizeof(struct mlx5_wqe_data_seg) >
1483 (length <= txq->inline_max_packet_sz &&
1484 inl_pad + sizeof(inl_hdr) + length >
1486 (mpw.wqe->eseg.cs_flags != cs_flags))
1487 max_wqe -= mlx5_empw_close(txq, &mpw);
1489 if (unlikely(mpw.state == MLX5_MPW_STATE_CLOSED)) {
1490 /* In Enhanced MPW, inline as much as the budget is
1491 * allowed. The remaining space is to be filled with
1492 * dsegs. If the title WQEBB isn't padded, it will have
1495 mpw_room = RTE_MIN(MLX5_WQE_SIZE_MAX,
1496 (max_inline ? max_inline :
1497 pkts_n * MLX5_WQE_DWORD_SIZE) +
1499 if (unlikely(max_wqe * MLX5_WQE_SIZE < mpw_room))
1501 /* Don't pad the title WQEBB to not waste WQ. */
1502 mlx5_empw_new(txq, &mpw, 0);
1503 mpw_room -= mpw.total_len;
1505 do_inline = length <= txq->inline_max_packet_sz &&
1506 sizeof(inl_hdr) + length <= mpw_room &&
1508 mpw.wqe->eseg.cs_flags = cs_flags;
1510 /* Evaluate whether the next packet can be inlined.
1511 * Inlininig is possible when:
1512 * - length is less than configured value
1513 * - length fits for remaining space
1514 * - not required to fill the title WQEBB with dsegs
1517 length <= txq->inline_max_packet_sz &&
1518 inl_pad + sizeof(inl_hdr) + length <=
1520 (!txq->mpw_hdr_dseg ||
1521 mpw.total_len >= MLX5_WQE_SIZE);
1523 if (max_inline && do_inline) {
1524 /* Inline packet into WQE. */
1527 assert(mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED);
1528 assert(length == DATA_LEN(buf));
1529 inl_hdr = rte_cpu_to_be_32(length | MLX5_INLINE_SEG);
1530 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1531 mpw.data.raw = (volatile void *)
1532 ((uintptr_t)mpw.data.raw + inl_pad);
1533 max = tx_mlx5_wq_tailroom(txq,
1534 (void *)(uintptr_t)mpw.data.raw);
1535 /* Copy inline header. */
1536 mpw.data.raw = (volatile void *)
1538 (void *)(uintptr_t)mpw.data.raw,
1541 (void *)(uintptr_t)txq->wqes,
1543 max = tx_mlx5_wq_tailroom(txq,
1544 (void *)(uintptr_t)mpw.data.raw);
1545 /* Copy packet data. */
1546 mpw.data.raw = (volatile void *)
1548 (void *)(uintptr_t)mpw.data.raw,
1551 (void *)(uintptr_t)txq->wqes,
1554 mpw.total_len += (inl_pad + sizeof(inl_hdr) + length);
1555 /* No need to get completion as the entire packet is
1556 * copied to WQ. Free the buf right away.
1558 rte_pktmbuf_free_seg(buf);
1559 mpw_room -= (inl_pad + sizeof(inl_hdr) + length);
1560 /* Add pad in the next packet if any. */
1561 inl_pad = (((uintptr_t)mpw.data.raw +
1562 (MLX5_WQE_DWORD_SIZE - 1)) &
1563 ~(MLX5_WQE_DWORD_SIZE - 1)) -
1564 (uintptr_t)mpw.data.raw;
1566 /* No inline. Load a dseg of packet pointer. */
1567 volatile rte_v128u32_t *dseg;
1569 assert(mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED);
1570 assert((inl_pad + sizeof(*dseg)) <= mpw_room);
1571 assert(length == DATA_LEN(buf));
1572 if (!tx_mlx5_wq_tailroom(txq,
1573 (void *)((uintptr_t)mpw.data.raw
1575 dseg = (volatile void *)txq->wqes;
1577 dseg = (volatile void *)
1578 ((uintptr_t)mpw.data.raw +
1580 (*txq->elts)[elts_head++ & elts_m] = buf;
1581 addr = rte_cpu_to_be_64(rte_pktmbuf_mtod(buf,
1583 *dseg = (rte_v128u32_t) {
1584 rte_cpu_to_be_32(length),
1585 mlx5_tx_mb2mr(txq, buf),
1589 mpw.data.raw = (volatile void *)(dseg + 1);
1590 mpw.total_len += (inl_pad + sizeof(*dseg));
1593 mpw_room -= (inl_pad + sizeof(*dseg));
1596 #ifdef MLX5_PMD_SOFT_COUNTERS
1597 /* Increment sent bytes counter. */
1598 txq->stats.obytes += length;
1601 } while (i < pkts_n);
1602 /* Take a shortcut if nothing must be sent. */
1603 if (unlikely(i == 0))
1605 /* Check whether completion threshold has been reached. */
1606 if (txq->elts_comp + j >= MLX5_TX_COMP_THRESH ||
1607 (uint16_t)(txq->wqe_ci - txq->mpw_comp) >=
1608 (1 << txq->wqe_n) / MLX5_TX_COMP_THRESH_INLINE_DIV) {
1609 volatile struct mlx5_wqe *wqe = mpw.wqe;
1611 /* Request completion on last WQE. */
1612 wqe->ctrl[2] = rte_cpu_to_be_32(8);
1613 /* Save elts_head in unused "immediate" field of WQE. */
1614 wqe->ctrl[3] = elts_head;
1616 txq->mpw_comp = txq->wqe_ci;
1621 txq->elts_comp += j;
1623 #ifdef MLX5_PMD_SOFT_COUNTERS
1624 /* Increment sent packets counter. */
1625 txq->stats.opackets += i;
1627 if (mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED)
1628 mlx5_empw_close(txq, &mpw);
1629 /* Ring QP doorbell. */
1630 mlx5_tx_dbrec(txq, mpw.wqe);
1631 txq->elts_head = elts_head;
1636 * DPDK callback for TX with Enhanced MPW support.
1639 * Generic pointer to TX queue structure.
1641 * Packets to transmit.
1643 * Number of packets in array.
1646 * Number of packets successfully transmitted (<= pkts_n).
1649 mlx5_tx_burst_empw(void *dpdk_txq, struct rte_mbuf **pkts, uint16_t pkts_n)
1651 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
1654 while (pkts_n > nb_tx) {
1658 n = txq_count_contig_multi_seg(&pkts[nb_tx], pkts_n - nb_tx);
1660 ret = mlx5_tx_burst(dpdk_txq, &pkts[nb_tx], n);
1665 n = txq_count_contig_single_seg(&pkts[nb_tx], pkts_n - nb_tx);
1667 ret = txq_burst_empw(txq, &pkts[nb_tx], n);
1677 * Translate RX completion flags to packet type.
1680 * Pointer to RX queue structure.
1684 * @note: fix mlx5_dev_supported_ptypes_get() if any change here.
1687 * Packet type for struct rte_mbuf.
1689 static inline uint32_t
1690 rxq_cq_to_pkt_type(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe)
1693 uint8_t pinfo = cqe->pkt_info;
1694 uint16_t ptype = cqe->hdr_type_etc;
1697 * The index to the array should have:
1698 * bit[1:0] = l3_hdr_type
1699 * bit[4:2] = l4_hdr_type
1702 * bit[7] = outer_l3_type
1704 idx = ((pinfo & 0x3) << 6) | ((ptype & 0xfc00) >> 10);
1705 return mlx5_ptype_table[idx] | rxq->tunnel * !!(idx & (1 << 6));
1709 * Get size of the next packet for a given CQE. For compressed CQEs, the
1710 * consumer index is updated only once all packets of the current one have
1714 * Pointer to RX queue.
1717 * @param[out] rss_hash
1718 * Packet RSS Hash result.
1721 * Packet size in bytes (0 if there is none), -1 in case of completion
1725 mlx5_rx_poll_len(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe,
1726 uint16_t cqe_cnt, uint32_t *rss_hash)
1728 struct rxq_zip *zip = &rxq->zip;
1729 uint16_t cqe_n = cqe_cnt + 1;
1733 /* Process compressed data in the CQE and mini arrays. */
1735 volatile struct mlx5_mini_cqe8 (*mc)[8] =
1736 (volatile struct mlx5_mini_cqe8 (*)[8])
1737 (uintptr_t)(&(*rxq->cqes)[zip->ca & cqe_cnt].pkt_info);
1739 len = rte_be_to_cpu_32((*mc)[zip->ai & 7].byte_cnt);
1740 *rss_hash = rte_be_to_cpu_32((*mc)[zip->ai & 7].rx_hash_result);
1741 if ((++zip->ai & 7) == 0) {
1742 /* Invalidate consumed CQEs */
1745 while (idx != end) {
1746 (*rxq->cqes)[idx & cqe_cnt].op_own =
1747 MLX5_CQE_INVALIDATE;
1751 * Increment consumer index to skip the number of
1752 * CQEs consumed. Hardware leaves holes in the CQ
1753 * ring for software use.
1758 if (unlikely(rxq->zip.ai == rxq->zip.cqe_cnt)) {
1759 /* Invalidate the rest */
1763 while (idx != end) {
1764 (*rxq->cqes)[idx & cqe_cnt].op_own =
1765 MLX5_CQE_INVALIDATE;
1768 rxq->cq_ci = zip->cq_ci;
1771 /* No compressed data, get next CQE and verify if it is compressed. */
1776 ret = check_cqe(cqe, cqe_n, rxq->cq_ci);
1777 if (unlikely(ret == 1))
1780 op_own = cqe->op_own;
1782 if (MLX5_CQE_FORMAT(op_own) == MLX5_COMPRESSED) {
1783 volatile struct mlx5_mini_cqe8 (*mc)[8] =
1784 (volatile struct mlx5_mini_cqe8 (*)[8])
1785 (uintptr_t)(&(*rxq->cqes)[rxq->cq_ci &
1788 /* Fix endianness. */
1789 zip->cqe_cnt = rte_be_to_cpu_32(cqe->byte_cnt);
1791 * Current mini array position is the one returned by
1794 * If completion comprises several mini arrays, as a
1795 * special case the second one is located 7 CQEs after
1796 * the initial CQE instead of 8 for subsequent ones.
1798 zip->ca = rxq->cq_ci;
1799 zip->na = zip->ca + 7;
1800 /* Compute the next non compressed CQE. */
1802 zip->cq_ci = rxq->cq_ci + zip->cqe_cnt;
1803 /* Get packet size to return. */
1804 len = rte_be_to_cpu_32((*mc)[0].byte_cnt);
1805 *rss_hash = rte_be_to_cpu_32((*mc)[0].rx_hash_result);
1807 /* Prefetch all the entries to be invalidated */
1810 while (idx != end) {
1811 rte_prefetch0(&(*rxq->cqes)[(idx) & cqe_cnt]);
1815 len = rte_be_to_cpu_32(cqe->byte_cnt);
1816 *rss_hash = rte_be_to_cpu_32(cqe->rx_hash_res);
1818 /* Error while receiving packet. */
1819 if (unlikely(MLX5_CQE_OPCODE(op_own) == MLX5_CQE_RESP_ERR))
1826 * Translate RX completion flags to offload flags.
1832 * Offload flags (ol_flags) for struct rte_mbuf.
1834 static inline uint32_t
1835 rxq_cq_to_ol_flags(volatile struct mlx5_cqe *cqe)
1837 uint32_t ol_flags = 0;
1838 uint16_t flags = rte_be_to_cpu_16(cqe->hdr_type_etc);
1842 MLX5_CQE_RX_L3_HDR_VALID,
1843 PKT_RX_IP_CKSUM_GOOD) |
1845 MLX5_CQE_RX_L4_HDR_VALID,
1846 PKT_RX_L4_CKSUM_GOOD);
1851 * Fill in mbuf fields from RX completion flags.
1852 * Note that pkt->ol_flags should be initialized outside of this function.
1855 * Pointer to RX queue.
1860 * @param rss_hash_res
1861 * Packet RSS Hash result.
1864 rxq_cq_to_mbuf(struct mlx5_rxq_data *rxq, struct rte_mbuf *pkt,
1865 volatile struct mlx5_cqe *cqe, uint32_t rss_hash_res)
1867 /* Update packet information. */
1868 pkt->packet_type = rxq_cq_to_pkt_type(rxq, cqe);
1869 if (rss_hash_res && rxq->rss_hash) {
1870 pkt->hash.rss = rss_hash_res;
1871 pkt->ol_flags |= PKT_RX_RSS_HASH;
1873 if (rxq->mark && MLX5_FLOW_MARK_IS_VALID(cqe->sop_drop_qpn)) {
1874 pkt->ol_flags |= PKT_RX_FDIR;
1875 if (cqe->sop_drop_qpn !=
1876 rte_cpu_to_be_32(MLX5_FLOW_MARK_DEFAULT)) {
1877 uint32_t mark = cqe->sop_drop_qpn;
1879 pkt->ol_flags |= PKT_RX_FDIR_ID;
1880 pkt->hash.fdir.hi = mlx5_flow_mark_get(mark);
1884 pkt->ol_flags |= rxq_cq_to_ol_flags(cqe);
1885 if (rxq->vlan_strip &&
1886 (cqe->hdr_type_etc & rte_cpu_to_be_16(MLX5_CQE_VLAN_STRIPPED))) {
1887 pkt->ol_flags |= PKT_RX_VLAN | PKT_RX_VLAN_STRIPPED;
1888 pkt->vlan_tci = rte_be_to_cpu_16(cqe->vlan_info);
1890 if (rxq->hw_timestamp) {
1891 pkt->timestamp = rte_be_to_cpu_64(cqe->timestamp);
1892 pkt->ol_flags |= PKT_RX_TIMESTAMP;
1897 * DPDK callback for RX.
1900 * Generic pointer to RX queue structure.
1902 * Array to store received packets.
1904 * Maximum number of packets in array.
1907 * Number of packets successfully received (<= pkts_n).
1910 mlx5_rx_burst(void *dpdk_rxq, struct rte_mbuf **pkts, uint16_t pkts_n)
1912 struct mlx5_rxq_data *rxq = dpdk_rxq;
1913 const unsigned int wqe_cnt = (1 << rxq->elts_n) - 1;
1914 const unsigned int cqe_cnt = (1 << rxq->cqe_n) - 1;
1915 const unsigned int sges_n = rxq->sges_n;
1916 struct rte_mbuf *pkt = NULL;
1917 struct rte_mbuf *seg = NULL;
1918 volatile struct mlx5_cqe *cqe =
1919 &(*rxq->cqes)[rxq->cq_ci & cqe_cnt];
1921 unsigned int rq_ci = rxq->rq_ci << sges_n;
1922 int len = 0; /* keep its value across iterations. */
1925 unsigned int idx = rq_ci & wqe_cnt;
1926 volatile struct mlx5_wqe_data_seg *wqe =
1927 &((volatile struct mlx5_wqe_data_seg *)rxq->wqes)[idx];
1928 struct rte_mbuf *rep = (*rxq->elts)[idx];
1929 uint32_t rss_hash_res = 0;
1937 rep = rte_mbuf_raw_alloc(rxq->mp);
1938 if (unlikely(rep == NULL)) {
1939 ++rxq->stats.rx_nombuf;
1942 * no buffers before we even started,
1943 * bail out silently.
1947 while (pkt != seg) {
1948 assert(pkt != (*rxq->elts)[idx]);
1952 rte_mbuf_raw_free(pkt);
1958 cqe = &(*rxq->cqes)[rxq->cq_ci & cqe_cnt];
1959 len = mlx5_rx_poll_len(rxq, cqe, cqe_cnt,
1962 rte_mbuf_raw_free(rep);
1965 if (unlikely(len == -1)) {
1966 /* RX error, packet is likely too large. */
1967 rte_mbuf_raw_free(rep);
1968 ++rxq->stats.idropped;
1972 assert(len >= (rxq->crc_present << 2));
1974 rxq_cq_to_mbuf(rxq, pkt, cqe, rss_hash_res);
1975 if (rxq->crc_present)
1976 len -= ETHER_CRC_LEN;
1979 DATA_LEN(rep) = DATA_LEN(seg);
1980 PKT_LEN(rep) = PKT_LEN(seg);
1981 SET_DATA_OFF(rep, DATA_OFF(seg));
1982 PORT(rep) = PORT(seg);
1983 (*rxq->elts)[idx] = rep;
1985 * Fill NIC descriptor with the new buffer. The lkey and size
1986 * of the buffers are already known, only the buffer address
1989 wqe->addr = rte_cpu_to_be_64(rte_pktmbuf_mtod(rep, uintptr_t));
1990 /* If there's only one MR, no need to replace LKey in WQE. */
1991 if (unlikely(mlx5_mr_btree_len(&rxq->mr_ctrl.cache_bh) > 1))
1992 wqe->lkey = mlx5_rx_mb2mr(rxq, rep);
1993 if (len > DATA_LEN(seg)) {
1994 len -= DATA_LEN(seg);
1999 DATA_LEN(seg) = len;
2000 #ifdef MLX5_PMD_SOFT_COUNTERS
2001 /* Increment bytes counter. */
2002 rxq->stats.ibytes += PKT_LEN(pkt);
2004 /* Return packet. */
2010 /* Align consumer index to the next stride. */
2015 if (unlikely((i == 0) && ((rq_ci >> sges_n) == rxq->rq_ci)))
2017 /* Update the consumer index. */
2018 rxq->rq_ci = rq_ci >> sges_n;
2020 *rxq->cq_db = rte_cpu_to_be_32(rxq->cq_ci);
2022 *rxq->rq_db = rte_cpu_to_be_32(rxq->rq_ci);
2023 #ifdef MLX5_PMD_SOFT_COUNTERS
2024 /* Increment packets counter. */
2025 rxq->stats.ipackets += i;
2031 mlx5_mprq_buf_free_cb(void *addr __rte_unused, void *opaque)
2033 struct mlx5_mprq_buf *buf = opaque;
2035 if (rte_atomic16_read(&buf->refcnt) == 1) {
2036 rte_mempool_put(buf->mp, buf);
2037 } else if (rte_atomic16_add_return(&buf->refcnt, -1) == 0) {
2038 rte_atomic16_set(&buf->refcnt, 1);
2039 rte_mempool_put(buf->mp, buf);
2044 mlx5_mprq_buf_free(struct mlx5_mprq_buf *buf)
2046 mlx5_mprq_buf_free_cb(NULL, buf);
2050 mprq_buf_replace(struct mlx5_rxq_data *rxq, uint16_t rq_idx)
2052 struct mlx5_mprq_buf *rep = rxq->mprq_repl;
2053 volatile struct mlx5_wqe_data_seg *wqe =
2054 &((volatile struct mlx5_wqe_mprq *)rxq->wqes)[rq_idx].dseg;
2057 assert(rep != NULL);
2058 /* Replace MPRQ buf. */
2059 (*rxq->mprq_bufs)[rq_idx] = rep;
2061 addr = mlx5_mprq_buf_addr(rep);
2062 wqe->addr = rte_cpu_to_be_64((uintptr_t)addr);
2063 /* If there's only one MR, no need to replace LKey in WQE. */
2064 if (unlikely(mlx5_mr_btree_len(&rxq->mr_ctrl.cache_bh) > 1))
2065 wqe->lkey = mlx5_rx_addr2mr(rxq, (uintptr_t)addr);
2066 /* Stash a mbuf for next replacement. */
2067 if (likely(!rte_mempool_get(rxq->mprq_mp, (void **)&rep)))
2068 rxq->mprq_repl = rep;
2070 rxq->mprq_repl = NULL;
2074 * DPDK callback for RX with Multi-Packet RQ support.
2077 * Generic pointer to RX queue structure.
2079 * Array to store received packets.
2081 * Maximum number of packets in array.
2084 * Number of packets successfully received (<= pkts_n).
2087 mlx5_rx_burst_mprq(void *dpdk_rxq, struct rte_mbuf **pkts, uint16_t pkts_n)
2089 struct mlx5_rxq_data *rxq = dpdk_rxq;
2090 const unsigned int strd_n = 1 << rxq->strd_num_n;
2091 const unsigned int strd_sz = 1 << rxq->strd_sz_n;
2092 const unsigned int strd_shift =
2093 MLX5_MPRQ_STRIDE_SHIFT_BYTE * rxq->strd_shift_en;
2094 const unsigned int cq_mask = (1 << rxq->cqe_n) - 1;
2095 const unsigned int wq_mask = (1 << rxq->elts_n) - 1;
2096 volatile struct mlx5_cqe *cqe = &(*rxq->cqes)[rxq->cq_ci & cq_mask];
2098 uint16_t rq_ci = rxq->rq_ci;
2099 uint16_t strd_idx = rxq->strd_ci;
2100 struct mlx5_mprq_buf *buf = (*rxq->mprq_bufs)[rq_ci & wq_mask];
2102 while (i < pkts_n) {
2103 struct rte_mbuf *pkt;
2107 uint16_t consumed_strd;
2110 uint32_t rss_hash_res = 0;
2112 if (strd_idx == strd_n) {
2113 /* Replace WQE only if the buffer is still in use. */
2114 if (rte_atomic16_read(&buf->refcnt) > 1) {
2115 mprq_buf_replace(rxq, rq_ci & wq_mask);
2116 /* Release the old buffer. */
2117 mlx5_mprq_buf_free(buf);
2118 } else if (unlikely(rxq->mprq_repl == NULL)) {
2119 struct mlx5_mprq_buf *rep;
2122 * Currently, the MPRQ mempool is out of buffer
2123 * and doing memcpy regardless of the size of Rx
2124 * packet. Retry allocation to get back to
2127 if (!rte_mempool_get(rxq->mprq_mp,
2129 rxq->mprq_repl = rep;
2131 /* Advance to the next WQE. */
2134 buf = (*rxq->mprq_bufs)[rq_ci & wq_mask];
2136 cqe = &(*rxq->cqes)[rxq->cq_ci & cq_mask];
2137 ret = mlx5_rx_poll_len(rxq, cqe, cq_mask, &rss_hash_res);
2140 if (unlikely(ret == -1)) {
2141 /* RX error, packet is likely too large. */
2142 ++rxq->stats.idropped;
2146 consumed_strd = (byte_cnt & MLX5_MPRQ_STRIDE_NUM_MASK) >>
2147 MLX5_MPRQ_STRIDE_NUM_SHIFT;
2148 assert(consumed_strd);
2149 /* Calculate offset before adding up stride index. */
2150 offset = strd_idx * strd_sz + strd_shift;
2151 strd_idx += consumed_strd;
2152 if (byte_cnt & MLX5_MPRQ_FILLER_MASK)
2155 * Currently configured to receive a packet per a stride. But if
2156 * MTU is adjusted through kernel interface, device could
2157 * consume multiple strides without raising an error. In this
2158 * case, the packet should be dropped because it is bigger than
2159 * the max_rx_pkt_len.
2161 if (unlikely(consumed_strd > 1)) {
2162 ++rxq->stats.idropped;
2165 pkt = rte_pktmbuf_alloc(rxq->mp);
2166 if (unlikely(pkt == NULL)) {
2167 ++rxq->stats.rx_nombuf;
2170 len = (byte_cnt & MLX5_MPRQ_LEN_MASK) >> MLX5_MPRQ_LEN_SHIFT;
2171 assert((int)len >= (rxq->crc_present << 2));
2172 if (rxq->crc_present)
2173 len -= ETHER_CRC_LEN;
2174 addr = RTE_PTR_ADD(mlx5_mprq_buf_addr(buf), offset);
2175 /* Initialize the offload flag. */
2178 * Memcpy packets to the target mbuf if:
2179 * - The size of packet is smaller than mprq_max_memcpy_len.
2180 * - Out of buffer in the Mempool for Multi-Packet RQ.
2182 if (len <= rxq->mprq_max_memcpy_len || rxq->mprq_repl == NULL) {
2184 * When memcpy'ing packet due to out-of-buffer, the
2185 * packet must be smaller than the target mbuf.
2187 if (unlikely(rte_pktmbuf_tailroom(pkt) < len)) {
2188 rte_pktmbuf_free_seg(pkt);
2189 ++rxq->stats.idropped;
2192 rte_memcpy(rte_pktmbuf_mtod(pkt, void *), addr, len);
2194 rte_iova_t buf_iova;
2195 struct rte_mbuf_ext_shared_info *shinfo;
2196 uint16_t buf_len = consumed_strd * strd_sz;
2198 /* Increment the refcnt of the whole chunk. */
2199 rte_atomic16_add_return(&buf->refcnt, 1);
2200 assert((uint16_t)rte_atomic16_read(&buf->refcnt) <=
2202 addr = RTE_PTR_SUB(addr, RTE_PKTMBUF_HEADROOM);
2204 * MLX5 device doesn't use iova but it is necessary in a
2205 * case where the Rx packet is transmitted via a
2208 buf_iova = rte_mempool_virt2iova(buf) +
2209 RTE_PTR_DIFF(addr, buf);
2210 shinfo = rte_pktmbuf_ext_shinfo_init_helper(addr,
2211 &buf_len, mlx5_mprq_buf_free_cb, buf);
2213 * EXT_ATTACHED_MBUF will be set to pkt->ol_flags when
2214 * attaching the stride to mbuf and more offload flags
2215 * will be added below by calling rxq_cq_to_mbuf().
2216 * Other fields will be overwritten.
2218 rte_pktmbuf_attach_extbuf(pkt, addr, buf_iova, buf_len,
2220 rte_pktmbuf_reset_headroom(pkt);
2221 assert(pkt->ol_flags == EXT_ATTACHED_MBUF);
2223 * Prevent potential overflow due to MTU change through
2226 if (unlikely(rte_pktmbuf_tailroom(pkt) < len)) {
2227 rte_pktmbuf_free_seg(pkt);
2228 ++rxq->stats.idropped;
2232 rxq_cq_to_mbuf(rxq, pkt, cqe, rss_hash_res);
2234 DATA_LEN(pkt) = len;
2235 PORT(pkt) = rxq->port_id;
2236 #ifdef MLX5_PMD_SOFT_COUNTERS
2237 /* Increment bytes counter. */
2238 rxq->stats.ibytes += PKT_LEN(pkt);
2240 /* Return packet. */
2244 /* Update the consumer indexes. */
2245 rxq->strd_ci = strd_idx;
2247 *rxq->cq_db = rte_cpu_to_be_32(rxq->cq_ci);
2248 if (rq_ci != rxq->rq_ci) {
2251 *rxq->rq_db = rte_cpu_to_be_32(rxq->rq_ci);
2253 #ifdef MLX5_PMD_SOFT_COUNTERS
2254 /* Increment packets counter. */
2255 rxq->stats.ipackets += i;
2261 * Dummy DPDK callback for TX.
2263 * This function is used to temporarily replace the real callback during
2264 * unsafe control operations on the queue, or in case of error.
2267 * Generic pointer to TX queue structure.
2269 * Packets to transmit.
2271 * Number of packets in array.
2274 * Number of packets successfully transmitted (<= pkts_n).
2277 removed_tx_burst(void *dpdk_txq __rte_unused,
2278 struct rte_mbuf **pkts __rte_unused,
2279 uint16_t pkts_n __rte_unused)
2285 * Dummy DPDK callback for RX.
2287 * This function is used to temporarily replace the real callback during
2288 * unsafe control operations on the queue, or in case of error.
2291 * Generic pointer to RX queue structure.
2293 * Array to store received packets.
2295 * Maximum number of packets in array.
2298 * Number of packets successfully received (<= pkts_n).
2301 removed_rx_burst(void *dpdk_txq __rte_unused,
2302 struct rte_mbuf **pkts __rte_unused,
2303 uint16_t pkts_n __rte_unused)
2309 * Vectorized Rx/Tx routines are not compiled in when required vector
2310 * instructions are not supported on a target architecture. The following null
2311 * stubs are needed for linkage when those are not included outside of this file
2312 * (e.g. mlx5_rxtx_vec_sse.c for x86).
2315 uint16_t __attribute__((weak))
2316 mlx5_tx_burst_raw_vec(void *dpdk_txq __rte_unused,
2317 struct rte_mbuf **pkts __rte_unused,
2318 uint16_t pkts_n __rte_unused)
2323 uint16_t __attribute__((weak))
2324 mlx5_tx_burst_vec(void *dpdk_txq __rte_unused,
2325 struct rte_mbuf **pkts __rte_unused,
2326 uint16_t pkts_n __rte_unused)
2331 uint16_t __attribute__((weak))
2332 mlx5_rx_burst_vec(void *dpdk_txq __rte_unused,
2333 struct rte_mbuf **pkts __rte_unused,
2334 uint16_t pkts_n __rte_unused)
2339 int __attribute__((weak))
2340 mlx5_check_raw_vec_tx_support(struct rte_eth_dev *dev __rte_unused)
2345 int __attribute__((weak))
2346 mlx5_check_vec_tx_support(struct rte_eth_dev *dev __rte_unused)
2351 int __attribute__((weak))
2352 mlx5_rxq_check_vec_support(struct mlx5_rxq_data *rxq __rte_unused)
2357 int __attribute__((weak))
2358 mlx5_check_vec_rx_support(struct rte_eth_dev *dev __rte_unused)