1 /*
2 * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2013, 2019, Red Hat, Inc. All rights reserved.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
24 */
25
26 #include "precompiled.hpp"
27 #include "gc/shared/space.inline.hpp"
28 #include "gc/shared/tlab_globals.hpp"
29 #include "gc/shenandoah/shenandoahHeapRegionSet.inline.hpp"
30 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
31 #include "gc/shenandoah/shenandoahHeapRegion.hpp"
32 #include "gc/shenandoah/shenandoahMarkingContext.inline.hpp"
33 #include "jfr/jfrEvents.hpp"
34 #include "memory/allocation.hpp"
35 #include "memory/iterator.inline.hpp"
36 #include "memory/resourceArea.hpp"
37 #include "memory/universe.hpp"
38 #include "oops/oop.inline.hpp"
39 #include "runtime/atomic.hpp"
40 #include "runtime/globals_extension.hpp"
41 #include "runtime/java.hpp"
42 #include "runtime/mutexLocker.hpp"
43 #include "runtime/os.hpp"
44 #include "runtime/safepoint.hpp"
45 #include "utilities/powerOfTwo.hpp"
46
47 size_t ShenandoahHeapRegion::RegionCount = 0;
48 size_t ShenandoahHeapRegion::RegionSizeBytes = 0;
49 size_t ShenandoahHeapRegion::RegionSizeWords = 0;
50 size_t ShenandoahHeapRegion::RegionSizeBytesShift = 0;
51 size_t ShenandoahHeapRegion::RegionSizeWordsShift = 0;
52 size_t ShenandoahHeapRegion::RegionSizeBytesMask = 0;
53 size_t ShenandoahHeapRegion::RegionSizeWordsMask = 0;
54 size_t ShenandoahHeapRegion::HumongousThresholdBytes = 0;
55 size_t ShenandoahHeapRegion::HumongousThresholdWords = 0;
56 size_t ShenandoahHeapRegion::MaxTLABSizeBytes = 0;
57 size_t ShenandoahHeapRegion::MaxTLABSizeWords = 0;
58
59 ShenandoahHeapRegion::ShenandoahHeapRegion(HeapWord* start, size_t index, bool committed) :
60 _index(index),
61 _bottom(start),
62 _end(start + RegionSizeWords),
63 _new_top(nullptr),
64 _empty_time(os::elapsedTime()),
65 _state(committed ? _empty_committed : _empty_uncommitted),
66 _top(start),
67 _tlab_allocs(0),
68 _gclab_allocs(0),
69 _live_data(0),
70 _critical_pins(0),
71 _update_watermark(start) {
72
73 assert(Universe::on_page_boundary(_bottom) && Universe::on_page_boundary(_end),
74 "invalid space boundaries");
75 if (ZapUnusedHeapArea && committed) {
76 SpaceMangler::mangle_region(MemRegion(_bottom, _end));
77 }
78 }
79
80 void ShenandoahHeapRegion::report_illegal_transition(const char *method) {
81 stringStream ss;
82 ss.print("Illegal region state transition from \"%s\", at %s\n ", region_state_to_string(_state), method);
83 print_on(&ss);
84 fatal("%s", ss.freeze());
85 }
86
87 void ShenandoahHeapRegion::make_regular_allocation() {
88 shenandoah_assert_heaplocked();
89
90 switch (_state) {
91 case _empty_uncommitted:
92 do_commit();
93 case _empty_committed:
94 set_state(_regular);
95 case _regular:
96 case _pinned:
97 return;
98 default:
99 report_illegal_transition("regular allocation");
100 }
101 }
102
103 void ShenandoahHeapRegion::make_regular_bypass() {
104 shenandoah_assert_heaplocked();
105 assert (ShenandoahHeap::heap()->is_full_gc_in_progress() || ShenandoahHeap::heap()->is_degenerated_gc_in_progress(),
106 "only for full or degen GC");
107
108 switch (_state) {
109 case _empty_uncommitted:
110 do_commit();
111 case _empty_committed:
112 case _cset:
113 case _humongous_start:
114 case _humongous_cont:
115 set_state(_regular);
116 return;
117 case _pinned_cset:
118 set_state(_pinned);
119 return;
120 case _regular:
121 case _pinned:
122 return;
123 default:
124 report_illegal_transition("regular bypass");
125 }
126 }
127
128 void ShenandoahHeapRegion::make_humongous_start() {
129 shenandoah_assert_heaplocked();
130 switch (_state) {
131 case _empty_uncommitted:
132 do_commit();
133 case _empty_committed:
134 set_state(_humongous_start);
135 return;
136 default:
137 report_illegal_transition("humongous start allocation");
138 }
139 }
140
141 void ShenandoahHeapRegion::make_humongous_start_bypass() {
142 shenandoah_assert_heaplocked();
143 assert (ShenandoahHeap::heap()->is_full_gc_in_progress(), "only for full GC");
144
145 switch (_state) {
146 case _empty_committed:
147 case _regular:
148 case _humongous_start:
149 case _humongous_cont:
150 set_state(_humongous_start);
151 return;
152 default:
153 report_illegal_transition("humongous start bypass");
154 }
155 }
156
157 void ShenandoahHeapRegion::make_humongous_cont() {
158 shenandoah_assert_heaplocked();
159 switch (_state) {
160 case _empty_uncommitted:
161 do_commit();
162 case _empty_committed:
163 set_state(_humongous_cont);
164 return;
165 default:
166 report_illegal_transition("humongous continuation allocation");
167 }
168 }
169
170 void ShenandoahHeapRegion::make_humongous_cont_bypass() {
171 shenandoah_assert_heaplocked();
172 assert (ShenandoahHeap::heap()->is_full_gc_in_progress(), "only for full GC");
173
174 switch (_state) {
175 case _empty_committed:
176 case _regular:
177 case _humongous_start:
178 case _humongous_cont:
179 set_state(_humongous_cont);
180 return;
181 default:
182 report_illegal_transition("humongous continuation bypass");
183 }
184 }
185
186 void ShenandoahHeapRegion::make_pinned() {
187 shenandoah_assert_heaplocked();
188 assert(pin_count() > 0, "Should have pins: " SIZE_FORMAT, pin_count());
189
190 switch (_state) {
191 case _regular:
192 set_state(_pinned);
193 case _pinned_cset:
194 case _pinned:
195 return;
196 case _humongous_start:
197 set_state(_pinned_humongous_start);
198 case _pinned_humongous_start:
199 return;
200 case _cset:
201 _state = _pinned_cset;
202 return;
203 default:
204 report_illegal_transition("pinning");
205 }
206 }
207
208 void ShenandoahHeapRegion::make_unpinned() {
209 shenandoah_assert_heaplocked();
210 assert(pin_count() == 0, "Should not have pins: " SIZE_FORMAT, pin_count());
211
212 switch (_state) {
213 case _pinned:
214 set_state(_regular);
215 return;
216 case _regular:
217 case _humongous_start:
218 return;
219 case _pinned_cset:
220 set_state(_cset);
221 return;
222 case _pinned_humongous_start:
223 set_state(_humongous_start);
224 return;
225 default:
226 report_illegal_transition("unpinning");
227 }
228 }
229
230 void ShenandoahHeapRegion::make_cset() {
231 shenandoah_assert_heaplocked();
232 switch (_state) {
233 case _regular:
234 set_state(_cset);
235 case _cset:
236 return;
237 default:
238 report_illegal_transition("cset");
239 }
240 }
241
242 void ShenandoahHeapRegion::make_trash() {
243 shenandoah_assert_heaplocked();
244 switch (_state) {
245 case _cset:
246 // Reclaiming cset regions
247 case _humongous_start:
248 case _humongous_cont:
249 // Reclaiming humongous regions
250 case _regular:
251 // Immediate region reclaim
252 set_state(_trash);
253 return;
254 default:
255 report_illegal_transition("trashing");
256 }
257 }
258
259 void ShenandoahHeapRegion::make_trash_immediate() {
260 make_trash();
261
262 // On this path, we know there are no marked objects in the region,
263 // tell marking context about it to bypass bitmap resets.
264 ShenandoahHeap::heap()->complete_marking_context()->reset_top_bitmap(this);
265 }
266
267 void ShenandoahHeapRegion::make_empty() {
268 shenandoah_assert_heaplocked();
269 switch (_state) {
270 case _trash:
271 set_state(_empty_committed);
272 _empty_time = os::elapsedTime();
273 return;
274 default:
275 report_illegal_transition("emptying");
276 }
277 }
278
279 void ShenandoahHeapRegion::make_uncommitted() {
280 shenandoah_assert_heaplocked();
281 switch (_state) {
282 case _empty_committed:
283 do_uncommit();
284 set_state(_empty_uncommitted);
285 return;
286 default:
287 report_illegal_transition("uncommiting");
288 }
289 }
290
291 void ShenandoahHeapRegion::make_committed_bypass() {
292 shenandoah_assert_heaplocked();
293 assert (ShenandoahHeap::heap()->is_full_gc_in_progress(), "only for full GC");
294
295 switch (_state) {
296 case _empty_uncommitted:
297 do_commit();
298 set_state(_empty_committed);
299 return;
300 default:
301 report_illegal_transition("commit bypass");
302 }
303 }
304
305 void ShenandoahHeapRegion::reset_alloc_metadata() {
306 _tlab_allocs = 0;
307 _gclab_allocs = 0;
308 }
309
310 size_t ShenandoahHeapRegion::get_shared_allocs() const {
311 return used() - (_tlab_allocs + _gclab_allocs) * HeapWordSize;
312 }
313
314 size_t ShenandoahHeapRegion::get_tlab_allocs() const {
315 return _tlab_allocs * HeapWordSize;
316 }
317
318 size_t ShenandoahHeapRegion::get_gclab_allocs() const {
319 return _gclab_allocs * HeapWordSize;
320 }
321
322 void ShenandoahHeapRegion::set_live_data(size_t s) {
323 assert(Thread::current()->is_VM_thread(), "by VM thread");
324 _live_data = (s >> LogHeapWordSize);
325 }
326
327 void ShenandoahHeapRegion::print_on(outputStream* st) const {
328 st->print("|");
329 st->print(SIZE_FORMAT_W(5), this->_index);
330
331 switch (_state) {
332 case _empty_uncommitted:
333 st->print("|EU ");
334 break;
335 case _empty_committed:
336 st->print("|EC ");
337 break;
338 case _regular:
339 st->print("|R ");
340 break;
341 case _humongous_start:
346 break;
347 case _humongous_cont:
348 st->print("|HC ");
349 break;
350 case _cset:
351 st->print("|CS ");
352 break;
353 case _trash:
354 st->print("|TR ");
355 break;
356 case _pinned:
357 st->print("|P ");
358 break;
359 case _pinned_cset:
360 st->print("|CSP");
361 break;
362 default:
363 ShouldNotReachHere();
364 }
365
366 #define SHR_PTR_FORMAT "%12" PRIxPTR
367
368 st->print("|BTE " SHR_PTR_FORMAT ", " SHR_PTR_FORMAT ", " SHR_PTR_FORMAT,
369 p2i(bottom()), p2i(top()), p2i(end()));
370 st->print("|TAMS " SHR_PTR_FORMAT,
371 p2i(ShenandoahHeap::heap()->marking_context()->top_at_mark_start(const_cast<ShenandoahHeapRegion*>(this))));
372 st->print("|UWM " SHR_PTR_FORMAT,
373 p2i(_update_watermark));
374 st->print("|U " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(used()), proper_unit_for_byte_size(used()));
375 st->print("|T " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_tlab_allocs()), proper_unit_for_byte_size(get_tlab_allocs()));
376 st->print("|G " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_gclab_allocs()), proper_unit_for_byte_size(get_gclab_allocs()));
377 st->print("|S " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_shared_allocs()), proper_unit_for_byte_size(get_shared_allocs()));
378 st->print("|L " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_live_data_bytes()), proper_unit_for_byte_size(get_live_data_bytes()));
379 st->print("|CP " SIZE_FORMAT_W(3), pin_count());
380 st->cr();
381
382 #undef SHR_PTR_FORMAT
383 }
384
385 void ShenandoahHeapRegion::oop_iterate(OopIterateClosure* blk) {
386 if (!is_active()) return;
387 if (is_humongous()) {
388 oop_iterate_humongous(blk);
389 } else {
390 oop_iterate_objects(blk);
391 }
392 }
393
394 void ShenandoahHeapRegion::oop_iterate_objects(OopIterateClosure* blk) {
395 assert(! is_humongous(), "no humongous region here");
396 HeapWord* obj_addr = bottom();
397 HeapWord* t = top();
398 // Could call objects iterate, but this is easier.
399 while (obj_addr < t) {
400 oop obj = cast_to_oop(obj_addr);
401 obj_addr += obj->oop_iterate_size(blk);
402 }
403 }
404
405 void ShenandoahHeapRegion::oop_iterate_humongous(OopIterateClosure* blk) {
406 assert(is_humongous(), "only humongous region here");
407 // Find head.
408 ShenandoahHeapRegion* r = humongous_start_region();
409 assert(r->is_humongous_start(), "need humongous head here");
410 oop obj = cast_to_oop(r->bottom());
411 obj->oop_iterate(blk, MemRegion(bottom(), top()));
412 }
413
414 ShenandoahHeapRegion* ShenandoahHeapRegion::humongous_start_region() const {
415 ShenandoahHeap* heap = ShenandoahHeap::heap();
416 assert(is_humongous(), "Must be a part of the humongous region");
417 size_t i = index();
418 ShenandoahHeapRegion* r = const_cast<ShenandoahHeapRegion*>(this);
419 while (!r->is_humongous_start()) {
420 assert(i > 0, "Sanity");
421 i--;
422 r = heap->get_region(i);
423 assert(r->is_humongous(), "Must be a part of the humongous region");
424 }
425 assert(r->is_humongous_start(), "Must be");
426 return r;
427 }
428
429 void ShenandoahHeapRegion::recycle() {
430 set_top(bottom());
431 clear_live_data();
432
433 reset_alloc_metadata();
434
435 ShenandoahHeap::heap()->marking_context()->reset_top_at_mark_start(this);
436 set_update_watermark(bottom());
437
438 make_empty();
439
440 if (ZapUnusedHeapArea) {
441 SpaceMangler::mangle_region(MemRegion(bottom(), end()));
442 }
443 }
444
445 HeapWord* ShenandoahHeapRegion::block_start(const void* p) const {
446 assert(MemRegion(bottom(), end()).contains(p),
447 "p (" PTR_FORMAT ") not in space [" PTR_FORMAT ", " PTR_FORMAT ")",
448 p2i(p), p2i(bottom()), p2i(end()));
449 if (p >= top()) {
450 return top();
451 } else {
452 HeapWord* last = bottom();
453 HeapWord* cur = last;
454 while (cur <= p) {
455 last = cur;
456 cur += cast_to_oop(cur)->size();
457 }
458 shenandoah_assert_correct(nullptr, cast_to_oop(last));
459 return last;
463 size_t ShenandoahHeapRegion::block_size(const HeapWord* p) const {
464 assert(MemRegion(bottom(), end()).contains(p),
465 "p (" PTR_FORMAT ") not in space [" PTR_FORMAT ", " PTR_FORMAT ")",
466 p2i(p), p2i(bottom()), p2i(end()));
467 if (p < top()) {
468 return cast_to_oop(p)->size();
469 } else {
470 assert(p == top(), "just checking");
471 return pointer_delta(end(), (HeapWord*) p);
472 }
473 }
474
475 size_t ShenandoahHeapRegion::setup_sizes(size_t max_heap_size) {
476 // Absolute minimums we should not ever break.
477 static const size_t MIN_REGION_SIZE = 256*K;
478
479 if (FLAG_IS_DEFAULT(ShenandoahMinRegionSize)) {
480 FLAG_SET_DEFAULT(ShenandoahMinRegionSize, MIN_REGION_SIZE);
481 }
482
483 size_t region_size;
484 if (FLAG_IS_DEFAULT(ShenandoahRegionSize)) {
485 if (ShenandoahMinRegionSize > max_heap_size / MIN_NUM_REGIONS) {
486 err_msg message("Max heap size (" SIZE_FORMAT "%s) is too low to afford the minimum number "
487 "of regions (" SIZE_FORMAT ") of minimum region size (" SIZE_FORMAT "%s).",
488 byte_size_in_proper_unit(max_heap_size), proper_unit_for_byte_size(max_heap_size),
489 MIN_NUM_REGIONS,
490 byte_size_in_proper_unit(ShenandoahMinRegionSize), proper_unit_for_byte_size(ShenandoahMinRegionSize));
491 vm_exit_during_initialization("Invalid -XX:ShenandoahMinRegionSize option", message);
492 }
493 if (ShenandoahMinRegionSize < MIN_REGION_SIZE) {
494 err_msg message("" SIZE_FORMAT "%s should not be lower than minimum region size (" SIZE_FORMAT "%s).",
495 byte_size_in_proper_unit(ShenandoahMinRegionSize), proper_unit_for_byte_size(ShenandoahMinRegionSize),
496 byte_size_in_proper_unit(MIN_REGION_SIZE), proper_unit_for_byte_size(MIN_REGION_SIZE));
497 vm_exit_during_initialization("Invalid -XX:ShenandoahMinRegionSize option", message);
498 }
499 if (ShenandoahMinRegionSize < MinTLABSize) {
500 err_msg message("" SIZE_FORMAT "%s should not be lower than TLAB size size (" SIZE_FORMAT "%s).",
501 byte_size_in_proper_unit(ShenandoahMinRegionSize), proper_unit_for_byte_size(ShenandoahMinRegionSize),
502 byte_size_in_proper_unit(MinTLABSize), proper_unit_for_byte_size(MinTLABSize));
651 evt.set_used(used());
652 evt.set_from(_state);
653 evt.set_to(to);
654 evt.commit();
655 }
656 _state = to;
657 }
658
659 void ShenandoahHeapRegion::record_pin() {
660 Atomic::add(&_critical_pins, (size_t)1);
661 }
662
663 void ShenandoahHeapRegion::record_unpin() {
664 assert(pin_count() > 0, "Region " SIZE_FORMAT " should have non-zero pins", index());
665 Atomic::sub(&_critical_pins, (size_t)1);
666 }
667
668 size_t ShenandoahHeapRegion::pin_count() const {
669 return Atomic::load(&_critical_pins);
670 }
|
1 /*
2 * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2013, 2020, Red Hat, Inc. All rights reserved.
4 * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
5 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 *
7 * This code is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License version 2 only, as
9 * published by the Free Software Foundation.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 *
25 */
26
27 #include "precompiled.hpp"
28 #include "gc/shared/cardTable.hpp"
29 #include "gc/shared/space.inline.hpp"
30 #include "gc/shared/tlab_globals.hpp"
31 #include "gc/shenandoah/shenandoahCardTable.hpp"
32 #include "gc/shenandoah/shenandoahFreeSet.hpp"
33 #include "gc/shenandoah/shenandoahHeapRegionSet.inline.hpp"
34 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
35 #include "gc/shenandoah/shenandoahHeapRegion.hpp"
36 #include "gc/shenandoah/shenandoahMarkingContext.inline.hpp"
37 #include "gc/shenandoah/shenandoahOldGeneration.hpp"
38 #include "gc/shenandoah/shenandoahGeneration.hpp"
39 #include "gc/shenandoah/shenandoahYoungGeneration.hpp"
40 #include "gc/shenandoah/shenandoahScanRemembered.inline.hpp"
41 #include "jfr/jfrEvents.hpp"
42 #include "memory/allocation.hpp"
43 #include "memory/iterator.inline.hpp"
44 #include "memory/resourceArea.hpp"
45 #include "memory/universe.hpp"
46 #include "oops/oop.inline.hpp"
47 #include "runtime/atomic.hpp"
48 #include "runtime/globals_extension.hpp"
49 #include "runtime/java.hpp"
50 #include "runtime/mutexLocker.hpp"
51 #include "runtime/os.hpp"
52 #include "runtime/safepoint.hpp"
53 #include "utilities/powerOfTwo.hpp"
54
55
56 size_t ShenandoahHeapRegion::RegionCount = 0;
57 size_t ShenandoahHeapRegion::RegionSizeBytes = 0;
58 size_t ShenandoahHeapRegion::RegionSizeWords = 0;
59 size_t ShenandoahHeapRegion::RegionSizeBytesShift = 0;
60 size_t ShenandoahHeapRegion::RegionSizeWordsShift = 0;
61 size_t ShenandoahHeapRegion::RegionSizeBytesMask = 0;
62 size_t ShenandoahHeapRegion::RegionSizeWordsMask = 0;
63 size_t ShenandoahHeapRegion::HumongousThresholdBytes = 0;
64 size_t ShenandoahHeapRegion::HumongousThresholdWords = 0;
65 size_t ShenandoahHeapRegion::MaxTLABSizeBytes = 0;
66 size_t ShenandoahHeapRegion::MaxTLABSizeWords = 0;
67
68 ShenandoahHeapRegion::ShenandoahHeapRegion(HeapWord* start, size_t index, bool committed) :
69 _index(index),
70 _bottom(start),
71 _end(start + RegionSizeWords),
72 _new_top(nullptr),
73 _empty_time(os::elapsedTime()),
74 _top_before_promoted(nullptr),
75 _state(committed ? _empty_committed : _empty_uncommitted),
76 _top(start),
77 _tlab_allocs(0),
78 _gclab_allocs(0),
79 _plab_allocs(0),
80 _live_data(0),
81 _critical_pins(0),
82 _update_watermark(start),
83 _age(0)
84 #ifdef SHENANDOAH_CENSUS_NOISE
85 , _youth(0)
86 #endif // SHENANDOAH_CENSUS_NOISE
87 {
88
89 assert(Universe::on_page_boundary(_bottom) && Universe::on_page_boundary(_end),
90 "invalid space boundaries");
91 if (ZapUnusedHeapArea && committed) {
92 SpaceMangler::mangle_region(MemRegion(_bottom, _end));
93 }
94 }
95
96 void ShenandoahHeapRegion::report_illegal_transition(const char *method) {
97 stringStream ss;
98 ss.print("Illegal region state transition from \"%s\", at %s\n ", region_state_to_string(_state), method);
99 print_on(&ss);
100 fatal("%s", ss.freeze());
101 }
102
103 void ShenandoahHeapRegion::make_regular_allocation(ShenandoahAffiliation affiliation) {
104 shenandoah_assert_heaplocked();
105 reset_age();
106 switch (_state) {
107 case _empty_uncommitted:
108 do_commit();
109 case _empty_committed:
110 assert(this->affiliation() == affiliation, "Region affiliation should already be established");
111 set_state(_regular);
112 case _regular:
113 case _pinned:
114 return;
115 default:
116 report_illegal_transition("regular allocation");
117 }
118 }
119
120 // Change affiliation to YOUNG_GENERATION if _state is not _pinned_cset, _regular, or _pinned. This implements
121 // behavior previously performed as a side effect of make_regular_bypass().
122 void ShenandoahHeapRegion::make_young_maybe() {
123 shenandoah_assert_heaplocked();
124 switch (_state) {
125 case _empty_uncommitted:
126 case _empty_committed:
127 case _cset:
128 case _humongous_start:
129 case _humongous_cont:
130 if (affiliation() != YOUNG_GENERATION) {
131 ShenandoahHeap* heap = ShenandoahHeap::heap();
132 if (heap->mode()->is_generational()) {
133 if (is_old()) {
134 heap->old_generation()->decrement_affiliated_region_count();
135 }
136 heap->young_generation()->increment_affiliated_region_count();
137 }
138 set_affiliation(YOUNG_GENERATION);
139 }
140 return;
141 case _pinned_cset:
142 case _regular:
143 case _pinned:
144 return;
145 default:
146 assert(false, "Unexpected _state in make_young_maybe");
147 }
148 }
149
150 void ShenandoahHeapRegion::make_regular_bypass() {
151 shenandoah_assert_heaplocked();
152 assert (ShenandoahHeap::heap()->is_full_gc_in_progress() || ShenandoahHeap::heap()->is_degenerated_gc_in_progress(),
153 "only for full or degen GC");
154 reset_age();
155 switch (_state) {
156 case _empty_uncommitted:
157 do_commit();
158 case _empty_committed:
159 case _cset:
160 case _humongous_start:
161 case _humongous_cont:
162 set_state(_regular);
163 return;
164 case _pinned_cset:
165 set_state(_pinned);
166 return;
167 case _regular:
168 case _pinned:
169 return;
170 default:
171 report_illegal_transition("regular bypass");
172 }
173 }
174
175 void ShenandoahHeapRegion::make_humongous_start() {
176 shenandoah_assert_heaplocked();
177 reset_age();
178 switch (_state) {
179 case _empty_uncommitted:
180 do_commit();
181 case _empty_committed:
182 set_state(_humongous_start);
183 return;
184 default:
185 report_illegal_transition("humongous start allocation");
186 }
187 }
188
189 void ShenandoahHeapRegion::make_humongous_start_bypass(ShenandoahAffiliation affiliation) {
190 shenandoah_assert_heaplocked();
191 assert (ShenandoahHeap::heap()->is_full_gc_in_progress(), "only for full GC");
192 // Don't bother to account for affiliated regions during Full GC. We recompute totals at end.
193 set_affiliation(affiliation);
194 reset_age();
195 switch (_state) {
196 case _empty_committed:
197 case _regular:
198 case _humongous_start:
199 case _humongous_cont:
200 set_state(_humongous_start);
201 return;
202 default:
203 report_illegal_transition("humongous start bypass");
204 }
205 }
206
207 void ShenandoahHeapRegion::make_humongous_cont() {
208 shenandoah_assert_heaplocked();
209 reset_age();
210 switch (_state) {
211 case _empty_uncommitted:
212 do_commit();
213 case _empty_committed:
214 set_state(_humongous_cont);
215 return;
216 default:
217 report_illegal_transition("humongous continuation allocation");
218 }
219 }
220
221 void ShenandoahHeapRegion::make_humongous_cont_bypass(ShenandoahAffiliation affiliation) {
222 shenandoah_assert_heaplocked();
223 assert (ShenandoahHeap::heap()->is_full_gc_in_progress(), "only for full GC");
224 set_affiliation(affiliation);
225 // Don't bother to account for affiliated regions during Full GC. We recompute totals at end.
226 reset_age();
227 switch (_state) {
228 case _empty_committed:
229 case _regular:
230 case _humongous_start:
231 case _humongous_cont:
232 set_state(_humongous_cont);
233 return;
234 default:
235 report_illegal_transition("humongous continuation bypass");
236 }
237 }
238
239 void ShenandoahHeapRegion::make_pinned() {
240 shenandoah_assert_heaplocked();
241 assert(pin_count() > 0, "Should have pins: " SIZE_FORMAT, pin_count());
242
243 switch (_state) {
244 case _regular:
245 set_state(_pinned);
246 case _pinned_cset:
247 case _pinned:
248 return;
249 case _humongous_start:
250 set_state(_pinned_humongous_start);
251 case _pinned_humongous_start:
252 return;
253 case _cset:
254 _state = _pinned_cset;
255 return;
256 default:
257 report_illegal_transition("pinning");
258 }
259 }
260
261 void ShenandoahHeapRegion::make_unpinned() {
262 shenandoah_assert_heaplocked();
263 assert(pin_count() == 0, "Should not have pins: " SIZE_FORMAT, pin_count());
264
265 switch (_state) {
266 case _pinned:
267 assert(is_affiliated(), "Pinned region should be affiliated");
268 set_state(_regular);
269 return;
270 case _regular:
271 case _humongous_start:
272 return;
273 case _pinned_cset:
274 set_state(_cset);
275 return;
276 case _pinned_humongous_start:
277 set_state(_humongous_start);
278 return;
279 default:
280 report_illegal_transition("unpinning");
281 }
282 }
283
284 void ShenandoahHeapRegion::make_cset() {
285 shenandoah_assert_heaplocked();
286 // Leave age untouched. We need to consult the age when we are deciding whether to promote evacuated objects.
287 switch (_state) {
288 case _regular:
289 set_state(_cset);
290 case _cset:
291 return;
292 default:
293 report_illegal_transition("cset");
294 }
295 }
296
297 void ShenandoahHeapRegion::make_trash() {
298 shenandoah_assert_heaplocked();
299 reset_age();
300 switch (_state) {
301 case _humongous_start:
302 case _humongous_cont:
303 {
304 // Reclaiming humongous regions and reclaim humongous waste. When this region is eventually recycled, we'll reclaim
305 // its used memory. At recycle time, we no longer recognize this as a humongous region.
306 decrement_humongous_waste();
307 }
308 case _cset:
309 // Reclaiming cset regions
310 case _regular:
311 // Immediate region reclaim
312 set_state(_trash);
313 return;
314 default:
315 report_illegal_transition("trashing");
316 }
317 }
318
319 void ShenandoahHeapRegion::make_trash_immediate() {
320 make_trash();
321
322 // On this path, we know there are no marked objects in the region,
323 // tell marking context about it to bypass bitmap resets.
324 assert(ShenandoahHeap::heap()->gc_generation()->is_mark_complete(), "Marking should be complete here.");
325 shenandoah_assert_generations_reconciled();
326 ShenandoahHeap::heap()->marking_context()->reset_top_bitmap(this);
327 }
328
329 void ShenandoahHeapRegion::make_empty() {
330 shenandoah_assert_heaplocked();
331 reset_age();
332 CENSUS_NOISE(clear_youth();)
333 switch (_state) {
334 case _trash:
335 set_state(_empty_committed);
336 _empty_time = os::elapsedTime();
337 return;
338 default:
339 report_illegal_transition("emptying");
340 }
341 }
342
343 void ShenandoahHeapRegion::make_uncommitted() {
344 shenandoah_assert_heaplocked();
345 switch (_state) {
346 case _empty_committed:
347 do_uncommit();
348 set_state(_empty_uncommitted);
349 return;
350 default:
351 report_illegal_transition("uncommiting");
352 }
353 }
354
355 void ShenandoahHeapRegion::make_committed_bypass() {
356 shenandoah_assert_heaplocked();
357 assert (ShenandoahHeap::heap()->is_full_gc_in_progress(), "only for full GC");
358
359 switch (_state) {
360 case _empty_uncommitted:
361 do_commit();
362 set_state(_empty_committed);
363 return;
364 default:
365 report_illegal_transition("commit bypass");
366 }
367 }
368
369 void ShenandoahHeapRegion::reset_alloc_metadata() {
370 _tlab_allocs = 0;
371 _gclab_allocs = 0;
372 _plab_allocs = 0;
373 }
374
375 size_t ShenandoahHeapRegion::get_shared_allocs() const {
376 return used() - (_tlab_allocs + _gclab_allocs + _plab_allocs) * HeapWordSize;
377 }
378
379 size_t ShenandoahHeapRegion::get_tlab_allocs() const {
380 return _tlab_allocs * HeapWordSize;
381 }
382
383 size_t ShenandoahHeapRegion::get_gclab_allocs() const {
384 return _gclab_allocs * HeapWordSize;
385 }
386
387 size_t ShenandoahHeapRegion::get_plab_allocs() const {
388 return _plab_allocs * HeapWordSize;
389 }
390
391 void ShenandoahHeapRegion::set_live_data(size_t s) {
392 assert(Thread::current()->is_VM_thread(), "by VM thread");
393 _live_data = (s >> LogHeapWordSize);
394 }
395
396 void ShenandoahHeapRegion::print_on(outputStream* st) const {
397 st->print("|");
398 st->print(SIZE_FORMAT_W(5), this->_index);
399
400 switch (_state) {
401 case _empty_uncommitted:
402 st->print("|EU ");
403 break;
404 case _empty_committed:
405 st->print("|EC ");
406 break;
407 case _regular:
408 st->print("|R ");
409 break;
410 case _humongous_start:
415 break;
416 case _humongous_cont:
417 st->print("|HC ");
418 break;
419 case _cset:
420 st->print("|CS ");
421 break;
422 case _trash:
423 st->print("|TR ");
424 break;
425 case _pinned:
426 st->print("|P ");
427 break;
428 case _pinned_cset:
429 st->print("|CSP");
430 break;
431 default:
432 ShouldNotReachHere();
433 }
434
435 st->print("|%s", shenandoah_affiliation_code(affiliation()));
436
437 #define SHR_PTR_FORMAT "%12" PRIxPTR
438
439 st->print("|BTE " SHR_PTR_FORMAT ", " SHR_PTR_FORMAT ", " SHR_PTR_FORMAT,
440 p2i(bottom()), p2i(top()), p2i(end()));
441 st->print("|TAMS " SHR_PTR_FORMAT,
442 p2i(ShenandoahHeap::heap()->marking_context()->top_at_mark_start(const_cast<ShenandoahHeapRegion*>(this))));
443 st->print("|UWM " SHR_PTR_FORMAT,
444 p2i(_update_watermark));
445 st->print("|U " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(used()), proper_unit_for_byte_size(used()));
446 st->print("|T " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_tlab_allocs()), proper_unit_for_byte_size(get_tlab_allocs()));
447 st->print("|G " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_gclab_allocs()), proper_unit_for_byte_size(get_gclab_allocs()));
448 if (ShenandoahHeap::heap()->mode()->is_generational()) {
449 st->print("|P " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_plab_allocs()), proper_unit_for_byte_size(get_plab_allocs()));
450 }
451 st->print("|S " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_shared_allocs()), proper_unit_for_byte_size(get_shared_allocs()));
452 st->print("|L " SIZE_FORMAT_W(5) "%1s", byte_size_in_proper_unit(get_live_data_bytes()), proper_unit_for_byte_size(get_live_data_bytes()));
453 st->print("|CP " SIZE_FORMAT_W(3), pin_count());
454 st->cr();
455
456 #undef SHR_PTR_FORMAT
457 }
458
459 // oop_iterate without closure, return true if completed without cancellation
460 bool ShenandoahHeapRegion::oop_coalesce_and_fill(bool cancellable) {
461
462 // Consider yielding to cancel/preemption request after this many coalesce operations (skip marked, or coalesce free).
463 const size_t preemption_stride = 128;
464
465 assert(!is_humongous(), "No need to fill or coalesce humongous regions");
466 if (!is_active()) {
467 end_preemptible_coalesce_and_fill();
468 return true;
469 }
470
471 ShenandoahGenerationalHeap* heap = ShenandoahGenerationalHeap::heap();
472 ShenandoahMarkingContext* marking_context = heap->marking_context();
473
474 // Expect marking to be completed before these threads invoke this service.
475 assert(heap->gc_generation()->is_mark_complete(), "sanity");
476 shenandoah_assert_generations_reconciled();
477
478 // All objects above TAMS are considered live even though their mark bits will not be set. Note that young-
479 // gen evacuations that interrupt a long-running old-gen concurrent mark may promote objects into old-gen
480 // while the old-gen concurrent marking is ongoing. These newly promoted objects will reside above TAMS
481 // and will be treated as live during the current old-gen marking pass, even though they will not be
482 // explicitly marked.
483 HeapWord* t = marking_context->top_at_mark_start(this);
484
485 // Resume coalesce and fill from this address
486 HeapWord* obj_addr = resume_coalesce_and_fill();
487
488 size_t ops_before_preempt_check = preemption_stride;
489 while (obj_addr < t) {
490 oop obj = cast_to_oop(obj_addr);
491 if (marking_context->is_marked(obj)) {
492 assert(obj->klass() != nullptr, "klass should not be nullptr");
493 obj_addr += obj->size();
494 } else {
495 // Object is not marked. Coalesce and fill dead object with dead neighbors.
496 HeapWord* next_marked_obj = marking_context->get_next_marked_addr(obj_addr, t);
497 assert(next_marked_obj <= t, "next marked object cannot exceed top");
498 size_t fill_size = next_marked_obj - obj_addr;
499 assert(fill_size >= ShenandoahHeap::min_fill_size(), "previously allocated object known to be larger than min_size");
500 ShenandoahHeap::fill_with_object(obj_addr, fill_size);
501 heap->old_generation()->card_scan()->coalesce_objects(obj_addr, fill_size);
502 obj_addr = next_marked_obj;
503 }
504 if (cancellable && ops_before_preempt_check-- == 0) {
505 if (heap->cancelled_gc()) {
506 suspend_coalesce_and_fill(obj_addr);
507 return false;
508 }
509 ops_before_preempt_check = preemption_stride;
510 }
511 }
512 // Mark that this region has been coalesced and filled
513 end_preemptible_coalesce_and_fill();
514 return true;
515 }
516
517 // DO NOT CANCEL. If this worker thread has accepted responsibility for scanning a particular range of addresses, it
518 // must finish the work before it can be cancelled.
519 void ShenandoahHeapRegion::oop_iterate_humongous_slice(OopIterateClosure* blk, bool dirty_only,
520 HeapWord* start, size_t words, bool write_table) {
521 assert(words % CardTable::card_size_in_words() == 0, "Humongous iteration must span whole number of cards");
522 assert(is_humongous(), "only humongous region here");
523 ShenandoahGenerationalHeap* heap = ShenandoahGenerationalHeap::heap();
524
525 // Find head.
526 ShenandoahHeapRegion* r = humongous_start_region();
527 assert(r->is_humongous_start(), "need humongous head here");
528 assert(CardTable::card_size_in_words() * (words / CardTable::card_size_in_words()) == words,
529 "slice must be integral number of cards");
530
531 oop obj = cast_to_oop(r->bottom());
532 RememberedScanner* scanner = heap->old_generation()->card_scan();
533 size_t card_index = scanner->card_index_for_addr(start);
534 size_t num_cards = words / CardTable::card_size_in_words();
535
536 if (dirty_only) {
537 if (write_table) {
538 while (num_cards-- > 0) {
539 if (scanner->is_write_card_dirty(card_index++)) {
540 obj->oop_iterate(blk, MemRegion(start, start + CardTable::card_size_in_words()));
541 }
542 start += CardTable::card_size_in_words();
543 }
544 } else {
545 while (num_cards-- > 0) {
546 if (scanner->is_card_dirty(card_index++)) {
547 obj->oop_iterate(blk, MemRegion(start, start + CardTable::card_size_in_words()));
548 }
549 start += CardTable::card_size_in_words();
550 }
551 }
552 } else {
553 // Scan all data, regardless of whether cards are dirty
554 obj->oop_iterate(blk, MemRegion(start, start + num_cards * CardTable::card_size_in_words()));
555 }
556 }
557
558 ShenandoahHeapRegion* ShenandoahHeapRegion::humongous_start_region() const {
559 ShenandoahHeap* heap = ShenandoahHeap::heap();
560 assert(is_humongous(), "Must be a part of the humongous region");
561 size_t i = index();
562 ShenandoahHeapRegion* r = const_cast<ShenandoahHeapRegion*>(this);
563 while (!r->is_humongous_start()) {
564 assert(i > 0, "Sanity");
565 i--;
566 r = heap->get_region(i);
567 assert(r->is_humongous(), "Must be a part of the humongous region");
568 }
569 assert(r->is_humongous_start(), "Must be");
570 return r;
571 }
572
573 void ShenandoahHeapRegion::recycle() {
574 shenandoah_assert_heaplocked();
575 ShenandoahHeap* heap = ShenandoahHeap::heap();
576 ShenandoahGeneration* generation = heap->generation_for(affiliation());
577
578 heap->decrease_used(generation, used());
579 generation->decrement_affiliated_region_count();
580
581 set_top(bottom());
582 clear_live_data();
583
584 reset_alloc_metadata();
585
586 heap->marking_context()->reset_top_at_mark_start(this);
587 set_update_watermark(bottom());
588
589 make_empty();
590
591 set_affiliation(FREE);
592 if (ZapUnusedHeapArea) {
593 SpaceMangler::mangle_region(MemRegion(bottom(), end()));
594 }
595 }
596
597 HeapWord* ShenandoahHeapRegion::block_start(const void* p) const {
598 assert(MemRegion(bottom(), end()).contains(p),
599 "p (" PTR_FORMAT ") not in space [" PTR_FORMAT ", " PTR_FORMAT ")",
600 p2i(p), p2i(bottom()), p2i(end()));
601 if (p >= top()) {
602 return top();
603 } else {
604 HeapWord* last = bottom();
605 HeapWord* cur = last;
606 while (cur <= p) {
607 last = cur;
608 cur += cast_to_oop(cur)->size();
609 }
610 shenandoah_assert_correct(nullptr, cast_to_oop(last));
611 return last;
615 size_t ShenandoahHeapRegion::block_size(const HeapWord* p) const {
616 assert(MemRegion(bottom(), end()).contains(p),
617 "p (" PTR_FORMAT ") not in space [" PTR_FORMAT ", " PTR_FORMAT ")",
618 p2i(p), p2i(bottom()), p2i(end()));
619 if (p < top()) {
620 return cast_to_oop(p)->size();
621 } else {
622 assert(p == top(), "just checking");
623 return pointer_delta(end(), (HeapWord*) p);
624 }
625 }
626
627 size_t ShenandoahHeapRegion::setup_sizes(size_t max_heap_size) {
628 // Absolute minimums we should not ever break.
629 static const size_t MIN_REGION_SIZE = 256*K;
630
631 if (FLAG_IS_DEFAULT(ShenandoahMinRegionSize)) {
632 FLAG_SET_DEFAULT(ShenandoahMinRegionSize, MIN_REGION_SIZE);
633 }
634
635 // Generational Shenandoah needs this alignment for card tables.
636 if (strcmp(ShenandoahGCMode, "generational") == 0) {
637 max_heap_size = align_up(max_heap_size , CardTable::ct_max_alignment_constraint());
638 }
639
640 size_t region_size;
641 if (FLAG_IS_DEFAULT(ShenandoahRegionSize)) {
642 if (ShenandoahMinRegionSize > max_heap_size / MIN_NUM_REGIONS) {
643 err_msg message("Max heap size (" SIZE_FORMAT "%s) is too low to afford the minimum number "
644 "of regions (" SIZE_FORMAT ") of minimum region size (" SIZE_FORMAT "%s).",
645 byte_size_in_proper_unit(max_heap_size), proper_unit_for_byte_size(max_heap_size),
646 MIN_NUM_REGIONS,
647 byte_size_in_proper_unit(ShenandoahMinRegionSize), proper_unit_for_byte_size(ShenandoahMinRegionSize));
648 vm_exit_during_initialization("Invalid -XX:ShenandoahMinRegionSize option", message);
649 }
650 if (ShenandoahMinRegionSize < MIN_REGION_SIZE) {
651 err_msg message("" SIZE_FORMAT "%s should not be lower than minimum region size (" SIZE_FORMAT "%s).",
652 byte_size_in_proper_unit(ShenandoahMinRegionSize), proper_unit_for_byte_size(ShenandoahMinRegionSize),
653 byte_size_in_proper_unit(MIN_REGION_SIZE), proper_unit_for_byte_size(MIN_REGION_SIZE));
654 vm_exit_during_initialization("Invalid -XX:ShenandoahMinRegionSize option", message);
655 }
656 if (ShenandoahMinRegionSize < MinTLABSize) {
657 err_msg message("" SIZE_FORMAT "%s should not be lower than TLAB size size (" SIZE_FORMAT "%s).",
658 byte_size_in_proper_unit(ShenandoahMinRegionSize), proper_unit_for_byte_size(ShenandoahMinRegionSize),
659 byte_size_in_proper_unit(MinTLABSize), proper_unit_for_byte_size(MinTLABSize));
808 evt.set_used(used());
809 evt.set_from(_state);
810 evt.set_to(to);
811 evt.commit();
812 }
813 _state = to;
814 }
815
816 void ShenandoahHeapRegion::record_pin() {
817 Atomic::add(&_critical_pins, (size_t)1);
818 }
819
820 void ShenandoahHeapRegion::record_unpin() {
821 assert(pin_count() > 0, "Region " SIZE_FORMAT " should have non-zero pins", index());
822 Atomic::sub(&_critical_pins, (size_t)1);
823 }
824
825 size_t ShenandoahHeapRegion::pin_count() const {
826 return Atomic::load(&_critical_pins);
827 }
828
829 void ShenandoahHeapRegion::set_affiliation(ShenandoahAffiliation new_affiliation) {
830 ShenandoahHeap* heap = ShenandoahHeap::heap();
831
832 ShenandoahAffiliation region_affiliation = heap->region_affiliation(this);
833 {
834 ShenandoahMarkingContext* const ctx = heap->complete_marking_context();
835 log_debug(gc)("Setting affiliation of Region " SIZE_FORMAT " from %s to %s, top: " PTR_FORMAT ", TAMS: " PTR_FORMAT
836 ", watermark: " PTR_FORMAT ", top_bitmap: " PTR_FORMAT,
837 index(), shenandoah_affiliation_name(region_affiliation), shenandoah_affiliation_name(new_affiliation),
838 p2i(top()), p2i(ctx->top_at_mark_start(this)), p2i(_update_watermark), p2i(ctx->top_bitmap(this)));
839 }
840
841 #ifdef ASSERT
842 {
843 // During full gc, heap->complete_marking_context() is not valid, may equal nullptr.
844 ShenandoahMarkingContext* const ctx = heap->complete_marking_context();
845 size_t idx = this->index();
846 HeapWord* top_bitmap = ctx->top_bitmap(this);
847
848 assert(ctx->is_bitmap_clear_range(top_bitmap, _end),
849 "Region " SIZE_FORMAT ", bitmap should be clear between top_bitmap: " PTR_FORMAT " and end: " PTR_FORMAT, idx,
850 p2i(top_bitmap), p2i(_end));
851 }
852 #endif
853
854 if (region_affiliation == new_affiliation) {
855 return;
856 }
857
858 if (!heap->mode()->is_generational()) {
859 log_trace(gc)("Changing affiliation of region %zu from %s to %s",
860 index(), affiliation_name(), shenandoah_affiliation_name(new_affiliation));
861 heap->set_affiliation(this, new_affiliation);
862 return;
863 }
864
865 switch (new_affiliation) {
866 case FREE:
867 assert(!has_live(), "Free region should not have live data");
868 break;
869 case YOUNG_GENERATION:
870 reset_age();
871 break;
872 case OLD_GENERATION:
873 // TODO: should we reset_age() for OLD as well? Examine invocations of set_affiliation(). Some contexts redundantly
874 // invoke reset_age().
875 break;
876 default:
877 ShouldNotReachHere();
878 return;
879 }
880 heap->set_affiliation(this, new_affiliation);
881 }
882
883 void ShenandoahHeapRegion::decrement_humongous_waste() const {
884 assert(is_humongous(), "Should only use this for humongous regions");
885 size_t waste_bytes = free();
886 if (waste_bytes > 0) {
887 ShenandoahHeap* heap = ShenandoahHeap::heap();
888 ShenandoahGeneration* generation = heap->generation_for(affiliation());
889 heap->decrease_humongous_waste(generation, waste_bytes);
890 }
891 }
|