|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1988 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that: (1) source distributions retain this entire copyright ! 7: * notice and comment, and (2) distributions including binaries display ! 8: * the following acknowledgement: ``This product includes software ! 9: * developed by the University of California, Berkeley and its contributors'' ! 10: * in the documentation or other materials provided with the distribution ! 11: * and in all advertising materials mentioning features or use of this ! 12: * software. Neither the name of the University nor the names of its ! 13: * contributors may be used to endorse or promote products derived ! 14: * from this software without specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: * ! 19: * This code is derived from software contributed to Berkeley by ! 20: * Computer Consoles Inc. ! 21: */ ! 22: ! 23: #if defined(LIBC_SCCS) && !defined(lint) ! 24: .asciz "@(#)memcmp.s 5.2 (Berkeley) 6/1/90" ! 25: #endif /* LIBC_SCCS and not lint */ ! 26: ! 27: /* ! 28: * int ! 29: * memcmp(s1, s2, n) ! 30: * void const *s1, const *s2; ! 31: * size_t n; ! 32: * ! 33: * Compare up to n bytes from s1/s2. ! 34: * Return ! 35: * = 0 if s1 == s2 ! 36: * < 0 if s1 < s2 (unsigned character comparison) ! 37: * > 0 if s1 > s2 ! 38: */ ! 39: #include "DEFS.h" ! 40: ! 41: ENTRY(memcmp, 0) ! 42: movl 4(fp),r0 ! 43: movl 8(fp),r1 ! 44: mnegl 12(fp),r2 ! 45: jeql 2f ! 46: 1: ! 47: cmpb (r0),(r1) ! 48: jneq 3f ! 49: incl r0 ! 50: incl r1 ! 51: aoblss $0,r2,1b ! 52: 2: ! 53: clrl r0 ! 54: ret ! 55: 3: ! 56: jlssu 4f ! 57: movl $1,r0 ! 58: ret ! 59: 4: ! 60: mnegl $1,r0 ! 61: ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.