[apple/libc.git] / locale / FreeBSD / euc.c

/*-
 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
 * Copyright (c) 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Paul Borman at Krystal Technologies.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)euc.c	8.1 (Berkeley) 6/4/93";
#endif /* LIBC_SCCS and not lint */
#include <sys/param.h>
__FBSDID("$FreeBSD: src/lib/libc/locale/euc.c,v 1.20 2004/06/23 07:01:43 tjr Exp $");

#include <errno.h>
#include <limits.h>
#include <runetype.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "mblocal.h"

int	_EUC_init(_RuneLocale *);
size_t	_EUC_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
	    mbstate_t * __restrict);
int	_EUC_mbsinit(const mbstate_t *);
size_t	_EUC_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);

typedef struct {
	int	count[4];
	wchar_t	bits[4];
	wchar_t	mask;
} _EucInfo;

typedef struct {
	wchar_t	ch;
	int	set;
	int	want;
} _EucState;

int
_EUC_init(_RuneLocale *rl)
{
	_EucInfo *ei;
	int x, new__mb_cur_max;
	char *v, *e;

	if (rl->__variable == NULL)
		return (EFTYPE);

	v = (char *)rl->__variable;

	while (*v == ' ' || *v == '\t')
		++v;

	if ((ei = malloc(sizeof(_EucInfo))) == NULL)
		return (errno == 0 ? ENOMEM : errno);

	new__mb_cur_max = 0;
	for (x = 0; x < 4; ++x) {
		ei->count[x] = (int)strtol(v, &e, 0);
		if (v == e || !(v = e)) {
			free(ei);
			return (EFTYPE);
		}
		if (new__mb_cur_max < ei->count[x])
			new__mb_cur_max = ei->count[x];
		while (*v == ' ' || *v == '\t')
			++v;
		ei->bits[x] = (int)strtol(v, &e, 0);
		if (v == e || !(v = e)) {
			free(ei);
			return (EFTYPE);
		}
		while (*v == ' ' || *v == '\t')
			++v;
	}
	ei->mask = (int)strtol(v, &e, 0);
	if (v == e || !(v = e)) {
		free(ei);
		return (EFTYPE);
	}
	rl->__variable = ei;
	rl->__variable_len = sizeof(_EucInfo);
	_CurrentRuneLocale = rl;
	__mb_cur_max = new__mb_cur_max;
	__mbrtowc = _EUC_mbrtowc;
	__wcrtomb = _EUC_wcrtomb;
	__mbsinit = _EUC_mbsinit;
	return (0);
}

int
_EUC_mbsinit(const mbstate_t *ps)
{

	return (ps == NULL || ((const _EucState *)ps)->want == 0);
}

#define	CEI	((_EucInfo *)(_CurrentRuneLocale->__variable))

#define	_SS2	0x008e
#define	_SS3	0x008f

#define	GR_BITS	0x80808080 /* XXX: to be fixed */

static __inline int
_euc_set(u_int c)
{
	c &= 0xff;
	return ((c & 0x80) ? c == _SS3 ? 3 : c == _SS2 ? 2 : 1 : 0);
}

