/* Load needed message catalogs.

   Copyright (C) 1995-2018 Free Software Foundation, Inc.

   This program is free software: you can redistribute it and/or modify

   it under the terms of the GNU Lesser General Public License as published by

   the Free Software Foundation; either version 2.1 of the License, or

   (at your option) any later version.

   This program is distributed in the hope that it will be useful,

   but WITHOUT ANY WARRANTY; without even the implied warranty of

   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

   GNU Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public License

   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */

/* Tell glibc's <string.h> to provide a prototype for mempcpy().

   This must come before <config.h> because <config.h> may include

   <features.h>, and once <features.h> has been included, it's too late.  */

#ifndef _GNU_SOURCE

# define _GNU_SOURCE    1

#endif

#ifdef HAVE_CONFIG_H

# include <config.h>

#endif

#include <assert.h>

#include <ctype.h>

#include <errno.h>

#include <fcntl.h>

#include <sys/types.h>

#include <sys/stat.h>

#include <stdlib.h>

#include <string.h>

#if defined HAVE_UNISTD_H || defined _LIBC

# include <unistd.h>

#endif

#ifdef _LIBC

# include <langinfo.h>

# include <locale.h>

#endif

#if (defined HAVE_MMAP && defined HAVE_MUNMAP && !defined DISALLOW_MMAP) \

    || (defined _LIBC && defined _POSIX_MAPPED_FILES)

# include <sys/mman.h>

# undef HAVE_MMAP

# define HAVE_MMAP	1

#else

# undef HAVE_MMAP

#endif

#if defined HAVE_STDINT_H_WITH_UINTMAX || defined _LIBC

# include <stdint.h>

#endif

#if defined HAVE_INTTYPES_H || defined _LIBC

# include <inttypes.h>

#endif

#include "gmo.h"

#include "gettextP.h"

#include "hash-string.h"

#include "plural-exp.h"

#ifdef _LIBC

# include "../locale/localeinfo.h"

# include <not-cancel.h>

#endif

/* Handle multi-threaded applications.  */

#ifdef _LIBC

# include <libc-lock.h>

#else

# include "lock.h"

#endif

#ifdef _LIBC

# define PRI_MACROS_BROKEN 0

#endif

/* Provide fallback values for macros that ought to be defined in <inttypes.h>.

   Note that our fallback values need not be literal strings, because we don't

   use them with preprocessor string concatenation.  */

#if !defined PRId8 || PRI_MACROS_BROKEN

# undef PRId8

# define PRId8 "d"

#endif

#if !defined PRIi8 || PRI_MACROS_BROKEN

# undef PRIi8

# define PRIi8 "i"

#endif

#if !defined PRIo8 || PRI_MACROS_BROKEN

# undef PRIo8

# define PRIo8 "o"

#endif

#if !defined PRIu8 || PRI_MACROS_BROKEN

# undef PRIu8

# define PRIu8 "u"

#endif

#if !defined PRIx8 || PRI_MACROS_BROKEN

# undef PRIx8

# define PRIx8 "x"

#endif

#if !defined PRIX8 || PRI_MACROS_BROKEN

# undef PRIX8

# define PRIX8 "X"

#endif

#if !defined PRId16 || PRI_MACROS_BROKEN

# undef PRId16

# define PRId16 "d"

#endif

#if !defined PRIi16 || PRI_MACROS_BROKEN

# undef PRIi16

# define PRIi16 "i"

#endif

#if !defined PRIo16 || PRI_MACROS_BROKEN

# undef PRIo16

# define PRIo16 "o"

#endif

#if !defined PRIu16 || PRI_MACROS_BROKEN

# undef PRIu16

# define PRIu16 "u"

#endif

#if !defined PRIx16 || PRI_MACROS_BROKEN

# undef PRIx16

# define PRIx16 "x"

#endif

#if !defined PRIX16 || PRI_MACROS_BROKEN

# undef PRIX16

# define PRIX16 "X"

#endif

#if !defined PRId32 || PRI_MACROS_BROKEN

# undef PRId32

# define PRId32 "d"

#endif

#if !defined PRIi32 || PRI_MACROS_BROKEN

# undef PRIi32

# define PRIi32 "i"

#endif

#if !defined PRIo32 || PRI_MACROS_BROKEN

