1 /* $NetBSD: in_cksum.c,v 1.6 2000/03/31 19:55:09 castor Exp $ */ 2 3 /* 4 * Copyright (c) 1992 Regents of the University of California. 5 * All rights reserved. 6 * 7 * This software was developed by the Computer Systems Engineering group 8 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 9 * contributed to Berkeley. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #include <sys/types.h> 38 #include <machine/endian.h> 39 40 #include "stand.h" 41 42 /* 43 * Checksum routine for Internet Protocol family headers. 44 * This routine is very heavily used in the network 45 * code and should be modified for each CPU to be as fast as possible. 46 * In particular, it should not be this one. 47 */ 48 int 49 in_cksum(void *p, int len) 50 { 51 int sum = 0, oddbyte = 0, v = 0; 52 u_char *cp = p; 53 54 /* we assume < 2^16 bytes being summed */ 55 while (len > 0) { 56 if (oddbyte) { 57 sum += v + *cp++; 58 len--; 59 } 60 if (((uintptr_t)cp & 1) == 0) { 61 while ((len -= 2) >= 0) { 62 sum += *(u_short *)cp; 63 cp += 2; 64 } 65 } else { 66 while ((len -= 2) >= 0) { 67 #if BYTE_ORDER == BIG_ENDIAN 68 sum += *cp++ << 8; 69 sum += *cp++; 70 #else 71 sum += *cp++; 72 sum += *cp++ << 8; 73 #endif 74 } 75 } 76 if ((oddbyte = len & 1) != 0) 77 #if BYTE_ORDER == BIG_ENDIAN 78 v = *cp << 8; 79 #else 80 v = *cp; 81 #endif 82 } 83 if (oddbyte) 84 sum += v; 85 sum = (sum >> 16) + (sum & 0xffff); /* add in accumulated carries */ 86 sum += sum >> 16; /* add potential last carry */ 87 return (0xffff & ~sum); 88 } 89