size_t
_EUC_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
    mbstate_t * __restrict ps)
{
	_EucState *es;
	int i, set, want;
	wchar_t wc;
	const char *os;

	es = (_EucState *)ps;

	if (es->want < 0 || es->want > MB_CUR_MAX || es->set < 0 ||
	    es->set > 3) {
		errno = EINVAL;
		return ((size_t)-1);
	}

	if (s == NULL) {
		s = "";
		n = 1;
		pwc = NULL;
	}

	if (n == 0)
		/* Incomplete multibyte sequence */
		return ((size_t)-2);

	os = s;

	if (es->want == 0) {
		want = CEI->count[set = _euc_set(*s)];
		if (set == 2 || set == 3) {
			--want;
			if (--n == 0) {
				/* Incomplete multibyte sequence */
				es->set = set;
				es->want = want;
				es->ch = 0;
				return ((size_t)-2);
			}
			++s;
			if (*s == '\0') {
				errno = EILSEQ;
				return ((size_t)-1);
			}
		}
		wc = (unsigned char)*s++;
	} else {
		set = es->set;
		want = es->want;
		wc = es->ch;
	}
	for (i = (es->want == 0) ? 1 : 0; i < MIN(want, n); i++) {
		if (*s == '\0') {
			errno = EILSEQ;
			return ((size_t)-1);
		}
		wc = (wc << 8) | (unsigned char)*s++;
	}
	if (i < want) {
		/* Incomplete multibyte sequence */
		es->set = set;
		es->want = want - i;
		es->ch = wc;
		return ((size_t)-2);
	}
	wc = (wc & ~CEI->mask) | CEI->bits[set];
	if (pwc != NULL)
		*pwc = wc;
	es->want = 0;
	return (wc == L'\0' ? 0 : s - os);
}

size_t
_EUC_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps)
{
	_EucState *es;
	wchar_t m, nm;
	int i, len;

	es = (_EucState *)ps;

	if (es->want != 0) {
		errno = EINVAL;
		return ((size_t)-1);
	}

	if (s == NULL)
		/* Reset to initial shift state (no-op) */
		return (1);

	m = wc & CEI->mask;
	nm = wc & ~m;

	if (m == CEI->bits[1]) {
CodeSet1:
		/* Codeset 1: The first byte must have 0x80 in it. */
		i = len = CEI->count[1];
		while (i-- > 0)
			*s++ = (nm >> (i << 3)) | 0x80;
	} else {
		if (m == CEI->bits[0])
			i = len = CEI->count[0];
		else if (m == CEI->bits[2]) {
			i = len = CEI->count[2];
			*s++ = _SS2;
			--i;
			/* SS2 designates G2 into GR */
			nm |= GR_BITS;
		} else if (m == CEI->bits[3]) {
			i = len = CEI->count[3];
			*s++ = _SS3;
			--i;
			/* SS3 designates G3 into GR */
			nm |= GR_BITS;
		} else
			goto CodeSet1;	/* Bletch */
		while (i-- > 0)
			*s++ = (nm >> (i << 3)) & 0xff;
	}
	return (len);
}
Commit	Line	Data
5b2abdfb	1	/*-
3d9156a7	2	* Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
e9ce8d39 A	3	* Copyright (c) 1993
	4	* The Regents of the University of California. All rights reserved.
	5	*
	6	* This code is derived from software contributed to Berkeley by
	7	* Paul Borman at Krystal Technologies.
	8	*
	9	* Redistribution and use in source and binary forms, with or without
	10	* modification, are permitted provided that the following conditions
	11	* are met:
	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.
	24	*
	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
	35	* SUCH DAMAGE.
	36	*/
	37
5b2abdfb A	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 */
3d9156a7 A	41	#include <sys/param.h>
3d9156a7 A	42	__FBSDID("$FreeBSD: src/lib/libc/locale/euc.c,v 1.20 2004/06/23 07:01:43 tjr Exp $");
e9ce8d39 A	43
e9ce8d39 A	44	#include <errno.h>
3d9156a7 A	45	#include <limits.h>
3d9156a7 A	46	#include <runetype.h>
e9ce8d39	47	#include <stdlib.h>
5b2abdfb	48	#include <string.h>
3d9156a7 A	49	#include <wchar.h>
3d9156a7 A	50	#include "mblocal.h"
e9ce8d39	51
3d9156a7 A	52	int _EUC_init(_RuneLocale *);
	53	size_t _EUC_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
	54	mbstate_t * __restrict);
	55	int _EUC_mbsinit(const mbstate_t *);
	56	size_t _EUC_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);
e9ce8d39 A	57
	58	typedef struct {
	59	int count[4];
3d9156a7 A	60	wchar_t bits[4];
3d9156a7 A	61	wchar_t mask;
e9ce8d39 A	62	} _EucInfo;
e9ce8d39 A	63
3d9156a7 A	64	typedef struct {
	65	wchar_t ch;
	66	int set;
	67	int want;
	68	} _EucState;
	69