# undef PRIo32

# define PRIo32 "o"

#endif

#if !defined PRIu32 || PRI_MACROS_BROKEN

# undef PRIu32

# define PRIu32 "u"

#endif

#if !defined PRIx32 || PRI_MACROS_BROKEN

# undef PRIx32

# define PRIx32 "x"

#endif

#if !defined PRIX32 || PRI_MACROS_BROKEN

# undef PRIX32

# define PRIX32 "X"

#endif

#if !defined PRId64 || PRI_MACROS_BROKEN

# undef PRId64

# define PRId64 (sizeof (long) == 8 ? "ld" : "lld")

#endif

#if !defined PRIi64 || PRI_MACROS_BROKEN

# undef PRIi64

# define PRIi64 (sizeof (long) == 8 ? "li" : "lli")

#endif

#if !defined PRIo64 || PRI_MACROS_BROKEN

# undef PRIo64

# define PRIo64 (sizeof (long) == 8 ? "lo" : "llo")

#endif

#if !defined PRIu64 || PRI_MACROS_BROKEN

# undef PRIu64

# define PRIu64 (sizeof (long) == 8 ? "lu" : "llu")

#endif

#if !defined PRIx64 || PRI_MACROS_BROKEN

# undef PRIx64

# define PRIx64 (sizeof (long) == 8 ? "lx" : "llx")

#endif

#if !defined PRIX64 || PRI_MACROS_BROKEN

# undef PRIX64

# define PRIX64 (sizeof (long) == 8 ? "lX" : "llX")

#endif

#if !defined PRIdLEAST8 || PRI_MACROS_BROKEN

# undef PRIdLEAST8

# define PRIdLEAST8 "d"

#endif

#if !defined PRIiLEAST8 || PRI_MACROS_BROKEN

# undef PRIiLEAST8

# define PRIiLEAST8 "i"

#endif

#if !defined PRIoLEAST8 || PRI_MACROS_BROKEN

# undef PRIoLEAST8

# define PRIoLEAST8 "o"

#endif

#if !defined PRIuLEAST8 || PRI_MACROS_BROKEN

# undef PRIuLEAST8

# define PRIuLEAST8 "u"

#endif

#if !defined PRIxLEAST8 || PRI_MACROS_BROKEN

# undef PRIxLEAST8

# define PRIxLEAST8 "x"

#endif

#if !defined PRIXLEAST8 || PRI_MACROS_BROKEN

# undef PRIXLEAST8

# define PRIXLEAST8 "X"

#endif

#if !defined PRIdLEAST16 || PRI_MACROS_BROKEN

# undef PRIdLEAST16

# define PRIdLEAST16 "d"

#endif

#if !defined PRIiLEAST16 || PRI_MACROS_BROKEN

# undef PRIiLEAST16

# define PRIiLEAST16 "i"

#endif

#if !defined PRIoLEAST16 || PRI_MACROS_BROKEN

# undef PRIoLEAST16

# define PRIoLEAST16 "o"

#endif

#if !defined PRIuLEAST16 || PRI_MACROS_BROKEN

# undef PRIuLEAST16

# define PRIuLEAST16 "u"

#endif

#if !defined PRIxLEAST16 || PRI_MACROS_BROKEN

# undef PRIxLEAST16

# define PRIxLEAST16 "x"

#endif

#if !defined PRIXLEAST16 || PRI_MACROS_BROKEN

# undef PRIXLEAST16

# define PRIXLEAST16 "X"

#endif

#if !defined PRIdLEAST32 || PRI_MACROS_BROKEN

# undef PRIdLEAST32

# define PRIdLEAST32 "d"

#endif

#if !defined PRIiLEAST32 || PRI_MACROS_BROKEN

# undef PRIiLEAST32

# define PRIiLEAST32 "i"

#endif

#if !defined PRIoLEAST32 || PRI_MACROS_BROKEN

# undef PRIoLEAST32

# define PRIoLEAST32 "o"

#endif

#if !defined PRIuLEAST32 || PRI_MACROS_BROKEN

# undef PRIuLEAST32

# define PRIuLEAST32 "u"

#endif

#if !defined PRIxLEAST32 || PRI_MACROS_BROKEN

# undef PRIxLEAST32

