1 /*
2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Edward Wang at The University of California, Berkeley.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37 #ifndef lint
38 static char sccsid[] = "@(#)string.c 8.1 (Berkeley) 6/6/93";
39 static char rcsid[] =
40 "$FreeBSD: head/usr.bin/window/string.c 188828 2009-02-19 20:07:59Z imp $";
41 #endif /* not lint */
42
43 #include <string.h> /* System string definitions. */
44 #include "mystring.h" /* Local string definitions. */
45 #include <stdio.h>
46 #include <stdlib.h>
47
48 struct mystring str_head;
49
50 char *
str_cpy(s)51 str_cpy(s)
52 register char *s;
53 {
54 char *str;
55 register char *p;
56
57 str = p = str_alloc(strlen(s) + 1);
58 if (p == 0)
59 return 0;
60 while (*p++ = *s++)
61 ;
62 return str;
63 }
64
65 char *
str_ncpy(s,n)66 str_ncpy(s, n)
67 register char *s;
68 register n;
69 {
70 int l = strlen(s);
71 char *str;
72 register char *p;
73
74 if (n > l)
75 n = l;
76 str = p = str_alloc(n + 1);
77 if (p == 0)
78 return 0;
79 while (--n >= 0)
80 *p++ = *s++;
81 *p = 0;
82 return str;
83 }
84
85 char *
str_itoa(i)86 str_itoa(i)
87 int i;
88 {
89 char buf[30];
90
91 (void) sprintf(buf, "%d", i);
92 return str_cpy(buf);
93 }
94
95 char *
str_cat(s1,s2)96 str_cat(s1, s2)
97 char *s1, *s2;
98 {
99 char *str;
100 register char *p, *q;
101
102 str = p = str_alloc(strlen(s1) + strlen(s2) + 1);
103 if (p == 0)
104 return 0;
105 for (q = s1; *p++ = *q++;)
106 ;
107 for (q = s2, p--; *p++ = *q++;)
108 ;
109 return str;
110 }
111
112 /*
113 * match s against p.
114 * s can be a prefix of p with at least min characters.
115 */
str_match(s,p,min)116 str_match(s, p, min)
117 register char *s, *p;
118 register min;
119 {
120 for (; *s && *p && *s == *p; s++, p++, min--)
121 ;
122 return *s == *p || *s == 0 && min <= 0;
123 }
124
125 #ifdef STR_DEBUG
126 char *
str_alloc(l)127 str_alloc(l)
128 int l;
129 {
130 register struct mystring *s;
131
132 s = (struct mystring *) malloc((unsigned)l + str_offset);
133 if (s == 0)
134 return 0;
135 if (str_head.s_forw == 0)
136 str_head.s_forw = str_head.s_back = &str_head;
137 s->s_forw = str_head.s_forw;
138 s->s_back = &str_head;
139 str_head.s_forw = s;
140 s->s_forw->s_back = s;
141 return s->s_data;
142 }
143
str_free(str)144 str_free(str)
145 char *str;
146 {
147 register struct mystring *s;
148
149 for (s = str_head.s_forw; s != &str_head && s->s_data != str;
150 s = s->s_forw)
151 ;
152 if (s == &str_head)
153 abort();
154 s->s_back->s_forw = s->s_forw;
155 s->s_forw->s_back = s->s_back;
156 free((char *)s);
157 }
158 #endif
159