unicode.h revision 1.7 1 1.7 jakllsch /* $NetBSD: unicode.h,v 1.7 2014/04/06 19:25:22 jakllsch Exp $ */
2 1.1 jdolecek
3 1.1 jdolecek /*-
4 1.1 jdolecek * Copyright (c) 2001, 2004 The NetBSD Foundation, Inc.
5 1.1 jdolecek * All rights reserved.
6 1.1 jdolecek *
7 1.1 jdolecek * Redistribution and use in source and binary forms, with or without
8 1.1 jdolecek * modification, are permitted provided that the following conditions
9 1.1 jdolecek * are met:
10 1.1 jdolecek * 1. Redistributions of source code must retain the above copyright
11 1.1 jdolecek * notice, this list of conditions and the following disclaimer.
12 1.1 jdolecek * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 jdolecek * notice, this list of conditions and the following disclaimer in the
14 1.1 jdolecek * documentation and/or other materials provided with the distribution.
15 1.1 jdolecek *
16 1.1 jdolecek * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
17 1.1 jdolecek * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
18 1.1 jdolecek * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
19 1.1 jdolecek * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
20 1.1 jdolecek * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 1.1 jdolecek * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 1.1 jdolecek * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 1.1 jdolecek * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 1.1 jdolecek * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 1.1 jdolecek * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 1.1 jdolecek * POSSIBILITY OF SUCH DAMAGE.
27 1.1 jdolecek */
28 1.1 jdolecek
29 1.4 yamt /*-
30 1.4 yamt * Copyright (c) 1993
31 1.4 yamt * The Regents of the University of California. All rights reserved.
32 1.4 yamt *
33 1.4 yamt * This code is derived from software contributed to Berkeley by
34 1.4 yamt * Paul Borman at Krystal Technologies.
35 1.4 yamt *
36 1.4 yamt * Redistribution and use in source and binary forms, with or without
37 1.4 yamt * modification, are permitted provided that the following conditions
38 1.4 yamt * are met:
39 1.4 yamt * 1. Redistributions of source code must retain the above copyright
40 1.4 yamt * notice, this list of conditions and the following disclaimer.
41 1.4 yamt * 2. Redistributions in binary form must reproduce the above copyright
42 1.4 yamt * notice, this list of conditions and the following disclaimer in the
43 1.4 yamt * documentation and/or other materials provided with the distribution.
44 1.4 yamt * 3. All advertising materials mentioning features or use of this software
45 1.4 yamt * must display the following acknowledgement:
46 1.4 yamt * This product includes software developed by the University of
47 1.4 yamt * California, Berkeley and its contributors.
48 1.4 yamt * 4. Neither the name of the University nor the names of its contributors
49 1.4 yamt * may be used to endorse or promote products derived from this software
50 1.4 yamt * without specific prior written permission.
51 1.4 yamt *
52 1.4 yamt * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 1.4 yamt * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 1.4 yamt * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 1.4 yamt * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 1.4 yamt * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 1.4 yamt * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 1.4 yamt * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 1.4 yamt * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 1.4 yamt * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 1.4 yamt * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 1.4 yamt * SUCH DAMAGE.
63 1.4 yamt */
64 1.4 yamt
65 1.1 jdolecek /*
66 1.1 jdolecek * Routines for handling Unicode encoded in UTF-8 form, code derived from
67 1.1 jdolecek * src/lib/libc/locale/utf2.c.
68 1.1 jdolecek */
69 1.5 drochner static u_int16_t wget_utf8(const char **, size_t *) __unused;
70 1.5 drochner static int wput_utf8(char *, size_t, u_int16_t) __unused;
71 1.1 jdolecek
72 1.1 jdolecek /*
73 1.2 jdolecek * Read one UTF8-encoded character off the string, shift the string pointer
74 1.1 jdolecek * and return the character.
75 1.1 jdolecek */
76 1.1 jdolecek static u_int16_t
77 1.2 jdolecek wget_utf8(const char **str, size_t *sz)
78 1.1 jdolecek {
79 1.7 jakllsch size_t c;
80 1.1 jdolecek u_int16_t rune = 0;
81 1.1 jdolecek const char *s = *str;
82 1.1 jdolecek static const int _utf_count[16] = {
83 1.1 jdolecek 1, 1, 1, 1, 1, 1, 1, 1,
84 1.1 jdolecek 0, 0, 0, 0, 2, 2, 3, 0,
85 1.1 jdolecek };
86 1.1 jdolecek
87 1.2 jdolecek /* must be called with at least one byte remaining */
88 1.2 jdolecek KASSERT(*sz > 0);
89 1.1 jdolecek
90 1.1 jdolecek c = _utf_count[(s[0] & 0xf0) >> 4];
91 1.2 jdolecek if (c == 0 || c > *sz) {
92 1.1 jdolecek decoding_error:
93 1.1 jdolecek /*
94 1.1 jdolecek * The first character is in range 128-255 and doesn't
95 1.1 jdolecek * mark valid a valid UTF-8 sequence. There is not much
96 1.1 jdolecek * we can do with this, so handle by returning
97 1.1 jdolecek * the first character as if it would be a correctly
98 1.1 jdolecek * encoded ISO-8859-1 character.
99 1.1 jdolecek */
100 1.1 jdolecek c = 1;
101 1.1 jdolecek }
102 1.1 jdolecek
103 1.1 jdolecek switch (c) {
104 1.1 jdolecek case 1:
105 1.1 jdolecek rune = s[0] & 0xff;
106 1.1 jdolecek break;
107 1.1 jdolecek case 2:
108 1.1 jdolecek if ((s[1] & 0xc0) != 0x80)
109 1.1 jdolecek goto decoding_error;
110 1.1 jdolecek rune = ((s[0] & 0x1F) << 6) | (s[1] & 0x3F);
111 1.1 jdolecek break;
112 1.1 jdolecek case 3:
113 1.1 jdolecek if ((s[1] & 0xC0) != 0x80 || (s[2] & 0xC0) != 0x80)
114 1.1 jdolecek goto decoding_error;
115 1.5 drochner rune = ((s[0] & 0x0F) << 12) | ((s[1] & 0x3F) << 6)
116 1.1 jdolecek | (s[2] & 0x3F);
117 1.1 jdolecek break;
118 1.1 jdolecek }
119 1.1 jdolecek
120 1.2 jdolecek *str += c;
121 1.2 jdolecek *sz -= c;
122 1.1 jdolecek return rune;
123 1.1 jdolecek }
124 1.1 jdolecek
125 1.1 jdolecek /*
126 1.1 jdolecek * Encode wide character and write it to the string. 'n' specifies
127 1.1 jdolecek * how much buffer space remains in 's'. Returns number of bytes written
128 1.1 jdolecek * to the target string 's'.
129 1.1 jdolecek */
130 1.1 jdolecek static int
131 1.1 jdolecek wput_utf8(char *s, size_t n, u_int16_t wc)
132 1.1 jdolecek {
133 1.1 jdolecek if (wc & 0xf800) {
134 1.1 jdolecek if (n < 3) {
135 1.1 jdolecek /* bound check failure */
136 1.1 jdolecek return 0;
137 1.1 jdolecek }
138 1.1 jdolecek
139 1.5 drochner s[0] = 0xE0 | (wc >> 12);
140 1.1 jdolecek s[1] = 0x80 | ((wc >> 6) & 0x3F);
141 1.1 jdolecek s[2] = 0x80 | ((wc) & 0x3F);
142 1.1 jdolecek return 3;
143 1.1 jdolecek } else if (wc & 0x0780) {
144 1.1 jdolecek if (n < 2) {
145 1.1 jdolecek /* bound check failure */
146 1.1 jdolecek return 0;
147 1.1 jdolecek }
148 1.1 jdolecek
149 1.5 drochner s[0] = 0xC0 | (wc >> 6);
150 1.1 jdolecek s[1] = 0x80 | ((wc) & 0x3F);
151 1.1 jdolecek return 2;
152 1.1 jdolecek } else {
153 1.1 jdolecek if (n < 1) {
154 1.1 jdolecek /* bound check failure */
155 1.1 jdolecek return 0;
156 1.1 jdolecek }
157 1.1 jdolecek
158 1.1 jdolecek s[0] = wc;
159 1.1 jdolecek return 1;
160 1.1 jdolecek }
161 1.1 jdolecek }
162