aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorUlrich Drepper <drepper@redhat.com>1999-04-26 14:00:56 +0000
committerUlrich Drepper <drepper@redhat.com>1999-04-26 14:00:56 +0000
commitcb78ea2300cb5a3c6ad7eacef3ec3d007f3b70b7 (patch)
tree5c8c4c75e8fc5b57cb0919e505d990f0d5a09d8d
parent6e4184e465966f7bc1236eae7ef25513f7b07496 (diff)
downloadglibc-cb78ea2300cb5a3c6ad7eacef3ec3d007f3b70b7.zip
glibc-cb78ea2300cb5a3c6ad7eacef3ec3d007f3b70b7.tar.gz
glibc-cb78ea2300cb5a3c6ad7eacef3ec3d007f3b70b7.tar.bz2
(collate_output): Convert undefined_offset to an array index. Fix computation of other endian extra table.
-rw-r--r--locale/programs/ld-collate.c4
1 files changed, 3 insertions, 1 deletions
diff --git a/locale/programs/ld-collate.c b/locale/programs/ld-collate.c
index 772ab1a..c167716 100644
--- a/locale/programs/ld-collate.c
+++ b/locale/programs/ld-collate.c
@@ -608,6 +608,8 @@ Computing table size for collation information might take a while..."),
size_t idx, cnt;
undefined_offset = obstack_object_size (&non_simple);
+ assert (undefined_offset % sizeof (u_int32_t) == 0);
+ undefined_offset /= sizeof (u_int32_t);
idx = collate->nrules;
for (cnt = 0; cnt < collate->nrules; ++cnt)
@@ -634,7 +636,7 @@ Computing table size for collation information might take a while..."),
table2[cnt] = SWAPU32 (table[cnt]);
for (cnt = 0; cnt < extra_len / sizeof (u_int32_t); ++cnt)
- extra2[cnt] = SWAPU32 (extra2[cnt]);
+ extra2[cnt] = SWAPU32 (extra[cnt]);
/* We need a simple hashing table to get a collation-element->chars
mapping. We again use internal hashing using a secondary hashing