# define PRIxLEAST32 "x"

#endif

#if !defined PRIXLEAST32 || PRI_MACROS_BROKEN

# undef PRIXLEAST32

# define PRIXLEAST32 "X"

#endif

#if !defined PRIdLEAST64 || PRI_MACROS_BROKEN

# undef PRIdLEAST64

# define PRIdLEAST64 PRId64

#endif

#if !defined PRIiLEAST64 || PRI_MACROS_BROKEN

# undef PRIiLEAST64

# define PRIiLEAST64 PRIi64

#endif

#if !defined PRIoLEAST64 || PRI_MACROS_BROKEN

# undef PRIoLEAST64

# define PRIoLEAST64 PRIo64

#endif

#if !defined PRIuLEAST64 || PRI_MACROS_BROKEN

# undef PRIuLEAST64

# define PRIuLEAST64 PRIu64

#endif

#if !defined PRIxLEAST64 || PRI_MACROS_BROKEN

# undef PRIxLEAST64

# define PRIxLEAST64 PRIx64

#endif

#if !defined PRIXLEAST64 || PRI_MACROS_BROKEN

# undef PRIXLEAST64

# define PRIXLEAST64 PRIX64

#endif

#if !defined PRIdFAST8 || PRI_MACROS_BROKEN

# undef PRIdFAST8

# define PRIdFAST8 "d"

#endif

#if !defined PRIiFAST8 || PRI_MACROS_BROKEN

# undef PRIiFAST8

# define PRIiFAST8 "i"

#endif

#if !defined PRIoFAST8 || PRI_MACROS_BROKEN

# undef PRIoFAST8

# define PRIoFAST8 "o"

#endif

#if !defined PRIuFAST8 || PRI_MACROS_BROKEN

# undef PRIuFAST8

# define PRIuFAST8 "u"

#endif

#if !defined PRIxFAST8 || PRI_MACROS_BROKEN

# undef PRIxFAST8

# define PRIxFAST8 "x"

#endif

#if !defined PRIXFAST8 || PRI_MACROS_BROKEN

# undef PRIXFAST8

# define PRIXFAST8 "X"

#endif

#if !defined PRIdFAST16 || PRI_MACROS_BROKEN

# undef PRIdFAST16

# define PRIdFAST16 "d"

#endif

#if !defined PRIiFAST16 || PRI_MACROS_BROKEN

# undef PRIiFAST16

# define PRIiFAST16 "i"

#endif

#if !defined PRIoFAST16 || PRI_MACROS_BROKEN

# undef PRIoFAST16

# define PRIoFAST16 "o"

#endif

#if !defined PRIuFAST16 || PRI_MACROS_BROKEN

# undef PRIuFAST16

# define PRIuFAST16 "u"

#endif

#if !defined PRIxFAST16 || PRI_MACROS_BROKEN

# undef PRIxFAST16

# define PRIxFAST16 "x"

#endif

#if !defined PRIXFAST16 || PRI_MACROS_BROKEN

# undef PRIXFAST16

# define PRIXFAST16 "X"

#endif

#if !defined PRIdFAST32 || PRI_MACROS_BROKEN

# undef PRIdFAST32

# define PRIdFAST32 "d"

#endif

#if !defined PRIiFAST32 || PRI_MACROS_BROKEN

# undef PRIiFAST32

# define PRIiFAST32 "i"

#endif

#if !defined PRIoFAST32 || PRI_MACROS_BROKEN

# undef PRIoFAST32

# define PRIoFAST32 "o"

#endif

#if !defined PRIuFAST32 || PRI_MACROS_BROKEN

# undef PRIuFAST32

# define PRIuFAST32 "u"

#endif

#if !defined PRIxFAST32 || PRI_MACROS_BROKEN

# undef PRIxFAST32

# define PRIxFAST32 "x"

#endif

#if !defined PRIXFAST32 || PRI_MACROS_BROKEN

# undef PRIXFAST32

# define PRIXFAST32 "X"

#endif

#if !defined PRIdFAST64 || PRI_MACROS_BROKEN

# undef PRIdFAST64

# define PRIdFAST64 PRId64

#endif

#if !defined PRIiFAST64 || PRI_MACROS_BROKEN

# undef PRIiFAST64

