/* simple-gettext.c - a simplified version of gettext. * Copyright (C) 1995, 1996, 1997, 1999 Free Software Foundation, Inc. * * This file is part of GnuPG. * * GnuPG is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * GnuPG 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, * USA. */ /* This is a simplified version of gettext written by Ulrich Drepper. * It is used for the Win32 version of GnuPG beucase all the overhead * of gettext is not needed and we have to do some special Win32 stuff. * I decided that this is far easier than to tweak gettext for the special * cases (I tried it but it is a lot of code). wk 15.09.99 */ #include #ifdef USE_SIMPLE_GETTEXT #if !defined (_WIN32) && !defined (__CYGWIN32__) #error This file can only be used under Windows or Cygwin32 #endif #include #include #include #include #include #include #include #include "util.h" #include "sysutils.h" /* The magic number of the GNU message catalog format. */ #define MAGIC 0x950412de #define MAGIC_SWAPPED 0xde120495 /* Revision number of the currently used .mo (binary) file format. */ #define MO_REVISION_NUMBER 0 /* Header for binary .mo file format. */ struct mo_file_header { /* The magic number. */ u32 magic; /* The revision number of the file format. */ u32 revision; /* The number of strings pairs. */ u32 nstrings; /* Offset of table with start offsets of original strings. */ u32 orig_tab_offset; /* Offset of table with start offsets of translation strings. */ u32 trans_tab_offset; /* Size of hashing table. */ u32 hash_tab_size; /* Offset of first hashing entry. */ u32 hash_tab_offset; }; struct string_desc { /* Length of addressed string. */ u32 length; /* Offset of string in file. */ u32 offset; }; struct overflow_space_s { struct overflow_space_s *next; u32 idx; char d[1]; }; struct loaded_domain { char *data; int must_swap; u32 nstrings; char *mapped; /* 0 = not yet mapped, 1 = mapped, 2 = mapped to overflow space */ struct overflow_space_s *overflow_space; struct string_desc *orig_tab; struct string_desc *trans_tab; u32 hash_size; u32 *hash_tab; }; static struct loaded_domain *the_domain; static __inline__ u32 do_swap_u32( u32 i ) { return (i << 24) | ((i & 0xff00) << 8) | ((i >> 8) & 0xff00) | (i >> 24); } #define SWAPIT(flag, data) ((flag) ? do_swap_u32(data) : (data) ) /* We assume to have `unsigned long int' value with at least 32 bits. */ #define HASHWORDBITS 32 /* The so called `hashpjw' function by P.J. Weinberger [see Aho/Sethi/Ullman, COMPILERS: Principles, Techniques and Tools, 1986, 1987 Bell Telephone Laboratories, Inc.] */ static __inline__ ulong hash_string( const char *str_param ) { unsigned long int hval, g; const char *str = str_param; hval = 0; while (*str != '\0') { hval <<= 4; hval += (unsigned long int) *str++; g = hval & ((unsigned long int) 0xf << (HASHWORDBITS - 4)); if (g != 0) { hval ^= g >> (HASHWORDBITS - 8); hval ^= g; } } return hval; } static struct loaded_domain * load_domain( const char *filename ) { FILE *fp; size_t size; struct stat st; struct mo_file_header *data = NULL; struct loaded_domain *domain = NULL; size_t to_read; char *read_ptr; fp = fopen( filename, "rb" ); if( !fp ) return NULL; /* can't open the file */ /* we must know about the size of the file */ if( fstat( fileno(fp ), &st ) || (size = (size_t)st.st_size) != st.st_size || size < sizeof (struct mo_file_header) ) { fclose( fp ); return NULL; } data = malloc( size ); if( !data ) { fclose( fp ); return NULL; /* out of memory */ } to_read = size; read_ptr = (char *) data; do { long int nb = fread( read_ptr, 1, to_read, fp ); if( nb < to_read ) { fclose (fp); free(data); return NULL; /* read error */ } read_ptr += nb; to_read -= nb; } while( to_read > 0 ); fclose (fp); /* Using the magic number we can test whether it really is a message * catalog file. */ if( data->magic != MAGIC && data->magic != MAGIC_SWAPPED ) { /* The magic number is wrong: not a message catalog file. */ free( data ); return NULL; } domain = calloc( 1, sizeof *domain ); if( !domain ) { free( data ); return NULL; } domain->data = (char *) data; domain->must_swap = data->magic != MAGIC; /* Fill in the information about the available tables. */ switch( SWAPIT(domain->must_swap, data->revision) ) { case 0: domain->nstrings = SWAPIT(domain->must_swap, data->nstrings); domain->orig_tab = (struct string_desc *) ((char *) data + SWAPIT(domain->must_swap, data->orig_tab_offset)); domain->trans_tab = (struct string_desc *) ((char *) data + SWAPIT(domain->must_swap, data->trans_tab_offset)); domain->hash_size = SWAPIT(domain->must_swap, data->hash_tab_size); domain->hash_tab = (u32 *) ((char *) data + SWAPIT(domain->must_swap, data->hash_tab_offset)); break; default: /* This is an invalid revision. */ free( data ); free( domain ); return NULL; } /* Allocate an array to keep track of code page mappings. */ domain->mapped = calloc( 1, domain->nstrings ); if( !domain->mapped ) { free( data ); free( domain ); return NULL; } return domain; } /**************** * Set the file used for translations. Pass a NULL to disable * translation. A new filename may be set at anytime. * WARNING: After changing the filename you should not access any data * retrieved by gettext(). */ int set_gettext_file( const char *filename ) { struct loaded_domain *domain = NULL; if( filename && *filename ) { if( filename[0] == '/' #ifdef HAVE_DRIVE_LETTERS || ( isalpha(filename[0]) && filename[1] == ':' && (filename[2] == '/' || filename[2] == '\\') ) #endif ) { /* absolute path - use it as is */ domain = load_domain( filename ); } else { /* relative path - append ".mo" and get dir from the environment */ char *buf = NULL; char *dir; char *p; dir = read_w32_registry_string( NULL, "Control Panel\\Mingw32\\NLS", "MODir" ); if( dir && (buf=malloc(strlen(dir)+strlen(filename)+1+3+1)) ) { strcpy(stpcpy(stpcpy(stpcpy( buf, dir),"\\"), filename),".mo"); /* Better make sure that we don't mix forward and backward slashes. It seems that some Windoze versions don't accept this. */ for (p=buf; *p; p++) { if (*p == '/') *p = '\\'; } domain = load_domain( buf ); free(buf); } free(dir); } if( !domain ) return -1; } if( the_domain ) { struct overflow_space_s *os, *os2; free( the_domain->data ); free( the_domain->mapped ); for (os=the_domain->overflow_space; os; os = os2) { os2 = os->next; free (os); } free( the_domain ); the_domain = NULL; } the_domain = domain; return 0; } static const char* get_string( struct loaded_domain *domain, u32 idx ) { struct overflow_space_s *os; char *p; p = domain->data + SWAPIT(domain->must_swap, domain->trans_tab[idx].offset); if (!domain->mapped[idx]) { size_t plen, buflen; char *buf; domain->mapped[idx] = 1; plen = strlen (p); buf = utf8_to_native (p, plen, -1); buflen = strlen (buf); if (buflen <= plen) strcpy (p, buf); else { /* There is not enough space for the translation - store it in the overflow_space else and mark that in the mapped array. Because we expect that this won't happen too often, we use a simple linked list. */ os = malloc (sizeof *os + buflen); if (os) { os->idx = idx; strcpy (os->d, buf); os->next = domain->overflow_space; domain->overflow_space = os; p = os->d; } else p = "ERROR in GETTEXT MALLOC"; } xfree (buf); } else if (domain->mapped[idx] == 2) { /* We need to get the string from the overflow_space. */ for (os=domain->overflow_space; os; os = os->next) if (os->idx == idx) return (const char*)os->d; p = "ERROR in GETTEXT\n"; } return (const char*)p; } const char * gettext( const char *msgid ) { struct loaded_domain *domain; size_t act = 0; size_t top, bottom; if( !(domain = the_domain) ) goto not_found; /* Locate the MSGID and its translation. */ if( domain->hash_size > 2 && domain->hash_tab ) { /* Use the hashing table. */ u32 len = strlen (msgid); u32 hash_val = hash_string (msgid); u32 idx = hash_val % domain->hash_size; u32 incr = 1 + (hash_val % (domain->hash_size - 2)); u32 nstr = SWAPIT (domain->must_swap, domain->hash_tab[idx]); if ( !nstr ) /* Hash table entry is empty. */ goto not_found; if( SWAPIT(domain->must_swap, domain->orig_tab[nstr - 1].length) == len && !strcmp( msgid, domain->data + SWAPIT(domain->must_swap, domain->orig_tab[nstr - 1].offset)) ) return get_string( domain, nstr - 1 ); for(;;) { if (idx >= domain->hash_size - incr) idx -= domain->hash_size - incr; else idx += incr; nstr = SWAPIT(domain->must_swap, domain->hash_tab[idx]); if( !nstr ) goto not_found; /* Hash table entry is empty. */ if ( SWAPIT(domain->must_swap, domain->orig_tab[nstr - 1].length) == len && !strcmp (msgid, domain->data + SWAPIT(domain->must_swap, domain->orig_tab[nstr - 1].offset))) return get_string( domain, nstr-1 ); } /* NOTREACHED */ } /* Now we try the default method: binary search in the sorted array of messages. */ bottom = 0; top = domain->nstrings; while( bottom < top ) { int cmp_val; act = (bottom + top) / 2; cmp_val = strcmp(msgid, domain->data + SWAPIT(domain->must_swap, domain->orig_tab[act].offset)); if (cmp_val < 0) top = act; else if (cmp_val > 0) bottom = act + 1; else return get_string( domain, act ); } not_found: return msgid; } const char * ngettext (const char *msgid1, const char *msgid2, unsigned long int n) { /* We use the simple Germanic plural rule. */ return gettext (n==1? msgid1 : msgid2); } #if 0 unsigned int cp1, cp2; cp1 = GetConsoleCP(); cp2 = GetConsoleOutputCP(); log_info("InputCP=%u OutputCP=%u\n", cp1, cp2 ); if( !SetConsoleOutputCP( 1252 ) ) log_info("SetConsoleOutputCP failed: %s\n", w32_strerror (0)); cp1 = GetConsoleCP(); cp2 = GetConsoleOutputCP(); log_info("InputCP=%u OutputCP=%u after switch1\n", cp1, cp2 ); #endif #endif /* USE_SIMPLE_GETTEXT */