2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 2005 Poul-Henning Kamp
5 * Copyright (c) 1990, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
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
38 #include <namespace.h>
49 * Convert a wide character string argument for the %ls format to a multibyte
50 * string representation. If not -1, prec specifies the maximum number of
51 * bytes to output, and also means that we can't assume that the wide char.
52 * string ends is null-terminated.
55 __wcsconv(wchar_t *wcsarg, int prec)
57 static const mbstate_t initial;
64 /* Allocate space for the maximum number of bytes we could output. */
68 nbytes = wcsrtombs(NULL, (const wchar_t **)&p, 0, &mbs);
69 if (nbytes == (size_t)-1)
73 * Optimisation: if the output precision is small enough,
74 * just allocate enough memory for the maximum instead of
75 * scanning the string.
84 clen = wcrtomb(buf, *p++, &mbs);
85 if (clen == 0 || clen == (size_t)-1 ||
86 (int)(nbytes + clen) > prec)
92 if ((convbuf = malloc(nbytes + 1)) == NULL)
95 /* Fill the output buffer. */
98 if ((nbytes = wcsrtombs(convbuf, (const wchar_t **)&p,
99 nbytes, &mbs)) == (size_t)-1) {
103 convbuf[nbytes] = '\0';
108 /* 's' ---------------------------------------------------------------*/
111 __printf_arginfo_str(const struct printf_info *pi, size_t n, int *argt)
115 if (pi->is_long || pi->spec == 'C')
116 argt[0] = PA_WSTRING;
123 __printf_render_str(struct __printf_io *io, const struct printf_info *pi, const void *const *arg)
130 if (pi->is_long || pi->spec == 'S') {
131 wcp = *((wint_t **)arg[0]);
133 return (__printf_out(io, pi, "(null)", 6));
134 convbuf = __wcsconv(wcp, pi->prec);
137 l = __printf_out(io, pi, convbuf, strlen(convbuf));
141 p = *((char **)arg[0]);
143 return (__printf_out(io, pi, "(null)", 6));
145 if (pi->prec >= 0 && pi->prec < l)
147 return (__printf_out(io, pi, p, l));
150 /* 'c' ---------------------------------------------------------------*/
153 __printf_arginfo_chr(const struct printf_info *pi, size_t n, int *argt)
157 if (pi->is_long || pi->spec == 'C')
165 __printf_render_chr(struct __printf_io *io, const struct printf_info *pi, const void *const *arg)
170 static const mbstate_t initial; /* XXX: this is bogus! */
173 char buf[MB_CUR_MAX];
175 if (pi->is_long || pi->spec == 'C') {
176 ii = *((wint_t *)arg[0]);
179 mbseqlen = wcrtomb(buf, (wchar_t)ii, &mbs);
180 if (mbseqlen == (size_t) -1)
182 return (__printf_out(io, pi, buf, mbseqlen));
184 i = *((int *)arg[0]);
186 i = __printf_out(io, pi, &c, 1);