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 "@(#)strsep.s 5.1 (Berkeley) 5/15/90"
36 #endif /* LIBC_SCCS and not lint */
39 * Get next word from string *stringp, where words are
40 * strings separated by characters from delim.
42 * Writes NULs into the string at *stringp to end tokens.
43 * On return, *stringp points past the last NUL written (if there might
44 * be further tokens), or is NULL (if there are definitely no more tokens).
46 * If *stringp is NULL, strtoken returns NULL.
49 * strtoken(stringp, delim)
50 * register char **stringp;
51 * register char const *delim;
56 tstl
*4(ap
) /* if (*stringp == NULL) */
58 clrl
r0 # return (NULL);
62 subl2 $
32,sp
/* make room for 256 bit table */
63 movc5 $
0,(sp
),$
0,$
32,(sp
)
64 movq
4(ap
),r1 /* r1 = stringp, r2 = delim */
66 /* turn on bit for each character in s2, including '\0' */
72 movl
(r1),r3 /* r3 = s = *stringp */
73 movl
r3,r0 /* save return value */
75 /* scan for delimiters */
77 movzbl
(r3)+,r2 /* c = *s++ */
78 bbc
r2,(sp
),2b /* loop until c is in table */
80 clrb
-1(r3) /* if c!='\0', s[-1] = 0 */
81 movl
r3,(r1) /* and *stringp = s */
84 clrl
(r1) /* else *stringp = NULL */