2 * Copyright (c) 1990 The Regents of the University of California.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #if defined(LIBC_SCCS) && !defined(lint)
35 .asciz "@(#)strspn.s 5.1 (Berkeley) 5/15/90"
36 #endif /* LIBC_SCCS and not lint */
39 * Span the string s2 (skip characters that are in s2).
40 * Return the number of characters in s1 that were skipped.
44 * const char *s1, *s2;
49 subl2 $
32,sp
/* make 256 bit table */
50 movc5 $
0,(sp
),$
0,$
32,(sp
)
51 movq
4(ap
),r1 /* r1 = s1, r2 = s2 */
53 /* turn on bit for each character in s2, including '\0' */
59 /* now clear bit for '\0' */
60 /* (this is easier than avoiding setting it in the first place) */
61 bicb2 $
1,(sp
) /* stop at '\0' */
62 movl
r1,r0 /* r0 = s (current pos in s1) */
64 /* look for a character that is not in s2 */
66 movzbl
(r0)+,r2 /* c = *s++ */
67 bbs
r2,(sp
),2b /* loop while c is in table */
69 subl2
r1,r0 /* r0 = s - s1 = count */