# define PRIiFAST64 PRIi64

#endif

#if !defined PRIoFAST64 || PRI_MACROS_BROKEN

# undef PRIoFAST64

# define PRIoFAST64 PRIo64

#endif

#if !defined PRIuFAST64 || PRI_MACROS_BROKEN

# undef PRIuFAST64

# define PRIuFAST64 PRIu64

#endif

#if !defined PRIxFAST64 || PRI_MACROS_BROKEN

# undef PRIxFAST64

# define PRIxFAST64 PRIx64

#endif

#if !defined PRIXFAST64 || PRI_MACROS_BROKEN

# undef PRIXFAST64

# define PRIXFAST64 PRIX64

#endif

#if !defined PRIdMAX || PRI_MACROS_BROKEN

# undef PRIdMAX

# define PRIdMAX (sizeof (uintmax_t) == sizeof (long) ? "ld" : "lld")

#endif

#if !defined PRIiMAX || PRI_MACROS_BROKEN

# undef PRIiMAX

# define PRIiMAX (sizeof (uintmax_t) == sizeof (long) ? "li" : "lli")

#endif

#if !defined PRIoMAX || PRI_MACROS_BROKEN

# undef PRIoMAX

# define PRIoMAX (sizeof (uintmax_t) == sizeof (long) ? "lo" : "llo")

#endif

#if !defined PRIuMAX || PRI_MACROS_BROKEN

# undef PRIuMAX

# define PRIuMAX (sizeof (uintmax_t) == sizeof (long) ? "lu" : "llu")

#endif

#if !defined PRIxMAX || PRI_MACROS_BROKEN

# undef PRIxMAX

# define PRIxMAX (sizeof (uintmax_t) == sizeof (long) ? "lx" : "llx")

#endif

#if !defined PRIXMAX || PRI_MACROS_BROKEN

# undef PRIXMAX

# define PRIXMAX (sizeof (uintmax_t) == sizeof (long) ? "lX" : "llX")

#endif

#if !defined PRIdPTR || PRI_MACROS_BROKEN

# undef PRIdPTR

# define PRIdPTR \

  (sizeof (void *) == sizeof (long) ? "ld" : \

   sizeof (void *) == sizeof (int) ? "d" : \

   "lld")

#endif

#if !defined PRIiPTR || PRI_MACROS_BROKEN

# undef PRIiPTR

# define PRIiPTR \

  (sizeof (void *) == sizeof (long) ? "li" : \

   sizeof (void *) == sizeof (int) ? "i" : \

   "lli")

#endif

#if !defined PRIoPTR || PRI_MACROS_BROKEN

# undef PRIoPTR

# define PRIoPTR \

  (sizeof (void *) == sizeof (long) ? "lo" : \

   sizeof (void *) == sizeof (int) ? "o" : \

   "llo")

#endif

#if !defined PRIuPTR || PRI_MACROS_BROKEN

# undef PRIuPTR

# define PRIuPTR \

  (sizeof (void *) == sizeof (long) ? "lu" : \

   sizeof (void *) == sizeof (int) ? "u" : \

   "llu")

#endif

#if !defined PRIxPTR || PRI_MACROS_BROKEN

# undef PRIxPTR

# define PRIxPTR \

  (sizeof (void *) == sizeof (long) ? "lx" : \

   sizeof (void *) == sizeof (int) ? "x" : \

   "llx")

#endif

#if !defined PRIXPTR || PRI_MACROS_BROKEN

# undef PRIXPTR

# define PRIXPTR \

  (sizeof (void *) == sizeof (long) ? "lX" : \

   sizeof (void *) == sizeof (int) ? "X" : \

   "llX")

#endif

/* @@ end of prolog @@ */

#ifdef _LIBC

/* Rename the non ISO C functions.  This is required by the standard

   because some ISO C functions will require linking with this object

   file and the name space must not be polluted.  */

# define open(name, flags)	__open_nocancel (name, flags)

# define close(fd)		__close_nocancel_nostatus (fd)

# define read(fd, buf, n)	__read_nocancel (fd, buf, n)

# define mmap(addr, len, prot, flags, fd, offset) \

  __mmap (addr, len, prot, flags, fd, offset)

# define munmap(addr, len)	__munmap (addr, len)

#endif

