* Copyright (c) 1983 Regents of the University of California.
* 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.
#if defined(LIBC_SCCS) && !defined(lint)
.asciz "@(#)strcmp.s 5.5 (Berkeley) 6/27/88"
#endif /* LIBC_SCCS and not lint */
* Compare string s1 lexicographically to string s2.
subb3 (r3),(r1),r0 # quick check for first char different
beql 1f # have to keep checking
clrl r5 # calculate min bytes to next page boundry
subb3 r1,$255,r5 # r5 = (bytes - 1) to end of page for s1
subb3 r3,$255,r0 # r0 = (bytes - 1) to end of page for s2
cmpb r0,r5 # r5 = min(r0, r5);
incl r5 # r5 = min bytes to next page boundry
cmpc3 r5,(r1),(r3) # compare strings
subl2 r5,r1 # check if found null yet
beql 1b # not yet done, continue checking
mnegb (r3),r0 # r0 = '\0' - *s2
subl2 r0,r5 # check for null in matching string
subb3 (r3),(r1),r0 # r0 = *s1 - *s2
clrl r0 # both the same to null