]>
Commit | Line | Data |
---|---|---|
c84142e8 | 1 | /* Load needed message catalogs. |
d4697bc9 | 2 | Copyright (C) 1995-2014 Free Software Foundation, Inc. |
41bdb6e2 | 3 | This file is part of the GNU C Library. |
5f2eab42 | 4 | |
c84142e8 | 5 | The GNU C Library is free software; you can redistribute it and/or |
41bdb6e2 AJ |
6 | modify it under the terms of the GNU Lesser General Public |
7 | License as published by the Free Software Foundation; either | |
8 | version 2.1 of the License, or (at your option) any later version. | |
0393dfd6 | 9 | |
c84142e8 UD |
10 | The GNU C Library is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
41bdb6e2 | 13 | Lesser General Public License for more details. |
24906b43 | 14 | |
41bdb6e2 | 15 | You should have received a copy of the GNU Lesser General Public |
59ba27a6 PE |
16 | License along with the GNU C Library; if not, see |
17 | <http://www.gnu.org/licenses/>. */ | |
24906b43 | 18 | |
17c389fc UD |
19 | /* Tell glibc's <string.h> to provide a prototype for mempcpy(). |
20 | This must come before <config.h> because <config.h> may include | |
21 | <features.h>, and once <features.h> has been included, it's too late. */ | |
22 | #ifndef _GNU_SOURCE | |
23 | # define _GNU_SOURCE 1 | |
24 | #endif | |
25 | ||
24906b43 RM |
26 | #ifdef HAVE_CONFIG_H |
27 | # include <config.h> | |
28 | #endif | |
29 | ||
bea9b193 | 30 | #include <assert.h> |
abbffdf9 | 31 | #include <ctype.h> |
17c389fc | 32 | #include <errno.h> |
24906b43 RM |
33 | #include <fcntl.h> |
34 | #include <sys/types.h> | |
35 | #include <sys/stat.h> | |
36 | ||
4a4d50f3 | 37 | #ifdef __GNUC__ |
c2afe833 | 38 | # undef alloca |
4a4d50f3 UD |
39 | # define alloca __builtin_alloca |
40 | # define HAVE_ALLOCA 1 | |
41 | #else | |
42 | # if defined HAVE_ALLOCA_H || defined _LIBC | |
43 | # include <alloca.h> | |
44 | # else | |
45 | # ifdef _AIX | |
46 | #pragma alloca | |
47 | # else | |
48 | # ifndef alloca | |
49 | char *alloca (); | |
50 | # endif | |
51 | # endif | |
52 | # endif | |
53 | #endif | |
54 | ||
0555fcce UD |
55 | #include <stdlib.h> |
56 | #include <string.h> | |
6570e194 | 57 | |
24906b43 RM |
58 | #if defined HAVE_UNISTD_H || defined _LIBC |
59 | # include <unistd.h> | |
60 | #endif | |
61 | ||
6570e194 UD |
62 | #ifdef _LIBC |
63 | # include <langinfo.h> | |
58593d2e | 64 | # include <locale.h> |
6570e194 UD |
65 | #endif |
66 | ||
7cabd57c UD |
67 | #if (defined HAVE_MMAP && defined HAVE_MUNMAP && !defined DISALLOW_MMAP) \ |
68 | || (defined _LIBC && defined _POSIX_MAPPED_FILES) | |
24906b43 | 69 | # include <sys/mman.h> |
7cabd57c UD |
70 | # undef HAVE_MMAP |
71 | # define HAVE_MMAP 1 | |
72 | #else | |
73 | # undef HAVE_MMAP | |
24906b43 RM |
74 | #endif |
75 | ||
3172f58f UD |
76 | #if defined HAVE_STDINT_H_WITH_UINTMAX || defined _LIBC |
77 | # include <stdint.h> | |
78 | #endif | |
79 | #if defined HAVE_INTTYPES_H || defined _LIBC | |
80 | # include <inttypes.h> | |
81 | #endif | |
82 | ||
0f131646 | 83 | #include "gmo.h" |
24906b43 | 84 | #include "gettextP.h" |
3172f58f | 85 | #include "hash-string.h" |
0555fcce | 86 | #include "plural-exp.h" |
24906b43 | 87 | |
6570e194 UD |
88 | #ifdef _LIBC |
89 | # include "../locale/localeinfo.h" | |
6df4dd68 | 90 | # include <not-cancel.h> |
ac5e137c | 91 | # include <bits/libc-lock.h> |
6570e194 UD |
92 | #endif |
93 | ||
3172f58f UD |
94 | /* Provide fallback values for macros that ought to be defined in <inttypes.h>. |
95 | Note that our fallback values need not be literal strings, because we don't | |
96 | use them with preprocessor string concatenation. */ | |
97 | #if !defined PRId8 || PRI_MACROS_BROKEN | |
98 | # undef PRId8 | |
99 | # define PRId8 "d" | |
100 | #endif | |
101 | #if !defined PRIi8 || PRI_MACROS_BROKEN | |
102 | # undef PRIi8 | |
103 | # define PRIi8 "i" | |
104 | #endif | |
105 | #if !defined PRIo8 || PRI_MACROS_BROKEN | |
106 | # undef PRIo8 | |
107 | # define PRIo8 "o" | |
108 | #endif | |
109 | #if !defined PRIu8 || PRI_MACROS_BROKEN | |
110 | # undef PRIu8 | |
111 | # define PRIu8 "u" | |
112 | #endif | |
113 | #if !defined PRIx8 || PRI_MACROS_BROKEN | |
114 | # undef PRIx8 | |
115 | # define PRIx8 "x" | |
116 | #endif | |
117 | #if !defined PRIX8 || PRI_MACROS_BROKEN | |
118 | # undef PRIX8 | |
119 | # define PRIX8 "X" | |
120 | #endif | |
121 | #if !defined PRId16 || PRI_MACROS_BROKEN | |
122 | # undef PRId16 | |
123 | # define PRId16 "d" | |
124 | #endif | |
125 | #if !defined PRIi16 || PRI_MACROS_BROKEN | |
126 | # undef PRIi16 | |
127 | # define PRIi16 "i" | |
128 | #endif | |
129 | #if !defined PRIo16 || PRI_MACROS_BROKEN | |
130 | # undef PRIo16 | |
131 | # define PRIo16 "o" | |
132 | #endif | |
133 | #if !defined PRIu16 || PRI_MACROS_BROKEN | |
134 | # undef PRIu16 | |
135 | # define PRIu16 "u" | |
136 | #endif | |
137 | #if !defined PRIx16 || PRI_MACROS_BROKEN | |
138 | # undef PRIx16 | |
139 | # define PRIx16 "x" | |
140 | #endif | |
141 | #if !defined PRIX16 || PRI_MACROS_BROKEN | |
142 | # undef PRIX16 | |
143 | # define PRIX16 "X" | |
144 | #endif | |
145 | #if !defined PRId32 || PRI_MACROS_BROKEN | |
146 | # undef PRId32 | |
147 | # define PRId32 "d" | |
148 | #endif | |
149 | #if !defined PRIi32 || PRI_MACROS_BROKEN | |
150 | # undef PRIi32 | |
151 | # define PRIi32 "i" | |
152 | #endif | |
153 | #if !defined PRIo32 || PRI_MACROS_BROKEN | |
154 | # undef PRIo32 | |
155 | # define PRIo32 "o" | |
156 | #endif | |
157 | #if !defined PRIu32 || PRI_MACROS_BROKEN | |
158 | # undef PRIu32 | |
159 | # define PRIu32 "u" | |
160 | #endif | |
161 | #if !defined PRIx32 || PRI_MACROS_BROKEN | |
162 | # undef PRIx32 | |
163 | # define PRIx32 "x" | |
164 | #endif | |
165 | #if !defined PRIX32 || PRI_MACROS_BROKEN | |
166 | # undef PRIX32 | |
167 | # define PRIX32 "X" | |
168 | #endif | |
169 | #if !defined PRId64 || PRI_MACROS_BROKEN | |
170 | # undef PRId64 | |
171 | # define PRId64 (sizeof (long) == 8 ? "ld" : "lld") | |
172 | #endif | |
173 | #if !defined PRIi64 || PRI_MACROS_BROKEN | |
174 | # undef PRIi64 | |
175 | # define PRIi64 (sizeof (long) == 8 ? "li" : "lli") | |
176 | #endif | |
177 | #if !defined PRIo64 || PRI_MACROS_BROKEN | |
178 | # undef PRIo64 | |
179 | # define PRIo64 (sizeof (long) == 8 ? "lo" : "llo") | |
180 | #endif | |
181 | #if !defined PRIu64 || PRI_MACROS_BROKEN | |
182 | # undef PRIu64 | |
183 | # define PRIu64 (sizeof (long) == 8 ? "lu" : "llu") | |
184 | #endif | |
185 | #if !defined PRIx64 || PRI_MACROS_BROKEN | |
186 | # undef PRIx64 | |
187 | # define PRIx64 (sizeof (long) == 8 ? "lx" : "llx") | |
188 | #endif | |
189 | #if !defined PRIX64 || PRI_MACROS_BROKEN | |
190 | # undef PRIX64 | |
191 | # define PRIX64 (sizeof (long) == 8 ? "lX" : "llX") | |
192 | #endif | |
193 | #if !defined PRIdLEAST8 || PRI_MACROS_BROKEN | |
194 | # undef PRIdLEAST8 | |
195 | # define PRIdLEAST8 "d" | |
196 | #endif | |
197 | #if !defined PRIiLEAST8 || PRI_MACROS_BROKEN | |
198 | # undef PRIiLEAST8 | |
199 | # define PRIiLEAST8 "i" | |
200 | #endif | |
201 | #if !defined PRIoLEAST8 || PRI_MACROS_BROKEN | |
202 | # undef PRIoLEAST8 | |
203 | # define PRIoLEAST8 "o" | |
204 | #endif | |
205 | #if !defined PRIuLEAST8 || PRI_MACROS_BROKEN | |
206 | # undef PRIuLEAST8 | |
207 | # define PRIuLEAST8 "u" | |
208 | #endif | |
209 | #if !defined PRIxLEAST8 || PRI_MACROS_BROKEN | |
210 | # undef PRIxLEAST8 | |
211 | # define PRIxLEAST8 "x" | |
212 | #endif | |
213 | #if !defined PRIXLEAST8 || PRI_MACROS_BROKEN | |
214 | # undef PRIXLEAST8 | |
215 | # define PRIXLEAST8 "X" | |
216 | #endif | |
217 | #if !defined PRIdLEAST16 || PRI_MACROS_BROKEN | |
218 | # undef PRIdLEAST16 | |
219 | # define PRIdLEAST16 "d" | |
220 | #endif | |
221 | #if !defined PRIiLEAST16 || PRI_MACROS_BROKEN | |
222 | # undef PRIiLEAST16 | |
223 | # define PRIiLEAST16 "i" | |
224 | #endif | |
225 | #if !defined PRIoLEAST16 || PRI_MACROS_BROKEN | |
226 | # undef PRIoLEAST16 | |
227 | # define PRIoLEAST16 "o" | |
228 | #endif | |
229 | #if !defined PRIuLEAST16 || PRI_MACROS_BROKEN | |
230 | # undef PRIuLEAST16 | |
231 | # define PRIuLEAST16 "u" | |
232 | #endif | |
233 | #if !defined PRIxLEAST16 || PRI_MACROS_BROKEN | |
234 | # undef PRIxLEAST16 | |
235 | # define PRIxLEAST16 "x" | |
236 | #endif | |
237 | #if !defined PRIXLEAST16 || PRI_MACROS_BROKEN | |
238 | # undef PRIXLEAST16 | |
239 | # define PRIXLEAST16 "X" | |
240 | #endif | |
241 | #if !defined PRIdLEAST32 || PRI_MACROS_BROKEN | |
242 | # undef PRIdLEAST32 | |
243 | # define PRIdLEAST32 "d" | |
244 | #endif | |
245 | #if !defined PRIiLEAST32 || PRI_MACROS_BROKEN | |
246 | # undef PRIiLEAST32 | |
247 | # define PRIiLEAST32 "i" | |
248 | #endif | |
249 | #if !defined PRIoLEAST32 || PRI_MACROS_BROKEN | |
250 | # undef PRIoLEAST32 | |
251 | # define PRIoLEAST32 "o" | |
252 | #endif | |
253 | #if !defined PRIuLEAST32 || PRI_MACROS_BROKEN | |
254 | # undef PRIuLEAST32 | |
255 | # define PRIuLEAST32 "u" | |
256 | #endif | |
257 | #if !defined PRIxLEAST32 || PRI_MACROS_BROKEN | |
258 | # undef PRIxLEAST32 | |
259 | # define PRIxLEAST32 "x" | |
260 | #endif | |
261 | #if !defined PRIXLEAST32 || PRI_MACROS_BROKEN | |
262 | # undef PRIXLEAST32 | |
263 | # define PRIXLEAST32 "X" | |
264 | #endif | |
265 | #if !defined PRIdLEAST64 || PRI_MACROS_BROKEN | |
266 | # undef PRIdLEAST64 | |
267 | # define PRIdLEAST64 PRId64 | |
268 | #endif | |
269 | #if !defined PRIiLEAST64 || PRI_MACROS_BROKEN | |
270 | # undef PRIiLEAST64 | |
271 | # define PRIiLEAST64 PRIi64 | |
272 | #endif | |
273 | #if !defined PRIoLEAST64 || PRI_MACROS_BROKEN | |
274 | # undef PRIoLEAST64 | |
275 | # define PRIoLEAST64 PRIo64 | |
276 | #endif | |
277 | #if !defined PRIuLEAST64 || PRI_MACROS_BROKEN | |
278 | # undef PRIuLEAST64 | |
279 | # define PRIuLEAST64 PRIu64 | |
280 | #endif | |
281 | #if !defined PRIxLEAST64 || PRI_MACROS_BROKEN | |
282 | # undef PRIxLEAST64 | |
283 | # define PRIxLEAST64 PRIx64 | |
284 | #endif | |
285 | #if !defined PRIXLEAST64 || PRI_MACROS_BROKEN | |
286 | # undef PRIXLEAST64 | |
287 | # define PRIXLEAST64 PRIX64 | |
288 | #endif | |
289 | #if !defined PRIdFAST8 || PRI_MACROS_BROKEN | |
290 | # undef PRIdFAST8 | |
291 | # define PRIdFAST8 "d" | |
292 | #endif | |
293 | #if !defined PRIiFAST8 || PRI_MACROS_BROKEN | |
294 | # undef PRIiFAST8 | |
295 | # define PRIiFAST8 "i" | |
296 | #endif | |
297 | #if !defined PRIoFAST8 || PRI_MACROS_BROKEN | |
298 | # undef PRIoFAST8 | |
299 | # define PRIoFAST8 "o" | |
300 | #endif | |
301 | #if !defined PRIuFAST8 || PRI_MACROS_BROKEN | |
302 | # undef PRIuFAST8 | |
303 | # define PRIuFAST8 "u" | |
304 | #endif | |
305 | #if !defined PRIxFAST8 || PRI_MACROS_BROKEN | |
306 | # undef PRIxFAST8 | |
307 | # define PRIxFAST8 "x" | |
308 | #endif | |
309 | #if !defined PRIXFAST8 || PRI_MACROS_BROKEN | |
310 | # undef PRIXFAST8 | |
311 | # define PRIXFAST8 "X" | |
312 | #endif | |
313 | #if !defined PRIdFAST16 || PRI_MACROS_BROKEN | |
314 | # undef PRIdFAST16 | |
315 | # define PRIdFAST16 "d" | |
316 | #endif | |
317 | #if !defined PRIiFAST16 || PRI_MACROS_BROKEN | |
318 | # undef PRIiFAST16 | |
319 | # define PRIiFAST16 "i" | |
320 | #endif | |
321 | #if !defined PRIoFAST16 || PRI_MACROS_BROKEN | |
322 | # undef PRIoFAST16 | |
323 | # define PRIoFAST16 "o" | |
324 | #endif | |
325 | #if !defined PRIuFAST16 || PRI_MACROS_BROKEN | |
326 | # undef PRIuFAST16 | |
327 | # define PRIuFAST16 "u" | |
328 | #endif | |
329 | #if !defined PRIxFAST16 || PRI_MACROS_BROKEN | |
330 | # undef PRIxFAST16 | |
331 | # define PRIxFAST16 "x" | |
332 | #endif | |
333 | #if !defined PRIXFAST16 || PRI_MACROS_BROKEN | |
334 | # undef PRIXFAST16 | |
335 | # define PRIXFAST16 "X" | |
336 | #endif | |
337 | #if !defined PRIdFAST32 || PRI_MACROS_BROKEN | |
338 | # undef PRIdFAST32 | |
339 | # define PRIdFAST32 "d" | |
340 | #endif | |
341 | #if !defined PRIiFAST32 || PRI_MACROS_BROKEN | |
342 | # undef PRIiFAST32 | |
343 | # define PRIiFAST32 "i" | |
344 | #endif | |
345 | #if !defined PRIoFAST32 || PRI_MACROS_BROKEN | |
346 | # undef PRIoFAST32 | |
347 | # define PRIoFAST32 "o" | |
348 | #endif | |
349 | #if !defined PRIuFAST32 || PRI_MACROS_BROKEN | |
350 | # undef PRIuFAST32 | |
351 | # define PRIuFAST32 "u" | |
352 | #endif | |
353 | #if !defined PRIxFAST32 || PRI_MACROS_BROKEN | |
354 | # undef PRIxFAST32 | |
355 | # define PRIxFAST32 "x" | |
356 | #endif | |
357 | #if !defined PRIXFAST32 || PRI_MACROS_BROKEN | |
358 | # undef PRIXFAST32 | |
359 | # define PRIXFAST32 "X" | |
360 | #endif | |
361 | #if !defined PRIdFAST64 || PRI_MACROS_BROKEN | |
362 | # undef PRIdFAST64 | |
363 | # define PRIdFAST64 PRId64 | |
364 | #endif | |
365 | #if !defined PRIiFAST64 || PRI_MACROS_BROKEN | |
366 | # undef PRIiFAST64 | |
367 | # define PRIiFAST64 PRIi64 | |
368 | #endif | |
369 | #if !defined PRIoFAST64 || PRI_MACROS_BROKEN | |
370 | # undef PRIoFAST64 | |
371 | # define PRIoFAST64 PRIo64 | |
372 | #endif | |
373 | #if !defined PRIuFAST64 || PRI_MACROS_BROKEN | |
374 | # undef PRIuFAST64 | |
375 | # define PRIuFAST64 PRIu64 | |
376 | #endif | |
377 | #if !defined PRIxFAST64 || PRI_MACROS_BROKEN | |
378 | # undef PRIxFAST64 | |
379 | # define PRIxFAST64 PRIx64 | |
380 | #endif | |
381 | #if !defined PRIXFAST64 || PRI_MACROS_BROKEN | |
382 | # undef PRIXFAST64 | |
383 | # define PRIXFAST64 PRIX64 | |
384 | #endif | |
385 | #if !defined PRIdMAX || PRI_MACROS_BROKEN | |
386 | # undef PRIdMAX | |
387 | # define PRIdMAX (sizeof (uintmax_t) == sizeof (long) ? "ld" : "lld") | |
388 | #endif | |
389 | #if !defined PRIiMAX || PRI_MACROS_BROKEN | |
390 | # undef PRIiMAX | |
391 | # define PRIiMAX (sizeof (uintmax_t) == sizeof (long) ? "li" : "lli") | |
392 | #endif | |
393 | #if !defined PRIoMAX || PRI_MACROS_BROKEN | |
394 | # undef PRIoMAX | |
395 | # define PRIoMAX (sizeof (uintmax_t) == sizeof (long) ? "lo" : "llo") | |
396 | #endif | |
397 | #if !defined PRIuMAX || PRI_MACROS_BROKEN | |
398 | # undef PRIuMAX | |
399 | # define PRIuMAX (sizeof (uintmax_t) == sizeof (long) ? "lu" : "llu") | |
400 | #endif | |
401 | #if !defined PRIxMAX || PRI_MACROS_BROKEN | |
402 | # undef PRIxMAX | |
403 | # define PRIxMAX (sizeof (uintmax_t) == sizeof (long) ? "lx" : "llx") | |
404 | #endif | |
405 | #if !defined PRIXMAX || PRI_MACROS_BROKEN | |
406 | # undef PRIXMAX | |
407 | # define PRIXMAX (sizeof (uintmax_t) == sizeof (long) ? "lX" : "llX") | |
408 | #endif | |
409 | #if !defined PRIdPTR || PRI_MACROS_BROKEN | |
410 | # undef PRIdPTR | |
411 | # define PRIdPTR \ | |
412 | (sizeof (void *) == sizeof (long) ? "ld" : \ | |
413 | sizeof (void *) == sizeof (int) ? "d" : \ | |
414 | "lld") | |
415 | #endif | |
416 | #if !defined PRIiPTR || PRI_MACROS_BROKEN | |
417 | # undef PRIiPTR | |
418 | # define PRIiPTR \ | |
419 | (sizeof (void *) == sizeof (long) ? "li" : \ | |
420 | sizeof (void *) == sizeof (int) ? "i" : \ | |
421 | "lli") | |
422 | #endif | |
423 | #if !defined PRIoPTR || PRI_MACROS_BROKEN | |
424 | # undef PRIoPTR | |
425 | # define PRIoPTR \ | |
426 | (sizeof (void *) == sizeof (long) ? "lo" : \ | |
427 | sizeof (void *) == sizeof (int) ? "o" : \ | |
428 | "llo") | |
429 | #endif | |
430 | #if !defined PRIuPTR || PRI_MACROS_BROKEN | |
431 | # undef PRIuPTR | |
432 | # define PRIuPTR \ | |
433 | (sizeof (void *) == sizeof (long) ? "lu" : \ | |
434 | sizeof (void *) == sizeof (int) ? "u" : \ | |
435 | "llu") | |
436 | #endif | |
437 | #if !defined PRIxPTR || PRI_MACROS_BROKEN | |
438 | # undef PRIxPTR | |
439 | # define PRIxPTR \ | |
440 | (sizeof (void *) == sizeof (long) ? "lx" : \ | |
441 | sizeof (void *) == sizeof (int) ? "x" : \ | |
442 | "llx") | |
443 | #endif | |
444 | #if !defined PRIXPTR || PRI_MACROS_BROKEN | |
445 | # undef PRIXPTR | |
446 | # define PRIXPTR \ | |
447 | (sizeof (void *) == sizeof (long) ? "lX" : \ | |
448 | sizeof (void *) == sizeof (int) ? "X" : \ | |
449 | "llX") | |
450 | #endif | |
451 | ||
24906b43 RM |
452 | /* @@ end of prolog @@ */ |
453 | ||
454 | #ifdef _LIBC | |
c84142e8 UD |
455 | /* Rename the non ISO C functions. This is required by the standard |
456 | because some ISO C functions will require linking with this object | |
24906b43 | 457 | file and the name space must not be polluted. */ |
9c42bc3b UD |
458 | # define open(name, flags) open_not_cancel_2 (name, flags) |
459 | # define close(fd) close_not_cancel_no_status (fd) | |
460 | # define read(fd, buf, n) read_not_cancel (fd, buf, n) | |
461 | # define mmap(addr, len, prot, flags, fd, offset) \ | |
462 | __mmap (addr, len, prot, flags, fd, offset) | |
463 | # define munmap(addr, len) __munmap (addr, len) | |
24906b43 RM |
464 | #endif |
465 | ||
4a4d50f3 UD |
466 | /* For those losing systems which don't have `alloca' we have to add |
467 | some additional code emulating it. */ | |
468 | #ifdef HAVE_ALLOCA | |
469 | # define freea(p) /* nothing */ | |
470 | #else | |
471 | # define alloca(n) malloc (n) | |
472 | # define freea(p) free (p) | |
473 | #endif | |
474 | ||
3172f58f UD |
475 | |
476 | /* Prototypes for local functions. Needed to ensure compiler checking of | |
477 | function argument counts despite of K&R C function definition syntax. */ | |
478 | static const char *get_sysdep_segment_value PARAMS ((const char *name)); | |
479 | ||
480 | ||
24906b43 RM |
481 | /* We need a sign, whether a new catalog was loaded, which can be associated |
482 | with all translations. This is important if the translations are | |
483 | cached by one of GCC's features. */ | |
390500b1 | 484 | int _nl_msg_cat_cntr; |
24906b43 RM |
485 | |
486 | ||
3172f58f UD |
487 | /* Expand a system dependent string segment. Return NULL if unsupported. */ |
488 | static const char * | |
489 | get_sysdep_segment_value (name) | |
490 | const char *name; | |
491 | { | |
492 | /* Test for an ISO C 99 section 7.8.1 format string directive. | |
493 | Syntax: | |
494 | P R I { d | i | o | u | x | X } | |
495 | { { | LEAST | FAST } { 8 | 16 | 32 | 64 } | MAX | PTR } */ | |
496 | /* We don't use a table of 14 times 6 'const char *' strings here, because | |
497 | data relocations cost startup time. */ | |
498 | if (name[0] == 'P' && name[1] == 'R' && name[2] == 'I') | |
499 | { | |
500 | if (name[3] == 'd' || name[3] == 'i' || name[3] == 'o' || name[3] == 'u' | |
501 | || name[3] == 'x' || name[3] == 'X') | |
502 | { | |
503 | if (name[4] == '8' && name[5] == '\0') | |
504 | { | |
505 | if (name[3] == 'd') | |
506 | return PRId8; | |
507 | if (name[3] == 'i') | |
508 | return PRIi8; | |
509 | if (name[3] == 'o') | |
510 | return PRIo8; | |
511 | if (name[3] == 'u') | |
512 | return PRIu8; | |
513 | if (name[3] == 'x') | |
514 | return PRIx8; | |
515 | if (name[3] == 'X') | |
516 | return PRIX8; | |
517 | abort (); | |
518 | } | |
519 | if (name[4] == '1' && name[5] == '6' && name[6] == '\0') | |
520 | { | |
521 | if (name[3] == 'd') | |
522 | return PRId16; | |
523 | if (name[3] == 'i') | |
524 | return PRIi16; | |
525 | if (name[3] == 'o') | |
526 | return PRIo16; | |
527 | if (name[3] == 'u') | |
528 | return PRIu16; | |
529 | if (name[3] == 'x') | |
530 | return PRIx16; | |
531 | if (name[3] == 'X') | |
532 | return PRIX16; | |
533 | abort (); | |
534 | } | |
535 | if (name[4] == '3' && name[5] == '2' && name[6] == '\0') | |
536 | { | |
537 | if (name[3] == 'd') | |
538 | return PRId32; | |
539 | if (name[3] == 'i') | |
540 | return PRIi32; | |
541 | if (name[3] == 'o') | |
542 | return PRIo32; | |
543 | if (name[3] == 'u') | |
544 | return PRIu32; | |
545 | if (name[3] == 'x') | |
546 | return PRIx32; | |
547 | if (name[3] == 'X') | |
548 | return PRIX32; | |
549 | abort (); | |
550 | } | |
551 | if (name[4] == '6' && name[5] == '4' && name[6] == '\0') | |
552 | { | |
553 | if (name[3] == 'd') | |
554 | return PRId64; | |
555 | if (name[3] == 'i') | |
556 | return PRIi64; | |
557 | if (name[3] == 'o') | |
558 | return PRIo64; | |
559 | if (name[3] == 'u') | |
560 | return PRIu64; | |
561 | if (name[3] == 'x') | |
562 | return PRIx64; | |
563 | if (name[3] == 'X') | |
564 | return PRIX64; | |
565 | abort (); | |
566 | } | |
567 | if (name[4] == 'L' && name[5] == 'E' && name[6] == 'A' | |
568 | && name[7] == 'S' && name[8] == 'T') | |
569 | { | |
570 | if (name[9] == '8' && name[10] == '\0') | |
571 | { | |
572 | if (name[3] == 'd') | |
573 | return PRIdLEAST8; | |
574 | if (name[3] == 'i') | |
575 | return PRIiLEAST8; | |
576 | if (name[3] == 'o') | |
577 | return PRIoLEAST8; | |
578 | if (name[3] == 'u') | |
579 | return PRIuLEAST8; | |
580 | if (name[3] == 'x') | |
581 | return PRIxLEAST8; | |
582 | if (name[3] == 'X') | |
583 | return PRIXLEAST8; | |
584 | abort (); | |
585 | } | |
586 | if (name[9] == '1' && name[10] == '6' && name[11] == '\0') | |
587 | { | |
588 | if (name[3] == 'd') | |
589 | return PRIdLEAST16; | |
590 | if (name[3] == 'i') | |
591 | return PRIiLEAST16; | |
592 | if (name[3] == 'o') | |
593 | return PRIoLEAST16; | |
594 | if (name[3] == 'u') | |
595 | return PRIuLEAST16; | |
596 | if (name[3] == 'x') | |
597 | return PRIxLEAST16; | |
598 | if (name[3] == 'X') | |
599 | return PRIXLEAST16; | |
600 | abort (); | |
601 | } | |
602 | if (name[9] == '3' && name[10] == '2' && name[11] == '\0') | |
603 | { | |
604 | if (name[3] == 'd') | |
605 | return PRIdLEAST32; | |
606 | if (name[3] == 'i') | |
607 | return PRIiLEAST32; | |
608 | if (name[3] == 'o') | |
609 | return PRIoLEAST32; | |
610 | if (name[3] == 'u') | |
611 | return PRIuLEAST32; | |
612 | if (name[3] == 'x') | |
613 | return PRIxLEAST32; | |
614 | if (name[3] == 'X') | |
615 | return PRIXLEAST32; | |
616 | abort (); | |
617 | } | |
618 | if (name[9] == '6' && name[10] == '4' && name[11] == '\0') | |
619 | { | |
620 | if (name[3] == 'd') | |
621 | return PRIdLEAST64; | |
622 | if (name[3] == 'i') | |
623 | return PRIiLEAST64; | |
624 | if (name[3] == 'o') | |
625 | return PRIoLEAST64; | |
626 | if (name[3] == 'u') | |
627 | return PRIuLEAST64; | |
628 | if (name[3] == 'x') | |
629 | return PRIxLEAST64; | |
630 | if (name[3] == 'X') | |
631 | return PRIXLEAST64; | |
632 | abort (); | |
633 | } | |
634 | } | |
635 | if (name[4] == 'F' && name[5] == 'A' && name[6] == 'S' | |
636 | && name[7] == 'T') | |
637 | { | |
638 | if (name[8] == '8' && name[9] == '\0') | |
639 | { | |
640 | if (name[3] == 'd') | |
641 | return PRIdFAST8; | |
642 | if (name[3] == 'i') | |
643 | return PRIiFAST8; | |
644 | if (name[3] == 'o') | |
645 | return PRIoFAST8; | |
646 | if (name[3] == 'u') | |
647 | return PRIuFAST8; | |
648 | if (name[3] == 'x') | |
649 | return PRIxFAST8; | |
650 | if (name[3] == 'X') | |
651 | return PRIXFAST8; | |
652 | abort (); | |
653 | } | |
654 | if (name[8] == '1' && name[9] == '6' && name[10] == '\0') | |
655 | { | |
656 | if (name[3] == 'd') | |
657 | return PRIdFAST16; | |
658 | if (name[3] == 'i') | |
659 | return PRIiFAST16; | |
660 | if (name[3] == 'o') | |
661 | return PRIoFAST16; | |
662 | if (name[3] == 'u') | |
663 | return PRIuFAST16; | |
664 | if (name[3] == 'x') | |
665 | return PRIxFAST16; | |
666 | if (name[3] == 'X') | |
667 | return PRIXFAST16; | |
668 | abort (); | |
669 | } | |
670 | if (name[8] == '3' && name[9] == '2' && name[10] == '\0') | |
671 | { | |
672 | if (name[3] == 'd') | |
673 | return PRIdFAST32; | |
674 | if (name[3] == 'i') | |
675 | return PRIiFAST32; | |
676 | if (name[3] == 'o') | |
677 | return PRIoFAST32; | |
678 | if (name[3] == 'u') | |
679 | return PRIuFAST32; | |
680 | if (name[3] == 'x') | |
681 | return PRIxFAST32; | |
682 | if (name[3] == 'X') | |
683 | return PRIXFAST32; | |
684 | abort (); | |
685 | } | |
686 | if (name[8] == '6' && name[9] == '4' && name[10] == '\0') | |
687 | { | |
688 | if (name[3] == 'd') | |
689 | return PRIdFAST64; | |
690 | if (name[3] == 'i') | |
691 | return PRIiFAST64; | |
692 | if (name[3] == 'o') | |
693 | return PRIoFAST64; | |
694 | if (name[3] == 'u') | |
695 | return PRIuFAST64; | |
696 | if (name[3] == 'x') | |
697 | return PRIxFAST64; | |
698 | if (name[3] == 'X') | |
699 | return PRIXFAST64; | |
700 | abort (); | |
701 | } | |
702 | } | |
703 | if (name[4] == 'M' && name[5] == 'A' && name[6] == 'X' | |
704 | && name[7] == '\0') | |
705 | { | |
706 | if (name[3] == 'd') | |
707 | return PRIdMAX; | |
708 | if (name[3] == 'i') | |
709 | return PRIiMAX; | |
710 | if (name[3] == 'o') | |
711 | return PRIoMAX; | |
712 | if (name[3] == 'u') | |
713 | return PRIuMAX; | |
714 | if (name[3] == 'x') | |
715 | return PRIxMAX; | |
716 | if (name[3] == 'X') | |
717 | return PRIXMAX; | |
718 | abort (); | |
719 | } | |
720 | if (name[4] == 'P' && name[5] == 'T' && name[6] == 'R' | |
721 | && name[7] == '\0') | |
722 | { | |
723 | if (name[3] == 'd') | |
724 | return PRIdPTR; | |
725 | if (name[3] == 'i') | |
726 | return PRIiPTR; | |
727 | if (name[3] == 'o') | |
728 | return PRIoPTR; | |
729 | if (name[3] == 'u') | |
730 | return PRIuPTR; | |
731 | if (name[3] == 'x') | |
732 | return PRIxPTR; | |
733 | if (name[3] == 'X') | |
734 | return PRIXPTR; | |
735 | abort (); | |
736 | } | |
737 | } | |
738 | } | |
083dc54a UD |
739 | /* Test for a glibc specific printf() format directive flag. */ |
740 | if (name[0] == 'I' && name[1] == '\0') | |
741 | { | |
742 | #if defined _LIBC || __GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 2) | |
743 | /* The 'I' flag, in numeric format directives, replaces ASCII digits | |
744 | with the 'outdigits' defined in the LC_CTYPE locale facet. This is | |
745 | used for Farsi (Persian) and maybe Arabic. */ | |
746 | return "I"; | |
747 | #else | |
748 | return ""; | |
749 | #endif | |
750 | } | |
3172f58f UD |
751 | /* Other system dependent strings are not valid. */ |
752 | return NULL; | |
753 | } | |
754 | ||
24906b43 RM |
755 | /* Load the message catalogs specified by FILENAME. If it is no valid |
756 | message catalog do nothing. */ | |
757 | void | |
d0fc4041 | 758 | internal_function |
c44a663d | 759 | _nl_load_domain (domain_file, domainbinding) |
7a12c6bb | 760 | struct loaded_l10nfile *domain_file; |
c44a663d | 761 | struct binding *domainbinding; |
24906b43 | 762 | { |
ac5e137c | 763 | __libc_lock_define_initialized_recursive (static, lock); |
ce7265c7 | 764 | int fd = -1; |
dfd2257a | 765 | size_t size; |
4a4d50f3 | 766 | #ifdef _LIBC |
8edf6e0d | 767 | struct stat64 st; |
4a4d50f3 UD |
768 | #else |
769 | struct stat st; | |
770 | #endif | |
24906b43 | 771 | struct mo_file_header *data = (struct mo_file_header *) -1; |
24906b43 | 772 | int use_mmap = 0; |
7a12c6bb | 773 | struct loaded_domain *domain; |
3172f58f | 774 | int revision; |
c44a663d | 775 | const char *nullentry; |
4e82c610 | 776 | size_t nullentrylen; |
24906b43 | 777 | |
ac5e137c | 778 | __libc_lock_lock_recursive (lock); |
ce7265c7 UD |
779 | if (domain_file->decided != 0) |
780 | { | |
781 | /* There are two possibilities: | |
782 | ||
783 | + is is the same thread calling again during this | |
4e82c610 UD |
784 | initialization via _nl_find_msg. We have initialized |
785 | everything this call needs. | |
ce7265c7 UD |
786 | |
787 | + this is another thread which tried to initialize this object. | |
788 | Not necessary anymore since if the lock is available this | |
789 | is finished. | |
790 | */ | |
ac5e137c | 791 | __libc_lock_unlock_recursive (lock); |
ce7265c7 UD |
792 | return; |
793 | } | |
794 | ||
795 | domain_file->decided = -1; | |
7a12c6bb | 796 | domain_file->data = NULL; |
24906b43 | 797 | |
c44a663d UD |
798 | /* Note that it would be useless to store domainbinding in domain_file |
799 | because domainbinding might be == NULL now but != NULL later (after | |
800 | a call to bind_textdomain_codeset). */ | |
801 | ||
75914335 RM |
802 | /* If the record does not represent a valid locale the FILENAME |
803 | might be NULL. This can happen when according to the given | |
804 | specification the locale file name is different for XPG and CEN | |
805 | syntax. */ | |
7a12c6bb | 806 | if (domain_file->filename == NULL) |
ce7265c7 | 807 | goto out; |
75914335 | 808 | |
24906b43 | 809 | /* Try to open the addressed file. */ |
7a12c6bb | 810 | fd = open (domain_file->filename, O_RDONLY); |
24906b43 | 811 | if (fd == -1) |
ce7265c7 | 812 | goto out; |
24906b43 RM |
813 | |
814 | /* We must know about the size of the file. */ | |
4a4d50f3 UD |
815 | if ( |
816 | #ifdef _LIBC | |
817 | __builtin_expect (fstat64 (fd, &st) != 0, 0) | |
818 | #else | |
819 | __builtin_expect (fstat (fd, &st) != 0, 0) | |
820 | #endif | |
17c389fc UD |
821 | || __builtin_expect ((size = (size_t) st.st_size) != st.st_size, 0) |
822 | || __builtin_expect (size < sizeof (struct mo_file_header), 0)) | |
ce7265c7 UD |
823 | /* Something went wrong. */ |
824 | goto out;; | |
24906b43 | 825 | |
7cabd57c | 826 | #ifdef HAVE_MMAP |
24906b43 RM |
827 | /* Now we are ready to load the file. If mmap() is available we try |
828 | this first. If not available or it failed we try to load it. */ | |
dfd2257a | 829 | data = (struct mo_file_header *) mmap (NULL, size, PROT_READ, |
24906b43 RM |
830 | MAP_PRIVATE, fd, 0); |
831 | ||
a1ffb40e | 832 | if (__glibc_likely (data != MAP_FAILED)) |
24906b43 RM |
833 | { |
834 | /* mmap() call was successful. */ | |
835 | close (fd); | |
ce7265c7 | 836 | fd = -1; |
24906b43 RM |
837 | use_mmap = 1; |
838 | } | |
bea9b193 RM |
839 | |
840 | assert (MAP_FAILED == (void *) -1); | |
24906b43 RM |
841 | #endif |
842 | ||
843 | /* If the data is not yet available (i.e. mmap'ed) we try to load | |
844 | it manually. */ | |
bea9b193 | 845 | if (data == (struct mo_file_header *) -1) |
24906b43 | 846 | { |
dfd2257a | 847 | size_t to_read; |
24906b43 RM |
848 | char *read_ptr; |
849 | ||
dfd2257a | 850 | data = (struct mo_file_header *) malloc (size); |
24906b43 | 851 | if (data == NULL) |
ce7265c7 | 852 | goto out; |
24906b43 | 853 | |
dfd2257a | 854 | to_read = size; |
24906b43 RM |
855 | read_ptr = (char *) data; |
856 | do | |
857 | { | |
ce7265c7 UD |
858 | long int nb = (long int) TEMP_FAILURE_RETRY (read (fd, read_ptr, |
859 | to_read)); | |
17c389fc | 860 | if (nb <= 0) |
ce7265c7 UD |
861 | goto out; |
862 | ||
24906b43 RM |
863 | read_ptr += nb; |
864 | to_read -= nb; | |
865 | } | |
866 | while (to_read > 0); | |
867 | ||
868 | close (fd); | |
ce7265c7 | 869 | fd = -1; |
24906b43 RM |
870 | } |
871 | ||
872 | /* Using the magic number we can test whether it really is a message | |
873 | catalog file. */ | |
17c389fc UD |
874 | if (__builtin_expect (data->magic != _MAGIC && data->magic != _MAGIC_SWAPPED, |
875 | 0)) | |
24906b43 RM |
876 | { |
877 | /* The magic number is wrong: not a message catalog file. */ | |
7cabd57c | 878 | #ifdef HAVE_MMAP |
24906b43 | 879 | if (use_mmap) |
dfd2257a | 880 | munmap ((caddr_t) data, size); |
24906b43 RM |
881 | else |
882 | #endif | |
883 | free (data); | |
ce7265c7 | 884 | goto out; |
24906b43 RM |
885 | } |
886 | ||
ad5b53b1 UD |
887 | domain = (struct loaded_domain *) malloc (sizeof (struct loaded_domain)); |
888 | if (domain == NULL) | |
ce7265c7 | 889 | goto out; |
ad5b53b1 | 890 | domain_file->data = domain; |
7a12c6bb | 891 | |
24906b43 | 892 | domain->data = (char *) data; |
a5a0310d | 893 | domain->use_mmap = use_mmap; |
dfd2257a | 894 | domain->mmap_size = size; |
24906b43 | 895 | domain->must_swap = data->magic != _MAGIC; |
3172f58f | 896 | domain->malloced = NULL; |
24906b43 RM |
897 | |
898 | /* Fill in the information about the available tables. */ | |
3172f58f | 899 | revision = W (domain->must_swap, data->revision); |
083dc54a | 900 | /* We support only the major revisions 0 and 1. */ |
3172f58f | 901 | switch (revision >> 16) |
24906b43 RM |
902 | { |
903 | case 0: | |
083dc54a | 904 | case 1: |
24906b43 | 905 | domain->nstrings = W (domain->must_swap, data->nstrings); |
3172f58f | 906 | domain->orig_tab = (const struct string_desc *) |
24906b43 | 907 | ((char *) data + W (domain->must_swap, data->orig_tab_offset)); |
3172f58f | 908 | domain->trans_tab = (const struct string_desc *) |
24906b43 RM |
909 | ((char *) data + W (domain->must_swap, data->trans_tab_offset)); |
910 | domain->hash_size = W (domain->must_swap, data->hash_tab_size); | |
3172f58f UD |
911 | domain->hash_tab = |
912 | (domain->hash_size > 2 | |
913 | ? (const nls_uint32 *) | |
914 | ((char *) data + W (domain->must_swap, data->hash_tab_offset)) | |
915 | : NULL); | |
916 | domain->must_swap_hash_tab = domain->must_swap; | |
917 | ||
918 | /* Now dispatch on the minor revision. */ | |
919 | switch (revision & 0xffff) | |
920 | { | |
921 | case 0: | |
922 | domain->n_sysdep_strings = 0; | |
923 | domain->orig_sysdep_tab = NULL; | |
924 | domain->trans_sysdep_tab = NULL; | |
925 | break; | |
926 | case 1: | |
927 | default: | |
928 | { | |
929 | nls_uint32 n_sysdep_strings; | |
930 | ||
931 | if (domain->hash_tab == NULL) | |
932 | /* This is invalid. These minor revisions need a hash table. */ | |
933 | goto invalid; | |
934 | ||
935 | n_sysdep_strings = | |
936 | W (domain->must_swap, data->n_sysdep_strings); | |
937 | if (n_sysdep_strings > 0) | |
938 | { | |
939 | nls_uint32 n_sysdep_segments; | |
940 | const struct sysdep_segment *sysdep_segments; | |
941 | const char **sysdep_segment_values; | |
942 | const nls_uint32 *orig_sysdep_tab; | |
943 | const nls_uint32 *trans_sysdep_tab; | |
083dc54a | 944 | nls_uint32 n_inmem_sysdep_strings; |
3172f58f UD |
945 | size_t memneed; |
946 | char *mem; | |
947 | struct sysdep_string_desc *inmem_orig_sysdep_tab; | |
948 | struct sysdep_string_desc *inmem_trans_sysdep_tab; | |
949 | nls_uint32 *inmem_hash_tab; | |
083dc54a | 950 | unsigned int i, j; |
3172f58f UD |
951 | |
952 | /* Get the values of the system dependent segments. */ | |
953 | n_sysdep_segments = | |
954 | W (domain->must_swap, data->n_sysdep_segments); | |
955 | sysdep_segments = (const struct sysdep_segment *) | |
956 | ((char *) data | |
957 | + W (domain->must_swap, data->sysdep_segments_offset)); | |
958 | sysdep_segment_values = | |
959 | alloca (n_sysdep_segments * sizeof (const char *)); | |
960 | for (i = 0; i < n_sysdep_segments; i++) | |
961 | { | |
962 | const char *name = | |
963 | (char *) data | |
964 | + W (domain->must_swap, sysdep_segments[i].offset); | |
965 | nls_uint32 namelen = | |
966 | W (domain->must_swap, sysdep_segments[i].length); | |
967 | ||
968 | if (!(namelen > 0 && name[namelen - 1] == '\0')) | |
969 | { | |
970 | freea (sysdep_segment_values); | |
971 | goto invalid; | |
972 | } | |
973 | ||
974 | sysdep_segment_values[i] = get_sysdep_segment_value (name); | |
975 | } | |
976 | ||
977 | orig_sysdep_tab = (const nls_uint32 *) | |
978 | ((char *) data | |
979 | + W (domain->must_swap, data->orig_sysdep_tab_offset)); | |
980 | trans_sysdep_tab = (const nls_uint32 *) | |
981 | ((char *) data | |
982 | + W (domain->must_swap, data->trans_sysdep_tab_offset)); | |
983 | ||
984 | /* Compute the amount of additional memory needed for the | |
083dc54a UD |
985 | system dependent strings and the augmented hash table. |
986 | At the same time, also drop string pairs which refer to | |
987 | an undefined system dependent segment. */ | |
988 | n_inmem_sysdep_strings = 0; | |
989 | memneed = domain->hash_size * sizeof (nls_uint32); | |
990 | for (i = 0; i < n_sysdep_strings; i++) | |
3172f58f | 991 | { |
083dc54a UD |
992 | int valid = 1; |
993 | size_t needs[2]; | |
994 | ||
995 | for (j = 0; j < 2; j++) | |
996 | { | |
997 | const struct sysdep_string *sysdep_string = | |
998 | (const struct sysdep_string *) | |
999 | ((char *) data | |
1000 | + W (domain->must_swap, | |
1001 | j == 0 | |
1002 | ? orig_sysdep_tab[i] | |
1003 | : trans_sysdep_tab[i])); | |
1004 | size_t need = 0; | |
1005 | const struct segment_pair *p = sysdep_string->segments; | |
1006 | ||
1007 | if (W (domain->must_swap, p->sysdepref) != SEGMENTS_END) | |
1008 | for (p = sysdep_string->segments;; p++) | |
3172f58f | 1009 | { |
083dc54a | 1010 | nls_uint32 sysdepref; |
3172f58f | 1011 | |
083dc54a | 1012 | need += W (domain->must_swap, p->segsize); |
3172f58f | 1013 | |
083dc54a UD |
1014 | sysdepref = W (domain->must_swap, p->sysdepref); |
1015 | if (sysdepref == SEGMENTS_END) | |
1016 | break; | |
3172f58f | 1017 | |
083dc54a UD |
1018 | if (sysdepref >= n_sysdep_segments) |
1019 | { | |
1020 | /* Invalid. */ | |
1021 | freea (sysdep_segment_values); | |
1022 | goto invalid; | |
1023 | } | |
1024 | ||
1025 | if (sysdep_segment_values[sysdepref] == NULL) | |
1026 | { | |
1027 | /* This particular string pair is invalid. */ | |
1028 | valid = 0; | |
1029 | break; | |
1030 | } | |
3172f58f | 1031 | |
083dc54a UD |
1032 | need += strlen (sysdep_segment_values[sysdepref]); |
1033 | } | |
1034 | ||
1035 | needs[j] = need; | |
1036 | if (!valid) | |
1037 | break; | |
1038 | } | |
3172f58f | 1039 | |
083dc54a | 1040 | if (valid) |
3172f58f | 1041 | { |
083dc54a UD |
1042 | n_inmem_sysdep_strings++; |
1043 | memneed += needs[0] + needs[1]; | |
3172f58f | 1044 | } |
083dc54a UD |
1045 | } |
1046 | memneed += 2 * n_inmem_sysdep_strings | |
1047 | * sizeof (struct sysdep_string_desc); | |
1048 | ||
1049 | if (n_inmem_sysdep_strings > 0) | |
1050 | { | |
1051 | unsigned int k; | |
1052 | ||
1053 | /* Allocate additional memory. */ | |
1054 | mem = (char *) malloc (memneed); | |
1055 | if (mem == NULL) | |
1056 | goto invalid; | |
1057 | ||
1058 | domain->malloced = mem; | |
1059 | inmem_orig_sysdep_tab = (struct sysdep_string_desc *) mem; | |
1060 | mem += n_inmem_sysdep_strings | |
1061 | * sizeof (struct sysdep_string_desc); | |
1062 | inmem_trans_sysdep_tab = (struct sysdep_string_desc *) mem; | |
1063 | mem += n_inmem_sysdep_strings | |
1064 | * sizeof (struct sysdep_string_desc); | |
1065 | inmem_hash_tab = (nls_uint32 *) mem; | |
1066 | mem += domain->hash_size * sizeof (nls_uint32); | |
1067 | ||
1068 | /* Compute the system dependent strings. */ | |
1069 | k = 0; | |
1070 | for (i = 0; i < n_sysdep_strings; i++) | |
3172f58f | 1071 | { |
083dc54a | 1072 | int valid = 1; |
3172f58f | 1073 | |
083dc54a | 1074 | for (j = 0; j < 2; j++) |
3172f58f | 1075 | { |
083dc54a UD |
1076 | const struct sysdep_string *sysdep_string = |
1077 | (const struct sysdep_string *) | |
1078 | ((char *) data | |
1079 | + W (domain->must_swap, | |
1080 | j == 0 | |
1081 | ? orig_sysdep_tab[i] | |
1082 | : trans_sysdep_tab[i])); | |
1083 | const struct segment_pair *p = | |
1084 | sysdep_string->segments; | |
1085 | ||
1086 | if (W (domain->must_swap, p->sysdepref) | |
1087 | != SEGMENTS_END) | |
1088 | for (p = sysdep_string->segments;; p++) | |
1089 | { | |
1090 | nls_uint32 sysdepref; | |
1091 | ||
1092 | sysdepref = | |
1093 | W (domain->must_swap, p->sysdepref); | |
1094 | if (sysdepref == SEGMENTS_END) | |
1095 | break; | |
1096 | ||
1097 | if (sysdep_segment_values[sysdepref] == NULL) | |
1098 | { | |
1099 | /* This particular string pair is | |
1100 | invalid. */ | |
1101 | valid = 0; | |
1102 | break; | |
1103 | } | |
1104 | } | |
1105 | ||
1106 | if (!valid) | |
1107 | break; | |
1108 | } | |
3172f58f | 1109 | |
083dc54a UD |
1110 | if (valid) |
1111 | { | |
1112 | for (j = 0; j < 2; j++) | |
3172f58f | 1113 | { |
083dc54a UD |
1114 | const struct sysdep_string *sysdep_string = |
1115 | (const struct sysdep_string *) | |
1116 | ((char *) data | |
1117 | + W (domain->must_swap, | |
1118 | j == 0 | |
1119 | ? orig_sysdep_tab[i] | |
1120 | : trans_sysdep_tab[i])); | |
1121 | const char *static_segments = | |
1122 | (char *) data | |
1123 | + W (domain->must_swap, sysdep_string->offset); | |
1124 | const struct segment_pair *p = | |
1125 | sysdep_string->segments; | |
1126 | ||
1127 | /* Concatenate the segments, and fill | |
1128 | inmem_orig_sysdep_tab[k] (for j == 0) and | |
1129 | inmem_trans_sysdep_tab[k] (for j == 1). */ | |
1130 | ||
1131 | struct sysdep_string_desc *inmem_tab_entry = | |
1132 | (j == 0 | |
1133 | ? inmem_orig_sysdep_tab | |
1134 | : inmem_trans_sysdep_tab) | |
1135 | + k; | |
1136 | ||
1137 | if (W (domain->must_swap, p->sysdepref) | |
1138 | == SEGMENTS_END) | |
1139 | { | |
1140 | /* Only one static segment. */ | |
1141 | inmem_tab_entry->length = | |
1142 | W (domain->must_swap, p->segsize); | |
1143 | inmem_tab_entry->pointer = static_segments; | |
1144 | } | |
1145 | else | |
1146 | { | |
1147 | inmem_tab_entry->pointer = mem; | |
1148 | ||
1149 | for (p = sysdep_string->segments;; p++) | |
1150 | { | |
1151 | nls_uint32 segsize = | |
1152 | W (domain->must_swap, p->segsize); | |
1153 | nls_uint32 sysdepref = | |
1154 | W (domain->must_swap, p->sysdepref); | |
1155 | size_t n; | |
1156 | ||
1157 | if (segsize > 0) | |
1158 | { | |
1159 | memcpy (mem, static_segments, segsize); | |
1160 | mem += segsize; | |
1161 | static_segments += segsize; | |
1162 | } | |
1163 | ||
1164 | if (sysdepref == SEGMENTS_END) | |
1165 | break; | |
1166 | ||
1167 | n = strlen (sysdep_segment_values[sysdepref]); | |
1168 | memcpy (mem, sysdep_segment_values[sysdepref], n); | |
1169 | mem += n; | |
1170 | } | |
1171 | ||
1172 | inmem_tab_entry->length = | |
1173 | mem - inmem_tab_entry->pointer; | |
1174 | } | |
3172f58f UD |
1175 | } |
1176 | ||
083dc54a | 1177 | k++; |
3172f58f | 1178 | } |
3172f58f | 1179 | } |
083dc54a UD |
1180 | if (k != n_inmem_sysdep_strings) |
1181 | abort (); | |
1182 | ||
1183 | /* Compute the augmented hash table. */ | |
1184 | for (i = 0; i < domain->hash_size; i++) | |
1185 | inmem_hash_tab[i] = | |
1186 | W (domain->must_swap_hash_tab, domain->hash_tab[i]); | |
1187 | for (i = 0; i < n_inmem_sysdep_strings; i++) | |
3172f58f | 1188 | { |
083dc54a UD |
1189 | const char *msgid = inmem_orig_sysdep_tab[i].pointer; |
1190 | nls_uint32 hash_val = __hash_string (msgid); | |
1191 | nls_uint32 idx = hash_val % domain->hash_size; | |
1192 | nls_uint32 incr = | |
1193 | 1 + (hash_val % (domain->hash_size - 2)); | |
1194 | ||
1195 | for (;;) | |
3172f58f | 1196 | { |
083dc54a UD |
1197 | if (inmem_hash_tab[idx] == 0) |
1198 | { | |
1199 | /* Hash table entry is empty. Use it. */ | |
1200 | inmem_hash_tab[idx] = 1 + domain->nstrings + i; | |
1201 | break; | |
1202 | } | |
3172f58f | 1203 | |
083dc54a UD |
1204 | if (idx >= domain->hash_size - incr) |
1205 | idx -= domain->hash_size - incr; | |
1206 | else | |
1207 | idx += incr; | |
1208 | } | |
3172f58f | 1209 | } |
3172f58f | 1210 | |
083dc54a UD |
1211 | domain->n_sysdep_strings = n_inmem_sysdep_strings; |
1212 | domain->orig_sysdep_tab = inmem_orig_sysdep_tab; | |
1213 | domain->trans_sysdep_tab = inmem_trans_sysdep_tab; | |
3172f58f | 1214 | |
083dc54a UD |
1215 | domain->hash_tab = inmem_hash_tab; |
1216 | domain->must_swap_hash_tab = 0; | |
1217 | } | |
1218 | else | |
1219 | { | |
1220 | domain->n_sysdep_strings = 0; | |
1221 | domain->orig_sysdep_tab = NULL; | |
1222 | domain->trans_sysdep_tab = NULL; | |
1223 | } | |
3172f58f | 1224 | |
083dc54a | 1225 | freea (sysdep_segment_values); |
3172f58f UD |
1226 | } |
1227 | else | |
1228 | { | |
1229 | domain->n_sysdep_strings = 0; | |
1230 | domain->orig_sysdep_tab = NULL; | |
1231 | domain->trans_sysdep_tab = NULL; | |
1232 | } | |
1233 | } | |
1234 | break; | |
1235 | } | |
24906b43 RM |
1236 | break; |
1237 | default: | |
7cabd57c | 1238 | /* This is an invalid revision. */ |
3172f58f | 1239 | invalid: |
7a44c18f | 1240 | /* This is an invalid .mo file or we ran out of resources. */ |
72e6cdfa | 1241 | free (domain->malloced); |
7cabd57c | 1242 | #ifdef HAVE_MMAP |
24906b43 | 1243 | if (use_mmap) |
dfd2257a | 1244 | munmap ((caddr_t) data, size); |
24906b43 RM |
1245 | else |
1246 | #endif | |
1247 | free (data); | |
7a12c6bb RM |
1248 | free (domain); |
1249 | domain_file->data = NULL; | |
ce7265c7 | 1250 | goto out; |
24906b43 RM |
1251 | } |
1252 | ||
4e82c610 UD |
1253 | /* No caches of converted translations so far. */ |
1254 | domain->conversions = NULL; | |
1255 | domain->nconversions = 0; | |
408cfca0 | 1256 | __libc_rwlock_init (domain->conversions_lock); |
17c389fc | 1257 | |
4e82c610 UD |
1258 | /* Get the header entry and look for a plural specification. */ |
1259 | nullentry = _nl_find_msg (domain_file, domainbinding, "", 0, &nullentrylen); | |
a1ffb40e | 1260 | if (__glibc_unlikely (nullentry == (char *) -1)) |
7a44c18f CD |
1261 | { |
1262 | __libc_rwlock_fini (domain->conversions_lock); | |
1263 | goto invalid; | |
1264 | } | |
0555fcce | 1265 | EXTRACT_PLURAL_EXPRESSION (nullentry, &domain->plural, &domain->nplurals); |
ce7265c7 UD |
1266 | |
1267 | out: | |
1268 | if (fd != -1) | |
1269 | close (fd); | |
1270 | ||
1271 | domain_file->decided = 1; | |
1272 | ||
ac5e137c | 1273 | __libc_lock_unlock_recursive (lock); |
24906b43 | 1274 | } |
a5a0310d UD |
1275 | |
1276 | ||
1277 | #ifdef _LIBC | |
1278 | void | |
9e365fe7 | 1279 | internal_function __libc_freeres_fn_section |
a5a0310d UD |
1280 | _nl_unload_domain (domain) |
1281 | struct loaded_domain *domain; | |
1282 | { | |
4e82c610 UD |
1283 | size_t i; |
1284 | ||
0555fcce | 1285 | if (domain->plural != &__gettext_germanic_plural) |
701666b7 | 1286 | __gettext_free_exp ((struct expression *) domain->plural); |
abbffdf9 | 1287 | |
4e82c610 UD |
1288 | for (i = 0; i < domain->nconversions; i++) |
1289 | { | |
1290 | struct converted_domain *convd = &domain->conversions[i]; | |
1291 | ||
1292 | free ((char *) convd->encoding); | |
1293 | if (convd->conv_tab != NULL && convd->conv_tab != (char **) -1) | |
1294 | free (convd->conv_tab); | |
1295 | if (convd->conv != (__gconv_t) -1) | |
1296 | __gconv_close (convd->conv); | |
1297 | } | |
72e6cdfa | 1298 | free (domain->conversions); |
408cfca0 | 1299 | __libc_rwlock_fini (domain->conversions_lock); |
abbffdf9 | 1300 | |
72e6cdfa | 1301 | free (domain->malloced); |
3172f58f | 1302 | |
2f599545 | 1303 | # ifdef _POSIX_MAPPED_FILES |
a5a0310d UD |
1304 | if (domain->use_mmap) |
1305 | munmap ((caddr_t) domain->data, domain->mmap_size); | |
1306 | else | |
2f599545 | 1307 | # endif /* _POSIX_MAPPED_FILES */ |
a5a0310d UD |
1308 | free ((void *) domain->data); |
1309 | ||
1310 | free (domain); | |
1311 | } | |
1312 | #endif |