1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright 2014 Garrett D'Amore <garrett@damore.org> 5 * Copyright 2010 Nexenta Systems, Inc. All rights reserved. 6 * Copyright (c) 1993 7 * The Regents of the University of California. All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * Paul Borman at Krystal Technologies. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 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. 23 * 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 34 * SUCH DAMAGE. 35 */ 36 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 <sys/cdefs.h> 41 __FBSDID("$FreeBSD$"); 42 43 #include "namespace.h" 44 #include <arpa/inet.h> 45 #include <errno.h> 46 #include <runetype.h> 47 #include <stdio.h> 48 #include <string.h> 49 #include <stdlib.h> 50 #include <sys/types.h> 51 #include <sys/stat.h> 52 #include <sys/mman.h> 53 #include <fcntl.h> 54 #include <unistd.h> 55 #include "un-namespace.h" 56 57 #include "runefile.h" 58 59 _RuneLocale * 60 _Read_RuneMagi(const char *fname) 61 { 62 char *fdata, *data; 63 void *lastp; 64 _FileRuneLocale *frl; 65 _RuneLocale *rl; 66 _FileRuneEntry *frr; 67 _RuneEntry *rr; 68 struct stat sb; 69 int x, saverr; 70 void *variable; 71 _FileRuneEntry *runetype_ext_ranges; 72 _FileRuneEntry *maplower_ext_ranges; 73 _FileRuneEntry *mapupper_ext_ranges; 74 int runetype_ext_len = 0; 75 int fd; 76 77 if ((fd = _open(fname, O_RDONLY)) < 0) { 78 errno = EINVAL; 79 return (NULL); 80 } 81 82 if (_fstat(fd, &sb) < 0) { 83 (void) _close(fd); 84 errno = EINVAL; 85 return (NULL); 86 } 87 88 if ((size_t)sb.st_size < sizeof (_FileRuneLocale)) { 89 (void) _close(fd); 90 errno = EINVAL; 91 return (NULL); 92 } 93 94 95 fdata = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0); 96 (void) _close(fd); 97 if (fdata == MAP_FAILED) { 98 errno = EINVAL; 99 return (NULL); 100 } 101 102 frl = (_FileRuneLocale *)(void *)fdata; 103 lastp = fdata + sb.st_size; 104 105 variable = frl + 1; 106 107 if (memcmp(frl->magic, _FILE_RUNE_MAGIC_1, sizeof (frl->magic))) { 108 goto invalid; 109 } 110 111 runetype_ext_ranges = (_FileRuneEntry *)variable; 112 variable = runetype_ext_ranges + frl->runetype_ext_nranges; 113 if (variable > lastp) { 114 goto invalid; 115 } 116 117 maplower_ext_ranges = (_FileRuneEntry *)variable; 118 variable = maplower_ext_ranges + frl->maplower_ext_nranges; 119 if (variable > lastp) { 120 goto invalid; 121 } 122 123 mapupper_ext_ranges = (_FileRuneEntry *)variable; 124 variable = mapupper_ext_ranges + frl->mapupper_ext_nranges; 125 if (variable > lastp) { 126 goto invalid; 127 } 128 129 frr = runetype_ext_ranges; 130 for (x = 0; x < frl->runetype_ext_nranges; ++x) { 131 uint32_t *types; 132 133 if (frr[x].map == 0) { 134 int len = frr[x].max - frr[x].min + 1; 135 types = variable; 136 variable = types + len; 137 runetype_ext_len += len; 138 if (variable > lastp) { 139 goto invalid; 140 } 141 } 142 } 143 144 if ((char *)variable + frl->variable_len > (char *)lastp) { 145 goto invalid; 146 } 147 148 /* 149 * Convert from disk format to host format. 150 */ 151 data = malloc(sizeof(_RuneLocale) + 152 (frl->runetype_ext_nranges + frl->maplower_ext_nranges + 153 frl->mapupper_ext_nranges) * sizeof(_RuneEntry) + 154 runetype_ext_len * sizeof(*rr->__types) + frl->variable_len); 155 if (data == NULL) { 156 saverr = errno; 157 munmap(fdata, sb.st_size); 158 errno = saverr; 159 return (NULL); 160 } 161 162 rl = (_RuneLocale *)data; 163 rl->__variable = rl + 1; 164 165 memcpy(rl->__magic, _RUNE_MAGIC_1, sizeof(rl->__magic)); 166 memcpy(rl->__encoding, frl->encoding, sizeof(rl->__encoding)); 167 168 rl->__variable_len = frl->variable_len; 169 rl->__runetype_ext.__nranges = frl->runetype_ext_nranges; 170 rl->__maplower_ext.__nranges = frl->maplower_ext_nranges; 171 rl->__mapupper_ext.__nranges = frl->mapupper_ext_nranges; 172 173 for (x = 0; x < _CACHED_RUNES; ++x) { 174 rl->__runetype[x] = frl->runetype[x]; 175 rl->__maplower[x] = frl->maplower[x]; 176 rl->__mapupper[x] = frl->mapupper[x]; 177 } 178 179 rl->__runetype_ext.__ranges = (_RuneEntry *)rl->__variable; 180 rl->__variable = rl->__runetype_ext.__ranges + 181 rl->__runetype_ext.__nranges; 182 183 rl->__maplower_ext.__ranges = (_RuneEntry *)rl->__variable; 184 rl->__variable = rl->__maplower_ext.__ranges + 185 rl->__maplower_ext.__nranges; 186 187 rl->__mapupper_ext.__ranges = (_RuneEntry *)rl->__variable; 188 rl->__variable = rl->__mapupper_ext.__ranges + 189 rl->__mapupper_ext.__nranges; 190 191 variable = mapupper_ext_ranges + frl->mapupper_ext_nranges; 192 frr = runetype_ext_ranges; 193 rr = rl->__runetype_ext.__ranges; 194 for (x = 0; x < rl->__runetype_ext.__nranges; ++x) { 195 uint32_t *types; 196 197 rr[x].__min = frr[x].min; 198 rr[x].__max = frr[x].max; 199 rr[x].__map = frr[x].map; 200 if (rr[x].__map == 0) { 201 int len = rr[x].__max - rr[x].__min + 1; 202 types = variable; 203 variable = types + len; 204 rr[x].__types = rl->__variable; 205 rl->__variable = rr[x].__types + len; 206 while (len-- > 0) 207 rr[x].__types[len] = types[len]; 208 } else 209 rr[x].__types = NULL; 210 } 211 212 frr = maplower_ext_ranges; 213 rr = rl->__maplower_ext.__ranges; 214 for (x = 0; x < rl->__maplower_ext.__nranges; ++x) { 215 rr[x].__min = frr[x].min; 216 rr[x].__max = frr[x].max; 217 rr[x].__map = frr[x].map; 218 } 219 220 frr = mapupper_ext_ranges; 221 rr = rl->__mapupper_ext.__ranges; 222 for (x = 0; x < rl->__mapupper_ext.__nranges; ++x) { 223 rr[x].__min = frr[x].min; 224 rr[x].__max = frr[x].max; 225 rr[x].__map = frr[x].map; 226 } 227 228 memcpy(rl->__variable, variable, rl->__variable_len); 229 munmap(fdata, sb.st_size); 230 231 /* 232 * Go out and zero pointers that should be zero. 233 */ 234 if (!rl->__variable_len) 235 rl->__variable = NULL; 236 237 if (!rl->__runetype_ext.__nranges) 238 rl->__runetype_ext.__ranges = NULL; 239 240 if (!rl->__maplower_ext.__nranges) 241 rl->__maplower_ext.__ranges = NULL; 242 243 if (!rl->__mapupper_ext.__nranges) 244 rl->__mapupper_ext.__ranges = NULL; 245 246 return (rl); 247 248 invalid: 249 munmap(fdata, sb.st_size); 250 errno = EINVAL; 251 return (NULL); 252 } 253