1 /*
   2  * Copyright 2010 Nexenta Systems, Inc.  All rights reserved.
   3  * Copyright (c) 1993
   4  *      The Regents of the University of California.  All rights reserved.
   5  *
   6  * This code is derived from software contributed to Berkeley by
   7  * Paul Borman at Krystal Technologies.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted provided that the following conditions
  11  * are met:
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  * 2. Redistributions in binary form must reproduce the above copyright
  15  *    notice, this list of conditions and the following disclaimer in the
  16  *    documentation and/or other materials provided with the distribution.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33 
  34 #include "lint.h"
  35 #include "file64.h"
  36 #include <errno.h>
  37 #include <stdio.h>
  38 #include <string.h>
  39 #include <stdlib.h>
  40 #include <sys/types.h>
  41 #include <sys/stat.h>
  42 
  43 #include "runetype.h"
  44 #include "runefile.h"
  45 
  46 _RuneLocale *_Read_RuneMagi(FILE *);
  47 
  48 _RuneLocale *
  49 _Read_RuneMagi(FILE *fp)
  50 {
  51         char *fdata, *data;
  52         void *lastp;
  53         _FileRuneLocale *frl;
  54         _RuneLocale *rl;
  55         _FileRuneEntry *frr;
  56         _RuneEntry *rr;
  57         struct stat sb;
  58         int x, saverr;
  59         void *variable;
  60         _FileRuneEntry *runetype_ext_ranges;
  61         _FileRuneEntry *maplower_ext_ranges;
  62         _FileRuneEntry *mapupper_ext_ranges;
  63         int runetype_ext_len = 0;
  64 
  65         if (fstat(fileno(fp), &sb) < 0)
  66                 return (NULL);
  67 
  68         if ((size_t)sb.st_size < sizeof (_FileRuneLocale)) {
  69                 errno = EINVAL;
  70                 return (NULL);
  71         }
  72 
  73         if ((fdata = malloc(sb.st_size)) == NULL)
  74                 return (NULL);
  75 
  76         errno = 0;
  77         rewind(fp); /* Someone might have read the magic number once already */
  78         if (errno) {
  79                 saverr = errno;
  80                 free(fdata);
  81                 errno = saverr;
  82                 return (NULL);
  83         }
  84 
  85         if (fread(fdata, sb.st_size, 1, fp) != 1) {
  86                 saverr = errno;
  87                 free(fdata);
  88                 errno = saverr;
  89                 return (NULL);
  90         }
  91 
  92         frl = (_FileRuneLocale *)(void *)fdata;
  93         lastp = fdata + sb.st_size;
  94 
  95         variable = frl + 1;
  96 
  97         if (memcmp(frl->magic, _FILE_RUNE_MAGIC_1, sizeof (frl->magic))) {
  98                 free(fdata);
  99                 errno = EINVAL;
 100                 return (NULL);
 101         }
 102 
 103         runetype_ext_ranges = (_FileRuneEntry *)variable;
 104         variable = runetype_ext_ranges + frl->runetype_ext_nranges;
 105         if (variable > lastp) {
 106                 free(fdata);
 107                 errno = EINVAL;
 108                 return (NULL);
 109         }
 110 
 111         maplower_ext_ranges = (_FileRuneEntry *)variable;
 112         variable = maplower_ext_ranges + frl->maplower_ext_nranges;
 113         if (variable > lastp) {
 114                 free(fdata);
 115                 errno = EINVAL;
 116                 return (NULL);
 117         }
 118 
 119         mapupper_ext_ranges = (_FileRuneEntry *)variable;
 120         variable = mapupper_ext_ranges + frl->mapupper_ext_nranges;
 121         if (variable > lastp) {
 122                 free(fdata);
 123                 errno = EINVAL;
 124                 return (NULL);
 125         }
 126 
 127         frr = runetype_ext_ranges;
 128         for (x = 0; x < frl->runetype_ext_nranges; ++x) {
 129                 uint32_t *types;
 130 
 131                 if (frr[x].map == 0) {
 132                         int len = frr[x].max - frr[x].min + 1;
 133                         types = variable;
 134                         variable = types + len;
 135                         runetype_ext_len += len;
 136                         if (variable > lastp) {
 137                                 free(fdata);
 138                                 errno = EINVAL;
 139                                 return (NULL);
 140                         }
 141                 }
 142         }
 143 
 144         if ((char *)variable + frl->variable_len > (char *)lastp) {
 145                 free(fdata);
 146                 errno = EINVAL;
 147                 return (NULL);
 148         }
 149 
 150         /*
 151          * Convert from disk format to host format.
 152          */
 153         data = malloc(sizeof (_RuneLocale) +
 154             (frl->runetype_ext_nranges + frl->maplower_ext_nranges +
 155             frl->mapupper_ext_nranges) * sizeof (_RuneEntry) +
 156             runetype_ext_len * sizeof (*rr->__types) +
 157             frl->variable_len);
 158         if (data == NULL) {
 159                 saverr = errno;
 160                 free(fdata);
 161                 errno = saverr;
 162                 return (NULL);
 163         }
 164 
 165         rl = (_RuneLocale *)(void *)data;
 166         rl->__variable = rl + 1;
 167 
 168         (void) memcpy(rl->__magic, _RUNE_MAGIC_1, sizeof (rl->__magic));
 169         (void) memcpy(rl->__encoding, frl->encoding, sizeof (rl->__encoding));
 170 
 171         rl->__variable_len = frl->variable_len;
 172         rl->__runetype_ext.__nranges = frl->runetype_ext_nranges;
 173         rl->__maplower_ext.__nranges = frl->maplower_ext_nranges;
 174         rl->__mapupper_ext.__nranges = frl->mapupper_ext_nranges;
 175 
 176         for (x = 0; x < _CACHED_RUNES; ++x) {
 177                 rl->__runetype[x] = frl->runetype[x];
 178                 rl->__maplower[x] = frl->maplower[x];
 179                 rl->__mapupper[x] = frl->mapupper[x];
 180         }
 181 
 182         rl->__runetype_ext.__ranges = (_RuneEntry *)rl->__variable;
 183         rl->__variable = rl->__runetype_ext.__ranges +
 184             rl->__runetype_ext.__nranges;
 185 
 186         rl->__maplower_ext.__ranges = (_RuneEntry *)rl->__variable;
 187         rl->__variable = rl->__maplower_ext.__ranges +
 188             rl->__maplower_ext.__nranges;
 189 
 190         rl->__mapupper_ext.__ranges = (_RuneEntry *)rl->__variable;
 191         rl->__variable = rl->__mapupper_ext.__ranges +
 192             rl->__mapupper_ext.__nranges;
 193 
 194         variable = mapupper_ext_ranges + frl->mapupper_ext_nranges;
 195         frr = runetype_ext_ranges;
 196         rr = rl->__runetype_ext.__ranges;
 197         for (x = 0; x < rl->__runetype_ext.__nranges; ++x) {
 198                 uint32_t *types;
 199 
 200                 rr[x].__min = frr[x].min;
 201                 rr[x].__max = frr[x].max;
 202                 rr[x].__map = frr[x].map;
 203                 if (rr[x].__map == 0) {
 204                         int len = rr[x].__max - rr[x].__min + 1;
 205                         types = variable;
 206                         variable = types + len;
 207                         rr[x].__types = rl->__variable;
 208                         rl->__variable = rr[x].__types + len;
 209                         while (len-- > 0)
 210                                 rr[x].__types[len] = types[len];
 211                 } else
 212                         rr[x].__types = NULL;
 213         }
 214 
 215         frr = maplower_ext_ranges;
 216         rr = rl->__maplower_ext.__ranges;
 217         for (x = 0; x < rl->__maplower_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         frr = mapupper_ext_ranges;
 224         rr = rl->__mapupper_ext.__ranges;
 225         for (x = 0; x < rl->__mapupper_ext.__nranges; ++x) {
 226                 rr[x].__min = frr[x].min;
 227                 rr[x].__max = frr[x].max;
 228                 rr[x].__map = frr[x].map;
 229         }
 230 
 231         (void) memcpy(rl->__variable, variable, rl->__variable_len);
 232         free(fdata);
 233 
 234         /*
 235          * Go out and zero pointers that should be zero.
 236          */
 237         if (!rl->__variable_len)
 238                 rl->__variable = NULL;
 239 
 240         if (!rl->__runetype_ext.__nranges)
 241                 rl->__runetype_ext.__ranges = NULL;
 242 
 243         if (!rl->__maplower_ext.__nranges)
 244                 rl->__maplower_ext.__ranges = NULL;
 245 
 246         if (!rl->__mapupper_ext.__nranges)
 247                 rl->__mapupper_ext.__ranges = NULL;
 248 
 249         return (rl);
 250 }