e9ce8d39	70	int
3d9156a7	71	_EUC_init(_RuneLocale *rl)
e9ce8d39 A	72	{
e9ce8d39 A	73	_EucInfo *ei;
9385eb3d	74	int x, new__mb_cur_max;
e9ce8d39 A	75	char v, e;
e9ce8d39 A	76
3d9156a7	77	if (rl->__variable == NULL)
e9ce8d39	78	return (EFTYPE);
9385eb3d	79
3d9156a7	80	v = (char *)rl->__variable;
e9ce8d39 A	81
	82	while (v == ' ' \|\| v == '\t')
	83	++v;
	84
9385eb3d A	85	if ((ei = malloc(sizeof(_EucInfo))) == NULL)
	86	return (errno == 0 ? ENOMEM : errno);
	87
	88	new__mb_cur_max = 0;
e9ce8d39	89	for (x = 0; x < 4; ++x) {
9385eb3d	90	ei->count[x] = (int)strtol(v, &e, 0);
e9ce8d39	91	if (v == e \|\| !(v = e)) {
e9ce8d39 A	92	free(ei);
	93	return (EFTYPE);
	94	}
9385eb3d A	95	if (new__mb_cur_max < ei->count[x])
9385eb3d A	96	new__mb_cur_max = ei->count[x];
e9ce8d39 A	97	while (v == ' ' \|\| v == '\t')
e9ce8d39 A	98	++v;
9385eb3d	99	ei->bits[x] = (int)strtol(v, &e, 0);
e9ce8d39	100	if (v == e \|\| !(v = e)) {
e9ce8d39 A	101	free(ei);
	102	return (EFTYPE);
	103	}
	104	while (v == ' ' \|\| v == '\t')
	105	++v;
	106	}
	107	ei->mask = (int)strtol(v, &e, 0);
	108	if (v == e \|\| !(v = e)) {
e9ce8d39 A	109	free(ei);
	110	return (EFTYPE);
	111	}
3d9156a7 A	112	rl->__variable = ei;
3d9156a7 A	113	rl->__variable_len = sizeof(_EucInfo);
e9ce8d39	114	_CurrentRuneLocale = rl;
9385eb3d	115	__mb_cur_max = new__mb_cur_max;
3d9156a7 A	116	__mbrtowc = _EUC_mbrtowc;
	117	__wcrtomb = _EUC_wcrtomb;
	118	__mbsinit = _EUC_mbsinit;
e9ce8d39 A	119	return (0);
	120	}
	121
3d9156a7 A	122	int
	123	_EUC_mbsinit(const mbstate_t *ps)
	124	{
	125
	126	return (ps == NULL \|\| ((const _EucState *)ps)->want == 0);
	127	}
	128
	129	#define CEI ((_EucInfo *)(_CurrentRuneLocale->__variable))
e9ce8d39 A	130
	131	#define _SS2 0x008e
	132	#define _SS3 0x008f
	133
9385eb3d A	134	#define GR_BITS 0x80808080 /* XXX: to be fixed */
9385eb3d A	135
3d9156a7 A	136	static __inline int
3d9156a7 A	137	_euc_set(u_int c)
e9ce8d39 A	138	{
e9ce8d39 A	139	c &= 0xff;
e9ce8d39 A	140	return ((c & 0x80) ? c == _SS3 ? 3 : c == _SS2 ? 2 : 1 : 0);
e9ce8d39 A	141	}
3d9156a7 A	142
	143	size_t
	144	_EUC_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
	145	mbstate_t * __restrict ps)
