RFR 4641897: Faster string conversion of large integers

[Dmitry Nadezhin]

Brian,

This patch significally enhances performance of string conversion  for
large numbers.

I suggest to create also a fast path for power-of-two radices: 2, 4, 8, 16,
32 .
It is a simple linear algorithm that is suitable both for large and small
numbers.
Can it be attached to this bug activity ?
Or should it be filed as another bug ?


On Wed, Jun 19, 2013 at 11:58 PM, Brian Burkhalter <
brian.burkhalter at oracle.com> wrote:

> Continuing on from this thread
>
> http://mail.openjdk.java.net/pipermail/core-libs-dev/2013-June/018181.html
>
> here is a new Request for Review, this time for
>
> http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=4641897
>
> The webrev is here
>
> http://cr.openjdk.java.net/~bpb/4641897/
>
> The code changes have been reviewed by me and regression tests have been
> run on my development machine including the updated test which is in the
> webrev. Performance testing has been performed only insofar as to verify
> improvement at bit lengths much larger than the algorithm crossover
> threshold with the understanding that, as for 4837946 and 4646474, the
> threshold is subject to adjustment pending performance evaluation on a mix
> of platforms.
>
> Thanks,
>
> Brian