diff options
| author | Mark Mitchell <mark@codesourcery.com> | 2000-04-24 05:52:07 +0000 |
|---|---|---|
| committer | Mark Mitchell <mmitchel@gcc.gnu.org> | 2000-04-24 05:52:07 +0000 |
| commit | b51024fc8996b47f30f3bf277cf1338a24c49953 (patch) | |
| tree | 09ab302f144a8ef34de4d48bebf060cdc0aba25c /libiberty/sort.c | |
| parent | a3fbf5c38363e2e40869f2a5d06e09930b29ae13 (diff) | |
| download | gcc-b51024fc8996b47f30f3bf277cf1338a24c49953.zip gcc-b51024fc8996b47f30f3bf277cf1338a24c49953.tar.gz gcc-b51024fc8996b47f30f3bf277cf1338a24c49953.tar.bz2 | |
* sort.c (sort_pointers): Fix endianness bugs.
From-SVN: r33368
Diffstat (limited to 'libiberty/sort.c')
| -rw-r--r-- | libiberty/sort.c | 18 |
1 files changed, 10 insertions, 8 deletions
diff --git a/libiberty/sort.c b/libiberty/sort.c index 6dca09a..4fd3ef9 100644 --- a/libiberty/sort.c +++ b/libiberty/sort.c @@ -29,9 +29,8 @@ Boston, MA 02111-1307, USA. */ #include <stdlib.h> #endif -/* POINTERSP and WORKP both point to arrays of N pointers. When - this function returns POINTERSP will point to a sorted version of - the original array pointed to by POINTERSP. */ +/* POINTERS and WORK are both arrays of N pointers. When this + function returns POINTERS will be sorted in ascending order. */ void sort_pointers (n, pointers, work) size_t n; @@ -63,8 +62,11 @@ void sort_pointers (n, pointers, work) abort (); /* Figure out the endianness of the machine. */ - for (i = 0; i < sizeof (size_t); ++i) - ((char *)&j)[i] = i; + for (i = 0, j = 0; i < sizeof (size_t); ++i) + { + j *= (UCHAR_MAX + 1); + j += i; + } big_endian_p = (((char *)&j)[0] == 0); /* Move through the pointer values from least significant to most @@ -91,8 +93,8 @@ void sort_pointers (n, pointers, work) /* Compute the address of the appropriate digit in the first and one-past-the-end elements of the array. On a little-endian machine, the least-significant digit is closest to the front. */ - bias = ((digit_t *) pointers) + i; - top = ((digit_t *) (pointers + n)) + i; + bias = ((digit_t *) pointers) + j; + top = ((digit_t *) (pointers + n)) + j; /* Count how many there are of each value. At the end of this loop, COUNT[K] will contain the number of pointers whose Ith @@ -109,7 +111,7 @@ void sort_pointers (n, pointers, work) /* Now, drop the pointers into their correct locations. */ for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp) - work[--count[((digit_t *) pointerp)[i]]] = *pointerp; + work[--count[((digit_t *) pointerp)[j]]] = *pointerp; /* Swap WORK and POINTERS so that POINTERS contains the sorted array. */ |