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 n_MEMORY_DEBUG_ARGSCALL
);
112 i_strcpy(dest
, src
, sz
);
120 str_concat_csvl(struct str
*self
, ...) /* XXX onepass maybe better here */
128 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;)
133 self
->s
= salloc(l
+1);
136 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;) {
141 memcpy(self
->s
+ l
, cs
, i
);
152 (str_concat_cpa
)(struct str
*self
, char const * const *cpa
,
153 char const *sep_o_null n_MEMORY_DEBUG_ARGS
)
156 char const * const *xcpa
;
159 sonl
= (sep_o_null
!= NULL
) ? strlen(sep_o_null
) : 0;
161 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
)
162 l
+= strlen(*xcpa
) + sonl
;
165 self
->s
= (n_autorec_alloc_from_pool
)(NULL
, l
+1 n_MEMORY_DEBUG_ARGSCALL
);
167 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
) {
172 memcpy(self
->s
+ l
, *xcpa
, i
);
176 memcpy(self
->s
+ l
, sep_o_null
, sonl
);
186 * Routines that are not related to auto-reclaimed storage follow.
190 n_anyof_buf(char const *template, char const *dat
, size_t len
){
195 while((c
= *template++) != '\0')
196 if(strchr(dat
, c
) != NULL
)
199 while((c
= *template++) != '\0')
200 if(memchr(dat
, c
, len
) != NULL
)
209 n_strsep(char **iolist
, char sep
, bool_t ignore_empty
){
213 for(base
= *iolist
; base
!= NULL
; base
= *iolist
){
214 while(*base
!= '\0' && blankspacechar(*base
))
217 cp
= strchr(base
, sep
);
222 cp
= &base
[strlen(base
)];
224 while(cp
> base
&& blankspacechar(cp
[-1]))
227 if(*base
!= '\0' || !ignore_empty
)
235 n_strsep_esc(char **iolist
, char sep
, bool_t ignore_empty
){
237 bool_t isesc
, anyesc
;
240 for(base
= *iolist
; base
!= NULL
; base
= *iolist
){
241 while((c
= *base
) != '\0' && blankspacechar(c
))
244 for(isesc
= anyesc
= FAL0
, cp
= base
;; ++cp
){
245 if(n_UNLIKELY((c
= *cp
) == '\0')){
256 anyesc
|= (c
== sep
);
260 while(cp
> base
&& blankspacechar(cp
[-1]))
268 for(ins
= cp
= base
;; ++ins
)
269 if((c
= *cp
) == '\\' && cp
[1] == sep
){
272 }else if((*ins
= (++cp
, c
)) == '\0')
277 if(*base
!= '\0' || !ignore_empty
)
285 i_strcpy(char *dest
, char const *src
, size_t size
)
289 for(;; ++dest
, ++src
)
290 if((*dest
= lowerconv(*src
)) == '\0'){
292 }else if(--size
== 0){
301 is_prefix(char const *as1
, char const *as2
) /* TODO arg order */
306 for (; (c
= *as1
) == *as2
&& c
!= '\0'; ++as1
, ++as2
)
314 string_quote(char const *v
) /* TODO too simpleminded (getrawlist(), +++ ..) */
321 for (i
= 0, cp
= v
; (c
= *cp
) != '\0'; ++i
, ++cp
)
322 if (c
== '"' || c
== '\\')
326 for (i
= 0, cp
= v
; (c
= *cp
) != '\0'; rv
[i
++] = c
, ++cp
)
327 if (c
== '"' || c
== '\\')
335 laststring(char *linebuf
, bool_t
*needs_list
, bool_t strip
)
337 char *cp
, *p
, quoted
;
340 /* Anything to do at all? */
341 if (*(cp
= linebuf
) == '\0')
343 cp
+= strlen(linebuf
) -1;
345 /* Strip away trailing blanks */
346 while (spacechar(*cp
) && cp
> linebuf
)
352 /* Now search for the BOS of the "last string" */
354 if (quoted
== '\'' || quoted
== '"') {
360 while (cp
> linebuf
) {
365 } else if (!spacechar(*cp
))
367 if (cp
== linebuf
|| cp
[-1] != '\\') {
368 /* When in whitespace mode, WS prefix doesn't belong */
373 /* Expand the escaped quote character */
374 for (p
= --cp
; (p
[0] = p
[1]) != '\0'; ++p
)
377 if (strip
&& quoted
!= ' ' && *cp
== quoted
)
378 for (p
= cp
; (p
[0] = p
[1]) != '\0'; ++p
)
381 /* The "last string" has been skipped over, but still, try to step backwards
382 * until we are at BOS or see whitespace, so as to make possible things like
383 * "? copy +'x y.mbox'" or even "? copy +x\ y.mbox" */
384 while (cp
> linebuf
) {
386 if (spacechar(*cp
)) {
389 /* We can furtherly release our callees if we now decide whether the
390 * remaining non-"last string" line content contains non-WS */
391 while (--p
>= linebuf
)
400 if (cp
!= NULL
&& *cp
== '\0')
402 *needs_list
= (cp
!= linebuf
&& *linebuf
!= '\0');
413 makelow(char *cp
) /* TODO isn't that crap? --> */
416 #ifdef HAVE_C90AMEND1
417 if (n_mb_cur_max
> 1) {
422 while (*cp
!= '\0') {
423 len
= mbtowc(&wc
, cp
, n_mb_cur_max
);
428 if (wctomb(tp
, wc
) == len
)
429 tp
+= len
, cp
+= len
;
431 *tp
++ = *cp
++; /* <-- at least here */
438 *cp
= tolower((uc_i
)*cp
);
439 while (*cp
++ != '\0');
445 substr(char const *str
, char const *sub
)
447 char const *cp
, *backup
;
452 while (*str
!= '\0' && *cp
!= '\0') {
453 #ifdef HAVE_C90AMEND1
454 if (n_mb_cur_max
> 1) {
458 if ((sz
= mbtowc(&c
, cp
, n_mb_cur_max
)) == -1)
461 if ((sz
= mbtowc(&c2
, str
, n_mb_cur_max
)) == -1)
467 if ((sz
= mbtowc(&c
, backup
, n_mb_cur_max
)) > 0) {
493 return (*cp
== '\0');
497 sstpcpy(char *dst
, char const *src
)
500 while ((*dst
= *src
++) != '\0')
507 (sstrdup
)(char const *cp n_MEMORY_DEBUG_ARGS
)
512 dp
= (cp
== NULL
) ? NULL
: (sbufdup
)(cp
, strlen(cp
) n_MEMORY_DEBUG_ARGSCALL
);
518 (sbufdup
)(char const *cp
, size_t len n_MEMORY_DEBUG_ARGS
)
523 dp
= (n_alloc
)(len
+1 n_MEMORY_DEBUG_ARGSCALL
);
532 n_strscpy(char *dst
, char const *src
, size_t dstsize
){
536 if(n_LIKELY(dstsize
> 0)){
539 if((dst
[rv
] = src
[rv
]) == '\0')
542 }while(--dstsize
> 0);
556 asccasecmp(char const *s1
, char const *s2
)
562 char c1
= *s1
++, c2
= *s2
++;
563 if ((cmp
= lowerconv(c1
) - lowerconv(c2
)) != 0 || c1
== '\0')
571 ascncasecmp(char const *s1
, char const *s2
, size_t sz
)
577 char c1
= *s1
++, c2
= *s2
++;
578 cmp
= (ui8_t
)lowerconv(c1
);
579 cmp
-= (ui8_t
)lowerconv(c2
);
580 if (cmp
!= 0 || c1
== '\0')
588 asccasestr(char const *s1
, char const *s2
)
593 for (c2
= *s2
++, c2
= lowerconv(c2
);;) {
594 if ((c1
= *s1
++) == '\0') {
598 if (lowerconv(c1
) == c2
&& is_asccaseprefix(s2
, s1
)) {
608 is_asccaseprefix(char const *as1
, char const *as2
) /* TODO arg order */
613 for(;; ++as1
, ++as2
){
619 if(c1
!= c2
|| c1
== '\0')
629 is_ascncaseprefix(char const *as1
, char const *as2
, size_t sz
)
635 for(rv
= TRU1
; sz
-- > 0; ++as1
, ++as2
){
641 if(!(rv
= (c1
== c2
)) || c1
== '\0')
652 (n_str_assign_buf
)(struct str
*self
, char const *buf
, uiz_t buflen
653 n_MEMORY_DEBUG_ARGS
){
655 if(buflen
== UIZ_MAX
)
656 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
658 assert(buflen
== 0 || buf
!= NULL
);
660 if(n_LIKELY(buflen
> 0)){
661 self
->s
= (n_realloc
)(self
->s
, (self
->l
= buflen
) +1
662 n_MEMORY_DEBUG_ARGSCALL
);
663 memcpy(self
->s
, buf
, buflen
);
664 self
->s
[buflen
] = '\0';
672 (n_str_add_buf
)(struct str
*self
, char const *buf
, uiz_t buflen
673 n_MEMORY_DEBUG_ARGS
){
675 if(buflen
== UIZ_MAX
)
676 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
678 assert(buflen
== 0 || buf
!= NULL
);
681 size_t osl
= self
->l
, nsl
= osl
+ buflen
;
683 self
->s
= (n_realloc
)(self
->s
, (self
->l
= nsl
) +1
684 n_MEMORY_DEBUG_ARGSCALL
);
685 memcpy(self
->s
+ osl
, buf
, buflen
);
693 n_str_trim(struct str
*self
, enum n_str_trim_flags stf
){
700 if((l
= self
->l
) > 0 && (stf
& n_STR_TRIM_FRONT
)){
701 while(spacechar(*cp
)){
706 self
->s
= n_UNCONST(cp
);
709 if(l
> 0 && (stf
& n_STR_TRIM_END
)){
710 for(cp
+= l
-1; spacechar(*cp
); --cp
)
721 n_str_trim_ifs(struct str
*self
, bool_t dodefaults
){
723 char const *ifs
, *cp
;
727 if((l
= self
->l
) == 0)
730 ifs
= ok_vlook(ifs_ws
);
734 /* Check whether we can go fast(er) path */
735 for(i
= 0; (c
= ifs
[i
]) != '\0'; ++i
){
737 case ' ': s
= c
; break;
738 case '\t': t
= c
; break;
739 case '\n': n
= c
; break;
741 /* Need to go the slow path */
742 while(strchr(ifs
, *cp
) != NULL
){
747 self
->s
= n_UNCONST(cp
);
750 for(cp
+= l
-1; strchr(ifs
, *cp
) != NULL
;){
753 /* An uneven number of reverse solidus escapes last WS! */
754 else if(*--cp
== '\\'){
757 for(j
= 1; l
- (uiz_t
)j
> 0 && cp
[-j
] == '\\'; ++j
)
776 /* No ifs-ws? No more data? No trimming */
777 if(l
== 0 || (i
== 0 && !dodefaults
))
787 while((c
= *cp
) != '\0' && (c
== s
|| c
== t
|| c
== n
)){
792 self
->s
= n_UNCONST(cp
);
796 for(cp
+= l
-1; (c
= *cp
) != '\0' && (c
== s
|| c
== t
|| c
== n
);){
799 /* An uneven number of reverse solidus escapes last WS! */
800 else if(*--cp
== '\\'){
803 for(j
= 1; l
- (uiz_t
)j
> 0 && cp
[-j
] == '\\'; ++j
)
819 * struct n_string TODO extend, optimize
823 (n_string_clear
)(struct n_string
*self n_MEMORY_DEBUG_ARGS
){
826 assert(self
!= NULL
);
828 if(self
->s_size
!= 0){
830 (n_free
)(self
->s_dat n_MEMORY_DEBUG_ARGSCALL
);
832 self
->s_len
= self
->s_auto
= self
->s_size
= 0;
840 (n_string_reserve
)(struct n_string
*self
, size_t noof n_MEMORY_DEBUG_ARGS
){
844 assert(self
!= NULL
);
848 #if 0 /* FIXME memory alloc too large */
849 if(SI32_MAX
- n_ALIGN(1) - l
<= noof
)
850 n_panic(_("Memory allocation too large"));
853 if((i
= s
- l
) <= ++noof
){
854 i
+= l
+ (ui32_t
)noof
;
859 self
->s_dat
= (n_realloc
)(self
->s_dat
, i n_MEMORY_DEBUG_ARGSCALL
);
861 char *ndat
= (n_autorec_alloc_from_pool
)(NULL
, i
862 n_MEMORY_DEBUG_ARGSCALL
);
865 memcpy(ndat
, self
->s_dat
, l
);
874 (n_string_resize
)(struct n_string
*self
, size_t nlen n_MEMORY_DEBUG_ARGS
){
877 assert(self
!= NULL
);
878 #if 0 /* FIXME memory alloc too large */
879 if(SI32_MAX
- n_ALIGN(1) - l
<= noof
)
880 n_panic(_("Memory allocation too large"));
883 if(self
->s_len
< nlen
)
884 self
= (n_string_reserve
)(self
, nlen n_MEMORY_DEBUG_ARGSCALL
);
885 self
->s_len
= (ui32_t
)nlen
;
891 (n_string_push_buf
)(struct n_string
*self
, char const *buf
, size_t buflen
892 n_MEMORY_DEBUG_ARGS
){
895 assert(self
!= NULL
);
896 assert(buflen
== 0 || buf
!= NULL
);
898 if(buflen
== UIZ_MAX
)
899 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
904 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
905 memcpy(&self
->s_dat
[i
= self
->s_len
], buf
, buflen
);
906 self
->s_len
= (i
+= (ui32_t
)buflen
);
913 (n_string_push_c
)(struct n_string
*self
, char c n_MEMORY_DEBUG_ARGS
){
916 assert(self
!= NULL
);
918 if(self
->s_len
+ 1 >= self
->s_size
)
919 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
920 self
->s_dat
[self
->s_len
++] = c
;
926 (n_string_unshift_buf
)(struct n_string
*self
, char const *buf
, size_t buflen
927 n_MEMORY_DEBUG_ARGS
){
930 assert(self
!= NULL
);
931 assert(buflen
== 0 || buf
!= NULL
);
933 if(buflen
== UIZ_MAX
)
934 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
937 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
939 memmove(&self
->s_dat
[buflen
], self
->s_dat
, self
->s_len
);
940 memcpy(self
->s_dat
, buf
, buflen
);
941 self
->s_len
+= (ui32_t
)buflen
;
948 (n_string_unshift_c
)(struct n_string
*self
, char c n_MEMORY_DEBUG_ARGS
){
951 assert(self
!= NULL
);
953 if(self
->s_len
+ 1 >= self
->s_size
)
954 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
956 memmove(&self
->s_dat
[1], self
->s_dat
, self
->s_len
);
964 (n_string_insert_buf
)(struct n_string
*self
, size_t idx
,
965 char const *buf
, size_t buflen n_MEMORY_DEBUG_ARGS
){
968 assert(self
!= NULL
);
969 assert(buflen
== 0 || buf
!= NULL
);
970 assert(idx
<= self
->s_len
);
972 if(buflen
== UIZ_MAX
)
973 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
976 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
978 memmove(&self
->s_dat
[idx
+ buflen
], &self
->s_dat
[idx
],
980 memcpy(&self
->s_dat
[idx
], buf
, buflen
);
981 self
->s_len
+= (ui32_t
)buflen
;
988 (n_string_insert_c
)(struct n_string
*self
, size_t idx
,
989 char c n_MEMORY_DEBUG_ARGS
){
992 assert(self
!= NULL
);
993 assert(idx
<= self
->s_len
);
995 if(self
->s_len
+ 1 >= self
->s_size
)
996 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
998 memmove(&self
->s_dat
[idx
+ 1], &self
->s_dat
[idx
], self
->s_len
- idx
);
999 self
->s_dat
[idx
] = c
;
1005 FL
struct n_string
*
1006 n_string_cut(struct n_string
*self
, size_t idx
, size_t len
){
1009 assert(self
!= NULL
);
1010 assert(UIZ_MAX
- idx
> len
);
1011 assert(SI32_MAX
>= idx
+ len
);
1012 assert(idx
+ len
<= self
->s_len
);
1015 memmove(&self
->s_dat
[idx
], &self
->s_dat
[idx
+ len
],
1016 (self
->s_len
-= len
) - idx
);
1022 (n_string_cp
)(struct n_string
*self n_MEMORY_DEBUG_ARGS
){
1026 assert(self
!= NULL
);
1028 if(self
->s_size
== 0)
1029 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
1031 (rv
= self
->s_dat
)[self
->s_len
] = '\0';
1037 n_string_cp_const(struct n_string
const *self
){
1041 assert(self
!= NULL
);
1043 if(self
->s_size
!= 0){
1044 ((struct n_string
*)n_UNCONST(self
))->s_dat
[self
->s_len
] = '\0';
1057 n_utf8_to_utf32(char const **bdat
, size_t *blen
) /* TODO check false UTF8 */
1071 /* TODO UTF-8 decoder false sequences: Zhang Boyang, TinyCC [a82c11f] */
1072 if ((x
& 0xE0u
) == 0xC0u
) {
1077 } else if ((x
& 0xF0u
) == 0xE0u
) {
1113 n_utf32_to_utf8(ui32_t c
, char *buf
)
1120 ui8_t dec_leader_mask
;
1121 ui8_t dec_leader_val_mask
;
1122 ui8_t dec_bytes_togo
;
1126 {0x00000000, 0x00000000, 0x00, 0, 0x00, 0x00, 0, 0, {0,}},
1127 {0x00000000, 0x0000007F, 0x00, 1, 0x80, 0x7F, 1-1, 1, {0,}},
1128 {0x00000080, 0x000007FF, 0xC0, 2, 0xE0, 0xFF-0xE0, 2-1, 2, {0,}},
1129 /* We assume surrogates are U+D800 - U+DFFF, _cat index 3 */
1130 /* xxx _from_utf32() simply assumes magic code points for surrogates!
1131 * xxx (However, should we ever get yet another surrogate range we
1132 * xxx need to deal with that all over the place anyway? */
1133 {0x00000800, 0x0000FFFF, 0xE0, 3, 0xF0, 0xFF-0xF0, 3-1, 3, {0,}},
1134 {0x00010000, 0x0010FFFF, 0xF0, 4, 0xF8, 0xFF-0xF8, 4-1, 4, {0,}},
1138 if (c
<= _cat
[0].upper_bound
) { catp
+= 0; goto j0
; }
1139 if (c
<= _cat
[1].upper_bound
) { catp
+= 1; goto j1
; }
1140 if (c
<= _cat
[2].upper_bound
) { catp
+= 2; goto j2
; }
1141 if (c
<= _cat
[3].upper_bound
) {
1142 /* Surrogates may not be converted (Compatibility rule C10) */
1143 if (c
>= 0xD800u
&& c
<= 0xDFFFu
)
1148 if (c
<= _cat
[4].upper_bound
) { catp
+= 4; goto j4
; }
1150 c
= 0xFFFDu
; /* Unicode replacement character */
1154 buf
[3] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
1156 buf
[2] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
1158 buf
[1] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
1160 buf
[0] = (char)catp
->enc_leader
| (char)(c
);
1162 buf
[catp
->enc_lval
] = '\0';
1169 * Our iconv(3) wrapper
1174 n_iconv_open(char const *tocode
, char const *fromcode
){
1178 if((!asccasecmp(fromcode
, "unknown-8bit") ||
1179 !asccasecmp(fromcode
, "binary")) &&
1180 (fromcode
= ok_vlook(charset_unknown_8bit
)) == NULL
)
1181 fromcode
= ok_vlook(CHARSET_8BIT_OKEY
);
1183 id
= iconv_open(tocode
, fromcode
);
1185 /* If the encoding names are equal at this point, they are just not
1186 * understood by iconv(), and we cannot sensibly use it in any way. We do
1187 * not perform this as an optimization above since iconv() can otherwise be
1188 * used to check the validity of the input even with identical encoding
1190 if (id
== (iconv_t
)-1 && !asccasecmp(tocode
, fromcode
))
1191 n_err_no
= n_ERR_NONE
;
1197 n_iconv_close(iconv_t cd
){
1201 iconvd
= (iconv_t
)-1;
1206 n_iconv_reset(iconv_t cd
){
1208 iconv(cd
, NULL
, NULL
, NULL
, NULL
);
1212 /* (2012-09-24: export and use it exclusively to isolate prototype problems
1213 * (*inb* is 'char const **' except in POSIX) in a single place.
1214 * GNU libiconv even allows for configuration time const/non-const..
1215 * In the end it's an ugly guess, but we can't do better since make(1) doesn't
1216 * support compiler invocations which bail on error, so no -Werror */
1217 /* Citrus project? */
1218 # if defined _ICONV_H_ && defined __ICONV_F_HIDE_INVALID
1219 /* DragonFly 3.2.1 is special TODO newer DragonFly too, but different */
1221 # define __INBCAST(S) (char ** __restrict__)n_UNCONST(S)
1223 # define __INBCAST(S) (char const **)n_UNCONST(S)
1225 # elif n_OS_SUNOS || n_OS_SOLARIS
1226 # define __INBCAST(S) (char const ** __restrict__)n_UNCONST(S)
1229 # define __INBCAST(S) (char **)n_UNCONST(S)
1233 n_iconv_buf(iconv_t cd
, enum n_iconv_flags icf
,
1234 char const **inb
, size_t *inbleft
, char **outb
, size_t *outbleft
){
1238 if((icf
& n_ICONV_UNIREPL
) && !(n_psonce
& n_PSO_UNICODE
))
1239 icf
&= ~n_ICONV_UNIREPL
;
1244 sz
= iconv(cd
, __INBCAST(inb
), inbleft
, outb
, outbleft
);
1245 if(sz
> 0 && !(icf
& n_ICONV_IGN_NOREVERSE
)){
1249 if(sz
!= (size_t)-1)
1253 if(!(icf
& n_ICONV_IGN_ILSEQ
) || err
!= n_ERR_ILSEQ
)
1258 if(icf
& n_ICONV_UNIREPL
){
1259 if(*outbleft
>= sizeof(n_unirepl
) -1){
1260 memcpy(*outb
, n_unirepl
, sizeof(n_unirepl
) -1);
1261 *outb
+= sizeof(n_unirepl
) -1;
1262 *outbleft
-= sizeof(n_unirepl
) -1;
1265 }else if(*outbleft
> 0){
1272 }else if(*outbleft
> 0){
1279 n_iconv_err_no
= err
;
1286 n_iconv_str(iconv_t cd
, enum n_iconv_flags icf
,
1287 struct str
*out
, struct str
const *in
, struct str
*in_rest_or_null
)
1299 ol
= (ol
<< 1) - (ol
>> 4);
1310 if((err
= n_iconv_buf(cd
, icf
, &ib
, &il
, &ob
, &ol
)) == 0 ||
1315 obb
= n_realloc(obb
, olb
+1);
1318 if (in_rest_or_null
!= NULL
) {
1319 in_rest_or_null
->s
= n_UNCONST(ib
);
1320 in_rest_or_null
->l
= il
;
1323 out
->s
[out
->l
= olb
- ol
] = '\0';
1329 n_iconv_onetime_cp(enum n_iconv_flags icf
,
1330 char const *tocode
, char const *fromcode
, char const *input
){
1338 tocode
= ok_vlook(ttycharset
);
1339 if(fromcode
== NULL
)
1342 if((icd
= iconv_open(tocode
, fromcode
)) == (iconv_t
)-1)
1345 in
.l
= strlen(in
.s
= n_UNCONST(input
)); /* logical */
1346 out
.s
= NULL
, out
.l
= 0;
1347 if(!n_iconv_str(icd
, icf
, &out
, &in
, NULL
))
1348 rv
= savestrbuf(out
.s
, out
.l
);
1357 #endif /* HAVE_ICONV */