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