|
|
Initial revision
/* * Copyright (c) 1988 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that the above copyright notice and this paragraph are * duplicated in all such forms and that any documentation, * advertising materials, and other materials related to such * distribution and use acknowledge that the software was developed * by the University of California, Berkeley. The name of the * University may not be used to endorse or promote products derived * from this software without specific prior written permission. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. * * This code is derived from software contributed to Berkeley by * Computer Consoles Inc. */ #if defined(LIBC_SCCS) && !defined(lint) .asciz "@(#)strncmp.s 1.3 (Berkeley) 6/27/88" #endif /* LIBC_SCCS and not lint */ /* * Compare strings (at most n bytes): s1>s2: >0 s1==s2: 0 s1<s2: <0 * * strncmp(s1, s2, n) * register char *s1, *s2; * register n; */ #include "DEFS.h" ENTRY(strncmp, 0) movl 12(fp),r2 tstl r2 /* number of bytes to compare */ jgtr n_ok clrl r0 ret /* for n <= 0 , s1 == s2 */ n_ok: movl 4(fp),r0 movl 8(fp),r1 cmps3 jgtr greater jlss less equal: clrl r0 ret less: movl $-1,r0 ret greater: movl $1,r0 ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.