2017-12-19 15:49:03 +00:00
|
|
|
/* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
* Copyright(c) 2010-2014 Intel Corporation
|
2014-05-28 17:32:41 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stddef.h>
|
|
|
|
|
|
|
|
#include <rte_debug.h>
|
|
|
|
|
|
|
|
#include "ip_frag_common.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reassemble fragments into one packet.
|
|
|
|
*/
|
|
|
|
struct rte_mbuf *
|
2016-04-21 17:28:01 +00:00
|
|
|
ipv4_frag_reassemble(struct ip_frag_pkt *fp)
|
2014-05-28 17:32:41 +00:00
|
|
|
{
|
2019-05-21 16:13:10 +00:00
|
|
|
struct rte_ipv4_hdr *ip_hdr;
|
2014-05-28 17:32:41 +00:00
|
|
|
struct rte_mbuf *m, *prev;
|
|
|
|
uint32_t i, n, ofs, first_len;
|
2016-04-21 17:28:01 +00:00
|
|
|
uint32_t curr_idx = 0;
|
2014-05-28 17:32:41 +00:00
|
|
|
|
|
|
|
first_len = fp->frags[IP_FIRST_FRAG_IDX].len;
|
|
|
|
n = fp->last_idx - 1;
|
|
|
|
|
|
|
|
/*start from the last fragment. */
|
|
|
|
m = fp->frags[IP_LAST_FRAG_IDX].mb;
|
|
|
|
ofs = fp->frags[IP_LAST_FRAG_IDX].ofs;
|
2016-04-21 17:28:01 +00:00
|
|
|
curr_idx = IP_LAST_FRAG_IDX;
|
2014-05-28 17:32:41 +00:00
|
|
|
|
|
|
|
while (ofs != first_len) {
|
|
|
|
|
|
|
|
prev = m;
|
|
|
|
|
|
|
|
for (i = n; i != IP_FIRST_FRAG_IDX && ofs != first_len; i--) {
|
|
|
|
|
|
|
|
/* previous fragment found. */
|
|
|
|
if(fp->frags[i].ofs + fp->frags[i].len == ofs) {
|
|
|
|
|
2018-11-05 12:18:57 +00:00
|
|
|
RTE_ASSERT(curr_idx != i);
|
|
|
|
|
2015-10-15 07:01:46 +00:00
|
|
|
/* adjust start of the last fragment data. */
|
2018-11-05 12:18:57 +00:00
|
|
|
rte_pktmbuf_adj(m,
|
|
|
|
(uint16_t)(m->l2_len + m->l3_len));
|
2015-10-15 07:01:46 +00:00
|
|
|
rte_pktmbuf_chain(fp->frags[i].mb, m);
|
2014-05-28 17:32:41 +00:00
|
|
|
|
2016-04-21 17:28:01 +00:00
|
|
|
/* this mbuf should not be accessed directly */
|
|
|
|
fp->frags[curr_idx].mb = NULL;
|
|
|
|
curr_idx = i;
|
|
|
|
|
2014-05-28 17:32:41 +00:00
|
|
|
/* update our last fragment and offset. */
|
|
|
|
m = fp->frags[i].mb;
|
|
|
|
ofs = fp->frags[i].ofs;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* error - hole in the packet. */
|
|
|
|
if (m == prev) {
|
2015-05-11 14:10:25 +00:00
|
|
|
return NULL;
|
2014-05-28 17:32:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* chain with the first fragment. */
|
2015-10-15 07:01:46 +00:00
|
|
|
rte_pktmbuf_adj(m, (uint16_t)(m->l2_len + m->l3_len));
|
|
|
|
rte_pktmbuf_chain(fp->frags[IP_FIRST_FRAG_IDX].mb, m);
|
2018-03-19 14:25:23 +00:00
|
|
|
fp->frags[curr_idx].mb = NULL;
|
2014-05-28 17:32:41 +00:00
|
|
|
m = fp->frags[IP_FIRST_FRAG_IDX].mb;
|
2018-03-19 14:25:23 +00:00
|
|
|
fp->frags[IP_FIRST_FRAG_IDX].mb = NULL;
|
2014-05-28 17:32:41 +00:00
|
|
|
|
2017-11-10 08:24:23 +00:00
|
|
|
/* update ipv4 header for the reassembled packet */
|
2019-05-21 16:13:10 +00:00
|
|
|
ip_hdr = rte_pktmbuf_mtod_offset(m, struct rte_ipv4_hdr *, m->l2_len);
|
2014-05-28 17:32:41 +00:00
|
|
|
|
|
|
|
ip_hdr->total_length = rte_cpu_to_be_16((uint16_t)(fp->total_size +
|
2014-09-09 14:40:56 +00:00
|
|
|
m->l3_len));
|
2014-05-28 17:32:41 +00:00
|
|
|
ip_hdr->fragment_offset = (uint16_t)(ip_hdr->fragment_offset &
|
2019-05-21 16:13:11 +00:00
|
|
|
rte_cpu_to_be_16(RTE_IPV4_HDR_DF_FLAG));
|
2014-05-28 17:32:41 +00:00
|
|
|
ip_hdr->hdr_checksum = 0;
|
|
|
|
|
2015-05-11 14:10:25 +00:00
|
|
|
return m;
|
2014-05-28 17:32:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Process new mbuf with fragment of IPV4 packet.
|
|
|
|
* Incoming mbuf should have it's l2_len/l3_len fields setuped correclty.
|
|
|
|
* @param tbl
|
|
|
|
* Table where to lookup/add the fragmented packet.
|
|
|
|
* @param mb
|
|
|
|
* Incoming mbuf with IPV4 fragment.
|
|
|
|
* @param tms
|
|
|
|
* Fragment arrival timestamp.
|
|
|
|
* @param ip_hdr
|
|
|
|
* Pointer to the IPV4 header inside the fragment.
|
|
|
|
* @return
|
2017-11-10 08:24:23 +00:00
|
|
|
* Pointer to mbuf for reassembled packet, or NULL if:
|
2017-06-07 05:05:06 +00:00
|
|
|
* - an error occurred.
|
2014-05-28 17:32:41 +00:00
|
|
|
* - not all fragments of the packet are collected yet.
|
|
|
|
*/
|
|
|
|
struct rte_mbuf *
|
|
|
|
rte_ipv4_frag_reassemble_packet(struct rte_ip_frag_tbl *tbl,
|
2018-11-05 12:18:57 +00:00
|
|
|
struct rte_ip_frag_death_row *dr, struct rte_mbuf *mb, uint64_t tms,
|
2019-05-21 16:13:10 +00:00
|
|
|
struct rte_ipv4_hdr *ip_hdr)
|
2014-05-28 17:32:41 +00:00
|
|
|
{
|
2014-06-18 14:50:28 +00:00
|
|
|
struct ip_frag_pkt *fp;
|
2014-05-28 17:32:41 +00:00
|
|
|
struct ip_frag_key key;
|
2015-06-22 18:34:19 +00:00
|
|
|
const unaligned_uint64_t *psd;
|
2014-05-28 17:32:41 +00:00
|
|
|
uint16_t flag_offset, ip_ofs, ip_flag;
|
2018-11-05 12:18:57 +00:00
|
|
|
int32_t ip_len;
|
ip_frag: remove padding length of fragment
In some situations, we would get several ip fragments, which total
data length is less than min_ip_len(64) and padding with zeros.
We simulated intermediate fragments by modifying the MTU.
To illustrate the problem, we simplify the packet format and
ignore the impact of the packet header.In namespace2,
a packet whose data length is 1520 is sent.
When the packet passes tap2, the packet is divided into two
fragments: fragment A and B, similar to (1520 = 1510 + 10).
When the packet passes tap3, the larger fragment packet A is
divided into two fragments A1 and A2, similar to (1510 = 1500 + 10).
Finally, the bond interface receives three fragments:
A1, A2, and B (1520 = 1500 + 10 + 10).
One fragmented packet A2 is smaller than the minimum Ethernet
frame length, so it needs to be padded.
|---------------------------------------------------|
| HOST |
| |--------------| |----------------------------| |
| | ns2 | | |--------------| | |
| | |--------| | | |--------| |--------| | |
| | | tap1 | | | | tap2 | ns1| tap3 | | |
| | |mtu=1510| | | |mtu=1510| |mtu=1500| | |
| |--|1.1.1.1 |--| |--|1.1.1.2 |----|2.1.1.1 |--| |
| |--------| |--------| |--------| |
| | | | |
| |-----------------| | |
| | |
| |--------| |
| | bond | |
|--------------------------------------|mtu=1500|---|
|--------|
When processing the preceding packets above,
DPDK would aggregate fragmented packets A2 and B.
And error packets are generated, which padding(zero)
is displayed in the middle of the packet.
A2 + B:
0000 fa 16 3e 9f fb 82 fa 47 b2 57 dc 20 08 00 45 00
0010 00 33 b4 66 00 ba 3f 01 c1 a5 01 01 01 01 02 01
0020 01 02 c0 c1 c2 c3 c4 c5 c6 c7 00 00 00 00 00 00
0030 00 00 00 00 00 00 00 00 00 00 00 00 c8 c9 ca cb
0040 cc cd ce cf d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 da db
0050 dc dd de df e0 e1 e2 e3 e4 e5 e6
So, we would calculate the length of padding, and remove
the padding in pkt_len and data_len before aggregation.
And also we have the fix for both ipv4 and ipv6.
Fixes: 7f0983ee331c ("ip_frag: check fragment length of incoming packet")
Cc: stable@dpdk.org
Signed-off-by: Yicai Lu <luyicai@huawei.com>
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
2020-12-16 13:36:30 +00:00
|
|
|
int32_t trim;
|
2014-05-28 17:32:41 +00:00
|
|
|
|
|
|
|
flag_offset = rte_be_to_cpu_16(ip_hdr->fragment_offset);
|
2019-05-21 16:13:11 +00:00
|
|
|
ip_ofs = (uint16_t)(flag_offset & RTE_IPV4_HDR_OFFSET_MASK);
|
|
|
|
ip_flag = (uint16_t)(flag_offset & RTE_IPV4_HDR_MF_FLAG);
|
2014-05-28 17:32:41 +00:00
|
|
|
|
2015-06-22 18:34:19 +00:00
|
|
|
psd = (unaligned_uint64_t *)&ip_hdr->src_addr;
|
2014-05-28 17:32:46 +00:00
|
|
|
/* use first 8 bytes only */
|
|
|
|
key.src_dst[0] = psd[0];
|
2014-05-28 17:32:41 +00:00
|
|
|
key.id = ip_hdr->packet_id;
|
2014-05-28 17:32:46 +00:00
|
|
|
key.key_len = IPV4_KEYLEN;
|
2014-05-28 17:32:41 +00:00
|
|
|
|
2019-05-21 16:13:11 +00:00
|
|
|
ip_ofs *= RTE_IPV4_HDR_OFFSET_UNITS;
|
2018-11-05 12:18:57 +00:00
|
|
|
ip_len = rte_be_to_cpu_16(ip_hdr->total_length) - mb->l3_len;
|
ip_frag: remove padding length of fragment
In some situations, we would get several ip fragments, which total
data length is less than min_ip_len(64) and padding with zeros.
We simulated intermediate fragments by modifying the MTU.
To illustrate the problem, we simplify the packet format and
ignore the impact of the packet header.In namespace2,
a packet whose data length is 1520 is sent.
When the packet passes tap2, the packet is divided into two
fragments: fragment A and B, similar to (1520 = 1510 + 10).
When the packet passes tap3, the larger fragment packet A is
divided into two fragments A1 and A2, similar to (1510 = 1500 + 10).
Finally, the bond interface receives three fragments:
A1, A2, and B (1520 = 1500 + 10 + 10).
One fragmented packet A2 is smaller than the minimum Ethernet
frame length, so it needs to be padded.
|---------------------------------------------------|
| HOST |
| |--------------| |----------------------------| |
| | ns2 | | |--------------| | |
| | |--------| | | |--------| |--------| | |
| | | tap1 | | | | tap2 | ns1| tap3 | | |
| | |mtu=1510| | | |mtu=1510| |mtu=1500| | |
| |--|1.1.1.1 |--| |--|1.1.1.2 |----|2.1.1.1 |--| |
| |--------| |--------| |--------| |
| | | | |
| |-----------------| | |
| | |
| |--------| |
| | bond | |
|--------------------------------------|mtu=1500|---|
|--------|
When processing the preceding packets above,
DPDK would aggregate fragmented packets A2 and B.
And error packets are generated, which padding(zero)
is displayed in the middle of the packet.
A2 + B:
0000 fa 16 3e 9f fb 82 fa 47 b2 57 dc 20 08 00 45 00
0010 00 33 b4 66 00 ba 3f 01 c1 a5 01 01 01 01 02 01
0020 01 02 c0 c1 c2 c3 c4 c5 c6 c7 00 00 00 00 00 00
0030 00 00 00 00 00 00 00 00 00 00 00 00 c8 c9 ca cb
0040 cc cd ce cf d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 da db
0050 dc dd de df e0 e1 e2 e3 e4 e5 e6
So, we would calculate the length of padding, and remove
the padding in pkt_len and data_len before aggregation.
And also we have the fix for both ipv4 and ipv6.
Fixes: 7f0983ee331c ("ip_frag: check fragment length of incoming packet")
Cc: stable@dpdk.org
Signed-off-by: Yicai Lu <luyicai@huawei.com>
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
2020-12-16 13:36:30 +00:00
|
|
|
trim = mb->pkt_len - (ip_len + mb->l3_len + mb->l2_len);
|
2014-05-28 17:32:41 +00:00
|
|
|
|
|
|
|
IP_FRAG_LOG(DEBUG, "%s:%d:\n"
|
ip_frag: remove padding length of fragment
In some situations, we would get several ip fragments, which total
data length is less than min_ip_len(64) and padding with zeros.
We simulated intermediate fragments by modifying the MTU.
To illustrate the problem, we simplify the packet format and
ignore the impact of the packet header.In namespace2,
a packet whose data length is 1520 is sent.
When the packet passes tap2, the packet is divided into two
fragments: fragment A and B, similar to (1520 = 1510 + 10).
When the packet passes tap3, the larger fragment packet A is
divided into two fragments A1 and A2, similar to (1510 = 1500 + 10).
Finally, the bond interface receives three fragments:
A1, A2, and B (1520 = 1500 + 10 + 10).
One fragmented packet A2 is smaller than the minimum Ethernet
frame length, so it needs to be padded.
|---------------------------------------------------|
| HOST |
| |--------------| |----------------------------| |
| | ns2 | | |--------------| | |
| | |--------| | | |--------| |--------| | |
| | | tap1 | | | | tap2 | ns1| tap3 | | |
| | |mtu=1510| | | |mtu=1510| |mtu=1500| | |
| |--|1.1.1.1 |--| |--|1.1.1.2 |----|2.1.1.1 |--| |
| |--------| |--------| |--------| |
| | | | |
| |-----------------| | |
| | |
| |--------| |
| | bond | |
|--------------------------------------|mtu=1500|---|
|--------|
When processing the preceding packets above,
DPDK would aggregate fragmented packets A2 and B.
And error packets are generated, which padding(zero)
is displayed in the middle of the packet.
A2 + B:
0000 fa 16 3e 9f fb 82 fa 47 b2 57 dc 20 08 00 45 00
0010 00 33 b4 66 00 ba 3f 01 c1 a5 01 01 01 01 02 01
0020 01 02 c0 c1 c2 c3 c4 c5 c6 c7 00 00 00 00 00 00
0030 00 00 00 00 00 00 00 00 00 00 00 00 c8 c9 ca cb
0040 cc cd ce cf d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 da db
0050 dc dd de df e0 e1 e2 e3 e4 e5 e6
So, we would calculate the length of padding, and remove
the padding in pkt_len and data_len before aggregation.
And also we have the fix for both ipv4 and ipv6.
Fixes: 7f0983ee331c ("ip_frag: check fragment length of incoming packet")
Cc: stable@dpdk.org
Signed-off-by: Yicai Lu <luyicai@huawei.com>
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
2020-12-16 13:36:30 +00:00
|
|
|
"mbuf: %p, tms: %" PRIu64 ", key: <%" PRIx64 ", %#x>"
|
|
|
|
"ofs: %u, len: %d, padding: %d, flags: %#x\n"
|
2014-05-28 17:32:41 +00:00
|
|
|
"tbl: %p, max_cycles: %" PRIu64 ", entry_mask: %#x, "
|
|
|
|
"max_entries: %u, use_entries: %u\n\n",
|
|
|
|
__func__, __LINE__,
|
ip_frag: remove padding length of fragment
In some situations, we would get several ip fragments, which total
data length is less than min_ip_len(64) and padding with zeros.
We simulated intermediate fragments by modifying the MTU.
To illustrate the problem, we simplify the packet format and
ignore the impact of the packet header.In namespace2,
a packet whose data length is 1520 is sent.
When the packet passes tap2, the packet is divided into two
fragments: fragment A and B, similar to (1520 = 1510 + 10).
When the packet passes tap3, the larger fragment packet A is
divided into two fragments A1 and A2, similar to (1510 = 1500 + 10).
Finally, the bond interface receives three fragments:
A1, A2, and B (1520 = 1500 + 10 + 10).
One fragmented packet A2 is smaller than the minimum Ethernet
frame length, so it needs to be padded.
|---------------------------------------------------|
| HOST |
| |--------------| |----------------------------| |
| | ns2 | | |--------------| | |
| | |--------| | | |--------| |--------| | |
| | | tap1 | | | | tap2 | ns1| tap3 | | |
| | |mtu=1510| | | |mtu=1510| |mtu=1500| | |
| |--|1.1.1.1 |--| |--|1.1.1.2 |----|2.1.1.1 |--| |
| |--------| |--------| |--------| |
| | | | |
| |-----------------| | |
| | |
| |--------| |
| | bond | |
|--------------------------------------|mtu=1500|---|
|--------|
When processing the preceding packets above,
DPDK would aggregate fragmented packets A2 and B.
And error packets are generated, which padding(zero)
is displayed in the middle of the packet.
A2 + B:
0000 fa 16 3e 9f fb 82 fa 47 b2 57 dc 20 08 00 45 00
0010 00 33 b4 66 00 ba 3f 01 c1 a5 01 01 01 01 02 01
0020 01 02 c0 c1 c2 c3 c4 c5 c6 c7 00 00 00 00 00 00
0030 00 00 00 00 00 00 00 00 00 00 00 00 c8 c9 ca cb
0040 cc cd ce cf d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 da db
0050 dc dd de df e0 e1 e2 e3 e4 e5 e6
So, we would calculate the length of padding, and remove
the padding in pkt_len and data_len before aggregation.
And also we have the fix for both ipv4 and ipv6.
Fixes: 7f0983ee331c ("ip_frag: check fragment length of incoming packet")
Cc: stable@dpdk.org
Signed-off-by: Yicai Lu <luyicai@huawei.com>
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
2020-12-16 13:36:30 +00:00
|
|
|
mb, tms, key.src_dst[0], key.id, ip_ofs, ip_len, trim, ip_flag,
|
2014-05-28 17:32:41 +00:00
|
|
|
tbl, tbl->max_cycles, tbl->entry_mask, tbl->max_entries,
|
|
|
|
tbl->use_entries);
|
|
|
|
|
2018-11-05 12:18:57 +00:00
|
|
|
/* check that fragment length is greater then zero. */
|
|
|
|
if (ip_len <= 0) {
|
|
|
|
IP_FRAG_MBUF2DR(dr, mb);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
ip_frag: remove padding length of fragment
In some situations, we would get several ip fragments, which total
data length is less than min_ip_len(64) and padding with zeros.
We simulated intermediate fragments by modifying the MTU.
To illustrate the problem, we simplify the packet format and
ignore the impact of the packet header.In namespace2,
a packet whose data length is 1520 is sent.
When the packet passes tap2, the packet is divided into two
fragments: fragment A and B, similar to (1520 = 1510 + 10).
When the packet passes tap3, the larger fragment packet A is
divided into two fragments A1 and A2, similar to (1510 = 1500 + 10).
Finally, the bond interface receives three fragments:
A1, A2, and B (1520 = 1500 + 10 + 10).
One fragmented packet A2 is smaller than the minimum Ethernet
frame length, so it needs to be padded.
|---------------------------------------------------|
| HOST |
| |--------------| |----------------------------| |
| | ns2 | | |--------------| | |
| | |--------| | | |--------| |--------| | |
| | | tap1 | | | | tap2 | ns1| tap3 | | |
| | |mtu=1510| | | |mtu=1510| |mtu=1500| | |
| |--|1.1.1.1 |--| |--|1.1.1.2 |----|2.1.1.1 |--| |
| |--------| |--------| |--------| |
| | | | |
| |-----------------| | |
| | |
| |--------| |
| | bond | |
|--------------------------------------|mtu=1500|---|
|--------|
When processing the preceding packets above,
DPDK would aggregate fragmented packets A2 and B.
And error packets are generated, which padding(zero)
is displayed in the middle of the packet.
A2 + B:
0000 fa 16 3e 9f fb 82 fa 47 b2 57 dc 20 08 00 45 00
0010 00 33 b4 66 00 ba 3f 01 c1 a5 01 01 01 01 02 01
0020 01 02 c0 c1 c2 c3 c4 c5 c6 c7 00 00 00 00 00 00
0030 00 00 00 00 00 00 00 00 00 00 00 00 c8 c9 ca cb
0040 cc cd ce cf d0 d1 d2 d3 d4 d5 d6 d7 d8 d9 da db
0050 dc dd de df e0 e1 e2 e3 e4 e5 e6
So, we would calculate the length of padding, and remove
the padding in pkt_len and data_len before aggregation.
And also we have the fix for both ipv4 and ipv6.
Fixes: 7f0983ee331c ("ip_frag: check fragment length of incoming packet")
Cc: stable@dpdk.org
Signed-off-by: Yicai Lu <luyicai@huawei.com>
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
2020-12-16 13:36:30 +00:00
|
|
|
if (unlikely(trim > 0))
|
|
|
|
rte_pktmbuf_trim(mb, trim);
|
|
|
|
|
2014-05-28 17:32:41 +00:00
|
|
|
/* try to find/add entry into the fragment's table. */
|
|
|
|
if ((fp = ip_frag_find(tbl, dr, &key, tms)) == NULL) {
|
|
|
|
IP_FRAG_MBUF2DR(dr, mb);
|
2015-05-11 14:10:25 +00:00
|
|
|
return NULL;
|
2014-05-28 17:32:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
IP_FRAG_LOG(DEBUG, "%s:%d:\n"
|
|
|
|
"tbl: %p, max_entries: %u, use_entries: %u\n"
|
|
|
|
"ipv4_frag_pkt: %p, key: <%" PRIx64 ", %#x>, start: %" PRIu64
|
|
|
|
", total_size: %u, frag_size: %u, last_idx: %u\n\n",
|
|
|
|
__func__, __LINE__,
|
|
|
|
tbl, tbl->max_entries, tbl->use_entries,
|
2014-06-18 14:50:29 +00:00
|
|
|
fp, fp->key.src_dst[0], fp->key.id, fp->start,
|
2014-05-28 17:32:41 +00:00
|
|
|
fp->total_size, fp->frag_size, fp->last_idx);
|
|
|
|
|
|
|
|
|
|
|
|
/* process the fragmented packet. */
|
|
|
|
mb = ip_frag_process(fp, dr, mb, ip_ofs, ip_len, ip_flag);
|
|
|
|
ip_frag_inuse(tbl, fp);
|
|
|
|
|
|
|
|
IP_FRAG_LOG(DEBUG, "%s:%d:\n"
|
|
|
|
"mbuf: %p\n"
|
|
|
|
"tbl: %p, max_entries: %u, use_entries: %u\n"
|
|
|
|
"ipv4_frag_pkt: %p, key: <%" PRIx64 ", %#x>, start: %" PRIu64
|
|
|
|
", total_size: %u, frag_size: %u, last_idx: %u\n\n",
|
|
|
|
__func__, __LINE__, mb,
|
|
|
|
tbl, tbl->max_entries, tbl->use_entries,
|
2014-06-18 14:50:29 +00:00
|
|
|
fp, fp->key.src_dst[0], fp->key.id, fp->start,
|
2014-05-28 17:32:41 +00:00
|
|
|
fp->total_size, fp->frag_size, fp->last_idx);
|
|
|
|
|
2015-05-11 14:10:25 +00:00
|
|
|
return mb;
|
2014-05-28 17:32:41 +00:00
|
|
|
}
|