cksum.c 3.82 KB
Newer Older
bellard's avatar
bellard committed
1 2 3 4 5 6 7 8 9 10 11 12
/*
 * Copyright (c) 1988, 1992, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
13
 * 3. Neither the name of the University nor the names of its contributors
bellard's avatar
bellard committed
14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)in_cksum.c	8.1 (Berkeley) 6/10/93
 * in_cksum.c,v 1.2 1994/08/02 07:48:16 davidg Exp
 */

#include <slirp.h>

/*
 * Checksum routine for Internet Protocol family headers (Portable Version).
 *
 * This routine is very heavily used in the network
 * code and should be modified for each CPU to be as fast as possible.
40
 *
bellard's avatar
bellard committed
41 42 43 44
 * XXX Since we will never span more than 1 mbuf, we can optimise this
 */

#define ADDCARRY(x)  (x > 65535 ? x -= 65535 : x)
45 46
#define REDUCE {l_util.l = sum; sum = l_util.s[0] + l_util.s[1];        \
        (void)ADDCARRY(sum);}
bellard's avatar
bellard committed
47 48 49

int cksum(struct mbuf *m, int len)
{
50
	register uint16_t *w;
bellard's avatar
bellard committed
51 52 53 54 55
	register int sum = 0;
	register int mlen = 0;
	int byte_swapped = 0;

	union {
56 57
		uint8_t  c[2];
		uint16_t s;
bellard's avatar
bellard committed
58 59
	} s_util;
	union {
60 61
		uint16_t s[2];
		uint32_t l;
bellard's avatar
bellard committed
62
	} l_util;
63

bellard's avatar
bellard committed
64 65
	if (m->m_len == 0)
	   goto cont;
66
	w = mtod(m, uint16_t *);
67

bellard's avatar
bellard committed
68
	mlen = m->m_len;
69

bellard's avatar
bellard committed
70 71
	if (len < mlen)
	   mlen = len;
72
#ifdef DEBUG
bellard's avatar
bellard committed
73
	len -= mlen;
74
#endif
bellard's avatar
bellard committed
75 76 77
	/*
	 * Force to even boundary.
	 */
78
	if ((1 & (uintptr_t)w) && (mlen > 0)) {
bellard's avatar
bellard committed
79 80
		REDUCE;
		sum <<= 8;
81 82
		s_util.c[0] = *(uint8_t *)w;
		w = (uint16_t *)((int8_t *)w + 1);
bellard's avatar
bellard committed
83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108
		mlen--;
		byte_swapped = 1;
	}
	/*
	 * Unroll the loop to make overhead from
	 * branches &c small.
	 */
	while ((mlen -= 32) >= 0) {
		sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3];
		sum += w[4]; sum += w[5]; sum += w[6]; sum += w[7];
		sum += w[8]; sum += w[9]; sum += w[10]; sum += w[11];
		sum += w[12]; sum += w[13]; sum += w[14]; sum += w[15];
		w += 16;
	}
	mlen += 32;
	while ((mlen -= 8) >= 0) {
		sum += w[0]; sum += w[1]; sum += w[2]; sum += w[3];
		w += 4;
	}
	mlen += 8;
	if (mlen == 0 && byte_swapped == 0)
	   goto cont;
	REDUCE;
	while ((mlen -= 2) >= 0) {
		sum += *w++;
	}
109

bellard's avatar
bellard committed
110 111 112 113
	if (byte_swapped) {
		REDUCE;
		sum <<= 8;
		if (mlen == -1) {
114
			s_util.c[1] = *(uint8_t *)w;
bellard's avatar
bellard committed
115 116 117
			sum += s_util.s;
			mlen = 0;
		} else
118

bellard's avatar
bellard committed
119 120
		   mlen = -1;
	} else if (mlen == -1)
121
	   s_util.c[0] = *(uint8_t *)w;
122

bellard's avatar
bellard committed
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
cont:
#ifdef DEBUG
	if (len) {
		DEBUG_ERROR((dfd, "cksum: out of data\n"));
		DEBUG_ERROR((dfd, " len = %d\n", len));
	}
#endif
	if (mlen == -1) {
		/* The last mbuf has odd # of bytes. Follow the
		 standard (the odd byte may be shifted left by 8 bits
			   or not as determined by endian-ness of the machine) */
		s_util.c[1] = 0;
		sum += s_util.s;
	}
	REDUCE;
	return (~sum & 0xffff);
}