Re: RFR: 8300493: Use ArraysSupport.vectorizedHashCode in j.u.zip.ZipCoder [v2]

2023-01-21 Thread Claes Redestad
On Fri, 20 Jan 2023 16:42:47 GMT, Lance Andersen  wrote:

>> Claes Redestad has updated the pull request incrementally with one 
>> additional commit since the last revision:
>> 
>>   Vary dir and entry name lengths across a wider spread, keeping most 
>> entries short but making the longest paths longer
>
> Thank you Claes

Thanks @LanceAndersen and @AlanBateman for reviewing!

-

PR: https://git.openjdk.org/jdk/pull/12077


Re: RFR: 8300493: Use ArraysSupport.vectorizedHashCode in j.u.zip.ZipCoder [v2]

2023-01-20 Thread Lance Andersen
On Fri, 20 Jan 2023 12:19:50 GMT, Claes Redestad  wrote:

>> `ZipCoder::checkedHashCode` emulates `StringLatin1::hashCode` but operates 
>> on a `byte[]` subrange. It can profitably use the recently introduced 
>> `ArraysSupport::vectorizedHashCode` method to see a speed-up, which 
>> translates to a small but significant speed-up on `ZipFile` creation.
>> 
>> Before:
>> 
>> Benchmark (size)  Mode  Cnt   Score  Error  Units
>> ZipFileOpen.openCloseZipFile 512  avgt   15   83007.325 ± 1446.716  ns/op
>> ZipFileOpen.openCloseZipFile1024  avgt   15  154550.631 ± 2166.673  ns/op
>> 
>> After:
>> 
>> Benchmark (size)  Mode  Cnt   Score  Error  Units
>> ZipFileOpen.openCloseZipFile 512  avgt   15   79512.902 ±  814.449  ns/op
>> ZipFileOpen.openCloseZipFile1024  avgt   15  147892.522 ± 2744.017  ns/op
>
> Claes Redestad has updated the pull request incrementally with one additional 
> commit since the last revision:
> 
>   Vary dir and entry name lengths across a wider spread, keeping most entries 
> short but making the longest paths longer

Thank you Claes

-

Marked as reviewed by lancea (Reviewer).

PR: https://git.openjdk.org/jdk/pull/12077


Re: RFR: 8300493: Use ArraysSupport.vectorizedHashCode in j.u.zip.ZipCoder [v2]

2023-01-20 Thread Claes Redestad
> `ZipCoder::checkedHashCode` emulates `StringLatin1::hashCode` but operates on 
> a `byte[]` subrange. It can profitably use the recently introduced 
> `ArraysSupport::vectorizedHashCode` method to see a speed-up, which 
> translates to a small but significant speed-up on `ZipFile` creation.
> 
> Before:
> 
> Benchmark (size)  Mode  Cnt   Score  Error  Units
> ZipFileOpen.openCloseZipFile 512  avgt   15   83007.325 ± 1446.716  ns/op
> ZipFileOpen.openCloseZipFile1024  avgt   15  154550.631 ± 2166.673  ns/op
> 
> After:
> 
> Benchmark (size)  Mode  Cnt   Score  Error  Units
> ZipFileOpen.openCloseZipFile 512  avgt   15   79512.902 ±  814.449  ns/op
> ZipFileOpen.openCloseZipFile1024  avgt   15  147892.522 ± 2744.017  ns/op

Claes Redestad has updated the pull request incrementally with one additional 
commit since the last revision:

  Vary dir and entry name lengths across a wider spread, keeping most entries 
short but making the longest paths longer

-

Changes:
  - all: https://git.openjdk.org/jdk/pull/12077/files
  - new: https://git.openjdk.org/jdk/pull/12077/files/0c7f0f4f..369537c5

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=12077&range=01
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=12077&range=00-01

  Stats: 9 lines in 1 file changed: 5 ins; 1 del; 3 mod
  Patch: https://git.openjdk.org/jdk/pull/12077.diff
  Fetch: git fetch https://git.openjdk.org/jdk pull/12077/head:pull/12077

PR: https://git.openjdk.org/jdk/pull/12077