2 * Copyright 2014 Garrett D'Amore <garrett@damore.org>
3 * Copyright 2010 Nexenta Systems, Inc. All rights reserved.
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * Paul Borman at Krystal Technologies.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #if defined(LIBC_SCCS) && !defined(lint)
36 static char sccsid[] = "@(#)rune.c 8.1 (Berkeley) 6/4/93";
37 #endif /* LIBC_SCCS and not lint */
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
41 #include "namespace.h"
42 #include <arpa/inet.h>
48 #include <sys/types.h>
53 #include "un-namespace.h"
58 _Read_RuneMagi(const char *fname)
69 _FileRuneEntry *runetype_ext_ranges;
70 _FileRuneEntry *maplower_ext_ranges;
71 _FileRuneEntry *mapupper_ext_ranges;
72 int runetype_ext_len = 0;
75 if ((fd = _open(fname, O_RDONLY)) < 0) {
80 if (_fstat(fd, &sb) < 0) {
86 if ((size_t)sb.st_size < sizeof (_FileRuneLocale)) {
93 fdata = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
100 frl = (_FileRuneLocale *)(void *)fdata;
101 lastp = fdata + sb.st_size;
105 if (memcmp(frl->magic, _FILE_RUNE_MAGIC_1, sizeof (frl->magic))) {
109 runetype_ext_ranges = (_FileRuneEntry *)variable;
110 variable = runetype_ext_ranges + frl->runetype_ext_nranges;
111 if (variable > lastp) {
115 maplower_ext_ranges = (_FileRuneEntry *)variable;
116 variable = maplower_ext_ranges + frl->maplower_ext_nranges;
117 if (variable > lastp) {
121 mapupper_ext_ranges = (_FileRuneEntry *)variable;
122 variable = mapupper_ext_ranges + frl->mapupper_ext_nranges;
123 if (variable > lastp) {
127 frr = runetype_ext_ranges;
128 for (x = 0; x < frl->runetype_ext_nranges; ++x) {
131 if (frr[x].map == 0) {
132 int len = frr[x].max - frr[x].min + 1;
134 variable = types + len;
135 runetype_ext_len += len;
136 if (variable > lastp) {
142 if ((char *)variable + frl->variable_len > (char *)lastp) {
147 * Convert from disk format to host format.
149 data = malloc(sizeof(_RuneLocale) +
150 (frl->runetype_ext_nranges + frl->maplower_ext_nranges +
151 frl->mapupper_ext_nranges) * sizeof(_RuneEntry) +
152 runetype_ext_len * sizeof(*rr->__types) +
156 munmap(fdata, sb.st_size);
161 rl = (_RuneLocale *)data;
162 rl->__variable = rl + 1;
164 memcpy(rl->__magic, _RUNE_MAGIC_1, sizeof(rl->__magic));
165 memcpy(rl->__encoding, frl->encoding, sizeof(rl->__encoding));
167 rl->__variable_len = frl->variable_len;
168 rl->__runetype_ext.__nranges = frl->runetype_ext_nranges;
169 rl->__maplower_ext.__nranges = frl->maplower_ext_nranges;
170 rl->__mapupper_ext.__nranges = frl->mapupper_ext_nranges;
172 for (x = 0; x < _CACHED_RUNES; ++x) {
173 rl->__runetype[x] = frl->runetype[x];
174 rl->__maplower[x] = frl->maplower[x];
175 rl->__mapupper[x] = frl->mapupper[x];
178 rl->__runetype_ext.__ranges = (_RuneEntry *)rl->__variable;
179 rl->__variable = rl->__runetype_ext.__ranges +
180 rl->__runetype_ext.__nranges;
182 rl->__maplower_ext.__ranges = (_RuneEntry *)rl->__variable;
183 rl->__variable = rl->__maplower_ext.__ranges +
184 rl->__maplower_ext.__nranges;
186 rl->__mapupper_ext.__ranges = (_RuneEntry *)rl->__variable;
187 rl->__variable = rl->__mapupper_ext.__ranges +
188 rl->__mapupper_ext.__nranges;
190 variable = mapupper_ext_ranges + frl->mapupper_ext_nranges;
191 frr = runetype_ext_ranges;
192 rr = rl->__runetype_ext.__ranges;
193 for (x = 0; x < rl->__runetype_ext.__nranges; ++x) {
196 rr[x].__min = frr[x].min;
197 rr[x].__max = frr[x].max;
198 rr[x].__map = frr[x].map;
199 if (rr[x].__map == 0) {
200 int len = rr[x].__max - rr[x].__min + 1;
202 variable = types + len;
203 rr[x].__types = rl->__variable;
204 rl->__variable = rr[x].__types + len;
206 rr[x].__types[len] = types[len];
208 rr[x].__types = NULL;
211 frr = maplower_ext_ranges;
212 rr = rl->__maplower_ext.__ranges;
213 for (x = 0; x < rl->__maplower_ext.__nranges; ++x) {
214 rr[x].__min = frr[x].min;
215 rr[x].__max = frr[x].max;
216 rr[x].__map = frr[x].map;
219 frr = mapupper_ext_ranges;
220 rr = rl->__mapupper_ext.__ranges;
221 for (x = 0; x < rl->__mapupper_ext.__nranges; ++x) {
222 rr[x].__min = frr[x].min;
223 rr[x].__max = frr[x].max;
224 rr[x].__map = frr[x].map;
227 memcpy(rl->__variable, variable, rl->__variable_len);
228 munmap(fdata, sb.st_size);
231 * Go out and zero pointers that should be zero.
233 if (!rl->__variable_len)
234 rl->__variable = NULL;
236 if (!rl->__runetype_ext.__nranges)
237 rl->__runetype_ext.__ranges = NULL;
239 if (!rl->__maplower_ext.__nranges)
240 rl->__maplower_ext.__ranges = NULL;
242 if (!rl->__mapupper_ext.__nranges)
243 rl->__mapupper_ext.__ranges = NULL;
248 munmap(fdata, sb.st_size);