|
|
1.1 root 1: /*-
2: * Copyright (c) 1990 The 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:
20: #if defined(LIBC_SCCS) && !defined(lint)
21: .asciz "@(#)strspn.s 5.1 (Berkeley) 5/15/90"
22: #endif /* LIBC_SCCS and not lint */
23:
24: /*
25: * Span the string s2 (skip characters that are in s2).
26: * Return the number of characters in s1 that were skipped.
27: *
28: * size_t
29: * strspn(s1, s2)
30: * const char *s1, *s2;
31: */
32: #include "DEFS.h"
33:
34: ENTRY(strspn, 0)
35: subl2 $32,sp /* make 256 bit table */
36: movc5 $0,(sp),$0,$32,(sp)
37: movq 4(ap),r1 /* r1 = s1, r2 = s2 */
38:
39: /* turn on bit for each character in s2, including '\0' */
40: 1:
41: movzbl (r2)+,r0
42: bbss r0,(sp),1b
43: bneq 1b
44:
45: /* now clear bit for '\0' */
46: /* (this is easier than avoiding setting it in the first place) */
47: bicb2 $1,(sp) /* stop at '\0' */
48: movl r1,r0 /* r0 = s (current pos in s1) */
49:
50: /* look for a character that is not in s2 */
51: 2:
52: movzbl (r0)+,r2 /* c = *s++ */
53: bbs r2,(sp),2b /* loop while c is in table */
54: decl r0 /* s-- */
55: subl2 r1,r0 /* r0 = s - s1 = count */
56: ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.