* Copyright (c) 1988 Regents of the University of California.
* %sccs.include.redist.c%
#if defined(LIBC_SCCS) && !defined(lint)
.asciz "@(#)strchr.s 5.4 (Berkeley) %G%"
#endif /* LIBC_SCCS and not lint */
* Find the first occurence of c in the string cp.
* Return pointer to match or null pointer.
movzwl $65535,r4 /* handy constant */
movq 4(ap),r1 /* r1 = cp; r2 = c */
beql Lzero /* special case for c == '\0' */
* Fancy scanc version. Alas, it is not reentrant.
movab tbl,r3 /* r3 = base of table */
bbss $0,(r3),Lreent /* ensure not reentering */
incb (r5) /* mark both '\0' and c */
scanc r4,(r1),(r3),$1 /* look for c or '\0' */
beql 0b /* still looking */
movl r1,r0 /* return whatever we found */
bneq 1f # unless it was '\0':
clrl r0 # then return NULL
clrb (r5) /* clean up table */
locc r2,r4,(r1) /* just find end of string */
beql Lzero /* still looking */
movl r1,r0 /* found it */
* Slower reentrant version is two two-step searches. The first
* phase runs until we know where the string ends; it locates the
* first occurrence of c within a 65535-byte block. If we find
* the end of the string first, we switch to the second phase,
* were we look only up to the known end of string.
locc $0,r4,(r3) /* look for '\0' */
locc r2,r4,(r3) /* look for c */
beql 0b /* not found: reset pointer and loop */
movl r1,r0 /* found: return it */
subl3 r3,r1,r0 /* length of short block */
locc r2,r0,(r3) /* look for c */
beql 2f /* not found: return NULL */