2009-10-22 18:49:03 +02:00
|
|
|
/*
|
|
|
|
* IP checksumming functions.
|
|
|
|
* (c) 2008 Gerd Hoffmann <kraxel@redhat.com>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
2012-01-27 17:40:43 +01:00
|
|
|
* the Free Software Foundation; under version 2 or later of the License.
|
2009-10-22 18:49:03 +02:00
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2016-01-29 18:50:00 +01:00
|
|
|
#include "qemu/osdep.h"
|
2009-10-22 18:49:03 +02:00
|
|
|
#include "net/checksum.h"
|
2016-05-30 19:25:46 +02:00
|
|
|
#include "net/eth.h"
|
2009-10-22 18:49:03 +02:00
|
|
|
|
2013-03-09 10:21:02 +01:00
|
|
|
uint32_t net_checksum_add_cont(int len, uint8_t *buf, int seq)
|
2009-10-22 18:49:03 +02:00
|
|
|
{
|
2017-01-06 09:08:53 +01:00
|
|
|
uint32_t sum1 = 0, sum2 = 0;
|
2009-10-22 18:49:03 +02:00
|
|
|
int i;
|
|
|
|
|
2017-01-06 09:08:53 +01:00
|
|
|
for (i = 0; i < len - 1; i += 2) {
|
|
|
|
sum1 += (uint32_t)buf[i];
|
|
|
|
sum2 += (uint32_t)buf[i + 1];
|
|
|
|
}
|
|
|
|
if (i < len) {
|
|
|
|
sum1 += (uint32_t)buf[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
if (seq & 1) {
|
|
|
|
return sum1 + (sum2 << 8);
|
|
|
|
} else {
|
|
|
|
return sum2 + (sum1 << 8);
|
2009-10-22 18:49:03 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
uint16_t net_checksum_finish(uint32_t sum)
|
|
|
|
{
|
|
|
|
while (sum>>16)
|
2018-12-13 23:37:37 +01:00
|
|
|
sum = (sum & 0xFFFF)+(sum >> 16);
|
2009-10-22 18:49:03 +02:00
|
|
|
return ~sum;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint16_t net_checksum_tcpudp(uint16_t length, uint16_t proto,
|
|
|
|
uint8_t *addrs, uint8_t *buf)
|
|
|
|
{
|
|
|
|
uint32_t sum = 0;
|
|
|
|
|
|
|
|
sum += net_checksum_add(length, buf); // payload
|
|
|
|
sum += net_checksum_add(8, addrs); // src + dst address
|
|
|
|
sum += proto + length; // protocol & length
|
|
|
|
return net_checksum_finish(sum);
|
|
|
|
}
|
|
|
|
|
2020-12-11 10:35:12 +01:00
|
|
|
void net_checksum_calculate(uint8_t *data, int length, int csum_flag)
|
2009-10-22 18:49:03 +02:00
|
|
|
{
|
2016-05-30 19:25:48 +02:00
|
|
|
int mac_hdr_len, ip_len;
|
2016-05-30 19:25:46 +02:00
|
|
|
struct ip_header *ip;
|
2020-12-11 10:35:11 +01:00
|
|
|
uint16_t csum;
|
2016-05-30 19:25:46 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Note: We cannot assume "data" is aligned, so the all code uses
|
|
|
|
* some macros that take care of possible unaligned access for
|
|
|
|
* struct members (just in case).
|
|
|
|
*/
|
2009-10-22 18:49:03 +02:00
|
|
|
|
2016-05-30 19:25:48 +02:00
|
|
|
/* Ensure we have at least an Eth header */
|
|
|
|
if (length < sizeof(struct eth_header)) {
|
2016-03-02 12:59:58 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2023-07-14 13:33:49 +02:00
|
|
|
/* Handle the optional VLAN headers */
|
2016-05-30 19:25:48 +02:00
|
|
|
switch (lduw_be_p(&PKT_GET_ETH_HDR(data)->h_proto)) {
|
|
|
|
case ETH_P_VLAN:
|
|
|
|
mac_hdr_len = sizeof(struct eth_header) +
|
|
|
|
sizeof(struct vlan_header);
|
|
|
|
break;
|
|
|
|
case ETH_P_DVLAN:
|
|
|
|
if (lduw_be_p(&PKT_GET_VLAN_HDR(data)->h_proto) == ETH_P_VLAN) {
|
|
|
|
mac_hdr_len = sizeof(struct eth_header) +
|
|
|
|
2 * sizeof(struct vlan_header);
|
|
|
|
} else {
|
|
|
|
mac_hdr_len = sizeof(struct eth_header) +
|
|
|
|
sizeof(struct vlan_header);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
mac_hdr_len = sizeof(struct eth_header);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
length -= mac_hdr_len;
|
|
|
|
|
2023-07-14 13:33:49 +02:00
|
|
|
/* Now check we have an IP header (with an optional VLAN header) */
|
2016-05-30 19:25:48 +02:00
|
|
|
if (length < sizeof(struct ip_header)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
ip = (struct ip_header *)(data + mac_hdr_len);
|
2016-05-30 19:25:46 +02:00
|
|
|
|
|
|
|
if (IP_HEADER_VERSION(ip) != IP_HEADER_VERSION_4) {
|
|
|
|
return; /* not IPv4 */
|
2009-10-22 18:49:03 +02:00
|
|
|
}
|
|
|
|
|
2020-12-11 10:35:11 +01:00
|
|
|
/* Calculate IP checksum */
|
2020-12-11 10:35:12 +01:00
|
|
|
if (csum_flag & CSUM_IP) {
|
|
|
|
stw_he_p(&ip->ip_sum, 0);
|
|
|
|
csum = net_raw_checksum((uint8_t *)ip, IP_HDR_GET_LEN(ip));
|
|
|
|
stw_be_p(&ip->ip_sum, csum);
|
|
|
|
}
|
2020-12-11 10:35:11 +01:00
|
|
|
|
2020-12-11 10:35:10 +01:00
|
|
|
if (IP4_IS_FRAGMENT(ip)) {
|
|
|
|
return; /* a fragmented IP packet */
|
|
|
|
}
|
|
|
|
|
2016-05-30 19:25:46 +02:00
|
|
|
ip_len = lduw_be_p(&ip->ip_len);
|
|
|
|
|
|
|
|
/* Last, check that we have enough data for the all IP frame */
|
|
|
|
if (length < ip_len) {
|
2016-03-02 12:59:58 +01:00
|
|
|
return;
|
|
|
|
}
|
2009-10-22 18:49:03 +02:00
|
|
|
|
2016-05-30 19:25:46 +02:00
|
|
|
ip_len -= IP_HDR_GET_LEN(ip);
|
|
|
|
|
|
|
|
switch (ip->ip_p) {
|
|
|
|
case IP_PROTO_TCP:
|
|
|
|
{
|
2020-12-11 10:35:12 +01:00
|
|
|
if (!(csum_flag & CSUM_TCP)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2016-05-30 19:25:46 +02:00
|
|
|
tcp_header *tcp = (tcp_header *)(ip + 1);
|
|
|
|
|
|
|
|
if (ip_len < sizeof(tcp_header)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Set csum to 0 */
|
|
|
|
stw_he_p(&tcp->th_sum, 0);
|
|
|
|
|
|
|
|
csum = net_checksum_tcpudp(ip_len, ip->ip_p,
|
|
|
|
(uint8_t *)&ip->ip_src,
|
|
|
|
(uint8_t *)tcp);
|
|
|
|
|
|
|
|
/* Store computed csum */
|
|
|
|
stw_be_p(&tcp->th_sum, csum);
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case IP_PROTO_UDP:
|
|
|
|
{
|
2020-12-11 10:35:12 +01:00
|
|
|
if (!(csum_flag & CSUM_UDP)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2016-05-30 19:25:46 +02:00
|
|
|
udp_header *udp = (udp_header *)(ip + 1);
|
|
|
|
|
|
|
|
if (ip_len < sizeof(udp_header)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Set csum to 0 */
|
|
|
|
stw_he_p(&udp->uh_sum, 0);
|
|
|
|
|
|
|
|
csum = net_checksum_tcpudp(ip_len, ip->ip_p,
|
|
|
|
(uint8_t *)&ip->ip_src,
|
|
|
|
(uint8_t *)udp);
|
|
|
|
|
|
|
|
/* Store computed csum */
|
|
|
|
stw_be_p(&udp->uh_sum, csum);
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
/* Can't handle any other protocol */
|
|
|
|
break;
|
|
|
|
}
|
2009-10-22 18:49:03 +02:00
|
|
|
}
|
2013-03-09 10:21:03 +01:00
|
|
|
|
|
|
|
uint32_t
|
|
|
|
net_checksum_add_iov(const struct iovec *iov, const unsigned int iov_cnt,
|
2016-06-01 10:23:41 +02:00
|
|
|
uint32_t iov_off, uint32_t size, uint32_t csum_offset)
|
2013-03-09 10:21:03 +01:00
|
|
|
{
|
2021-07-12 20:43:58 +02:00
|
|
|
size_t iovec_off;
|
2013-03-09 10:21:03 +01:00
|
|
|
unsigned int i;
|
|
|
|
uint32_t res = 0;
|
|
|
|
|
|
|
|
iovec_off = 0;
|
|
|
|
for (i = 0; i < iov_cnt && size; i++) {
|
|
|
|
if (iov_off < (iovec_off + iov[i].iov_len)) {
|
|
|
|
size_t len = MIN((iovec_off + iov[i].iov_len) - iov_off , size);
|
|
|
|
void *chunk_buf = iov[i].iov_base + (iov_off - iovec_off);
|
|
|
|
|
2016-06-01 10:23:41 +02:00
|
|
|
res += net_checksum_add_cont(len, chunk_buf, csum_offset);
|
|
|
|
csum_offset += len;
|
2013-03-09 10:21:03 +01:00
|
|
|
|
|
|
|
iov_off += len;
|
|
|
|
size -= len;
|
|
|
|
}
|
|
|
|
iovec_off += iov[i].iov_len;
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|