/* For systems that distinguish between text and binary I/O.

   O_BINARY is usually declared in <fcntl.h>. */

#if !defined O_BINARY && defined _O_BINARY

  /* For MSC-compatible compilers.  */

# define O_BINARY _O_BINARY

# define O_TEXT _O_TEXT

#endif

#ifdef __BEOS__

  /* BeOS 5 has O_BINARY and O_TEXT, but they have no effect.  */

# undef O_BINARY

# undef O_TEXT

#endif

/* On reasonable systems, binary I/O is the default.  */

#ifndef O_BINARY

# define O_BINARY 0

#endif

/* We need a sign, whether a new catalog was loaded, which can be associated

   with all translations.  This is important if the translations are

   cached by one of GCC's features.  */

int _nl_msg_cat_cntr;

/* Expand a system dependent string segment.  Return NULL if unsupported.  */

static const char *

get_sysdep_segment_value (const char *name)

{

  /* Test for an ISO C 99 section 7.8.1 format string directive.

     Syntax:

     P R I { d | i | o | u | x | X }

     { { | LEAST | FAST } { 8 | 16 | 32 | 64 } | MAX | PTR }  */

  /* We don't use a table of 14 times 6 'const char *' strings here, because

     data relocations cost startup time.  */

  if (name[0] == 'P' && name[1] == 'R' && name[2] == 'I')

    {

      if (name[3] == 'd' || name[3] == 'i' || name[3] == 'o' || name[3] == 'u'

	  || name[3] == 'x' || name[3] == 'X')

	{

	  if (name[4] == '8' && name[5] == '\0')

	    {

	      if (name[3] == 'd')

		return PRId8;

	      if (name[3] == 'i')

		return PRIi8;

	      if (name[3] == 'o')

		return PRIo8;

	      if (name[3] == 'u')

		return PRIu8;

	      if (name[3] == 'x')

		return PRIx8;

	      if (name[3] == 'X')

		return PRIX8;

	      abort ();

	    }

	  if (name[4] == '1' && name[5] == '6' && name[6] == '\0')

	    {

	      if (name[3] == 'd')

		return PRId16;

	      if (name[3] == 'i')

		return PRIi16;

	      if (name[3] == 'o')

		return PRIo16;

	      if (name[3] == 'u')

		return PRIu16;

	      if (name[3] == 'x')

		return PRIx16;

	      if (name[3] == 'X')

		return PRIX16;

	      abort ();

	    }

	  if (name[4] == '3' && name[5] == '2' && name[6] == '\0')

	    {

	      if (name[3] == 'd')

		return PRId32;

	      if (name[3] == 'i')

		return PRIi32;

	      if (name[3] == 'o')

		return PRIo32;

	      if (name[3] == 'u')

		return PRIu32;

	      if (name[3] == 'x')

		return PRIx32;

	      if (name[3] == 'X')

		return PRIX32;

	      abort ();

	    }

	  if (name[4] == '6' && name[5] == '4' && name[6] == '\0')

	    {

	      if (name[3] == 'd')

		return PRId64;

	      if (name[3] == 'i')

		return PRIi64;

	      if (name[3] == 'o')

		return PRIo64;

	      if (name[3] == 'u')

		return PRIu64;

	      if (name[3] == 'x')

		return PRIx64;

	      if (name[3] == 'X')

		return PRIX64;

	      abort ();

	    }

	  if (name[4] == 'L' && name[5] == 'E' && name[6] == 'A'

	      && name[7] == 'S' && name[8] == 'T')

	    {

	      if (name[9] == '8' && name[10] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdLEAST8;

		  if (name[3] == 'i')

		    return PRIiLEAST8;

		  if (name[3] == 'o')

		    return PRIoLEAST8;

		  if (name[3] == 'u')

		    return PRIuLEAST8;

		  if (name[3] == 'x')

		    return PRIxLEAST8;

		  if (name[3] == 'X')

		    return PRIXLEAST8;

		  abort ();

		}

	      if (name[9] == '1' && name[10] == '6' && name[11] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdLEAST16;

		  if (name[3] == 'i')

		    return PRIiLEAST16;

		  if (name[3] == 'o')

		    return PRIoLEAST16;

		  if (name[3] == 'u')

		    return PRIuLEAST16;

		  if (name[3] == 'x')

		    return PRIxLEAST16;

		  if (name[3] == 'X')

		    return PRIXLEAST16;

		  abort ();

		}

	      if (name[9] == '3' && name[10] == '2' && name[11] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdLEAST32;

		  if (name[3] == 'i')

		    return PRIiLEAST32;

		  if (name[3] == 'o')

		    return PRIoLEAST32;

		  if (name[3] == 'u')

		    return PRIuLEAST32;

		  if (name[3] == 'x')

		    return PRIxLEAST32;

		  if (name[3] == 'X')

		    return PRIXLEAST32;

		  abort ();

		}

	      if (name[9] == '6' && name[10] == '4' && name[11] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdLEAST64;

		  if (name[3] == 'i')

		    return PRIiLEAST64;

		  if (name[3] == 'o')

		    return PRIoLEAST64;

		  if (name[3] == 'u')

		    return PRIuLEAST64;

		  if (name[3] == 'x')

		    return PRIxLEAST64;

		  if (name[3] == 'X')

		    return PRIXLEAST64;

		  abort ();

		}

	    }

	  if (name[4] == 'F' && name[5] == 'A' && name[6] == 'S'

	      && name[7] == 'T')

	    {

	      if (name[8] == '8' && name[9] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdFAST8;

		  if (name[3] == 'i')

		    return PRIiFAST8;

		  if (name[3] == 'o')

		    return PRIoFAST8;

		  if (name[3] == 'u')

		    return PRIuFAST8;

		  if (name[3] == 'x')

		    return PRIxFAST8;

		  if (name[3] == 'X')

		    return PRIXFAST8;

		  abort ();

		}

	      if (name[8] == '1' && name[9] == '6' && name[10] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdFAST16;

		  if (name[3] == 'i')

		    return PRIiFAST16;

		  if (name[3] == 'o')

		    return PRIoFAST16;

		  if (name[3] == 'u')

		    return PRIuFAST16;

		  if (name[3] == 'x')

		    return PRIxFAST16;

		  if (name[3] == 'X')

		    return PRIXFAST16;

		  abort ();

		}

	      if (name[8] == '3' && name[9] == '2' && name[10] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdFAST32;

		  if (name[3] == 'i')

		    return PRIiFAST32;

		  if (name[3] == 'o')

		    return PRIoFAST32;

		  if (name[3] == 'u')

		    return PRIuFAST32;

		  if (name[3] == 'x')

		    return PRIxFAST32;

		  if (name[3] == 'X')

		    return PRIXFAST32;

		  abort ();

		}

	      if (name[8] == '6' && name[9] == '4' && name[10] == '\0')

		{

		  if (name[3] == 'd')

		    return PRIdFAST64;

		  if (name[3] == 'i')

		    return PRIiFAST64;

		  if (name[3] == 'o')

		    return PRIoFAST64;

		  if (name[3] == 'u')

		    return PRIuFAST64;

		  if (name[3] == 'x')

		    return PRIxFAST64;

		  if (name[3] == 'X')

		    return PRIXFAST64;

		  abort ();

		}

	    }

	  if (name[4] == 'M' && name[5] == 'A' && name[6] == 'X'

	      && name[7] == '\0')

	    {

	      if (name[3] == 'd')

		return PRIdMAX;

	      if (name[3] == 'i')

		return PRIiMAX;

	      if (name[3] == 'o')

		return PRIoMAX;

	      if (name[3] == 'u')

		return PRIuMAX;

	      if (name[3] == 'x')

		return PRIxMAX;

	      if (name[3] == 'X')

		return PRIXMAX;

	      abort ();

	    }

	  if (name[4] == 'P' && name[5] == 'T' && name[6] == 'R'

	      && name[7] == '\0')

	    {

	      if (name[3] == 'd')

		return PRIdPTR;

	      if (name[3] == 'i')

		return PRIiPTR;

	      if (name[3] == 'o')

		return PRIoPTR;

	      if (name[3] == 'u')

		return PRIuPTR;

	      if (name[3] == 'x')

		return PRIxPTR;

	      if (name[3] == 'X')

		return PRIXPTR;

	      abort ();

	    }

	}

    }

  /* Test for a glibc specific printf() format directive flag.  */

  if (name[0] == 'I' && name[1] == '\0')

    {

#if defined _LIBC \

    || ((__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 2)) \

        && !defined __UCLIBC__)

      /* The 'I' flag, in numeric format directives, replaces ASCII digits

	 with the 'outdigits' defined in the LC_CTYPE locale facet.  This is

	 used for Farsi (Persian), some Indic languages, and maybe Arabic.  */

      return "I";

#else

      return "";

#endif

    }

  /* Other system dependent strings are not valid.  */

  return NULL;

}

