1993-03-21 12:45:37 +03:00
|
|
|
.\" Copyright (c) 1990, 1991 The Regents of the University of California.
|
|
|
|
|
.\" All rights reserved.
|
|
|
|
|
.\"
|
|
|
|
|
.\" This code is derived from software contributed to Berkeley by
|
|
|
|
|
.\" Chris Torek.
|
|
|
|
|
.\" Redistribution and use in source and binary forms, with or without
|
|
|
|
|
.\" modification, are permitted provided that the following conditions
|
|
|
|
|
.\" are met:
|
|
|
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
.\" notice, this list of conditions and the following disclaimer.
|
|
|
|
|
.\" 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
.\" notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
.\" documentation and/or other materials provided with the distribution.
|
|
|
|
|
.\" 3. All advertising materials mentioning features or use of this software
|
|
|
|
|
.\" must display the following acknowledgement:
|
|
|
|
|
.\" This product includes software developed by the University of
|
|
|
|
|
.\" California, Berkeley and its contributors.
|
|
|
|
|
.\" 4. Neither the name of the University nor the names of its contributors
|
|
|
|
|
.\" may be used to endorse or promote products derived from this software
|
|
|
|
|
.\" without specific prior written permission.
|
|
|
|
|
.\"
|
|
|
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
.\" SUCH DAMAGE.
|
|
|
|
|
.\"
|
1993-08-01 11:42:49 +04:00
|
|
|
.\" from: @(#)strsep.3 5.3 (Berkeley) 4/19/91
|
1994-01-11 02:58:48 +03:00
|
|
|
.\" $Id: strsep.3,v 1.3 1994/01/10 23:59:03 jtc Exp $
|
1993-03-21 12:45:37 +03:00
|
|
|
.\"
|
|
|
|
|
.Dd April 19, 1991
|
|
|
|
|
.Dt STRSEP 3
|
|
|
|
|
.Os
|
|
|
|
|
.Sh NAME
|
|
|
|
|
.Nm strsep
|
|
|
|
|
.Nd separate strings
|
|
|
|
|
.Sh SYNOPSIS
|
|
|
|
|
.Fd #include <string.h>
|
|
|
|
|
.Ft char *
|
|
|
|
|
.Fn strsep "char **stringp" "char *delim"
|
|
|
|
|
.Sh DESCRIPTION
|
|
|
|
|
The
|
|
|
|
|
.Fn strsep
|
|
|
|
|
locates in the null-terminated string at
|
|
|
|
|
.Fa *stringp
|
1994-01-11 02:58:48 +03:00
|
|
|
the first occurrence of any character in
|
1993-03-21 12:45:37 +03:00
|
|
|
.Fa delim
|
|
|
|
|
and replaces this with a
|
|
|
|
|
.Ql \e0 ,
|
|
|
|
|
records the location of the immediate following character in
|
|
|
|
|
.Fa *stringp ,
|
|
|
|
|
then returns the original value of
|
|
|
|
|
.Fa *stringp .
|
|
|
|
|
If no delimiter characters are found,
|
|
|
|
|
.Fn strsep
|
|
|
|
|
sets
|
|
|
|
|
.Fa *stringp
|
|
|
|
|
to
|
|
|
|
|
.Dv NULL ;
|
|
|
|
|
if
|
|
|
|
|
.Fa *stringp
|
|
|
|
|
is initially
|
|
|
|
|
.Dv NULL ,
|
|
|
|
|
.Fn strsep
|
|
|
|
|
returns
|
|
|
|
|
.Dv NULL .
|
|
|
|
|
.Sh EXAMPLES
|
|
|
|
|
The following uses
|
|
|
|
|
.Fn strsep
|
|
|
|
|
to parse strings containing runs of white space,
|
|
|
|
|
making up an argument vector:
|
|
|
|
|
.Bd -literal -offset indent
|
|
|
|
|
char inputstring[100];
|
|
|
|
|
char **argv[51], **ap = argv, *p, *val;
|
|
|
|
|
/* set up inputstring */
|
|
|
|
|
for (p = inputstring; p != NULL; ) {
|
|
|
|
|
while ((val = strsep(&p, " \et")) != NULL && *val == '\e0');
|
|
|
|
|
*ap++ = val;
|
|
|
|
|
}
|
|
|
|
|
*ap = 0;
|
|
|
|
|
.Ed
|
|
|
|
|
.Sh HISTORY
|
|
|
|
|
The
|
|
|
|
|
.Fn strsep
|
|
|
|
|
function is
|
|
|
|
|
.Ud .
|
