lib/libc/locale/rune.c

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