| 53 |
7u83 |
1 |
/*-
|
|
|
2 |
* SPDX-License-Identifier: BSD-3-Clause
|
|
|
3 |
*
|
|
|
4 |
* Copyright (c) 1990, 1993
|
|
|
5 |
* The Regents of the University of California. All rights reserved.
|
|
|
6 |
* Copyright (c) 2019
|
|
|
7 |
* The PLANIX Project. All rights reserved.
|
|
|
8 |
*
|
|
|
9 |
* Redistribution and use in source and binary forms, with or without
|
|
|
10 |
* modification, are permitted provided that the following conditions
|
|
|
11 |
* are met:
|
|
|
12 |
* 1. Redistributions of source code must retain the above copyright
|
|
|
13 |
* notice, this list of conditions and the following disclaimer.
|
|
|
14 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
15 |
* notice, this list of conditions and the following disclaimer in the
|
|
|
16 |
* documentation and/or other materials provided with the distribution.
|
|
|
17 |
* 3. 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.
|
|
|
20 |
*
|
|
|
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
|
|
|
31 |
* SUCH DAMAGE.
|
|
|
32 |
*/
|
|
|
33 |
|
|
|
34 |
|
|
|
35 |
#include <string.h>
|
|
|
36 |
#include <stdio.h>
|
|
|
37 |
|
|
|
38 |
/*
|
|
|
39 |
* Get next token from string *stringp, where tokens are possibly-empty
|
|
|
40 |
* strings separated by characters from delim.
|
|
|
41 |
*
|
|
|
42 |
* Writes NULs into the string at *stringp to end tokens.
|
|
|
43 |
* delim need not remain constant from call to call.
|
|
|
44 |
* On return, *stringp points past the last NUL written (if there might
|
|
|
45 |
* be further tokens), or is NULL (if there are definitely no more tokens).
|
|
|
46 |
*
|
|
|
47 |
* If *stringp is NULL, strsep returns NULL.
|
|
|
48 |
*/
|
|
|
49 |
char *
|
|
|
50 |
strsep(char **stringp, const char *delim)
|
|
|
51 |
{
|
|
|
52 |
char *s;
|
|
|
53 |
const char *spanp;
|
|
|
54 |
int c, sc;
|
|
|
55 |
char *tok;
|
|
|
56 |
|
|
|
57 |
if ((s = *stringp) == NULL)
|
|
|
58 |
return (NULL);
|
|
|
59 |
for (tok = s;;) {
|
|
|
60 |
c = *s++;
|
|
|
61 |
spanp = delim;
|
|
|
62 |
do {
|
|
|
63 |
if ((sc = *spanp++) == c) {
|
|
|
64 |
if (c == 0)
|
|
|
65 |
s = NULL;
|
|
|
66 |
else
|
|
|
67 |
s[-1] = 0;
|
|
|
68 |
*stringp = s;
|
|
|
69 |
return (tok);
|
|
|
70 |
}
|
|
|
71 |
} while (sc != 0);
|
|
|
72 |
}
|
|
|
73 |
/* NOTREACHED */
|
|
|
74 |
}
|