1 /* 2 * Copyright (c) 2016, 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/shenandoahHeap.inline.hpp" 28 #include "gc/shenandoah/shenandoahTaskqueue.inline.hpp" 29 #include "logging/log.hpp" 30 #include "logging/logStream.hpp" 31 #include "memory/resourceArea.hpp" 32 33 void ShenandoahObjToScanQueueSet::clear() { 34 uint size = GenericTaskQueueSet<ShenandoahObjToScanQueue, mtGC>::size(); 35 for (uint index = 0; index < size; index ++) { 36 ShenandoahObjToScanQueue* q = queue(index); 37 assert(q != nullptr, "Sanity"); 38 q->clear(); 39 } 40 } 41 42 bool ShenandoahObjToScanQueueSet::is_empty() { 43 uint size = GenericTaskQueueSet<ShenandoahObjToScanQueue, mtGC>::size(); 44 for (uint index = 0; index < size; index ++) { 45 ShenandoahObjToScanQueue* q = queue(index); 46 assert(q != nullptr, "Sanity"); 47 if (!q->is_empty()) { 48 return false; 49 } 50 } 51 return true; 52 } 53 54 #if TASKQUEUE_STATS 55 void ShenandoahObjToScanQueueSet::print_taskqueue_stats_hdr(outputStream* const st) { 56 st->print_raw_cr("GC Task Stats"); 57 st->print_raw("thr "); TaskQueueStats::print_header(1, st); st->cr(); 58 st->print_raw("--- "); TaskQueueStats::print_header(2, st); st->cr(); 59 } 60 61 void ShenandoahObjToScanQueueSet::print_taskqueue_stats() const { 62 if (!log_develop_is_enabled(Trace, gc, task, stats)) { 63 return; 64 } 65 Log(gc, task, stats) log; 66 ResourceMark rm; 67 LogStream ls(log.trace()); 68 outputStream* st = &ls; 69 print_taskqueue_stats_hdr(st); 70 71 ShenandoahObjToScanQueueSet* queues = const_cast<ShenandoahObjToScanQueueSet*>(this); 72 TaskQueueStats totals; 73 const uint n = size(); 74 for (uint i = 0; i < n; ++i) { 75 st->print(UINT32_FORMAT_W(3), i); 76 queues->queue(i)->stats.print(st); 77 st->cr(); 78 totals += queues->queue(i)->stats; 79 } 80 st->print("tot "); totals.print(st); st->cr(); 81 DEBUG_ONLY(totals.verify()); 82 83 } 84 85 void ShenandoahObjToScanQueueSet::reset_taskqueue_stats() { 86 const uint n = size(); 87 for (uint i = 0; i < n; ++i) { 88 queue(i)->stats.reset(); 89 } 90 } 91 #endif // TASKQUEUE_STATS 92 93 bool ShenandoahTerminatorTerminator::should_exit_termination() { 94 return _heap->cancelled_gc(); 95 }