BSD 4_4 release

[unix-history] / usr / src / lib / libc / mips / string / bcopy.s

diff --git a/usr/src/lib/libc/mips/string/bcopy.s b/usr/src/lib/libc/mips/string/bcopy.s
index 51b7aaf..ccdaf80 100644 (file)
--- a/usr/src/lib/libc/mips/string/bcopy.s
+++ b/usr/src/lib/libc/mips/string/bcopy.s
@@ -1,21 +1,60 @@
 /*-
 /*-

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

- * %sccs.include.redist.c%
+ * 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 "DEFS.h"
+#include <machine/machAsmDefs.h>

 
 #if defined(LIBC_SCCS) && !defined(lint)
 
 #if defined(LIBC_SCCS) && !defined(lint)

-       ASMSTR("@(#)bcopy.s     5.2 (Berkeley) %G%")
+       ASMSTR("@(#)bcopy.s     8.1 (Berkeley) 6/4/93")

 #endif /* LIBC_SCCS and not lint */
 
 /* bcopy(s1, s2, n) */
 
 #endif /* LIBC_SCCS and not lint */
 
 /* bcopy(s1, s2, n) */
 

+#ifdef MIPSEL
+#      define  LWHI    lwr
+#      define  LWLO    lwl
+#      define  SWHI    swr
+#      define  SWLO    swl
+#endif
+#ifdef MIPSEB
+#      define  LWHI    lwl
+#      define  LWLO    lwr
+#      define  SWHI    swl
+#      define  SWLO    swr
+#endif
+

 LEAF(bcopy)
        .set    noreorder
        addu    t0, a0, a2              # t0 = end of s1 region
 LEAF(bcopy)
        .set    noreorder
        addu    t0, a0, a2              # t0 = end of s1 region


@@ -29,7 +68,7 @@ LEAF(bcopy)
        addu    t1, a1, a2              # t1 = end of to region
 1:
        lb      v0, -1(t0)              # copy bytes backwards,
        addu    t1, a1, a2              # t1 = end of to region
 1:
        lb      v0, -1(t0)              # copy bytes backwards,

-       subu    t0, t0, 1               #   doesn't happen often so do slow way
+       subu    t0, t0, 1               #   doesnt happen often so do slow way

        subu    t1, t1, 1
        bne     t0, a0, 1b
        sb      v0, 0(t1)
        subu    t1, t1, 1
        bne     t0, a0, 1b
        sb      v0, 0(t1)


@@ -46,10 +85,10 @@ forward:
 
        beq     a3, zero, 1f
        subu    a2, a2, a3              # subtract from remaining count
 
        beq     a3, zero, 1f
        subu    a2, a2, a3              # subtract from remaining count

-       lwr     v0, 0(a0)               # get next 4 bytes (unaligned)
-       lwl     v0, 3(a0)
+       LWHI    v0, 0(a0)               # get next 4 bytes (unaligned)
+       LWLO    v0, 3(a0)

        addu    a0, a0, a3
        addu    a0, a0, a3

-       swr     v0, 0(a1)               # store 1, 2, or 3 bytes to align a1
+       SWHI    v0, 0(a1)               # store 1, 2, or 3 bytes to align a1

        addu    a1, a1, a3
 1:
        and     v0, a2, 3               # compute number of words left
        addu    a1, a1, a3
 1:
        and     v0, a2, 3               # compute number of words left


@@ -57,8 +96,8 @@ forward:
        move    a2, v0
        addu    a3, a3, a0              # compute ending address
 2:
        move    a2, v0
        addu    a3, a3, a0              # compute ending address
 2:

-       lwr     v0, 0(a0)               # copy words a0 unaligned, a1 aligned
-       lwl     v0, 3(a0)
+       LWHI    v0, 0(a0)               # copy words a0 unaligned, a1 aligned
+       LWLO    v0, 3(a0)

        addu    a0, a0, 4
        addu    a1, a1, 4
        bne     a0, a3, 2b
        addu    a0, a0, 4
        addu    a1, a1, 4
        bne     a0, a3, 2b


@@ -68,9 +107,9 @@ forward:
 aligned:
        beq     a3, zero, 1f
        subu    a2, a2, a3              # subtract from remaining count
 aligned:
        beq     a3, zero, 1f
        subu    a2, a2, a3              # subtract from remaining count

-       lwr     v0, 0(a0)               # copy 1, 2, or 3 bytes to align
+       LWHI    v0, 0(a0)               # copy 1, 2, or 3 bytes to align

        addu    a0, a0, a3
        addu    a0, a0, a3

-       swr     v0, 0(a1)
+       SWHI    v0, 0(a1)

        addu    a1, a1, a3
 1:
        and     v0, a2, 3               # compute number of whole words left
        addu    a1, a1, a3
 1:
        and     v0, a2, 3               # compute number of whole words left