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
)
51 size
= strlen(str
) +1;
52 news
= (n_autorec_alloc
)(NULL
, size n_MEMORY_DEBUG_ARGSCALL
);
53 memcpy(news
, str
, size
);
59 (savestrbuf
)(char const *sbuf
, size_t sbuf_len n_MEMORY_DEBUG_ARGS
)
64 news
= (n_autorec_alloc
)(NULL
, sbuf_len
+1 n_MEMORY_DEBUG_ARGSCALL
);
65 memcpy(news
, sbuf
, sbuf_len
);
72 (savecatsep
)(char const *s1
, char sep
, char const *s2 n_MEMORY_DEBUG_ARGS
)
78 l1
= (s1
!= NULL
) ? strlen(s1
) : 0;
80 news
= (n_autorec_alloc
)(NULL
, l1
+ (sep
!= '\0') + l2
+1
81 n_MEMORY_DEBUG_ARGSCALL
);
83 memcpy(news
+ 0, s1
, l1
);
87 memcpy(news
+ l1
, s2
, l2
);
94 * Support routines, auto-reclaimed storage
98 (i_strdup
)(char const *src n_MEMORY_DEBUG_ARGS
)
105 dest
= (n_autorec_alloc
)(NULL
, sz n_MEMORY_DEBUG_ARGSCALL
);
106 i_strcpy(dest
, src
, sz
);
112 str_concat_csvl(struct str
*self
, ...) /* XXX onepass maybe better here */
120 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;)
125 self
->s
= salloc(l
+1);
128 for (l
= 0; (cs
= va_arg(vl
, char const*)) != NULL
;) {
129 size_t i
= strlen(cs
);
130 memcpy(self
->s
+ l
, cs
, i
);
140 (str_concat_cpa
)(struct str
*self
, char const * const *cpa
,
141 char const *sep_o_null n_MEMORY_DEBUG_ARGS
)
144 char const * const *xcpa
;
147 sonl
= (sep_o_null
!= NULL
) ? strlen(sep_o_null
) : 0;
149 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
)
150 l
+= strlen(*xcpa
) + sonl
;
153 self
->s
= (n_autorec_alloc
)(NULL
, l
+1 n_MEMORY_DEBUG_ARGSCALL
);
155 for (l
= 0, xcpa
= cpa
; *xcpa
!= NULL
; ++xcpa
) {
156 size_t i
= strlen(*xcpa
);
157 memcpy(self
->s
+ l
, *xcpa
, i
);
160 memcpy(self
->s
+ l
, sep_o_null
, sonl
);
170 * Routines that are not related to auto-reclaimed storage follow.
174 n_anyof_buf(char const *template, char const *dat
, size_t len
){
179 while((c
= *template++) != '\0')
180 if(strchr(dat
, c
) != NULL
)
183 while((c
= *template++) != '\0')
184 if(memchr(dat
, c
, len
) != NULL
)
193 n_strsep(char **iolist
, char sep
, bool_t ignore_empty
)
198 for (base
= *iolist
; base
!= NULL
; base
= *iolist
) {
199 while (*base
!= '\0' && blankspacechar(*base
))
201 cp
= strchr(base
, sep
);
206 cp
= base
+ strlen(base
);
208 while (cp
> base
&& blankspacechar(cp
[-1]))
211 if (*base
!= '\0' || !ignore_empty
)
219 i_strcpy(char *dest
, char const *src
, size_t size
)
223 for (;; ++dest
, ++src
)
224 if ((*dest
= lowerconv(*src
)) == '\0') {
226 } else if (--size
== 0) {
235 is_prefix(char const *as1
, char const *as2
) /* TODO arg order */
240 for (; (c
= *as1
) == *as2
&& c
!= '\0'; ++as1
, ++as2
)
248 string_quote(char const *v
) /* TODO too simpleminded (getrawlist(), +++ ..) */
255 for (i
= 0, cp
= v
; (c
= *cp
) != '\0'; ++i
, ++cp
)
256 if (c
== '"' || c
== '\\')
260 for (i
= 0, cp
= v
; (c
= *cp
) != '\0'; rv
[i
++] = c
, ++cp
)
261 if (c
== '"' || c
== '\\')
269 laststring(char *linebuf
, bool_t
*needs_list
, bool_t strip
)
271 char *cp
, *p
, quoted
;
274 /* Anything to do at all? */
275 if (*(cp
= linebuf
) == '\0')
277 cp
+= strlen(linebuf
) -1;
279 /* Strip away trailing blanks */
280 while (spacechar(*cp
) && cp
> linebuf
)
286 /* Now search for the BOS of the "last string" */
288 if (quoted
== '\'' || quoted
== '"') {
294 while (cp
> linebuf
) {
299 } else if (!spacechar(*cp
))
301 if (cp
== linebuf
|| cp
[-1] != '\\') {
302 /* When in whitespace mode, WS prefix doesn't belong */
307 /* Expand the escaped quote character */
308 for (p
= --cp
; (p
[0] = p
[1]) != '\0'; ++p
)
311 if (strip
&& quoted
!= ' ' && *cp
== quoted
)
312 for (p
= cp
; (p
[0] = p
[1]) != '\0'; ++p
)
315 /* The "last string" has been skipped over, but still, try to step backwards
316 * until we are at BOS or see whitespace, so as to make possible things like
317 * "? copy +'x y.mbox'" or even "? copy +x\ y.mbox" */
318 while (cp
> linebuf
) {
320 if (spacechar(*cp
)) {
323 /* We can furtherly release our callees if we now decide whether the
324 * remaining non-"last string" line content contains non-WS */
325 while (--p
>= linebuf
)
334 if (cp
!= NULL
&& *cp
== '\0')
336 *needs_list
= (cp
!= linebuf
&& *linebuf
!= '\0');
347 makelow(char *cp
) /* TODO isn't that crap? --> */
350 #ifdef HAVE_C90AMEND1
351 if (mb_cur_max
> 1) {
356 while (*cp
!= '\0') {
357 len
= mbtowc(&wc
, cp
, mb_cur_max
);
362 if (wctomb(tp
, wc
) == len
)
363 tp
+= len
, cp
+= len
;
365 *tp
++ = *cp
++; /* <-- at least here */
372 *cp
= tolower((uc_i
)*cp
);
373 while (*cp
++ != '\0');
379 substr(char const *str
, char const *sub
)
381 char const *cp
, *backup
;
386 while (*str
!= '\0' && *cp
!= '\0') {
387 #ifdef HAVE_C90AMEND1
388 if (mb_cur_max
> 1) {
392 if ((sz
= mbtowc(&c
, cp
, mb_cur_max
)) == -1)
395 if ((sz
= mbtowc(&c2
, str
, mb_cur_max
)) == -1)
401 if ((sz
= mbtowc(&c
, backup
, mb_cur_max
)) > 0) {
427 return (*cp
== '\0');
431 sstpcpy(char *dst
, char const *src
)
434 while ((*dst
= *src
++) != '\0')
441 (sstrdup
)(char const *cp n_MEMORY_DEBUG_ARGS
)
446 dp
= (cp
== NULL
) ? NULL
: (sbufdup
)(cp
, strlen(cp
) n_MEMORY_DEBUG_ARGSCALL
);
452 (sbufdup
)(char const *cp
, size_t len n_MEMORY_DEBUG_ARGS
)
457 dp
= (n_alloc
)(len
+1 n_MEMORY_DEBUG_ARGSCALL
);
466 n_strscpy(char *dst
, char const *src
, size_t dstsize
){
470 if(n_LIKELY(dstsize
> 0)){
473 if((dst
[rv
] = src
[rv
]) == '\0')
476 }while(--dstsize
> 0);
490 asccasecmp(char const *s1
, char const *s2
)
496 char c1
= *s1
++, c2
= *s2
++;
497 if ((cmp
= lowerconv(c1
) - lowerconv(c2
)) != 0 || c1
== '\0')
505 ascncasecmp(char const *s1
, char const *s2
, size_t sz
)
511 char c1
= *s1
++, c2
= *s2
++;
512 cmp
= (ui8_t
)lowerconv(c1
);
513 cmp
-= (ui8_t
)lowerconv(c2
);
514 if (cmp
!= 0 || c1
== '\0')
522 asccasestr(char const *s1
, char const *s2
)
527 for (c2
= *s2
++, c2
= lowerconv(c2
);;) {
528 if ((c1
= *s1
++) == '\0') {
532 if (lowerconv(c1
) == c2
&& is_asccaseprefix(s2
, s1
)) {
542 is_asccaseprefix(char const *as1
, char const *as2
) /* TODO arg order */
547 for(;; ++as1
, ++as2
){
553 if(c1
!= c2
|| c1
== '\0')
563 (n_str_assign_buf
)(struct str
*self
, char const *buf
, uiz_t buflen
564 n_MEMORY_DEBUG_ARGS
){
566 if(buflen
== UIZ_MAX
)
567 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
569 assert(buflen
== 0 || buf
!= NULL
);
571 if(n_LIKELY(buflen
> 0)){
572 self
->s
= (n_realloc
)(self
->s
, (self
->l
= buflen
) +1
573 n_MEMORY_DEBUG_ARGSCALL
);
574 memcpy(self
->s
, buf
, buflen
);
575 self
->s
[buflen
] = '\0';
583 (n_str_add_buf
)(struct str
*self
, char const *buf
, uiz_t buflen
584 n_MEMORY_DEBUG_ARGS
){
586 if(buflen
== UIZ_MAX
)
587 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
589 assert(buflen
== 0 || buf
!= NULL
);
592 size_t osl
= self
->l
, nsl
= osl
+ buflen
;
594 self
->s
= (n_realloc
)(self
->s
, (self
->l
= nsl
) +1
595 n_MEMORY_DEBUG_ARGSCALL
);
596 memcpy(self
->s
+ osl
, buf
, buflen
);
604 * struct n_string TODO extend, optimize
608 (n_string_clear
)(struct n_string
*self n_MEMORY_DEBUG_ARGS
){
611 assert(self
!= NULL
);
613 if(self
->s_size
!= 0){
615 (n_free
)(self
->s_dat n_MEMORY_DEBUG_ARGSCALL
);
617 self
->s_len
= self
->s_auto
= self
->s_size
= 0;
625 (n_string_reserve
)(struct n_string
*self
, size_t noof n_MEMORY_DEBUG_ARGS
){
629 assert(self
!= NULL
);
633 #if 0 /* FIXME memory alloc too large */
634 if(SI32_MAX
- n_ALIGN(1) - l
<= noof
)
635 n_panic(_("Memory allocation too large"));
638 if((i
= s
- l
) <= ++noof
){
639 i
+= l
+ (ui32_t
)noof
;
644 self
->s_dat
= (n_realloc
)(self
->s_dat
, i n_MEMORY_DEBUG_ARGSCALL
);
646 char *ndat
= (n_autorec_alloc
)(NULL
, i n_MEMORY_DEBUG_ARGSCALL
);
649 memcpy(ndat
, self
->s_dat
, l
);
658 (n_string_resize
)(struct n_string
*self
, size_t nlen n_MEMORY_DEBUG_ARGS
){
661 assert(self
!= NULL
);
662 #if 0 /* FIXME memory alloc too large */
663 if(SI32_MAX
- n_ALIGN(1) - l
<= noof
)
664 n_panic(_("Memory allocation too large"));
667 if(self
->s_len
< nlen
)
668 self
= (n_string_reserve
)(self
, nlen n_MEMORY_DEBUG_ARGSCALL
);
669 self
->s_len
= (ui32_t
)nlen
;
675 (n_string_push_buf
)(struct n_string
*self
, char const *buf
, size_t buflen
676 n_MEMORY_DEBUG_ARGS
){
679 assert(self
!= NULL
);
680 assert(buflen
== 0 || buf
!= NULL
);
682 if(buflen
== UIZ_MAX
)
683 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
688 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
689 memcpy(&self
->s_dat
[i
= self
->s_len
], buf
, buflen
);
690 self
->s_len
= (i
+= (ui32_t
)buflen
);
697 (n_string_push_c
)(struct n_string
*self
, char c n_MEMORY_DEBUG_ARGS
){
700 assert(self
!= NULL
);
702 if(self
->s_len
+ 1 >= self
->s_size
)
703 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
704 self
->s_dat
[self
->s_len
++] = c
;
710 (n_string_unshift_buf
)(struct n_string
*self
, char const *buf
, size_t buflen
711 n_MEMORY_DEBUG_ARGS
){
714 assert(self
!= NULL
);
715 assert(buflen
== 0 || buf
!= NULL
);
717 if(buflen
== UIZ_MAX
)
718 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
721 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
723 memmove(&self
->s_dat
[buflen
], self
->s_dat
, self
->s_len
);
724 memcpy(self
->s_dat
, buf
, buflen
);
725 self
->s_len
+= (ui32_t
)buflen
;
732 (n_string_unshift_c
)(struct n_string
*self
, char c n_MEMORY_DEBUG_ARGS
){
735 assert(self
!= NULL
);
737 if(self
->s_len
+ 1 >= self
->s_size
)
738 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
740 memmove(&self
->s_dat
[1], self
->s_dat
, self
->s_len
);
748 (n_string_insert_buf
)(struct n_string
*self
, size_t idx
,
749 char const *buf
, size_t buflen n_MEMORY_DEBUG_ARGS
){
752 assert(self
!= NULL
);
753 assert(buflen
== 0 || buf
!= NULL
);
754 assert(idx
<= self
->s_len
);
756 if(buflen
== UIZ_MAX
)
757 buflen
= (buf
== NULL
) ? 0 : strlen(buf
);
760 self
= (n_string_reserve
)(self
, buflen n_MEMORY_DEBUG_ARGSCALL
);
762 memmove(&self
->s_dat
[idx
+ buflen
], &self
->s_dat
[idx
],
764 memcpy(&self
->s_dat
[idx
], buf
, buflen
);
765 self
->s_len
+= (ui32_t
)buflen
;
772 (n_string_insert_c
)(struct n_string
*self
, size_t idx
,
773 char c n_MEMORY_DEBUG_ARGS
){
776 assert(self
!= NULL
);
777 assert(idx
<= self
->s_len
);
779 if(self
->s_len
+ 1 >= self
->s_size
)
780 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
782 memmove(&self
->s_dat
[idx
+ 1], &self
->s_dat
[idx
], self
->s_len
- idx
);
783 self
->s_dat
[idx
] = c
;
790 n_string_cut(struct n_string
*self
, size_t idx
, size_t len
){
793 assert(self
!= NULL
);
794 assert(UIZ_MAX
- idx
> len
);
795 assert(SI32_MAX
>= idx
+ len
);
796 assert(idx
+ len
<= self
->s_len
);
799 memmove(&self
->s_dat
[idx
], &self
->s_dat
[idx
+ len
],
800 (self
->s_len
-= len
) - idx
);
806 (n_string_cp
)(struct n_string
*self n_MEMORY_DEBUG_ARGS
){
810 assert(self
!= NULL
);
812 if(self
->s_size
== 0)
813 self
= (n_string_reserve
)(self
, 1 n_MEMORY_DEBUG_ARGSCALL
);
815 (rv
= self
->s_dat
)[self
->s_len
] = '\0';
821 n_string_cp_const(struct n_string
const *self
){
825 assert(self
!= NULL
);
827 if(self
->s_size
!= 0){
828 ((struct n_string
*)n_UNCONST(self
))->s_dat
[self
->s_len
] = '\0';
841 n_utf8_to_utf32(char const **bdat
, size_t *blen
) /* TODO check false UTF8 */
855 if ((x
& 0xE0u
) == 0xC0u
) {
860 } else if ((x
& 0xF0u
) == 0xE0u
) {
896 n_utf32_to_utf8(ui32_t c
, char *buf
)
903 ui8_t dec_leader_mask
;
904 ui8_t dec_leader_val_mask
;
905 ui8_t dec_bytes_togo
;
909 {0x00000000, 0x00000000, 0x00, 0, 0x00, 0x00, 0, 0, {0,}},
910 {0x00000000, 0x0000007F, 0x00, 1, 0x80, 0x7F, 1-1, 1, {0,}},
911 {0x00000080, 0x000007FF, 0xC0, 2, 0xE0, 0xFF-0xE0, 2-1, 2, {0,}},
912 /* We assume surrogates are U+D800 - U+DFFF, _cat index 3 */
913 /* xxx _from_utf32() simply assumes magic code points for surrogates!
914 * xxx (However, should we ever get yet another surrogate range we
915 * xxx need to deal with that all over the place anyway? */
916 {0x00000800, 0x0000FFFF, 0xE0, 3, 0xF0, 0xFF-0xF0, 3-1, 3, {0,}},
917 {0x00010000, 0x0010FFFF, 0xF0, 4, 0xF8, 0xFF-0xF8, 4-1, 4, {0,}},
921 if (c
<= _cat
[0].upper_bound
) { catp
+= 0; goto j0
; }
922 if (c
<= _cat
[1].upper_bound
) { catp
+= 1; goto j1
; }
923 if (c
<= _cat
[2].upper_bound
) { catp
+= 2; goto j2
; }
924 if (c
<= _cat
[3].upper_bound
) {
925 /* Surrogates may not be converted (Compatibility rule C10) */
926 if (c
>= 0xD800u
&& c
<= 0xDFFFu
)
931 if (c
<= _cat
[4].upper_bound
) { catp
+= 4; goto j4
; }
933 c
= 0xFFFDu
; /* Unicode replacement character */
937 buf
[3] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
939 buf
[2] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
941 buf
[1] = (char)0x80u
| (char)(c
& 0x3Fu
); c
>>= 6;
943 buf
[0] = (char)catp
->enc_leader
| (char)(c
);
945 buf
[catp
->enc_lval
] = '\0';
952 * Our iconv(3) wrapper
956 static void _ic_toupper(char *dest
, char const *src
);
957 static void _ic_stripdash(char *p
);
960 _ic_toupper(char *dest
, char const *src
)
964 *dest
++ = upperconv(*src
);
965 while (*src
++ != '\0');
970 _ic_stripdash(char *p
)
978 while (*p
++ != '\0');
983 n_iconv_open(char const *tocode
, char const *fromcode
)
989 if ((!asccasecmp(fromcode
, "unknown-8bit") ||
990 !asccasecmp(fromcode
, "binary")) &&
991 (fromcode
= ok_vlook(charset_unknown_8bit
)) == NULL
)
992 fromcode
= ok_vlook(CHARSET_8BIT_OKEY
);
994 if ((id
= iconv_open(tocode
, fromcode
)) != (iconv_t
)-1)
997 /* Remove the "iso-" prefixes for Solaris */
998 if (!ascncasecmp(tocode
, "iso-", 4))
1000 else if (!ascncasecmp(tocode
, "iso", 3))
1002 if (!ascncasecmp(fromcode
, "iso-", 4))
1004 else if (!ascncasecmp(fromcode
, "iso", 3))
1006 if (*tocode
== '\0' || *fromcode
== '\0') {
1010 if ((id
= iconv_open(tocode
, fromcode
)) != (iconv_t
)-1)
1013 /* Solaris prefers upper-case charset names. Don't ask... */
1014 t
= salloc(strlen(tocode
) +1);
1015 _ic_toupper(t
, tocode
);
1016 f
= salloc(strlen(fromcode
) +1);
1017 _ic_toupper(f
, fromcode
);
1018 if ((id
= iconv_open(t
, f
)) != (iconv_t
)-1)
1021 /* Strip dashes for UnixWare */
1024 if ((id
= iconv_open(t
, f
)) != (iconv_t
)-1)
1027 /* Add your vendor's sillynesses here */
1029 /* If the encoding names are equal at this point, they are just not
1030 * understood by iconv(), and we cannot sensibly use it in any way. We do
1031 * not perform this as an optimization above since iconv() can otherwise be
1032 * used to check the validity of the input even with identical encoding
1042 n_iconv_close(iconv_t cd
)
1047 iconvd
= (iconv_t
)-1;
1052 n_iconv_reset(iconv_t cd
)
1055 iconv(cd
, NULL
, NULL
, NULL
, NULL
);
1059 /* (2012-09-24: export and use it exclusively to isolate prototype problems
1060 * (*inb* is 'char const **' except in POSIX) in a single place.
1061 * GNU libiconv even allows for configuration time const/non-const..
1062 * In the end it's an ugly guess, but we can't do better since make(1) doesn't
1063 * support compiler invocations which bail on error, so no -Werror */
1064 /* Citrus project? */
1065 # if defined _ICONV_H_ && defined __ICONV_F_HIDE_INVALID
1066 /* DragonFly 3.2.1 is special TODO newer DragonFly too, but different */
1068 # define __INBCAST(S) (char ** __restrict__)n_UNCONST(S)
1070 # define __INBCAST(S) (char const **)n_UNCONST(S)
1072 # elif n_OS_SUNOS || n_OS_SOLARIS
1073 # define __INBCAST(S) (char const ** __restrict__)n_UNCONST(S)
1076 # define __INBCAST(S) (char **)n_UNCONST(S)
1080 n_iconv_buf(iconv_t cd
, enum n_iconv_flags icf
,
1081 char const **inb
, size_t *inbleft
, char **outb
, size_t *outbleft
){
1085 if((icf
& n_ICONV_UNIREPL
) && !(options
& OPT_UNICODE
))
1086 icf
&= ~n_ICONV_UNIREPL
;
1091 sz
= iconv(cd
, __INBCAST(inb
), inbleft
, outb
, outbleft
);
1092 if(sz
> 0 && !(icf
& n_ICONV_IGN_NOREVERSE
)){
1096 if(sz
!= (size_t)-1)
1100 if(!(icf
& n_ICONV_IGN_ILSEQ
) || err
!= EILSEQ
)
1105 if(icf
& n_ICONV_UNIREPL
){
1106 if(*outbleft
>= sizeof(n_unirepl
) -1){
1107 memcpy(*outb
, n_unirepl
, sizeof(n_unirepl
) -1);
1108 *outb
+= sizeof(n_unirepl
) -1;
1109 *outbleft
-= sizeof(n_unirepl
) -1;
1112 }else if(*outbleft
> 0){
1119 }else if(*outbleft
> 0){
1132 n_iconv_str(iconv_t cd
, enum n_iconv_flags icf
,
1133 struct str
*out
, struct str
const *in
, struct str
*in_rest_or_null
)
1146 ol
= (ol
<< 1) - (ol
>> 4);
1157 if((err
= n_iconv_buf(cd
, icf
, &ib
, &il
, &ob
, &ol
)) == 0 || err
!= E2BIG
)
1162 obb
= n_realloc(obb
, olb
+1);
1165 if (in_rest_or_null
!= NULL
) {
1166 in_rest_or_null
->s
= n_UNCONST(ib
);
1167 in_rest_or_null
->l
= il
;
1170 out
->s
[out
->l
= olb
- ol
] = '\0';
1176 n_iconv_onetime_cp(enum n_iconv_flags icf
,
1177 char const *tocode
, char const *fromcode
, char const *input
){
1185 tocode
= ok_vlook(ttycharset
);
1186 if(fromcode
== NULL
)
1189 if((icd
= iconv_open(tocode
, fromcode
)) == (iconv_t
)-1)
1192 in
.l
= strlen(in
.s
= n_UNCONST(input
)); /* logical */
1193 out
.s
= NULL
, out
.l
= 0;
1194 if(!n_iconv_str(icd
, icf
, &out
, &in
, NULL
))
1195 rv
= savestrbuf(out
.s
, out
.l
);
1204 #endif /* HAVE_ICONV */