1 /*- 2 * Copyright 2013 Garrett D'Amore <garrett@damore.org> 3 * Copyright 2010 Nexenta Systems, Inc. All rights reserved. 4 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved. 5 * Copyright (c) 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Paul Borman at Krystal Technologies. 10 * 11 * Copyright (c) 2011 The FreeBSD Foundation 12 * 13 * Portions of this software were developed by David Chisnall 14 * under sponsorship from the FreeBSD Foundation. 15 * 16 * Redistribution and use in source and binary forms, with or without 17 * modification, are permitted provided that the following conditions 18 * are met: 19 * 1. Redistributions of source code must retain the above copyright 20 * notice, this list of conditions and the following disclaimer. 21 * 2. Redistributions in binary form must reproduce the above copyright 22 * notice, this list of conditions and the following disclaimer in the 23 * documentation and/or other materials provided with the distribution. 24 * 3. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 */ 40 41 #if defined(LIBC_SCCS) && !defined(lint) 42 static char sccsid[] = "@(#)big5.c 8.1 (Berkeley) 6/4/93"; 43 #endif /* LIBC_SCCS and not lint */ 44 #include <sys/cdefs.h> 45 #include <sys/types.h> 46 #include <errno.h> 47 #include <runetype.h> 48 #include <stdlib.h> 49 #include <string.h> 50 #include <wchar.h> 51 #include "mblocal.h" 52 53 extern int __mb_sb_limit; 54 55 static size_t _BIG5_mbrtowc(wchar_t * __restrict, const char * __restrict, 56 size_t, mbstate_t * __restrict); 57 static int _BIG5_mbsinit(const mbstate_t *); 58 static size_t _BIG5_wcrtomb(char * __restrict, wchar_t, 59 mbstate_t * __restrict); 60 static size_t _BIG5_mbsnrtowcs(wchar_t * __restrict, 61 const char ** __restrict, size_t, size_t, 62 mbstate_t * __restrict); 63 static size_t _BIG5_wcsnrtombs(char * __restrict, 64 const wchar_t ** __restrict, size_t, size_t, 65 mbstate_t * __restrict); 66 67 typedef struct { 68 wchar_t ch; 69 } _BIG5State; 70 71 int 72 _BIG5_init(struct xlocale_ctype *l, _RuneLocale *rl) 73 { 74 75 l->__mbrtowc = _BIG5_mbrtowc; 76 l->__wcrtomb = _BIG5_wcrtomb; 77 l->__mbsnrtowcs = _BIG5_mbsnrtowcs; 78 l->__wcsnrtombs = _BIG5_wcsnrtombs; 79 l->__mbsinit = _BIG5_mbsinit; 80 l->runes = rl; 81 l->__mb_cur_max = 2; 82 l->__mb_sb_limit = 128; 83 return (0); 84 } 85 86 static int 87 _BIG5_mbsinit(const mbstate_t *ps) 88 { 89 90 return (ps == NULL || ((const _BIG5State *)ps)->ch == 0); 91 } 92 93 static __inline int 94 _big5_check(u_int c) 95 { 96 97 c &= 0xff; 98 return ((c >= 0xa1 && c <= 0xfe) ? 2 : 1); 99 } 100 101 static size_t 102 _BIG5_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n, 103 mbstate_t * __restrict ps) 104 { 105 _BIG5State *bs; 106 wchar_t wc; 107 size_t len; 108 109 bs = (_BIG5State *)ps; 110 111 if ((bs->ch & ~0xFF) != 0) { 112 /* Bad conversion state. */ 113 errno = EINVAL; 114 return ((size_t)-1); 115 } 116 117 if (s == NULL) { 118 s = ""; 119 n = 1; 120 pwc = NULL; 121 } 122 123 if (n == 0) 124 /* Incomplete multibyte sequence */ 125 return ((size_t)-2); 126 127 if (bs->ch != 0) { 128 if (*s == '\0') { 129 errno = EILSEQ; 130 return ((size_t)-1); 131 } 132 wc = (bs->ch << 8) | (*s & 0xFF); 133 if (pwc != NULL) 134 *pwc = wc; 135 bs->ch = 0; 136 return (1); 137 } 138 139 len = (size_t)_big5_check(*s); 140 wc = *s++ & 0xff; 141 if (len == 2) { 142 if (n < 2) { 143 /* Incomplete multibyte sequence */ 144 bs->ch = wc; 145 return ((size_t)-2); 146 } 147 if (*s == '\0') { 148 errno = EILSEQ; 149 return ((size_t)-1); 150 } 151 wc = (wc << 8) | (*s++ & 0xff); 152 if (pwc != NULL) 153 *pwc = wc; 154 return (2); 155 } else { 156 if (pwc != NULL) 157 *pwc = wc; 158 return (wc == L'\0' ? 0 : 1); 159 } 160 } 161 162 static size_t 163 _BIG5_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps) 164 { 165 _BIG5State *bs; 166 167 bs = (_BIG5State *)ps; 168 169 if (bs->ch != 0) { 170 errno = EINVAL; 171 return ((size_t)-1); 172 } 173 174 if (s == NULL) 175 /* Reset to initial shift state (no-op) */ 176 return (1); 177 if (wc & 0x8000) { 178 *s++ = (wc >> 8) & 0xff; 179 *s = wc & 0xff; 180 return (2); 181 } 182 *s = wc & 0xff; 183 return (1); 184 } 185 186 static size_t 187 _BIG5_mbsnrtowcs(wchar_t * __restrict dst, const char ** __restrict src, 188 size_t nms, size_t len, mbstate_t * __restrict ps) 189 { 190 return (__mbsnrtowcs_std(dst, src, nms, len, ps, _BIG5_mbrtowc)); 191 } 192 193 static size_t 194 _BIG5_wcsnrtombs(char * __restrict dst, const wchar_t ** __restrict src, 195 size_t nwc, size_t len, mbstate_t * __restrict ps) 196 { 197 return (__wcsnrtombs_std(dst, src, nwc, len, ps, _BIG5_wcrtomb)); 198 } 199