2002-10-10 22:56:18 +00:00
|
|
|
/*-
|
2004-04-07 10:48:19 +00:00
|
|
|
* Copyright (c) 2002-2004 Tim J. Robbins
|
2002-10-10 22:56:18 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
|
|
|
|
*/
|
|
|
|
|
2004-04-07 10:48:19 +00:00
|
|
|
#include <sys/param.h>
|
2002-10-10 22:56:18 +00:00
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
#include <errno.h>
|
|
|
|
#include <runetype.h>
|
2002-10-10 22:56:18 +00:00
|
|
|
#include <stdlib.h>
|
2004-04-07 10:48:19 +00:00
|
|
|
#include <string.h>
|
2003-11-02 10:09:33 +00:00
|
|
|
#include <wchar.h>
|
2002-10-10 22:56:18 +00:00
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
extern size_t (*__mbrtowc)(wchar_t * __restrict, const char * __restrict,
|
|
|
|
size_t, mbstate_t * __restrict);
|
2004-04-07 10:48:19 +00:00
|
|
|
extern int (*__mbsinit)(const mbstate_t *);
|
2003-11-02 10:09:33 +00:00
|
|
|
extern size_t (*__wcrtomb)(char * __restrict, wchar_t, mbstate_t * __restrict);
|
|
|
|
|
2004-04-07 10:48:19 +00:00
|
|
|
size_t _UTF8_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
|
2003-11-02 10:09:33 +00:00
|
|
|
mbstate_t * __restrict);
|
2004-04-07 10:48:19 +00:00
|
|
|
int _UTF8_mbsinit(const mbstate_t *);
|
|
|
|
size_t _UTF8_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
int count;
|
|
|
|
u_char bytes[6];
|
|
|
|
} _UTF8State;
|
2002-10-10 22:56:18 +00:00
|
|
|
|
|
|
|
int
|
|
|
|
_UTF8_init(_RuneLocale *rl)
|
|
|
|
{
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
__mbrtowc = _UTF8_mbrtowc;
|
|
|
|
__wcrtomb = _UTF8_wcrtomb;
|
2004-04-07 10:48:19 +00:00
|
|
|
__mbsinit = _UTF8_mbsinit;
|
2002-10-10 22:56:18 +00:00
|
|
|
_CurrentRuneLocale = rl;
|
|
|
|
__mb_cur_max = 6;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2004-04-07 10:48:19 +00:00
|
|
|
int
|
|
|
|
_UTF8_mbsinit(const mbstate_t *ps)
|
|
|
|
{
|
|
|
|
|
2004-04-10 00:27:52 +00:00
|
|
|
return (ps == NULL || ((const _UTF8State *)ps)->count == 0);
|
2004-04-07 10:48:19 +00:00
|
|
|
}
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
size_t
|
|
|
|
_UTF8_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
|
2004-04-07 10:48:19 +00:00
|
|
|
mbstate_t * __restrict ps)
|
2002-10-10 22:56:18 +00:00
|
|
|
{
|
2004-04-07 10:48:19 +00:00
|
|
|
_UTF8State *us;
|
|
|
|
int ch, i, len, mask, ocount;
|
2003-11-02 10:09:33 +00:00
|
|
|
wchar_t lbound, wch;
|
2004-04-07 10:48:19 +00:00
|
|
|
size_t ncopy;
|
|
|
|
|
|
|
|
us = (_UTF8State *)ps;
|
|
|
|
|
2004-04-12 13:09:18 +00:00
|
|
|
if (us->count < 0 || us->count > sizeof(us->bytes)) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return ((size_t)-1);
|
|
|
|
}
|
|
|
|
|
2004-04-07 10:48:19 +00:00
|
|
|
if (s == NULL) {
|
|
|
|
s = "";
|
|
|
|
n = 1;
|
|
|
|
pwc = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
ncopy = MIN(MIN(n, MB_CUR_MAX), sizeof(us->bytes) - us->count);
|
|
|
|
memcpy(us->bytes + us->count, s, ncopy);
|
|
|
|
ocount = us->count;
|
|
|
|
us->count += ncopy;
|
|
|
|
s = (char *)us->bytes;
|
|
|
|
n = us->count;
|
2002-10-10 22:56:18 +00:00
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
if (n == 0)
|
|
|
|
/* Incomplete multibyte sequence */
|
|
|
|
return ((size_t)-2);
|
2002-10-10 22:56:18 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Determine the number of octets that make up this character from
|
|
|
|
* the first octet, and a mask that extracts the interesting bits of
|
|
|
|
* the first octet.
|
|
|
|
*
|
|
|
|
* We also specify a lower bound for the character code to detect
|
|
|
|
* redundant, non-"shortest form" encodings. For example, the
|
|
|
|
* sequence C0 80 is _not_ a legal representation of the null
|
|
|
|
* character. This enforces a 1-to-1 mapping between character
|
|
|
|
* codes and their multibyte representations.
|
|
|
|
*/
|
2003-11-02 10:09:33 +00:00
|
|
|
ch = (unsigned char)*s;
|
2002-10-10 22:56:18 +00:00
|
|
|
if ((ch & 0x80) == 0) {
|
|
|
|
mask = 0x7f;
|
|
|
|
len = 1;
|
|
|
|
lbound = 0;
|
|
|
|
} else if ((ch & 0xe0) == 0xc0) {
|
|
|
|
mask = 0x1f;
|
|
|
|
len = 2;
|
|
|
|
lbound = 0x80;
|
|
|
|
} else if ((ch & 0xf0) == 0xe0) {
|
|
|
|
mask = 0x0f;
|
|
|
|
len = 3;
|
|
|
|
lbound = 0x800;
|
|
|
|
} else if ((ch & 0xf8) == 0xf0) {
|
|
|
|
mask = 0x07;
|
|
|
|
len = 4;
|
|
|
|
lbound = 0x10000;
|
|
|
|
} else if ((ch & 0xfc) == 0xf8) {
|
|
|
|
mask = 0x03;
|
|
|
|
len = 5;
|
|
|
|
lbound = 0x200000;
|
|
|
|
} else if ((ch & 0xfc) == 0xfc) {
|
|
|
|
mask = 0x01;
|
|
|
|
len = 6;
|
|
|
|
lbound = 0x4000000;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Malformed input; input is not UTF-8.
|
|
|
|
*/
|
2003-11-02 10:09:33 +00:00
|
|
|
errno = EILSEQ;
|
|
|
|
return ((size_t)-1);
|
2002-10-10 22:56:18 +00:00
|
|
|
}
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
if (n < (size_t)len)
|
|
|
|
/* Incomplete multibyte sequence */
|
|
|
|
return ((size_t)-2);
|
2002-10-10 22:56:18 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Decode the octet sequence representing the character in chunks
|
|
|
|
* of 6 bits, most significant first.
|
|
|
|
*/
|
2003-11-02 10:09:33 +00:00
|
|
|
wch = (unsigned char)*s++ & mask;
|
|
|
|
i = len;
|
|
|
|
while (--i != 0) {
|
|
|
|
if ((*s & 0xc0) != 0x80) {
|
2002-10-10 22:56:18 +00:00
|
|
|
/*
|
|
|
|
* Malformed input; bad characters in the middle
|
|
|
|
* of a character.
|
|
|
|
*/
|
2003-11-02 10:09:33 +00:00
|
|
|
errno = EILSEQ;
|
|
|
|
return ((size_t)-1);
|
2002-10-10 22:56:18 +00:00
|
|
|
}
|
|
|
|
wch <<= 6;
|
2003-11-02 10:09:33 +00:00
|
|
|
wch |= *s++ & 0x3f;
|
2002-10-10 22:56:18 +00:00
|
|
|
}
|
2003-11-02 10:09:33 +00:00
|
|
|
if (wch < lbound) {
|
2002-10-10 22:56:18 +00:00
|
|
|
/*
|
|
|
|
* Malformed input; redundant encoding.
|
|
|
|
*/
|
2003-11-02 10:09:33 +00:00
|
|
|
errno = EILSEQ;
|
|
|
|
return ((size_t)-1);
|
|
|
|
}
|
|
|
|
if (pwc != NULL)
|
|
|
|
*pwc = wch;
|
2004-04-07 10:48:19 +00:00
|
|
|
us->count = 0;
|
|
|
|
return (wch == L'\0' ? 0 : len - ocount);
|
2002-10-10 22:56:18 +00:00
|
|
|
}
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
size_t
|
2004-04-12 13:09:18 +00:00
|
|
|
_UTF8_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps)
|
2002-10-10 22:56:18 +00:00
|
|
|
{
|
2004-04-12 13:09:18 +00:00
|
|
|
_UTF8State *us;
|
2002-10-10 22:56:18 +00:00
|
|
|
unsigned char lead;
|
|
|
|
int i, len;
|
|
|
|
|
2004-04-12 13:09:18 +00:00
|
|
|
us = (_UTF8State *)ps;
|
|
|
|
|
|
|
|
if (us->count < 0 || us->count > sizeof(us->bytes)) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return ((size_t)-1);
|
|
|
|
}
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
if (s == NULL)
|
|
|
|
/* Reset to initial shift state (no-op) */
|
|
|
|
return (1);
|
|
|
|
|
2002-10-10 22:56:18 +00:00
|
|
|
/*
|
|
|
|
* Determine the number of octets needed to represent this character.
|
|
|
|
* We always output the shortest sequence possible. Also specify the
|
|
|
|
* first few bits of the first octet, which contains the information
|
|
|
|
* about the sequence length.
|
|
|
|
*/
|
2003-11-02 10:09:33 +00:00
|
|
|
if ((wc & ~0x7f) == 0) {
|
2002-10-10 22:56:18 +00:00
|
|
|
lead = 0;
|
|
|
|
len = 1;
|
2003-11-02 10:09:33 +00:00
|
|
|
} else if ((wc & ~0x7ff) == 0) {
|
2002-10-10 22:56:18 +00:00
|
|
|
lead = 0xc0;
|
|
|
|
len = 2;
|
2003-11-02 10:09:33 +00:00
|
|
|
} else if ((wc & ~0xffff) == 0) {
|
2002-10-10 22:56:18 +00:00
|
|
|
lead = 0xe0;
|
|
|
|
len = 3;
|
2003-11-02 10:09:33 +00:00
|
|
|
} else if ((wc & ~0x1fffff) == 0) {
|
2002-10-10 22:56:18 +00:00
|
|
|
lead = 0xf0;
|
|
|
|
len = 4;
|
2003-11-02 10:09:33 +00:00
|
|
|
} else if ((wc & ~0x3ffffff) == 0) {
|
2002-10-10 22:56:18 +00:00
|
|
|
lead = 0xf8;
|
|
|
|
len = 5;
|
2003-11-02 10:09:33 +00:00
|
|
|
} else if ((wc & ~0x7fffffff) == 0) {
|
2002-10-10 22:56:18 +00:00
|
|
|
lead = 0xfc;
|
|
|
|
len = 6;
|
|
|
|
} else {
|
2003-11-02 10:09:33 +00:00
|
|
|
errno = EILSEQ;
|
|
|
|
return ((size_t)-1);
|
2002-10-10 22:56:18 +00:00
|
|
|
}
|
|
|
|
|
2003-11-02 10:09:33 +00:00
|
|
|
/*
|
|
|
|
* Output the octets representing the character in chunks
|
|
|
|
* of 6 bits, least significant last. The first octet is
|
|
|
|
* a special case because it contains the sequence length
|
|
|
|
* information.
|
|
|
|
*/
|
|
|
|
for (i = len - 1; i > 0; i--) {
|
|
|
|
s[i] = (wc & 0x3f) | 0x80;
|
|
|
|
wc >>= 6;
|
2002-10-10 22:56:18 +00:00
|
|
|
}
|
2003-11-02 10:09:33 +00:00
|
|
|
*s = (wc & 0xff) | lead;
|
2002-10-10 22:56:18 +00:00
|
|
|
|
|
|
|
return (len);
|
|
|
|
}
|