diff options
author | Theo de Raadt <deraadt@cvs.openbsd.org> | 1995-11-06 21:15:58 +0000 |
---|---|---|
committer | Theo de Raadt <deraadt@cvs.openbsd.org> | 1995-11-06 21:15:58 +0000 |
commit | c86308c5a78ceb904232c23e0d35c0d155cc3bf0 (patch) | |
tree | ac54e8af8ee78e7d22e6f6a3c71cbb30e74728a4 /sys | |
parent | 664a78c374d744c5946fac03741dbed87da41761 (diff) |
libkern pica stuff
Diffstat (limited to 'sys')
-rw-r--r-- | sys/lib/libkern/arch/mips/DEFS.h | 3 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/Makefile.inc | 4 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/SYS.h | 48 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/bcmp.S | 78 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/bcopy.S | 92 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/bzero.S | 35 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/ffs.S | 17 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/htonl.S | 19 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/htons.S | 15 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/strcmp.S | 26 | ||||
-rw-r--r-- | sys/lib/libkern/arch/mips/strlen.S | 15 |
11 files changed, 351 insertions, 1 deletions
diff --git a/sys/lib/libkern/arch/mips/DEFS.h b/sys/lib/libkern/arch/mips/DEFS.h new file mode 100644 index 00000000000..e921ff5c3eb --- /dev/null +++ b/sys/lib/libkern/arch/mips/DEFS.h @@ -0,0 +1,3 @@ +/* $Id: DEFS.h,v 1.1 1995/11/06 21:15:52 deraadt Exp $ */ + +#include <machine/asm.h> diff --git a/sys/lib/libkern/arch/mips/Makefile.inc b/sys/lib/libkern/arch/mips/Makefile.inc index 9c012389cd4..950464fd39b 100644 --- a/sys/lib/libkern/arch/mips/Makefile.inc +++ b/sys/lib/libkern/arch/mips/Makefile.inc @@ -2,5 +2,7 @@ # # There are likely more that we will notice when we go native -SRCS+= random.c scanc.c skpc.c strcat.c strcpy.c strncmp.c strncpy.c +SRCS+= __main.c imax.c imin.c lmax.c lmin.c max.c min.c ulmax.c ulmin.c \ + bcmp.S bzero.S strcat.c strcmp.c strcpy.c ffs.S strlen.S strncmp.c \ + random.c scanc.c skpc.c strcat.c strcpy.c strncmp.c strncpy.c diff --git a/sys/lib/libkern/arch/mips/SYS.h b/sys/lib/libkern/arch/mips/SYS.h new file mode 100644 index 00000000000..349bf5c8454 --- /dev/null +++ b/sys/lib/libkern/arch/mips/SYS.h @@ -0,0 +1,48 @@ +/*- + * Copyright (c) 1990 The Regents of the University of California. + * All rights reserved. + * + * This code is derived from software contributed to Berkeley by + * William Jolitz. + * + * 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. + * + * from: @(#)SYS.h 5.5 (Berkeley) 5/7/91 + * $Id: SYS.h,v 1.1 1995/11/06 21:15:54 deraadt Exp $ + */ + +#include <machine/asm.h> +#include <sys/syscall.h> + +#define SYSCALL(x) .text; .align 2; 2: jmp PIC_PLT(cerror); ENTRY(x); movl $(SYS_/**/x),%eax; int $0x80; jc 2b +#define RSYSCALL(x) SYSCALL(x); ret +#define PSEUDO(x,y) ENTRY(x); movl $(SYS_/**/y),%eax; int $0x80; ret +#define CALL(x,y) call PIC_PLT(_/**/y); addl $4*x,%esp + + .globl cerror diff --git a/sys/lib/libkern/arch/mips/bcmp.S b/sys/lib/libkern/arch/mips/bcmp.S new file mode 100644 index 00000000000..6b1c923d206 --- /dev/null +++ b/sys/lib/libkern/arch/mips/bcmp.S @@ -0,0 +1,78 @@ +#include "DEFS.h" + +/* + * bcmp(s1, s2, n) + */ +LEAF(bcmp) + blt a2, 16, smallcmp # is it worth any trouble? + xor v0, a0, a1 # compare low two bits of addresses + and v0, v0, 3 + subu a3, zero, a1 # compute # bytes to word align address + bne v0, zero, unalignedcmp # not possible to align addresses + and a3, a3, 3 + + beq a3, zero, 1f + subu a2, a2, a3 # subtract from remaining count + move v0, v1 # init v0,v1 so unmodified bytes match + lwr v0, 0(a0) # read 1, 2, or 3 bytes + lwr v1, 0(a1) + addu a1, a1, a3 + bne v0, v1, nomatch + addu a0, a0, a3 +1: + and a3, a2, ~3 # compute number of whole words left + subu a2, a2, a3 # which has to be >= (16-3) & ~3 + addu a3, a3, a0 # compute ending address +2: + lw v0, 0(a0) # compare words + lw v1, 0(a1) + addu a0, a0, 4 + bne v0, v1, nomatch + addu a1, a1, 4 + bne a0, a3, 2b + nop + b smallcmp # finish remainder + nop +unalignedcmp: + beq a3, zero, 2f + subu a2, a2, a3 # subtract from remaining count + addu a3, a3, a0 # compute ending address +1: + lbu v0, 0(a0) # compare bytes until a1 word aligned + lbu v1, 0(a1) + addu a0, a0, 1 + bne v0, v1, nomatch + addu a1, a1, 1 + bne a0, a3, 1b + nop +2: + and a3, a2, ~3 # compute number of whole words left + subu a2, a2, a3 # which has to be >= (16-3) & ~3 + addu a3, a3, a0 # compute ending address +3: + lwr v0, 0(a0) # compare words a0 unaligned, a1 aligned + lwl v0, 3(a0) + lw v1, 0(a1) + addu a0, a0, 4 + bne v0, v1, nomatch + addu a1, a1, 4 + bne a0, a3, 3b + nop +smallcmp: + ble a2, zero, match + addu a3, a2, a0 # compute ending address +1: + lbu v0, 0(a0) + lbu v1, 0(a1) + addu a0, a0, 1 + bne v0, v1, nomatch + addu a1, a1, 1 + bne a0, a3, 1b + nop +match: + j ra + move v0, zero +nomatch: + j ra + li v0, 1 +END(bcmp) diff --git a/sys/lib/libkern/arch/mips/bcopy.S b/sys/lib/libkern/arch/mips/bcopy.S new file mode 100644 index 00000000000..bb47ae3c6bf --- /dev/null +++ b/sys/lib/libkern/arch/mips/bcopy.S @@ -0,0 +1,92 @@ +#include "DEFS.h" + +/* + * memcpy(to, from, len) + * {ov}bcopy(from, to, len) + */ +LEAF(memcpy) + move v0, a0 # swap from and to + move a0, a1 + move a1, v0 +ALEAF(bcopy) +ALEAF(ovbcopy) + addu t0, a0, a2 # t0 = end of s1 region + sltu t1, a1, t0 + sltu t2, a0, a1 + and t1, t1, t2 # t1 = true if from < to < (from+len) + beq t1, zero, forward # non overlapping, do forward copy + slt t2, a2, 12 # check for small copy + + ble a2, zero, 2f + addu t1, a1, a2 # t1 = end of to region +1: + lb v1, -1(t0) # copy bytes backwards, + subu t0, t0, 1 # doesnt happen often so do slow way + subu t1, t1, 1 + bne t0, a0, 1b + sb v1, 0(t1) +2: + j ra + nop +forward: + bne t2, zero, smallcpy # do a small bcopy + xor v1, a0, a1 # compare low two bits of addresses + and v1, v1, 3 + subu a3, zero, a1 # compute # bytes to word align address + beq v1, zero, aligned # addresses can be word aligned + and a3, a3, 3 + + beq a3, zero, 1f + subu a2, a2, a3 # subtract from remaining count + lwr v1, 0(a0) # get next 4 bytes (unaligned) + lwl v1, 3(a0) + addu a0, a0, a3 + swr v1, 0(a1) # store 1, 2, or 3 bytes to align a1 + addu a1, a1, a3 +1: + and v1, a2, 3 # compute number of words left + subu a3, a2, v1 + move a2, v1 + addu a3, a3, a0 # compute ending address +2: + lwr v1, 0(a0) # copy words a0 unaligned, a1 aligned + lwl v1, 3(a0) + addu a0, a0, 4 + sw v1, 0(a1) + addu a1, a1, 4 + bne a0, a3, 2b + nop # We have to do this mmu-bug. + b smallcpy + nop +aligned: + beq a3, zero, 1f + subu a2, a2, a3 # subtract from remaining count + lwr v1, 0(a0) # copy 1, 2, or 3 bytes to align + addu a0, a0, a3 + swr v1, 0(a1) + addu a1, a1, a3 +1: + and v1, a2, 3 # compute number of whole words left + subu a3, a2, v1 + move a2, v1 + addu a3, a3, a0 # compute ending address +2: + lw v1, 0(a0) # copy words + addu a0, a0, 4 + sw v1, 0(a1) + bne a0, a3, 2b + addu a1, a1, 4 +smallcpy: + ble a2, zero, 2f + addu a3, a2, a0 # compute ending address +1: + lbu v1, 0(a0) # copy bytes + addu a0, a0, 1 + sb v1, 0(a1) + addu a1, a1, 1 + bne a0, a3, 1b + nop # MMU BUG ? (cant do -1(a1) !! +2: + j ra + nop +END(memcpy) diff --git a/sys/lib/libkern/arch/mips/bzero.S b/sys/lib/libkern/arch/mips/bzero.S new file mode 100644 index 00000000000..07fae64f768 --- /dev/null +++ b/sys/lib/libkern/arch/mips/bzero.S @@ -0,0 +1,35 @@ +#include "DEFS.h" + +/* + * bzero(s1, n) + */ +LEAF(bzero) +ALEAF(blkclr) + blt a1, 12, smallclr # small amount to clear? + subu a3, zero, a0 # compute # bytes to word align address + and a3, a3, 3 + beq a3, zero, 1f # skip if word aligned + subu a1, a1, a3 # subtract from remaining count + swr zero, 0(a0) # clear 1, 2, or 3 bytes to align + addu a0, a0, a3 +1: + and v0, a1, 3 # compute number of words left + subu a3, a1, v0 + move a1, v0 + addu a3, a3, a0 # compute ending address +2: + addu a0, a0, 4 # clear words + bne a0, a3, 2b # unrolling loop does not help + sw zero, -4(a0) # since we are limited by memory speed +smallclr: + ble a1, zero, 2f + addu a3, a1, a0 # compute ending address +1: + addu a0, a0, 1 # clear bytes + bne a0, a3, 1b + sb zero, -1(a0) +2: + j ra + nop +END(bzero) + diff --git a/sys/lib/libkern/arch/mips/ffs.S b/sys/lib/libkern/arch/mips/ffs.S new file mode 100644 index 00000000000..eeef787391a --- /dev/null +++ b/sys/lib/libkern/arch/mips/ffs.S @@ -0,0 +1,17 @@ +#include "DEFS.h" + +/* + * bit = ffs(value) + */ +LEAF(ffs) + beq a0, zero, 2f + move v0, zero +1: + and v1, a0, 1 # bit set? + addu v0, v0, 1 + beq v1, zero, 1b # no, continue + srl a0, a0, 1 +2: + j ra + nop +END(ffs) diff --git a/sys/lib/libkern/arch/mips/htonl.S b/sys/lib/libkern/arch/mips/htonl.S new file mode 100644 index 00000000000..61b6edea740 --- /dev/null +++ b/sys/lib/libkern/arch/mips/htonl.S @@ -0,0 +1,19 @@ +#include "DEFS.h" + +/* + * netorder = htonl(hostorder) + * hostorder = ntohl(netorder) + */ +LEAF(htonl) # a0 = 0x11223344, return 0x44332211 +ALEAF(ntohl) + srl v1, a0, 24 # v1 = 0x00000011 + sll v0, a0, 24 # v0 = 0x44000000 + or v0, v0, v1 + and v1, a0, 0xff00 + sll v1, v1, 8 # v1 = 0x00330000 + or v0, v0, v1 + srl v1, a0, 8 + and v1, v1, 0xff00 # v1 = 0x00002200 + j ra + or v0, v0, v1 +END(htonl) diff --git a/sys/lib/libkern/arch/mips/htons.S b/sys/lib/libkern/arch/mips/htons.S new file mode 100644 index 00000000000..710e182d34e --- /dev/null +++ b/sys/lib/libkern/arch/mips/htons.S @@ -0,0 +1,15 @@ +#include "DEFS.h" + +/* + * netorder = htons(hostorder) + * hostorder = ntohs(netorder) + */ +LEAF(htons) +ALEAF(ntohs) + srl v0, a0, 8 + and v0, v0, 0xff + sll v1, a0, 8 + and v1, v1, 0xff00 + j ra + or v0, v0, v1 +END(htons) diff --git a/sys/lib/libkern/arch/mips/strcmp.S b/sys/lib/libkern/arch/mips/strcmp.S new file mode 100644 index 00000000000..8a2d4315b4a --- /dev/null +++ b/sys/lib/libkern/arch/mips/strcmp.S @@ -0,0 +1,26 @@ +#include "DEFS.h" + +/* + * NOTE: this version assumes unsigned chars in order to be "8 bit clean". + */ +LEAF(strcmp) +1: + lbu t0, 0(a0) # get two bytes and compare them + lbu t1, 0(a1) + beq t0, zero, LessOrEq # end of first string? + nop + bne t0, t1, NotEq + nop + lbu t0, 1(a0) # unroll loop + lbu t1, 1(a1) + beq t0, zero, LessOrEq # end of first string? + addu a0, a0, 2 + beq t0, t1, 1b + addu a1, a1, 2 +NotEq: + j ra + subu v0, t0, t1 +LessOrEq: + j ra + subu v0, zero, t1 +END(strcmp) diff --git a/sys/lib/libkern/arch/mips/strlen.S b/sys/lib/libkern/arch/mips/strlen.S new file mode 100644 index 00000000000..5c72b6bfaf1 --- /dev/null +++ b/sys/lib/libkern/arch/mips/strlen.S @@ -0,0 +1,15 @@ +#include "DEFS.h" + +/* + * strlen(str) + */ +LEAF(strlen) + addu v1, a0, 1 +1: + lb v0, 0(a0) # get byte from string + addu a0, a0, 1 # increment pointer + bne v0, zero, 1b # continue if not end + nop + j ra + subu v0, a0, v1 # compute length - 1 for '\0' char +END(strlen) |