ysr@777: /*
xdono@1279:  * Copyright 2001-2009 Sun Microsystems, Inc.  All Rights Reserved.
ysr@777:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@777:  *
ysr@777:  * This code is free software; you can redistribute it and/or modify it
ysr@777:  * under the terms of the GNU General Public License version 2 only, as
ysr@777:  * published by the Free Software Foundation.
ysr@777:  *
ysr@777:  * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@777:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@777:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
ysr@777:  * version 2 for more details (a copy is included in the LICENSE file that
ysr@777:  * accompanied this code).
ysr@777:  *
ysr@777:  * You should have received a copy of the GNU General Public License version
ysr@777:  * 2 along with this work; if not, write to the Free Software Foundation,
ysr@777:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@777:  *
ysr@777:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
ysr@777:  * CA 95054 USA or visit www.sun.com if you need additional information or
ysr@777:  * have any questions.
ysr@777:  *
ysr@777:  */
ysr@777: 
ysr@777: # include "incls/_precompiled.incl"
ysr@777: # include "incls/_dirtyCardQueue.cpp.incl"
ysr@777: 
ysr@777: bool DirtyCardQueue::apply_closure(CardTableEntryClosure* cl,
ysr@777:                                    bool consume,
ysr@777:                                    size_t worker_i) {
ysr@777:   bool res = true;
ysr@777:   if (_buf != NULL) {
ysr@777:     res = apply_closure_to_buffer(cl, _buf, _index, _sz,
ysr@777:                                   consume,
ysr@777:                                   (int) worker_i);
ysr@777:     if (res && consume) _index = _sz;
ysr@777:   }
ysr@777:   return res;
ysr@777: }
ysr@777: 
ysr@777: bool DirtyCardQueue::apply_closure_to_buffer(CardTableEntryClosure* cl,
ysr@777:                                              void** buf,
ysr@777:                                              size_t index, size_t sz,
ysr@777:                                              bool consume,
ysr@777:                                              int worker_i) {
ysr@777:   if (cl == NULL) return true;
ysr@777:   for (size_t i = index; i < sz; i += oopSize) {
ysr@777:     int ind = byte_index_to_index((int)i);
ysr@777:     jbyte* card_ptr = (jbyte*)buf[ind];
ysr@777:     if (card_ptr != NULL) {
ysr@777:       // Set the entry to null, so we don't do it again (via the test
ysr@777:       // above) if we reconsider this buffer.
ysr@777:       if (consume) buf[ind] = NULL;
ysr@777:       if (!cl->do_card_ptr(card_ptr, worker_i)) return false;
ysr@777:     }
ysr@777:   }
ysr@777:   return true;
ysr@777: }
ysr@777: 
ysr@777: #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
ysr@777: #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
ysr@777: #endif // _MSC_VER
ysr@777: 
ysr@777: DirtyCardQueueSet::DirtyCardQueueSet() :
ysr@777:   PtrQueueSet(true /*notify_when_complete*/),
ysr@777:   _closure(NULL),
ysr@777:   _shared_dirty_card_queue(this, true /*perm*/),
ysr@777:   _free_ids(NULL),
ysr@777:   _processed_buffers_mut(0), _processed_buffers_rs_thread(0)
ysr@777: {
ysr@777:   _all_active = true;
ysr@777: }
ysr@777: 
iveresov@1230: // Determines how many mutator threads can process the buffers in parallel.
ysr@777: size_t DirtyCardQueueSet::num_par_ids() {
iveresov@1230:   return os::processor_count();
ysr@777: }
ysr@777: 
ysr@777: void DirtyCardQueueSet::initialize(Monitor* cbl_mon, Mutex* fl_lock,
ysr@777:                                    int max_completed_queue,
iveresov@1051:                                    Mutex* lock, PtrQueueSet* fl_owner) {
iveresov@1051:   PtrQueueSet::initialize(cbl_mon, fl_lock, max_completed_queue, fl_owner);
tonyp@1318:   set_buffer_size(G1UpdateBufferSize);
tonyp@1318:   set_process_completed_threshold(G1UpdateBufferQueueProcessingThreshold);
ysr@777: 
ysr@777:   _shared_dirty_card_queue.set_lock(lock);
ysr@777:   _free_ids = new FreeIdSet((int) num_par_ids(), _cbl_mon);
ysr@777: }
ysr@777: 
ysr@777: void DirtyCardQueueSet::handle_zero_index_for_thread(JavaThread* t) {
ysr@777:   t->dirty_card_queue().handle_zero_index();
ysr@777: }
ysr@777: 
ysr@777: void DirtyCardQueueSet::set_closure(CardTableEntryClosure* closure) {
ysr@777:   _closure = closure;
ysr@777: }
ysr@777: 
ysr@777: void DirtyCardQueueSet::iterate_closure_all_threads(bool consume,
ysr@777:                                                     size_t worker_i) {
ysr@777:   assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
ysr@777:   for(JavaThread* t = Threads::first(); t; t = t->next()) {
ysr@777:     bool b = t->dirty_card_queue().apply_closure(_closure, consume);
ysr@777:     guarantee(b, "Should not be interrupted.");
ysr@777:   }
ysr@777:   bool b = shared_dirty_card_queue()->apply_closure(_closure,
ysr@777:                                                     consume,
ysr@777:                                                     worker_i);
ysr@777:   guarantee(b, "Should not be interrupted.");
ysr@777: }
ysr@777: 
ysr@777: bool DirtyCardQueueSet::mut_process_buffer(void** buf) {
ysr@777: 
ysr@777:   // Used to determine if we had already claimed a par_id
ysr@777:   // before entering this method.
ysr@777:   bool already_claimed = false;
ysr@777: 
ysr@777:   // We grab the current JavaThread.
ysr@777:   JavaThread* thread = JavaThread::current();
ysr@777: 
ysr@777:   // We get the the number of any par_id that this thread
ysr@777:   // might have already claimed.
ysr@777:   int worker_i = thread->get_claimed_par_id();
ysr@777: 
ysr@777:   // If worker_i is not -1 then the thread has already claimed
ysr@777:   // a par_id. We make note of it using the already_claimed value
ysr@777:   if (worker_i != -1) {
ysr@777:     already_claimed = true;
ysr@777:   } else {
ysr@777: 
ysr@777:     // Otherwise we need to claim a par id
ysr@777:     worker_i = _free_ids->claim_par_id();
ysr@777: 
ysr@777:     // And store the par_id value in the thread
ysr@777:     thread->set_claimed_par_id(worker_i);
ysr@777:   }
ysr@777: 
ysr@777:   bool b = false;
ysr@777:   if (worker_i != -1) {
ysr@777:     b = DirtyCardQueue::apply_closure_to_buffer(_closure, buf, 0,
ysr@777:                                                 _sz, true, worker_i);
ysr@777:     if (b) Atomic::inc(&_processed_buffers_mut);
ysr@777: 
ysr@777:     // If we had not claimed an id before entering the method
ysr@777:     // then we must release the id.
ysr@777:     if (!already_claimed) {
ysr@777: 
ysr@777:       // we release the id
ysr@777:       _free_ids->release_par_id(worker_i);
ysr@777: 
ysr@777:       // and set the claimed_id in the thread to -1
ysr@777:       thread->set_claimed_par_id(-1);
ysr@777:     }
ysr@777:   }
ysr@777:   return b;
ysr@777: }
ysr@777: 
ysr@777: DirtyCardQueueSet::CompletedBufferNode*
johnc@1525: DirtyCardQueueSet::get_completed_buffer(int stop_at) {
ysr@777:   CompletedBufferNode* nd = NULL;
ysr@777:   MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
ysr@777: 
ysr@777:   if ((int)_n_completed_buffers <= stop_at) {
ysr@777:     _process_completed = false;
ysr@777:     return NULL;
ysr@777:   }
ysr@777: 
ysr@777:   if (_completed_buffers_head != NULL) {
ysr@777:     nd = _completed_buffers_head;
ysr@777:     _completed_buffers_head = nd->next;
ysr@777:     if (_completed_buffers_head == NULL)
ysr@777:       _completed_buffers_tail = NULL;
ysr@777:     _n_completed_buffers--;
ysr@777:   }
ysr@777:   debug_only(assert_completed_buffer_list_len_correct_locked());
ysr@777:   return nd;
ysr@777: }
ysr@777: 
ysr@777: bool DirtyCardQueueSet::
ysr@777: apply_closure_to_completed_buffer_helper(int worker_i,
ysr@777:                                          CompletedBufferNode* nd) {
ysr@777:   if (nd != NULL) {
ysr@777:     bool b =
ysr@777:       DirtyCardQueue::apply_closure_to_buffer(_closure, nd->buf,
ysr@777:                                               nd->index, _sz,
ysr@777:                                               true, worker_i);
ysr@777:     void** buf = nd->buf;
tonyp@799:     size_t index = nd->index;
ysr@777:     delete nd;
ysr@777:     if (b) {
ysr@777:       deallocate_buffer(buf);
ysr@777:       return true;  // In normal case, go on to next buffer.
ysr@777:     } else {
tonyp@799:       enqueue_complete_buffer(buf, index, true);
ysr@777:       return false;
ysr@777:     }
ysr@777:   } else {
ysr@777:     return false;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: bool DirtyCardQueueSet::apply_closure_to_completed_buffer(int worker_i,
ysr@777:                                                           int stop_at,
johnc@1525:                                                           bool during_pause)
ysr@777: {
johnc@1525:   assert(!during_pause || stop_at == 0, "Should not leave any completed buffers during a pause");
johnc@1525:   CompletedBufferNode* nd = get_completed_buffer(stop_at);
ysr@777:   bool res = apply_closure_to_completed_buffer_helper(worker_i, nd);
iveresov@1229:   if (res) Atomic::inc(&_processed_buffers_rs_thread);
ysr@777:   return res;
ysr@777: }
ysr@777: 
ysr@777: void DirtyCardQueueSet::apply_closure_to_all_completed_buffers() {
ysr@777:   CompletedBufferNode* nd = _completed_buffers_head;
ysr@777:   while (nd != NULL) {
ysr@777:     bool b =
ysr@777:       DirtyCardQueue::apply_closure_to_buffer(_closure, nd->buf, 0, _sz,
ysr@777:                                               false);
ysr@777:     guarantee(b, "Should not stop early.");
ysr@777:     nd = nd->next;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: void DirtyCardQueueSet::abandon_logs() {
ysr@777:   assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
ysr@777:   CompletedBufferNode* buffers_to_delete = NULL;
ysr@777:   {
ysr@777:     MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
ysr@777:     while (_completed_buffers_head != NULL) {
ysr@777:       CompletedBufferNode* nd = _completed_buffers_head;
ysr@777:       _completed_buffers_head = nd->next;
ysr@777:       nd->next = buffers_to_delete;
ysr@777:       buffers_to_delete = nd;
ysr@777:     }
ysr@777:     _n_completed_buffers = 0;
ysr@777:     _completed_buffers_tail = NULL;
ysr@777:     debug_only(assert_completed_buffer_list_len_correct_locked());
ysr@777:   }
ysr@777:   while (buffers_to_delete != NULL) {
ysr@777:     CompletedBufferNode* nd = buffers_to_delete;
ysr@777:     buffers_to_delete = nd->next;
ysr@777:     deallocate_buffer(nd->buf);
ysr@777:     delete nd;
ysr@777:   }
ysr@777:   // Since abandon is done only at safepoints, we can safely manipulate
ysr@777:   // these queues.
ysr@777:   for (JavaThread* t = Threads::first(); t; t = t->next()) {
ysr@777:     t->dirty_card_queue().reset();
ysr@777:   }
ysr@777:   shared_dirty_card_queue()->reset();
ysr@777: }
ysr@777: 
ysr@777: 
ysr@777: void DirtyCardQueueSet::concatenate_logs() {
ysr@777:   // Iterate over all the threads, if we find a partial log add it to
ysr@777:   // the global list of logs.  Temporarily turn off the limit on the number
ysr@777:   // of outstanding buffers.
ysr@777:   int save_max_completed_queue = _max_completed_queue;
ysr@777:   _max_completed_queue = max_jint;
ysr@777:   assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
ysr@777:   for (JavaThread* t = Threads::first(); t; t = t->next()) {
ysr@777:     DirtyCardQueue& dcq = t->dirty_card_queue();
ysr@777:     if (dcq.size() != 0) {
ysr@777:       void **buf = t->dirty_card_queue().get_buf();
ysr@777:       // We must NULL out the unused entries, then enqueue.
ysr@777:       for (size_t i = 0; i < t->dirty_card_queue().get_index(); i += oopSize) {
ysr@777:         buf[PtrQueue::byte_index_to_index((int)i)] = NULL;
ysr@777:       }
ysr@777:       enqueue_complete_buffer(dcq.get_buf(), dcq.get_index());
ysr@777:       dcq.reinitialize();
ysr@777:     }
ysr@777:   }
ysr@777:   if (_shared_dirty_card_queue.size() != 0) {
ysr@777:     enqueue_complete_buffer(_shared_dirty_card_queue.get_buf(),
ysr@777:                             _shared_dirty_card_queue.get_index());
ysr@777:     _shared_dirty_card_queue.reinitialize();
ysr@777:   }
ysr@777:   // Restore the completed buffer queue limit.
ysr@777:   _max_completed_queue = save_max_completed_queue;
ysr@777: }