This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: PATCH: New libiberty sorting routine
- To: Mark Mitchell <mark at codesourcery dot com>, gcc-patches at gcc dot gnu dot org
- Subject: Re: PATCH: New libiberty sorting routine
- From: Michael Chamberlain <michael at chamberlain dot net dot au>
- Date: Mon, 24 Apr 2000 11:43:17 +1000
- References: <200004240101.SAA03780@vaio.codesourcery.com>
On Sun, Apr 23, 2000 at 06:01:30PM -0700, Mark Mitchell wrote:
> + /* The offset from the start of the pointer will depend on the
> + endianness of the machine. */
> + if (big_endian_p)
> + j = sizeof (void *) / sizeof (digit_t) - i;
> + else
> + j = i;
If I'm not mistaken, j contains the offset within the pointer for the
current "digit", and i is just the loop counter, but...
> + bias = ((digit_t *) pointers) + i;
> + top = ((digit_t *) (pointers + n)) + i;
Everywhere else within the loop, i is used instead of j.
Michael.