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