< prev index next >

src/hotspot/share/gc/g1/dirtyCardQueue.cpp

Print this page
rev 53150 : [mq]: use_semaphore
rev 53151 : [mq]: tschatzl_review
   1 /*
   2  * Copyright (c) 2001, 2018, Oracle and/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 
  25 #include "precompiled.hpp"
  26 #include "gc/g1/dirtyCardQueue.hpp"
  27 #include "gc/g1/g1CollectedHeap.inline.hpp"

  28 #include "gc/g1/g1RemSet.hpp"
  29 #include "gc/g1/g1ThreadLocalData.hpp"
  30 #include "gc/g1/heapRegionRemSet.hpp"
  31 #include "gc/shared/suspendibleThreadSet.hpp"
  32 #include "gc/shared/workgroup.hpp"
  33 #include "runtime/atomic.hpp"
  34 #include "runtime/flags/flagSetting.hpp"
  35 #include "runtime/mutexLocker.hpp"
  36 #include "runtime/safepoint.hpp"
  37 #include "runtime/thread.inline.hpp"
  38 #include "runtime/threadSMR.hpp"
  39 
  40 // Closure used for updating remembered sets and recording references that
  41 // point into the collection set while the mutator is running.
  42 // Assumed to be only executed concurrently with the mutator. Yields via
  43 // SuspendibleThreadSet after every card.
  44 class G1RefineCardConcurrentlyClosure: public CardTableEntryClosure {
  45 public:
  46   bool do_card_ptr(jbyte* card_ptr, uint worker_i) {
  47     G1CollectedHeap::heap()->g1_rem_set()->refine_card_concurrently(card_ptr, worker_i);
  48 
  49     if (SuspendibleThreadSet::should_yield()) {
  50       // Caller will actually yield.
  51       return false;
  52     }
  53     // Otherwise, we finished successfully; return true.
  54     return true;
  55   }
  56 };
  57 
  58 // Represents a set of free small integer ids.
  59 class FreeIdSet : public CHeapObj<mtGC> {
  60   enum {
  61     end_of_list = UINT_MAX,
  62     claimed = UINT_MAX - 1
  63   };
  64 
  65   uint _size;
  66   Monitor* _mon;
  67 
  68   uint* _ids;
  69   uint _hd;
  70   uint _waiters;
  71   uint _claimed;
  72 
  73 public:
  74   FreeIdSet(uint size, Monitor* mon);
  75   ~FreeIdSet();
  76 
  77   // Returns an unclaimed parallel id (waiting for one to be released if
  78   // necessary).
  79   uint claim_par_id();
  80 
  81   void release_par_id(uint id);
  82 };
  83 
  84 FreeIdSet::FreeIdSet(uint size, Monitor* mon) :
  85   _size(size), _mon(mon), _hd(0), _waiters(0), _claimed(0)
  86 {
  87   guarantee(size != 0, "must be");
  88   _ids = NEW_C_HEAP_ARRAY(uint, size, mtGC);
  89   for (uint i = 0; i < size - 1; i++) {
  90     _ids[i] = i+1;
  91   }
  92   _ids[size-1] = end_of_list; // end of list.
  93 }
  94 
  95 FreeIdSet::~FreeIdSet() {
  96   FREE_C_HEAP_ARRAY(uint, _ids);
  97 }
  98 
  99 uint FreeIdSet::claim_par_id() {
 100   MutexLockerEx x(_mon, Mutex::_no_safepoint_check_flag);
 101   while (_hd == end_of_list) {
 102     _waiters++;
 103     _mon->wait(Mutex::_no_safepoint_check_flag);
 104     _waiters--;
 105   }
 106   uint res = _hd;
 107   _hd = _ids[res];
 108   _ids[res] = claimed;  // For debugging.
 109   _claimed++;
 110   return res;
 111 }
 112 
 113 void FreeIdSet::release_par_id(uint id) {
 114   MutexLockerEx x(_mon, Mutex::_no_safepoint_check_flag);
 115   assert(_ids[id] == claimed, "Precondition.");
 116   _ids[id] = _hd;
 117   _hd = id;
 118   _claimed--;
 119   if (_waiters > 0) {
 120     _mon->notify_all();
 121   }
 122 }
 123 
 124 DirtyCardQueue::DirtyCardQueue(DirtyCardQueueSet* qset, bool permanent) :
 125   // Dirty card queues are always active, so we create them with their
 126   // active field set to true.
 127   PtrQueue(qset, permanent, true /* active */)
 128 { }
 129 
 130 DirtyCardQueue::~DirtyCardQueue() {
 131   if (!is_permanent()) {
 132     flush();
 133   }
 134 }
 135 
 136 DirtyCardQueueSet::DirtyCardQueueSet(bool notify_when_complete) :
 137   PtrQueueSet(notify_when_complete),
 138   _shared_dirty_card_queue(this, true /* permanent */),
 139   _free_ids(NULL),
 140   _processed_buffers_mut(0),
 141   _processed_buffers_rs_thread(0),
 142   _cur_par_buffer_node(NULL)
 143 {
 144   _all_active = true;
 145 }
 146 




 147 // Determines how many mutator threads can process the buffers in parallel.
 148 uint DirtyCardQueueSet::num_par_ids() {
 149   return (uint)os::initial_active_processor_count();
 150 }
 151 
 152 void DirtyCardQueueSet::initialize(Monitor* cbl_mon,
 153                                    BufferNode::Allocator* allocator,
 154                                    Mutex* lock,
 155                                    bool init_free_ids) {
 156   PtrQueueSet::initialize(cbl_mon, allocator);
 157   _shared_dirty_card_queue.set_lock(lock);
 158   if (init_free_ids) {
 159     _free_ids = new FreeIdSet(num_par_ids(), cbl_mon);
 160   }
 161 }
 162 
 163 void DirtyCardQueueSet::handle_zero_index_for_thread(JavaThread* t) {
 164   G1ThreadLocalData::dirty_card_queue(t).handle_zero_index();
 165 }
 166 
 167 bool DirtyCardQueueSet::apply_closure_to_buffer(CardTableEntryClosure* cl,
 168                                                 BufferNode* node,
 169                                                 bool consume,
 170                                                 uint worker_i) {
 171   if (cl == NULL) return true;
 172   bool result = true;
 173   void** buf = BufferNode::make_buffer_from_node(node);
 174   size_t i = node->index();
 175   size_t limit = buffer_size();
 176   for ( ; i < limit; ++i) {
 177     jbyte* card_ptr = static_cast<jbyte*>(buf[i]);
 178     assert(card_ptr != NULL, "invariant");
 179     if (!cl->do_card_ptr(card_ptr, worker_i)) {


   1 /*
   2  * Copyright (c) 2001, 2019, Oracle and/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 
  25 #include "precompiled.hpp"
  26 #include "gc/g1/dirtyCardQueue.hpp"
  27 #include "gc/g1/g1CollectedHeap.inline.hpp"
  28 #include "gc/g1/g1FreeIdSet.hpp"
  29 #include "gc/g1/g1RemSet.hpp"
  30 #include "gc/g1/g1ThreadLocalData.hpp"
  31 #include "gc/g1/heapRegionRemSet.hpp"
  32 #include "gc/shared/suspendibleThreadSet.hpp"
  33 #include "gc/shared/workgroup.hpp"
  34 #include "runtime/atomic.hpp"
  35 #include "runtime/flags/flagSetting.hpp"
  36 #include "runtime/mutexLocker.hpp"
  37 #include "runtime/safepoint.hpp"
  38 #include "runtime/thread.inline.hpp"
  39 #include "runtime/threadSMR.hpp"
  40 
  41 // Closure used for updating remembered sets and recording references that
  42 // point into the collection set while the mutator is running.
  43 // Assumed to be only executed concurrently with the mutator. Yields via
  44 // SuspendibleThreadSet after every card.
  45 class G1RefineCardConcurrentlyClosure: public CardTableEntryClosure {
  46 public:
  47   bool do_card_ptr(jbyte* card_ptr, uint worker_i) {
  48     G1CollectedHeap::heap()->g1_rem_set()->refine_card_concurrently(card_ptr, worker_i);
  49 
  50     if (SuspendibleThreadSet::should_yield()) {
  51       // Caller will actually yield.
  52       return false;
  53     }
  54     // Otherwise, we finished successfully; return true.
  55     return true;
  56   }
  57 };
  58 


































































  59 DirtyCardQueue::DirtyCardQueue(DirtyCardQueueSet* qset, bool permanent) :
  60   // Dirty card queues are always active, so we create them with their
  61   // active field set to true.
  62   PtrQueue(qset, permanent, true /* active */)
  63 { }
  64 
  65 DirtyCardQueue::~DirtyCardQueue() {
  66   if (!is_permanent()) {
  67     flush();
  68   }
  69 }
  70 
  71 DirtyCardQueueSet::DirtyCardQueueSet(bool notify_when_complete) :
  72   PtrQueueSet(notify_when_complete),
  73   _shared_dirty_card_queue(this, true /* permanent */),
  74   _free_ids(NULL),
  75   _processed_buffers_mut(0),
  76   _processed_buffers_rs_thread(0),
  77   _cur_par_buffer_node(NULL)
  78 {
  79   _all_active = true;
  80 }
  81 
  82 DirtyCardQueueSet::~DirtyCardQueueSet() {
  83   delete _free_ids;
  84 }
  85 
  86 // Determines how many mutator threads can process the buffers in parallel.
  87 uint DirtyCardQueueSet::num_par_ids() {
  88   return (uint)os::initial_active_processor_count();
  89 }
  90 
  91 void DirtyCardQueueSet::initialize(Monitor* cbl_mon,
  92                                    BufferNode::Allocator* allocator,
  93                                    Mutex* lock,
  94                                    bool init_free_ids) {
  95   PtrQueueSet::initialize(cbl_mon, allocator);
  96   _shared_dirty_card_queue.set_lock(lock);
  97   if (init_free_ids) {
  98     _free_ids = new G1FreeIdSet(0, num_par_ids());
  99   }
 100 }
 101 
 102 void DirtyCardQueueSet::handle_zero_index_for_thread(JavaThread* t) {
 103   G1ThreadLocalData::dirty_card_queue(t).handle_zero_index();
 104 }
 105 
 106 bool DirtyCardQueueSet::apply_closure_to_buffer(CardTableEntryClosure* cl,
 107                                                 BufferNode* node,
 108                                                 bool consume,
 109                                                 uint worker_i) {
 110   if (cl == NULL) return true;
 111   bool result = true;
 112   void** buf = BufferNode::make_buffer_from_node(node);
 113   size_t i = node->index();
 114   size_t limit = buffer_size();
 115   for ( ; i < limit; ++i) {
 116     jbyte* card_ptr = static_cast<jbyte*>(buf[i]);
 117     assert(card_ptr != NULL, "invariant");
 118     if (!cl->do_card_ptr(card_ptr, worker_i)) {


< prev index next >