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 * 6 * ja_JP.SJIS locale table for BSD4.4/rune 7 * version 1.0 8 * (C) Sin'ichiro MIYATANI / Phase One, Inc 9 * May 12, 1995 10 * 11 * Copyright (c) 2011 The FreeBSD Foundation 12 * All rights reserved. 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. All advertising materials mentioning features or use of this software 25 * must display the following acknowledgement: 26 * This product includes software developed by Phase One, Inc. 27 * 4. The name of Phase One, Inc. may be used to endorse or promote products 28 * derived from this software 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 * @(#)mskanji.c 1.0 (Phase One) 5/5/95 43 */ 44 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 _MSKanji_mbrtowc(wchar_t * __restrict, const char * __restrict, 57 size_t, mbstate_t * __restrict); 58 static int _MSKanji_mbsinit(const mbstate_t *); 59 static size_t _MSKanji_wcrtomb(char * __restrict, wchar_t, 60 mbstate_t * __restrict); 61 static size_t _MSKanji_mbsnrtowcs(wchar_t * __restrict, 62 const char ** __restrict, size_t, size_t, 63 mbstate_t * __restrict); 64 static size_t _MSKanji_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 } _MSKanjiState; 71 72 int 73 _MSKanji_init(struct xlocale_ctype *l, _RuneLocale *rl) 74 { 75 76 l->__mbrtowc = _MSKanji_mbrtowc; 77 l->__wcrtomb = _MSKanji_wcrtomb; 78 l->__mbsnrtowcs = _MSKanji_mbsnrtowcs; 79 l->__wcsnrtombs = _MSKanji_wcsnrtombs; 80 l->__mbsinit = _MSKanji_mbsinit; 81 l->runes = rl; 82 l->__mb_cur_max = 2; 83 l->__mb_sb_limit = 256; 84 return (0); 85 } 86 87 static int 88 _MSKanji_mbsinit(const mbstate_t *ps) 89 { 90 91 return (ps == NULL || ((const _MSKanjiState *)ps)->ch == 0); 92 } 93 94 static size_t 95 _MSKanji_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n, 96 mbstate_t * __restrict ps) 97 { 98 _MSKanjiState *ms; 99 wchar_t wc; 100 101 ms = (_MSKanjiState *)ps; 102 103 if ((ms->ch & ~0xFF) != 0) { 104 /* Bad conversion state. */ 105 errno = EINVAL; 106 return ((size_t)-1); 107 } 108 109 if (s == NULL) { 110 s = ""; 111 n = 1; 112 pwc = NULL; 113 } 114 115 if (n == 0) 116 /* Incomplete multibyte sequence */ 117 return ((size_t)-2); 118 119 if (ms->ch != 0) { 120 if (*s == '\0') { 121 errno = EILSEQ; 122 return ((size_t)-1); 123 } 124 wc = (ms->ch << 8) | (*s & 0xFF); 125 if (pwc != NULL) 126 *pwc = wc; 127 ms->ch = 0; 128 return (1); 129 } 130 wc = *s++ & 0xff; 131 if ((wc > 0x80 && wc < 0xa0) || (wc >= 0xe0 && wc < 0xfd)) { 132 if (n < 2) { 133 /* Incomplete multibyte sequence */ 134 ms->ch = wc; 135 return ((size_t)-2); 136 } 137 if (*s == '\0') { 138 errno = EILSEQ; 139 return ((size_t)-1); 140 } 141 wc = (wc << 8) | (*s++ & 0xff); 142 if (pwc != NULL) 143 *pwc = wc; 144 return (2); 145 } else { 146 if (pwc != NULL) 147 *pwc = wc; 148 return (wc == L'\0' ? 0 : 1); 149 } 150 } 151 152 static size_t 153 _MSKanji_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps) 154 { 155 _MSKanjiState *ms; 156 int len, i; 157 158 ms = (_MSKanjiState *)ps; 159 160 if (ms->ch != 0) { 161 errno = EINVAL; 162 return ((size_t)-1); 163 } 164 165 if (s == NULL) 166 /* Reset to initial shift state (no-op) */ 167 return (1); 168 len = (wc > 0x100) ? 2 : 1; 169 for (i = len; i-- > 0; ) 170 *s++ = wc >> (i << 3); 171 return (len); 172 } 173 174 static size_t 175 _MSKanji_mbsnrtowcs(wchar_t * __restrict dst, 176 const char ** __restrict src, size_t nms, 177 size_t len, mbstate_t * __restrict ps) 178 { 179 return (__mbsnrtowcs_std(dst, src, nms, len, ps, _MSKanji_mbrtowc)); 180 } 181 182 static size_t 183 _MSKanji_wcsnrtombs(char * __restrict dst, 184 const wchar_t ** __restrict src, size_t nwc, 185 size_t len, mbstate_t * __restrict ps) 186 { 187 return (__wcsnrtombs_std(dst, src, nwc, len, ps, _MSKanji_wcrtomb)); 188 } 189