/* Load the message catalogs specified by FILENAME.  If it is no valid

   message catalog do nothing.  */

void

_nl_load_domain (struct loaded_l10nfile *domain_file,

		 struct binding *domainbinding)

{

  __libc_lock_define_initialized_recursive (static, lock);

  int fd = -1;

  size_t size;

#ifdef _LIBC

  struct stat64 st;

#else

  struct stat st;

#endif

  struct mo_file_header *data = (struct mo_file_header *) -1;

  int use_mmap = 0;

  struct loaded_domain *domain;

  int revision;

  const char *nullentry;

  size_t nullentrylen;

  __libc_lock_lock_recursive (lock);

  if (domain_file->decided != 0)

    {

      /* There are two possibilities:

	 + this is the same thread calling again during this initialization

	   via _nl_find_msg.  We have initialized everything this call needs.

	 + this is another thread which tried to initialize this object.

	   Not necessary anymore since if the lock is available this

	   is finished.

      */

      goto done;

    }

  domain_file->decided = -1;

  domain_file->data = NULL;

  /* Note that it would be useless to store domainbinding in domain_file

     because domainbinding might be == NULL now but != NULL later (after

     a call to bind_textdomain_codeset).  */

  /* If the record does not represent a valid locale the FILENAME

     might be NULL.  This can happen when according to the given

     specification the locale file name is different for XPG and CEN

     syntax.  */

