1 /*
2 * Copyright Amazon.com Inc. or its affiliates. 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/shenandoahOldGeneration.hpp"
30 #include "gc/shenandoah/shenandoahUtils.hpp"
31 #include "gc/shenandoah/shenandoahVerifier.hpp"
32 #include "gc/shenandoah/shenandoahYoungGeneration.hpp"
33 #include "gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp"
34
35 ShenandoahYoungGeneration::ShenandoahYoungGeneration(uint max_queues, size_t max_capacity, size_t soft_max_capacity) :
36 ShenandoahGeneration(YOUNG, max_queues, max_capacity, soft_max_capacity),
37 _old_gen_task_queues(nullptr) {
38 }
39
40 void ShenandoahYoungGeneration::set_concurrent_mark_in_progress(bool in_progress) {
41 ShenandoahHeap* heap = ShenandoahHeap::heap();
42 heap->set_concurrent_young_mark_in_progress(in_progress);
43 if (is_bootstrap_cycle() && in_progress && !heap->is_prepare_for_old_mark_in_progress()) {
44 // This is not a bug. When the bootstrapping marking phase is complete,
45 // the old generation marking is still in progress, unless it's not.
46 // In the case that old-gen preparation for mixed evacuation has been
47 // preempted, we do not want to set concurrent old mark to be in progress.
48 heap->set_concurrent_old_mark_in_progress(in_progress);
49 }
50 }
51
52 bool ShenandoahYoungGeneration::contains(ShenandoahHeapRegion* region) const {
53 // TODO: why not test for equals YOUNG_GENERATION? As written, returns true for regions that are FREE
54 return !region->is_old();
55 }
56
57 void ShenandoahYoungGeneration::parallel_heap_region_iterate(ShenandoahHeapRegionClosure* cl) {
58 // Just iterate over the young generation here.
59 ShenandoahGenerationRegionClosure<YOUNG> young_regions(cl);
60 ShenandoahHeap::heap()->parallel_heap_region_iterate(&young_regions);
61 }
62
63 void ShenandoahYoungGeneration::heap_region_iterate(ShenandoahHeapRegionClosure* cl) {
64 ShenandoahGenerationRegionClosure<YOUNG> young_regions(cl);
65 ShenandoahHeap::heap()->heap_region_iterate(&young_regions);
66 }
67
68 bool ShenandoahYoungGeneration::is_concurrent_mark_in_progress() {
69 return ShenandoahHeap::heap()->is_concurrent_young_mark_in_progress();
70 }
71
72 void ShenandoahYoungGeneration::reserve_task_queues(uint workers) {
73 ShenandoahGeneration::reserve_task_queues(workers);
74 if (is_bootstrap_cycle()) {
75 _old_gen_task_queues->reserve(workers);
76 }
77 }
78
79 bool ShenandoahYoungGeneration::contains(oop obj) const {
80 return ShenandoahHeap::heap()->is_in_young(obj);
81 }
82
83 ShenandoahHeuristics* ShenandoahYoungGeneration::initialize_heuristics(ShenandoahMode* gc_mode) {
84 _heuristics = new ShenandoahYoungHeuristics(this);
85 _heuristics->set_guaranteed_gc_interval(ShenandoahGuaranteedYoungGCInterval);
86 confirm_heuristics_mode();
87 return _heuristics;
88 }
89
90 size_t ShenandoahYoungGeneration::available() const {
91 // The collector reserve may eat into what the mutator is allowed to use. Make sure we are looking
92 // at what is available to the mutator when reporting how much memory is available.
93 size_t available = this->ShenandoahGeneration::available();
94 return MIN2(available, ShenandoahHeap::heap()->free_set()->available());
95 }
96
97 size_t ShenandoahYoungGeneration::soft_available() const {
98 size_t available = this->ShenandoahGeneration::soft_available();
99 return MIN2(available, ShenandoahHeap::heap()->free_set()->available());
100 }