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