1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
2 *@ Auto-reclaimed string allocation and support routines that build on top of
3 *@ them. Strings handed out by those are reclaimed at the top of the command
4 *@ loop each time, so they need not be freed.
5 *@ And below this series we do collect all other plain string support routines
6 *@ in here, including those which use normal heap memory.
8 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
9 * Copyright (c) 2012 - 2014 Steffen (Daode) Nurpmeso <sdaoden@users.sf.net>.
12 * Copyright (c) 1980, 1993
13 * The Regents of the University of California. All rights reserved.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 * 3. All advertising materials mentioning features or use of this software
24 * must display the following acknowledgement:
25 * This product includes software developed by the University of
26 * California, Berkeley and its contributors.
27 * 4. Neither the name of the University nor the names of its contributors
28 * may be used to endorse or promote products derived from this software
29 * without specific prior written permission.
31 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
32 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
33 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
34 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
35 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
36 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
37 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
38 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
39 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
40 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44 #ifndef HAVE_AMALGAMATION
50 /* Allocate SBUFFER_SIZE chunks and keep them in a singly linked list, but
51 * release all except the first two in sreset(), because other allocations are
52 * performed and the underlaying allocator should have the possibility to
53 * reorder stuff and possibly even madvise(2), so that S-nail(1) integrates
54 * neatly into the system.
56 * To relax stuff further, especially in non-interactive, i.e., send mode, do
57 * not even allocate the first buffer, but let that be a builtin DATA section
58 * one that is rather small, yet sufficient for send mode to *never* even
59 * perform a single dynamic allocation (from our stringdope point of view).
60 * Encapsulate user chunks with canaries if HAVE_DEBUG.
62 * To deal with huge allocations which would overflow those buffers we offer
63 * a simple bypass that relies upon smalloc() (which panic()s as necessary) */
66 # define _SHOPE_SIZE (2u * 8 * sizeof(char) + sizeof(struct schunk))
68 CTA(sizeof(char) == sizeof(ui8_t
));
83 #endif /* HAVE_DEBUG */
90 #define SALIGN (sizeof(union __align__) - 1)
92 CTA(ISPOW2(SALIGN
+ 1));
96 char *_bot
; /* For spreserve() */
97 char *_relax
; /* If !NULL, used by srelax() instead of ._bot */
98 char *_max
; /* Max usable byte */
99 char *_caster
; /* NULL if full */
102 /* Single instance builtin buffer, DATA */
104 struct b_base b_base
;
105 char b_buf
[SBUFFER_BUILTIN
- sizeof(struct b_base
)];
107 #define SBLTIN_SIZE SIZEOF_FIELD(struct b_bltin, b_buf)
109 /* Dynamically allocated buffers */
111 struct b_base b_base
;
112 char b_buf
[SBUFFER_SIZE
- sizeof(struct b_base
)];
114 #define SDYN_SIZE SIZEOF_FIELD(struct b_dyn, b_buf)
118 char b_buf
[VFIELD_SIZE(SALIGN
+ 1)];
122 struct hugebuf
*hb_next
;
123 char hb_buf
[VFIELD_SIZE(SALIGN
+ 1)];
126 static struct b_bltin _builtin_buf
;
127 static struct buffer
*_buf_head
, *_buf_list
, *_buf_server
, *_buf_relax
;
128 static struct hugebuf
*_huge_list
;
130 static size_t _all_cnt
, _all_cycnt
, _all_cycnt_max
,
131 _all_size
, _all_cysize
, _all_cysize_max
, _all_min
,
133 _all_bufcnt
, _all_cybufcnt
, _all_cybufcnt_max
,
134 _all_resetreqs
, _all_resets
;
137 /* sreset() / srelax() release a buffer, check the canaries of all chunks */
139 static void _salloc_bcheck(struct buffer
*b
);
144 _salloc_bcheck(struct buffer
*b
)
149 pmax
.cp
= (b
->b
._caster
== NULL
) ? b
->b
._max
: b
->b
._caster
;
152 while (pp
.cp
< pmax
.cp
) {
159 pp
.cp
+= c
->full_size
;
164 if (x
.ui8p
[0] != 0xDE) i
|= 1<<0;
165 if (x
.ui8p
[1] != 0xAA) i
|= 1<<1;
166 if (x
.ui8p
[2] != 0x55) i
|= 1<<2;
167 if (x
.ui8p
[3] != 0xAD) i
|= 1<<3;
168 if (x
.ui8p
[4] != 0xBE) i
|= 1<<4;
169 if (x
.ui8p
[5] != 0x55) i
|= 1<<5;
170 if (x
.ui8p
[6] != 0xAA) i
|= 1<<6;
171 if (x
.ui8p
[7] != 0xEF) i
|= 1<<7;
173 alert("sdope %p: corrupt lower canary: 0x%02X, size %u: %s, line %u",
174 ux
, i
, c
->usr_size
, c
->file
, c
->line
);
175 x
.cp
+= 8 + c
->usr_size
;
178 if (x
.ui8p
[0] != 0xDE) i
|= 1<<0;
179 if (x
.ui8p
[1] != 0xAA) i
|= 1<<1;
180 if (x
.ui8p
[2] != 0x55) i
|= 1<<2;
181 if (x
.ui8p
[3] != 0xAD) i
|= 1<<3;
182 if (x
.ui8p
[4] != 0xBE) i
|= 1<<4;
183 if (x
.ui8p
[5] != 0x55) i
|= 1<<5;
184 if (x
.ui8p
[6] != 0xAA) i
|= 1<<6;
185 if (x
.ui8p
[7] != 0xEF) i
|= 1<<7;
187 alert("sdope %p: corrupt upper canary: 0x%02X, size %u: %s, line %u",
188 ux
, i
, c
->usr_size
, c
->file
, c
->line
);
195 (salloc
)(size_t size SALLOC_DEBUG_ARGS
)
197 DBG( size_t orig_size
= size
; )
198 union {struct buffer
*b
; struct hugebuf
*hb
; char *cp
;} u
;
210 _all_cycnt_max
= MAX(_all_cycnt_max
, _all_cycnt
);
213 _all_cysize_max
= MAX(_all_cysize_max
, _all_cysize
);
214 _all_min
= (_all_max
== 0) ? size
: MIN(_all_min
, size
);
215 _all_max
= MAX(_all_max
, size
);
216 _all_wast
+= size
- orig_size
;
220 if (size
>= SDYN_SIZE
- 1)
221 alert("salloc() of %" PRIuZ
" bytes from `%s', line %d\n",
222 size
, mdbg_file
, mdbg_line
);
225 /* Huge allocations are special */
226 if (UNLIKELY(size
>= SDYN_SIZE
- 1))
229 /* Search for a buffer with enough free space to serve request */
230 if ((u
.b
= _buf_server
) != NULL
)
233 for (u
.b
= _buf_head
; u
.b
!= NULL
; u
.b
= u
.b
->b
._next
) {
237 if (u
.b
== _buf_server
) {
238 if (u
.b
== _buf_head
&& (u
.b
= _buf_head
->b
._next
) != NULL
) {
249 if (PTRCMP(y
, <=, z
)) {
250 /* Alignment is the one thing, the other is what is usually allocated,
251 * and here about 40 bytes seems to be a good cut to avoid non-usable
252 * non-NULL casters. However, because of _salloc_bcheck(), we may not
253 * set ._caster to NULL because then it would check all chunks up to
254 * ._max, which surely doesn't work; speed is no issue with DEBUG */
255 u
.b
->b
._caster
= NDBG( PTRCMP(y
+ 42 + 16, >=, z
) ? NULL
: ) y
;
261 /* Need a new buffer */
262 if (_buf_head
== NULL
) {
263 struct b_bltin
*b
= &_builtin_buf
;
264 b
->b_base
._max
= b
->b_buf
+ SBLTIN_SIZE
- 1;
265 _buf_head
= (struct buffer
*)b
;
271 _all_cybufcnt_max
= MAX(_all_cybufcnt_max
, _all_cybufcnt
);
273 u
.b
= smalloc(sizeof(struct b_dyn
));
274 u
.b
->b
._max
= u
.b
->b_buf
+ SDYN_SIZE
- 1;
276 if (_buf_list
!= NULL
)
277 _buf_list
->b
._next
= u
.b
;
278 _buf_server
= _buf_list
= u
.b
;
280 u
.b
->b
._caster
= (u
.b
->b
._bot
= u
.b
->b_buf
) + size
;
281 u
.b
->b
._relax
= NULL
;
285 /* Encapsulate user chunk in debug canaries */
293 xc
->file
= mdbg_file
;
294 xc
->line
= mdbg_line
;
295 xc
->usr_size
= (ui16_t
)orig_size
;
296 xc
->full_size
= (ui16_t
)size
;
298 xl
.ui8p
[0]=0xDE; xl
.ui8p
[1]=0xAA; xl
.ui8p
[2]=0x55; xl
.ui8p
[3]=0xAD;
299 xl
.ui8p
[4]=0xBE; xl
.ui8p
[5]=0x55; xl
.ui8p
[6]=0xAA; xl
.ui8p
[7]=0xEF;
303 xu
.ui8p
[0]=0xDE; xu
.ui8p
[1]=0xAA; xu
.ui8p
[2]=0x55; xu
.ui8p
[3]=0xAD;
304 xu
.ui8p
[4]=0xBE; xu
.ui8p
[5]=0x55; xu
.ui8p
[6]=0xAA; xu
.ui8p
[7]=0xEF;
311 u
.hb
= smalloc(sizeof(*u
.hb
) - VFIELD_SIZEOF(struct hugebuf
, hb_buf
) +
313 u
.hb
->hb_next
= _huge_list
;
320 (csalloc
)(size_t nmemb
, size_t size SALLOC_DEBUG_ARGS
)
326 vp
= (salloc
)(size SALLOC_DEBUG_ARGSCALL
);
333 sreset(bool_t only_if_relaxed
)
338 DBG( ++_all_resetreqs
; )
339 if (noreset
|| (only_if_relaxed
&& _buf_relax
== NULL
))
343 _all_cycnt
= _all_cysize
= 0;
344 _all_cybufcnt
= (_buf_head
!= NULL
&& _buf_head
->b
._next
!= NULL
);
348 if ((bh
= _buf_head
) != NULL
) {
349 struct buffer
*b
= bh
;
350 DBG( _salloc_bcheck(b
); )
351 b
->b
._caster
= b
->b
._bot
;
353 DBG( memset(b
->b
._caster
, 0377, PTR2SIZE(b
->b
._max
- b
->b
._caster
)); )
356 if ((bh
= bh
->b
._next
) != NULL
) {
358 DBG( _salloc_bcheck(b
); )
359 b
->b
._caster
= b
->b
._bot
;
361 DBG( memset(b
->b
._caster
, 0377, PTR2SIZE(b
->b
._max
- b
->b
._caster
)); )
363 for (bh
= bh
->b
._next
; bh
!= NULL
;) {
364 struct buffer
*b2
= bh
->b
._next
;
365 DBG( _salloc_bcheck(bh
); )
375 /* We'll only free huge allocations when not in relaxed mode, because they
376 * know nothing about relaxation (as above) */
377 if (_buf_relax
== NULL
)
378 while (_huge_list
!= NULL
) {
379 struct hugebuf
*hb
= _huge_list
;
380 _huge_list
= hb
->hb_next
;
395 assert(_buf_relax
== NULL
);
397 for (b
= _buf_head
; b
!= NULL
; b
= b
->b
._next
)
398 b
->b
._relax
= b
->b
._caster
;
399 _buf_relax
= _buf_server
;
400 assert(_buf_relax
!= NULL
);
410 assert(_buf_relax
!= NULL
);
412 for (b
= _buf_relax
; b
!= NULL
; b
= b
->b
._next
) {
413 DBG( _salloc_bcheck(b
); )
414 b
->b
._caster
= (b
->b
._relax
!= NULL
) ? b
->b
._relax
: b
->b
._bot
;
424 /* The purpose of relaxation is only that it is possible to reset the
425 * casters, *not* to give back memory to the system. We are presumably in
426 * an iteration over all messages of a mailbox, and it'd be quite
427 * counterproductive to give the system allocator a chance to waste time */
431 assert(_buf_relax
!= NULL
);
433 for (b
= _buf_relax
; b
!= NULL
; b
= b
->b
._next
) {
434 DBG( _salloc_bcheck(b
); )
435 b
->b
._caster
= (b
->b
._relax
!= NULL
) ? b
->b
._relax
: b
->b
._bot
;
436 DBG( memset(b
->b
._caster
, 0377, PTR2SIZE(b
->b
._max
- b
->b
._caster
)); )
447 for (b
= _buf_head
; b
!= NULL
; b
= b
->b
._next
)
448 b
->b
._bot
= b
->b
._caster
;
460 excess
= (_all_cybufcnt_max
* SDYN_SIZE
) + SBLTIN_SIZE
;
461 excess
= (excess
>= _all_cysize_max
) ? 0 : _all_cysize_max
- excess
;
463 printf("String usage statistics (cycle means one sreset() cycle):\n"
464 " Buffer allocs ever/max a time : %" PRIuZ
"/%" PRIuZ
"\n"
465 " .. size of the builtin/dynamic: %" PRIuZ
"/%" PRIuZ
"\n"
466 " Overall alloc count/bytes : %" PRIuZ
"/%" PRIuZ
"\n"
467 " .. bytes min/max/align wastage: %" PRIuZ
"/%" PRIuZ
"/%" PRIuZ
"\n"
468 " sreset() cycles : %" PRIuZ
" (%" PRIuZ
" performed)\n"
469 " Cycle max.: alloc count/bytes : %" PRIuZ
"/%" PRIuZ
"+%" PRIuZ
"\n",
470 _all_bufcnt
, _all_cybufcnt_max
,
471 SBLTIN_SIZE
, SDYN_SIZE
,
473 _all_min
, _all_max
, _all_wast
,
474 _all_resetreqs
, _all_resets
,
475 _all_cycnt_max
, _all_cysize_max
, excess
);
482 (savestr
)(char const *str SALLOC_DEBUG_ARGS
)
488 size
= strlen(str
) +1;
489 news
= (salloc
)(size SALLOC_DEBUG_ARGSCALL
);
490 memcpy(news
, str
, size
);
496 (savestrbuf
)(char const *sbuf
, size_t sbuf_len SALLOC_DEBUG_ARGS
)
501 news
= (salloc
)(sbuf_len
+1 SALLOC_DEBUG_ARGSCALL
);
502 memcpy(news
, sbuf
, sbuf_len
);
509 (save2str
)(char const *str
, char const *old SALLOC_DEBUG_ARGS
)
511 size_t newsize
, oldsize
;
515 newsize
= strlen(str
) +1;
516 oldsize
= (old
!= NULL
) ? strlen(old
) + 1 : 0;
517 news
= (salloc
)(newsize
+ oldsize SALLOC_DEBUG_ARGSCALL
);
519 memcpy(news
, old
, oldsize
);
520 news
[oldsize
- 1] = ' ';
522 memcpy(news
+ oldsize
, str
, newsize
);
528 (savecat
)(char const *s1
, char const *s2 SALLOC_DEBUG_ARGS
)
536 news
= (salloc
)(l1
+ l2
+1 SALLOC_DEBUG_ARGSCALL
);
537 memcpy(news
+ 0, s1
, l1
);
538 memcpy(news
+ l1
, s2
, l2
);
539 news
[l1
+ l2
] = '\0';
545 * Support routines, auto-reclaimed storage
549 (i_strdup
)(char const *src SALLOC_DEBUG_ARGS
)
556 dest
= (salloc
)(sz SALLOC_DEBUG_ARGSCALL
);
557 i_strcpy(dest
, src
, sz
);
563 (protbase
)(char const *cp SALLOC_DEBUG_ARGS
) /* TODO obsolete */
568 np
= n
= (salloc
)(strlen(cp
) +1 SALLOC_DEBUG_ARGSCALL
);
570 /* Just ignore the `is-system-mailbox' prefix XXX */
571 if (cp
[0] == '%' && cp
[1] == ':')
574 while (*cp
!= '\0') {
575 if (cp
[0] == ':' && cp
[1] == '/' && cp
[2] == '/') {
579 } else if (cp
[0] == '/')
590 str_concat_csvl(struct str
*self
, ...) /* XXX onepass maybe better here */
598 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;)
603 self
->s
= salloc(l
+1);
606 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;) {
607 size_t i
= strlen(cs
);
608 memcpy(self
->s
+ l
, cs
, i
);
619 (str_concat_cpa
)(struct str
*self
, char const * const *cpa
,
620 char const *sep_o_null SALLOC_DEBUG_ARGS
)
623 char const * const *xcpa
;
626 sonl
= (sep_o_null
!= NULL
) ? strlen(sep_o_null
) : 0;
628 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
)
629 l
+= strlen(*xcpa
) + sonl
;
632 self
->s
= (salloc
)(l
+1 SALLOC_DEBUG_ARGSCALL
);
634 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
) {
635 size_t i
= strlen(*xcpa
);
636 memcpy(self
->s
+ l
, *xcpa
, i
);
639 memcpy(self
->s
+ l
, sep_o_null
, sonl
);
650 * Routines that are not related to auto-reclaimed storage follow.
654 anyof(char const *s1
, char const *s2
)
657 for (; *s1
!= '\0'; ++s1
)
658 if (strchr(s2
, *s1
) != NULL
)
661 return (*s1
!= '\0');
665 n_strsep(char **iolist
, char sep
, bool_t ignore_empty
)
670 for (base
= *iolist
; base
!= NULL
; base
= *iolist
) {
671 while (*base
!= '\0' && blankspacechar(*base
))
673 cp
= strchr(base
, sep
);
678 cp
= base
+ strlen(base
);
680 while (cp
> base
&& blankspacechar(cp
[-1]))
683 if (*base
!= '\0' || !ignore_empty
)
691 i_strcpy(char *dest
, char const *src
, size_t size
)
695 for (;; ++dest
, ++src
)
696 if ((*dest
= lowerconv(*src
)) == '\0') {
698 } else if (--size
== 0) {
707 is_prefix(char const *as1
, char const *as2
)
712 for (; (c
= *as1
) == *as2
&& c
!= '\0'; ++as1
, ++as2
)
720 laststring(char *linebuf
, bool_t
*needs_list
, bool_t strip
)
722 char *cp
, *p
, quoted
;
725 /* Anything to do at all? */
726 if (*(cp
= linebuf
) == '\0')
728 cp
+= strlen(linebuf
) -1;
730 /* Strip away trailing blanks */
731 while (whitechar(*cp
) && cp
> linebuf
)
737 /* Now search for the BOS of the "last string" */
739 if (quoted
== '\'' || quoted
== '"') {
745 while (cp
> linebuf
) {
750 } else if (!whitechar(*cp
))
752 if (cp
== linebuf
|| cp
[-1] != '\\') {
753 /* When in whitespace mode, WS prefix doesn't belong */
758 /* Expand the escaped quote character */
759 for (p
= --cp
; (p
[0] = p
[1]) != '\0'; ++p
)
762 if (strip
&& quoted
!= ' ' && *cp
== quoted
)
763 for (p
= cp
; (p
[0] = p
[1]) != '\0'; ++p
)
766 /* The "last string" has been skipped over, but still, try to step backwards
767 * until we are at BOS or see whitespace, so as to make possible things like
768 * "? copy +'x y.mbox'" or even "? copy +x\ y.mbox" */
769 while (cp
> linebuf
) {
771 if (whitechar(*cp
)) {
774 /* We can furtherly release our callees if we now decide wether the
775 * remaining non-"last string" line content contains non-WS */
776 while (--p
>= linebuf
)
785 if (cp
!= NULL
&& *cp
== '\0')
787 *needs_list
= (cp
!= linebuf
&& *linebuf
!= '\0');
798 makelow(char *cp
) /* TODO isn't that crap? --> */
801 #ifdef HAVE_C90AMEND1
802 if (mb_cur_max
> 1) {
807 while (*cp
!= '\0') {
808 len
= mbtowc(&wc
, cp
, mb_cur_max
);
813 if (wctomb(tp
, wc
) == len
)
814 tp
+= len
, cp
+= len
;
816 *tp
++ = *cp
++; /* <-- at least here */
823 *cp
= tolower((uc_i
)*cp
);
824 while (*cp
++ != '\0');
830 substr(char const *str
, char const *sub
)
832 char const *cp
, *backup
;
837 while (*str
!= '\0' && *cp
!= '\0') {
838 #ifdef HAVE_C90AMEND1
839 if (mb_cur_max
> 1) {
843 if ((sz
= mbtowc(&c
, cp
, mb_cur_max
)) == -1)
846 if ((sz
= mbtowc(&c2
, str
, mb_cur_max
)) == -1)
852 if ((sz
= mbtowc(&c
, backup
, mb_cur_max
)) > 0) {
878 return (*cp
== '\0');
881 #ifndef HAVE_SNPRINTF
883 snprintf(char *str
, size_t size
, char const *format
, ...) /* XXX DANGER! */
889 va_start(ap
, format
);
890 ret
= vsprintf(str
, format
, ap
);
900 sstpcpy(char *dst
, char const *src
)
903 while ((*dst
= *src
++) != '\0')
910 (sstrdup
)(char const *cp SMALLOC_DEBUG_ARGS
)
915 dp
= (cp
== NULL
) ? NULL
: (sbufdup
)(cp
, strlen(cp
) SMALLOC_DEBUG_ARGSCALL
);
921 (sbufdup
)(char const *cp
, size_t len SMALLOC_DEBUG_ARGS
)
926 dp
= (smalloc
)(len
+1 SMALLOC_DEBUG_ARGSCALL
);
935 n_strlcpy(char *dst
, char const *src
, size_t len
)
941 dst
= strncpy(dst
, src
, len
);
948 asccasecmp(char const *s1
, char const *s2
)
954 char c1
= *s1
++, c2
= *s2
++;
955 if ((cmp
= lowerconv(c1
) - lowerconv(c2
)) != 0 || c1
== '\0')
963 ascncasecmp(char const *s1
, char const *s2
, size_t sz
)
969 char c1
= *s1
++, c2
= *s2
++;
970 cmp
= (ui8_t
)lowerconv(c1
);
971 cmp
-= (ui8_t
)lowerconv(c2
);
972 if (cmp
!= 0 || c1
== '\0')
980 is_asccaseprefix(char const *as1
, char const *as2
)
985 for (;; ++as1
, ++as2
) {
986 char c1
= lowerconv(*as1
), c2
= lowerconv(*as2
);
987 if ((rv
= (c1
== '\0')))
989 if (c1
!= c2
|| c2
== '\0')
998 asccasestr(char const *haystack
, char const *xneedle
)
1000 char *needle
= NULL
, *NEEDLE
;
1004 sz
= strlen(xneedle
);
1008 needle
= ac_alloc(sz
);
1009 NEEDLE
= ac_alloc(sz
);
1010 for (i
= 0; i
< sz
; i
++) {
1011 needle
[i
] = lowerconv(xneedle
[i
]);
1012 NEEDLE
[i
] = upperconv(xneedle
[i
]);
1015 while (*haystack
!= '\0') {
1016 if (*haystack
== *needle
|| *haystack
== *NEEDLE
) {
1017 for (i
= 1; i
< sz
; ++i
)
1018 if (haystack
[i
] != needle
[i
] && haystack
[i
] != NEEDLE
[i
])
1027 if (needle
!= NULL
) {
1037 (n_str_dup
)(struct str
*self
, struct str
const *t SMALLOC_DEBUG_ARGS
)
1040 if (t
!= NULL
&& t
->l
> 0) {
1042 self
->s
= (srealloc
)(self
->s
, t
->l
+1 SMALLOC_DEBUG_ARGSCALL
);
1043 memcpy(self
->s
, t
->s
, t
->l
+1);
1051 (n_str_add_buf
)(struct str
*self
, char const *buf
, size_t buflen
1056 size_t sl
= self
->l
;
1057 self
->l
= sl
+ buflen
;
1058 self
->s
= (srealloc
)(self
->s
, self
->l
+1 SMALLOC_DEBUG_ARGSCALL
);
1059 memcpy(self
->s
+ sl
, buf
, buflen
);
1060 self
->s
[self
->l
] = '\0';
1067 * Our iconv(3) wrapper
1071 static void _ic_toupper(char *dest
, char const *src
);
1072 static void _ic_stripdash(char *p
);
1075 _ic_toupper(char *dest
, char const *src
)
1079 *dest
++ = upperconv(*src
);
1080 while (*src
++ != '\0');
1085 _ic_stripdash(char *p
)
1091 if (*(q
= p
) != '-')
1093 while (*p
++ != '\0');
1098 n_iconv_open(char const *tocode
, char const *fromcode
)
1104 if ((id
= iconv_open(tocode
, fromcode
)) != (iconv_t
)-1)
1107 /* Remove the "iso-" prefixes for Solaris */
1108 if (!ascncasecmp(tocode
, "iso-", 4))
1110 else if (!ascncasecmp(tocode
, "iso", 3))
1112 if (!ascncasecmp(fromcode
, "iso-", 4))
1114 else if (!ascncasecmp(fromcode
, "iso", 3))
1116 if (*tocode
== '\0' || *fromcode
== '\0') {
1120 if ((id
= iconv_open(tocode
, fromcode
)) != (iconv_t
)-1)
1123 /* Solaris prefers upper-case charset names. Don't ask... */
1124 t
= salloc(strlen(tocode
) +1);
1125 _ic_toupper(t
, tocode
);
1126 f
= salloc(strlen(fromcode
) +1);
1127 _ic_toupper(f
, fromcode
);
1128 if ((id
= iconv_open(t
, f
)) != (iconv_t
)-1)
1131 /* Strip dashes for UnixWare */
1134 if ((id
= iconv_open(t
, f
)) != (iconv_t
)-1)
1137 /* Add your vendor's sillynesses here */
1139 /* If the encoding names are equal at this point, they are just not
1140 * understood by iconv(), and we cannot sensibly use it in any way. We do
1141 * not perform this as an optimization above since iconv() can otherwise be
1142 * used to check the validity of the input even with identical encoding
1152 n_iconv_close(iconv_t cd
)
1157 iconvd
= (iconv_t
)-1;
1163 n_iconv_reset(iconv_t cd
)
1166 iconv(cd
, NULL
, NULL
, NULL
, NULL
);
1171 /* (2012-09-24: export and use it exclusively to isolate prototype problems
1172 * (*inb* is 'char const **' except in POSIX) in a single place.
1173 * GNU libiconv even allows for configuration time const/non-const..
1174 * In the end it's an ugly guess, but we can't do better since make(1) doesn't
1175 * support compiler invocations which bail on error, so no -Werror */
1176 /* Citrus project? */
1177 # if defined _ICONV_H_ && defined __ICONV_F_HIDE_INVALID
1178 /* DragonFly 3.2.1 is special TODO newer DragonFly too, but different */
1179 # ifdef __DragonFly__
1180 # define __INBCAST(S) (char ** __restrict__)UNCONST(S)
1182 # define __INBCAST(S) (char const **)UNCONST(S)
1186 # define __INBCAST(S) (char **)UNCONST(S)
1190 n_iconv_buf(iconv_t cd
, char const **inb
, size_t *inbleft
,/*XXX redo iconv use*/
1191 char **outb
, size_t *outbleft
, bool_t skipilseq
)
1197 size_t sz
= iconv(cd
, __INBCAST(inb
), inbleft
, outb
, outbleft
);
1198 if (sz
!= (size_t)-1)
1201 if (!skipilseq
|| err
!= EILSEQ
)
1206 } else if (*outbleft
> 0) {
1210 if (*outbleft
> 0/* TODO 0xFFFD 2*/) {
1211 /* TODO 0xFFFD (*outb)[0] = '[';
1212 * TODO (*outb)[1] = '?';
1213 * TODO 0xFFFD (*outb)[2] = ']';
1214 * TODO (*outb) += 3;
1215 * TODO (*outbleft) -= 3; */
1230 n_iconv_str(iconv_t cd
, struct str
*out
, struct str
const *in
,
1231 struct str
*in_rest_or_null
, bool_t skipilseq
)
1244 ol
= (ol
<< 1) - (ol
>> 4);
1255 err
= n_iconv_buf(cd
, &ib
, &il
, &ob
, &ol
, skipilseq
);
1256 if (err
== 0 || err
!= E2BIG
)
1261 obb
= srealloc(obb
, olb
);
1264 if (in_rest_or_null
!= NULL
) {
1265 in_rest_or_null
->s
= UNCONST(ib
);
1266 in_rest_or_null
->l
= il
;
1273 #endif /* HAVE_ICONV */