RFR: 8324649: Shenandoah: replace implementation of free set [v53]

[Kelvin Nilsen]

On Fri, 3 May 2024 16:26:41 GMT, Roman Kennke <rkennke at openjdk.org> wrote:

>> Kelvin Nilsen has updated the pull request with a new target base due to a merge or a rebase. The pull request now contains 114 commits:
>> 
>>  - Merge remote-tracking branch 'origin/master' into restructure-free-set
>>  - Merge branch 'openjdk:master' into master
>>  - Merge branch 'openjdk:master' into master
>>  - Remove unnecessary call to update_watermark
>>  - Assert progress on find_next and find_prev
>>  - Simplify partition_membership_name by code reuse
>>  - Simplify by combining implemnetations of shrink_interval functions
>>  - Fix NumPartition type
>>    
>>    Beautify the code by changing type of NumPartitions and adding Int and
>>    UInt forms of NumPartitions.
>>  - Refinements to support zero-build compiles
>>  - Fix whitespace
>>  - ... and 104 more: https://git.openjdk.org/jdk/compare/a863ef5d...d6e3546c
>
> This is much better.
> I only looked at shenandoahSimpleBitMap.cpp, and only skimmed over the find-consecutive* methods. I'm not sure, but it looks like some of the search loops might result in quadratic behaviour?

@rkennke : Thanks for all your careful feedback.  If you could be more specific about loops that might result in quadratic behavior, I'll look more closely.  There are some loops within loops, but I'm thinking these are not quadratic because the inner loop bounds are constants.

-------------

PR Comment: https://git.openjdk.org/jdk/pull/17561#issuecomment-2098559363