[BACK]Return to bcmp.S CVS log [TXT][DIR] Up to [cvs.NetBSD.org] / src / lib / libc / arch / mips / string

File: [cvs.NetBSD.org] / src / lib / libc / arch / mips / string / bcmp.S (download)

Revision 1.9, Mon Dec 14 01:07:42 2009 UTC (12 years, 9 months ago) by matt
Branch: MAIN
CVS Tags: yamt-pagecache-tag8, yamt-pagecache-base9, yamt-pagecache-base8, yamt-pagecache-base7, yamt-pagecache-base6, yamt-pagecache-base5, yamt-pagecache-base4, yamt-pagecache-base3, yamt-pagecache-base2, yamt-pagecache-base, yamt-pagecache, tls-maxphys-base, tls-maxphys, tls-earlyentropy-base, tls-earlyentropy, riastradh-xf86-video-intel-2-7-1-pre-2-21-15, riastradh-drm2-base3, riastradh-drm2-base2, riastradh-drm2-base1, riastradh-drm2-base, riastradh-drm2, prg-localcount2-base3, prg-localcount2-base2, prg-localcount2-base1, prg-localcount2-base, prg-localcount2, phil-wifi-base, phil-wifi-20200421, phil-wifi-20200411, phil-wifi-20200406, phil-wifi-20191119, phil-wifi-20190609, phil-wifi, pgoyette-localcount-base, pgoyette-localcount-20170426, pgoyette-localcount-20170320, pgoyette-localcount-20170107, pgoyette-localcount-20161104, pgoyette-localcount-20160806, pgoyette-localcount-20160726, pgoyette-localcount, pgoyette-compat-merge-20190127, pgoyette-compat-base, pgoyette-compat-20190127, pgoyette-compat-20190118, pgoyette-compat-1226, pgoyette-compat-1126, pgoyette-compat-1020, pgoyette-compat-0930, pgoyette-compat-0906, pgoyette-compat-0728, pgoyette-compat-0625, pgoyette-compat-0521, pgoyette-compat-0502, pgoyette-compat-0422, pgoyette-compat-0415, pgoyette-compat-0407, pgoyette-compat-0330, pgoyette-compat-0322, pgoyette-compat-0315, pgoyette-compat, perseant-stdc-iso10646-base, perseant-stdc-iso10646, netbsd-9-base, netbsd-9-3-RELEASE, netbsd-9-2-RELEASE, netbsd-9-1-RELEASE, netbsd-9-0-RELEASE, netbsd-9-0-RC2, netbsd-9-0-RC1, netbsd-9, netbsd-8-base, netbsd-8-2-RELEASE, netbsd-8-1-RELEASE, netbsd-8-1-RC1, netbsd-8-0-RELEASE, netbsd-8-0-RC2, netbsd-8-0-RC1, netbsd-8, netbsd-7-nhusb-base-20170116, netbsd-7-nhusb-base, netbsd-7-nhusb, netbsd-7-base, netbsd-7-2-RELEASE, netbsd-7-1-RELEASE, netbsd-7-1-RC2, netbsd-7-1-RC1, netbsd-7-1-2-RELEASE, netbsd-7-1-1-RELEASE, netbsd-7-1, netbsd-7-0-RELEASE, netbsd-7-0-RC3, netbsd-7-0-RC2, netbsd-7-0-RC1, netbsd-7-0-2-RELEASE, netbsd-7-0-1-RELEASE, netbsd-7-0, netbsd-7, netbsd-6-base, netbsd-6-1-RELEASE, netbsd-6-1-RC4, netbsd-6-1-RC3, netbsd-6-1-RC2, netbsd-6-1-RC1, netbsd-6-1-5-RELEASE, netbsd-6-1-4-RELEASE, netbsd-6-1-3-RELEASE, netbsd-6-1-2-RELEASE, netbsd-6-1-1-RELEASE, netbsd-6-1, netbsd-6-0-RELEASE, netbsd-6-0-RC2, netbsd-6-0-RC1, netbsd-6-0-6-RELEASE, netbsd-6-0-5-RELEASE, netbsd-6-0-4-RELEASE, netbsd-6-0-3-RELEASE, netbsd-6-0-2-RELEASE, netbsd-6-0-1-RELEASE, netbsd-6-0, netbsd-6, matt-nb8-mediatek-base, matt-nb8-mediatek, matt-nb6-plus-nbase, matt-nb6-plus-base, matt-nb6-plus, matt-mips64-premerge-20101231, localcount-20160914, is-mlppp-base, is-mlppp, cjep_sun2x-base1, cjep_sun2x-base, cjep_sun2x, cjep_staticlib_x-base1, cjep_staticlib_x-base, cjep_staticlib_x, cherry-xenmp-base, cherry-xenmp, bouyer-socketcan-base1, bouyer-socketcan-base, bouyer-socketcan, bouyer-quota2-nbase, bouyer-quota2-base, bouyer-quota2, agc-symver-base, agc-symver, HEAD
Changes since 1.8: +62 -63 lines