e9ce8d39	146	{
3d9156a7 A	147	_EucState *es;
	148	int i, set, want;
	149	wchar_t wc;
	150	const char *os;
e9ce8d39	151
3d9156a7 A	152	es = (_EucState *)ps;
	153
	154	if (es->want < 0 \|\| es->want > MB_CUR_MAX \|\| es->set < 0 \|\|
	155	es->set > 3) {
	156	errno = EINVAL;
	157	return ((size_t)-1);
e9ce8d39	158	}
3d9156a7 A	159
	160	if (s == NULL) {
	161	s = "";
	162	n = 1;
	163	pwc = NULL;
e9ce8d39	164	}
3d9156a7 A	165
	166	if (n == 0)
	167	/* Incomplete multibyte sequence */
	168	return ((size_t)-2);
	169
	170	os = s;
	171
	172	if (es->want == 0) {
	173	want = CEI->count[set = _euc_set(*s)];
	174	if (set == 2 \|\| set == 3) {
	175	--want;
	176	if (--n == 0) {
	177	/* Incomplete multibyte sequence */
	178	es->set = set;
	179	es->want = want;
	180	es->ch = 0;
	181	return ((size_t)-2);
	182	}
	183	++s;
	184	if (*s == '\0') {
	185	errno = EILSEQ;
	186	return ((size_t)-1);
	187	}
	188	}
	189	wc = (unsigned char)*s++;
	190	} else {
	191	set = es->set;
	192	want = es->want;
	193	wc = es->ch;
	194	}
	195	for (i = (es->want == 0) ? 1 : 0; i < MIN(want, n); i++) {
	196	if (*s == '\0') {
	197	errno = EILSEQ;
	198	return ((size_t)-1);
	199	}
	200	wc = (wc << 8) \| (unsigned char)*s++;
	201	}
	202	if (i < want) {
	203	/* Incomplete multibyte sequence */
	204	es->set = set;
	205	es->want = want - i;
	206	es->ch = wc;
	207	return ((size_t)-2);
	208	}
	209	wc = (wc & ~CEI->mask) \| CEI->bits[set];
	210	if (pwc != NULL)
	211	*pwc = wc;
	212	es->want = 0;
	213	return (wc == L'\0' ? 0 : s - os);
e9ce8d39 A	214	}
e9ce8d39 A	215
3d9156a7 A	216	size_t
3d9156a7 A	217	_EUC_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps)
e9ce8d39	218	{
3d9156a7 A	219	_EucState *es;
3d9156a7 A	220	wchar_t m, nm;
e9ce8d39 A	221	int i, len;
e9ce8d39 A	222
3d9156a7 A	223	es = (_EucState *)ps;
	224
	225	if (es->want != 0) {
	226	errno = EINVAL;
	227	return ((size_t)-1);
	228	}
	229
	230	if (s == NULL)
	231	/* Reset to initial shift state (no-op) */
	232	return (1);
	233
	234	m = wc & CEI->mask;
	235	nm = wc & ~m;
	236
e9ce8d39 A	237	if (m == CEI->bits[1]) {
	238	CodeSet1:
	239	/* Codeset 1: The first byte must have 0x80 in it. */
	240	i = len = CEI->count[1];
3d9156a7 A	241	while (i-- > 0)
3d9156a7 A	242	*s++ = (nm >> (i << 3)) \| 0x80;
e9ce8d39	243	} else {
3d9156a7	244	if (m == CEI->bits[0])
e9ce8d39	245	i = len = CEI->count[0];
3d9156a7 A	246	else if (m == CEI->bits[2]) {
	247	i = len = CEI->count[2];
	248	*s++ = _SS2;
	249	--i;
	250	/* SS2 designates G2 into GR */
	251	nm \|= GR_BITS;
	252	} else if (m == CEI->bits[3]) {
	253	i = len = CEI->count[3];
	254	*s++ = _SS3;
	255	--i;
	256	/* SS3 designates G3 into GR */
	257	nm \|= GR_BITS;
e9ce8d39	258	} else
3d9156a7	259	goto CodeSet1; /* Bletch */
e9ce8d39	260	while (i-- > 0)
3d9156a7	261	*s++ = (nm >> (i << 3)) & 0xff;
e9ce8d39 A	262	}
	263	return (len);
	264	}