* Copyright (c) 1983 Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* Edward Wang at The University of California, Berkeley.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 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
static char sccsid
[] = "@(#)string.c 3.13 (Berkeley) 6/6/90";
str
= p
= str_alloc(strlen(s
) + 1);
str
= p
= str_alloc(n
+ 1);
(void) sprintf(buf
, "%d", i
);
str
= p
= str_alloc(strlen(s1
) + strlen(s2
) + 1);
for (q
= s1
; *p
++ = *q
++;)
for (q
= s2
, p
--; *p
++ = *q
++;)
* s can be a prefix of p with at least min characters.
for (; *s
&& *p
&& *s
== *p
; s
++, p
++, min
--)
return *s
== *p
|| *s
== 0 && min
<= 0;
register struct string
*s
;
s
= (struct string
*) malloc((unsigned)l
+ str_offset
);
if (str_head
.s_forw
== 0)
str_head
.s_forw
= str_head
.s_back
= &str_head
;
s
->s_forw
= str_head
.s_forw
;
register struct string
*s
;
for (s
= str_head
.s_forw
; s
!= &str_head
&& s
->s_data
!= str
;
s
->s_back
->s_forw
= s
->s_forw
;
s
->s_forw
->s_back
= s
->s_back
;