1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
2 *@ String support routines.
4 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
5 * Copyright (c) 2012 - 2017 Steffen (Daode) Nurpmeso <steffen@sdaoden.eu>.
8 * Copyright (c) 1980, 1993
9 * The Regents of the University of California. All rights reserved.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 #define n_FILE strings
38 #ifndef HAVE_AMALGAMATION
45 (savestr
)(char const *str n_MEMORY_DEBUG_ARGS
)
52 news
= (n_autorec_alloc_from_pool
)(NULL
, size
+1 n_MEMORY_DEBUG_ARGSCALL
);
54 memcpy(news
, str
, size
);
61 (savestrbuf
)(char const *sbuf
, size_t sbuf_len n_MEMORY_DEBUG_ARGS
)
66 news
= (n_autorec_alloc_from_pool
)(NULL
, sbuf_len
+1
67 n_MEMORY_DEBUG_ARGSCALL
);
69 memcpy(news
, sbuf
, sbuf_len
);
76 (savecatsep
)(char const *s1
, char sep
, char const *s2 n_MEMORY_DEBUG_ARGS
)
82 l1
= (s1
!= NULL
) ? strlen(s1
) : 0;
84 news
= (n_autorec_alloc_from_pool
)(NULL
, l1
+ (sep
!= '\0') + l2
+1
85 n_MEMORY_DEBUG_ARGSCALL
);
87 memcpy(news
+ 0, s1
, l1
);
92 memcpy(news
+ l1
, s2
, l2
);
99 * Support routines, auto-reclaimed storage
103 (i_strdup
)(char const *src n_MEMORY_DEBUG_ARGS
)
110 dest
= (n_autorec_alloc_from_pool
)(NULL
, sz
+1 n_MEMORY_DEBUG_ARGSCALL
);
112 i_strcpy(dest
, src
, sz
);
119 str_concat_csvl(struct str
*self
, ...) /* XXX onepass maybe better here */
127 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;)
132 self
->s
= salloc(l
+1);
135 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;) {
140 memcpy(self
->s
+ l
, cs
, i
);
151 (str_concat_cpa
)(struct str
*self
, char const * const *cpa
,
152 char const *sep_o_null n_MEMORY_DEBUG_ARGS
)
155 char const * const *xcpa
;
158 sonl
= (sep_o_null
!= NULL
) ? strlen(sep_o_null
) : 0;
160 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
)
161 l
+= strlen(*xcpa
) + sonl
;
164 self
->s
= (n_autorec_alloc_from_pool
)(NULL
, l
+1 n_MEMORY_DEBUG_ARGSCALL
);
166 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
) {
171 memcpy(self
->s
+ l
, *xcpa
, i
);
175 memcpy(self
->s
+ l
, sep_o_null
, sonl
);
185 * Routines that are not related to auto-reclaimed storage follow.
189 n_anyof_buf(char const *template, char const *dat
, size_t len
){
194 while((c
= *template++) != '\0')
195 if(strchr(dat
, c
) != NULL
)
198 while((c
= *template++) != '\0')
199 if(memchr(dat
, c
, len
) != NULL
)
208 n_strsep(char **iolist
, char sep
, bool_t ignore_empty
){
212 for(base
= *iolist
; base
!= NULL
; base
= *iolist
){
213 while(*base
!= '\0' && blankspacechar(*base
))
216 cp
= strchr(base
, sep
);
221 cp
= &base
[strlen(base
)];
223 while(cp
> base
&& blankspacechar(cp
[-1]))
226 if(*base
!= '\0' || !ignore_empty
)
234 n_strsep_esc(char **iolist
, char sep
, bool_t ignore_empty
){
236 bool_t isesc
, anyesc
;
239 for(base
= *iolist
; base
!= NULL
; base
= *iolist
){
240 while((c
= *base
) != '\0' && blankspacechar(c
))
243 for(isesc
= anyesc
= FAL0
, cp
= base
;; ++cp
){
244 if(n_UNLIKELY((c
= *cp
) == '\0')){
255 anyesc
|= (c
== sep
);
259 while(cp
> base
&& blankspacechar(cp
[-1]))
267 for(ins
= cp
= base
;; ++ins
)
268 if((c
= *cp
) == '\\' && cp
[1] == sep
){
271 }else if((*ins
= (++cp
, c
)) == '\0')
276 if(*base
!= '\0' || !ignore_empty
)
284 i_strcpy(char *dest
, char const *src
, size_t size
)
288 for (;; ++dest
, ++src
)
289 if ((*dest
= lowerconv(*src
)) == '\0') {
291 } else if (--size
== 0) {
300 is_prefix(char const *as1
, char const *as2
) /* TODO arg order */
305 for (; (c
= *as1
) == *as2
&& c
!= '\0'; ++as1
, ++as2
)
313 string_quote(char const *v
) /* TODO too simpleminded (getrawlist(), +++ ..) */
320 for (i
= 0, cp
= v
; (c
= *cp
) != '\0'; ++i
, ++cp
)
321 if (c
== '"' || c
== '\\')
325 for (i
= 0, cp
= v
; (c
= *cp
) != '\0'; rv
[i
++] = c
, ++cp
)
326 if (c
== '"' || c
== '\\')
334 laststring(char *linebuf
, bool_t
*needs_list
, bool_t strip
)
336 char *cp
, *p
, quoted
;
339 /* Anything to do at all? */
340 if (*(cp
= linebuf
) == '\0')
342 cp
+= strlen(linebuf
) -1;
344 /* Strip away trailing blanks */
345 while (spacechar(*cp
) && cp
> linebuf
)
351 /* Now search for the BOS of the "last string" */
353 if (quoted
== '\'' || quoted
== '"') {
359 while (cp
> linebuf
) {
364 } else if (!spacechar(*cp
))
366 if (cp
== linebuf
|| cp
[-1] != '\\') {
367 /* When in whitespace mode, WS prefix doesn't belong */
372 /* Expand the escaped quote character */
373 for (p
= --cp
; (p
[0] = p
[1]) != '\0'; ++p
)
376 if (strip
&& quoted
!= ' ' && *cp
== quoted
)
377 for (p
= cp
; (p
[0] = p
[1]) != '\0'; ++p
)
380 /* The "last string" has been skipped over, but still, try to step backwards
381 * until we are at BOS or see whitespace, so as to make possible things like
382 * "? copy +'x y.mbox'" or even "? copy +x\ y.mbox" */
383 while (cp
> linebuf
) {
385 if (spacechar(*cp
)) {
388 /* We can furtherly release our callees if we now decide whether the
389 * remaining non-"last string" line content contains non-WS */
390 while (--p
>= linebuf
)
399 if (cp
!= NULL
&& *cp
== '\0')
401 *needs_list
= (cp
!= linebuf
&& *linebuf
!= '\0');
412 makelow(char *cp
) /* TODO isn't that crap? --> */
415 #ifdef HAVE_C90AMEND1
416 if (n_mb_cur_max
> 1) {
421 while (*cp
!= '\0') {
422 len
= mbtowc(&wc
, cp
, n_mb_cur_max
);
427 if (wctomb(tp
, wc
) == len
)
428 tp
+= len
, cp
+= len
;
430 *tp
++ = *cp
++; /* <-- at least here */
437 *cp
= tolower((uc_i
)*cp
);
438 while (*cp
++ != '\0');
444 substr(char const *str
, char const *sub
)
446 char const *cp
, *backup
;
451 while (*str
!= '\0' && *cp
!= '\0') {
452 #ifdef HAVE_C90AMEND1
453 if (n_mb_cur_max
> 1) {
457 if ((sz
= mbtowc(&c
, cp
, n_mb_cur_max
)) == -1)
460 if ((sz
= mbtowc(&c2
, str
, n_mb_cur_max
)) == -1)
466 if ((sz
= mbtowc(&c
, backup
, n_mb_cur_max
)) > 0) {
492 return (*cp
== '\0');
496 sstpcpy(char *dst
, char const *src
)
499 while ((*dst
= *src
++) != '\0')
506 (sstrdup
)(char const *cp n_MEMORY_DEBUG_ARGS
)
511 dp
= (cp
== NULL
) ? NULL
: (sbufdup
)(cp
, strlen(cp
) n_MEMORY_DEBUG_ARGSCALL
);
517 (sbufdup
)(char const *cp
, size_t len n_MEMORY_DEBUG_ARGS
)
522 dp
= (n_alloc
)(len
+1 n_MEMORY_DEBUG_ARGSCALL
);
531 n_strscpy(char *dst
, char const *src
, size_t dstsize
){
535 if(n_LIKELY(dstsize
> 0)){
538 if((dst
[rv
] = src
[rv
]) == '\0')
541 }while(--dstsize
> 0);
555 asccasecmp(char const *s1
, char const *s2
)
561 char c1
= *s1
++, c2
= *s2
++;
562 if ((cmp
= lowerconv(c1
) - lowerconv(c2
)) != 0 || c1
== '\0')
570 ascncasecmp(char const *s1
, char const *s2
, size_t sz
)
576 char c1
= *s1
++, c2
= *s2
++;
577 cmp
= (ui8_t
)lowerconv(c1
);
578 cmp
-= (ui8_t
)lowerconv(c2
);
579 if (cmp
!= 0 || c1
== '\0')
587 asccasestr(char const *s1
, char const *s2
)
592 for (c2
= *s2
++, c2
= lowerconv(c2
);;) {
593 if ((c1
= *s1
++) == '\0') {
597 if (lowerconv(c1
) == c2
&& is_asccaseprefix(s2
, s1
)) {
607 is_asccaseprefix(char const *as1
, char const *as2
) /* TODO arg order */
612 for(;; ++as1
, ++as2
){
618 if(c1
!= c2
|| c1
== '\0')
628 is_ascncaseprefix(char const *as1
, char const *as2
, size_t sz
)
634 for(rv
= TRU1
; sz
-- > 0; ++as1
, ++as2
){
640 if(!(rv
= (c1
== c2
)) || c1
== '\0')
651 (n_str_assign_buf
)(struct str
*self
, char const *buf
, uiz_t buflen
652 n_MEMORY_DEBUG_ARGS
){
654 if(buflen
== UIZ_MAX
)
655 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
657 assert(buflen
== 0 || buf
!= NULL
);
659 if(n_LIKELY(buflen
> 0)){
660 self
->s
= (n_realloc
)(self
->s
, (self
->l
= buflen
) +1
661 n_MEMORY_DEBUG_ARGSCALL
);
662 memcpy(self
->s
, buf
, buflen
);
663 self
->s
[buflen
] = '\0';
671 (n_str_add_buf
)(struct str
*self
, char const *buf
, uiz_t buflen
672 n_MEMORY_DEBUG_ARGS
){
674 if(buflen
== UIZ_MAX
)
675 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
677 assert(buflen
== 0 || buf
!= NULL
);
680 size_t osl
= self
->l
, nsl
= osl
+ buflen
;
682 self
->s
= (n_realloc
)(self
->s
, (self
->l
= nsl
) +1
683 n_MEMORY_DEBUG_ARGSCALL
);
684 memcpy(self
->s
+ osl
, buf
, buflen
);
692 n_str_trim(struct str
*self
, enum n_str_trim_flags stf
){
699 if((l
= self
->l
) > 0 && (stf
& n_STR_TRIM_FRONT
)){
700 while(spacechar(*cp
)){
705 self
->s
= n_UNCONST(cp
);
708 if(l
> 0 && (stf
& n_STR_TRIM_END
)){
709 for(cp
+= l
-1; spacechar(*cp
); --cp
)
720 n_str_trim_ifs(struct str
*self
, bool_t dodefaults
){
722 char const *ifs
, *cp
;
726 if((l
= self
->l
) == 0)
729 ifs
= ok_vlook(ifs_ws
);
733 /* Check whether we can go fast(er) path */
734 for(i
= 0; (c
= ifs
[i
]) != '\0'; ++i
){
736 case ' ': s
= c
; break;
737 case '\t': t
= c
; break;
738 case '\n': n
= c
; break;
740 /* Need to go the slow path */
741 while(strchr(ifs
, *cp
) != NULL
){
746 self
->s
= n_UNCONST(cp
);
749 for(cp
+= l
-1; strchr(ifs
, *cp
) != NULL
;){
752 /* An uneven number of reverse solidus escapes last WS! */
753 else if(*--cp
== '\\'){
756 for(j
= 1; l
- (uiz_t
)j
> 0 && cp
[-j
] == '\\'; ++j
)
775 /* No ifs-ws? No more data? No trimming */
776 if(l
== 0 || (i
== 0 && !dodefaults
))
786 while((c
= *cp
) != '\0' && (c
== s
|| c
== t
|| c
== n
)){
791 self
->s
= n_UNCONST(cp
);
795 for(cp
+= l
-1; (c
= *cp
) != '\0' && (c
== s
|| c
== t
|| c
== n
);){
798 /* An uneven number of reverse solidus escapes last WS! */
799 else if(*--cp
== '\\'){
802 for(j
= 1; l
- (uiz_t
)j
> 0 && cp
[-j
] == '\\'; ++j
)
818 * struct n_string TODO extend, optimize
822 (n_string_clear
)(struct n_string
*self n_MEMORY_DEBUG_ARGS
){
825 assert(self
!= NULL
);
827 if(self
->s_size
!= 0){
829 (n_free
)(self
->s_dat n_MEMORY_DEBUG_ARGSCALL
);
831 self
->s_len
= self
->s_auto
= self
->s_size
= 0;
839 (n_string_reserve
)(struct n_string
*self
, size_t noof n_MEMORY_DEBUG_ARGS
){
843 assert(self
!= NULL
);
847 #if 0 /* FIXME memory alloc too large */
848 if(SI32_MAX
- n_ALIGN(1) - l
<= noof
)
849 n_panic(_("Memory allocation too large"));
852 if((i
= s
- l
) <= ++noof
){
853 i
+= l
+ (ui32_t
)noof
;
858 self
->s_dat
= (n_realloc
)(self
->s_dat
, i n_MEMORY_DEBUG_ARGSCALL
);
860 char *ndat
= (n_autorec_alloc_from_pool
)(NULL
, i
861 n_MEMORY_DEBUG_ARGSCALL
);
864 memcpy(ndat
, self
->s_dat
, l
);
873 (n_string_resize
)(struct n_string
*self
, size_t nlen n_MEMORY_DEBUG_ARGS
){
876 assert(self
!= NULL
);
877 #if 0 /* FIXME memory alloc too large */
878 if(SI32_MAX
- n_ALIGN(1) - l
<= noof
)
879 n_panic(_("Memory allocation too large"));
882 if(self
->s_len
< nlen
)
883 self
= (n_string_reserve
)(self
, nlen n_MEMORY_DEBUG_ARGSCALL
);
884 self
->s_len
= (ui32_t
)nlen
;
890 (n_string_push_buf
)(struct n_string
*self
, char const *buf
, size_t buflen
891 n_MEMORY_DEBUG_ARGS
){
894 assert(self
!= NULL
);
895 assert(buflen
== 0 || buf
!= NULL
);
897 if(buflen
== UIZ_MAX
)
898 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
903 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
904 memcpy(&self
->s_dat
[i
= self
->s_len
], buf
, buflen
);
905 self
->s_len
= (i
+= (ui32_t
)buflen
);
912 (n_string_push_c
)(struct n_string
*self
, char c n_MEMORY_DEBUG_ARGS
){
915 assert(self
!= NULL
);
917 if(self
->s_len
+ 1 >= self
->s_size
)
918 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
919 self
->s_dat
[self
->s_len
++] = c
;
925 (n_string_unshift_buf
)(struct n_string
*self
, char const *buf
, size_t buflen
926 n_MEMORY_DEBUG_ARGS
){
929 assert(self
!= NULL
);
930 assert(buflen
== 0 || buf
!= NULL
);
932 if(buflen
== UIZ_MAX
)
933 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
936 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
938 memmove(&self
->s_dat
[buflen
], self
->s_dat
, self
->s_len
);
939 memcpy(self
->s_dat
, buf
, buflen
);
940 self
->s_len
+= (ui32_t
)buflen
;
947 (n_string_unshift_c
)(struct n_string
*self
, char c n_MEMORY_DEBUG_ARGS
){
950 assert(self
!= NULL
);
952 if(self
->s_len
+ 1 >= self
->s_size
)
953 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
955 memmove(&self
->s_dat
[1], self
->s_dat
, self
->s_len
);
963 (n_string_insert_buf
)(struct n_string
*self
, size_t idx
,
964 char const *buf
, size_t buflen n_MEMORY_DEBUG_ARGS
){
967 assert(self
!= NULL
);
968 assert(buflen
== 0 || buf
!= NULL
);
969 assert(idx
<= self
->s_len
);
971 if(buflen
== UIZ_MAX
)
972 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
975 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
977 memmove(&self
->s_dat
[idx
+ buflen
], &self
->s_dat
[idx
],
979 memcpy(&self
->s_dat
[idx
], buf
, buflen
);
980 self
->s_len
+= (ui32_t
)buflen
;
987 (n_string_insert_c
)(struct n_string
*self
, size_t idx
,
988 char c n_MEMORY_DEBUG_ARGS
){
991 assert(self
!= NULL
);
992 assert(idx
<= self
->s_len
);
994 if(self
->s_len
+ 1 >= self
->s_size
)
995 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
997 memmove(&self
->s_dat
[idx
+ 1], &self
->s_dat
[idx
], self
->s_len
- idx
);
998 self
->s_dat
[idx
] = c
;
1004 FL
struct n_string
*
1005 n_string_cut(struct n_string
*self
, size_t idx
, size_t len
){
1008 assert(self
!= NULL
);
1009 assert(UIZ_MAX
- idx
> len
);
1010 assert(SI32_MAX
>= idx
+ len
);
1011 assert(idx
+ len
<= self
->s_len
);
1014 memmove(&self
->s_dat
[idx
], &self
->s_dat
[idx
+ len
],
1015 (self
->s_len
-= len
) - idx
);
1021 (n_string_cp
)(struct n_string
*self n_MEMORY_DEBUG_ARGS
){
1025 assert(self
!= NULL
);
1027 if(self
->s_size
== 0)
1028 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
1030 (rv
= self
->s_dat
)[self
->s_len
] = '\0';
1036 n_string_cp_const(struct n_string
const *self
){
1040 assert(self
!= NULL
);
1042 if(self
->s_size
!= 0){
1043 ((struct n_string
*)n_UNCONST(self
))->s_dat
[self
->s_len
] = '\0';
1056 n_utf8_to_utf32(char const **bdat
, size_t *blen
) /* TODO check false UTF8 */
1070 if ((x
& 0xE0u
) == 0xC0u
) {
1075 } else if ((x
& 0xF0u
) == 0xE0u
) {
1111 n_utf32_to_utf8(ui32_t c
, char *buf
)
1118 ui8_t dec_leader_mask
;
1119 ui8_t dec_leader_val_mask
;
1120 ui8_t dec_bytes_togo
;
1124 {0x00000000, 0x00000000, 0x00, 0, 0x00, 0x00, 0, 0, {0,}},
1125 {0x00000000, 0x0000007F, 0x00, 1, 0x80, 0x7F, 1-1, 1, {0,}},
1126 {0x00000080, 0x000007FF, 0xC0, 2, 0xE0, 0xFF-0xE0, 2-1, 2, {0,}},
1127 /* We assume surrogates are U+D800 - U+DFFF, _cat index 3 */
1128 /* xxx _from_utf32() simply assumes magic code points for surrogates!
1129 * xxx (However, should we ever get yet another surrogate range we
1130 * xxx need to deal with that all over the place anyway? */
1131 {0x00000800, 0x0000FFFF, 0xE0, 3, 0xF0, 0xFF-0xF0, 3-1, 3, {0,}},
1132 {0x00010000, 0x0010FFFF, 0xF0, 4, 0xF8, 0xFF-0xF8, 4-1, 4, {0,}},
1136 if (c
<= _cat
[0].upper_bound
) { catp
+= 0; goto j0
; }
1137 if (c
<= _cat
[1].upper_bound
) { catp
+= 1; goto j1
; }
1138 if (c
<= _cat
[2].upper_bound
) { catp
+= 2; goto j2
; }
1139 if (c
<= _cat
[3].upper_bound
) {
1140 /* Surrogates may not be converted (Compatibility rule C10) */
1141 if (c
>= 0xD800u
&& c
<= 0xDFFFu
)
1146 if (c
<= _cat
[4].upper_bound
) { catp
+= 4; goto j4
; }
1148 c
= 0xFFFDu
; /* Unicode replacement character */
1152 buf
[3] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
1154 buf
[2] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
1156 buf
[1] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
1158 buf
[0] = (char)catp
->enc_leader
| (char)(c
);
1160 buf
[catp
->enc_lval
] = '\0';
1167 * Our iconv(3) wrapper
1172 n_iconv_open(char const *tocode
, char const *fromcode
){
1176 if((!asccasecmp(fromcode
, "unknown-8bit") ||
1177 !asccasecmp(fromcode
, "binary")) &&
1178 (fromcode
= ok_vlook(charset_unknown_8bit
)) == NULL
)
1179 fromcode
= ok_vlook(CHARSET_8BIT_OKEY
);
1181 id
= iconv_open(tocode
, fromcode
);
1183 /* If the encoding names are equal at this point, they are just not
1184 * understood by iconv(), and we cannot sensibly use it in any way. We do
1185 * not perform this as an optimization above since iconv() can otherwise be
1186 * used to check the validity of the input even with identical encoding
1188 if (id
== (iconv_t
)-1 && !asccasecmp(tocode
, fromcode
))
1189 n_err_no
= n_ERR_NONE
;
1195 n_iconv_close(iconv_t cd
){
1199 iconvd
= (iconv_t
)-1;
1204 n_iconv_reset(iconv_t cd
){
1206 iconv(cd
, NULL
, NULL
, NULL
, NULL
);
1210 /* (2012-09-24: export and use it exclusively to isolate prototype problems
1211 * (*inb* is 'char const **' except in POSIX) in a single place.
1212 * GNU libiconv even allows for configuration time const/non-const..
1213 * In the end it's an ugly guess, but we can't do better since make(1) doesn't
1214 * support compiler invocations which bail on error, so no -Werror */
1215 /* Citrus project? */
1216 # if defined _ICONV_H_ && defined __ICONV_F_HIDE_INVALID
1217 /* DragonFly 3.2.1 is special TODO newer DragonFly too, but different */
1219 # define __INBCAST(S) (char ** __restrict__)n_UNCONST(S)
1221 # define __INBCAST(S) (char const **)n_UNCONST(S)
1223 # elif n_OS_SUNOS || n_OS_SOLARIS
1224 # define __INBCAST(S) (char const ** __restrict__)n_UNCONST(S)
1227 # define __INBCAST(S) (char **)n_UNCONST(S)
1231 n_iconv_buf(iconv_t cd
, enum n_iconv_flags icf
,
1232 char const **inb
, size_t *inbleft
, char **outb
, size_t *outbleft
){
1236 if((icf
& n_ICONV_UNIREPL
) && !(n_psonce
& n_PSO_UNICODE
))
1237 icf
&= ~n_ICONV_UNIREPL
;
1242 sz
= iconv(cd
, __INBCAST(inb
), inbleft
, outb
, outbleft
);
1243 if(sz
> 0 && !(icf
& n_ICONV_IGN_NOREVERSE
)){
1247 if(sz
!= (size_t)-1)
1251 if(!(icf
& n_ICONV_IGN_ILSEQ
) || err
!= n_ERR_ILSEQ
)
1256 if(icf
& n_ICONV_UNIREPL
){
1257 if(*outbleft
>= sizeof(n_unirepl
) -1){
1258 memcpy(*outb
, n_unirepl
, sizeof(n_unirepl
) -1);
1259 *outb
+= sizeof(n_unirepl
) -1;
1260 *outbleft
-= sizeof(n_unirepl
) -1;
1263 }else if(*outbleft
> 0){
1270 }else if(*outbleft
> 0){
1283 n_iconv_str(iconv_t cd
, enum n_iconv_flags icf
,
1284 struct str
*out
, struct str
const *in
, struct str
*in_rest_or_null
)
1296 ol
= (ol
<< 1) - (ol
>> 4);
1307 if((err
= n_iconv_buf(cd
, icf
, &ib
, &il
, &ob
, &ol
)) == 0 ||
1312 obb
= n_realloc(obb
, olb
+1);
1315 if (in_rest_or_null
!= NULL
) {
1316 in_rest_or_null
->s
= n_UNCONST(ib
);
1317 in_rest_or_null
->l
= il
;
1320 out
->s
[out
->l
= olb
- ol
] = '\0';
1326 n_iconv_onetime_cp(enum n_iconv_flags icf
,
1327 char const *tocode
, char const *fromcode
, char const *input
){
1335 tocode
= ok_vlook(ttycharset
);
1336 if(fromcode
== NULL
)
1339 if((icd
= iconv_open(tocode
, fromcode
)) == (iconv_t
)-1)
1342 in
.l
= strlen(in
.s
= n_UNCONST(input
)); /* logical */
1343 out
.s
= NULL
, out
.l
= 0;
1344 if(!n_iconv_str(icd
, icf
, &out
, &in
, NULL
))
1345 rv
= savestrbuf(out
.s
, out
.l
);
1354 #endif /* HAVE_ICONV */