Merge from matt-nb5-mips64.

/*	$NetBSD: bcmp.S,v 1.9 2009/12/14 01:07:42 matt Exp $	*/

/*-
 * Copyright (c) 1991, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Ralph Campbell.
 *
 * 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.
 */

#include <mips/asm.h>
#define _LOCORE		/* XXX not really, just assembly-code source */
#include <machine/endian.h>	/* LWLO/LWHI, SWLO/SWHI */

#if defined(LIBC_SCCS) && !defined(lint)
#if 0
	RCSID("from: @(#)bcmp.s	8.1 (Berkeley) 6/4/93")
#else
	RCSID("$NetBSD: bcmp.S,v 1.9 2009/12/14 01:07:42 matt Exp $")
#endif
#endif /* LIBC_SCCS and not lint */

/* bcmp(s1, s2, n) */


LEAF(bcmp)
	.set	noreorder
	blt		a2, 16, small	# is it worth any trouble?
	xor		v0, a0, a1	# compare low two bits of addresses
	and		v0, v0, 3
	PTR_SUBU	a3, zero, a1	# compute # bytes to word align address
	bne		v0, zero, unaligned # not possible to align addresses
	and		a3, a3, 3

	beq		a3, zero, 1f
	PTR_SUBU	a2, a2, a3	# subtract from remaining count
	move		v0, v1		# init v0,v1 so unmodified bytes match
	LWHI		v0, 0(a0)	# read 1, 2, or 3 bytes
	LWHI		v1, 0(a1)
	PTR_ADDU	a1, a1, a3
	bne		v0, v1, nomatch
	PTR_ADDU	a0, a0, a3
1:
	and		a3, a2, ~3	# compute number of whole words left
	PTR_SUBU	a2, a2, a3	#   which has to be >= (16-3) & ~3
	PTR_ADDU	a3, a3, a0	# compute ending address
2:
	lw		v0, 0(a0)	# compare words
	lw		v1, 0(a1)
	PTR_ADDU	a0, a0, 4
	bne		v0, v1, nomatch
	PTR_ADDU	a1, a1, 4
	bne		a0, a3, 2b
	nop
	b		small		# finish remainder
	nop
unaligned:
	beq		a3, zero, 2f
	PTR_SUBU	a2, a2, a3	# subtract from remaining count
	PTR_ADDU	a3, a3, a0	# compute ending address
1:
	lbu		v0, 0(a0)	# compare bytes until a1 word aligned
	lbu		v1, 0(a1)
	PTR_ADDU	a0, a0, 1
	bne		v0, v1, nomatch
	PTR_ADDU	a1, a1, 1
	bne		a0, a3, 1b
	nop
2:
	and		a3, a2, ~3	# compute number of whole words left
	PTR_SUBU	a2, a2, a3	#   which has to be >= (16-3) & ~3
	PTR_ADDU	a3, a3, a0	# compute ending address
3:
	LWHI		v0, 0(a0)	# compare words a0 unaligned, a1 aligned
	LWLO		v0, 3(a0)
	lw		v1, 0(a1)
	PTR_ADDU	a0, a0, 4
	bne		v0, v1, nomatch
	PTR_ADDU	a1, a1, 4
	bne		a0, a3, 3b
	nop
small:
	ble		a2, zero, match
	PTR_ADDU	a3, a2, a0		# compute ending address
1:
	lbu		v0, 0(a0)
	lbu		v1, 0(a1)
	PTR_ADDU	a0, a0, 1
	bne		v0, v1, nomatch
	PTR_ADDU	a1, a1, 1
	bne		a0, a3, 1b
	nop
match:
	j		ra
	move		v0, zero
nomatch:
	j		ra
	li		v0, 1
	.set	reorder
END(bcmp)