src/share/vm/gc_implementation/g1/dirtyCardQueue.hpp

Thu, 03 Apr 2014 17:49:31 +0400

author
vkempik
date
Thu, 03 Apr 2014 17:49:31 +0400
changeset 6552
8847586c9037
parent 4153
b9a9ed0f8eeb
child 6876
710a3c8b516e
child 6930
570cb6369f17
child 7445
42c091d63c72
permissions
-rw-r--r--

8016302: Change type of the number of GC workers to unsigned int (2)
Reviewed-by: tschatzl, jwilhelm

ysr@777 1 /*
mikael@4153 2 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved.
ysr@777 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@777 4 *
ysr@777 5 * This code is free software; you can redistribute it and/or modify it
ysr@777 6 * under the terms of the GNU General Public License version 2 only, as
ysr@777 7 * published by the Free Software Foundation.
ysr@777 8 *
ysr@777 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@777 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@777 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@777 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@777 13 * accompanied this code).
ysr@777 14 *
ysr@777 15 * You should have received a copy of the GNU General Public License version
ysr@777 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@777 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@777 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
ysr@777 22 *
ysr@777 23 */
ysr@777 24
stefank@2314 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_DIRTYCARDQUEUE_HPP
stefank@2314 26 #define SHARE_VM_GC_IMPLEMENTATION_G1_DIRTYCARDQUEUE_HPP
stefank@2314 27
stefank@2314 28 #include "gc_implementation/g1/ptrQueue.hpp"
stefank@2314 29 #include "memory/allocation.hpp"
stefank@2314 30
ysr@777 31 class FreeIdSet;
ysr@777 32
ysr@777 33 // A closure class for processing card table entries. Note that we don't
ysr@777 34 // require these closure objects to be stack-allocated.
zgu@3900 35 class CardTableEntryClosure: public CHeapObj<mtGC> {
ysr@777 36 public:
ysr@777 37 // Process the card whose card table entry is "card_ptr". If returns
ysr@777 38 // "false", terminate the iteration early.
vkempik@6552 39 virtual bool do_card_ptr(jbyte* card_ptr, uint worker_i = 0) = 0;
ysr@777 40 };
ysr@777 41
ysr@777 42 // A ptrQueue whose elements are "oops", pointers to object heads.
ysr@777 43 class DirtyCardQueue: public PtrQueue {
ysr@777 44 public:
ysr@777 45 DirtyCardQueue(PtrQueueSet* qset_, bool perm = false) :
tonyp@2197 46 // Dirty card queues are always active, so we create them with their
tonyp@2197 47 // active field set to true.
tonyp@2197 48 PtrQueue(qset_, perm, true /* active */) { }
tonyp@2197 49
ysr@777 50 // Apply the closure to all elements, and reset the index to make the
ysr@777 51 // buffer empty. If a closure application returns "false", return
ysr@777 52 // "false" immediately, halting the iteration. If "consume" is true,
ysr@777 53 // deletes processed entries from logs.
ysr@777 54 bool apply_closure(CardTableEntryClosure* cl,
ysr@777 55 bool consume = true,
vkempik@6552 56 uint worker_i = 0);
ysr@777 57
ysr@777 58 // Apply the closure to all elements of "buf", down to "index"
ysr@777 59 // (inclusive.) If returns "false", then a closure application returned
ysr@777 60 // "false", and we return immediately. If "consume" is true, entries are
ysr@777 61 // set to NULL as they are processed, so they will not be processed again
ysr@777 62 // later.
ysr@777 63 static bool apply_closure_to_buffer(CardTableEntryClosure* cl,
ysr@777 64 void** buf, size_t index, size_t sz,
ysr@777 65 bool consume = true,
vkempik@6552 66 uint worker_i = 0);
ysr@777 67 void **get_buf() { return _buf;}
ysr@777 68 void set_buf(void **buf) {_buf = buf;}
ysr@777 69 size_t get_index() { return _index;}
ysr@777 70 void reinitialize() { _buf = 0; _sz = 0; _index = 0;}
ysr@777 71 };
ysr@777 72
ysr@777 73
ysr@777 74
ysr@777 75 class DirtyCardQueueSet: public PtrQueueSet {
ysr@777 76 CardTableEntryClosure* _closure;
ysr@777 77
ysr@777 78 DirtyCardQueue _shared_dirty_card_queue;
ysr@777 79
ysr@777 80 // Override.
ysr@777 81 bool mut_process_buffer(void** buf);
ysr@777 82
ysr@777 83 // Protected by the _cbl_mon.
ysr@777 84 FreeIdSet* _free_ids;
ysr@777 85
ysr@777 86 // The number of completed buffers processed by mutator and rs thread,
ysr@777 87 // respectively.
ysr@777 88 jint _processed_buffers_mut;
ysr@777 89 jint _processed_buffers_rs_thread;
ysr@777 90
ysr@777 91 public:
iveresov@1546 92 DirtyCardQueueSet(bool notify_when_complete = true);
ysr@777 93
ysr@777 94 void initialize(Monitor* cbl_mon, Mutex* fl_lock,
iveresov@1546 95 int process_completed_threshold,
iveresov@1546 96 int max_completed_queue,
iveresov@1546 97 Mutex* lock, PtrQueueSet* fl_owner = NULL);
ysr@777 98
ysr@777 99 // The number of parallel ids that can be claimed to allow collector or
ysr@777 100 // mutator threads to do card-processing work.
vkempik@6552 101 static uint num_par_ids();
ysr@777 102
ysr@777 103 static void handle_zero_index_for_thread(JavaThread* t);
ysr@777 104
ysr@777 105 // Register "blk" as "the closure" for all queues. Only one such closure
ysr@777 106 // is allowed. The "apply_closure_to_completed_buffer" method will apply
ysr@777 107 // this closure to a completed buffer, and "iterate_closure_all_threads"
ysr@777 108 // applies it to partially-filled buffers (the latter should only be done
ysr@777 109 // with the world stopped).
ysr@777 110 void set_closure(CardTableEntryClosure* closure);
ysr@777 111
ysr@777 112 // If there is a registered closure for buffers, apply it to all entries
ysr@777 113 // in all currently-active buffers. This should only be applied at a
ysr@777 114 // safepoint. (Currently must not be called in parallel; this should
ysr@777 115 // change in the future.) If "consume" is true, processed entries are
ysr@777 116 // discarded.
ysr@777 117 void iterate_closure_all_threads(bool consume = true,
vkempik@6552 118 uint worker_i = 0);
ysr@777 119
ysr@777 120 // If there exists some completed buffer, pop it, then apply the
ysr@777 121 // registered closure to all its elements, nulling out those elements
ysr@777 122 // processed. If all elements are processed, returns "true". If no
ysr@777 123 // completed buffers exist, returns false. If a completed buffer exists,
ysr@777 124 // but is only partially completed before a "yield" happens, the
ysr@777 125 // partially completed buffer (with its processed elements set to NULL)
ysr@777 126 // is returned to the completed buffer set, and this call returns false.
vkempik@6552 127 bool apply_closure_to_completed_buffer(uint worker_i = 0,
ysr@777 128 int stop_at = 0,
johnc@1525 129 bool during_pause = false);
johnc@1525 130
johnc@2060 131 // If there exists some completed buffer, pop it, then apply the
johnc@2060 132 // specified closure to all its elements, nulling out those elements
johnc@2060 133 // processed. If all elements are processed, returns "true". If no
johnc@2060 134 // completed buffers exist, returns false. If a completed buffer exists,
johnc@2060 135 // but is only partially completed before a "yield" happens, the
johnc@2060 136 // partially completed buffer (with its processed elements set to NULL)
johnc@2060 137 // is returned to the completed buffer set, and this call returns false.
johnc@2060 138 bool apply_closure_to_completed_buffer(CardTableEntryClosure* cl,
vkempik@6552 139 uint worker_i = 0,
johnc@2060 140 int stop_at = 0,
johnc@2060 141 bool during_pause = false);
johnc@2060 142
johnc@2060 143 // Helper routine for the above.
johnc@2060 144 bool apply_closure_to_completed_buffer_helper(CardTableEntryClosure* cl,
vkempik@6552 145 uint worker_i,
iveresov@1546 146 BufferNode* nd);
ysr@777 147
iveresov@1546 148 BufferNode* get_completed_buffer(int stop_at);
johnc@1525 149
ysr@777 150 // Applies the current closure to all completed buffers,
ysr@777 151 // non-consumptively.
ysr@777 152 void apply_closure_to_all_completed_buffers();
ysr@777 153
ysr@777 154 DirtyCardQueue* shared_dirty_card_queue() {
ysr@777 155 return &_shared_dirty_card_queue;
ysr@777 156 }
ysr@777 157
johnc@2060 158 // Deallocate any completed log buffers
johnc@2060 159 void clear();
johnc@2060 160
ysr@777 161 // If a full collection is happening, reset partial logs, and ignore
ysr@777 162 // completed ones: the full collection will make them all irrelevant.
ysr@777 163 void abandon_logs();
ysr@777 164
ysr@777 165 // If any threads have partial logs, add them to the global list of logs.
ysr@777 166 void concatenate_logs();
ysr@777 167 void clear_n_completed_buffers() { _n_completed_buffers = 0;}
ysr@777 168
ysr@777 169 jint processed_buffers_mut() {
ysr@777 170 return _processed_buffers_mut;
ysr@777 171 }
ysr@777 172 jint processed_buffers_rs_thread() {
ysr@777 173 return _processed_buffers_rs_thread;
ysr@777 174 }
ysr@777 175
ysr@777 176 };
stefank@2314 177
stefank@2314 178 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_DIRTYCARDQUEUE_HPP

mercurial