11422e32dSPaolo Bonzini /*
21422e32dSPaolo Bonzini * IP checksumming functions.
31422e32dSPaolo Bonzini * (c) 2008 Gerd Hoffmann <kraxel@redhat.com>
41422e32dSPaolo Bonzini *
51422e32dSPaolo Bonzini * This program is free software; you can redistribute it and/or modify
61422e32dSPaolo Bonzini * it under the terms of the GNU General Public License as published by
71422e32dSPaolo Bonzini * the Free Software Foundation; under version 2 of the License.
81422e32dSPaolo Bonzini *
91422e32dSPaolo Bonzini * This program is distributed in the hope that it will be useful,
101422e32dSPaolo Bonzini * but WITHOUT ANY WARRANTY; without even the implied warranty of
111422e32dSPaolo Bonzini * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
121422e32dSPaolo Bonzini * GNU General Public License for more details.
131422e32dSPaolo Bonzini *
141422e32dSPaolo Bonzini * You should have received a copy of the GNU General Public License
151422e32dSPaolo Bonzini * along with this program; if not, see <http://www.gnu.org/licenses/>.
161422e32dSPaolo Bonzini */
171422e32dSPaolo Bonzini
181422e32dSPaolo Bonzini #ifndef QEMU_NET_CHECKSUM_H
191422e32dSPaolo Bonzini #define QEMU_NET_CHECKSUM_H
201422e32dSPaolo Bonzini
210478d1ddSDmitry Fleytman #include "qemu/bswap.h"
2226247179SMichael Tokarev struct iovec;
231422e32dSPaolo Bonzini
24f5746335SBin Meng #define CSUM_IP 0x01
25f5746335SBin Meng #define CSUM_TCP 0x02
26f5746335SBin Meng #define CSUM_UDP 0x04
27f5746335SBin Meng #define CSUM_ALL (CSUM_IP | CSUM_TCP | CSUM_UDP)
28f5746335SBin Meng
295acf5ea4SDmitry Fleytman uint32_t net_checksum_add_cont(int len, uint8_t *buf, int seq);
301422e32dSPaolo Bonzini uint16_t net_checksum_finish(uint32_t sum);
311422e32dSPaolo Bonzini uint16_t net_checksum_tcpudp(uint16_t length, uint16_t proto,
321422e32dSPaolo Bonzini uint8_t *addrs, uint8_t *buf);
33*5930e5ccSAkihiko Odaki void net_checksum_calculate(void *data, int length, int csum_flag);
341422e32dSPaolo Bonzini
355acf5ea4SDmitry Fleytman static inline uint32_t
net_checksum_add(int len,uint8_t * buf)365acf5ea4SDmitry Fleytman net_checksum_add(int len, uint8_t *buf)
375acf5ea4SDmitry Fleytman {
385acf5ea4SDmitry Fleytman return net_checksum_add_cont(len, buf, 0);
395acf5ea4SDmitry Fleytman }
405acf5ea4SDmitry Fleytman
415acf5ea4SDmitry Fleytman static inline uint16_t
net_checksum_finish_nozero(uint32_t sum)420dacea92SEd Swierk net_checksum_finish_nozero(uint32_t sum)
430dacea92SEd Swierk {
440dacea92SEd Swierk return net_checksum_finish(sum) ?: 0xFFFF;
450dacea92SEd Swierk }
460dacea92SEd Swierk
470dacea92SEd Swierk static inline uint16_t
net_raw_checksum(uint8_t * data,int length)485acf5ea4SDmitry Fleytman net_raw_checksum(uint8_t *data, int length)
495acf5ea4SDmitry Fleytman {
505acf5ea4SDmitry Fleytman return net_checksum_finish(net_checksum_add(length, data));
515acf5ea4SDmitry Fleytman }
525acf5ea4SDmitry Fleytman
5384026301SDmitry Fleytman /**
5484026301SDmitry Fleytman * net_checksum_add_iov: scatter-gather vector checksumming
5584026301SDmitry Fleytman *
5684026301SDmitry Fleytman * @iov: input scatter-gather array
5784026301SDmitry Fleytman * @iov_cnt: number of array elements
5884026301SDmitry Fleytman * @iov_off: starting iov offset for checksumming
5984026301SDmitry Fleytman * @size: length of data to be checksummed
60eb700029SDmitry Fleytman * @csum_offset: offset of the checksum chunk
6184026301SDmitry Fleytman */
6284026301SDmitry Fleytman uint32_t net_checksum_add_iov(const struct iovec *iov,
6384026301SDmitry Fleytman const unsigned int iov_cnt,
64eb700029SDmitry Fleytman uint32_t iov_off, uint32_t size,
65eb700029SDmitry Fleytman uint32_t csum_offset);
6684026301SDmitry Fleytman
670478d1ddSDmitry Fleytman typedef struct toeplitz_key_st {
680478d1ddSDmitry Fleytman uint32_t leftmost_32_bits;
690478d1ddSDmitry Fleytman uint8_t *next_byte;
700478d1ddSDmitry Fleytman } net_toeplitz_key;
710478d1ddSDmitry Fleytman
720478d1ddSDmitry Fleytman static inline
net_toeplitz_key_init(net_toeplitz_key * key,uint8_t * key_bytes)730478d1ddSDmitry Fleytman void net_toeplitz_key_init(net_toeplitz_key *key, uint8_t *key_bytes)
740478d1ddSDmitry Fleytman {
750478d1ddSDmitry Fleytman key->leftmost_32_bits = be32_to_cpu(*(uint32_t *)key_bytes);
760478d1ddSDmitry Fleytman key->next_byte = key_bytes + sizeof(uint32_t);
770478d1ddSDmitry Fleytman }
780478d1ddSDmitry Fleytman
790478d1ddSDmitry Fleytman static inline
net_toeplitz_add(uint32_t * result,uint8_t * input,uint32_t len,net_toeplitz_key * key)800478d1ddSDmitry Fleytman void net_toeplitz_add(uint32_t *result,
810478d1ddSDmitry Fleytman uint8_t *input,
820478d1ddSDmitry Fleytman uint32_t len,
830478d1ddSDmitry Fleytman net_toeplitz_key *key)
840478d1ddSDmitry Fleytman {
850478d1ddSDmitry Fleytman register uint32_t accumulator = *result;
860478d1ddSDmitry Fleytman register uint32_t leftmost_32_bits = key->leftmost_32_bits;
870478d1ddSDmitry Fleytman register uint32_t byte;
880478d1ddSDmitry Fleytman
890478d1ddSDmitry Fleytman for (byte = 0; byte < len; byte++) {
900478d1ddSDmitry Fleytman register uint8_t input_byte = input[byte];
910478d1ddSDmitry Fleytman register uint8_t key_byte = *(key->next_byte++);
920478d1ddSDmitry Fleytman register uint8_t bit;
930478d1ddSDmitry Fleytman
940478d1ddSDmitry Fleytman for (bit = 0; bit < 8; bit++) {
950478d1ddSDmitry Fleytman if (input_byte & (1 << 7)) {
960478d1ddSDmitry Fleytman accumulator ^= leftmost_32_bits;
970478d1ddSDmitry Fleytman }
980478d1ddSDmitry Fleytman
990478d1ddSDmitry Fleytman leftmost_32_bits =
1000478d1ddSDmitry Fleytman (leftmost_32_bits << 1) | ((key_byte & (1 << 7)) >> 7);
1010478d1ddSDmitry Fleytman
1020478d1ddSDmitry Fleytman input_byte <<= 1;
1030478d1ddSDmitry Fleytman key_byte <<= 1;
1040478d1ddSDmitry Fleytman }
1050478d1ddSDmitry Fleytman }
1060478d1ddSDmitry Fleytman
1070478d1ddSDmitry Fleytman key->leftmost_32_bits = leftmost_32_bits;
1080478d1ddSDmitry Fleytman *result = accumulator;
1090478d1ddSDmitry Fleytman }
1100478d1ddSDmitry Fleytman
1111422e32dSPaolo Bonzini #endif /* QEMU_NET_CHECKSUM_H */
112