xref: /freebsd/lib/libc/locale/rune.c (revision 380a989b3223d455375b4fae70fd0b9bdd43bafb)
1 /*-
2  * Copyright (c) 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * This code is derived from software contributed to Berkeley by
6  * Paul Borman at Krystal Technologies.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. 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 
41 #include <rune.h>
42 #include <stdio.h>
43 #include <string.h>
44 #include <stdlib.h>
45 #include <sys/types.h>
46 #include <sys/stat.h>
47 
48 _RuneLocale *
49 _Read_RuneMagi(fp)
50 	FILE *fp;
51 {
52 	char *data;
53 	void *lastp;
54 	_RuneLocale *rl;
55 	_RuneEntry *rr;
56 	struct stat sb;
57 	int x;
58 
59 	if (fstat(fileno(fp), &sb) < 0)
60 		return(0);
61 
62 	if (sb.st_size < sizeof(_RuneLocale))
63 		return(0);
64 
65 	if ((data = malloc(sb.st_size)) == NULL)
66 		return(0);
67 
68 	rewind(fp); /* Someone might have read the magic number once already */
69 
70 	if (fread(data, sb.st_size, 1, fp) != 1) {
71 		free(data);
72 		return(0);
73 	}
74 
75 	rl = (_RuneLocale *)data;
76 	lastp = data + sb.st_size;
77 
78 	rl->variable = rl + 1;
79 
80 	if (memcmp(rl->magic, _RUNE_MAGIC_1, sizeof(rl->magic))) {
81 		free(data);
82 		return(0);
83 	}
84 
85 	rl->invalid_rune = ntohl(rl->invalid_rune);
86 	rl->variable_len = ntohl(rl->variable_len);
87 	rl->runetype_ext.nranges = ntohl(rl->runetype_ext.nranges);
88 	rl->maplower_ext.nranges = ntohl(rl->maplower_ext.nranges);
89 	rl->mapupper_ext.nranges = ntohl(rl->mapupper_ext.nranges);
90 
91 	for (x = 0; x < _CACHED_RUNES; ++x) {
92 		rl->runetype[x] = ntohl(rl->runetype[x]);
93 		rl->maplower[x] = ntohl(rl->maplower[x]);
94 		rl->mapupper[x] = ntohl(rl->mapupper[x]);
95 	}
96 
97 	rl->runetype_ext.ranges = (_RuneEntry *)rl->variable;
98 	rl->variable = rl->runetype_ext.ranges + rl->runetype_ext.nranges;
99 	if (rl->variable > lastp) {
100 		free(data);
101 		return(0);
102 	}
103 
104 	rl->maplower_ext.ranges = (_RuneEntry *)rl->variable;
105 	rl->variable = rl->maplower_ext.ranges + rl->maplower_ext.nranges;
106 	if (rl->variable > lastp) {
107 		free(data);
108 		return(0);
109 	}
110 
111 	rl->mapupper_ext.ranges = (_RuneEntry *)rl->variable;
112 	rl->variable = rl->mapupper_ext.ranges + rl->mapupper_ext.nranges;
113 	if (rl->variable > lastp) {
114 		free(data);
115 		return(0);
116 	}
117 
118 	for (x = 0; x < rl->runetype_ext.nranges; ++x) {
119 		rr = rl->runetype_ext.ranges;
120 
121 		rr[x].min = ntohl(rr[x].min);
122 		rr[x].max = ntohl(rr[x].max);
123 		if ((rr[x].map = ntohl(rr[x].map)) == 0) {
124 			int len = rr[x].max - rr[x].min + 1;
125 			rr[x].types = rl->variable;
126 			rl->variable = rr[x].types + len;
127 			if (rl->variable > lastp) {
128 				free(data);
129 				return(0);
130 			}
131 			while (len-- > 0)
132 				rr[x].types[len] = ntohl(rr[x].types[len]);
133 		} else
134 			rr[x].types = 0;
135 	}
136 
137 	for (x = 0; x < rl->maplower_ext.nranges; ++x) {
138 		rr = rl->maplower_ext.ranges;
139 
140 		rr[x].min = ntohl(rr[x].min);
141 		rr[x].max = ntohl(rr[x].max);
142 		rr[x].map = ntohl(rr[x].map);
143 	}
144 
145 	for (x = 0; x < rl->mapupper_ext.nranges; ++x) {
146 		rr = rl->mapupper_ext.ranges;
147 
148 		rr[x].min = ntohl(rr[x].min);
149 		rr[x].max = ntohl(rr[x].max);
150 		rr[x].map = ntohl(rr[x].map);
151 	}
152 	if (((char *)rl->variable) + rl->variable_len > (char *)lastp) {
153 		free(data);
154 		return(0);
155 	}
156 
157 	/*
158 	 * Go out and zero pointers that should be zero.
159 	 */
160 	if (!rl->variable_len)
161 		rl->variable = 0;
162 
163 	if (!rl->runetype_ext.nranges)
164 		rl->runetype_ext.ranges = 0;
165 
166 	if (!rl->maplower_ext.nranges)
167 		rl->maplower_ext.ranges = 0;
168 
169 	if (!rl->mapupper_ext.nranges)
170 		rl->mapupper_ext.ranges = 0;
171 
172 	return(rl);
173 }
174