1 /* $Header: /p/tcsh/cvsroot/tcsh/tc.str.c,v 3.26 2006/03/02 18:46:45 christos Exp $ */
3 * tc.str.c: Short string package
4 * This has been a lesson of how to write buggy code!
7 * Copyright (c) 1980, 1991 The Regents of the University of California.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 RCSID("$tcsh: tc.str.c,v 3.26 2006/03/02 18:46:45 christos Exp $")
40 #define MALLOC_INCR 128
42 #define MALLOC_SURPLUS MB_LEN_MAX /* Space for one multibyte character */
44 #define MALLOC_SURPLUS 0
49 one_mbtowc(wchar_t *pwc, const char *s, size_t n)
53 len = rt_mbtowc(pwc, s, n);
55 mbtowc(NULL, NULL, 0);
56 *pwc = (unsigned char)*s | INVALID_BYTE;
64 one_wctomb(char *s, wchar_t wchar)
68 if (wchar & INVALID_BYTE) {
72 len = wctomb(s, wchar);
82 rt_mbtowc(wchar_t *pwc, const char *s, size_t n)
85 char back[MB_LEN_MAX];
87 ret = mbtowc(pwc, s, n);
88 if (ret > 0 && (wctomb(back, *pwc) != ret || memcmp(s, back, ret) != 0))
104 for (n = 0; src[n] != NULL; n++)
106 sdst = dst = xmalloc((n + 1) * sizeof(Char *));
108 for (; *src != NULL; src++)
115 short2blk(Char **src)
123 for (n = 0; src[n] != NULL; n++)
125 sdst = dst = xmalloc((n + 1) * sizeof(char *));
127 for (; *src != NULL; src++)
128 *dst++ = strsave(short2str(*src));
134 str2short(const char *src)
136 static struct Strbuf buf; /* = Strbuf_INIT; */
145 src += one_mbtowc(&wc, src, MB_LEN_MAX);
146 Strbuf_append1(&buf, wc);
148 Strbuf_terminate(&buf);
153 short2str(const Char *src)
155 static char *sdst = NULL;
156 static size_t dstsize = 0;
163 dstsize = MALLOC_INCR;
164 sdst = xmalloc((dstsize + MALLOC_SURPLUS) * sizeof(char));
167 edst = &dst[dstsize];
169 dst += one_wctomb(dst, *src & CHAR);
172 dstsize += MALLOC_INCR;
173 sdst = xrealloc(sdst, (dstsize + MALLOC_SURPLUS) * sizeof(char));
174 edst = &sdst[dstsize];
175 dst = &edst[-MALLOC_INCR];
184 s_strcpy(Char *dst, const Char *src)
189 while ((*dst++ = *src++) != '\0')
195 s_strncpy(Char *dst, const Char *src, size_t n)
204 if ((*dst++ = *src++) == '\0') {
214 s_strcat(Char *dst, const Char *src)
216 Strcpy(Strend(dst), src);
222 s_strncat(Char *dst, const Char *src, size_t n)
235 if ((*dst++ = *src++) == '\0')
247 s_strchr(const Char *str, int ch)
251 return ((Char *)(intptr_t)str);
257 s_strrchr(const Char *str, int ch)
266 return ((Char *)(intptr_t)rstr);
270 s_strlen(const Char *str)
274 for (n = 0; *str++; n++)
280 s_strcmp(const Char *str1, const Char *str2)
282 for (; *str1 && *str1 == *str2; str1++, str2++)
285 * The following case analysis is necessary so that characters which look
286 * negative collate low against normal characters but high against the
289 if (*str1 == '\0' && *str2 == '\0')
291 else if (*str1 == '\0')
293 else if (*str2 == '\0')
296 return (*str1 - *str2);
300 s_strncmp(const Char *str1, const Char *str2, size_t n)
305 if (*str1 != *str2) {
307 * The following case analysis is necessary so that characters
308 * which look negative collate low against normal characters
309 * but high against the end-of-string NUL.
313 else if (*str2 == '\0')
316 return (*str1 - *str2);
324 #endif /* not WIDE_STRINGS */
327 s_strcasecmp(const Char *str1, const Char *str2)
330 wchar_t l1 = 0, l2 = 0;
331 for (; *str1 && ((*str1 == *str2 && (l1 = l2 = 0) == 0) ||
332 (l1 = towlower(*str1)) == (l2 = towlower(*str2))); str1++, str2++)
336 unsigned char c1, c2, l1 = 0, l2 = 0;
337 for (; *str1 && ((*str1 == *str2 && (l1 = l2 = 0) == 0) ||
338 ((c1 = (unsigned char)*str1) == *str1 &&
339 (c2 = (unsigned char)*str2) == *str2 &&
340 (l1 = tolower(c1)) == (l2 = tolower(c2)))); str1++, str2++)
344 * The following case analysis is necessary so that characters which look
345 * negative collate low against normal characters but high against the
348 if (*str1 == '\0' && *str2 == '\0')
350 else if (*str1 == '\0')
352 else if (*str2 == '\0')
354 else if (l1 == l2) /* They are zero when they are equal */
355 return (*str1 - *str2);
361 s_strnsave(const Char *s, size_t len)
365 n = xmalloc((len + 1) * sizeof (*n));
366 memcpy(n, s, len * sizeof (*n));
372 s_strsave(const Char *s)
379 size = (Strlen(s) + 1) * sizeof(*n);
386 s_strspl(const Char *cp, const Char *dp)
399 res = xmalloc(((p - cp) + (q - dp) - 1) * sizeof(Char));
400 for (ep = res, q = cp; (*ep++ = *q++) != '\0';)
402 for (ep--, q = dp; (*ep++ = *q++) != '\0';)
408 s_strend(const Char *cp)
411 return ((Char *)(intptr_t) cp);
414 return ((Char *)(intptr_t) cp);
418 s_strstr(const Char *s, const Char *t)
426 return ((Char *)(intptr_t) s);
427 while (*ss++ == *tt++);
428 } while (*s++ != '\0');
432 #else /* !SHORT_STRINGS */
434 caching_strip(const char *s)
436 static char *buf = NULL;
437 static size_t buf_size = 0;
442 size = strlen(s) + 1;
443 if (buf_size < size) {
444 buf = xrealloc(buf, size);
447 memcpy(buf, s, size);
454 short2qstr(const Char *src)
456 static char *sdst = NULL;
457 static size_t dstsize = 0;
464 dstsize = MALLOC_INCR;
465 sdst = xmalloc((dstsize + MALLOC_SURPLUS) * sizeof(char));
468 edst = &dst[dstsize];
473 dstsize += MALLOC_INCR;
474 sdst = xrealloc(sdst,
475 (dstsize + MALLOC_SURPLUS) * sizeof(char));
476 edst = &sdst[dstsize];
477 dst = &edst[-MALLOC_INCR];
480 dst += one_wctomb(dst, *src & CHAR);
483 dstsize += MALLOC_INCR;
484 sdst = xrealloc(sdst, (dstsize + MALLOC_SURPLUS) * sizeof(char));
485 edst = &sdst[dstsize];
486 dst = &edst[-MALLOC_INCR];
494 bb_store(struct blk_buf *bb, Char *str)
496 if (bb->len == bb->size) { /* Keep space for terminating NULL */
498 bb->size = 16; /* Arbitrary */
501 bb->vec = xrealloc(bb->vec, bb->size * sizeof (*bb->vec));
503 bb->vec[bb->len] = str;
507 bb_append(struct blk_buf *bb, Char *str)
514 bb_cleanup(void *xbb)
520 for (i = 0; i < bb->len; i++)
526 bb_finish(struct blk_buf *bb)
529 return xrealloc(bb->vec, (bb->len + 1) * sizeof (*bb->vec));
532 #define DO_STRBUF(STRBUF, CHAR, STRLEN) \
534 STRBUF##_store1(struct STRBUF *buf, CHAR c) \
536 if (buf->size == buf->len) { \
537 if (buf->size == 0) \
538 buf->size = 64; /* Arbitrary */ \
541 buf->s = xrealloc(buf->s, buf->size * sizeof(*buf->s)); \
543 buf->s[buf->len] = c; \
546 /* Like strbuf_append1(buf, '\0'), but don't advance len */ \
548 STRBUF##_terminate(struct STRBUF *buf) \
550 STRBUF##_store1(buf, '\0'); \
554 STRBUF##_append1(struct STRBUF *buf, CHAR c) \
556 STRBUF##_store1(buf, c); \
561 STRBUF##_appendn(struct STRBUF *buf, const CHAR *s, size_t len) \
563 if (buf->size < buf->len + len) { \
564 if (buf->size == 0) \
565 buf->size = 64; /* Arbitrary */ \
566 while (buf->size < buf->len + len) \
568 buf->s = xrealloc(buf->s, buf->size * sizeof(*buf->s)); \
570 memcpy(buf->s + buf->len, s, len * sizeof(*buf->s)); \
575 STRBUF##_append(struct STRBUF *buf, const CHAR *s) \
577 STRBUF##_appendn(buf, s, STRLEN(s)); \
581 STRBUF##_finish(struct STRBUF *buf) \
583 STRBUF##_append1(buf, 0); \
584 return xrealloc(buf->s, buf->len * sizeof(*buf->s)); \
588 STRBUF##_cleanup(void *xbuf) \
590 struct STRBUF *buf; \
596 const struct STRBUF STRBUF##_init /* = STRBUF##_INIT; */
598 DO_STRBUF(strbuf, char, strlen);
599 DO_STRBUF(Strbuf, Char, Strlen);