2 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * Paul Borman at Krystal Technologies.
9 * Copyright (c) 2011 The FreeBSD Foundation
10 * All rights reserved.
11 * Portions of this software were developed by David Chisnall
12 * under sponsorship from the FreeBSD Foundation.
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions
17 * 1. Redistributions of source code must retain the above copyright
18 * notice, this list of conditions and the following disclaimer.
19 * 2. Redistributions in binary form must reproduce the above copyright
20 * notice, this list of conditions and the following disclaimer in the
21 * documentation and/or other materials provided with the distribution.
22 * 3. All advertising materials mentioning features or use of this software
23 * must display the following acknowledgement:
24 * This product includes software developed by the University of
25 * California, Berkeley and its contributors.
26 * 4. Neither the name of the University nor the names of its contributors
27 * may be used to endorse or promote products derived from this software
28 * without specific prior written permission.
30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 #if defined(LIBC_SCCS) && !defined(lint)
44 static char sccsid[] = "@(#)euc.c 8.1 (Berkeley) 6/4/93";
45 #endif /* LIBC_SCCS and not lint */
46 #include <sys/param.h>
47 __FBSDID("$FreeBSD$");
57 extern int __mb_sb_limit;
59 static size_t _EUC_mbrtowc(wchar_t * __restrict, const char * __restrict,
60 size_t, mbstate_t * __restrict);
61 static int _EUC_mbsinit(const mbstate_t *);
62 static size_t _EUC_wcrtomb(char * __restrict, wchar_t,
63 mbstate_t * __restrict);
78 _EUC_init(struct xlocale_ctype *l, _RuneLocale *rl)
81 int x, new__mb_cur_max;
84 if (rl->__variable == NULL)
87 v = (char *)rl->__variable;
89 while (*v == ' ' || *v == '\t')
92 if ((ei = malloc(sizeof(_EucInfo))) == NULL)
93 return (errno == 0 ? ENOMEM : errno);
96 for (x = 0; x < 4; ++x) {
97 ei->count[x] = (int)strtol(v, &e, 0);
98 if (v == e || !(v = e)) {
102 if (new__mb_cur_max < ei->count[x])
103 new__mb_cur_max = ei->count[x];
104 while (*v == ' ' || *v == '\t')
106 ei->bits[x] = (int)strtol(v, &e, 0);
107 if (v == e || !(v = e)) {
111 while (*v == ' ' || *v == '\t')
114 ei->mask = (int)strtol(v, &e, 0);
115 if (v == e || !(v = e)) {
120 rl->__variable_len = sizeof(_EucInfo);
122 l->__mb_cur_max = new__mb_cur_max;
123 l->__mbrtowc = _EUC_mbrtowc;
124 l->__wcrtomb = _EUC_wcrtomb;
125 l->__mbsinit = _EUC_mbsinit;
126 l->__mb_sb_limit = 256;
131 _EUC_mbsinit(const mbstate_t *ps)
134 return (ps == NULL || ((const _EucState *)ps)->want == 0);
137 #define CEI ((_EucInfo *)(_CurrentRuneLocale->__variable))
142 #define GR_BITS 0x80808080 /* XXX: to be fixed */
149 return ((c & 0x80) ? c == _SS3 ? 3 : c == _SS2 ? 2 : 1 : 0);
153 _EUC_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
154 mbstate_t * __restrict ps)
161 es = (_EucState *)ps;
163 if (es->want < 0 || es->want > MB_CUR_MAX || es->set < 0 ||
176 /* Incomplete multibyte sequence */
182 want = CEI->count[set = _euc_set(*s)];
183 if (set == 2 || set == 3) {
186 /* Incomplete multibyte sequence */
198 wc = (unsigned char)*s++;
204 for (i = (es->want == 0) ? 1 : 0; i < MIN(want, n); i++) {
209 wc = (wc << 8) | (unsigned char)*s++;
212 /* Incomplete multibyte sequence */
218 wc = (wc & ~CEI->mask) | CEI->bits[set];
222 return (wc == L'\0' ? 0 : s - os);
226 _EUC_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps)
232 es = (_EucState *)ps;
240 /* Reset to initial shift state (no-op) */
246 if (m == CEI->bits[1]) {
248 /* Codeset 1: The first byte must have 0x80 in it. */
249 i = len = CEI->count[1];
251 *s++ = (nm >> (i << 3)) | 0x80;
253 if (m == CEI->bits[0])
254 i = len = CEI->count[0];
255 else if (m == CEI->bits[2]) {
256 i = len = CEI->count[2];
259 /* SS2 designates G2 into GR */
261 } else if (m == CEI->bits[3]) {
262 i = len = CEI->count[3];
265 /* SS3 designates G3 into GR */
268 goto CodeSet1; /* Bletch */
270 *s++ = (nm >> (i << 3)) & 0xff;