1 /* Load needed message catalogs.
2 Copyright (C) 1995-2014 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
5 The GNU C Library is free software; you can redistribute it and/or
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.
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
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, see
17 <http://www.gnu.org/licenses/>. */
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. */
23 # define _GNU_SOURCE 1
34 #include <sys/types.h>
39 # define alloca __builtin_alloca
40 # define HAVE_ALLOCA 1
44 # define alloca _alloca
46 # if defined HAVE_ALLOCA_H || defined _LIBC
63 #if defined HAVE_UNISTD_H || defined _LIBC
68 # include <langinfo.h>
72 #if (defined HAVE_MMAP && defined HAVE_MUNMAP && !defined DISALLOW_MMAP) \
73 || (defined _LIBC && defined _POSIX_MAPPED_FILES)
74 # include <sys/mman.h>
81 #if defined HAVE_STDINT_H_WITH_UINTMAX || defined _LIBC
84 #if defined HAVE_INTTYPES_H || defined _LIBC
85 # include <inttypes.h>
90 #include "hash-string.h"
91 #include "plural-exp.h"
94 # include "../locale/localeinfo.h"
95 # include <not-cancel.h>
98 /* Handle multi-threaded applications. */
100 # include <bits/libc-lock.h>
106 # define PRI_MACROS_BROKEN 0
109 /* Provide fallback values for macros that ought to be defined in <inttypes.h>.
110 Note that our fallback values need not be literal strings, because we don't
111 use them with preprocessor string concatenation. */
112 #if !defined PRId8 || PRI_MACROS_BROKEN
116 #if !defined PRIi8 || PRI_MACROS_BROKEN
120 #if !defined PRIo8 || PRI_MACROS_BROKEN
124 #if !defined PRIu8 || PRI_MACROS_BROKEN
128 #if !defined PRIx8 || PRI_MACROS_BROKEN
132 #if !defined PRIX8 || PRI_MACROS_BROKEN
136 #if !defined PRId16 || PRI_MACROS_BROKEN
140 #if !defined PRIi16 || PRI_MACROS_BROKEN
144 #if !defined PRIo16 || PRI_MACROS_BROKEN
148 #if !defined PRIu16 || PRI_MACROS_BROKEN
152 #if !defined PRIx16 || PRI_MACROS_BROKEN
156 #if !defined PRIX16 || PRI_MACROS_BROKEN
160 #if !defined PRId32 || PRI_MACROS_BROKEN
164 #if !defined PRIi32 || PRI_MACROS_BROKEN
168 #if !defined PRIo32 || PRI_MACROS_BROKEN
172 #if !defined PRIu32 || PRI_MACROS_BROKEN
176 #if !defined PRIx32 || PRI_MACROS_BROKEN
180 #if !defined PRIX32 || PRI_MACROS_BROKEN
184 #if !defined PRId64 || PRI_MACROS_BROKEN
186 # define PRId64 (sizeof (long) == 8 ? "ld" : "lld")
188 #if !defined PRIi64 || PRI_MACROS_BROKEN
190 # define PRIi64 (sizeof (long) == 8 ? "li" : "lli")
192 #if !defined PRIo64 || PRI_MACROS_BROKEN
194 # define PRIo64 (sizeof (long) == 8 ? "lo" : "llo")
196 #if !defined PRIu64 || PRI_MACROS_BROKEN
198 # define PRIu64 (sizeof (long) == 8 ? "lu" : "llu")
200 #if !defined PRIx64 || PRI_MACROS_BROKEN
202 # define PRIx64 (sizeof (long) == 8 ? "lx" : "llx")
204 #if !defined PRIX64 || PRI_MACROS_BROKEN
206 # define PRIX64 (sizeof (long) == 8 ? "lX" : "llX")
208 #if !defined PRIdLEAST8 || PRI_MACROS_BROKEN
210 # define PRIdLEAST8 "d"
212 #if !defined PRIiLEAST8 || PRI_MACROS_BROKEN
214 # define PRIiLEAST8 "i"
216 #if !defined PRIoLEAST8 || PRI_MACROS_BROKEN
218 # define PRIoLEAST8 "o"
220 #if !defined PRIuLEAST8 || PRI_MACROS_BROKEN
222 # define PRIuLEAST8 "u"
224 #if !defined PRIxLEAST8 || PRI_MACROS_BROKEN
226 # define PRIxLEAST8 "x"
228 #if !defined PRIXLEAST8 || PRI_MACROS_BROKEN
230 # define PRIXLEAST8 "X"
232 #if !defined PRIdLEAST16 || PRI_MACROS_BROKEN
234 # define PRIdLEAST16 "d"
236 #if !defined PRIiLEAST16 || PRI_MACROS_BROKEN
238 # define PRIiLEAST16 "i"
240 #if !defined PRIoLEAST16 || PRI_MACROS_BROKEN
242 # define PRIoLEAST16 "o"
244 #if !defined PRIuLEAST16 || PRI_MACROS_BROKEN
246 # define PRIuLEAST16 "u"
248 #if !defined PRIxLEAST16 || PRI_MACROS_BROKEN
250 # define PRIxLEAST16 "x"
252 #if !defined PRIXLEAST16 || PRI_MACROS_BROKEN
254 # define PRIXLEAST16 "X"
256 #if !defined PRIdLEAST32 || PRI_MACROS_BROKEN
258 # define PRIdLEAST32 "d"
260 #if !defined PRIiLEAST32 || PRI_MACROS_BROKEN
262 # define PRIiLEAST32 "i"
264 #if !defined PRIoLEAST32 || PRI_MACROS_BROKEN
266 # define PRIoLEAST32 "o"
268 #if !defined PRIuLEAST32 || PRI_MACROS_BROKEN
270 # define PRIuLEAST32 "u"
272 #if !defined PRIxLEAST32 || PRI_MACROS_BROKEN
274 # define PRIxLEAST32 "x"
276 #if !defined PRIXLEAST32 || PRI_MACROS_BROKEN
278 # define PRIXLEAST32 "X"
280 #if !defined PRIdLEAST64 || PRI_MACROS_BROKEN
282 # define PRIdLEAST64 PRId64
284 #if !defined PRIiLEAST64 || PRI_MACROS_BROKEN
286 # define PRIiLEAST64 PRIi64
288 #if !defined PRIoLEAST64 || PRI_MACROS_BROKEN
290 # define PRIoLEAST64 PRIo64
292 #if !defined PRIuLEAST64 || PRI_MACROS_BROKEN
294 # define PRIuLEAST64 PRIu64
296 #if !defined PRIxLEAST64 || PRI_MACROS_BROKEN
298 # define PRIxLEAST64 PRIx64
300 #if !defined PRIXLEAST64 || PRI_MACROS_BROKEN
302 # define PRIXLEAST64 PRIX64
304 #if !defined PRIdFAST8 || PRI_MACROS_BROKEN
306 # define PRIdFAST8 "d"
308 #if !defined PRIiFAST8 || PRI_MACROS_BROKEN
310 # define PRIiFAST8 "i"
312 #if !defined PRIoFAST8 || PRI_MACROS_BROKEN
314 # define PRIoFAST8 "o"
316 #if !defined PRIuFAST8 || PRI_MACROS_BROKEN
318 # define PRIuFAST8 "u"
320 #if !defined PRIxFAST8 || PRI_MACROS_BROKEN
322 # define PRIxFAST8 "x"
324 #if !defined PRIXFAST8 || PRI_MACROS_BROKEN
326 # define PRIXFAST8 "X"
328 #if !defined PRIdFAST16 || PRI_MACROS_BROKEN
330 # define PRIdFAST16 "d"
332 #if !defined PRIiFAST16 || PRI_MACROS_BROKEN
334 # define PRIiFAST16 "i"
336 #if !defined PRIoFAST16 || PRI_MACROS_BROKEN
338 # define PRIoFAST16 "o"
340 #if !defined PRIuFAST16 || PRI_MACROS_BROKEN
342 # define PRIuFAST16 "u"
344 #if !defined PRIxFAST16 || PRI_MACROS_BROKEN
346 # define PRIxFAST16 "x"
348 #if !defined PRIXFAST16 || PRI_MACROS_BROKEN
350 # define PRIXFAST16 "X"
352 #if !defined PRIdFAST32 || PRI_MACROS_BROKEN
354 # define PRIdFAST32 "d"
356 #if !defined PRIiFAST32 || PRI_MACROS_BROKEN
358 # define PRIiFAST32 "i"
360 #if !defined PRIoFAST32 || PRI_MACROS_BROKEN
362 # define PRIoFAST32 "o"
364 #if !defined PRIuFAST32 || PRI_MACROS_BROKEN
366 # define PRIuFAST32 "u"
368 #if !defined PRIxFAST32 || PRI_MACROS_BROKEN
370 # define PRIxFAST32 "x"
372 #if !defined PRIXFAST32 || PRI_MACROS_BROKEN
374 # define PRIXFAST32 "X"
376 #if !defined PRIdFAST64 || PRI_MACROS_BROKEN
378 # define PRIdFAST64 PRId64
380 #if !defined PRIiFAST64 || PRI_MACROS_BROKEN
382 # define PRIiFAST64 PRIi64
384 #if !defined PRIoFAST64 || PRI_MACROS_BROKEN
386 # define PRIoFAST64 PRIo64
388 #if !defined PRIuFAST64 || PRI_MACROS_BROKEN
390 # define PRIuFAST64 PRIu64
392 #if !defined PRIxFAST64 || PRI_MACROS_BROKEN
394 # define PRIxFAST64 PRIx64
396 #if !defined PRIXFAST64 || PRI_MACROS_BROKEN
398 # define PRIXFAST64 PRIX64
400 #if !defined PRIdMAX || PRI_MACROS_BROKEN
402 # define PRIdMAX (sizeof (uintmax_t) == sizeof (long) ? "ld" : "lld")
404 #if !defined PRIiMAX || PRI_MACROS_BROKEN
406 # define PRIiMAX (sizeof (uintmax_t) == sizeof (long) ? "li" : "lli")
408 #if !defined PRIoMAX || PRI_MACROS_BROKEN
410 # define PRIoMAX (sizeof (uintmax_t) == sizeof (long) ? "lo" : "llo")
412 #if !defined PRIuMAX || PRI_MACROS_BROKEN
414 # define PRIuMAX (sizeof (uintmax_t) == sizeof (long) ? "lu" : "llu")
416 #if !defined PRIxMAX || PRI_MACROS_BROKEN
418 # define PRIxMAX (sizeof (uintmax_t) == sizeof (long) ? "lx" : "llx")
420 #if !defined PRIXMAX || PRI_MACROS_BROKEN
422 # define PRIXMAX (sizeof (uintmax_t) == sizeof (long) ? "lX" : "llX")
424 #if !defined PRIdPTR || PRI_MACROS_BROKEN
427 (sizeof (void *) == sizeof (long) ? "ld" : \
428 sizeof (void *) == sizeof (int) ? "d" : \
431 #if !defined PRIiPTR || PRI_MACROS_BROKEN
434 (sizeof (void *) == sizeof (long) ? "li" : \
435 sizeof (void *) == sizeof (int) ? "i" : \
438 #if !defined PRIoPTR || PRI_MACROS_BROKEN
441 (sizeof (void *) == sizeof (long) ? "lo" : \
442 sizeof (void *) == sizeof (int) ? "o" : \
445 #if !defined PRIuPTR || PRI_MACROS_BROKEN
448 (sizeof (void *) == sizeof (long) ? "lu" : \
449 sizeof (void *) == sizeof (int) ? "u" : \
452 #if !defined PRIxPTR || PRI_MACROS_BROKEN
455 (sizeof (void *) == sizeof (long) ? "lx" : \
456 sizeof (void *) == sizeof (int) ? "x" : \
459 #if !defined PRIXPTR || PRI_MACROS_BROKEN
462 (sizeof (void *) == sizeof (long) ? "lX" : \
463 sizeof (void *) == sizeof (int) ? "X" : \
467 /* @@ end of prolog @@ */
470 /* Rename the non ISO C functions. This is required by the standard
471 because some ISO C functions will require linking with this object
472 file and the name space must not be polluted. */
473 # define open(name, flags) open_not_cancel_2 (name, flags)
474 # define close(fd) close_not_cancel_no_status (fd)
475 # define read(fd, buf, n) read_not_cancel (fd, buf, n)
476 # define mmap(addr, len, prot, flags, fd, offset) \
477 __mmap (addr, len, prot, flags, fd, offset)
478 # define munmap(addr, len) __munmap (addr, len)
481 /* For those losing systems which don't have `alloca' we have to add
482 some additional code emulating it. */
484 # define freea(p) /* nothing */
486 # define alloca(n) malloc (n)
487 # define freea(p) free (p)
490 /* For systems that distinguish between text and binary I/O.
491 O_BINARY is usually declared in <fcntl.h>. */
492 #if !defined O_BINARY && defined _O_BINARY
493 /* For MSC-compatible compilers. */
494 # define O_BINARY _O_BINARY
495 # define O_TEXT _O_TEXT
498 /* BeOS 5 has O_BINARY and O_TEXT, but they have no effect. */
502 /* On reasonable systems, binary I/O is the default. */
508 /* We need a sign, whether a new catalog was loaded, which can be associated
509 with all translations. This is important if the translations are
510 cached by one of GCC's features. */
511 int _nl_msg_cat_cntr
;
514 /* Expand a system dependent string segment. Return NULL if unsupported. */
516 get_sysdep_segment_value (const char *name
)
518 /* Test for an ISO C 99 section 7.8.1 format string directive.
520 P R I { d | i | o | u | x | X }
521 { { | LEAST | FAST } { 8 | 16 | 32 | 64 } | MAX | PTR } */
522 /* We don't use a table of 14 times 6 'const char *' strings here, because
523 data relocations cost startup time. */
524 if (name
[0] == 'P' && name
[1] == 'R' && name
[2] == 'I')
526 if (name
[3] == 'd' || name
[3] == 'i' || name
[3] == 'o' || name
[3] == 'u'
527 || name
[3] == 'x' || name
[3] == 'X')
529 if (name
[4] == '8' && name
[5] == '\0')
545 if (name
[4] == '1' && name
[5] == '6' && name
[6] == '\0')
561 if (name
[4] == '3' && name
[5] == '2' && name
[6] == '\0')
577 if (name
[4] == '6' && name
[5] == '4' && name
[6] == '\0')
593 if (name
[4] == 'L' && name
[5] == 'E' && name
[6] == 'A'
594 && name
[7] == 'S' && name
[8] == 'T')
596 if (name
[9] == '8' && name
[10] == '\0')
612 if (name
[9] == '1' && name
[10] == '6' && name
[11] == '\0')
628 if (name
[9] == '3' && name
[10] == '2' && name
[11] == '\0')
644 if (name
[9] == '6' && name
[10] == '4' && name
[11] == '\0')
661 if (name
[4] == 'F' && name
[5] == 'A' && name
[6] == 'S'
664 if (name
[8] == '8' && name
[9] == '\0')
680 if (name
[8] == '1' && name
[9] == '6' && name
[10] == '\0')
696 if (name
[8] == '3' && name
[9] == '2' && name
[10] == '\0')
712 if (name
[8] == '6' && name
[9] == '4' && name
[10] == '\0')
729 if (name
[4] == 'M' && name
[5] == 'A' && name
[6] == 'X'
746 if (name
[4] == 'P' && name
[5] == 'T' && name
[6] == 'R'
765 /* Test for a glibc specific printf() format directive flag. */
766 if (name
[0] == 'I' && name
[1] == '\0')
769 || ((__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 2)) \
770 && !defined __UCLIBC__)
771 /* The 'I' flag, in numeric format directives, replaces ASCII digits
772 with the 'outdigits' defined in the LC_CTYPE locale facet. This is
773 used for Farsi (Persian), some Indic languages, and maybe Arabic. */
779 /* Other system dependent strings are not valid. */
783 /* Load the message catalogs specified by FILENAME. If it is no valid
784 message catalog do nothing. */
787 _nl_load_domain (struct loaded_l10nfile
*domain_file
,
788 struct binding
*domainbinding
)
790 __libc_lock_define_initialized_recursive (static, lock
);
798 struct mo_file_header
*data
= (struct mo_file_header
*) -1;
800 struct loaded_domain
*domain
;
802 const char *nullentry
;
805 __libc_lock_lock_recursive (lock
);
806 if (domain_file
->decided
!= 0)
808 /* There are two possibilities:
810 + this is the same thread calling again during this initialization
811 via _nl_find_msg. We have initialized everything this call needs.
813 + this is another thread which tried to initialize this object.
814 Not necessary anymore since if the lock is available this
820 domain_file
->decided
= -1;
821 domain_file
->data
= NULL
;
823 /* Note that it would be useless to store domainbinding in domain_file
824 because domainbinding might be == NULL now but != NULL later (after
825 a call to bind_textdomain_codeset). */
827 /* If the record does not represent a valid locale the FILENAME
828 might be NULL. This can happen when according to the given
829 specification the locale file name is different for XPG and CEN
831 if (domain_file
->filename
== NULL
)
834 /* Try to open the addressed file. */
835 fd
= open (domain_file
->filename
, O_RDONLY
| O_BINARY
);
839 /* We must know about the size of the file. */
842 __builtin_expect (fstat64 (fd
, &st
) != 0, 0)
844 __builtin_expect (fstat (fd
, &st
) != 0, 0)
846 || __builtin_expect ((size
= (size_t) st
.st_size
) != st
.st_size
, 0)
847 || __builtin_expect (size
< sizeof (struct mo_file_header
), 0))
848 /* Something went wrong. */
852 /* Now we are ready to load the file. If mmap() is available we try
853 this first. If not available or it failed we try to load it. */
854 data
= (struct mo_file_header
*) mmap (NULL
, size
, PROT_READ
,
857 if (__builtin_expect (data
!= MAP_FAILED
, 1))
859 /* mmap() call was successful. */
865 assert (MAP_FAILED
== (void *) -1);
868 /* If the data is not yet available (i.e. mmap'ed) we try to load
870 if (data
== (struct mo_file_header
*) -1)
875 data
= (struct mo_file_header
*) malloc (size
);
880 read_ptr
= (char *) data
;
883 long int nb
= (long int) read (fd
, read_ptr
, to_read
);
887 if (nb
== -1 && errno
== EINTR
)
901 /* Using the magic number we can test whether it really is a message
903 if (__builtin_expect (data
->magic
!= _MAGIC
&& data
->magic
!= _MAGIC_SWAPPED
,
906 /* The magic number is wrong: not a message catalog file. */
909 munmap ((caddr_t
) data
, size
);
916 domain
= (struct loaded_domain
*) malloc (sizeof (struct loaded_domain
));
919 domain_file
->data
= domain
;
921 domain
->data
= (char *) data
;
922 domain
->use_mmap
= use_mmap
;
923 domain
->mmap_size
= size
;
924 domain
->must_swap
= data
->magic
!= _MAGIC
;
925 domain
->malloced
= NULL
;
927 /* Fill in the information about the available tables. */
928 revision
= W (domain
->must_swap
, data
->revision
);
929 /* We support only the major revisions 0 and 1. */
930 switch (revision
>> 16)
934 domain
->nstrings
= W (domain
->must_swap
, data
->nstrings
);
935 domain
->orig_tab
= (const struct string_desc
*)
936 ((char *) data
+ W (domain
->must_swap
, data
->orig_tab_offset
));
937 domain
->trans_tab
= (const struct string_desc
*)
938 ((char *) data
+ W (domain
->must_swap
, data
->trans_tab_offset
));
939 domain
->hash_size
= W (domain
->must_swap
, data
->hash_tab_size
);
941 (domain
->hash_size
> 2
942 ? (const nls_uint32
*)
943 ((char *) data
+ W (domain
->must_swap
, data
->hash_tab_offset
))
945 domain
->must_swap_hash_tab
= domain
->must_swap
;
947 /* Now dispatch on the minor revision. */
948 switch (revision
& 0xffff)
951 domain
->n_sysdep_strings
= 0;
952 domain
->orig_sysdep_tab
= NULL
;
953 domain
->trans_sysdep_tab
= NULL
;
958 nls_uint32 n_sysdep_strings
;
960 if (domain
->hash_tab
== NULL
)
961 /* This is invalid. These minor revisions need a hash table. */
965 W (domain
->must_swap
, data
->n_sysdep_strings
);
966 if (n_sysdep_strings
> 0)
968 nls_uint32 n_sysdep_segments
;
969 const struct sysdep_segment
*sysdep_segments
;
970 const char **sysdep_segment_values
;
971 const nls_uint32
*orig_sysdep_tab
;
972 const nls_uint32
*trans_sysdep_tab
;
973 nls_uint32 n_inmem_sysdep_strings
;
976 struct sysdep_string_desc
*inmem_orig_sysdep_tab
;
977 struct sysdep_string_desc
*inmem_trans_sysdep_tab
;
978 nls_uint32
*inmem_hash_tab
;
981 /* Get the values of the system dependent segments. */
983 W (domain
->must_swap
, data
->n_sysdep_segments
);
984 sysdep_segments
= (const struct sysdep_segment
*)
986 + W (domain
->must_swap
, data
->sysdep_segments_offset
));
987 sysdep_segment_values
=
989 alloca (n_sysdep_segments
* sizeof (const char *));
990 for (i
= 0; i
< n_sysdep_segments
; i
++)
994 + W (domain
->must_swap
, sysdep_segments
[i
].offset
);
996 W (domain
->must_swap
, sysdep_segments
[i
].length
);
998 if (!(namelen
> 0 && name
[namelen
- 1] == '\0'))
1000 freea (sysdep_segment_values
);
1004 sysdep_segment_values
[i
] = get_sysdep_segment_value (name
);
1007 orig_sysdep_tab
= (const nls_uint32
*)
1009 + W (domain
->must_swap
, data
->orig_sysdep_tab_offset
));
1010 trans_sysdep_tab
= (const nls_uint32
*)
1012 + W (domain
->must_swap
, data
->trans_sysdep_tab_offset
));
1014 /* Compute the amount of additional memory needed for the
1015 system dependent strings and the augmented hash table.
1016 At the same time, also drop string pairs which refer to
1017 an undefined system dependent segment. */
1018 n_inmem_sysdep_strings
= 0;
1019 memneed
= domain
->hash_size
* sizeof (nls_uint32
);
1020 for (i
= 0; i
< n_sysdep_strings
; i
++)
1025 for (j
= 0; j
< 2; j
++)
1027 const struct sysdep_string
*sysdep_string
=
1028 (const struct sysdep_string
*)
1030 + W (domain
->must_swap
,
1032 ? orig_sysdep_tab
[i
]
1033 : trans_sysdep_tab
[i
]));
1035 const struct segment_pair
*p
= sysdep_string
->segments
;
1037 if (W (domain
->must_swap
, p
->sysdepref
) != SEGMENTS_END
)
1038 for (p
= sysdep_string
->segments
;; p
++)
1040 nls_uint32 sysdepref
;
1042 need
+= W (domain
->must_swap
, p
->segsize
);
1044 sysdepref
= W (domain
->must_swap
, p
->sysdepref
);
1045 if (sysdepref
== SEGMENTS_END
)
1048 if (sysdepref
>= n_sysdep_segments
)
1051 freea (sysdep_segment_values
);
1055 if (sysdep_segment_values
[sysdepref
] == NULL
)
1057 /* This particular string pair is invalid. */
1062 need
+= strlen (sysdep_segment_values
[sysdepref
]);
1072 n_inmem_sysdep_strings
++;
1073 memneed
+= needs
[0] + needs
[1];
1076 memneed
+= 2 * n_inmem_sysdep_strings
1077 * sizeof (struct sysdep_string_desc
);
1079 if (n_inmem_sysdep_strings
> 0)
1083 /* Allocate additional memory. */
1084 mem
= (char *) malloc (memneed
);
1088 domain
->malloced
= mem
;
1089 inmem_orig_sysdep_tab
= (struct sysdep_string_desc
*) mem
;
1090 mem
+= n_inmem_sysdep_strings
1091 * sizeof (struct sysdep_string_desc
);
1092 inmem_trans_sysdep_tab
= (struct sysdep_string_desc
*) mem
;
1093 mem
+= n_inmem_sysdep_strings
1094 * sizeof (struct sysdep_string_desc
);
1095 inmem_hash_tab
= (nls_uint32
*) mem
;
1096 mem
+= domain
->hash_size
* sizeof (nls_uint32
);
1098 /* Compute the system dependent strings. */
1100 for (i
= 0; i
< n_sysdep_strings
; i
++)
1104 for (j
= 0; j
< 2; j
++)
1106 const struct sysdep_string
*sysdep_string
=
1107 (const struct sysdep_string
*)
1109 + W (domain
->must_swap
,
1111 ? orig_sysdep_tab
[i
]
1112 : trans_sysdep_tab
[i
]));
1113 const struct segment_pair
*p
=
1114 sysdep_string
->segments
;
1116 if (W (domain
->must_swap
, p
->sysdepref
)
1118 for (p
= sysdep_string
->segments
;; p
++)
1120 nls_uint32 sysdepref
;
1123 W (domain
->must_swap
, p
->sysdepref
);
1124 if (sysdepref
== SEGMENTS_END
)
1127 if (sysdep_segment_values
[sysdepref
] == NULL
)
1129 /* This particular string pair is
1142 for (j
= 0; j
< 2; j
++)
1144 const struct sysdep_string
*sysdep_string
=
1145 (const struct sysdep_string
*)
1147 + W (domain
->must_swap
,
1149 ? orig_sysdep_tab
[i
]
1150 : trans_sysdep_tab
[i
]));
1151 const char *static_segments
=
1153 + W (domain
->must_swap
, sysdep_string
->offset
);
1154 const struct segment_pair
*p
=
1155 sysdep_string
->segments
;
1157 /* Concatenate the segments, and fill
1158 inmem_orig_sysdep_tab[k] (for j == 0) and
1159 inmem_trans_sysdep_tab[k] (for j == 1). */
1161 struct sysdep_string_desc
*inmem_tab_entry
=
1163 ? inmem_orig_sysdep_tab
1164 : inmem_trans_sysdep_tab
)
1167 if (W (domain
->must_swap
, p
->sysdepref
)
1170 /* Only one static segment. */
1171 inmem_tab_entry
->length
=
1172 W (domain
->must_swap
, p
->segsize
);
1173 inmem_tab_entry
->pointer
= static_segments
;
1177 inmem_tab_entry
->pointer
= mem
;
1179 for (p
= sysdep_string
->segments
;; p
++)
1181 nls_uint32 segsize
=
1182 W (domain
->must_swap
, p
->segsize
);
1183 nls_uint32 sysdepref
=
1184 W (domain
->must_swap
, p
->sysdepref
);
1189 memcpy (mem
, static_segments
, segsize
);
1191 static_segments
+= segsize
;
1194 if (sysdepref
== SEGMENTS_END
)
1197 n
= strlen (sysdep_segment_values
[sysdepref
]);
1198 memcpy (mem
, sysdep_segment_values
[sysdepref
], n
);
1202 inmem_tab_entry
->length
=
1203 mem
- inmem_tab_entry
->pointer
;
1210 if (k
!= n_inmem_sysdep_strings
)
1213 /* Compute the augmented hash table. */
1214 for (i
= 0; i
< domain
->hash_size
; i
++)
1216 W (domain
->must_swap_hash_tab
, domain
->hash_tab
[i
]);
1217 for (i
= 0; i
< n_inmem_sysdep_strings
; i
++)
1219 const char *msgid
= inmem_orig_sysdep_tab
[i
].pointer
;
1220 nls_uint32 hash_val
= __hash_string (msgid
);
1221 nls_uint32 idx
= hash_val
% domain
->hash_size
;
1223 1 + (hash_val
% (domain
->hash_size
- 2));
1227 if (inmem_hash_tab
[idx
] == 0)
1229 /* Hash table entry is empty. Use it. */
1230 inmem_hash_tab
[idx
] = 1 + domain
->nstrings
+ i
;
1234 if (idx
>= domain
->hash_size
- incr
)
1235 idx
-= domain
->hash_size
- incr
;
1241 domain
->n_sysdep_strings
= n_inmem_sysdep_strings
;
1242 domain
->orig_sysdep_tab
= inmem_orig_sysdep_tab
;
1243 domain
->trans_sysdep_tab
= inmem_trans_sysdep_tab
;
1245 domain
->hash_tab
= inmem_hash_tab
;
1246 domain
->must_swap_hash_tab
= 0;
1250 domain
->n_sysdep_strings
= 0;
1251 domain
->orig_sysdep_tab
= NULL
;
1252 domain
->trans_sysdep_tab
= NULL
;
1255 freea (sysdep_segment_values
);
1259 domain
->n_sysdep_strings
= 0;
1260 domain
->orig_sysdep_tab
= NULL
;
1261 domain
->trans_sysdep_tab
= NULL
;
1268 /* This is an invalid revision. */
1270 /* This is an invalid .mo file or we ran out of resources. */
1271 free (domain
->malloced
);
1274 munmap ((caddr_t
) data
, size
);
1279 domain_file
->data
= NULL
;
1283 /* No caches of converted translations so far. */
1284 domain
->conversions
= NULL
;
1285 domain
->nconversions
= 0;
1287 __libc_rwlock_init (domain
->conversions_lock
);
1289 gl_rwlock_init (domain
->conversions_lock
);
1292 /* Get the header entry and look for a plural specification. */
1293 #ifdef IN_LIBGLOCALE
1295 _nl_find_msg (domain_file
, domainbinding
, NULL
, "", &nullentrylen
);
1297 nullentry
= _nl_find_msg (domain_file
, domainbinding
, "", 0, &nullentrylen
);
1299 if (__builtin_expect (nullentry
== (char *) -1, 0))
1302 __libc_rwlock_fini (domain
->conversions_lock
);
1306 EXTRACT_PLURAL_EXPRESSION (nullentry
, &domain
->plural
, &domain
->nplurals
);
1312 domain_file
->decided
= 1;
1315 __libc_lock_unlock_recursive (lock
);
1321 internal_function __libc_freeres_fn_section
1322 _nl_unload_domain (struct loaded_domain
*domain
)
1326 if (domain
->plural
!= &__gettext_germanic_plural
)
1327 __gettext_free_exp ((struct expression
*) domain
->plural
);
1329 for (i
= 0; i
< domain
->nconversions
; i
++)
1331 struct converted_domain
*convd
= &domain
->conversions
[i
];
1333 free ((char *) convd
->encoding
);
1334 if (convd
->conv_tab
!= NULL
&& convd
->conv_tab
!= (char **) -1)
1335 free (convd
->conv_tab
);
1336 if (convd
->conv
!= (__gconv_t
) -1)
1337 __gconv_close (convd
->conv
);
1339 free (domain
->conversions
);
1340 __libc_rwlock_fini (domain
->conversions_lock
);
1342 free (domain
->malloced
);
1344 # ifdef _POSIX_MAPPED_FILES
1345 if (domain
->use_mmap
)
1346 munmap ((caddr_t
) domain
->data
, domain
->mmap_size
);
1348 # endif /* _POSIX_MAPPED_FILES */
1349 free ((void *) domain
->data
);