|* XXX We should test whether really an unspecified character *|
|* exists before giving the message. *|
\**************************************************************/
- u32_t weight;
+ u_int32_t weight;
error (0, 0, _("no definition of `UNDEFINED'"));
for (cnt = 0; cnt < collate->nrules; ++cnt)
{
- u32_t one = 1;
+ u_int32_t one = 1;
obstack_grow (&collate->element_mem, &one, sizeof (one));
}
collate_output (struct localedef_t *locale, const char *output_path)
{
struct locale_collate_t *collate = locale->categories[LC_COLLATE].collate;
- u32_t table_size, table_best, level_best, sum_best;
+ u_int32_t table_size, table_best, level_best, sum_best;
void *last;
element_t *pelem;
wchar_t *name;
const size_t nelems = _NL_ITEM_INDEX (_NL_NUM_LC_COLLATE);
struct iovec iov[2 + nelems];
struct locale_file data;
- u32_t idx[nelems];
+ u_int32_t idx[nelems];
struct obstack non_simple;
size_t cnt, entry_size;
- u32_t undefined_offset = UINT_MAX;
- u32_t *table, *extra, *table2, *extra2;
+ u_int32_t undefined_offset = UINT_MAX;
+ u_int32_t *table, *extra, *table2, *extra2;
size_t extra_len;
sum_best = UINT_MAX;
iov[1].iov_len = sizeof (idx);
iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_NRULES)].iov_base = &collate->nrules;
- iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_NRULES)].iov_len = sizeof (u32_t);
+ iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_NRULES)].iov_len = sizeof (u_int32_t);
- table = (u32_t *) alloca (collate->nrules * sizeof (u32_t));
+ table = (u_int32_t *) alloca (collate->nrules * sizeof (u_int32_t));
iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_RULES)].iov_base = table;
iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_RULES)].iov_len
- = collate->nrules * sizeof (u32_t);
+ = collate->nrules * sizeof (u_int32_t);
/* Another trick here. Describing the collation method needs only a
few bits (3, to be exact). But the binary file should be
accessible by maschines with both endianesses and so we store both
table[cnt] = collate->rules[cnt] | SWAPU32 (collate->rules[cnt]);
iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_HASH_SIZE)].iov_base = &table_best;
- iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_HASH_SIZE)].iov_len = sizeof (u32_t);
+ iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_HASH_SIZE)].iov_len = sizeof (u_int32_t);
iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_HASH_LAYERS)].iov_base = &level_best;
- iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_HASH_LAYERS)].iov_len = sizeof (u32_t);
+ iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_HASH_LAYERS)].iov_len
+ = sizeof (u_int32_t);
entry_size = 1 + MAX (collate->nrules, 2);
- table = (u32_t *) alloca (table_best * level_best * entry_size
- * sizeof (table[0]));
+ table = (u_int32_t *) alloca (table_best * level_best * entry_size
+ * sizeof (table[0]));
memset (table, '\0', table_best * level_best * entry_size
* sizeof (table[0]));
/* Macros for inserting in output table. */
#define ADD_VALUE(expr) \
do { \
- u32_t to_write = (u32_t) expr; \
+ u_int32_t to_write = (u_int32_t) expr; \
obstack_grow (&non_simple, &to_write, sizeof (to_write)); \
} while (0)
ADD_VALUE (len); \
\
wlen = wcslen (pelem->name); \
- obstack_grow (&non_simple, pelem->name, (wlen + 1) * sizeof (u32_t)); \
+ obstack_grow (&non_simple, pelem->name, (wlen + 1) * sizeof (u_int32_t)); \
\
idx = collate->nrules; \
for (cnt = 0; cnt < collate->nrules; ++cnt) \
table[(level * table_best + slot) * entry_size + 1] \
= FORWARD_CHAR; \
table[(level * table_best + slot) * entry_size + 2] \
- = obstack_object_size (&non_simple) / sizeof (u32_t); \
+ = obstack_object_size (&non_simple) / sizeof (u_int32_t); \
\
/* Here we have to construct the non-simple table entry. First \
compute the total length of this entry. */ \
for (runp = (pelem); runp != NULL; runp = runp->next) \
if (runp->ordering != NULL) \
{ \
- u32_t value; \
+ u_int32_t value; \
size_t cnt; \
\
value = 1 + wcslen (runp->name) + 1; \
{
/* We have to fill in the information from the UNDEFINED
entry. */
- table[cnt * entry_size] = (u32_t) cnt;
+ table[cnt * entry_size] = (u_int32_t) cnt;
if (collate->undefined.ordering_len == collate->nrules)
{
/* Finish the extra block. */
extra_len = obstack_object_size (&non_simple);
- extra = (u32_t *) obstack_finish (&non_simple);
- assert ((extra_len % sizeof (u32_t)) == 0);
+ extra = (u_int32_t *) obstack_finish (&non_simple);
+ assert ((extra_len % sizeof (u_int32_t)) == 0);
/* Now we have to build the two array for the other byte ordering. */
- table2 = (u32_t *) alloca (table_best * level_best * entry_size
- * sizeof (table[0]));
- extra2 = (u32_t *) alloca (extra_len);
+ table2 = (u_int32_t *) alloca (table_best * level_best * entry_size
+ * sizeof (table[0]));
+ extra2 = (u_int32_t *) alloca (extra_len);
for (cnt = 0; cnt < table_best * level_best * entry_size; ++cnt)
table2[cnt] = SWAPU32 (table[cnt]);
- for (cnt = 0; cnt < extra_len / sizeof (u32_t); ++cnt)
+ for (cnt = 0; cnt < extra_len / sizeof (u_int32_t); ++cnt)
extra2[cnt] = SWAPU32 (extra2[cnt]);
/* Store table adresses and lengths. */
#endif
iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_UNDEFINED)].iov_base = &undefined_offset;
- iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_UNDEFINED)].iov_len = sizeof (u32_t);
+ iov[2 + _NL_ITEM_INDEX (_NL_COLLATE_UNDEFINED)].iov_len = sizeof (u_int32_t);
/* Update idx array. */
idx[0] = iov[0].iov_len + iov[1].iov_len;
/* To be compatible with former implementations we for now restrict
the number of bits for character classes to 16. When compatibility
is not necessary anymore increase the number to 32. */
-#define char_class_t u16_t
+#define char_class_t u_int16_t
#define CHAR_CLASS_TRANS SWAPU16
-#define char_class32_t u32_t
+#define char_class32_t u_int32_t
#define CHAR_CLASS32_TRANS SWAPU32
size_t charnames_max;
size_t charnames_act;
- /* We will allow up to 8 * sizeof(u32_t) - 1 character classes. */
-#define MAX_NR_CHARCLASS (8 * sizeof (u32_t) - 1)
+ /* We will allow up to 8 * sizeof(u_int32_t) - 1 character classes. */
+#define MAX_NR_CHARCLASS (8 * sizeof (u_int32_t) - 1)
int nr_charclass;
const char *classnames[MAX_NR_CHARCLASS];
unsigned long int current_class_mask;
unsigned int last_class_char;
- u32_t *class_collection;
+ u_int32_t *class_collection;
size_t class_collection_max;
size_t class_collection_act;
unsigned long int class_done;
increase it. But I doubt it will. --drepper@gnu */
#define MAX_NR_CHARMAP 16
const char *mapnames[MAX_NR_CHARMAP];
- u32_t *map_collection[MAX_NR_CHARMAP];
+ u_int32_t *map_collection[MAX_NR_CHARMAP];
unsigned int map_collection_max[MAX_NR_CHARMAP];
unsigned int map_collection_act[MAX_NR_CHARMAP];
size_t map_collection_nr;
int tolower_done;
/* The arrays for the binary representation. */
- u32_t plane_size;
- u32_t plane_cnt;
+ u_int32_t plane_size;
+ u_int32_t plane_cnt;
char_class_t *ctype_b;
char_class32_t *ctype32_b;
- u32_t *names_el;
- u32_t *names_eb;
- u32_t **map_eb;
- u32_t **map_el;
- u32_t *class_name_ptr;
- u32_t *map_name_ptr;
+ u_int32_t *names_el;
+ u_int32_t *names_eb;
+ u_int32_t **map_eb;
+ u_int32_t **map_el;
+ u_int32_t *class_name_ptr;
+ u_int32_t *map_name_ptr;
unsigned char *width;
};
static void ctype_map_newP (struct linereader *lr,
struct locale_ctype_t *ctype,
const char *name, struct charset_t *charset);
-static u32_t *find_idx (struct locale_ctype_t *ctype, u32_t **table,
- size_t *max, size_t *act, unsigned int idx);
+static u_int32_t *find_idx (struct locale_ctype_t *ctype, u_int32_t **table,
+ size_t *max, size_t *act, unsigned int idx);
static void set_class_defaults (struct locale_ctype_t *ctype,
struct charset_t *charset);
static void allocate_arrays (struct locale_ctype_t *ctype,
ctype_class_newP (lr, ctype, "alnum");
ctype->class_collection_max = charset->mb_cur_max == 1 ? 256 : 512;
- ctype->class_collection = (u32_t *) xmalloc (sizeof (unsigned long int)
- * ctype->class_collection_max);
+ ctype->class_collection
+ = (u_int32_t *) xmalloc (sizeof (unsigned long int)
+ * ctype->class_collection_max);
memset (ctype->class_collection, '\0',
sizeof (unsigned long int) * ctype->class_collection_max);
ctype->class_collection_act = 256;
struct iovec iov[2 + nelems + ctype->nr_charclass
+ ctype->map_collection_nr];
struct locale_file data;
- u32_t idx[nelems];
+ u_int32_t idx[nelems];
size_t elem, cnt, offset, total;
CTYPE_DATA (_NL_CTYPE_TOUPPER_EB,
ctype->map_eb[0],
(ctype->plane_size * ctype->plane_cnt + 128)
- * sizeof (u32_t));
+ * sizeof (u_int32_t));
CTYPE_DATA (_NL_CTYPE_TOLOWER_EB,
ctype->map_eb[1],
(ctype->plane_size * ctype->plane_cnt + 128)
- * sizeof (u32_t));
+ * sizeof (u_int32_t));
CTYPE_DATA (_NL_CTYPE_TOUPPER_EL,
ctype->map_el[0],
(ctype->plane_size * ctype->plane_cnt + 128)
- * sizeof (u32_t));
+ * sizeof (u_int32_t));
CTYPE_DATA (_NL_CTYPE_TOLOWER_EL,
ctype->map_el[1],
(ctype->plane_size * ctype->plane_cnt + 128)
- * sizeof (u32_t));
+ * sizeof (u_int32_t));
CTYPE_DATA (_NL_CTYPE_CLASS32,
ctype->ctype32_b,
* sizeof (char_class32_t)));
CTYPE_DATA (_NL_CTYPE_NAMES_EB,
- ctype->names_eb,
- ctype->plane_size * ctype->plane_cnt * sizeof (u32_t));
+ ctype->names_eb, (ctype->plane_size * ctype->plane_cnt
+ * sizeof (u_int32_t)));
CTYPE_DATA (_NL_CTYPE_NAMES_EL,
- ctype->names_el,
- ctype->plane_size * ctype->plane_cnt * sizeof (u32_t));
+ ctype->names_el, (ctype->plane_size * ctype->plane_cnt
+ * sizeof (u_int32_t)));
CTYPE_DATA (_NL_CTYPE_HASH_SIZE,
- &ctype->plane_size, sizeof (u32_t));
+ &ctype->plane_size, sizeof (u_int32_t));
CTYPE_DATA (_NL_CTYPE_HASH_LAYERS,
- &ctype->plane_cnt, sizeof (u32_t));
+ &ctype->plane_cnt, sizeof (u_int32_t));
case _NL_ITEM_INDEX (_NL_CTYPE_CLASS_NAMES):
/* The class name array. */
iov[2 + elem + offset].iov_len = ((ctype->plane_size
* ctype->plane_cnt + 128)
- * sizeof (u32_t));
+ * sizeof (u_int32_t));
if (elem + 1 < nelems)
idx[elem + 1] = idx[elem] + iov[2 + elem + offset].iov_len;
else
ctype->map_collection_max[cnt] = max_chars;
- ctype->map_collection[cnt] =
- (u32_t *) xmalloc (sizeof (u32_t) * ctype->map_collection_max[cnt]);
+ ctype->map_collection[cnt] = (u_int32_t *)
+ xmalloc (sizeof (u_int32_t) * ctype->map_collection_max[cnt]);
memset (ctype->map_collection[cnt], '\0',
- sizeof (u32_t) * ctype->map_collection_max[cnt]);
+ sizeof (u_int32_t) * ctype->map_collection_max[cnt]);
ctype->map_collection_act[cnt] = 256;
++ctype->map_collection_nr;
/* We have to be prepared that TABLE, MAX, and ACT can be NULL. This
is possible if we only want ot extend the name array. */
-static u32_t *
-find_idx (struct locale_ctype_t *ctype, u32_t **table, size_t *max,
+static u_int32_t *
+find_idx (struct locale_ctype_t *ctype, u_int32_t **table, size_t *max,
size_t *act, unsigned int idx)
{
size_t cnt;
while (*max <= cnt);
*table =
- (u32_t *) xrealloc (*table, *max * sizeof (unsigned long int));
- memset (&(*table)[old_max], '\0', (*max - old_max) * sizeof (u32_t));
+ (u_int32_t *) xrealloc (*table, *max * sizeof (unsigned long int));
+ memset (&(*table)[old_max], '\0',
+ (*max - old_max) * sizeof (u_int32_t));
}
(*table)[cnt] = 0;
# define NAMES_B2 ctype->names_el
#endif
- ctype->names_eb = (u32_t *) xcalloc (ctype->plane_size * ctype->plane_cnt,
- sizeof (u32_t));
- ctype->names_el = (u32_t *) xcalloc (ctype->plane_size * ctype->plane_cnt,
- sizeof (u32_t));
+ ctype->names_eb = (u_int32_t *) xcalloc (ctype->plane_size
+ * ctype->plane_cnt,
+ sizeof (u_int32_t));
+ ctype->names_el = (u_int32_t *) xcalloc (ctype->plane_size
+ * ctype->plane_cnt,
+ sizeof (u_int32_t));
for (idx = 1; idx < 256; ++idx)
NAMES_B1[idx] = idx;
= TRANS32 (ctype->class_collection[idx]);
/* Room for table of mappings. */
- ctype->map_eb = (u32_t **) xmalloc (ctype->map_collection_nr
- * sizeof (u32_t *));
- ctype->map_el = (u32_t **) xmalloc (ctype->map_collection_nr
- * sizeof (u32_t *));
+ ctype->map_eb = (u_int32_t **) xmalloc (ctype->map_collection_nr
+ * sizeof (u_int32_t *));
+ ctype->map_el = (u_int32_t **) xmalloc (ctype->map_collection_nr
+ * sizeof (u_int32_t *));
/* Fill in all mappings. */
for (idx = 0; idx < ctype->map_collection_nr; ++idx)
unsigned int idx2;
/* Allocate table. */
- ctype->map_eb[idx] = (u32_t *) xmalloc ((ctype->plane_size
- * ctype->plane_cnt + 128)
- * sizeof (u32_t));
- ctype->map_el[idx] = (u32_t *) xmalloc ((ctype->plane_size
- * ctype->plane_cnt + 128)
- * sizeof (u32_t));
+ ctype->map_eb[idx] = (u_int32_t *) xmalloc ((ctype->plane_size
+ * ctype->plane_cnt + 128)
+ * sizeof (u_int32_t));
+ ctype->map_el[idx] = (u_int32_t *) xmalloc ((ctype->plane_size
+ * ctype->plane_cnt + 128)
+ * sizeof (u_int32_t));
#if __BYTE_ORDER == __LITTLE_ENDIAN
# define MAP_B1 ctype->map_el
/* Copy default value (identity mapping). */
memcpy (&MAP_B1[idx][128], NAMES_B1,
- ctype->plane_size * ctype->plane_cnt * sizeof (u32_t));
+ ctype->plane_size * ctype->plane_cnt * sizeof (u_int32_t));
/* Copy values from collection. */
for (idx2 = 0; idx2 < ctype->map_collection_act[idx]; ++idx2)
}
/* Extra array for class and map names. */
- ctype->class_name_ptr = (u32_t *) xmalloc (ctype->nr_charclass
- * sizeof (u32_t));
- ctype->map_name_ptr = (u32_t *) xmalloc (ctype->map_collection_nr
- * sizeof (u32_t));
+ ctype->class_name_ptr = (u_int32_t *) xmalloc (ctype->nr_charclass
+ * sizeof (u_int32_t));
+ ctype->map_name_ptr = (u_int32_t *) xmalloc (ctype->map_collection_nr
+ * sizeof (u_int32_t));
/* Array for width information. Because the expected width are very
small we use only one single byte. This save space and we need