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/shenandoahAgeCensus.hpp" 27 #include "gc/shenandoah/shenandoahFreeSet.hpp" 28 #include "gc/shenandoah/shenandoahHeap.hpp" 29 #include "gc/shenandoah/shenandoahHeapRegionClosures.hpp" 30 #include "gc/shenandoah/shenandoahUtils.hpp" 31 #include "gc/shenandoah/shenandoahYoungGeneration.hpp" 32 #include "gc/shenandoah/heuristics/shenandoahYoungHeuristics.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 void ShenandoahYoungGeneration::set_concurrent_mark_in_progress(bool in_progress) { 40 ShenandoahHeap* heap = ShenandoahHeap::heap(); 41 heap->set_concurrent_young_mark_in_progress(in_progress); 42 if (is_bootstrap_cycle() && in_progress && !heap->is_prepare_for_old_mark_in_progress()) { 43 // This is not a bug. When the bootstrapping marking phase is complete, 44 // the old generation marking is still in progress, unless it's not. 45 // In the case that old-gen preparation for mixed evacuation has been 46 // preempted, we do not want to set concurrent old mark to be in progress. 47 heap->set_concurrent_old_mark_in_progress(in_progress); 48 } 49 } 50 51 bool ShenandoahYoungGeneration::contains(ShenandoahHeapRegion* region) const { 52 // TODO: why not test for equals YOUNG_GENERATION? As written, returns true for regions that are FREE 53 return !region->is_old(); 54 } 55 56 void ShenandoahYoungGeneration::parallel_heap_region_iterate(ShenandoahHeapRegionClosure* cl) { 57 // Just iterate over the young generation here. 58 ShenandoahIncludeRegionClosure<YOUNG_GENERATION> young_regions_cl(cl); 59 ShenandoahHeap::heap()->parallel_heap_region_iterate(&young_regions_cl); 60 } 61 62 void ShenandoahYoungGeneration::heap_region_iterate(ShenandoahHeapRegionClosure* cl) { 63 ShenandoahIncludeRegionClosure<YOUNG_GENERATION> young_regions_cl(cl); 64 ShenandoahHeap::heap()->heap_region_iterate(&young_regions_cl); 65 } 66 67 void ShenandoahYoungGeneration::parallel_region_iterate_free(ShenandoahHeapRegionClosure* cl) { 68 ShenandoahExcludeRegionClosure<OLD_GENERATION> exclude_cl(cl); 69 ShenandoahHeap::heap()->parallel_heap_region_iterate(&exclude_cl); 70 } 71 72 bool ShenandoahYoungGeneration::is_concurrent_mark_in_progress() { 73 return ShenandoahHeap::heap()->is_concurrent_young_mark_in_progress(); 74 } 75 76 void ShenandoahYoungGeneration::reserve_task_queues(uint workers) { 77 ShenandoahGeneration::reserve_task_queues(workers); 78 if (is_bootstrap_cycle()) { 79 _old_gen_task_queues->reserve(workers); 80 } 81 } 82 83 bool ShenandoahYoungGeneration::contains(oop obj) const { 84 return ShenandoahHeap::heap()->is_in_young(obj); 85 } 86 87 ShenandoahHeuristics* ShenandoahYoungGeneration::initialize_heuristics(ShenandoahMode* gc_mode) { 88 _young_heuristics = new ShenandoahYoungHeuristics(this); 89 _heuristics = _young_heuristics; 90 _heuristics->set_guaranteed_gc_interval(ShenandoahGuaranteedYoungGCInterval); 91 confirm_heuristics_mode(); 92 return _heuristics; 93 } 94 95 size_t ShenandoahYoungGeneration::available() const { 96 // The collector reserve may eat into what the mutator is allowed to use. Make sure we are looking 97 // at what is available to the mutator when reporting how much memory is available. 98 size_t available = this->ShenandoahGeneration::available(); 99 return MIN2(available, ShenandoahHeap::heap()->free_set()->available()); 100 } 101 102 size_t ShenandoahYoungGeneration::soft_available() const { 103 size_t available = this->ShenandoahGeneration::soft_available(); 104 return MIN2(available, ShenandoahHeap::heap()->free_set()->available()); 105 } 106 107 void ShenandoahYoungGeneration::prepare_gc() { 108 109 ShenandoahGeneration::prepare_gc(); 110 111 assert(type() == YOUNG, "Error?"); 112 // Clear any stale/partial local census data before the start of a 113 // new marking cycle 114 ShenandoahGenerationalHeap::heap()->age_census()->reset_local(); 115 }