/* Handle aliases for locale names.
|
/* Handle aliases for locale names.
|
Copyright (C) 1995, 1996, 1997, 1998 Free Software Foundation, Inc.
|
Copyright (C) 1995, 1996, 1997, 1998 Free Software Foundation, Inc.
|
Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
|
Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 2, or (at your option)
|
the Free Software Foundation; either version 2, or (at your option)
|
any later version.
|
any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software Foundation,
|
along with this program; if not, write to the Free Software Foundation,
|
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
|
|
#ifdef HAVE_CONFIG_H
|
#ifdef HAVE_CONFIG_H
|
# include <config.h>
|
# include <config.h>
|
#endif
|
#endif
|
|
|
#include <ctype.h>
|
#include <ctype.h>
|
#include <stdio.h>
|
#include <stdio.h>
|
#include <sys/types.h>
|
#include <sys/types.h>
|
|
|
#ifdef __GNUC__
|
#ifdef __GNUC__
|
# define alloca __builtin_alloca
|
# define alloca __builtin_alloca
|
# define HAVE_ALLOCA 1
|
# define HAVE_ALLOCA 1
|
#else
|
#else
|
# if defined HAVE_ALLOCA_H || defined _LIBC
|
# if defined HAVE_ALLOCA_H || defined _LIBC
|
# include <alloca.h>
|
# include <alloca.h>
|
# else
|
# else
|
# ifdef _AIX
|
# ifdef _AIX
|
#pragma alloca
|
#pragma alloca
|
# else
|
# else
|
# ifndef alloca
|
# ifndef alloca
|
char *alloca ();
|
char *alloca ();
|
# endif
|
# endif
|
# endif
|
# endif
|
# endif
|
# endif
|
#endif
|
#endif
|
|
|
#if defined STDC_HEADERS || defined _LIBC
|
#if defined STDC_HEADERS || defined _LIBC
|
# include <stdlib.h>
|
# include <stdlib.h>
|
#else
|
#else
|
char *getenv ();
|
char *getenv ();
|
# ifdef HAVE_MALLOC_H
|
# ifdef HAVE_MALLOC_H
|
# include <malloc.h>
|
# include <malloc.h>
|
# else
|
# else
|
void free ();
|
void free ();
|
# endif
|
# endif
|
#endif
|
#endif
|
|
|
#if defined HAVE_STRING_H || defined _LIBC
|
#if defined HAVE_STRING_H || defined _LIBC
|
# ifndef _GNU_SOURCE
|
# ifndef _GNU_SOURCE
|
# define _GNU_SOURCE 1
|
# define _GNU_SOURCE 1
|
# endif
|
# endif
|
# include <string.h>
|
# include <string.h>
|
#else
|
#else
|
# include <strings.h>
|
# include <strings.h>
|
# ifndef memcpy
|
# ifndef memcpy
|
# define memcpy(Dst, Src, Num) bcopy (Src, Dst, Num)
|
# define memcpy(Dst, Src, Num) bcopy (Src, Dst, Num)
|
# endif
|
# endif
|
#endif
|
#endif
|
#if !HAVE_STRCHR && !defined _LIBC
|
#if !HAVE_STRCHR && !defined _LIBC
|
# ifndef strchr
|
# ifndef strchr
|
# define strchr index
|
# define strchr index
|
# endif
|
# endif
|
#endif
|
#endif
|
|
|
#include "gettext.h"
|
#include "gettext.h"
|
#include "gettextP.h"
|
#include "gettextP.h"
|
|
|
/* @@ end of prolog @@ */
|
/* @@ end of prolog @@ */
|
|
|
#ifdef _LIBC
|
#ifdef _LIBC
|
/* Rename the non ANSI C functions. This is required by the standard
|
/* Rename the non ANSI C functions. This is required by the standard
|
because some ANSI C functions will require linking with this object
|
because some ANSI C functions will require linking with this object
|
file and the name space must not be polluted. */
|
file and the name space must not be polluted. */
|
# define strcasecmp __strcasecmp
|
# define strcasecmp __strcasecmp
|
|
|
# define mempcpy __mempcpy
|
# define mempcpy __mempcpy
|
# define HAVE_MEMPCPY 1
|
# define HAVE_MEMPCPY 1
|
|
|
/* We need locking here since we can be called from different places. */
|
/* We need locking here since we can be called from different places. */
|
# include <bits/libc-lock.h>
|
# include <bits/libc-lock.h>
|
|
|
__libc_lock_define_initialized (static, lock);
|
__libc_lock_define_initialized (static, lock);
|
#endif
|
#endif
|
|
|
|
|
/* For those loosing systems which don't have `alloca' we have to add
|
/* For those loosing systems which don't have `alloca' we have to add
|
some additional code emulating it. */
|
some additional code emulating it. */
|
#ifdef HAVE_ALLOCA
|
#ifdef HAVE_ALLOCA
|
/* Nothing has to be done. */
|
/* Nothing has to be done. */
|
# define ADD_BLOCK(list, address) /* nothing */
|
# define ADD_BLOCK(list, address) /* nothing */
|
# define FREE_BLOCKS(list) /* nothing */
|
# define FREE_BLOCKS(list) /* nothing */
|
#else
|
#else
|
struct block_list
|
struct block_list
|
{
|
{
|
void *address;
|
void *address;
|
struct block_list *next;
|
struct block_list *next;
|
};
|
};
|
# define ADD_BLOCK(list, addr) \
|
# define ADD_BLOCK(list, addr) \
|
do { \
|
do { \
|
struct block_list *newp = (struct block_list *) malloc (sizeof (*newp)); \
|
struct block_list *newp = (struct block_list *) malloc (sizeof (*newp)); \
|
/* If we cannot get a free block we cannot add the new element to \
|
/* If we cannot get a free block we cannot add the new element to \
|
the list. */ \
|
the list. */ \
|
if (newp != NULL) { \
|
if (newp != NULL) { \
|
newp->address = (addr); \
|
newp->address = (addr); \
|
newp->next = (list); \
|
newp->next = (list); \
|
(list) = newp; \
|
(list) = newp; \
|
} \
|
} \
|
} while (0)
|
} while (0)
|
# define FREE_BLOCKS(list) \
|
# define FREE_BLOCKS(list) \
|
do { \
|
do { \
|
while (list != NULL) { \
|
while (list != NULL) { \
|
struct block_list *old = list; \
|
struct block_list *old = list; \
|
list = list->next; \
|
list = list->next; \
|
free (old); \
|
free (old); \
|
} \
|
} \
|
} while (0)
|
} while (0)
|
# undef alloca
|
# undef alloca
|
# define alloca(size) (malloc (size))
|
# define alloca(size) (malloc (size))
|
#endif /* have alloca */
|
#endif /* have alloca */
|
|
|
|
|
struct alias_map
|
struct alias_map
|
{
|
{
|
const char *alias;
|
const char *alias;
|
const char *value;
|
const char *value;
|
};
|
};
|
|
|
|
|
static char *string_space = NULL;
|
static char *string_space = NULL;
|
static size_t string_space_act = 0;
|
static size_t string_space_act = 0;
|
static size_t string_space_max = 0;
|
static size_t string_space_max = 0;
|
static struct alias_map *map;
|
static struct alias_map *map;
|
static size_t nmap = 0;
|
static size_t nmap = 0;
|
static size_t maxmap = 0;
|
static size_t maxmap = 0;
|
|
|
|
|
/* Prototypes for local functions. */
|
/* Prototypes for local functions. */
|
static size_t read_alias_file PARAMS ((const char *fname, int fname_len))
|
static size_t read_alias_file PARAMS ((const char *fname, int fname_len))
|
internal_function;
|
internal_function;
|
static void extend_alias_table PARAMS ((void));
|
static void extend_alias_table PARAMS ((void));
|
static int alias_compare PARAMS ((const struct alias_map *map1,
|
static int alias_compare PARAMS ((const struct alias_map *map1,
|
const struct alias_map *map2));
|
const struct alias_map *map2));
|
|
|
|
|
const char *
|
const char *
|
_nl_expand_alias (name)
|
_nl_expand_alias (name)
|
const char *name;
|
const char *name;
|
{
|
{
|
static const char *locale_alias_path = LOCALE_ALIAS_PATH;
|
static const char *locale_alias_path = LOCALE_ALIAS_PATH;
|
struct alias_map *retval;
|
struct alias_map *retval;
|
const char *result = NULL;
|
const char *result = NULL;
|
size_t added;
|
size_t added;
|
|
|
#ifdef _LIBC
|
#ifdef _LIBC
|
__libc_lock_lock (lock);
|
__libc_lock_lock (lock);
|
#endif
|
#endif
|
|
|
do
|
do
|
{
|
{
|
struct alias_map item;
|
struct alias_map item;
|
|
|
item.alias = name;
|
item.alias = name;
|
|
|
if (nmap > 0)
|
if (nmap > 0)
|
retval = (struct alias_map *) bsearch (&item, map, nmap,
|
retval = (struct alias_map *) bsearch (&item, map, nmap,
|
sizeof (struct alias_map),
|
sizeof (struct alias_map),
|
(int (*) PARAMS ((const void *,
|
(int (*) PARAMS ((const void *,
|
const void *))
|
const void *))
|
) alias_compare);
|
) alias_compare);
|
else
|
else
|
retval = NULL;
|
retval = NULL;
|
|
|
/* We really found an alias. Return the value. */
|
/* We really found an alias. Return the value. */
|
if (retval != NULL)
|
if (retval != NULL)
|
{
|
{
|
result = retval->value;
|
result = retval->value;
|
break;
|
break;
|
}
|
}
|
|
|
/* Perhaps we can find another alias file. */
|
/* Perhaps we can find another alias file. */
|
added = 0;
|
added = 0;
|
while (added == 0 && locale_alias_path[0] != '\0')
|
while (added == 0 && locale_alias_path[0] != '\0')
|
{
|
{
|
const char *start;
|
const char *start;
|
|
|
while (locale_alias_path[0] == ':')
|
while (locale_alias_path[0] == ':')
|
++locale_alias_path;
|
++locale_alias_path;
|
start = locale_alias_path;
|
start = locale_alias_path;
|
|
|
while (locale_alias_path[0] != '\0' && locale_alias_path[0] != ':')
|
while (locale_alias_path[0] != '\0' && locale_alias_path[0] != ':')
|
++locale_alias_path;
|
++locale_alias_path;
|
|
|
if (start < locale_alias_path)
|
if (start < locale_alias_path)
|
added = read_alias_file (start, locale_alias_path - start);
|
added = read_alias_file (start, locale_alias_path - start);
|
}
|
}
|
}
|
}
|
while (added != 0);
|
while (added != 0);
|
|
|
#ifdef _LIBC
|
#ifdef _LIBC
|
__libc_lock_unlock (lock);
|
__libc_lock_unlock (lock);
|
#endif
|
#endif
|
|
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
static size_t
|
static size_t
|
internal_function
|
internal_function
|
read_alias_file (fname, fname_len)
|
read_alias_file (fname, fname_len)
|
const char *fname;
|
const char *fname;
|
int fname_len;
|
int fname_len;
|
{
|
{
|
#ifndef HAVE_ALLOCA
|
#ifndef HAVE_ALLOCA
|
struct block_list *block_list = NULL;
|
struct block_list *block_list = NULL;
|
#endif
|
#endif
|
FILE *fp;
|
FILE *fp;
|
char *full_fname;
|
char *full_fname;
|
size_t added;
|
size_t added;
|
static const char aliasfile[] = "/locale.alias";
|
static const char aliasfile[] = "/locale.alias";
|
|
|
full_fname = (char *) alloca (fname_len + sizeof aliasfile);
|
full_fname = (char *) alloca (fname_len + sizeof aliasfile);
|
ADD_BLOCK (block_list, full_fname);
|
ADD_BLOCK (block_list, full_fname);
|
#ifdef HAVE_MEMPCPY
|
#ifdef HAVE_MEMPCPY
|
mempcpy (mempcpy (full_fname, fname, fname_len),
|
mempcpy (mempcpy (full_fname, fname, fname_len),
|
aliasfile, sizeof aliasfile);
|
aliasfile, sizeof aliasfile);
|
#else
|
#else
|
memcpy (full_fname, fname, fname_len);
|
memcpy (full_fname, fname, fname_len);
|
memcpy (&full_fname[fname_len], aliasfile, sizeof aliasfile);
|
memcpy (&full_fname[fname_len], aliasfile, sizeof aliasfile);
|
#endif
|
#endif
|
|
|
fp = fopen (full_fname, "r");
|
fp = fopen (full_fname, "r");
|
if (fp == NULL)
|
if (fp == NULL)
|
{
|
{
|
FREE_BLOCKS (block_list);
|
FREE_BLOCKS (block_list);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
added = 0;
|
added = 0;
|
while (!feof (fp))
|
while (!feof (fp))
|
{
|
{
|
/* It is a reasonable approach to use a fix buffer here because
|
/* It is a reasonable approach to use a fix buffer here because
|
a) we are only interested in the first two fields
|
a) we are only interested in the first two fields
|
b) these fields must be usable as file names and so must not
|
b) these fields must be usable as file names and so must not
|
be that long
|
be that long
|
*/
|
*/
|
unsigned char buf[BUFSIZ];
|
unsigned char buf[BUFSIZ];
|
unsigned char *alias;
|
unsigned char *alias;
|
unsigned char *value;
|
unsigned char *value;
|
unsigned char *cp;
|
unsigned char *cp;
|
|
|
if (fgets (buf, sizeof buf, fp) == NULL)
|
if (fgets (buf, sizeof buf, fp) == NULL)
|
/* EOF reached. */
|
/* EOF reached. */
|
break;
|
break;
|
|
|
/* Possibly not the whole line fits into the buffer. Ignore
|
/* Possibly not the whole line fits into the buffer. Ignore
|
the rest of the line. */
|
the rest of the line. */
|
if (strchr (buf, '\n') == NULL)
|
if (strchr (buf, '\n') == NULL)
|
{
|
{
|
char altbuf[BUFSIZ];
|
char altbuf[BUFSIZ];
|
do
|
do
|
if (fgets (altbuf, sizeof altbuf, fp) == NULL)
|
if (fgets (altbuf, sizeof altbuf, fp) == NULL)
|
/* Make sure the inner loop will be left. The outer loop
|
/* Make sure the inner loop will be left. The outer loop
|
will exit at the `feof' test. */
|
will exit at the `feof' test. */
|
break;
|
break;
|
while (strchr (altbuf, '\n') == NULL);
|
while (strchr (altbuf, '\n') == NULL);
|
}
|
}
|
|
|
cp = buf;
|
cp = buf;
|
/* Ignore leading white space. */
|
/* Ignore leading white space. */
|
while (isspace (cp[0]))
|
while (isspace (cp[0]))
|
++cp;
|
++cp;
|
|
|
/* A leading '#' signals a comment line. */
|
/* A leading '#' signals a comment line. */
|
if (cp[0] != '\0' && cp[0] != '#')
|
if (cp[0] != '\0' && cp[0] != '#')
|
{
|
{
|
alias = cp++;
|
alias = cp++;
|
while (cp[0] != '\0' && !isspace (cp[0]))
|
while (cp[0] != '\0' && !isspace (cp[0]))
|
++cp;
|
++cp;
|
/* Terminate alias name. */
|
/* Terminate alias name. */
|
if (cp[0] != '\0')
|
if (cp[0] != '\0')
|
*cp++ = '\0';
|
*cp++ = '\0';
|
|
|
/* Now look for the beginning of the value. */
|
/* Now look for the beginning of the value. */
|
while (isspace (cp[0]))
|
while (isspace (cp[0]))
|
++cp;
|
++cp;
|
|
|
if (cp[0] != '\0')
|
if (cp[0] != '\0')
|
{
|
{
|
size_t alias_len;
|
size_t alias_len;
|
size_t value_len;
|
size_t value_len;
|
|
|
value = cp++;
|
value = cp++;
|
while (cp[0] != '\0' && !isspace (cp[0]))
|
while (cp[0] != '\0' && !isspace (cp[0]))
|
++cp;
|
++cp;
|
/* Terminate value. */
|
/* Terminate value. */
|
if (cp[0] == '\n')
|
if (cp[0] == '\n')
|
{
|
{
|
/* This has to be done to make the following test
|
/* This has to be done to make the following test
|
for the end of line possible. We are looking for
|
for the end of line possible. We are looking for
|
the terminating '\n' which do not overwrite here. */
|
the terminating '\n' which do not overwrite here. */
|
*cp++ = '\0';
|
*cp++ = '\0';
|
*cp = '\n';
|
*cp = '\n';
|
}
|
}
|
else if (cp[0] != '\0')
|
else if (cp[0] != '\0')
|
*cp++ = '\0';
|
*cp++ = '\0';
|
|
|
if (nmap >= maxmap)
|
if (nmap >= maxmap)
|
extend_alias_table ();
|
extend_alias_table ();
|
|
|
alias_len = strlen (alias) + 1;
|
alias_len = strlen (alias) + 1;
|
value_len = strlen (value) + 1;
|
value_len = strlen (value) + 1;
|
|
|
if (string_space_act + alias_len + value_len > string_space_max)
|
if (string_space_act + alias_len + value_len > string_space_max)
|
{
|
{
|
/* Increase size of memory pool. */
|
/* Increase size of memory pool. */
|
size_t new_size = (string_space_max
|
size_t new_size = (string_space_max
|
+ (alias_len + value_len > 1024
|
+ (alias_len + value_len > 1024
|
? alias_len + value_len : 1024));
|
? alias_len + value_len : 1024));
|
char *new_pool = (char *) realloc (string_space, new_size);
|
char *new_pool = (char *) realloc (string_space, new_size);
|
if (new_pool == NULL)
|
if (new_pool == NULL)
|
{
|
{
|
FREE_BLOCKS (block_list);
|
FREE_BLOCKS (block_list);
|
return added;
|
return added;
|
}
|
}
|
string_space = new_pool;
|
string_space = new_pool;
|
string_space_max = new_size;
|
string_space_max = new_size;
|
}
|
}
|
|
|
map[nmap].alias = memcpy (&string_space[string_space_act],
|
map[nmap].alias = memcpy (&string_space[string_space_act],
|
alias, alias_len);
|
alias, alias_len);
|
string_space_act += alias_len;
|
string_space_act += alias_len;
|
|
|
map[nmap].value = memcpy (&string_space[string_space_act],
|
map[nmap].value = memcpy (&string_space[string_space_act],
|
value, value_len);
|
value, value_len);
|
string_space_act += value_len;
|
string_space_act += value_len;
|
|
|
++nmap;
|
++nmap;
|
++added;
|
++added;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Should we test for ferror()? I think we have to silently ignore
|
/* Should we test for ferror()? I think we have to silently ignore
|
errors. --drepper */
|
errors. --drepper */
|
fclose (fp);
|
fclose (fp);
|
|
|
if (added > 0)
|
if (added > 0)
|
qsort (map, nmap, sizeof (struct alias_map),
|
qsort (map, nmap, sizeof (struct alias_map),
|
(int (*) PARAMS ((const void *, const void *))) alias_compare);
|
(int (*) PARAMS ((const void *, const void *))) alias_compare);
|
|
|
FREE_BLOCKS (block_list);
|
FREE_BLOCKS (block_list);
|
return added;
|
return added;
|
}
|
}
|
|
|
|
|
static void
|
static void
|
extend_alias_table ()
|
extend_alias_table ()
|
{
|
{
|
size_t new_size;
|
size_t new_size;
|
struct alias_map *new_map;
|
struct alias_map *new_map;
|
|
|
new_size = maxmap == 0 ? 100 : 2 * maxmap;
|
new_size = maxmap == 0 ? 100 : 2 * maxmap;
|
new_map = (struct alias_map *) realloc (map, (new_size
|
new_map = (struct alias_map *) realloc (map, (new_size
|
* sizeof (struct alias_map)));
|
* sizeof (struct alias_map)));
|
if (new_map == NULL)
|
if (new_map == NULL)
|
/* Simply don't extend: we don't have any more core. */
|
/* Simply don't extend: we don't have any more core. */
|
return;
|
return;
|
|
|
map = new_map;
|
map = new_map;
|
maxmap = new_size;
|
maxmap = new_size;
|
}
|
}
|
|
|
|
|
#ifdef _LIBC
|
#ifdef _LIBC
|
static void __attribute__ ((unused))
|
static void __attribute__ ((unused))
|
free_mem (void)
|
free_mem (void)
|
{
|
{
|
if (string_space != NULL)
|
if (string_space != NULL)
|
free (string_space);
|
free (string_space);
|
if (map != NULL)
|
if (map != NULL)
|
free (map);
|
free (map);
|
}
|
}
|
text_set_element (__libc_subfreeres, free_mem);
|
text_set_element (__libc_subfreeres, free_mem);
|
#endif
|
#endif
|
|
|
|
|
static int
|
static int
|
alias_compare (map1, map2)
|
alias_compare (map1, map2)
|
const struct alias_map *map1;
|
const struct alias_map *map1;
|
const struct alias_map *map2;
|
const struct alias_map *map2;
|
{
|
{
|
#if defined _LIBC || defined HAVE_STRCASECMP
|
#if defined _LIBC || defined HAVE_STRCASECMP
|
return strcasecmp (map1->alias, map2->alias);
|
return strcasecmp (map1->alias, map2->alias);
|
#else
|
#else
|
const unsigned char *p1 = (const unsigned char *) map1->alias;
|
const unsigned char *p1 = (const unsigned char *) map1->alias;
|
const unsigned char *p2 = (const unsigned char *) map2->alias;
|
const unsigned char *p2 = (const unsigned char *) map2->alias;
|
unsigned char c1, c2;
|
unsigned char c1, c2;
|
|
|
if (p1 == p2)
|
if (p1 == p2)
|
return 0;
|
return 0;
|
|
|
do
|
do
|
{
|
{
|
/* I know this seems to be odd but the tolower() function in
|
/* I know this seems to be odd but the tolower() function in
|
some systems libc cannot handle nonalpha characters. */
|
some systems libc cannot handle nonalpha characters. */
|
c1 = isupper (*p1) ? tolower (*p1) : *p1;
|
c1 = isupper (*p1) ? tolower (*p1) : *p1;
|
c2 = isupper (*p2) ? tolower (*p2) : *p2;
|
c2 = isupper (*p2) ? tolower (*p2) : *p2;
|
if (c1 == '\0')
|
if (c1 == '\0')
|
break;
|
break;
|
++p1;
|
++p1;
|
++p2;
|
++p2;
|
}
|
}
|
while (c1 == c2);
|
while (c1 == c2);
|
|
|
return c1 - c2;
|
return c1 - c2;
|
#endif
|
#endif
|
}
|
}
|
|
|
