URL
https://opencores.org/ocsvn/or1k_old/or1k_old/trunk
Subversion Repositories or1k_old
Compare Revisions
- This comparison shows the changes necessary to convert path
/or1k_old/trunk/rc203soc/sw/uClinux/arch/m68k/lib
- from Rev 1765 to Rev 1782
- ↔ Reverse comparison
Rev 1765 → Rev 1782
/memcmp.c
0,0 → 1,11
#include <linux/types.h> |
|
int memcmp(const void * cs,const void * ct,size_t count) |
{ |
const unsigned char *su1, *su2; |
|
for( su1 = cs, su2 = ct; 0 < count; ++su1, ++su2, count--) |
if (*su1 != *su2) |
return((*su1 < *su2) ? -1 : +1); |
return(0); |
} |
/checksum.c
0,0 → 1,323
/* |
* INET An implementation of the TCP/IP protocol suite for the LINUX |
* operating system. INET is implemented using the BSD Socket |
* interface as the means of communication with the user level. |
* |
* IP/TCP/UDP checksumming routines |
* |
* Authors: Jorge Cwik, <jorge@laser.satlink.net> |
* Arnt Gulbrandsen, <agulbra@nvg.unit.no> |
* Tom May, <ftom@netcom.com> |
* Andreas Schwab, <schwab@issan.informatik.uni-dortmund.de> |
* Lots of code moved from tcp.c and ip.c; see those files |
* for more names. |
* |
* 03/02/96 Jes Sorensen, Andreas Schwab, Roman Hodek: |
* Fixed some nasty bugs, causing some horrible crashes. |
* A: At some points, the sum (%0) was used as |
* length-counter instead of the length counter |
* (%1). Thanks to Roman Hodek for pointing this out. |
* B: GCC seems to mess up if one uses too many |
* data-registers to hold input values and one tries to |
* specify d0 and d1 as scratch registers. Letting gcc choose these |
* registers itself solves the problem. |
* |
* This program is free software; you can redistribute it and/or |
* modify it under the terms of the GNU General Public License |
* as published by the Free Software Foundation; either version |
* 2 of the License, or (at your option) any later version. |
*/ |
|
#include <net/checksum.h> |
|
/* |
* computes a partial checksum, e.g. for TCP/UDP fragments |
*/ |
|
unsigned int |
csum_partial (const unsigned char *buff, int len, unsigned int sum) |
{ |
unsigned long tmp1, tmp2; |
/* |
* Experiments with ethernet and slip connections show that buff |
* is aligned on either a 2-byte or 4-byte boundary. |
*/ |
__asm__("movel %2,%3\n\t" |
"btst #1,%3\n\t" /* Check alignment */ |
"jeq 2f\n\t" |
"subql #2,%1\n\t" /* buff%4==2: treat first word */ |
"jgt 1f\n\t" |
"addql #2,%1\n\t" /* len was == 2, treat only rest */ |
"jra 4f\n" |
"1:\t" |
"addw %2@+,%0\n\t" /* add first word to sum */ |
"clrl %3\n\t" |
"addxl %3,%0\n" /* add X bit */ |
"2:\t" |
/* unrolled loop for the main part: do 8 longs at once */ |
"movel %1,%3\n\t" /* save len in tmp1 */ |
"lsrl #5,%1\n\t" /* len/32 */ |
"jeq 2f\n\t" /* not enough... */ |
"subql #1,%1\n" |
"1:\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"dbra %1,1b\n\t" |
"clrl %4\n\t" |
"addxl %4,%0\n\t" /* add X bit */ |
"clrw %1\n\t" |
"subql #1,%1\n\t" |
"jcc 1b\n" |
"2:\t" |
"movel %3,%1\n\t" /* restore len from tmp1 */ |
"andw #0x1c,%3\n\t" /* number of rest longs */ |
"jeq 4f\n\t" |
"lsrw #2,%3\n\t" |
"subqw #1,%3\n" |
"3:\t" |
/* loop for rest longs */ |
"movel %2@+,%4\n\t" |
"addxl %4,%0\n\t" |
"dbra %3,3b\n\t" |
"clrl %4\n\t" |
"addxl %4,%0\n" /* add X bit */ |
"4:\t" |
/* now check for rest bytes that do not fit into longs */ |
"andw #3,%1\n\t" |
"jeq 7f\n\t" |
"clrl %4\n\t" /* clear tmp2 for rest bytes */ |
"subqw #2,%1\n\t" |
"jlt 5f\n\t" |
"movew %2@+,%4\n\t" /* have rest >= 2: get word */ |
"swap %4\n\t" /* into bits 16..31 */ |
"tstw %1\n\t" /* another byte? */ |
"jeq 6f\n" |
"5:\t" |
"moveb %2@,%4\n\t" /* have odd rest: get byte */ |
"lslw #8,%4\n\t" /* into bits 8..15; 16..31 untouched */ |
"6:\t" |
"addl %4,%0\n\t" /* now add rest long to sum */ |
"clrl %4\n\t" |
"addxl %4,%0\n" /* add X bit */ |
"7:\t" |
: "=d" (sum), "=d" (len), "=a" (buff), |
"=&d" (tmp1), "=&d" (tmp2) |
: "0" (sum), "1" (len), "2" (buff) |
); |
return(sum); |
} |
|
|
|
/* |
* copy from fs while checksumming, otherwise like csum_partial |
*/ |
|
unsigned int |
csum_partial_copy_fromuser(const char *src, char *dst, int len, int sum) |
{ |
unsigned long tmp1, tmp2; |
__asm__("movel %2,%4\n\t" |
"btst #1,%4\n\t" /* Check alignment */ |
"jeq 2f\n\t" |
"subql #2,%1\n\t" /* buff%4==2: treat first word */ |
"jgt 1f\n\t" |
"addql #2,%1\n\t" /* len was == 2, treat only rest */ |
"jra 4f\n" |
"1:\t" |
"movesw %2@+,%4\n\t" /* add first word to sum */ |
"addw %4,%0\n\t" |
"movew %4,%3@+\n\t" |
"clrl %4\n\t" |
"addxl %4,%0\n" /* add X bit */ |
"2:\t" |
/* unrolled loop for the main part: do 8 longs at once */ |
"movel %1,%4\n\t" /* save len in tmp1 */ |
"lsrl #5,%1\n\t" /* len/32 */ |
"jeq 2f\n\t" /* not enough... */ |
"subql #1,%1\n" |
"1:\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"dbra %1,1b\n\t" |
"clrl %5\n\t" |
"addxl %5,%0\n\t" /* add X bit */ |
"clrw %1\n\t" |
"subql #1,%1\n\t" |
"jcc 1b\n" |
"2:\t" |
"movel %4,%1\n\t" /* restore len from tmp1 */ |
"andw #0x1c,%4\n\t" /* number of rest longs */ |
"jeq 4f\n\t" |
"lsrw #2,%4\n\t" |
"subqw #1,%4\n" |
"3:\t" |
/* loop for rest longs */ |
"movesl %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"dbra %4,3b\n\t" |
"clrl %5\n\t" |
"addxl %5,%0\n" /* add X bit */ |
"4:\t" |
/* now check for rest bytes that do not fit into longs */ |
"andw #3,%1\n\t" |
"jeq 7f\n\t" |
"clrl %5\n\t" /* clear tmp2 for rest bytes */ |
"subqw #2,%1\n\t" |
"jlt 5f\n\t" |
"movesw %2@+,%5\n\t" /* have rest >= 2: get word */ |
"movew %5,%3@+\n\t" |
"swap %5\n\t" /* into bits 16..31 */ |
"tstw %1\n\t" /* another byte? */ |
"jeq 6f\n" |
"5:\t" |
"movesb %2@,%5\n\t" /* have odd rest: get byte */ |
"moveb %5,%3@+\n\t" |
"lslw #8,%5\n\t" /* into bits 8..15; 16..31 untouched */ |
"6:\t" |
"addl %5,%0\n\t" /* now add rest long to sum */ |
"clrl %5\n\t" |
"addxl %5,%0\n" /* add X bit */ |
"7:\t" |
: "=d" (sum), "=d" (len), "=a" (src), "=a" (dst), |
"=&d" (tmp1), "=&d" (tmp2) |
: "0" (sum), "1" (len), "2" (src), "3" (dst) |
); |
return(sum); |
} |
/* |
* copy from ds while checksumming, otherwise like csum_partial |
*/ |
|
unsigned int |
csum_partial_copy(const char *src, char *dst, int len, int sum) |
{ |
unsigned long tmp1, tmp2; |
__asm__("movel %2,%4\n\t" |
"btst #1,%4\n\t" /* Check alignment */ |
"jeq 2f\n\t" |
"subql #2,%1\n\t" /* buff%4==2: treat first word */ |
"jgt 1f\n\t" |
"addql #2,%1\n\t" /* len was == 2, treat only rest */ |
"jra 4f\n" |
"1:\t" |
"movew %2@+,%4\n\t" /* add first word to sum */ |
"addw %4,%0\n\t" |
"movew %4,%3@+\n\t" |
"clrl %4\n\t" |
"addxl %4,%0\n" /* add X bit */ |
"2:\t" |
/* unrolled loop for the main part: do 8 longs at once */ |
"movel %1,%4\n\t" /* save len in tmp1 */ |
"lsrl #5,%1\n\t" /* len/32 */ |
"jeq 2f\n\t" /* not enough... */ |
"subql #1,%1\n" |
"1:\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"dbra %1,1b\n\t" |
"clrl %5\n\t" |
"addxl %5,%0\n\t" /* add X bit */ |
"clrw %1\n\t" |
"subql #1,%1\n\t" |
"jcc 1b\n" |
"2:\t" |
"movel %4,%1\n\t" /* restore len from tmp1 */ |
"andw #0x1c,%4\n\t" /* number of rest longs */ |
"jeq 4f\n\t" |
"lsrw #2,%4\n\t" |
"subqw #1,%4\n" |
"3:\t" |
/* loop for rest longs */ |
"movel %2@+,%5\n\t" |
"addxl %5,%0\n\t" |
"movel %5,%3@+\n\t" |
"dbra %4,3b\n\t" |
"clrl %5\n\t" |
"addxl %5,%0\n" /* add X bit */ |
"4:\t" |
/* now check for rest bytes that do not fit into longs */ |
"andw #3,%1\n\t" |
"jeq 7f\n\t" |
"clrl %5\n\t" /* clear tmp2 for rest bytes */ |
"subqw #2,%1\n\t" |
"jlt 5f\n\t" |
"movew %2@+,%5\n\t" /* have rest >= 2: get word */ |
"movew %5,%3@+\n\t" |
"swap %5\n\t" /* into bits 16..31 */ |
"tstw %1\n\t" /* another byte? */ |
"jeq 6f\n" |
"5:\t" |
"moveb %2@,%5\n\t" /* have odd rest: get byte */ |
"moveb %5,%3@+\n\t" |
"lslw #8,%5\n" /* into bits 8..15; 16..31 untouched */ |
"6:\t" |
"addl %5,%0\n\t" /* now add rest long to sum */ |
"clrl %5\n\t" |
"addxl %5,%0\n" /* add X bit */ |
"7:\t" |
: "=d" (sum), "=d" (len), "=a" (src), "=a" (dst), |
"=&d" (tmp1), "=&d" (tmp2) |
: "0" (sum), "1" (len), "2" (src), "3" (dst) |
); |
return(sum); |
} |
/memcpy.c
0,0 → 1,55
#include <linux/types.h> |
|
void * memcpy(void * to, const void * from, size_t n) |
{ |
void *xto = to; |
size_t temp; |
|
if (!n) |
return xto; |
if ((long) to & 1) |
{ |
char *cto = to; |
const char *cfrom = from; |
*cto++ = *cfrom++; |
to = cto; |
from = cfrom; |
n--; |
} |
if (n > 2 && (long) to & 2) |
{ |
short *sto = to; |
const short *sfrom = from; |
*sto++ = *sfrom++; |
to = sto; |
from = sfrom; |
n -= 2; |
} |
temp = n >> 2; |
if (temp) |
{ |
long *lto = to; |
const long *lfrom = from; |
temp--; |
do |
*lto++ = *lfrom++; |
while (temp--); |
to = lto; |
from = lfrom; |
} |
if (n & 2) |
{ |
short *sto = to; |
const short *sfrom = from; |
*sto++ = *sfrom++; |
to = sto; |
from = sfrom; |
} |
if (n & 1) |
{ |
char *cto = to; |
const char *cfrom = from; |
*cto = *cfrom; |
} |
return xto; |
} |
/Makefile
0,0 → 1,8
# |
# Makefile for m68k-specific library files.. |
# |
|
L_TARGET = lib.a |
L_OBJS = ashrdi3.o checksum.o memcpy.o memcmp.o |
|
include $(TOPDIR)/Rules.make |
/ashrdi3.c
0,0 → 1,63
/* ashrdi3.c extracted from gcc-2.7.2/libgcc2.c which is: */ |
/* Copyright (C) 1989, 1992, 1993, 1994, 1995 Free Software Foundation, Inc. |
|
This file is part of GNU CC. |
|
GNU CC is free software; you can redistribute it and/or modify |
it under the terms of the GNU General Public License as published by |
the Free Software Foundation; either version 2, or (at your option) |
any later version. |
|
GNU CC is distributed in the hope that it will be useful, |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
GNU General Public License for more details. |
|
You should have received a copy of the GNU General Public License |
along with GNU CC; see the file COPYING. If not, write to |
the Free Software Foundation, 59 Temple Place - Suite 330, |
Boston, MA 02111-1307, USA. */ |
|
#define BITS_PER_UNIT 8 |
|
typedef int SItype __attribute__ ((mode (SI))); |
typedef unsigned int USItype __attribute__ ((mode (SI))); |
typedef int DItype __attribute__ ((mode (DI))); |
typedef int word_type __attribute__ ((mode (__word__))); |
|
struct DIstruct {SItype high, low;}; |
|
typedef union |
{ |
struct DIstruct s; |
DItype ll; |
} DIunion; |
|
DItype |
__ashrdi3 (DItype u, word_type b) |
{ |
DIunion w; |
word_type bm; |
DIunion uu; |
|
if (b == 0) |
return u; |
|
uu.ll = u; |
|
bm = (sizeof (SItype) * BITS_PER_UNIT) - b; |
if (bm <= 0) |
{ |
/* w.s.high = 1..1 or 0..0 */ |
w.s.high = uu.s.high >> (sizeof (SItype) * BITS_PER_UNIT - 1); |
w.s.low = uu.s.high >> -bm; |
} |
else |
{ |
USItype carries = (USItype)uu.s.high << bm; |
w.s.high = uu.s.high >> b; |
w.s.low = ((USItype)uu.s.low >> b) | carries; |
} |
|
return w.ll; |
} |