2 * Copyright 2013 Garrett D'Amore <garrett@damore.org>
3 * Copyright 2010 Nexenta Systems, Inc. All rights reserved.
4 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * Paul Borman at Krystal Technologies.
11 * Copyright (c) 2011 The FreeBSD Foundation
12 * All rights reserved.
13 * Portions of this software were developed by David Chisnall
14 * under sponsorship from the FreeBSD Foundation.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * @(#)none.c 8.1 (Berkeley) 6/4/93
53 static size_t _none_mbrtowc(wchar_t * __restrict, const char * __restrict,
54 size_t, mbstate_t * __restrict);
55 static int _none_mbsinit(const mbstate_t *);
56 static size_t _none_mbsnrtowcs(wchar_t * __restrict dst,
57 const char ** __restrict src, size_t nms, size_t len,
58 mbstate_t * __restrict ps __unused);
59 static size_t _none_wcrtomb(char * __restrict, wchar_t,
60 mbstate_t * __restrict);
61 static size_t _none_wcsnrtombs(char * __restrict, const wchar_t ** __restrict,
62 size_t, size_t, mbstate_t * __restrict);
67 int __mb_sb_limit = 256; /* Expected to be <= _CACHED_RUNES */
70 _none_init(struct xlocale_ctype *l, _RuneLocale *rl)
73 l->__mbrtowc = _none_mbrtowc;
74 l->__mbsinit = _none_mbsinit;
75 l->__mbsnrtowcs = _none_mbsnrtowcs;
76 l->__wcrtomb = _none_wcrtomb;
77 l->__wcsnrtombs = _none_wcsnrtombs;
80 l->__mb_sb_limit = 256;
85 _none_mbsinit(const mbstate_t *ps __unused)
89 * Encoding is not state dependent - we are always in the
96 _none_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
97 mbstate_t * __restrict ps __unused)
101 /* Reset to initial shift state (no-op) */
104 /* Incomplete multibyte sequence */
107 *pwc = (unsigned char)*s;
108 return (*s == '\0' ? 0 : 1);
112 _none_wcrtomb(char * __restrict s, wchar_t wc,
113 mbstate_t * __restrict ps __unused)
117 /* Reset to initial shift state (no-op) */
119 if (wc < 0 || wc > UCHAR_MAX) {
123 *s = (unsigned char)wc;
128 _none_mbsnrtowcs(wchar_t * __restrict dst, const char ** __restrict src,
129 size_t nms, size_t len, mbstate_t * __restrict ps __unused)
135 s = memchr(*src, '\0', nms);
136 return (s != NULL ? s - *src : nms);
141 while (len-- > 0 && nms-- > 0) {
142 if ((*dst++ = (unsigned char)*s++) == L'\0') {
153 _none_wcsnrtombs(char * __restrict dst, const wchar_t ** __restrict src,
154 size_t nwc, size_t len, mbstate_t * __restrict ps __unused)
160 for (s = *src; nwc > 0 && *s != L'\0'; s++, nwc--) {
161 if (*s < 0 || *s > UCHAR_MAX) {
171 while (len-- > 0 && nwc-- > 0) {
172 if (*s < 0 || *s > UCHAR_MAX) {
176 if ((*dst++ = *s++) == '\0') {
187 * Multibyte binary data to escaped wchar.
188 * Round-trip match guaranteed, including 0x00 bytes.
190 * Cannot return an error. *slen bytes is converted to the destination
191 * buffer until one or the other is exhausted. Destination elements returned
192 * and *slen modified with source elements processed.
194 * Incomplete sequences or partial re-encodings that would overflow the
195 * destination buffer are not processed and will also leave excess *slen.
197 * Never returns an error. Instead, incomplete sequences are not processed
198 * and *slen will index to the beginning of the incomplete sequence. It is
199 * possible for 0 to be returned and for *slen to be set to 0 due to an
200 * incomplete whole-buffer sequence, unless termination is specified.
202 * If termination is specified any trailing incomplete sequences are escaped
203 * and *slen will index to the end of the source buffer, unless insufficient
204 * room exists in the destination. If there is insufficient room, *slen may
205 * not be able to index to the end of the source buffer.
207 * Does not support a NULL dst on purpose - caller is expected to loop
211 _none_mbintowcr(wchar_t * __restrict dst, const char * __restrict src,
212 size_t dlen, size_t *slen, int flags)
218 for (i = j = 0; i < n; ++i) {
222 dst[j] = (unsigned char)src[i];
225 /* no partial sequences so we can ignore flags */
232 * Escaped wchar to multibyte binary data.
233 * Round-trip match guaranteed, including 0x00 bytes.
235 * *slen bytes is converted to the destination buffer until one or the other
236 * is exhausted. Destination elements returned and *slen modified with
237 * source elements processed.
239 * Can return an error only if the first wchar src[] element is illegal,
240 * otherwise will process up to the illegal wchar and return an error on
241 * the next call (if called with the remainder).
243 * Never returns -2. Instead, incomplete sequences are not processed and
244 * *slen will index to the beginning of the incomplete sequence. If
245 * termination is specified, incomplete sequences are discarded and *slen
246 * indexes to the end of the input array.
248 * Does not support a NULL dst on purpose - caller is expected to loop
252 _none_wcrtombin(char * __restrict dst, const wchar_t * __restrict src,
253 size_t dlen, size_t *slen, int flags)
259 for (i = j = 0; i < n; ++i) {
262 if (src[i] >= 0x100) {
270 dst[j] = (unsigned char)src[i];
273 /* no partial sequences so we can ignore flags */
281 struct xlocale_ctype __xlocale_global_ctype = {
283 (_RuneLocale*)&_DefaultRuneLocale,
291 1, /* __mb_cur_max, */
292 256 /* __mb_sb_limit */
295 struct xlocale_ctype __xlocale_C_ctype = {
297 (_RuneLocale*)&_DefaultRuneLocale,
305 1, /* __mb_cur_max, */
306 256 /* __mb_sb_limit */