4 * Copyright 2015 6WIND S.A.
5 * Copyright 2015 Mellanox.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of 6WIND S.A. nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40 /* ISO C doesn't support unnamed structs/unions, disabling -pedantic. */
42 #pragma GCC diagnostic ignored "-Wpedantic"
44 #include <infiniband/verbs.h>
45 #include <infiniband/mlx5dv.h>
47 #pragma GCC diagnostic error "-Wpedantic"
51 #include <rte_mempool.h>
52 #include <rte_prefetch.h>
53 #include <rte_common.h>
54 #include <rte_branch_prediction.h>
55 #include <rte_ether.h>
58 #include "mlx5_utils.h"
59 #include "mlx5_rxtx.h"
60 #include "mlx5_autoconf.h"
61 #include "mlx5_defs.h"
64 static __rte_always_inline uint32_t
65 rxq_cq_to_pkt_type(volatile struct mlx5_cqe *cqe);
67 static __rte_always_inline int
68 mlx5_rx_poll_len(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe,
69 uint16_t cqe_cnt, uint32_t *rss_hash);
71 static __rte_always_inline uint32_t
72 rxq_cq_to_ol_flags(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe);
74 uint32_t mlx5_ptype_table[] __rte_cache_aligned = {
75 [0xff] = RTE_PTYPE_ALL_MASK, /* Last entry for errored packet. */
79 * Build a table to translate Rx completion flags to packet type.
81 * @note: fix mlx5_dev_supported_ptypes_get() if any change here.
84 mlx5_set_ptype_table(void)
87 uint32_t (*p)[RTE_DIM(mlx5_ptype_table)] = &mlx5_ptype_table;
89 /* Last entry must not be overwritten, reserved for errored packet. */
90 for (i = 0; i < RTE_DIM(mlx5_ptype_table) - 1; ++i)
91 (*p)[i] = RTE_PTYPE_UNKNOWN;
93 * The index to the array should have:
94 * bit[1:0] = l3_hdr_type
95 * bit[4:2] = l4_hdr_type
98 * bit[7] = outer_l3_type
101 (*p)[0x00] = RTE_PTYPE_L2_ETHER;
103 (*p)[0x01] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
104 RTE_PTYPE_L4_NONFRAG;
105 (*p)[0x02] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
106 RTE_PTYPE_L4_NONFRAG;
108 (*p)[0x21] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
110 (*p)[0x22] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
113 (*p)[0x05] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
115 (*p)[0x06] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
117 (*p)[0x0d] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
119 (*p)[0x0e] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
121 (*p)[0x11] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
123 (*p)[0x12] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
126 (*p)[0x09] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
128 (*p)[0x0a] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
130 /* Repeat with outer_l3_type being set. Just in case. */
131 (*p)[0x81] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
132 RTE_PTYPE_L4_NONFRAG;
133 (*p)[0x82] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
134 RTE_PTYPE_L4_NONFRAG;
135 (*p)[0xa1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
137 (*p)[0xa2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
139 (*p)[0x85] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
141 (*p)[0x86] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
143 (*p)[0x8d] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
145 (*p)[0x8e] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
147 (*p)[0x91] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
149 (*p)[0x92] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
151 (*p)[0x89] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
153 (*p)[0x8a] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
156 (*p)[0x41] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
157 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
158 RTE_PTYPE_INNER_L4_NONFRAG;
159 (*p)[0x42] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
160 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
161 RTE_PTYPE_INNER_L4_NONFRAG;
162 (*p)[0xc1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
163 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
164 RTE_PTYPE_INNER_L4_NONFRAG;
165 (*p)[0xc2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
166 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
167 RTE_PTYPE_INNER_L4_NONFRAG;
168 /* Tunneled - Fragmented */
169 (*p)[0x61] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
170 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
171 RTE_PTYPE_INNER_L4_FRAG;
172 (*p)[0x62] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
173 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
174 RTE_PTYPE_INNER_L4_FRAG;
175 (*p)[0xe1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
176 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
177 RTE_PTYPE_INNER_L4_FRAG;
178 (*p)[0xe2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
179 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
180 RTE_PTYPE_INNER_L4_FRAG;
182 (*p)[0x45] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
183 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
184 RTE_PTYPE_INNER_L4_TCP;
185 (*p)[0x46] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
186 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
187 RTE_PTYPE_INNER_L4_TCP;
188 (*p)[0x4d] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
189 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
190 RTE_PTYPE_INNER_L4_TCP;
191 (*p)[0x4e] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
192 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
193 RTE_PTYPE_INNER_L4_TCP;
194 (*p)[0x51] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
195 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
196 RTE_PTYPE_INNER_L4_TCP;
197 (*p)[0x52] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
198 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
199 RTE_PTYPE_INNER_L4_TCP;
200 (*p)[0xc5] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
201 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
202 RTE_PTYPE_INNER_L4_TCP;
203 (*p)[0xc6] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
204 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
205 RTE_PTYPE_INNER_L4_TCP;
206 (*p)[0xcd] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
207 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
208 RTE_PTYPE_INNER_L4_TCP;
209 (*p)[0xce] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
210 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
211 RTE_PTYPE_INNER_L4_TCP;
212 (*p)[0xd1] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
213 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
214 RTE_PTYPE_INNER_L4_TCP;
215 (*p)[0xd2] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
216 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
217 RTE_PTYPE_INNER_L4_TCP;
219 (*p)[0x49] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
220 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
221 RTE_PTYPE_INNER_L4_UDP;
222 (*p)[0x4a] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV4_EXT_UNKNOWN |
223 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
224 RTE_PTYPE_INNER_L4_UDP;
225 (*p)[0xc9] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
226 RTE_PTYPE_INNER_L3_IPV6_EXT_UNKNOWN |
227 RTE_PTYPE_INNER_L4_UDP;
228 (*p)[0xca] = RTE_PTYPE_L2_ETHER | RTE_PTYPE_L3_IPV6_EXT_UNKNOWN |
229 RTE_PTYPE_INNER_L3_IPV4_EXT_UNKNOWN |
230 RTE_PTYPE_INNER_L4_UDP;
234 * Return the size of tailroom of WQ.
237 * Pointer to TX queue structure.
239 * Pointer to tail of WQ.
245 tx_mlx5_wq_tailroom(struct mlx5_txq_data *txq, void *addr)
248 tailroom = (uintptr_t)(txq->wqes) +
249 (1 << txq->wqe_n) * MLX5_WQE_SIZE -
255 * Copy data to tailroom of circular queue.
258 * Pointer to destination.
262 * Number of bytes to copy.
264 * Pointer to head of queue.
266 * Size of tailroom from dst.
269 * Pointer after copied data.
272 mlx5_copy_to_wq(void *dst, const void *src, size_t n,
273 void *base, size_t tailroom)
278 rte_memcpy(dst, src, tailroom);
279 rte_memcpy(base, (void *)((uintptr_t)src + tailroom),
281 ret = (uint8_t *)base + n - tailroom;
283 rte_memcpy(dst, src, n);
284 ret = (n == tailroom) ? base : (uint8_t *)dst + n;
290 * DPDK callback to check the status of a tx descriptor.
295 * The index of the descriptor in the ring.
298 * The status of the tx descriptor.
301 mlx5_tx_descriptor_status(void *tx_queue, uint16_t offset)
303 struct mlx5_txq_data *txq = tx_queue;
306 mlx5_tx_complete(txq);
307 used = txq->elts_head - txq->elts_tail;
309 return RTE_ETH_TX_DESC_FULL;
310 return RTE_ETH_TX_DESC_DONE;
314 * DPDK callback to check the status of a rx descriptor.
319 * The index of the descriptor in the ring.
322 * The status of the tx descriptor.
325 mlx5_rx_descriptor_status(void *rx_queue, uint16_t offset)
327 struct mlx5_rxq_data *rxq = rx_queue;
328 struct rxq_zip *zip = &rxq->zip;
329 volatile struct mlx5_cqe *cqe;
330 const unsigned int cqe_n = (1 << rxq->cqe_n);
331 const unsigned int cqe_cnt = cqe_n - 1;
335 /* if we are processing a compressed cqe */
337 used = zip->cqe_cnt - zip->ca;
343 cqe = &(*rxq->cqes)[cq_ci & cqe_cnt];
344 while (check_cqe(cqe, cqe_n, cq_ci) == 0) {
348 op_own = cqe->op_own;
349 if (MLX5_CQE_FORMAT(op_own) == MLX5_COMPRESSED)
350 n = rte_be_to_cpu_32(cqe->byte_cnt);
355 cqe = &(*rxq->cqes)[cq_ci & cqe_cnt];
357 used = RTE_MIN(used, (1U << rxq->elts_n) - 1);
359 return RTE_ETH_RX_DESC_DONE;
360 return RTE_ETH_RX_DESC_AVAIL;
364 * DPDK callback for TX.
367 * Generic pointer to TX queue structure.
369 * Packets to transmit.
371 * Number of packets in array.
374 * Number of packets successfully transmitted (<= pkts_n).
377 mlx5_tx_burst(void *dpdk_txq, struct rte_mbuf **pkts, uint16_t pkts_n)
379 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
380 uint16_t elts_head = txq->elts_head;
381 const uint16_t elts_n = 1 << txq->elts_n;
382 const uint16_t elts_m = elts_n - 1;
387 unsigned int max_inline = txq->max_inline;
388 const unsigned int inline_en = !!max_inline && txq->inline_en;
391 volatile struct mlx5_wqe_v *wqe = NULL;
392 volatile struct mlx5_wqe_ctrl *last_wqe = NULL;
393 unsigned int segs_n = 0;
394 struct rte_mbuf *buf = NULL;
397 if (unlikely(!pkts_n))
399 /* Prefetch first packet cacheline. */
400 rte_prefetch0(*pkts);
401 /* Start processing. */
402 mlx5_tx_complete(txq);
403 max_elts = (elts_n - (elts_head - txq->elts_tail));
404 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
405 if (unlikely(!max_wqe))
408 volatile rte_v128u32_t *dseg = NULL;
411 unsigned int sg = 0; /* counter of additional segs attached. */
413 uint16_t pkt_inline_sz = MLX5_WQE_DWORD_SIZE + 2;
414 uint16_t tso_header_sz = 0;
418 uint16_t tso_segsz = 0;
419 #ifdef MLX5_PMD_SOFT_COUNTERS
420 uint32_t total_length = 0;
425 segs_n = buf->nb_segs;
427 * Make sure there is enough room to store this packet and
428 * that one ring entry remains unused.
431 if (max_elts < segs_n)
435 if (unlikely(--max_wqe == 0))
437 wqe = (volatile struct mlx5_wqe_v *)
438 tx_mlx5_wqe(txq, txq->wqe_ci);
439 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
441 rte_prefetch0(*(pkts + 1));
442 addr = rte_pktmbuf_mtod(buf, uintptr_t);
443 length = DATA_LEN(buf);
444 ehdr = (((uint8_t *)addr)[1] << 8) |
445 ((uint8_t *)addr)[0];
446 #ifdef MLX5_PMD_SOFT_COUNTERS
447 total_length = length;
449 if (length < (MLX5_WQE_DWORD_SIZE + 2)) {
450 txq->stats.oerrors++;
453 /* Update element. */
454 (*txq->elts)[elts_head & elts_m] = buf;
455 /* Prefetch next buffer data. */
458 rte_pktmbuf_mtod(*(pkts + 1), volatile void *));
459 cs_flags = txq_ol_cksum_to_cs(txq, buf);
460 raw = ((uint8_t *)(uintptr_t)wqe) + 2 * MLX5_WQE_DWORD_SIZE;
461 /* Replace the Ethernet type by the VLAN if necessary. */
462 if (buf->ol_flags & PKT_TX_VLAN_PKT) {
463 uint32_t vlan = rte_cpu_to_be_32(0x81000000 |
465 unsigned int len = 2 * ETHER_ADDR_LEN - 2;
469 /* Copy Destination and source mac address. */
470 memcpy((uint8_t *)raw, ((uint8_t *)addr), len);
472 memcpy((uint8_t *)raw + len, &vlan, sizeof(vlan));
473 /* Copy missing two bytes to end the DSeg. */
474 memcpy((uint8_t *)raw + len + sizeof(vlan),
475 ((uint8_t *)addr) + len, 2);
479 memcpy((uint8_t *)raw, ((uint8_t *)addr) + 2,
480 MLX5_WQE_DWORD_SIZE);
481 length -= pkt_inline_sz;
482 addr += pkt_inline_sz;
484 raw += MLX5_WQE_DWORD_SIZE;
486 tso = buf->ol_flags & PKT_TX_TCP_SEG;
488 uintptr_t end = (uintptr_t)
489 (((uintptr_t)txq->wqes) +
493 uint8_t vlan_sz = (buf->ol_flags &
494 PKT_TX_VLAN_PKT) ? 4 : 0;
495 const uint64_t is_tunneled =
498 PKT_TX_TUNNEL_VXLAN);
500 tso_header_sz = buf->l2_len + vlan_sz +
501 buf->l3_len + buf->l4_len;
502 tso_segsz = buf->tso_segsz;
503 if (unlikely(tso_segsz == 0)) {
504 txq->stats.oerrors++;
507 if (is_tunneled && txq->tunnel_en) {
508 tso_header_sz += buf->outer_l2_len +
510 cs_flags |= MLX5_ETH_WQE_L4_INNER_CSUM;
512 cs_flags |= MLX5_ETH_WQE_L4_CSUM;
514 if (unlikely(tso_header_sz >
515 MLX5_MAX_TSO_HEADER)) {
516 txq->stats.oerrors++;
519 copy_b = tso_header_sz - pkt_inline_sz;
520 /* First seg must contain all headers. */
521 assert(copy_b <= length);
523 ((end - (uintptr_t)raw) > copy_b)) {
524 uint16_t n = (MLX5_WQE_DS(copy_b) -
527 if (unlikely(max_wqe < n))
530 rte_memcpy((void *)raw,
531 (void *)addr, copy_b);
534 /* Include padding for TSO header. */
535 copy_b = MLX5_WQE_DS(copy_b) *
537 pkt_inline_sz += copy_b;
541 wqe->ctrl = (rte_v128u32_t){
550 #ifdef MLX5_PMD_SOFT_COUNTERS
558 /* Inline if enough room. */
559 if (inline_en || tso) {
561 uintptr_t end = (uintptr_t)
562 (((uintptr_t)txq->wqes) +
563 (1 << txq->wqe_n) * MLX5_WQE_SIZE);
564 unsigned int inline_room = max_inline *
565 RTE_CACHE_LINE_SIZE -
566 (pkt_inline_sz - 2) -
568 uintptr_t addr_end = (addr + inline_room) &
569 ~(RTE_CACHE_LINE_SIZE - 1);
570 unsigned int copy_b = (addr_end > addr) ?
571 RTE_MIN((addr_end - addr), length) :
574 if (copy_b && ((end - (uintptr_t)raw) > copy_b)) {
576 * One Dseg remains in the current WQE. To
577 * keep the computation positive, it is
578 * removed after the bytes to Dseg conversion.
580 uint16_t n = (MLX5_WQE_DS(copy_b) - 1 + 3) / 4;
582 if (unlikely(max_wqe < n))
586 inl = rte_cpu_to_be_32(copy_b |
588 rte_memcpy((void *)raw,
589 (void *)&inl, sizeof(inl));
591 pkt_inline_sz += sizeof(inl);
593 rte_memcpy((void *)raw, (void *)addr, copy_b);
596 pkt_inline_sz += copy_b;
599 * 2 DWORDs consumed by the WQE header + ETH segment +
600 * the size of the inline part of the packet.
602 ds = 2 + MLX5_WQE_DS(pkt_inline_sz - 2);
604 if (ds % (MLX5_WQE_SIZE /
605 MLX5_WQE_DWORD_SIZE) == 0) {
606 if (unlikely(--max_wqe == 0))
608 dseg = (volatile rte_v128u32_t *)
609 tx_mlx5_wqe(txq, txq->wqe_ci +
612 dseg = (volatile rte_v128u32_t *)
614 (ds * MLX5_WQE_DWORD_SIZE));
617 } else if (!segs_n) {
620 /* dseg will be advance as part of next_seg */
621 dseg = (volatile rte_v128u32_t *)
623 ((ds - 1) * MLX5_WQE_DWORD_SIZE));
628 * No inline has been done in the packet, only the
629 * Ethernet Header as been stored.
631 dseg = (volatile rte_v128u32_t *)
632 ((uintptr_t)wqe + (3 * MLX5_WQE_DWORD_SIZE));
635 /* Add the remaining packet as a simple ds. */
636 addr = rte_cpu_to_be_64(addr);
637 *dseg = (rte_v128u32_t){
638 rte_cpu_to_be_32(length),
639 mlx5_tx_mb2mr(txq, buf),
652 * Spill on next WQE when the current one does not have
653 * enough room left. Size of WQE must a be a multiple
654 * of data segment size.
656 assert(!(MLX5_WQE_SIZE % MLX5_WQE_DWORD_SIZE));
657 if (!(ds % (MLX5_WQE_SIZE / MLX5_WQE_DWORD_SIZE))) {
658 if (unlikely(--max_wqe == 0))
660 dseg = (volatile rte_v128u32_t *)
661 tx_mlx5_wqe(txq, txq->wqe_ci + ds / 4);
662 rte_prefetch0(tx_mlx5_wqe(txq,
663 txq->wqe_ci + ds / 4 + 1));
670 length = DATA_LEN(buf);
671 #ifdef MLX5_PMD_SOFT_COUNTERS
672 total_length += length;
674 /* Store segment information. */
675 addr = rte_cpu_to_be_64(rte_pktmbuf_mtod(buf, uintptr_t));
676 *dseg = (rte_v128u32_t){
677 rte_cpu_to_be_32(length),
678 mlx5_tx_mb2mr(txq, buf),
682 (*txq->elts)[++elts_head & elts_m] = buf;
684 /* Advance counter only if all segs are successfully posted. */
690 if (ds > MLX5_DSEG_MAX) {
691 txq->stats.oerrors++;
697 /* Initialize known and common part of the WQE structure. */
699 wqe->ctrl = (rte_v128u32_t){
700 rte_cpu_to_be_32((txq->wqe_ci << 8) |
702 rte_cpu_to_be_32(txq->qp_num_8s | ds),
706 wqe->eseg = (rte_v128u32_t){
708 cs_flags | (rte_cpu_to_be_16(tso_segsz) << 16),
710 (ehdr << 16) | rte_cpu_to_be_16(tso_header_sz),
713 wqe->ctrl = (rte_v128u32_t){
714 rte_cpu_to_be_32((txq->wqe_ci << 8) |
716 rte_cpu_to_be_32(txq->qp_num_8s | ds),
720 wqe->eseg = (rte_v128u32_t){
724 (ehdr << 16) | rte_cpu_to_be_16(pkt_inline_sz),
728 txq->wqe_ci += (ds + 3) / 4;
729 /* Save the last successful WQE for completion request */
730 last_wqe = (volatile struct mlx5_wqe_ctrl *)wqe;
731 #ifdef MLX5_PMD_SOFT_COUNTERS
732 /* Increment sent bytes counter. */
733 txq->stats.obytes += total_length;
735 } while (i < pkts_n);
736 /* Take a shortcut if nothing must be sent. */
737 if (unlikely((i + k) == 0))
739 txq->elts_head += (i + j);
740 /* Check whether completion threshold has been reached. */
741 comp = txq->elts_comp + i + j + k;
742 if (comp >= MLX5_TX_COMP_THRESH) {
743 /* Request completion on last WQE. */
744 last_wqe->ctrl2 = rte_cpu_to_be_32(8);
745 /* Save elts_head in unused "immediate" field of WQE. */
746 last_wqe->ctrl3 = txq->elts_head;
749 txq->elts_comp = comp;
751 #ifdef MLX5_PMD_SOFT_COUNTERS
752 /* Increment sent packets counter. */
753 txq->stats.opackets += i;
755 /* Ring QP doorbell. */
756 mlx5_tx_dbrec(txq, (volatile struct mlx5_wqe *)last_wqe);
761 * Open a MPW session.
764 * Pointer to TX queue structure.
766 * Pointer to MPW session structure.
771 mlx5_mpw_new(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw, uint32_t length)
773 uint16_t idx = txq->wqe_ci & ((1 << txq->wqe_n) - 1);
774 volatile struct mlx5_wqe_data_seg (*dseg)[MLX5_MPW_DSEG_MAX] =
775 (volatile struct mlx5_wqe_data_seg (*)[])
776 tx_mlx5_wqe(txq, idx + 1);
778 mpw->state = MLX5_MPW_STATE_OPENED;
782 mpw->wqe = (volatile struct mlx5_wqe *)tx_mlx5_wqe(txq, idx);
783 mpw->wqe->eseg.mss = rte_cpu_to_be_16(length);
784 mpw->wqe->eseg.inline_hdr_sz = 0;
785 mpw->wqe->eseg.rsvd0 = 0;
786 mpw->wqe->eseg.rsvd1 = 0;
787 mpw->wqe->eseg.rsvd2 = 0;
788 mpw->wqe->ctrl[0] = rte_cpu_to_be_32((MLX5_OPC_MOD_MPW << 24) |
791 mpw->wqe->ctrl[2] = 0;
792 mpw->wqe->ctrl[3] = 0;
793 mpw->data.dseg[0] = (volatile struct mlx5_wqe_data_seg *)
794 (((uintptr_t)mpw->wqe) + (2 * MLX5_WQE_DWORD_SIZE));
795 mpw->data.dseg[1] = (volatile struct mlx5_wqe_data_seg *)
796 (((uintptr_t)mpw->wqe) + (3 * MLX5_WQE_DWORD_SIZE));
797 mpw->data.dseg[2] = &(*dseg)[0];
798 mpw->data.dseg[3] = &(*dseg)[1];
799 mpw->data.dseg[4] = &(*dseg)[2];
803 * Close a MPW session.
806 * Pointer to TX queue structure.
808 * Pointer to MPW session structure.
811 mlx5_mpw_close(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw)
813 unsigned int num = mpw->pkts_n;
816 * Store size in multiple of 16 bytes. Control and Ethernet segments
819 mpw->wqe->ctrl[1] = rte_cpu_to_be_32(txq->qp_num_8s | (2 + num));
820 mpw->state = MLX5_MPW_STATE_CLOSED;
825 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci));
826 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
830 * DPDK callback for TX with MPW support.
833 * Generic pointer to TX queue structure.
835 * Packets to transmit.
837 * Number of packets in array.
840 * Number of packets successfully transmitted (<= pkts_n).
843 mlx5_tx_burst_mpw(void *dpdk_txq, struct rte_mbuf **pkts, uint16_t pkts_n)
845 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
846 uint16_t elts_head = txq->elts_head;
847 const uint16_t elts_n = 1 << txq->elts_n;
848 const uint16_t elts_m = elts_n - 1;
854 struct mlx5_mpw mpw = {
855 .state = MLX5_MPW_STATE_CLOSED,
858 if (unlikely(!pkts_n))
860 /* Prefetch first packet cacheline. */
861 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci));
862 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
863 /* Start processing. */
864 mlx5_tx_complete(txq);
865 max_elts = (elts_n - (elts_head - txq->elts_tail));
866 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
867 if (unlikely(!max_wqe))
870 struct rte_mbuf *buf = *(pkts++);
872 unsigned int segs_n = buf->nb_segs;
876 * Make sure there is enough room to store this packet and
877 * that one ring entry remains unused.
880 if (max_elts < segs_n)
882 /* Do not bother with large packets MPW cannot handle. */
883 if (segs_n > MLX5_MPW_DSEG_MAX) {
884 txq->stats.oerrors++;
889 cs_flags = txq_ol_cksum_to_cs(txq, buf);
890 /* Retrieve packet information. */
891 length = PKT_LEN(buf);
893 /* Start new session if packet differs. */
894 if ((mpw.state == MLX5_MPW_STATE_OPENED) &&
895 ((mpw.len != length) ||
897 (mpw.wqe->eseg.cs_flags != cs_flags)))
898 mlx5_mpw_close(txq, &mpw);
899 if (mpw.state == MLX5_MPW_STATE_CLOSED) {
901 * Multi-Packet WQE consumes at most two WQE.
902 * mlx5_mpw_new() expects to be able to use such
905 if (unlikely(max_wqe < 2))
908 mlx5_mpw_new(txq, &mpw, length);
909 mpw.wqe->eseg.cs_flags = cs_flags;
911 /* Multi-segment packets must be alone in their MPW. */
912 assert((segs_n == 1) || (mpw.pkts_n == 0));
913 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
917 volatile struct mlx5_wqe_data_seg *dseg;
921 (*txq->elts)[elts_head++ & elts_m] = buf;
922 dseg = mpw.data.dseg[mpw.pkts_n];
923 addr = rte_pktmbuf_mtod(buf, uintptr_t);
924 *dseg = (struct mlx5_wqe_data_seg){
925 .byte_count = rte_cpu_to_be_32(DATA_LEN(buf)),
926 .lkey = mlx5_tx_mb2mr(txq, buf),
927 .addr = rte_cpu_to_be_64(addr),
929 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
930 length += DATA_LEN(buf);
936 assert(length == mpw.len);
937 if (mpw.pkts_n == MLX5_MPW_DSEG_MAX)
938 mlx5_mpw_close(txq, &mpw);
939 #ifdef MLX5_PMD_SOFT_COUNTERS
940 /* Increment sent bytes counter. */
941 txq->stats.obytes += length;
945 /* Take a shortcut if nothing must be sent. */
946 if (unlikely(i == 0))
948 /* Check whether completion threshold has been reached. */
949 /* "j" includes both packets and segments. */
950 comp = txq->elts_comp + j;
951 if (comp >= MLX5_TX_COMP_THRESH) {
952 volatile struct mlx5_wqe *wqe = mpw.wqe;
954 /* Request completion on last WQE. */
955 wqe->ctrl[2] = rte_cpu_to_be_32(8);
956 /* Save elts_head in unused "immediate" field of WQE. */
957 wqe->ctrl[3] = elts_head;
960 txq->elts_comp = comp;
962 #ifdef MLX5_PMD_SOFT_COUNTERS
963 /* Increment sent packets counter. */
964 txq->stats.opackets += i;
966 /* Ring QP doorbell. */
967 if (mpw.state == MLX5_MPW_STATE_OPENED)
968 mlx5_mpw_close(txq, &mpw);
969 mlx5_tx_dbrec(txq, mpw.wqe);
970 txq->elts_head = elts_head;
975 * Open a MPW inline session.
978 * Pointer to TX queue structure.
980 * Pointer to MPW session structure.
985 mlx5_mpw_inline_new(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw,
988 uint16_t idx = txq->wqe_ci & ((1 << txq->wqe_n) - 1);
989 struct mlx5_wqe_inl_small *inl;
991 mpw->state = MLX5_MPW_INL_STATE_OPENED;
995 mpw->wqe = (volatile struct mlx5_wqe *)tx_mlx5_wqe(txq, idx);
996 mpw->wqe->ctrl[0] = rte_cpu_to_be_32((MLX5_OPC_MOD_MPW << 24) |
999 mpw->wqe->ctrl[2] = 0;
1000 mpw->wqe->ctrl[3] = 0;
1001 mpw->wqe->eseg.mss = rte_cpu_to_be_16(length);
1002 mpw->wqe->eseg.inline_hdr_sz = 0;
1003 mpw->wqe->eseg.cs_flags = 0;
1004 mpw->wqe->eseg.rsvd0 = 0;
1005 mpw->wqe->eseg.rsvd1 = 0;
1006 mpw->wqe->eseg.rsvd2 = 0;
1007 inl = (struct mlx5_wqe_inl_small *)
1008 (((uintptr_t)mpw->wqe) + 2 * MLX5_WQE_DWORD_SIZE);
1009 mpw->data.raw = (uint8_t *)&inl->raw;
1013 * Close a MPW inline session.
1016 * Pointer to TX queue structure.
1018 * Pointer to MPW session structure.
1021 mlx5_mpw_inline_close(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw)
1024 struct mlx5_wqe_inl_small *inl = (struct mlx5_wqe_inl_small *)
1025 (((uintptr_t)mpw->wqe) + (2 * MLX5_WQE_DWORD_SIZE));
1027 size = MLX5_WQE_SIZE - MLX5_MWQE64_INL_DATA + mpw->total_len;
1029 * Store size in multiple of 16 bytes. Control and Ethernet segments
1032 mpw->wqe->ctrl[1] = rte_cpu_to_be_32(txq->qp_num_8s |
1034 mpw->state = MLX5_MPW_STATE_CLOSED;
1035 inl->byte_cnt = rte_cpu_to_be_32(mpw->total_len | MLX5_INLINE_SEG);
1036 txq->wqe_ci += (size + (MLX5_WQE_SIZE - 1)) / MLX5_WQE_SIZE;
1040 * DPDK callback for TX with MPW inline support.
1043 * Generic pointer to TX queue structure.
1045 * Packets to transmit.
1047 * Number of packets in array.
1050 * Number of packets successfully transmitted (<= pkts_n).
1053 mlx5_tx_burst_mpw_inline(void *dpdk_txq, struct rte_mbuf **pkts,
1056 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
1057 uint16_t elts_head = txq->elts_head;
1058 const uint16_t elts_n = 1 << txq->elts_n;
1059 const uint16_t elts_m = elts_n - 1;
1065 unsigned int inline_room = txq->max_inline * RTE_CACHE_LINE_SIZE;
1066 struct mlx5_mpw mpw = {
1067 .state = MLX5_MPW_STATE_CLOSED,
1070 * Compute the maximum number of WQE which can be consumed by inline
1073 * - 1 control segment,
1074 * - 1 Ethernet segment,
1075 * - N Dseg from the inline request.
1077 const unsigned int wqe_inl_n =
1078 ((2 * MLX5_WQE_DWORD_SIZE +
1079 txq->max_inline * RTE_CACHE_LINE_SIZE) +
1080 RTE_CACHE_LINE_SIZE - 1) / RTE_CACHE_LINE_SIZE;
1082 if (unlikely(!pkts_n))
1084 /* Prefetch first packet cacheline. */
1085 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci));
1086 rte_prefetch0(tx_mlx5_wqe(txq, txq->wqe_ci + 1));
1087 /* Start processing. */
1088 mlx5_tx_complete(txq);
1089 max_elts = (elts_n - (elts_head - txq->elts_tail));
1091 struct rte_mbuf *buf = *(pkts++);
1094 unsigned int segs_n = buf->nb_segs;
1098 * Make sure there is enough room to store this packet and
1099 * that one ring entry remains unused.
1102 if (max_elts < segs_n)
1104 /* Do not bother with large packets MPW cannot handle. */
1105 if (segs_n > MLX5_MPW_DSEG_MAX) {
1106 txq->stats.oerrors++;
1112 * Compute max_wqe in case less WQE were consumed in previous
1115 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
1116 cs_flags = txq_ol_cksum_to_cs(txq, buf);
1117 /* Retrieve packet information. */
1118 length = PKT_LEN(buf);
1119 /* Start new session if packet differs. */
1120 if (mpw.state == MLX5_MPW_STATE_OPENED) {
1121 if ((mpw.len != length) ||
1123 (mpw.wqe->eseg.cs_flags != cs_flags))
1124 mlx5_mpw_close(txq, &mpw);
1125 } else if (mpw.state == MLX5_MPW_INL_STATE_OPENED) {
1126 if ((mpw.len != length) ||
1128 (length > inline_room) ||
1129 (mpw.wqe->eseg.cs_flags != cs_flags)) {
1130 mlx5_mpw_inline_close(txq, &mpw);
1132 txq->max_inline * RTE_CACHE_LINE_SIZE;
1135 if (mpw.state == MLX5_MPW_STATE_CLOSED) {
1136 if ((segs_n != 1) ||
1137 (length > inline_room)) {
1139 * Multi-Packet WQE consumes at most two WQE.
1140 * mlx5_mpw_new() expects to be able to use
1143 if (unlikely(max_wqe < 2))
1146 mlx5_mpw_new(txq, &mpw, length);
1147 mpw.wqe->eseg.cs_flags = cs_flags;
1149 if (unlikely(max_wqe < wqe_inl_n))
1151 max_wqe -= wqe_inl_n;
1152 mlx5_mpw_inline_new(txq, &mpw, length);
1153 mpw.wqe->eseg.cs_flags = cs_flags;
1156 /* Multi-segment packets must be alone in their MPW. */
1157 assert((segs_n == 1) || (mpw.pkts_n == 0));
1158 if (mpw.state == MLX5_MPW_STATE_OPENED) {
1159 assert(inline_room ==
1160 txq->max_inline * RTE_CACHE_LINE_SIZE);
1161 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1165 volatile struct mlx5_wqe_data_seg *dseg;
1168 (*txq->elts)[elts_head++ & elts_m] = buf;
1169 dseg = mpw.data.dseg[mpw.pkts_n];
1170 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1171 *dseg = (struct mlx5_wqe_data_seg){
1173 rte_cpu_to_be_32(DATA_LEN(buf)),
1174 .lkey = mlx5_tx_mb2mr(txq, buf),
1175 .addr = rte_cpu_to_be_64(addr),
1177 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1178 length += DATA_LEN(buf);
1184 assert(length == mpw.len);
1185 if (mpw.pkts_n == MLX5_MPW_DSEG_MAX)
1186 mlx5_mpw_close(txq, &mpw);
1190 assert(mpw.state == MLX5_MPW_INL_STATE_OPENED);
1191 assert(length <= inline_room);
1192 assert(length == DATA_LEN(buf));
1193 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1194 (*txq->elts)[elts_head++ & elts_m] = buf;
1195 /* Maximum number of bytes before wrapping. */
1196 max = ((((uintptr_t)(txq->wqes)) +
1199 (uintptr_t)mpw.data.raw);
1201 rte_memcpy((void *)(uintptr_t)mpw.data.raw,
1204 mpw.data.raw = (volatile void *)txq->wqes;
1205 rte_memcpy((void *)(uintptr_t)mpw.data.raw,
1206 (void *)(addr + max),
1208 mpw.data.raw += length - max;
1210 rte_memcpy((void *)(uintptr_t)mpw.data.raw,
1216 (volatile void *)txq->wqes;
1218 mpw.data.raw += length;
1221 mpw.total_len += length;
1223 if (mpw.pkts_n == MLX5_MPW_DSEG_MAX) {
1224 mlx5_mpw_inline_close(txq, &mpw);
1226 txq->max_inline * RTE_CACHE_LINE_SIZE;
1228 inline_room -= length;
1231 #ifdef MLX5_PMD_SOFT_COUNTERS
1232 /* Increment sent bytes counter. */
1233 txq->stats.obytes += length;
1237 /* Take a shortcut if nothing must be sent. */
1238 if (unlikely(i == 0))
1240 /* Check whether completion threshold has been reached. */
1241 /* "j" includes both packets and segments. */
1242 comp = txq->elts_comp + j;
1243 if (comp >= MLX5_TX_COMP_THRESH) {
1244 volatile struct mlx5_wqe *wqe = mpw.wqe;
1246 /* Request completion on last WQE. */
1247 wqe->ctrl[2] = rte_cpu_to_be_32(8);
1248 /* Save elts_head in unused "immediate" field of WQE. */
1249 wqe->ctrl[3] = elts_head;
1252 txq->elts_comp = comp;
1254 #ifdef MLX5_PMD_SOFT_COUNTERS
1255 /* Increment sent packets counter. */
1256 txq->stats.opackets += i;
1258 /* Ring QP doorbell. */
1259 if (mpw.state == MLX5_MPW_INL_STATE_OPENED)
1260 mlx5_mpw_inline_close(txq, &mpw);
1261 else if (mpw.state == MLX5_MPW_STATE_OPENED)
1262 mlx5_mpw_close(txq, &mpw);
1263 mlx5_tx_dbrec(txq, mpw.wqe);
1264 txq->elts_head = elts_head;
1269 * Open an Enhanced MPW session.
1272 * Pointer to TX queue structure.
1274 * Pointer to MPW session structure.
1279 mlx5_empw_new(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw, int padding)
1281 uint16_t idx = txq->wqe_ci & ((1 << txq->wqe_n) - 1);
1283 mpw->state = MLX5_MPW_ENHANCED_STATE_OPENED;
1285 mpw->total_len = sizeof(struct mlx5_wqe);
1286 mpw->wqe = (volatile struct mlx5_wqe *)tx_mlx5_wqe(txq, idx);
1288 rte_cpu_to_be_32((MLX5_OPC_MOD_ENHANCED_MPSW << 24) |
1289 (txq->wqe_ci << 8) |
1290 MLX5_OPCODE_ENHANCED_MPSW);
1291 mpw->wqe->ctrl[2] = 0;
1292 mpw->wqe->ctrl[3] = 0;
1293 memset((void *)(uintptr_t)&mpw->wqe->eseg, 0, MLX5_WQE_DWORD_SIZE);
1294 if (unlikely(padding)) {
1295 uintptr_t addr = (uintptr_t)(mpw->wqe + 1);
1297 /* Pad the first 2 DWORDs with zero-length inline header. */
1298 *(volatile uint32_t *)addr = rte_cpu_to_be_32(MLX5_INLINE_SEG);
1299 *(volatile uint32_t *)(addr + MLX5_WQE_DWORD_SIZE) =
1300 rte_cpu_to_be_32(MLX5_INLINE_SEG);
1301 mpw->total_len += 2 * MLX5_WQE_DWORD_SIZE;
1302 /* Start from the next WQEBB. */
1303 mpw->data.raw = (volatile void *)(tx_mlx5_wqe(txq, idx + 1));
1305 mpw->data.raw = (volatile void *)(mpw->wqe + 1);
1310 * Close an Enhanced MPW session.
1313 * Pointer to TX queue structure.
1315 * Pointer to MPW session structure.
1318 * Number of consumed WQEs.
1320 static inline uint16_t
1321 mlx5_empw_close(struct mlx5_txq_data *txq, struct mlx5_mpw *mpw)
1325 /* Store size in multiple of 16 bytes. Control and Ethernet segments
1328 mpw->wqe->ctrl[1] = rte_cpu_to_be_32(txq->qp_num_8s |
1329 MLX5_WQE_DS(mpw->total_len));
1330 mpw->state = MLX5_MPW_STATE_CLOSED;
1331 ret = (mpw->total_len + (MLX5_WQE_SIZE - 1)) / MLX5_WQE_SIZE;
1337 * DPDK callback for TX with Enhanced MPW support.
1340 * Generic pointer to TX queue structure.
1342 * Packets to transmit.
1344 * Number of packets in array.
1347 * Number of packets successfully transmitted (<= pkts_n).
1350 mlx5_tx_burst_empw(void *dpdk_txq, struct rte_mbuf **pkts, uint16_t pkts_n)
1352 struct mlx5_txq_data *txq = (struct mlx5_txq_data *)dpdk_txq;
1353 uint16_t elts_head = txq->elts_head;
1354 const uint16_t elts_n = 1 << txq->elts_n;
1355 const uint16_t elts_m = elts_n - 1;
1360 unsigned int max_inline = txq->max_inline * RTE_CACHE_LINE_SIZE;
1361 unsigned int mpw_room = 0;
1362 unsigned int inl_pad = 0;
1364 struct mlx5_mpw mpw = {
1365 .state = MLX5_MPW_STATE_CLOSED,
1368 if (unlikely(!pkts_n))
1370 /* Start processing. */
1371 mlx5_tx_complete(txq);
1372 max_elts = (elts_n - (elts_head - txq->elts_tail));
1373 /* A CQE slot must always be available. */
1374 assert((1u << txq->cqe_n) - (txq->cq_pi - txq->cq_ci));
1375 max_wqe = (1u << txq->wqe_n) - (txq->wqe_ci - txq->wqe_pi);
1376 if (unlikely(!max_wqe))
1379 struct rte_mbuf *buf = *(pkts++);
1381 unsigned int do_inline = 0; /* Whether inline is possible. */
1383 unsigned int segs_n = buf->nb_segs;
1387 * Make sure there is enough room to store this packet and
1388 * that one ring entry remains unused.
1391 if (max_elts - j < segs_n)
1393 /* Do not bother with large packets MPW cannot handle. */
1394 if (segs_n > MLX5_MPW_DSEG_MAX) {
1395 txq->stats.oerrors++;
1398 cs_flags = txq_ol_cksum_to_cs(txq, buf);
1399 /* Retrieve packet information. */
1400 length = PKT_LEN(buf);
1401 /* Start new session if:
1402 * - multi-segment packet
1403 * - no space left even for a dseg
1404 * - next packet can be inlined with a new WQE
1406 * It can't be MLX5_MPW_STATE_OPENED as always have a single
1409 if (mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED) {
1410 if ((segs_n != 1) ||
1411 (inl_pad + sizeof(struct mlx5_wqe_data_seg) >
1413 (length <= txq->inline_max_packet_sz &&
1414 inl_pad + sizeof(inl_hdr) + length >
1416 (mpw.wqe->eseg.cs_flags != cs_flags))
1417 max_wqe -= mlx5_empw_close(txq, &mpw);
1419 if (unlikely(mpw.state == MLX5_MPW_STATE_CLOSED)) {
1420 if (unlikely(segs_n != 1)) {
1421 /* Fall back to legacy MPW.
1422 * A MPW session consumes 2 WQEs at most to
1423 * include MLX5_MPW_DSEG_MAX pointers.
1425 if (unlikely(max_wqe < 2))
1427 mlx5_mpw_new(txq, &mpw, length);
1429 /* In Enhanced MPW, inline as much as the budget
1430 * is allowed. The remaining space is to be
1431 * filled with dsegs. If the title WQEBB isn't
1432 * padded, it will have 2 dsegs there.
1434 mpw_room = RTE_MIN(MLX5_WQE_SIZE_MAX,
1435 (max_inline ? max_inline :
1436 pkts_n * MLX5_WQE_DWORD_SIZE) +
1438 if (unlikely(max_wqe * MLX5_WQE_SIZE <
1441 /* Don't pad the title WQEBB to not waste WQ. */
1442 mlx5_empw_new(txq, &mpw, 0);
1443 mpw_room -= mpw.total_len;
1446 length <= txq->inline_max_packet_sz &&
1447 sizeof(inl_hdr) + length <= mpw_room &&
1450 mpw.wqe->eseg.cs_flags = cs_flags;
1452 /* Evaluate whether the next packet can be inlined.
1453 * Inlininig is possible when:
1454 * - length is less than configured value
1455 * - length fits for remaining space
1456 * - not required to fill the title WQEBB with dsegs
1459 length <= txq->inline_max_packet_sz &&
1460 inl_pad + sizeof(inl_hdr) + length <=
1462 (!txq->mpw_hdr_dseg ||
1463 mpw.total_len >= MLX5_WQE_SIZE);
1465 /* Multi-segment packets must be alone in their MPW. */
1466 assert((segs_n == 1) || (mpw.pkts_n == 0));
1467 if (unlikely(mpw.state == MLX5_MPW_STATE_OPENED)) {
1468 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1472 volatile struct mlx5_wqe_data_seg *dseg;
1475 (*txq->elts)[elts_head++ & elts_m] = buf;
1476 dseg = mpw.data.dseg[mpw.pkts_n];
1477 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1478 *dseg = (struct mlx5_wqe_data_seg){
1479 .byte_count = rte_cpu_to_be_32(
1481 .lkey = mlx5_tx_mb2mr(txq, buf),
1482 .addr = rte_cpu_to_be_64(addr),
1484 #if defined(MLX5_PMD_SOFT_COUNTERS) || !defined(NDEBUG)
1485 length += DATA_LEN(buf);
1491 /* A multi-segmented packet takes one MPW session.
1492 * TODO: Pack more multi-segmented packets if possible.
1494 mlx5_mpw_close(txq, &mpw);
1499 } else if (max_inline && do_inline) {
1500 /* Inline packet into WQE. */
1503 assert(mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED);
1504 assert(length == DATA_LEN(buf));
1505 inl_hdr = rte_cpu_to_be_32(length | MLX5_INLINE_SEG);
1506 addr = rte_pktmbuf_mtod(buf, uintptr_t);
1507 mpw.data.raw = (volatile void *)
1508 ((uintptr_t)mpw.data.raw + inl_pad);
1509 max = tx_mlx5_wq_tailroom(txq,
1510 (void *)(uintptr_t)mpw.data.raw);
1511 /* Copy inline header. */
1512 mpw.data.raw = (volatile void *)
1514 (void *)(uintptr_t)mpw.data.raw,
1517 (void *)(uintptr_t)txq->wqes,
1519 max = tx_mlx5_wq_tailroom(txq,
1520 (void *)(uintptr_t)mpw.data.raw);
1521 /* Copy packet data. */
1522 mpw.data.raw = (volatile void *)
1524 (void *)(uintptr_t)mpw.data.raw,
1527 (void *)(uintptr_t)txq->wqes,
1530 mpw.total_len += (inl_pad + sizeof(inl_hdr) + length);
1531 /* No need to get completion as the entire packet is
1532 * copied to WQ. Free the buf right away.
1534 rte_pktmbuf_free_seg(buf);
1535 mpw_room -= (inl_pad + sizeof(inl_hdr) + length);
1536 /* Add pad in the next packet if any. */
1537 inl_pad = (((uintptr_t)mpw.data.raw +
1538 (MLX5_WQE_DWORD_SIZE - 1)) &
1539 ~(MLX5_WQE_DWORD_SIZE - 1)) -
1540 (uintptr_t)mpw.data.raw;
1542 /* No inline. Load a dseg of packet pointer. */
1543 volatile rte_v128u32_t *dseg;
1545 assert(mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED);
1546 assert((inl_pad + sizeof(*dseg)) <= mpw_room);
1547 assert(length == DATA_LEN(buf));
1548 if (!tx_mlx5_wq_tailroom(txq,
1549 (void *)((uintptr_t)mpw.data.raw
1551 dseg = (volatile void *)txq->wqes;
1553 dseg = (volatile void *)
1554 ((uintptr_t)mpw.data.raw +
1556 (*txq->elts)[elts_head++ & elts_m] = buf;
1557 addr = rte_cpu_to_be_64(rte_pktmbuf_mtod(buf,
1559 *dseg = (rte_v128u32_t) {
1560 rte_cpu_to_be_32(length),
1561 mlx5_tx_mb2mr(txq, buf),
1565 mpw.data.raw = (volatile void *)(dseg + 1);
1566 mpw.total_len += (inl_pad + sizeof(*dseg));
1569 mpw_room -= (inl_pad + sizeof(*dseg));
1572 #ifdef MLX5_PMD_SOFT_COUNTERS
1573 /* Increment sent bytes counter. */
1574 txq->stats.obytes += length;
1577 } while (i < pkts_n);
1578 /* Take a shortcut if nothing must be sent. */
1579 if (unlikely(i == 0))
1581 /* Check whether completion threshold has been reached. */
1582 if (txq->elts_comp + j >= MLX5_TX_COMP_THRESH ||
1583 (uint16_t)(txq->wqe_ci - txq->mpw_comp) >=
1584 (1 << txq->wqe_n) / MLX5_TX_COMP_THRESH_INLINE_DIV) {
1585 volatile struct mlx5_wqe *wqe = mpw.wqe;
1587 /* Request completion on last WQE. */
1588 wqe->ctrl[2] = rte_cpu_to_be_32(8);
1589 /* Save elts_head in unused "immediate" field of WQE. */
1590 wqe->ctrl[3] = elts_head;
1592 txq->mpw_comp = txq->wqe_ci;
1595 txq->elts_comp += j;
1597 #ifdef MLX5_PMD_SOFT_COUNTERS
1598 /* Increment sent packets counter. */
1599 txq->stats.opackets += i;
1601 if (mpw.state == MLX5_MPW_ENHANCED_STATE_OPENED)
1602 mlx5_empw_close(txq, &mpw);
1603 else if (mpw.state == MLX5_MPW_STATE_OPENED)
1604 mlx5_mpw_close(txq, &mpw);
1605 /* Ring QP doorbell. */
1606 mlx5_tx_dbrec(txq, mpw.wqe);
1607 txq->elts_head = elts_head;
1612 * Translate RX completion flags to packet type.
1617 * @note: fix mlx5_dev_supported_ptypes_get() if any change here.
1620 * Packet type for struct rte_mbuf.
1622 static inline uint32_t
1623 rxq_cq_to_pkt_type(volatile struct mlx5_cqe *cqe)
1626 uint8_t pinfo = cqe->pkt_info;
1627 uint16_t ptype = cqe->hdr_type_etc;
1630 * The index to the array should have:
1631 * bit[1:0] = l3_hdr_type
1632 * bit[4:2] = l4_hdr_type
1635 * bit[7] = outer_l3_type
1637 idx = ((pinfo & 0x3) << 6) | ((ptype & 0xfc00) >> 10);
1638 return mlx5_ptype_table[idx];
1642 * Get size of the next packet for a given CQE. For compressed CQEs, the
1643 * consumer index is updated only once all packets of the current one have
1647 * Pointer to RX queue.
1650 * @param[out] rss_hash
1651 * Packet RSS Hash result.
1654 * Packet size in bytes (0 if there is none), -1 in case of completion
1658 mlx5_rx_poll_len(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe,
1659 uint16_t cqe_cnt, uint32_t *rss_hash)
1661 struct rxq_zip *zip = &rxq->zip;
1662 uint16_t cqe_n = cqe_cnt + 1;
1666 /* Process compressed data in the CQE and mini arrays. */
1668 volatile struct mlx5_mini_cqe8 (*mc)[8] =
1669 (volatile struct mlx5_mini_cqe8 (*)[8])
1670 (uintptr_t)(&(*rxq->cqes)[zip->ca & cqe_cnt].pkt_info);
1672 len = rte_be_to_cpu_32((*mc)[zip->ai & 7].byte_cnt);
1673 *rss_hash = rte_be_to_cpu_32((*mc)[zip->ai & 7].rx_hash_result);
1674 if ((++zip->ai & 7) == 0) {
1675 /* Invalidate consumed CQEs */
1678 while (idx != end) {
1679 (*rxq->cqes)[idx & cqe_cnt].op_own =
1680 MLX5_CQE_INVALIDATE;
1684 * Increment consumer index to skip the number of
1685 * CQEs consumed. Hardware leaves holes in the CQ
1686 * ring for software use.
1691 if (unlikely(rxq->zip.ai == rxq->zip.cqe_cnt)) {
1692 /* Invalidate the rest */
1696 while (idx != end) {
1697 (*rxq->cqes)[idx & cqe_cnt].op_own =
1698 MLX5_CQE_INVALIDATE;
1701 rxq->cq_ci = zip->cq_ci;
1704 /* No compressed data, get next CQE and verify if it is compressed. */
1709 ret = check_cqe(cqe, cqe_n, rxq->cq_ci);
1710 if (unlikely(ret == 1))
1713 op_own = cqe->op_own;
1715 if (MLX5_CQE_FORMAT(op_own) == MLX5_COMPRESSED) {
1716 volatile struct mlx5_mini_cqe8 (*mc)[8] =
1717 (volatile struct mlx5_mini_cqe8 (*)[8])
1718 (uintptr_t)(&(*rxq->cqes)[rxq->cq_ci &
1721 /* Fix endianness. */
1722 zip->cqe_cnt = rte_be_to_cpu_32(cqe->byte_cnt);
1724 * Current mini array position is the one returned by
1727 * If completion comprises several mini arrays, as a
1728 * special case the second one is located 7 CQEs after
1729 * the initial CQE instead of 8 for subsequent ones.
1731 zip->ca = rxq->cq_ci;
1732 zip->na = zip->ca + 7;
1733 /* Compute the next non compressed CQE. */
1735 zip->cq_ci = rxq->cq_ci + zip->cqe_cnt;
1736 /* Get packet size to return. */
1737 len = rte_be_to_cpu_32((*mc)[0].byte_cnt);
1738 *rss_hash = rte_be_to_cpu_32((*mc)[0].rx_hash_result);
1740 /* Prefetch all the entries to be invalidated */
1743 while (idx != end) {
1744 rte_prefetch0(&(*rxq->cqes)[(idx) & cqe_cnt]);
1748 len = rte_be_to_cpu_32(cqe->byte_cnt);
1749 *rss_hash = rte_be_to_cpu_32(cqe->rx_hash_res);
1751 /* Error while receiving packet. */
1752 if (unlikely(MLX5_CQE_OPCODE(op_own) == MLX5_CQE_RESP_ERR))
1759 * Translate RX completion flags to offload flags.
1762 * Pointer to RX queue structure.
1767 * Offload flags (ol_flags) for struct rte_mbuf.
1769 static inline uint32_t
1770 rxq_cq_to_ol_flags(struct mlx5_rxq_data *rxq, volatile struct mlx5_cqe *cqe)
1772 uint32_t ol_flags = 0;
1773 uint16_t flags = rte_be_to_cpu_16(cqe->hdr_type_etc);
1777 MLX5_CQE_RX_L3_HDR_VALID,
1778 PKT_RX_IP_CKSUM_GOOD) |
1780 MLX5_CQE_RX_L4_HDR_VALID,
1781 PKT_RX_L4_CKSUM_GOOD);
1782 if ((cqe->pkt_info & MLX5_CQE_RX_TUNNEL_PACKET) && (rxq->csum_l2tun))
1785 MLX5_CQE_RX_L3_HDR_VALID,
1786 PKT_RX_IP_CKSUM_GOOD) |
1788 MLX5_CQE_RX_L4_HDR_VALID,
1789 PKT_RX_L4_CKSUM_GOOD);
1794 * DPDK callback for RX.
1797 * Generic pointer to RX queue structure.
1799 * Array to store received packets.
1801 * Maximum number of packets in array.
1804 * Number of packets successfully received (<= pkts_n).
1807 mlx5_rx_burst(void *dpdk_rxq, struct rte_mbuf **pkts, uint16_t pkts_n)
1809 struct mlx5_rxq_data *rxq = dpdk_rxq;
1810 const unsigned int wqe_cnt = (1 << rxq->elts_n) - 1;
1811 const unsigned int cqe_cnt = (1 << rxq->cqe_n) - 1;
1812 const unsigned int sges_n = rxq->sges_n;
1813 struct rte_mbuf *pkt = NULL;
1814 struct rte_mbuf *seg = NULL;
1815 volatile struct mlx5_cqe *cqe =
1816 &(*rxq->cqes)[rxq->cq_ci & cqe_cnt];
1818 unsigned int rq_ci = rxq->rq_ci << sges_n;
1819 int len = 0; /* keep its value across iterations. */
1822 unsigned int idx = rq_ci & wqe_cnt;
1823 volatile struct mlx5_wqe_data_seg *wqe = &(*rxq->wqes)[idx];
1824 struct rte_mbuf *rep = (*rxq->elts)[idx];
1825 uint32_t rss_hash_res = 0;
1833 rep = rte_mbuf_raw_alloc(rxq->mp);
1834 if (unlikely(rep == NULL)) {
1835 ++rxq->stats.rx_nombuf;
1838 * no buffers before we even started,
1839 * bail out silently.
1843 while (pkt != seg) {
1844 assert(pkt != (*rxq->elts)[idx]);
1848 rte_mbuf_raw_free(pkt);
1854 cqe = &(*rxq->cqes)[rxq->cq_ci & cqe_cnt];
1855 len = mlx5_rx_poll_len(rxq, cqe, cqe_cnt,
1858 rte_mbuf_raw_free(rep);
1861 if (unlikely(len == -1)) {
1862 /* RX error, packet is likely too large. */
1863 rte_mbuf_raw_free(rep);
1864 ++rxq->stats.idropped;
1868 assert(len >= (rxq->crc_present << 2));
1869 /* Update packet information. */
1870 pkt->packet_type = rxq_cq_to_pkt_type(cqe);
1872 if (rss_hash_res && rxq->rss_hash) {
1873 pkt->hash.rss = rss_hash_res;
1874 pkt->ol_flags = PKT_RX_RSS_HASH;
1877 MLX5_FLOW_MARK_IS_VALID(cqe->sop_drop_qpn)) {
1878 pkt->ol_flags |= PKT_RX_FDIR;
1879 if (cqe->sop_drop_qpn !=
1880 rte_cpu_to_be_32(MLX5_FLOW_MARK_DEFAULT)) {
1881 uint32_t mark = cqe->sop_drop_qpn;
1883 pkt->ol_flags |= PKT_RX_FDIR_ID;
1885 mlx5_flow_mark_get(mark);
1888 if (rxq->csum | rxq->csum_l2tun)
1889 pkt->ol_flags |= rxq_cq_to_ol_flags(rxq, cqe);
1890 if (rxq->vlan_strip &&
1891 (cqe->hdr_type_etc &
1892 rte_cpu_to_be_16(MLX5_CQE_VLAN_STRIPPED))) {
1893 pkt->ol_flags |= PKT_RX_VLAN |
1894 PKT_RX_VLAN_STRIPPED;
1896 rte_be_to_cpu_16(cqe->vlan_info);
1898 if (rxq->hw_timestamp) {
1900 rte_be_to_cpu_64(cqe->timestamp);
1901 pkt->ol_flags |= PKT_RX_TIMESTAMP;
1903 if (rxq->crc_present)
1904 len -= ETHER_CRC_LEN;
1907 DATA_LEN(rep) = DATA_LEN(seg);
1908 PKT_LEN(rep) = PKT_LEN(seg);
1909 SET_DATA_OFF(rep, DATA_OFF(seg));
1910 PORT(rep) = PORT(seg);
1911 (*rxq->elts)[idx] = rep;
1913 * Fill NIC descriptor with the new buffer. The lkey and size
1914 * of the buffers are already known, only the buffer address
1917 wqe->addr = rte_cpu_to_be_64(rte_pktmbuf_mtod(rep, uintptr_t));
1918 if (len > DATA_LEN(seg)) {
1919 len -= DATA_LEN(seg);
1924 DATA_LEN(seg) = len;
1925 #ifdef MLX5_PMD_SOFT_COUNTERS
1926 /* Increment bytes counter. */
1927 rxq->stats.ibytes += PKT_LEN(pkt);
1929 /* Return packet. */
1935 /* Align consumer index to the next stride. */
1940 if (unlikely((i == 0) && ((rq_ci >> sges_n) == rxq->rq_ci)))
1942 /* Update the consumer index. */
1943 rxq->rq_ci = rq_ci >> sges_n;
1945 *rxq->cq_db = rte_cpu_to_be_32(rxq->cq_ci);
1947 *rxq->rq_db = rte_cpu_to_be_32(rxq->rq_ci);
1948 #ifdef MLX5_PMD_SOFT_COUNTERS
1949 /* Increment packets counter. */
1950 rxq->stats.ipackets += i;
1956 * Dummy DPDK callback for TX.
1958 * This function is used to temporarily replace the real callback during
1959 * unsafe control operations on the queue, or in case of error.
1962 * Generic pointer to TX queue structure.
1964 * Packets to transmit.
1966 * Number of packets in array.
1969 * Number of packets successfully transmitted (<= pkts_n).
1972 removed_tx_burst(void *dpdk_txq __rte_unused,
1973 struct rte_mbuf **pkts __rte_unused,
1974 uint16_t pkts_n __rte_unused)
1980 * Dummy DPDK callback for RX.
1982 * This function is used to temporarily replace the real callback during
1983 * unsafe control operations on the queue, or in case of error.
1986 * Generic pointer to RX queue structure.
1988 * Array to store received packets.
1990 * Maximum number of packets in array.
1993 * Number of packets successfully received (<= pkts_n).
1996 removed_rx_burst(void *dpdk_txq __rte_unused,
1997 struct rte_mbuf **pkts __rte_unused,
1998 uint16_t pkts_n __rte_unused)
2004 * Vectorized Rx/Tx routines are not compiled in when required vector
2005 * instructions are not supported on a target architecture. The following null
2006 * stubs are needed for linkage when those are not included outside of this file
2007 * (e.g. mlx5_rxtx_vec_sse.c for x86).
2010 uint16_t __attribute__((weak))
2011 mlx5_tx_burst_raw_vec(void *dpdk_txq __rte_unused,
2012 struct rte_mbuf **pkts __rte_unused,
2013 uint16_t pkts_n __rte_unused)
2018 uint16_t __attribute__((weak))
2019 mlx5_tx_burst_vec(void *dpdk_txq __rte_unused,
2020 struct rte_mbuf **pkts __rte_unused,
2021 uint16_t pkts_n __rte_unused)
2026 uint16_t __attribute__((weak))
2027 mlx5_rx_burst_vec(void *dpdk_txq __rte_unused,
2028 struct rte_mbuf **pkts __rte_unused,
2029 uint16_t pkts_n __rte_unused)
2034 int __attribute__((weak))
2035 mlx5_check_raw_vec_tx_support(struct rte_eth_dev *dev __rte_unused)
2040 int __attribute__((weak))
2041 mlx5_check_vec_tx_support(struct rte_eth_dev *dev __rte_unused)
2046 int __attribute__((weak))
2047 mlx5_rxq_check_vec_support(struct mlx5_rxq_data *rxq __rte_unused)
2052 int __attribute__((weak))
2053 mlx5_check_vec_rx_support(struct rte_eth_dev *dev __rte_unused)