File: [local] / sys / arch / vax / vax / in_cksum.c (download)
Revision 1.1.1.1 (vendor branch), Tue Mar 4 16:08:46 2008 UTC (16 years, 3 months ago) by nbrk
Branch: OPENBSD_4_2_BASE, MAIN
CVS Tags: jornada-partial-support-wip, HEAD Changes since 1.1: +0 -0 lines
Import of OpenBSD 4.2 release kernel tree with initial code to support
Jornada 720/728, StrongARM 1110-based handheld PC.
At this point kernel roots on NFS and boots into vfs_mountroot() and traps.
What is supported:
- glass console, Jornada framebuffer (jfb) works in 16bpp direct color mode
(needs some palette tweaks for non black/white/blue colors, i think)
- saic, SA11x0 interrupt controller (needs cleanup)
- sacom, SA11x0 UART (supported only as boot console for now)
- SA11x0 GPIO controller fully supported (but can't handle multiple interrupt
handlers on one gpio pin)
- sassp, SSP port on SA11x0 that attaches spibus
- Jornada microcontroller (jmcu) to control kbd, battery, etc throught
the SPI bus (wskbd attaches on jmcu, but not tested)
- tod functions seem work
- initial code for SA-1111 (chip companion) : this is TODO
Next important steps, i think:
- gpio and intc on sa1111
- pcmcia support for sa11x0 (and sa1111 help logic)
- REAL root on nfs when we have PCMCIA support (we may use any of supported pccard NICs)
- root on wd0! (using already supported PCMCIA-ATA)
|
/* $OpenBSD: in_cksum.c,v 1.5 2005/05/10 04:04:39 brad Exp $ */
/* $NetBSD: in_cksum.c,v 1.7 2003/08/07 16:30:19 agc Exp $ */
/*
* 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.
* 3. Neither the name of the University nor the names of its contributors
* 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
*/
#include <sys/param.h>
#include <sys/mbuf.h>
#include <sys/systm.h>
#include <netinet/in.h>
/*
* Checksum routine for Internet Protocol family headers.
*
* This routine is very heavily used in the network
* code and should be modified for each CPU to be as fast as possible.
*
* This implementation is VAX version.
*/
#define REDUCE {sum = (sum & 0xffff) + (sum >> 16);}
#define ADDCARRY {if (sum > 0xffff) sum -= 0xffff;}
#define ADVANCE(n) {w += n; mlen -= n;}
#define SWAP {sum <<= 8;} /* depends on recent REDUCE */
#define Asm __asm __volatile
#define ADDL Asm("addl2 (%2)+,%0" : "=r" (sum) : "0" (sum), "r" (w))
#define ADWC Asm("adwc (%2)+,%0" : "=r" (sum) : "0" (sum), "r" (w))
#define ADDC Asm("adwc $0,%0" : "=r" (sum) : "0" (sum))
#define UNSWAP Asm("rotl $8,%0,%0" : "=r" (sum) : "0" (sum))
#define ADDBYTE {sum += *w; SWAP; byte_swapped ^= 1;}
#define ADDWORD {sum += *(u_short *)w;}
int
in_cksum(struct mbuf *m, int len)
{
u_int8_t *w;
u_int32_t sum = 0;
int mlen = 0;
int byte_swapped = 0;
for (;m && len; m = m->m_next) {
if ((mlen = m->m_len) == 0)
continue;
w = mtod(m, u_int8_t *);
if (len < mlen)
mlen = len;
len -= mlen;
if (mlen < 16)
goto short_mbuf;
/*
* Ensure that we're aligned on a word boundary here so
* that we can do 32 bit operations below.
*/
if ((3 & (u_long) w) != 0) {
REDUCE;
if ((1 & (u_long) w) != 0) {
ADDBYTE;
ADVANCE(1);
}
if ((2 & (u_long) w) != 0) {
ADDWORD;
ADVANCE(2);
}
}
/*
* Do as much of the checksum as possible 32 bits at at time.
* In fact, this loop is unrolled to make overhead from
* branches &c small.
*/
while ((mlen -= 32) >= 0) {
/*
* Add with carry 16 words and fold in the last carry
* by adding a 0 with carry.
*/
ADDL; ADWC; ADWC; ADWC;
ADWC; ADWC; ADWC; ADWC;
ADDC;
}
mlen += 32;
if (mlen >= 16) {
ADDL; ADWC; ADWC; ADWC;
ADDC;
mlen -= 16;
}
short_mbuf:
if (mlen >= 8) {
ADDL; ADWC;
ADDC;
mlen -= 8;
}
if (mlen >= 4) {
ADDL;
ADDC;
mlen -= 4;
}
if (mlen > 0) {
REDUCE;
if (mlen >= 2) {
ADDWORD;
ADVANCE(2);
}
if (mlen >= 1) {
ADDBYTE;
}
}
}
if (len)
printf("cksum: out of data\n");
if (byte_swapped) {
UNSWAP;
}
REDUCE;
ADDCARRY;
return (sum ^ 0xffff);
}