1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2020 Inspur Corporation
5 #include <rte_malloc.h>
7 #include <rte_ethdev.h>
10 #include "gro_vxlan_udp4.h"
13 gro_vxlan_udp4_tbl_create(uint16_t socket_id,
14 uint16_t max_flow_num,
15 uint16_t max_item_per_flow)
17 struct gro_vxlan_udp4_tbl *tbl;
19 uint32_t entries_num, i;
21 entries_num = max_flow_num * max_item_per_flow;
22 entries_num = RTE_MIN(entries_num, GRO_VXLAN_UDP4_TBL_MAX_ITEM_NUM);
27 tbl = rte_zmalloc_socket(__func__,
28 sizeof(struct gro_vxlan_udp4_tbl),
34 size = sizeof(struct gro_vxlan_udp4_item) * entries_num;
35 tbl->items = rte_zmalloc_socket(__func__,
39 if (tbl->items == NULL) {
43 tbl->max_item_num = entries_num;
45 size = sizeof(struct gro_vxlan_udp4_flow) * entries_num;
46 tbl->flows = rte_zmalloc_socket(__func__,
50 if (tbl->flows == NULL) {
56 for (i = 0; i < entries_num; i++)
57 tbl->flows[i].start_index = INVALID_ARRAY_INDEX;
58 tbl->max_flow_num = entries_num;
64 gro_vxlan_udp4_tbl_destroy(void *tbl)
66 struct gro_vxlan_udp4_tbl *vxlan_tbl = tbl;
69 rte_free(vxlan_tbl->items);
70 rte_free(vxlan_tbl->flows);
75 static inline uint32_t
76 find_an_empty_item(struct gro_vxlan_udp4_tbl *tbl)
78 uint32_t max_item_num = tbl->max_item_num, i;
80 for (i = 0; i < max_item_num; i++)
81 if (tbl->items[i].inner_item.firstseg == NULL)
83 return INVALID_ARRAY_INDEX;
86 static inline uint32_t
87 find_an_empty_flow(struct gro_vxlan_udp4_tbl *tbl)
89 uint32_t max_flow_num = tbl->max_flow_num, i;
91 for (i = 0; i < max_flow_num; i++)
92 if (tbl->flows[i].start_index == INVALID_ARRAY_INDEX)
94 return INVALID_ARRAY_INDEX;
97 static inline uint32_t
98 insert_new_item(struct gro_vxlan_udp4_tbl *tbl,
102 uint16_t frag_offset,
103 uint8_t is_last_frag)
107 item_idx = find_an_empty_item(tbl);
108 if (unlikely(item_idx == INVALID_ARRAY_INDEX))
109 return INVALID_ARRAY_INDEX;
111 tbl->items[item_idx].inner_item.firstseg = pkt;
112 tbl->items[item_idx].inner_item.lastseg = rte_pktmbuf_lastseg(pkt);
113 tbl->items[item_idx].inner_item.start_time = start_time;
114 tbl->items[item_idx].inner_item.next_pkt_idx = INVALID_ARRAY_INDEX;
115 tbl->items[item_idx].inner_item.frag_offset = frag_offset;
116 tbl->items[item_idx].inner_item.is_last_frag = is_last_frag;
117 tbl->items[item_idx].inner_item.nb_merged = 1;
120 /* If the previous packet exists, chain the new one with it. */
121 if (prev_idx != INVALID_ARRAY_INDEX) {
122 tbl->items[item_idx].inner_item.next_pkt_idx =
123 tbl->items[prev_idx].inner_item.next_pkt_idx;
124 tbl->items[prev_idx].inner_item.next_pkt_idx = item_idx;
130 static inline uint32_t
131 delete_item(struct gro_vxlan_udp4_tbl *tbl,
133 uint32_t prev_item_idx)
135 uint32_t next_idx = tbl->items[item_idx].inner_item.next_pkt_idx;
137 /* NULL indicates an empty item. */
138 tbl->items[item_idx].inner_item.firstseg = NULL;
140 if (prev_item_idx != INVALID_ARRAY_INDEX)
141 tbl->items[prev_item_idx].inner_item.next_pkt_idx = next_idx;
146 static inline uint32_t
147 insert_new_flow(struct gro_vxlan_udp4_tbl *tbl,
148 struct vxlan_udp4_flow_key *src,
151 struct vxlan_udp4_flow_key *dst;
154 flow_idx = find_an_empty_flow(tbl);
155 if (unlikely(flow_idx == INVALID_ARRAY_INDEX))
156 return INVALID_ARRAY_INDEX;
158 dst = &(tbl->flows[flow_idx].key);
160 rte_ether_addr_copy(&(src->inner_key.eth_saddr),
161 &(dst->inner_key.eth_saddr));
162 rte_ether_addr_copy(&(src->inner_key.eth_daddr),
163 &(dst->inner_key.eth_daddr));
164 dst->inner_key.ip_src_addr = src->inner_key.ip_src_addr;
165 dst->inner_key.ip_dst_addr = src->inner_key.ip_dst_addr;
166 dst->inner_key.ip_id = src->inner_key.ip_id;
168 dst->vxlan_hdr.vx_flags = src->vxlan_hdr.vx_flags;
169 dst->vxlan_hdr.vx_vni = src->vxlan_hdr.vx_vni;
170 rte_ether_addr_copy(&(src->outer_eth_saddr), &(dst->outer_eth_saddr));
171 rte_ether_addr_copy(&(src->outer_eth_daddr), &(dst->outer_eth_daddr));
172 dst->outer_ip_src_addr = src->outer_ip_src_addr;
173 dst->outer_ip_dst_addr = src->outer_ip_dst_addr;
174 dst->outer_dst_port = src->outer_dst_port;
176 tbl->flows[flow_idx].start_index = item_idx;
183 is_same_vxlan_udp4_flow(struct vxlan_udp4_flow_key k1,
184 struct vxlan_udp4_flow_key k2)
186 /* For VxLAN packet, outer udp src port is calculated from
187 * inner packet RSS hash, udp src port of the first UDP
188 * fragment is different from one of other UDP fragments
189 * even if they are same flow, so we have to skip outer udp
190 * src port comparison here.
192 return (rte_is_same_ether_addr(&k1.outer_eth_saddr,
193 &k2.outer_eth_saddr) &&
194 rte_is_same_ether_addr(&k1.outer_eth_daddr,
195 &k2.outer_eth_daddr) &&
196 (k1.outer_ip_src_addr == k2.outer_ip_src_addr) &&
197 (k1.outer_ip_dst_addr == k2.outer_ip_dst_addr) &&
198 (k1.outer_dst_port == k2.outer_dst_port) &&
199 (k1.vxlan_hdr.vx_flags == k2.vxlan_hdr.vx_flags) &&
200 (k1.vxlan_hdr.vx_vni == k2.vxlan_hdr.vx_vni) &&
201 is_same_udp4_flow(k1.inner_key, k2.inner_key));
205 udp4_check_vxlan_neighbor(struct gro_vxlan_udp4_item *item,
206 uint16_t frag_offset,
209 struct rte_mbuf *pkt = item->inner_item.firstseg;
214 /* Note: if outer DF bit is set, i.e outer_is_atomic is 0,
215 * we needn't compare outer_ip_id because they are same,
216 * for the case outer_is_atomic is 1, we also have no way
217 * to compare outer_ip_id because the difference between
218 * outer_ip_ids of two received packets isn't always +/-1.
219 * So skip outer_ip_id comparison here.
222 l2_offset = pkt->outer_l2_len + pkt->outer_l3_len;
223 cmp = udp4_check_neighbor(&item->inner_item, frag_offset, ip_dl,
226 /* Append the new packet. */
229 /* Prepend the new packet. */
236 merge_two_vxlan_udp4_packets(struct gro_vxlan_udp4_item *item,
237 struct rte_mbuf *pkt,
239 uint16_t frag_offset,
240 uint8_t is_last_frag)
242 if (merge_two_udp4_packets(&item->inner_item, pkt, cmp, frag_offset,
244 pkt->outer_l2_len + pkt->outer_l3_len)) {
252 update_vxlan_header(struct gro_vxlan_udp4_item *item)
254 struct rte_ipv4_hdr *ipv4_hdr;
255 struct rte_udp_hdr *udp_hdr;
256 struct rte_mbuf *pkt = item->inner_item.firstseg;
258 uint16_t frag_offset;
260 /* Update the outer IPv4 header. */
261 len = pkt->pkt_len - pkt->outer_l2_len;
262 ipv4_hdr = (struct rte_ipv4_hdr *)(rte_pktmbuf_mtod(pkt, char *) +
264 ipv4_hdr->total_length = rte_cpu_to_be_16(len);
266 /* Update the outer UDP header. */
267 len -= pkt->outer_l3_len;
268 udp_hdr = (struct rte_udp_hdr *)((char *)ipv4_hdr + pkt->outer_l3_len);
269 udp_hdr->dgram_len = rte_cpu_to_be_16(len);
271 /* Update the inner IPv4 header. */
273 ipv4_hdr = (struct rte_ipv4_hdr *)((char *)udp_hdr + pkt->l2_len);
274 ipv4_hdr->total_length = rte_cpu_to_be_16(len);
276 /* Clear MF bit if it is last fragment */
277 if (item->inner_item.is_last_frag) {
278 frag_offset = rte_be_to_cpu_16(ipv4_hdr->fragment_offset);
279 ipv4_hdr->fragment_offset =
280 rte_cpu_to_be_16(frag_offset & ~RTE_IPV4_HDR_MF_FLAG);
285 gro_vxlan_udp4_reassemble(struct rte_mbuf *pkt,
286 struct gro_vxlan_udp4_tbl *tbl,
289 struct rte_ether_hdr *outer_eth_hdr, *eth_hdr;
290 struct rte_ipv4_hdr *outer_ipv4_hdr, *ipv4_hdr;
291 struct rte_udp_hdr *udp_hdr;
292 struct rte_vxlan_hdr *vxlan_hdr;
293 uint16_t frag_offset;
294 uint8_t is_last_frag;
298 struct vxlan_udp4_flow_key key;
299 uint32_t cur_idx, prev_idx, item_idx;
300 uint32_t i, max_flow_num, remaining_flow_num;
305 outer_eth_hdr = rte_pktmbuf_mtod(pkt, struct rte_ether_hdr *);
306 outer_ipv4_hdr = (struct rte_ipv4_hdr *)((char *)outer_eth_hdr +
309 udp_hdr = (struct rte_udp_hdr *)((char *)outer_ipv4_hdr +
311 vxlan_hdr = (struct rte_vxlan_hdr *)((char *)udp_hdr +
312 sizeof(struct rte_udp_hdr));
313 eth_hdr = (struct rte_ether_hdr *)((char *)vxlan_hdr +
314 sizeof(struct rte_vxlan_hdr));
315 /* l2_len = outer udp hdr len + vxlan hdr len + inner l2 len */
316 ipv4_hdr = (struct rte_ipv4_hdr *)((char *)udp_hdr + pkt->l2_len);
319 * Don't process the packet which has non-fragment inner IP.
321 if (!is_ipv4_fragment(ipv4_hdr))
324 hdr_len = pkt->outer_l2_len + pkt->outer_l3_len + pkt->l2_len +
327 * Don't process the packet whose payload length is less than or
330 if (pkt->pkt_len <= hdr_len)
333 ip_dl = pkt->pkt_len - hdr_len;
335 ip_id = rte_be_to_cpu_16(ipv4_hdr->packet_id);
336 frag_offset = rte_be_to_cpu_16(ipv4_hdr->fragment_offset);
337 is_last_frag = ((frag_offset & RTE_IPV4_HDR_MF_FLAG) == 0) ? 1 : 0;
338 frag_offset = (uint16_t)(frag_offset & RTE_IPV4_HDR_OFFSET_MASK) << 3;
340 rte_ether_addr_copy(&(eth_hdr->src_addr), &(key.inner_key.eth_saddr));
341 rte_ether_addr_copy(&(eth_hdr->dst_addr), &(key.inner_key.eth_daddr));
342 key.inner_key.ip_src_addr = ipv4_hdr->src_addr;
343 key.inner_key.ip_dst_addr = ipv4_hdr->dst_addr;
344 key.inner_key.ip_id = ip_id;
346 key.vxlan_hdr.vx_flags = vxlan_hdr->vx_flags;
347 key.vxlan_hdr.vx_vni = vxlan_hdr->vx_vni;
348 rte_ether_addr_copy(&(outer_eth_hdr->src_addr), &(key.outer_eth_saddr));
349 rte_ether_addr_copy(&(outer_eth_hdr->dst_addr), &(key.outer_eth_daddr));
350 key.outer_ip_src_addr = outer_ipv4_hdr->src_addr;
351 key.outer_ip_dst_addr = outer_ipv4_hdr->dst_addr;
352 /* Note: It is unnecessary to save outer_src_port here because it can
353 * be different for VxLAN UDP fragments from the same flow.
355 key.outer_dst_port = udp_hdr->dst_port;
357 /* Search for a matched flow. */
358 max_flow_num = tbl->max_flow_num;
359 remaining_flow_num = tbl->flow_num;
361 for (i = 0; i < max_flow_num && remaining_flow_num; i++) {
362 if (tbl->flows[i].start_index != INVALID_ARRAY_INDEX) {
363 if (is_same_vxlan_udp4_flow(tbl->flows[i].key, key)) {
367 remaining_flow_num--;
372 * Can't find a matched flow. Insert a new flow and store the
373 * packet into the flow.
376 item_idx = insert_new_item(tbl, pkt, start_time,
377 INVALID_ARRAY_INDEX, frag_offset,
379 if (unlikely(item_idx == INVALID_ARRAY_INDEX))
381 if (insert_new_flow(tbl, &key, item_idx) ==
382 INVALID_ARRAY_INDEX) {
384 * Fail to insert a new flow, so
385 * delete the inserted packet.
387 delete_item(tbl, item_idx, INVALID_ARRAY_INDEX);
393 /* Check all packets in the flow and try to find a neighbor. */
394 cur_idx = tbl->flows[i].start_index;
397 cmp = udp4_check_vxlan_neighbor(&(tbl->items[cur_idx]),
400 if (merge_two_vxlan_udp4_packets(
401 &(tbl->items[cur_idx]),
402 pkt, cmp, frag_offset,
407 * Can't merge two packets, as the packet
408 * length will be greater than the max value.
409 * Insert the packet into the flow.
411 if (insert_new_item(tbl, pkt, start_time, prev_idx,
412 frag_offset, is_last_frag) ==
418 /* Ensure inserted items are ordered by frag_offset */
420 < tbl->items[cur_idx].inner_item.frag_offset) {
425 cur_idx = tbl->items[cur_idx].inner_item.next_pkt_idx;
426 } while (cur_idx != INVALID_ARRAY_INDEX);
428 /* Can't find neighbor. Insert the packet into the flow. */
429 if (cur_idx == tbl->flows[i].start_index) {
430 /* Insert it before the first packet of the flow */
431 item_idx = insert_new_item(tbl, pkt, start_time,
432 INVALID_ARRAY_INDEX, frag_offset,
434 if (unlikely(item_idx == INVALID_ARRAY_INDEX))
436 tbl->items[item_idx].inner_item.next_pkt_idx = cur_idx;
437 tbl->flows[i].start_index = item_idx;
439 if (insert_new_item(tbl, pkt, start_time, prev_idx,
440 frag_offset, is_last_frag
441 ) == INVALID_ARRAY_INDEX)
449 gro_vxlan_udp4_merge_items(struct gro_vxlan_udp4_tbl *tbl,
452 uint16_t frag_offset;
453 uint8_t is_last_frag;
455 struct rte_mbuf *pkt;
460 item_idx = tbl->items[start_idx].inner_item.next_pkt_idx;
461 while (item_idx != INVALID_ARRAY_INDEX) {
462 pkt = tbl->items[item_idx].inner_item.firstseg;
463 hdr_len = pkt->outer_l2_len + pkt->outer_l3_len + pkt->l2_len +
465 ip_dl = pkt->pkt_len - hdr_len;
466 frag_offset = tbl->items[item_idx].inner_item.frag_offset;
467 is_last_frag = tbl->items[item_idx].inner_item.is_last_frag;
468 cmp = udp4_check_vxlan_neighbor(&(tbl->items[start_idx]),
471 if (merge_two_vxlan_udp4_packets(
472 &(tbl->items[start_idx]),
473 pkt, cmp, frag_offset,
475 item_idx = delete_item(tbl, item_idx,
476 INVALID_ARRAY_INDEX);
477 tbl->items[start_idx].inner_item.next_pkt_idx
489 gro_vxlan_udp4_tbl_timeout_flush(struct gro_vxlan_udp4_tbl *tbl,
490 uint64_t flush_timestamp,
491 struct rte_mbuf **out,
496 uint32_t max_flow_num = tbl->max_flow_num;
498 for (i = 0; i < max_flow_num; i++) {
499 if (unlikely(tbl->flow_num == 0))
502 j = tbl->flows[i].start_index;
503 while (j != INVALID_ARRAY_INDEX) {
504 if (tbl->items[j].inner_item.start_time <=
506 gro_vxlan_udp4_merge_items(tbl, j);
507 out[k++] = tbl->items[j].inner_item.firstseg;
508 if (tbl->items[j].inner_item.nb_merged > 1)
509 update_vxlan_header(&(tbl->items[j]));
511 * Delete the item and get the next packet
514 j = delete_item(tbl, j, INVALID_ARRAY_INDEX);
515 tbl->flows[i].start_index = j;
516 if (j == INVALID_ARRAY_INDEX)
519 if (unlikely(k == nb_out))
523 * Flushing packets does not strictly follow
524 * timestamp. It does not flush left packets of
525 * the flow this time once it finds one item
526 * whose start_time is greater than
527 * flush_timestamp. So go to check other flows.
536 gro_vxlan_udp4_tbl_pkt_count(void *tbl)
538 struct gro_vxlan_udp4_tbl *gro_tbl = tbl;
541 return gro_tbl->item_num;