str.c revision 1.3 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.3 cgd static char rcsid[] = "$Header: /tank/opengrok/rsync2/NetBSD/src/bin/csh/str.c,v 1.3 1993/03/23 00:25:25 cgd Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd /*
40 1.1 cgd * tc.str.c: Short string package
41 1.1 cgd * This has been a lesson of how to write buggy code!
42 1.1 cgd */
43 1.1 cgd #ifdef SHORT_STRINGS
44 1.1 cgd
45 1.1 cgd #if __STDC__
46 1.1 cgd # include <stdarg.h>
47 1.1 cgd #else
48 1.1 cgd # include <varargs.h>
49 1.1 cgd #endif
50 1.1 cgd
51 1.1 cgd #include "csh.h"
52 1.1 cgd #include "extern.h"
53 1.1 cgd
54 1.1 cgd Char **
55 1.1 cgd blk2short(src)
56 1.1 cgd register char **src;
57 1.1 cgd {
58 1.1 cgd size_t n;
59 1.1 cgd register Char **sdst, **dst;
60 1.1 cgd
61 1.1 cgd /*
62 1.1 cgd * Count
63 1.1 cgd */
64 1.1 cgd for (n = 0; src[n] != NULL; n++);
65 1.1 cgd sdst = dst = (Char **) xmalloc((size_t) ((n + 1) * sizeof(Char *)));
66 1.1 cgd
67 1.1 cgd for (; *src != NULL; src++)
68 1.1 cgd *dst++ = SAVE(*src);
69 1.1 cgd *dst = NULL;
70 1.1 cgd return (sdst);
71 1.1 cgd }
72 1.1 cgd
73 1.1 cgd char **
74 1.1 cgd short2blk(src)
75 1.1 cgd register Char **src;
76 1.1 cgd {
77 1.1 cgd size_t n;
78 1.1 cgd register char **sdst, **dst;
79 1.1 cgd
80 1.1 cgd /*
81 1.1 cgd * Count
82 1.1 cgd */
83 1.1 cgd for (n = 0; src[n] != NULL; n++);
84 1.1 cgd sdst = dst = (char **) xmalloc((size_t) ((n + 1) * sizeof(char *)));
85 1.1 cgd
86 1.1 cgd for (; *src != NULL; src++)
87 1.1 cgd *dst++ = strsave(short2str(*src));
88 1.1 cgd *dst = NULL;
89 1.1 cgd return (sdst);
90 1.1 cgd }
91 1.1 cgd
92 1.1 cgd #define MALLOC_INCR 1024
93 1.1 cgd Char *
94 1.1 cgd str2short(src)
95 1.1 cgd register char *src;
96 1.1 cgd {
97 1.1 cgd static Char *sdst;
98 1.1 cgd static size_t dstsize = 0;
99 1.1 cgd register Char *dst, *edst;
100 1.1 cgd
101 1.1 cgd if (src == NULL)
102 1.1 cgd return (NULL);
103 1.1 cgd
104 1.1 cgd if (sdst == (NULL)) {
105 1.1 cgd dstsize = MALLOC_INCR;
106 1.1 cgd sdst = (Char *) xmalloc((size_t) dstsize * sizeof(Char));
107 1.1 cgd }
108 1.1 cgd
109 1.1 cgd dst = sdst;
110 1.1 cgd edst = &dst[dstsize];
111 1.1 cgd while (*src) {
112 1.1 cgd *dst++ = (Char) ((unsigned char) *src++);
113 1.1 cgd if (dst == edst) {
114 1.1 cgd dstsize += MALLOC_INCR;
115 1.1 cgd sdst = (Char *) xrealloc((ptr_t) sdst,
116 1.1 cgd (size_t) dstsize * sizeof(Char));
117 1.1 cgd edst = &sdst[dstsize];
118 1.1 cgd dst = &edst[-MALLOC_INCR];
119 1.1 cgd }
120 1.1 cgd }
121 1.1 cgd *dst = 0;
122 1.1 cgd return (sdst);
123 1.1 cgd }
124 1.1 cgd
125 1.1 cgd char *
126 1.1 cgd short2qstr(src)
127 1.1 cgd register Char *src;
128 1.1 cgd {
129 1.1 cgd static char *sdst = NULL;
130 1.1 cgd static size_t dstsize = 0;
131 1.1 cgd register char *dst, *edst;
132 1.1 cgd
133 1.1 cgd if (src == NULL)
134 1.1 cgd return (NULL);
135 1.1 cgd
136 1.1 cgd if (sdst == NULL) {
137 1.1 cgd dstsize = MALLOC_INCR;
138 1.1 cgd sdst = (char *) xmalloc((size_t) dstsize * sizeof(char));
139 1.1 cgd }
140 1.1 cgd dst = sdst;
141 1.1 cgd edst = &dst[dstsize];
142 1.1 cgd while (*src) {
143 1.1 cgd if (*src & QUOTE) {
144 1.1 cgd *dst++ = '\\';
145 1.1 cgd if (dst == edst) {
146 1.1 cgd dstsize += MALLOC_INCR;
147 1.1 cgd sdst = (char *) xrealloc((ptr_t) sdst,
148 1.1 cgd (size_t) dstsize * sizeof(char));
149 1.1 cgd edst = &sdst[dstsize];
150 1.1 cgd dst = &edst[-MALLOC_INCR];
151 1.1 cgd }
152 1.1 cgd }
153 1.1 cgd *dst++ = (char) *src++;
154 1.1 cgd if (dst == edst) {
155 1.1 cgd dstsize += MALLOC_INCR;
156 1.1 cgd sdst = (char *) xrealloc((ptr_t) sdst,
157 1.1 cgd (size_t) dstsize * sizeof(char));
158 1.1 cgd edst = &sdst[dstsize];
159 1.1 cgd dst = &edst[-MALLOC_INCR];
160 1.1 cgd }
161 1.1 cgd }
162 1.1 cgd *dst = 0;
163 1.1 cgd return (sdst);
164 1.1 cgd }
165 1.1 cgd char *
166 1.1 cgd short2str(src)
167 1.1 cgd register Char *src;
168 1.1 cgd {
169 1.1 cgd static char *sdst = NULL;
170 1.1 cgd static size_t dstsize = 0;
171 1.1 cgd register char *dst, *edst;
172 1.1 cgd
173 1.1 cgd if (src == NULL)
174 1.1 cgd return (NULL);
175 1.1 cgd
176 1.1 cgd if (sdst == NULL) {
177 1.1 cgd dstsize = MALLOC_INCR;
178 1.1 cgd sdst = (char *) xmalloc((size_t) dstsize * sizeof(char));
179 1.1 cgd }
180 1.1 cgd dst = sdst;
181 1.1 cgd edst = &dst[dstsize];
182 1.1 cgd while (*src) {
183 1.1 cgd *dst++ = (char) *src++;
184 1.1 cgd if (dst == edst) {
185 1.1 cgd dstsize += MALLOC_INCR;
186 1.1 cgd sdst = (char *) xrealloc((ptr_t) sdst,
187 1.1 cgd (size_t) dstsize * sizeof(char));
188 1.1 cgd edst = &sdst[dstsize];
189 1.1 cgd dst = &edst[-MALLOC_INCR];
190 1.1 cgd }
191 1.1 cgd }
192 1.1 cgd *dst = 0;
193 1.1 cgd return (sdst);
194 1.1 cgd }
195 1.1 cgd
196 1.1 cgd Char *
197 1.1 cgd s_strcpy(dst, src)
198 1.1 cgd register Char *dst, *src;
199 1.1 cgd {
200 1.1 cgd register Char *sdst;
201 1.1 cgd
202 1.1 cgd sdst = dst;
203 1.1 cgd while (*dst++ = *src++);
204 1.1 cgd return (sdst);
205 1.1 cgd }
206 1.1 cgd
207 1.1 cgd Char *
208 1.1 cgd s_strncpy(dst, src, n)
209 1.1 cgd register Char *dst, *src;
210 1.1 cgd register size_t n;
211 1.1 cgd {
212 1.1 cgd register Char *sdst;
213 1.1 cgd
214 1.1 cgd if (n == 0)
215 1.1 cgd return(dst);
216 1.1 cgd
217 1.1 cgd sdst = dst;
218 1.1 cgd do
219 1.1 cgd if ((*dst++ = *src++) == '\0') {
220 1.1 cgd while (--n != 0)
221 1.1 cgd *dst++ = '\0';
222 1.1 cgd return(sdst);
223 1.1 cgd }
224 1.1 cgd while (--n != 0);
225 1.1 cgd return (sdst);
226 1.1 cgd }
227 1.1 cgd
228 1.1 cgd Char *
229 1.1 cgd s_strcat(dst, src)
230 1.1 cgd register Char *dst, *src;
231 1.1 cgd {
232 1.1 cgd register short *sdst;
233 1.1 cgd
234 1.1 cgd sdst = dst;
235 1.1 cgd while (*dst++);
236 1.1 cgd --dst;
237 1.1 cgd while (*dst++ = *src++);
238 1.1 cgd return (sdst);
239 1.1 cgd }
240 1.1 cgd
241 1.1 cgd #ifdef NOTUSED
242 1.1 cgd Char *
243 1.1 cgd s_strncat(dst, src, n)
244 1.1 cgd register Char *dst, *src;
245 1.1 cgd register size_t n;
246 1.1 cgd {
247 1.1 cgd register Char *sdst;
248 1.1 cgd
249 1.1 cgd if (n == 0)
250 1.1 cgd return (dst);
251 1.1 cgd
252 1.1 cgd sdst = dst;
253 1.1 cgd
254 1.1 cgd while (*dst++);
255 1.1 cgd --dst;
256 1.1 cgd
257 1.1 cgd do
258 1.1 cgd if ((*dst++ = *src++) == '\0')
259 1.1 cgd return(sdst);
260 1.1 cgd while (--n != 0);
261 1.1 cgd
262 1.1 cgd *dst = '\0';
263 1.1 cgd return (sdst);
264 1.1 cgd }
265 1.1 cgd
266 1.1 cgd #endif
267 1.1 cgd
268 1.1 cgd Char *
269 1.1 cgd s_strchr(str, ch)
270 1.1 cgd register Char *str;
271 1.1 cgd int ch;
272 1.1 cgd {
273 1.1 cgd do
274 1.1 cgd if (*str == ch)
275 1.1 cgd return (str);
276 1.1 cgd while (*str++);
277 1.1 cgd return (NULL);
278 1.1 cgd }
279 1.1 cgd
280 1.1 cgd Char *
281 1.1 cgd s_strrchr(str, ch)
282 1.1 cgd register Char *str;
283 1.1 cgd int ch;
284 1.1 cgd {
285 1.1 cgd register Char *rstr;
286 1.1 cgd
287 1.1 cgd rstr = NULL;
288 1.1 cgd do
289 1.1 cgd if (*str == ch)
290 1.1 cgd rstr = str;
291 1.1 cgd while (*str++);
292 1.1 cgd return (rstr);
293 1.1 cgd }
294 1.1 cgd
295 1.1 cgd size_t
296 1.1 cgd s_strlen(str)
297 1.1 cgd register Char *str;
298 1.1 cgd {
299 1.1 cgd register size_t n;
300 1.1 cgd
301 1.1 cgd for (n = 0; *str++; n++);
302 1.1 cgd return (n);
303 1.1 cgd }
304 1.1 cgd
305 1.1 cgd int
306 1.1 cgd s_strcmp(str1, str2)
307 1.1 cgd register Char *str1, *str2;
308 1.1 cgd {
309 1.1 cgd for (; *str1 && *str1 == *str2; str1++, str2++);
310 1.1 cgd /*
311 1.1 cgd * The following case analysis is necessary so that characters which look
312 1.1 cgd * negative collate low against normal characters but high against the
313 1.1 cgd * end-of-string NUL.
314 1.1 cgd */
315 1.1 cgd if (*str1 == '\0' && *str2 == '\0')
316 1.1 cgd return (0);
317 1.1 cgd else if (*str1 == '\0')
318 1.1 cgd return (-1);
319 1.1 cgd else if (*str2 == '\0')
320 1.1 cgd return (1);
321 1.1 cgd else
322 1.1 cgd return (*str1 - *str2);
323 1.1 cgd }
324 1.1 cgd
325 1.1 cgd int
326 1.1 cgd s_strncmp(str1, str2, n)
327 1.1 cgd register Char *str1, *str2;
328 1.1 cgd register size_t n;
329 1.1 cgd {
330 1.1 cgd if (n == 0)
331 1.1 cgd return (0);
332 1.1 cgd do {
333 1.1 cgd if (*str1 == '\0' || *str1 != *str2)
334 1.1 cgd break;
335 1.1 cgd str1++, str2++;
336 1.1 cgd } while (--n != 0);
337 1.1 cgd /*
338 1.1 cgd * The following case analysis is necessary so that characters which look
339 1.1 cgd * negative collate low against normal characters but high against the
340 1.1 cgd * end-of-string NUL.
341 1.1 cgd */
342 1.1 cgd if (*str1 == '\0' && *str2 == '\0')
343 1.1 cgd return (0);
344 1.1 cgd else if (*str1 == '\0')
345 1.1 cgd return (-1);
346 1.1 cgd else if (*str2 == '\0')
347 1.1 cgd return (1);
348 1.1 cgd else
349 1.1 cgd return (*str1 - *str2);
350 1.1 cgd return(0);
351 1.1 cgd }
352 1.1 cgd
353 1.1 cgd Char *
354 1.1 cgd s_strsave(s)
355 1.1 cgd register Char *s;
356 1.1 cgd {
357 1.1 cgd Char *n;
358 1.1 cgd register Char *p;
359 1.1 cgd
360 1.1 cgd if (s == 0)
361 1.1 cgd s = STRNULL;
362 1.1 cgd for (p = s; *p++;);
363 1.1 cgd n = p = (Char *) xmalloc((size_t) ((p - s) * sizeof(Char)));
364 1.1 cgd while (*p++ = *s++);
365 1.1 cgd return (n);
366 1.1 cgd }
367 1.1 cgd
368 1.1 cgd Char *
369 1.1 cgd s_strspl(cp, dp)
370 1.1 cgd Char *cp, *dp;
371 1.1 cgd {
372 1.1 cgd Char *ep;
373 1.1 cgd register Char *p, *q;
374 1.1 cgd
375 1.1 cgd if (!cp)
376 1.1 cgd cp = STRNULL;
377 1.1 cgd if (!dp)
378 1.1 cgd dp = STRNULL;
379 1.1 cgd for (p = cp; *p++;);
380 1.1 cgd for (q = dp; *q++;);
381 1.1 cgd ep = (Char *) xmalloc((size_t)
382 1.1 cgd (((p - cp) + (q - dp) - 1) * sizeof(Char)));
383 1.1 cgd for (p = ep, q = cp; *p++ = *q++;);
384 1.1 cgd for (p--, q = dp; *p++ = *q++;);
385 1.1 cgd return (ep);
386 1.1 cgd }
387 1.1 cgd
388 1.1 cgd Char *
389 1.1 cgd s_strend(cp)
390 1.1 cgd register Char *cp;
391 1.1 cgd {
392 1.1 cgd if (!cp)
393 1.1 cgd return (cp);
394 1.1 cgd while (*cp)
395 1.1 cgd cp++;
396 1.1 cgd return (cp);
397 1.1 cgd }
398 1.1 cgd
399 1.1 cgd #ifdef NOTUSED
400 1.1 cgd Char *
401 1.1 cgd s_strstr(s, t)
402 1.1 cgd register Char *s, *t;
403 1.1 cgd {
404 1.1 cgd do {
405 1.1 cgd register Char *ss = s;
406 1.1 cgd register Char *tt = t;
407 1.1 cgd
408 1.1 cgd do
409 1.1 cgd if (*tt == '\0')
410 1.1 cgd return (s);
411 1.1 cgd while (*ss++ == *tt++);
412 1.1 cgd } while (*s++ != '\0');
413 1.1 cgd return (NULL);
414 1.1 cgd }
415 1.1 cgd #endif
416 1.1 cgd
417 1.1 cgd #endif /* SHORT_STRINGS */
418