Aren
/
NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
NetBSD/lib/libc/arch/m68k/string/memset.S

166 lines
5.6 KiB
ArmAsm
Raw Normal View History

When using the SVR4 ABI, return pointer results in a0, too.
1999-05-03 00:34:04 +04:00
/* $NetBSD: memset.S,v 1.11 1999/05/02 20:34:04 kleink Exp $ */
Faster versions of bcmp(), bcopy(), bzero(), and memset(). The implementation of these functions is losely based on the original BSD code plus versions I was working on which would yeild code tuned for a particular m68k or coldfire family cpu, code space or run time efficiency, etc. depending on the values of various macros. My original code was intended for use in OS-less embedded systems. Because NetBSD can not benefit from the considerable complexity, I've removed the extraneous preprocessor goop. The resulting code is tuned for the '020 - '060. It will not function on the '000 or coldfire.
1997-05-13 23:20:58 +04:00
/*-
* Copyright (c) 1997 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by J.T. Conklin.
*
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
*/
New style RCS ids, and employ the RCSID() macro.
1995-11-17 23:21:10 +03:00
More assembler code.
1993-12-07 02:08:46 +03:00
/*-
* Copyright (c) 1990 The Regents of the University of California.
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* the Systems Programming Group of the University of Utah Computer
* Science Department.
*
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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.
*/
#include <machine/asm.h> instead of "DEFS.h"
1997-01-04 06:26:18 +03:00
#include <machine/asm.h>
Fix a brain-o by me; if I'm going to use stuff in <machine/asm.h>, I better darn well include it in the right place. "Hello, McFly!"
1995-11-29 02:40:47 +03:00
More assembler code.
1993-12-07 02:08:46 +03:00
#if defined(LIBC_SCCS) && !defined(lint)
New style RCS ids, and employ the RCSID() macro.
1995-11-17 23:21:10 +03:00
#if 0
RCSID("from: @(#)bzero.s 5.1 (Berkeley) 5/12/90")
#else
When using the SVR4 ABI, return pointer results in a0, too.
1999-05-03 00:34:04 +04:00
RCSID("$NetBSD: memset.S,v 1.11 1999/05/02 20:34:04 kleink Exp $")
New style RCS ids, and employ the RCSID() macro.
1995-11-17 23:21:10 +03:00
#endif
More assembler code.
1993-12-07 02:08:46 +03:00
#endif /* LIBC_SCCS and not lint */
oops, bzero -> memset
1997-05-14 22:18:44 +04:00
ENTRY(memset)
More assembler code.
1993-12-07 02:08:46 +03:00
movl d2,sp@-
Make the coding style more consistent.
1995-02-08 21:33:12 +03:00
movl sp@(8),a0 | destination
Faster versions of bcmp(), bcopy(), bzero(), and memset(). The implementation of these functions is losely based on the original BSD code plus versions I was working on which would yeild code tuned for a particular m68k or coldfire family cpu, code space or run time efficiency, etc. depending on the values of various macros. My original code was intended for use in OS-less embedded systems. Because NetBSD can not benefit from the considerable complexity, I've removed the extraneous preprocessor goop. The resulting code is tuned for the '020 - '060. It will not function on the '000 or coldfire.
1997-05-13 23:20:58 +04:00
movl sp@(16),d1 | count
Make the coding style more consistent.
1995-02-08 21:33:12 +03:00
movb sp@(15),d2 | character
Faster versions of bcmp(), bcopy(), bzero(), and memset(). The implementation of these functions is losely based on the original BSD code plus versions I was working on which would yeild code tuned for a particular m68k or coldfire family cpu, code space or run time efficiency, etc. depending on the values of various macros. My original code was intended for use in OS-less embedded systems. Because NetBSD can not benefit from the considerable complexity, I've removed the extraneous preprocessor goop. The resulting code is tuned for the '020 - '060. It will not function on the '000 or coldfire.
1997-05-13 23:20:58 +04:00
/*
* It isn't worth the overhead of aligning to {long}word boundries
* if the string is too short.
*/
cmpl #15,d1
Change b{eq,ne,lt,le,gt,ge} -> j{eq,ne,lt,le,gt,ge}.
1997-05-13 23:27:21 +04:00
jlt Lbzbyte
Faster versions of bcmp(), bcopy(), bzero(), and memset(). The implementation of these functions is losely based on the original BSD code plus versions I was working on which would yeild code tuned for a particular m68k or coldfire family cpu, code space or run time efficiency, etc. depending on the values of various macros. My original code was intended for use in OS-less embedded systems. Because NetBSD can not benefit from the considerable complexity, I've removed the extraneous preprocessor goop. The resulting code is tuned for the '020 - '060. It will not function on the '000 or coldfire.
1997-05-13 23:20:58 +04:00
clrl d0 | replicate byte to fill longword
movb d2,d0
movl d0,d2
lsll #8,d0
orl d0,d2
lsll #8,d0
orl d0,d2
lsll #8,d0
orl d0,d2
/* word align */
movl a0,d0
btst #0,d0 | if (dst & 1)
Change b{eq,ne,lt,le,gt,ge} -> j{eq,ne,lt,le,gt,ge}.
1997-05-13 23:27:21 +04:00
jeq Lbzalgndw |
Faster versions of bcmp(), bcopy(), bzero(), and memset(). The implementation of these functions is losely based on the original BSD code plus versions I was working on which would yeild code tuned for a particular m68k or coldfire family cpu, code space or run time efficiency, etc. depending on the values of various macros. My original code was intended for use in OS-less embedded systems. Because NetBSD can not benefit from the considerable complexity, I've removed the extraneous preprocessor goop. The resulting code is tuned for the '020 - '060. It will not function on the '000 or coldfire.
1997-05-13 23:20:58 +04:00
movb d2,a0@+ | *(char *)dst++ = X
subql #1,d1 | len--
Lbzalgndw:
/* long word align */
btst #1,d0 | if (dst & 2)
Change b{eq,ne,lt,le,gt,ge} -> j{eq,ne,lt,le,gt,ge}.
1997-05-13 23:27:21 +04:00
jeq Lbzalgndl |
Faster versions of bcmp(), bcopy(), bzero(), and memset(). The implementation of these functions is losely based on the original BSD code plus versions I was working on which would yeild code tuned for a particular m68k or coldfire family cpu, code space or run time efficiency, etc. depending on the values of various macros. My original code was intended for use in OS-less embedded systems. Because NetBSD can not benefit from the considerable complexity, I've removed the extraneous preprocessor goop. The resulting code is tuned for the '020 - '060. It will not function on the '000 or coldfire.
1997-05-13 23:20:58 +04:00
movw d2,a0@+ | *(short *)dst++ = X
subql #2,d1 | len -= 2
Lbzalgndl:
/* set by 8 longwords */
movel d1,d0
lsrl #5,d0 | cnt = len / 32
jeq Lbzlong | if (cnt)
andl #31,d1 | len %= 32
subql #1,d0 | set up for dbf
Lbz32loop:
movl d2,a0@+ | set 8 long words
movl d2,a0@+
movl d2,a0@+
movl d2,a0@+
movl d2,a0@+
movl d2,a0@+
movl d2,a0@+
movl d2,a0@+
dbf d0,Lbz32loop | till done
clrw d0
subql #1,d0
jcc Lbz32loop
Lbzlong:
/* set by longwords */
movel d1,d0
lsrl #2,d0 | cnt = len / 4
jeq Lbzbyte | if (cnt)
subql #1,d0 | set up for dbf
Lbzlloop:
movl d2,a0@+ | clear longwords
dbf d0,Lbzlloop | till done
andl #3,d1 | len %= 4
jeq Lbzdone
subql #1,d1 | set up for dbf
Lbzbloop:
movb d2,a0@+ | set bytes
Lbzbyte:
dbf d1,Lbzbloop | till done
Lbzdone:
Make the coding style more consistent.
1995-02-08 21:33:12 +03:00
movl sp@(8),d0 | return destination
When using the SVR4 ABI, return pointer results in a0, too.
1999-05-03 00:34:04 +04:00
#ifdef __SVR4_ABI__
moveal d0,a0
#endif
More assembler code.
1993-12-07 02:08:46 +03:00
movl sp@+,d2
rts