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