1 /*
  2  * Copyright (c) 2013, 2021, 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 
 25 #include "precompiled.hpp"
 26 
 27 #include "gc/shenandoah/shenandoahConcurrentGC.hpp"
 28 #include "gc/shenandoah/shenandoahDegeneratedGC.hpp"
 29 #include "gc/shenandoah/shenandoahFullGC.hpp"
 30 #include "gc/shenandoah/shenandoahGeneration.hpp"
 31 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
 32 #include "gc/shenandoah/shenandoahMark.inline.hpp"
 33 #include "gc/shenandoah/shenandoahOopClosures.inline.hpp"
 34 #include "gc/shenandoah/shenandoahUtils.hpp"
 35 #include "gc/shenandoah/shenandoahVMOperations.hpp"
 36 #include "memory/universe.hpp"
 37 
 38 bool VM_ShenandoahReferenceOperation::doit_prologue() {
 39   Heap_lock->lock();
 40   return true;
 41 }
 42 
 43 void VM_ShenandoahReferenceOperation::doit_epilogue() {
 44   if (Universe::has_reference_pending_list()) {
 45     Heap_lock->notify_all();
 46   }
 47   Heap_lock->unlock();
 48 }
 49 
 50 void VM_ShenandoahInitMark::doit() {
 51   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::CONCURRENT);
 52   _gc->entry_init_mark();
 53 }
 54 
 55 void VM_ShenandoahFinalMarkStartEvac::doit() {
 56   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::CONCURRENT);
 57   _gc->entry_final_mark();
 58 }
 59 
 60 void VM_ShenandoahFullGC::doit() {
 61   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::FULL);
 62   _full_gc->entry_full(_gc_cause);
 63 }
 64 
 65 void VM_ShenandoahDegeneratedGC::doit() {
 66   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::CONCURRENT);
 67   _gc->entry_degenerated();
 68 }
 69 
 70 void VM_ShenandoahInitUpdateRefs::doit() {
 71   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::CONCURRENT);
 72   _gc->entry_init_updaterefs();
 73 }
 74 
 75 void VM_ShenandoahFinalUpdateRefs::doit() {
 76   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::CONCURRENT);
 77   _gc->entry_final_updaterefs();
 78 }
 79 
 80 void VM_ShenandoahFinalRoots::doit() {
 81   ShenandoahGCPauseMark mark(_gc_id, SvcGCMarker::CONCURRENT);
 82   if (_incr_region_ages) {
 83     // TODO: Do we even care about this?  Do we want to parallelize it?
 84     ShenandoahHeap* heap = ShenandoahHeap::heap();
 85     ShenandoahMarkingContext* ctx = heap->complete_marking_context();
 86 
 87     for (size_t i = 0; i < heap->num_regions(); i++) {
 88       ShenandoahHeapRegion *r = heap->get_region(i);
 89       if (r->is_active() && r->is_young()) {
 90         HeapWord* tams = ctx->top_at_mark_start(r);
 91         HeapWord* top = r->top();
 92         if (top > tams) {
 93           r->reset_age();
 94         } else {
 95           r->increment_age();
 96         }
 97       }
 98     }
 99   }
100   _gc->entry_final_roots();
101 }