1/*-
2 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
3 * Copyright (c) 1993
4 * The Regents of the University of California. All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * Paul Borman at Krystal Technologies.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 */
37
38#if defined(LIBC_SCCS) && !defined(lint)
39static char sccsid[] = "@(#)big5.c 8.1 (Berkeley) 6/4/93";
40#endif /* LIBC_SCCS and not lint */
41#include <sys/param.h>
| 1/*-
2 * Copyright (c) 2002-2004 Tim J. Robbins. All rights reserved.
3 * Copyright (c) 1993
4 * The Regents of the University of California. All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * Paul Borman at Krystal Technologies.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 */
37
38#if defined(LIBC_SCCS) && !defined(lint)
39static char sccsid[] = "@(#)big5.c 8.1 (Berkeley) 6/4/93";
40#endif /* LIBC_SCCS and not lint */
41#include <sys/param.h>
|
42__FBSDID("$FreeBSD: head/lib/libc/locale/big5.c 128081 2004-04-10 00:27:52Z tjr $");
| 42__FBSDID("$FreeBSD: head/lib/libc/locale/big5.c 128155 2004-04-12 13:09:18Z tjr $");
|
43
| 43
|
| 44#include <errno.h>
|
44#include <runetype.h>
45#include <stdlib.h>
46#include <string.h>
47#include <wchar.h>
48
49extern size_t (*__mbrtowc)(wchar_t * __restrict, const char * __restrict,
50 size_t, mbstate_t * __restrict);
51extern int (*__mbsinit)(const mbstate_t *);
52extern size_t (*__wcrtomb)(char * __restrict, wchar_t, mbstate_t * __restrict);
53
54int _BIG5_init(_RuneLocale *);
55size_t _BIG5_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
56 mbstate_t * __restrict);
57int _BIG5_mbsinit(const mbstate_t *);
58size_t _BIG5_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);
59
60typedef struct {
61 int count;
62 u_char bytes[2];
63} _BIG5State;
64
65int
66_BIG5_init(_RuneLocale *rl)
67{
68
69 __mbrtowc = _BIG5_mbrtowc;
70 __wcrtomb = _BIG5_wcrtomb;
71 __mbsinit = _BIG5_mbsinit;
72 _CurrentRuneLocale = rl;
73 __mb_cur_max = 2;
74 return (0);
75}
76
77int
78_BIG5_mbsinit(const mbstate_t *ps)
79{
80
81 return (ps == NULL || ((const _BIG5State *)ps)->count == 0);
82}
83
84static __inline int
85_big5_check(u_int c)
86{
87
88 c &= 0xff;
89 return ((c >= 0xa1 && c <= 0xfe) ? 2 : 1);
90}
91
92size_t
93_BIG5_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
94 mbstate_t * __restrict ps)
95{
96 _BIG5State *bs;
97 wchar_t wc;
98 int i, len, ocount;
99 size_t ncopy;
100
101 bs = (_BIG5State *)ps;
102
| 45#include <runetype.h>
46#include <stdlib.h>
47#include <string.h>
48#include <wchar.h>
49
50extern size_t (*__mbrtowc)(wchar_t * __restrict, const char * __restrict,
51 size_t, mbstate_t * __restrict);
52extern int (*__mbsinit)(const mbstate_t *);
53extern size_t (*__wcrtomb)(char * __restrict, wchar_t, mbstate_t * __restrict);
54
55int _BIG5_init(_RuneLocale *);
56size_t _BIG5_mbrtowc(wchar_t * __restrict, const char * __restrict, size_t,
57 mbstate_t * __restrict);
58int _BIG5_mbsinit(const mbstate_t *);
59size_t _BIG5_wcrtomb(char * __restrict, wchar_t, mbstate_t * __restrict);
60
61typedef struct {
62 int count;
63 u_char bytes[2];
64} _BIG5State;
65
66int
67_BIG5_init(_RuneLocale *rl)
68{
69
70 __mbrtowc = _BIG5_mbrtowc;
71 __wcrtomb = _BIG5_wcrtomb;
72 __mbsinit = _BIG5_mbsinit;
73 _CurrentRuneLocale = rl;
74 __mb_cur_max = 2;
75 return (0);
76}
77
78int
79_BIG5_mbsinit(const mbstate_t *ps)
80{
81
82 return (ps == NULL || ((const _BIG5State *)ps)->count == 0);
83}
84
85static __inline int
86_big5_check(u_int c)
87{
88
89 c &= 0xff;
90 return ((c >= 0xa1 && c <= 0xfe) ? 2 : 1);
91}
92
93size_t
94_BIG5_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
95 mbstate_t * __restrict ps)
96{
97 _BIG5State *bs;
98 wchar_t wc;
99 int i, len, ocount;
100 size_t ncopy;
101
102 bs = (_BIG5State *)ps;
103
|
| 104 if (bs->count < 0 || bs->count > sizeof(bs->bytes)) {
105 errno = EINVAL;
106 return ((size_t)-1);
107 }
108
|
103 if (s == NULL) {
104 s = "";
105 n = 1;
106 pwc = NULL;
107 }
108
109 ncopy = MIN(MIN(n, MB_CUR_MAX), sizeof(bs->bytes) - bs->count);
110 memcpy(bs->bytes + bs->count, s, ncopy);
111 ocount = bs->count;
112 bs->count += ncopy;
113 s = (char *)bs->bytes;
114 n = bs->count;
115
116 if (n == 0 || (size_t)(len = _big5_check(*s)) > n)
117 /* Incomplete multibyte sequence */
118 return ((size_t)-2);
119 wc = 0;
120 i = len;
121 while (i-- > 0)
122 wc = (wc << 8) | (unsigned char)*s++;
123 if (pwc != NULL)
124 *pwc = wc;
125 bs->count = 0;
126 return (wc == L'\0' ? 0 : len - ocount);
127}
128
129size_t
| 109 if (s == NULL) {
110 s = "";
111 n = 1;
112 pwc = NULL;
113 }
114
115 ncopy = MIN(MIN(n, MB_CUR_MAX), sizeof(bs->bytes) - bs->count);
116 memcpy(bs->bytes + bs->count, s, ncopy);
117 ocount = bs->count;
118 bs->count += ncopy;
119 s = (char *)bs->bytes;
120 n = bs->count;
121
122 if (n == 0 || (size_t)(len = _big5_check(*s)) > n)
123 /* Incomplete multibyte sequence */
124 return ((size_t)-2);
125 wc = 0;
126 i = len;
127 while (i-- > 0)
128 wc = (wc << 8) | (unsigned char)*s++;
129 if (pwc != NULL)
130 *pwc = wc;
131 bs->count = 0;
132 return (wc == L'\0' ? 0 : len - ocount);
133}
134
135size_t
|
130_BIG5_wcrtomb(char * __restrict s, wchar_t wc,
131 mbstate_t * __restrict ps __unused)
| 136_BIG5_wcrtomb(char * __restrict s, wchar_t wc, mbstate_t * __restrict ps)
|
132{
| 137{
|
| 138 _BIG5State *bs;
|
133
| 139
|
| 140 bs = (_BIG5State *)ps;
141
142 if (bs->count != 0) {
143 errno = EINVAL;
144 return ((size_t)-1);
145 }
146
|
134 if (s == NULL)
135 /* Reset to initial shift state (no-op) */
136 return (1);
137 if (wc & 0x8000) {
138 *s++ = (wc >> 8) & 0xff;
139 *s = wc & 0xff;
140 return (2);
141 }
142 *s = wc & 0xff;
143 return (1);
144}
| 147 if (s == NULL)
148 /* Reset to initial shift state (no-op) */
149 return (1);
150 if (wc & 0x8000) {
151 *s++ = (wc >> 8) & 0xff;
152 *s = wc & 0xff;
153 return (2);
154 }
155 *s = wc & 0xff;
156 return (1);
157}
|