2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright 2014 Garrett D'Amore <garrett@damore.org>
5 * Copyright 2010 Nexenta Systems, Inc. All rights reserved.
7 * The Regents of the University of California. All rights reserved.
9 * This code is derived from software contributed to Berkeley by
10 * Paul Borman at Krystal Technologies.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid[] = "@(#)rune.c 8.1 (Berkeley) 6/4/93";
39 #endif /* LIBC_SCCS and not lint */
40 #include "namespace.h"
41 #include <arpa/inet.h>
47 #include <sys/types.h>
52 #include "un-namespace.h"
57 _Read_RuneMagi(const char *fname)
68 _FileRuneEntry *runetype_ext_ranges;
69 _FileRuneEntry *maplower_ext_ranges;
70 _FileRuneEntry *mapupper_ext_ranges;
71 int runetype_ext_len = 0;
74 if ((fd = _open(fname, O_RDONLY | O_CLOEXEC)) < 0) {
79 if (_fstat(fd, &sb) < 0) {
85 if ((size_t)sb.st_size < sizeof (_FileRuneLocale)) {
92 fdata = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
94 if (fdata == MAP_FAILED) {
99 frl = (_FileRuneLocale *)(void *)fdata;
100 lastp = fdata + sb.st_size;
104 if (memcmp(frl->magic, _FILE_RUNE_MAGIC_1, sizeof (frl->magic))) {
108 runetype_ext_ranges = (_FileRuneEntry *)variable;
109 variable = runetype_ext_ranges + frl->runetype_ext_nranges;
110 if (variable > lastp) {
114 maplower_ext_ranges = (_FileRuneEntry *)variable;
115 variable = maplower_ext_ranges + frl->maplower_ext_nranges;
116 if (variable > lastp) {
120 mapupper_ext_ranges = (_FileRuneEntry *)variable;
121 variable = mapupper_ext_ranges + frl->mapupper_ext_nranges;
122 if (variable > lastp) {
126 frr = runetype_ext_ranges;
127 for (x = 0; x < frl->runetype_ext_nranges; ++x) {
130 if (frr[x].map == 0) {
131 int len = frr[x].max - frr[x].min + 1;
133 variable = types + len;
134 runetype_ext_len += len;
135 if (variable > lastp) {
141 if ((char *)variable + frl->variable_len > (char *)lastp) {
146 * Convert from disk format to host format.
148 data = malloc(sizeof(_RuneLocale) +
149 (frl->runetype_ext_nranges + frl->maplower_ext_nranges +
150 frl->mapupper_ext_nranges) * sizeof(_RuneEntry) +
151 runetype_ext_len * sizeof(*rr->__types) + frl->variable_len);
154 munmap(fdata, sb.st_size);
159 rl = (_RuneLocale *)data;
160 rl->__variable = rl + 1;
162 memcpy(rl->__magic, _RUNE_MAGIC_1, sizeof(rl->__magic));
163 memcpy(rl->__encoding, frl->encoding, sizeof(rl->__encoding));
165 rl->__variable_len = frl->variable_len;
166 rl->__runetype_ext.__nranges = frl->runetype_ext_nranges;
167 rl->__maplower_ext.__nranges = frl->maplower_ext_nranges;
168 rl->__mapupper_ext.__nranges = frl->mapupper_ext_nranges;
170 for (x = 0; x < _CACHED_RUNES; ++x) {
171 rl->__runetype[x] = frl->runetype[x];
172 rl->__maplower[x] = frl->maplower[x];
173 rl->__mapupper[x] = frl->mapupper[x];
176 rl->__runetype_ext.__ranges = (_RuneEntry *)rl->__variable;
177 rl->__variable = rl->__runetype_ext.__ranges +
178 rl->__runetype_ext.__nranges;
180 rl->__maplower_ext.__ranges = (_RuneEntry *)rl->__variable;
181 rl->__variable = rl->__maplower_ext.__ranges +
182 rl->__maplower_ext.__nranges;
184 rl->__mapupper_ext.__ranges = (_RuneEntry *)rl->__variable;
185 rl->__variable = rl->__mapupper_ext.__ranges +
186 rl->__mapupper_ext.__nranges;
188 variable = mapupper_ext_ranges + frl->mapupper_ext_nranges;
189 frr = runetype_ext_ranges;
190 rr = rl->__runetype_ext.__ranges;
191 for (x = 0; x < rl->__runetype_ext.__nranges; ++x) {
194 rr[x].__min = frr[x].min;
195 rr[x].__max = frr[x].max;
196 rr[x].__map = frr[x].map;
197 if (rr[x].__map == 0) {
198 int len = rr[x].__max - rr[x].__min + 1;
200 variable = types + len;
201 rr[x].__types = rl->__variable;
202 rl->__variable = rr[x].__types + len;
204 rr[x].__types[len] = types[len];
206 rr[x].__types = NULL;
209 frr = maplower_ext_ranges;
210 rr = rl->__maplower_ext.__ranges;
211 for (x = 0; x < rl->__maplower_ext.__nranges; ++x) {
212 rr[x].__min = frr[x].min;
213 rr[x].__max = frr[x].max;
214 rr[x].__map = frr[x].map;
217 frr = mapupper_ext_ranges;
218 rr = rl->__mapupper_ext.__ranges;
219 for (x = 0; x < rl->__mapupper_ext.__nranges; ++x) {
220 rr[x].__min = frr[x].min;
221 rr[x].__max = frr[x].max;
222 rr[x].__map = frr[x].map;
225 memcpy(rl->__variable, variable, rl->__variable_len);
226 munmap(fdata, sb.st_size);
229 * Go out and zero pointers that should be zero.
231 if (!rl->__variable_len)
232 rl->__variable = NULL;
234 if (!rl->__runetype_ext.__nranges)
235 rl->__runetype_ext.__ranges = NULL;
237 if (!rl->__maplower_ext.__nranges)
238 rl->__maplower_ext.__ranges = NULL;
240 if (!rl->__mapupper_ext.__nranges)
241 rl->__mapupper_ext.__ranges = NULL;
246 munmap(fdata, sb.st_size);