]>
git.saurik.com Git - apple/libc.git/blob - locale/FreeBSD/euc.c
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: src/lib/libc/locale/euc.c,v 1.22 2007/10/13 16:28:21 ache Exp $");
44 #include "xlocale_private.h"
54 static size_t _EUC_mbrtowc(wchar_t * __restrict
, const char * __restrict
,
55 size_t, mbstate_t * __restrict
, locale_t
);
56 static int _EUC_mbsinit(const mbstate_t *, locale_t
);
57 static size_t _EUC_wcrtomb(char * __restrict
, wchar_t,
58 mbstate_t * __restrict
, locale_t
);
72 /* This will be called by the XL_RELEASE() macro to free the extra storage */
74 _EUC_free_extra(struct __xlocale_st_runelocale
*xrl
)
76 free(xrl
->_CurrentRuneLocale
.__variable
);
79 __private_extern__
int
80 _EUC_init(struct __xlocale_st_runelocale
*xrl
)
83 int x
, new__mb_cur_max
;
85 _RuneLocale
*rl
= &xrl
->_CurrentRuneLocale
;
87 if (rl
->__variable
== NULL
)
90 v
= (char *)rl
->__variable
;
92 while (*v
== ' ' || *v
== '\t')
95 if ((ei
= malloc(sizeof(_EucInfo
))) == NULL
)
96 return (errno
== 0 ? ENOMEM
: errno
);
99 for (x
= 0; x
< 4; ++x
) {
100 ei
->count
[x
] = (int)strtol(v
, &e
, 0);
101 if (v
== e
|| !(v
= e
)) {
105 if (new__mb_cur_max
< ei
->count
[x
])
106 new__mb_cur_max
= ei
->count
[x
];
107 while (*v
== ' ' || *v
== '\t')
109 ei
->bits
[x
] = (int)strtol(v
, &e
, 0);
110 if (v
== e
|| !(v
= e
)) {
114 while (*v
== ' ' || *v
== '\t')
117 ei
->mask
= (int)strtol(v
, &e
, 0);
118 if (v
== e
|| !(v
= e
)) {
123 rl
->__variable_len
= sizeof(_EucInfo
);
124 xrl
->__mb_cur_max
= new__mb_cur_max
;
125 xrl
->__mbrtowc
= _EUC_mbrtowc
;
126 xrl
->__wcrtomb
= _EUC_wcrtomb
;
127 xrl
->__mbsinit
= _EUC_mbsinit
;
128 xrl
->__mb_sb_limit
= 256;
129 xrl
->__free_extra
= (__free_extra_t
)_EUC_free_extra
;
134 _EUC_mbsinit(const mbstate_t *ps
, locale_t loc __unused
)
137 return (ps
== NULL
|| ((const _EucState
*)ps
)->want
== 0);
143 #define GR_BITS 0x80808080 /* XXX: to be fixed */
150 return ((c
& 0x80) ? c
== _SS3
? 3 : c
== _SS2
? 2 : 1 : 0);
154 _EUC_mbrtowc(wchar_t * __restrict pwc
, const char * __restrict s
, size_t n
,
155 mbstate_t * __restrict ps
, locale_t loc
)
161 struct __xlocale_st_runelocale
*rl
= loc
->__lc_ctype
;
162 _EucInfo
*CEI
= (_EucInfo
*)rl
->_CurrentRuneLocale
.__variable
;
164 es
= (_EucState
*)ps
;
166 if (es
->want
< 0 || es
->want
> rl
->__mb_cur_max
|| es
->set
< 0 ||
179 /* Incomplete multibyte sequence */
185 want
= CEI
->count
[set
= _euc_set(*s
)];
186 if (set
== 2 || set
== 3) {
189 /* Incomplete multibyte sequence */
201 wc
= (unsigned char)*s
++;
207 for (i
= (es
->want
== 0) ? 1 : 0; i
< MIN(want
, n
); i
++) {
212 wc
= (wc
<< 8) | (unsigned char)*s
++;
215 /* Incomplete multibyte sequence */
221 wc
= (wc
& ~CEI
->mask
) | CEI
->bits
[set
];
225 return (wc
== L
'\0' ? 0 : s
- os
);
229 _EUC_wcrtomb(char * __restrict s
, wchar_t wc
, mbstate_t * __restrict ps
, locale_t loc
)
234 _EucInfo
*CEI
= (_EucInfo
*)loc
->__lc_ctype
->_CurrentRuneLocale
.__variable
;
236 es
= (_EucState
*)ps
;
244 /* Reset to initial shift state (no-op) */
250 if (m
== CEI
->bits
[1]) {
252 /* Codeset 1: The first byte must have 0x80 in it. */
253 i
= len
= CEI
->count
[1];
255 *s
++ = (nm
>> (i
<< 3)) | 0x80;
257 if (m
== CEI
->bits
[0])
258 i
= len
= CEI
->count
[0];
259 else if (m
== CEI
->bits
[2]) {
260 i
= len
= CEI
->count
[2];
263 /* SS2 designates G2 into GR */
265 } else if (m
== CEI
->bits
[3]) {
266 i
= len
= CEI
->count
[3];
269 /* SS3 designates G3 into GR */
272 goto CodeSet1
; /* Bletch */
274 *s
++ = (nm
>> (i
<< 3)) & 0xff;