  if (domain_file->filename == NULL)

    goto out;

  /* Try to open the addressed file.  */

  fd = open (domain_file->filename, O_RDONLY | O_BINARY);

  if (fd == -1)

    goto out;

  /* We must know about the size of the file.  */

  if (

#ifdef _LIBC

      __builtin_expect (fstat64 (fd, &st) != 0, 0)

#else

      __builtin_expect (fstat (fd, &st) != 0, 0)

#endif

      || __builtin_expect ((size = (size_t) st.st_size) != st.st_size, 0)

      || __builtin_expect (size < sizeof (struct mo_file_header), 0))

    /* Something went wrong.  */

    goto out;

#ifdef HAVE_MMAP

  /* Now we are ready to load the file.  If mmap() is available we try

     this first.  If not available or it failed we try to load it.  */

  data = (struct mo_file_header *) mmap (NULL, size, PROT_READ,

					 MAP_PRIVATE, fd, 0);

  if (__builtin_expect (data != MAP_FAILED, 1))

    {

      /* mmap() call was successful.  */

      close (fd);

      fd = -1;

      use_mmap = 1;

    }

  assert (MAP_FAILED == (void *) -1);

#endif

  /* If the data is not yet available (i.e. mmap'ed) we try to load

     it manually.  */

  if (data == (struct mo_file_header *) -1)

    {

      size_t to_read;

      char *read_ptr;

      data = (struct mo_file_header *) malloc (size);

      if (data == NULL)

	goto out;

      to_read = size;

      read_ptr = (char *) data;

      do

	{

	  long int nb = (long int) read (fd, read_ptr, to_read);

	  if (nb <= 0)

	    {

#ifdef EINTR

	      if (nb == -1 && errno == EINTR)

		continue;

#endif

	      goto out;

	    }

	  read_ptr += nb;

	  to_read -= nb;

	}

      while (to_read > 0);

      close (fd);

      fd = -1;

    }

  /* Using the magic number we can test whether it really is a message

     catalog file.  */

  if (__builtin_expect (data->magic != _MAGIC && data->magic != _MAGIC_SWAPPED,

			0))

    {

      /* The magic number is wrong: not a message catalog file.  */

#ifdef HAVE_MMAP

      if (use_mmap)

	munmap ((caddr_t) data, size);

      else

#endif

	free (data);

      goto out;

    }