1 /*
2 * Copyright (c) 2020, Red Hat, Inc. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24 #include "precompiled.hpp"
25
26 #include "gc/shenandoah/shenandoahFreeSet.hpp"
27 #include "gc/shenandoah/shenandoahHeap.hpp"
28 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
29 #include "gc/shenandoah/shenandoahUtils.hpp"
30 #include "gc/shenandoah/shenandoahVerifier.hpp"
31 #include "gc/shenandoah/shenandoahYoungGeneration.hpp"
32 #include "gc/shenandoah/heuristics/shenandoahHeuristics.hpp"
33
34 ShenandoahYoungGeneration::ShenandoahYoungGeneration(uint max_queues, size_t max_capacity, size_t soft_max_capacity) :
35 ShenandoahGeneration(YOUNG, max_queues, max_capacity, soft_max_capacity),
36 _old_gen_task_queues(nullptr) {
37 }
38
39 const char* ShenandoahYoungGeneration::name() const {
40 return "YOUNG";
41 }
42
43 void ShenandoahYoungGeneration::set_concurrent_mark_in_progress(bool in_progress) {
44 ShenandoahHeap* heap = ShenandoahHeap::heap();
45 heap->set_concurrent_young_mark_in_progress(in_progress);
46 if (_old_gen_task_queues != nullptr && in_progress && !heap->is_concurrent_prep_for_mixed_evacuation_in_progress()) {
47 // This is not a bug. When the young generation marking is complete,
48 // the old generation marking is still in progress, unless it's not.
49 // In the case that old-gen preparation for mixed evacuation has been
50 // preempted, we do not want to set concurrent old mark to be in progress.
51 heap->set_concurrent_old_mark_in_progress(in_progress);
52 }
53 }
54
55 bool ShenandoahYoungGeneration::contains(ShenandoahHeapRegion* region) const {
56 // TODO: why not test for equals YOUNG_GENERATION? As written, returns true for regions that are FREE
57 return region->affiliation() != OLD_GENERATION;
58 }
59
60 void ShenandoahYoungGeneration::parallel_heap_region_iterate(ShenandoahHeapRegionClosure* cl) {
61 // Just iterate over the young generation here.
62 ShenandoahGenerationRegionClosure<YOUNG> young_regions(cl);
63 ShenandoahHeap::heap()->parallel_heap_region_iterate(&young_regions);
64 }
65
66 void ShenandoahYoungGeneration::heap_region_iterate(ShenandoahHeapRegionClosure* cl) {
67 ShenandoahGenerationRegionClosure<YOUNG> young_regions(cl);
68 ShenandoahHeap::heap()->heap_region_iterate(&young_regions);
69 }
70
71 bool ShenandoahYoungGeneration::is_concurrent_mark_in_progress() {
72 return ShenandoahHeap::heap()->is_concurrent_young_mark_in_progress();
73 }
74
75 void ShenandoahYoungGeneration::reserve_task_queues(uint workers) {
76 ShenandoahGeneration::reserve_task_queues(workers);
77 if (_old_gen_task_queues != NULL) {
78 _old_gen_task_queues->reserve(workers);
79 }
80 }
81
82 bool ShenandoahYoungGeneration::contains(oop obj) const {
83 return ShenandoahHeap::heap()->is_in_young(obj);
84 }
85
86 ShenandoahHeuristics* ShenandoahYoungGeneration::initialize_heuristics(ShenandoahMode* gc_mode) {
87 _heuristics = gc_mode->initialize_heuristics(this);
88 _heuristics->set_guaranteed_gc_interval(ShenandoahGuaranteedYoungGCInterval);
89 confirm_heuristics_mode();
90 return _heuristics;
91 }