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 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 #if defined(LIBC_SCCS) && !defined(lint)
39 static char sccsid[] = "@(#)euc.c 8.1 (Berkeley) 6/4/93";
40 #endif /* LIBC_SCCS and not lint */
41 #include <sys/param.h>
42 __FBSDID("$FreeBSD$");
52 extern int __mb_sb_limit;
54 static size_t _EUC_mbrtowc(wchar_t * __restrict, const char * __restrict,
55 size_t, mbstate_t * __restrict);
56 static int _EUC_mbsinit(const mbstate_t *);
57 static size_t _EUC_wcrtomb(char * __restrict, wchar_t,
58 mbstate_t * __restrict);
73 _EUC_init(_RuneLocale *rl)
76 int x, new__mb_cur_max;
79 if (rl->__variable == NULL)
82 v = (char *)rl->__variable;
84 while (*v == ' ' || *v == '\t')
87 if ((ei = malloc(sizeof(_EucInfo))) == NULL)
88 return (errno == 0 ? ENOMEM : errno);
91 for (x = 0; x < 4; ++x) {
92 ei->count[x] = (int)strtol(v, &e, 0);
93 if (v == e || !(v = e)) {
97 if (new__mb_cur_max < ei->count[x])
98 new__mb_cur_max = ei->count[x];
99 while (*v == ' ' || *v == '\t')
101 ei->bits[x] = (int)strtol(v, &e, 0);
102 if (v == e || !(v = e)) {
106 while (*v == ' ' || *v == '\t')
109 ei->mask = (int)strtol(v, &e, 0);
110 if (v == e || !(v = e)) {
115 rl->__variable_len = sizeof(_EucInfo);
116 _CurrentRuneLocale = rl;
117 __mb_cur_max = new__mb_cur_max;
118 __mbrtowc = _EUC_mbrtowc;
119 __wcrtomb = _EUC_wcrtomb;
120 __mbsinit = _EUC_mbsinit;
126 _EUC_mbsinit(const mbstate_t *ps)
129 return (ps == NULL || ((const _EucState *)ps)->want == 0);
132 #define CEI ((_EucInfo *)(_CurrentRuneLocale->__variable))
137 #define GR_BITS 0x80808080 /* XXX: to be fixed */
144 return ((c & 0x80) ? c == _SS3 ? 3 : c == _SS2 ? 2 : 1 : 0);
148 _EUC_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
149 mbstate_t * __restrict ps)
156 es = (_EucState *)ps;
158 if (es->want < 0 || es->want > MB_CUR_MAX || es->set < 0 ||
171 /* Incomplete multibyte sequence */
177 want = CEI->count[set = _euc_set(*s)];
178 if (set == 2 || set == 3) {
181 /* Incomplete multibyte sequence */
193 wc = (unsigned char)*s++;
199 for (i = (es->want == 0) ? 1 : 0; i < MIN(want, n); i++) {
204 wc = (wc << 8) | (unsigned char)*s++;
207 /* Incomplete multibyte sequence */
213 wc = (wc & ~CEI->mask) | CEI->bits[set];
217 return (wc == L'\0' ? 0 : s - os);
221 _EUC_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps)
227 es = (_EucState *)ps;
235 /* Reset to initial shift state (no-op) */
241 if (m == CEI->bits[1]) {
243 /* Codeset 1: The first byte must have 0x80 in it. */
244 i = len = CEI->count[1];
246 *s++ = (nm >> (i << 3)) | 0x80;
248 if (m == CEI->bits[0])
249 i = len = CEI->count[0];
250 else if (m == CEI->bits[2]) {
251 i = len = CEI->count[2];
254 /* SS2 designates G2 into GR */
256 } else if (m == CEI->bits[3]) {
257 i = len = CEI->count[3];
260 /* SS3 designates G3 into GR */
263 goto CodeSet1; /* Bletch */
265 *s++ = (nm >> (i << 3)) & 0xff;