/*
* Copyright 2013 Garrett D'Amore <garrett@damore.org>
* Copyright 2011 Nexenta Systems, Inc. All rights reserved.
* 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
* 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.
*/
#include "lint.h"
#include <errno.h>
#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include "mblocal.h"
#include "lctype.h"
const char *_RESTRICT_KYWD,
const char *_RESTRICT_KYWD,
const char *_RESTRICT_KYWD,
const char *_RESTRICT_KYWD,
const char *_RESTRICT_KYWD,
static int _EUC_mbsinit(const mbstate_t *);
typedef struct {
int set;
int want;
} _EucState;
int
{
}
/*
* EUC-CN uses CS0, CS1 and CS2 (4 bytes).
*/
void
{
lct->lc_is_ascii = 0;
}
static size_t
{
}
static size_t
const char **_RESTRICT_KYWD src,
{
}
static size_t
{
}
static size_t
{
}
/*
* EUC-KR uses only CS0 and CS1.
*/
void
{
lct->lc_is_ascii = 0;
}
static size_t
{
}
static size_t
const char **_RESTRICT_KYWD src,
{
}
static size_t
{
}
static size_t
{
}
/*
* EUC-JP uses CS0, CS1, CS2, and CS3.
*/
void
{
lct->lc_is_ascii = 0;
}
static size_t
{
}
static size_t
const char **_RESTRICT_KYWD src,
{
}
static size_t
{
}
static size_t
{
}
/*
* EUC-TW uses CS0, CS1, and CS2.
*/
void
{
lct->lc_is_ascii = 0;
}
static size_t
{
}
static size_t
const char **_RESTRICT_KYWD src,
{
}
static size_t
{
}
static size_t
{
}
/*
* Common EUC code.
*/
static size_t
{
int i, want;
unsigned char ch;
return ((size_t)-1);
}
if (s == NULL) {
s = "";
n = 1;
}
if (n == 0)
/* Incomplete multibyte sequence */
return ((size_t)-2);
/* Fast path for plain ASCII (CS0) */
if (((ch = (unsigned char)*s) & 0x80) == 0) {
}
if (ch >= 0xa1) {
/* CS1 */
want = 2;
} else {
return ((size_t)-1);
}
} else {
}
wc <<= 8;
wc |= *s;
s++;
}
if (i < want) {
/* Incomplete multibyte sequence */
return ((size_t)-2);
}
}
static size_t
{
int i, len;
return ((size_t)-1);
}
if (s == NULL)
/* Reset to initial shift state (no-op) */
return (1);
if ((wc & ~0x7f) == 0) {
/* Fast path for plain ASCII (CS0) */
*s = (char)wc;
return (1);
}
/* Determine the "length" */
if ((unsigned)wc > 0xffffff) {
len = 4;
} else if ((unsigned)wc > 0xffff) {
len = 3;
} else if ((unsigned)wc > 0xff) {
len = 2;
} else {
len = 1;
}
if (len > MB_CUR_MAX) {
return ((size_t)-1);
}
/* This first check excludes CS1, which is implicitly valid. */
/* Check for valid CS2 or CS3 */
return ((size_t)-1);
}
return ((size_t)-1);
}
} else {
return ((size_t)-1);
}
}
/* Stash the bytes, least significant last */
for (i = len - 1; i >= 0; i--) {
s[i] = (wc & 0xff);
wc >>= 8;
}
return (len);
}