NetBSD/sys/lib/libkern/arch/m68k/bcmp.S

179 lines
5.9 KiB
ArmAsm
Raw Normal View History

/* $NetBSD: bcmp.S,v 1.8 2001/05/16 03:06:41 fredette Exp $ */
1997-05-13 23:32:01 +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.
*/
1996-11-30 05:06:27 +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.
*/
1997-05-13 23:32:01 +04:00
#include <machine/asm.h>
1996-11-30 05:06:27 +03:00
#if defined(LIBC_SCCS) && !defined(lint)
1996-11-30 05:06:27 +03:00
#if 0
1997-05-13 23:32:01 +04:00
RCSID("from: @(#)bcmp.s 5.1 (Berkeley) 5/12/90")
1996-11-30 05:06:27 +03:00
#else
RCSID("$NetBSD: bcmp.S,v 1.8 2001/05/16 03:06:41 fredette Exp $")
1996-11-30 05:06:27 +03:00
#endif
#endif /* LIBC_SCCS and not lint */
ENTRY(bcmp)
1999-11-11 04:32:10 +03:00
movl %sp@(4),%a0 | string 1
movl %sp@(8),%a1 | string 2
movl %sp@(12),%d1 | length
1997-05-13 23:32:01 +04:00
/*
* It isn't worth the overhead of aligning to {long}word boundries
* if the string is too short.
*/
1999-11-11 04:32:10 +03:00
cmpl #8,%d1
1997-05-13 23:32:01 +04:00
jlt Lbcbyte
#ifdef __mc68010__
/*
* The 68010 cannot access a word or long on an odd boundary,
* period. If the source and the destination addresses aren't
* of the same evenness, we're forced to do a bytewise compare.
*/
movl %a0,%d0
addl %a1,%d0
btst #0,%d0
jne Lbcbyte
#endif /* __mc68010__ */
1997-05-13 23:32:01 +04:00
/* word align */
1999-11-11 04:32:10 +03:00
movl %a0,%d0
btst #0,%d0
1997-05-13 23:32:01 +04:00
jeq Lbcalgndw
1999-11-11 04:32:10 +03:00
cmpmb %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
subql #1,%d1
1997-05-13 23:32:01 +04:00
Lbcalgndw:
/* long word align */
1999-11-11 04:32:10 +03:00
btst #1,%d0
1997-05-13 23:32:01 +04:00
jeq Lbcalgndl
1999-11-11 04:32:10 +03:00
cmpmw %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
subql #2,%d1
1997-05-13 23:32:01 +04:00
Lbcalgndl:
/* compare by 8 longwords */
1999-11-11 04:32:10 +03:00
movl %d1,%d0
lsrl #5,%d0 | cnt = len / 32
1997-05-13 23:32:01 +04:00
jeq Lbclong | if (cnt)
1999-11-11 04:32:10 +03:00
andl #31,%d1 | len %= 32
subql #1,%d0 | set up for dbf
1997-05-13 23:32:01 +04:00
Lbc32loop:
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+ | compare 8 longwords
1997-05-13 23:32:01 +04:00
jne Lbcnoteq | not equal, return non-zero
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+
1997-05-13 23:32:01 +04:00
jne Lbcnoteq
1999-11-11 04:32:10 +03:00
dbf %d0,Lbc32loop | till done
clrw %d0
subql #1,%d0
1997-05-13 23:32:01 +04:00
jcc Lbc32loop
Lbclong:
/* compare by longwords */
1999-11-11 04:32:10 +03:00
movl %d1,%d0
lsrl #2,%d0 | cnt = len / 4
1997-05-13 23:32:01 +04:00
jeq Lbcbyte | if (cnt)
1999-11-11 04:32:10 +03:00
subql #1,%d0 | set up for dbf
1996-11-30 05:06:27 +03:00
Lbclloop:
1999-11-11 04:32:10 +03:00
cmpml %a0@+,%a1@+ | compare a longword
1997-05-13 23:32:01 +04:00
jne Lbcnoteq | not equal, return non-zero
1999-11-11 04:32:10 +03:00
dbf %d0,Lbclloop | till done
andl #3,%d1 | len %= 4
1997-05-13 23:32:01 +04:00
jeq Lbcdone
1999-11-11 04:32:10 +03:00
subql #1,%d1 | set up for dbf
1996-11-30 05:06:27 +03:00
Lbcbloop:
1999-11-11 04:32:10 +03:00
cmpmb %a0@+,%a1@+ | compare a byte
1997-05-13 23:32:01 +04:00
jne Lbcnoteq | not equal, return non-zero
Lbcbyte:
1999-11-11 04:32:10 +03:00
dbf %d1,Lbcbloop
1997-05-13 23:32:01 +04:00
Lbcdone:
1999-11-11 04:32:10 +03:00
movql #0,%d0
rts
1997-05-13 23:32:01 +04:00
1996-11-30 05:06:27 +03:00
Lbcnoteq:
1999-11-11 04:32:10 +03:00
movql #1,%d0
rts