str.c revision 1.1 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1991 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)str.c 5.5 (Berkeley) 6/27/91";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd /*
39 1.1 cgd * tc.str.c: Short string package
40 1.1 cgd * This has been a lesson of how to write buggy code!
41 1.1 cgd */
42 1.1 cgd #ifdef SHORT_STRINGS
43 1.1 cgd
44 1.1 cgd #if __STDC__
45 1.1 cgd # include <stdarg.h>
46 1.1 cgd #else
47 1.1 cgd # include <varargs.h>
48 1.1 cgd #endif
49 1.1 cgd
50 1.1 cgd #include "csh.h"
51 1.1 cgd #include "extern.h"
52 1.1 cgd
53 1.1 cgd Char **
54 1.1 cgd blk2short(src)
55 1.1 cgd register char **src;
56 1.1 cgd {
57 1.1 cgd size_t n;
58 1.1 cgd register Char **sdst, **dst;
59 1.1 cgd
60 1.1 cgd /*
61 1.1 cgd * Count
62 1.1 cgd */
63 1.1 cgd for (n = 0; src[n] != NULL; n++);
64 1.1 cgd sdst = dst = (Char **) xmalloc((size_t) ((n + 1) * sizeof(Char *)));
65 1.1 cgd
66 1.1 cgd for (; *src != NULL; src++)
67 1.1 cgd *dst++ = SAVE(*src);
68 1.1 cgd *dst = NULL;
69 1.1 cgd return (sdst);
70 1.1 cgd }
71 1.1 cgd
72 1.1 cgd char **
73 1.1 cgd short2blk(src)
74 1.1 cgd register Char **src;
75 1.1 cgd {
76 1.1 cgd size_t n;
77 1.1 cgd register char **sdst, **dst;
78 1.1 cgd
79 1.1 cgd /*
80 1.1 cgd * Count
81 1.1 cgd */
82 1.1 cgd for (n = 0; src[n] != NULL; n++);
83 1.1 cgd sdst = dst = (char **) xmalloc((size_t) ((n + 1) * sizeof(char *)));
84 1.1 cgd
85 1.1 cgd for (; *src != NULL; src++)
86 1.1 cgd *dst++ = strsave(short2str(*src));
87 1.1 cgd *dst = NULL;
88 1.1 cgd return (sdst);
89 1.1 cgd }
90 1.1 cgd
91 1.1 cgd #define MALLOC_INCR 1024
92 1.1 cgd Char *
93 1.1 cgd str2short(src)
94 1.1 cgd register char *src;
95 1.1 cgd {
96 1.1 cgd static Char *sdst;
97 1.1 cgd static size_t dstsize = 0;
98 1.1 cgd register Char *dst, *edst;
99 1.1 cgd
100 1.1 cgd if (src == NULL)
101 1.1 cgd return (NULL);
102 1.1 cgd
103 1.1 cgd if (sdst == (NULL)) {
104 1.1 cgd dstsize = MALLOC_INCR;
105 1.1 cgd sdst = (Char *) xmalloc((size_t) dstsize * sizeof(Char));
106 1.1 cgd }
107 1.1 cgd
108 1.1 cgd dst = sdst;
109 1.1 cgd edst = &dst[dstsize];
110 1.1 cgd while (*src) {
111 1.1 cgd *dst++ = (Char) ((unsigned char) *src++);
112 1.1 cgd if (dst == edst) {
113 1.1 cgd dstsize += MALLOC_INCR;
114 1.1 cgd sdst = (Char *) xrealloc((ptr_t) sdst,
115 1.1 cgd (size_t) dstsize * sizeof(Char));
116 1.1 cgd edst = &sdst[dstsize];
117 1.1 cgd dst = &edst[-MALLOC_INCR];
118 1.1 cgd }
119 1.1 cgd }
120 1.1 cgd *dst = 0;
121 1.1 cgd return (sdst);
122 1.1 cgd }
123 1.1 cgd
124 1.1 cgd char *
125 1.1 cgd short2qstr(src)
126 1.1 cgd register Char *src;
127 1.1 cgd {
128 1.1 cgd static char *sdst = NULL;
129 1.1 cgd static size_t dstsize = 0;
130 1.1 cgd register char *dst, *edst;
131 1.1 cgd
132 1.1 cgd if (src == NULL)
133 1.1 cgd return (NULL);
134 1.1 cgd
135 1.1 cgd if (sdst == NULL) {
136 1.1 cgd dstsize = MALLOC_INCR;
137 1.1 cgd sdst = (char *) xmalloc((size_t) dstsize * sizeof(char));
138 1.1 cgd }
139 1.1 cgd dst = sdst;
140 1.1 cgd edst = &dst[dstsize];
141 1.1 cgd while (*src) {
142 1.1 cgd if (*src & QUOTE) {
143 1.1 cgd *dst++ = '\\';
144 1.1 cgd if (dst == edst) {
145 1.1 cgd dstsize += MALLOC_INCR;
146 1.1 cgd sdst = (char *) xrealloc((ptr_t) sdst,
147 1.1 cgd (size_t) dstsize * sizeof(char));
148 1.1 cgd edst = &sdst[dstsize];
149 1.1 cgd dst = &edst[-MALLOC_INCR];
150 1.1 cgd }
151 1.1 cgd }
152 1.1 cgd *dst++ = (char) *src++;
153 1.1 cgd if (dst == edst) {
154 1.1 cgd dstsize += MALLOC_INCR;
155 1.1 cgd sdst = (char *) xrealloc((ptr_t) sdst,
156 1.1 cgd (size_t) dstsize * sizeof(char));
157 1.1 cgd edst = &sdst[dstsize];
158 1.1 cgd dst = &edst[-MALLOC_INCR];
159 1.1 cgd }
160 1.1 cgd }
161 1.1 cgd *dst = 0;
162 1.1 cgd return (sdst);
163 1.1 cgd }
164 1.1 cgd char *
165 1.1 cgd short2str(src)
166 1.1 cgd register Char *src;
167 1.1 cgd {
168 1.1 cgd static char *sdst = NULL;
169 1.1 cgd static size_t dstsize = 0;
170 1.1 cgd register char *dst, *edst;
171 1.1 cgd
172 1.1 cgd if (src == NULL)
173 1.1 cgd return (NULL);
174 1.1 cgd
175 1.1 cgd if (sdst == NULL) {
176 1.1 cgd dstsize = MALLOC_INCR;
177 1.1 cgd sdst = (char *) xmalloc((size_t) dstsize * sizeof(char));
178 1.1 cgd }
179 1.1 cgd dst = sdst;
180 1.1 cgd edst = &dst[dstsize];
181 1.1 cgd while (*src) {
182 1.1 cgd *dst++ = (char) *src++;
183 1.1 cgd if (dst == edst) {
184 1.1 cgd dstsize += MALLOC_INCR;
185 1.1 cgd sdst = (char *) xrealloc((ptr_t) sdst,
186 1.1 cgd (size_t) dstsize * sizeof(char));
187 1.1 cgd edst = &sdst[dstsize];
188 1.1 cgd dst = &edst[-MALLOC_INCR];
189 1.1 cgd }
190 1.1 cgd }
191 1.1 cgd *dst = 0;
192 1.1 cgd return (sdst);
193 1.1 cgd }
194 1.1 cgd
195 1.1 cgd Char *
196 1.1 cgd s_strcpy(dst, src)
197 1.1 cgd register Char *dst, *src;
198 1.1 cgd {
199 1.1 cgd register Char *sdst;
200 1.1 cgd
201 1.1 cgd sdst = dst;
202 1.1 cgd while (*dst++ = *src++);
203 1.1 cgd return (sdst);
204 1.1 cgd }
205 1.1 cgd
206 1.1 cgd Char *
207 1.1 cgd s_strncpy(dst, src, n)
208 1.1 cgd register Char *dst, *src;
209 1.1 cgd register size_t n;
210 1.1 cgd {
211 1.1 cgd register Char *sdst;
212 1.1 cgd
213 1.1 cgd if (n == 0)
214 1.1 cgd return(dst);
215 1.1 cgd
216 1.1 cgd sdst = dst;
217 1.1 cgd do
218 1.1 cgd if ((*dst++ = *src++) == '\0') {
219 1.1 cgd while (--n != 0)
220 1.1 cgd *dst++ = '\0';
221 1.1 cgd return(sdst);
222 1.1 cgd }
223 1.1 cgd while (--n != 0);
224 1.1 cgd return (sdst);
225 1.1 cgd }
226 1.1 cgd
227 1.1 cgd Char *
228 1.1 cgd s_strcat(dst, src)
229 1.1 cgd register Char *dst, *src;
230 1.1 cgd {
231 1.1 cgd register short *sdst;
232 1.1 cgd
233 1.1 cgd sdst = dst;
234 1.1 cgd while (*dst++);
235 1.1 cgd --dst;
236 1.1 cgd while (*dst++ = *src++);
237 1.1 cgd return (sdst);
238 1.1 cgd }
239 1.1 cgd
240 1.1 cgd #ifdef NOTUSED
241 1.1 cgd Char *
242 1.1 cgd s_strncat(dst, src, n)
243 1.1 cgd register Char *dst, *src;
244 1.1 cgd register size_t n;
245 1.1 cgd {
246 1.1 cgd register Char *sdst;
247 1.1 cgd
248 1.1 cgd if (n == 0)
249 1.1 cgd return (dst);
250 1.1 cgd
251 1.1 cgd sdst = dst;
252 1.1 cgd
253 1.1 cgd while (*dst++);
254 1.1 cgd --dst;
255 1.1 cgd
256 1.1 cgd do
257 1.1 cgd if ((*dst++ = *src++) == '\0')
258 1.1 cgd return(sdst);
259 1.1 cgd while (--n != 0);
260 1.1 cgd
261 1.1 cgd *dst = '\0';
262 1.1 cgd return (sdst);
263 1.1 cgd }
264 1.1 cgd
265 1.1 cgd #endif
266 1.1 cgd
267 1.1 cgd Char *
268 1.1 cgd s_strchr(str, ch)
269 1.1 cgd register Char *str;
270 1.1 cgd int ch;
271 1.1 cgd {
272 1.1 cgd do
273 1.1 cgd if (*str == ch)
274 1.1 cgd return (str);
275 1.1 cgd while (*str++);
276 1.1 cgd return (NULL);
277 1.1 cgd }
278 1.1 cgd
279 1.1 cgd Char *
280 1.1 cgd s_strrchr(str, ch)
281 1.1 cgd register Char *str;
282 1.1 cgd int ch;
283 1.1 cgd {
284 1.1 cgd register Char *rstr;
285 1.1 cgd
286 1.1 cgd rstr = NULL;
287 1.1 cgd do
288 1.1 cgd if (*str == ch)
289 1.1 cgd rstr = str;
290 1.1 cgd while (*str++);
291 1.1 cgd return (rstr);
292 1.1 cgd }
293 1.1 cgd
294 1.1 cgd size_t
295 1.1 cgd s_strlen(str)
296 1.1 cgd register Char *str;
297 1.1 cgd {
298 1.1 cgd register size_t n;
299 1.1 cgd
300 1.1 cgd for (n = 0; *str++; n++);
301 1.1 cgd return (n);
302 1.1 cgd }
303 1.1 cgd
304 1.1 cgd int
305 1.1 cgd s_strcmp(str1, str2)
306 1.1 cgd register Char *str1, *str2;
307 1.1 cgd {
308 1.1 cgd for (; *str1 && *str1 == *str2; str1++, str2++);
309 1.1 cgd /*
310 1.1 cgd * The following case analysis is necessary so that characters which look
311 1.1 cgd * negative collate low against normal characters but high against the
312 1.1 cgd * end-of-string NUL.
313 1.1 cgd */
314 1.1 cgd if (*str1 == '\0' && *str2 == '\0')
315 1.1 cgd return (0);
316 1.1 cgd else if (*str1 == '\0')
317 1.1 cgd return (-1);
318 1.1 cgd else if (*str2 == '\0')
319 1.1 cgd return (1);
320 1.1 cgd else
321 1.1 cgd return (*str1 - *str2);
322 1.1 cgd }
323 1.1 cgd
324 1.1 cgd int
325 1.1 cgd s_strncmp(str1, str2, n)
326 1.1 cgd register Char *str1, *str2;
327 1.1 cgd register size_t n;
328 1.1 cgd {
329 1.1 cgd if (n == 0)
330 1.1 cgd return (0);
331 1.1 cgd do {
332 1.1 cgd if (*str1 == '\0' || *str1 != *str2)
333 1.1 cgd break;
334 1.1 cgd str1++, str2++;
335 1.1 cgd } while (--n != 0);
336 1.1 cgd /*
337 1.1 cgd * The following case analysis is necessary so that characters which look
338 1.1 cgd * negative collate low against normal characters but high against the
339 1.1 cgd * end-of-string NUL.
340 1.1 cgd */
341 1.1 cgd if (*str1 == '\0' && *str2 == '\0')
342 1.1 cgd return (0);
343 1.1 cgd else if (*str1 == '\0')
344 1.1 cgd return (-1);
345 1.1 cgd else if (*str2 == '\0')
346 1.1 cgd return (1);
347 1.1 cgd else
348 1.1 cgd return (*str1 - *str2);
349 1.1 cgd return(0);
350 1.1 cgd }
351 1.1 cgd
352 1.1 cgd Char *
353 1.1 cgd s_strsave(s)
354 1.1 cgd register Char *s;
355 1.1 cgd {
356 1.1 cgd Char *n;
357 1.1 cgd register Char *p;
358 1.1 cgd
359 1.1 cgd if (s == 0)
360 1.1 cgd s = STRNULL;
361 1.1 cgd for (p = s; *p++;);
362 1.1 cgd n = p = (Char *) xmalloc((size_t) ((p - s) * sizeof(Char)));
363 1.1 cgd while (*p++ = *s++);
364 1.1 cgd return (n);
365 1.1 cgd }
366 1.1 cgd
367 1.1 cgd Char *
368 1.1 cgd s_strspl(cp, dp)
369 1.1 cgd Char *cp, *dp;
370 1.1 cgd {
371 1.1 cgd Char *ep;
372 1.1 cgd register Char *p, *q;
373 1.1 cgd
374 1.1 cgd if (!cp)
375 1.1 cgd cp = STRNULL;
376 1.1 cgd if (!dp)
377 1.1 cgd dp = STRNULL;
378 1.1 cgd for (p = cp; *p++;);
379 1.1 cgd for (q = dp; *q++;);
380 1.1 cgd ep = (Char *) xmalloc((size_t)
381 1.1 cgd (((p - cp) + (q - dp) - 1) * sizeof(Char)));
382 1.1 cgd for (p = ep, q = cp; *p++ = *q++;);
383 1.1 cgd for (p--, q = dp; *p++ = *q++;);
384 1.1 cgd return (ep);
385 1.1 cgd }
386 1.1 cgd
387 1.1 cgd Char *
388 1.1 cgd s_strend(cp)
389 1.1 cgd register Char *cp;
390 1.1 cgd {
391 1.1 cgd if (!cp)
392 1.1 cgd return (cp);
393 1.1 cgd while (*cp)
394 1.1 cgd cp++;
395 1.1 cgd return (cp);
396 1.1 cgd }
397 1.1 cgd
398 1.1 cgd #ifdef NOTUSED
399 1.1 cgd Char *
400 1.1 cgd s_strstr(s, t)
401 1.1 cgd register Char *s, *t;
402 1.1 cgd {
403 1.1 cgd do {
404 1.1 cgd register Char *ss = s;
405 1.1 cgd register Char *tt = t;
406 1.1 cgd
407 1.1 cgd do
408 1.1 cgd if (*tt == '\0')
409 1.1 cgd return (s);
410 1.1 cgd while (*ss++ == *tt++);
411 1.1 cgd } while (*s++ != '\0');
412 1.1 cgd return (NULL);
413 1.1 cgd }
414 1.1 cgd #endif
415 1.1 cgd
416 1.1 cgd #endif /* SHORT_STRINGS */
417