equal
deleted
inserted
replaced
118 void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collection_set) { |
118 void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collection_set) { |
119 assert(collection_set->count() == 0, "Must be empty"); |
119 assert(collection_set->count() == 0, "Must be empty"); |
120 |
120 |
121 ShenandoahHeap* heap = ShenandoahHeap::heap(); |
121 ShenandoahHeap* heap = ShenandoahHeap::heap(); |
122 |
122 |
|
123 // Check all pinned regions have updated status before choosing the collection set. |
|
124 heap->assert_pinned_region_status(); |
|
125 |
123 // Step 1. Build up the region candidates we care about, rejecting losers and accepting winners right away. |
126 // Step 1. Build up the region candidates we care about, rejecting losers and accepting winners right away. |
124 |
127 |
125 size_t num_regions = heap->num_regions(); |
128 size_t num_regions = heap->num_regions(); |
126 |
129 |
127 RegionData* candidates = get_region_data_cache(num_regions); |
130 RegionData* candidates = get_region_data_cache(num_regions); |