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/heapRegionRemSet.hpp"
29 #include "gc/shared/workgroup.hpp"
30 #include "runtime/atomic.inline.hpp"
31 #include "runtime/mutexLocker.hpp"
32 #include "runtime/safepoint.hpp"
33 #include "runtime/thread.inline.hpp"
34
35 bool DirtyCardQueue::apply_closure(CardTableEntryClosure* cl,
36 bool consume,
37 uint worker_i) {
38 bool res = true;
39 if (_buf != NULL) {
40 res = apply_closure_to_buffer(cl, _buf, _index, _sz,
41 consume,
42 worker_i);
43 if (res && consume) _index = _sz;
44 }
45 return res;
46 }
47
48 bool DirtyCardQueue::apply_closure_to_buffer(CardTableEntryClosure* cl,
49 void** buf,
50 size_t index, size_t sz,
51 bool consume,
52 uint worker_i) {
53 if (cl == NULL) return true;
54 for (size_t i = index; i < sz; i += oopSize) {
55 int ind = byte_index_to_index((int)i);
56 jbyte* card_ptr = (jbyte*)buf[ind];
57 if (card_ptr != NULL) {
58 // Set the entry to null, so we don't do it again (via the test
59 // above) if we reconsider this buffer.
60 if (consume) buf[ind] = NULL;
61 if (!cl->do_card_ptr(card_ptr, worker_i)) return false;
62 }
63 }
64 return true;
65 }
66
67 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
68 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
69 #endif // _MSC_VER
70
71 DirtyCardQueueSet::DirtyCardQueueSet(bool notify_when_complete) :
72 PtrQueueSet(notify_when_complete),
73 _mut_process_closure(NULL),
74 _shared_dirty_card_queue(this, true /*perm*/),
75 _free_ids(NULL),
76 _processed_buffers_mut(0), _processed_buffers_rs_thread(0)
77 {
78 _all_active = true;
79 }
80
81 // Determines how many mutator threads can process the buffers in parallel.
82 uint DirtyCardQueueSet::num_par_ids() {
83 return (uint)os::processor_count();
84 }
85
86 void DirtyCardQueueSet::initialize(CardTableEntryClosure* cl, Monitor* cbl_mon, Mutex* fl_lock,
87 int process_completed_threshold,
88 int max_completed_queue,
89 Mutex* lock, PtrQueueSet* fl_owner) {
90 _mut_process_closure = cl;
91 PtrQueueSet::initialize(cbl_mon, fl_lock, process_completed_threshold,
92 max_completed_queue, fl_owner);
93 set_buffer_size(G1UpdateBufferSize);
94 _shared_dirty_card_queue.set_lock(lock);
95 _free_ids = new FreeIdSet((int) num_par_ids(), _cbl_mon);
96 }
97
98 void DirtyCardQueueSet::handle_zero_index_for_thread(JavaThread* t) {
99 t->dirty_card_queue().handle_zero_index();
100 }
101
102 void DirtyCardQueueSet::iterate_closure_all_threads(CardTableEntryClosure* cl,
103 bool consume,
104 uint worker_i) {
105 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
106 for(JavaThread* t = Threads::first(); t; t = t->next()) {
107 bool b = t->dirty_card_queue().apply_closure(cl, consume);
108 guarantee(b, "Should not be interrupted.");
109 }
110 bool b = shared_dirty_card_queue()->apply_closure(cl,
111 consume,
112 worker_i);
113 guarantee(b, "Should not be interrupted.");
114 }
115
116 bool DirtyCardQueueSet::mut_process_buffer(void** buf) {
117
118 // Used to determine if we had already claimed a par_id
119 // before entering this method.
120 bool already_claimed = false;
121
122 // We grab the current JavaThread.
123 JavaThread* thread = JavaThread::current();
124
125 // We get the the number of any par_id that this thread
126 // might have already claimed.
161
162
163 BufferNode*
164 DirtyCardQueueSet::get_completed_buffer(int stop_at) {
165 BufferNode* nd = NULL;
166 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
167
168 if ((int)_n_completed_buffers <= stop_at) {
169 _process_completed = false;
170 return NULL;
171 }
172
173 if (_completed_buffers_head != NULL) {
174 nd = _completed_buffers_head;
175 _completed_buffers_head = nd->next();
176 if (_completed_buffers_head == NULL)
177 _completed_buffers_tail = NULL;
178 _n_completed_buffers--;
179 assert(_n_completed_buffers >= 0, "Invariant");
180 }
181 debug_only(assert_completed_buffer_list_len_correct_locked());
182 return nd;
183 }
184
185 bool DirtyCardQueueSet::
186 apply_closure_to_completed_buffer_helper(CardTableEntryClosure* cl,
187 uint worker_i,
188 BufferNode* nd) {
189 if (nd != NULL) {
190 void **buf = BufferNode::make_buffer_from_node(nd);
191 size_t index = nd->index();
192 bool b =
193 DirtyCardQueue::apply_closure_to_buffer(cl, buf,
194 index, _sz,
195 true, worker_i);
196 if (b) {
197 deallocate_buffer(buf);
198 return true; // In normal case, go on to next buffer.
199 } else {
200 enqueue_complete_buffer(buf, index);
201 return false;
242 nd = next;
243 } else {
244 nd = actual;
245 }
246 }
247 }
248
249 // Deallocates any completed log buffers
250 void DirtyCardQueueSet::clear() {
251 BufferNode* buffers_to_delete = NULL;
252 {
253 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
254 while (_completed_buffers_head != NULL) {
255 BufferNode* nd = _completed_buffers_head;
256 _completed_buffers_head = nd->next();
257 nd->set_next(buffers_to_delete);
258 buffers_to_delete = nd;
259 }
260 _n_completed_buffers = 0;
261 _completed_buffers_tail = NULL;
262 debug_only(assert_completed_buffer_list_len_correct_locked());
263 }
264 while (buffers_to_delete != NULL) {
265 BufferNode* nd = buffers_to_delete;
266 buffers_to_delete = nd->next();
267 deallocate_buffer(BufferNode::make_buffer_from_node(nd));
268 }
269
270 }
271
272 void DirtyCardQueueSet::abandon_logs() {
273 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
274 clear();
275 // Since abandon is done only at safepoints, we can safely manipulate
276 // these queues.
277 for (JavaThread* t = Threads::first(); t; t = t->next()) {
278 t->dirty_card_queue().reset();
279 }
280 shared_dirty_card_queue()->reset();
281 }
282
283
284 void DirtyCardQueueSet::concatenate_logs() {
285 // Iterate over all the threads, if we find a partial log add it to
286 // the global list of logs. Temporarily turn off the limit on the number
287 // of outstanding buffers.
288 int save_max_completed_queue = _max_completed_queue;
289 _max_completed_queue = max_jint;
290 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
291 for (JavaThread* t = Threads::first(); t; t = t->next()) {
292 DirtyCardQueue& dcq = t->dirty_card_queue();
293 if (dcq.size() != 0) {
294 void **buf = t->dirty_card_queue().get_buf();
295 // We must NULL out the unused entries, then enqueue.
296 for (size_t i = 0; i < t->dirty_card_queue().get_index(); i += oopSize) {
297 buf[PtrQueue::byte_index_to_index((int)i)] = NULL;
298 }
299 enqueue_complete_buffer(dcq.get_buf(), dcq.get_index());
300 dcq.reinitialize();
301 }
302 }
303 if (_shared_dirty_card_queue.size() != 0) {
304 enqueue_complete_buffer(_shared_dirty_card_queue.get_buf(),
305 _shared_dirty_card_queue.get_index());
306 _shared_dirty_card_queue.reinitialize();
307 }
308 // Restore the completed buffer queue limit.
309 _max_completed_queue = save_max_completed_queue;
310 }
|
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/heapRegionRemSet.hpp"
29 #include "gc/shared/workgroup.hpp"
30 #include "runtime/atomic.inline.hpp"
31 #include "runtime/mutexLocker.hpp"
32 #include "runtime/safepoint.hpp"
33 #include "runtime/thread.inline.hpp"
34
35 DirtyCardQueue::DirtyCardQueue(DirtyCardQueueSet* qset, bool permanent) :
36 // Dirty card queues are always active, so we create them with their
37 // active field set to true.
38 PtrQueue(qset, permanent, true /* active */)
39 { }
40
41 DirtyCardQueue::~DirtyCardQueue() {
42 if (!is_permanent()) {
43 flush();
44 }
45 }
46
47 bool DirtyCardQueue::apply_closure(CardTableEntryClosure* cl,
48 bool consume,
49 uint worker_i) {
50 bool res = true;
51 if (_buf != NULL) {
52 res = apply_closure_to_buffer(cl, _buf, _index, _sz,
53 consume,
54 worker_i);
55 if (res && consume) _index = _sz;
56 }
57 return res;
58 }
59
60 bool DirtyCardQueue::apply_closure_to_buffer(CardTableEntryClosure* cl,
61 void** buf,
62 size_t index, size_t sz,
63 bool consume,
64 uint worker_i) {
65 if (cl == NULL) return true;
66 size_t limit = byte_index_to_index(sz);
67 for (size_t i = byte_index_to_index(index); i < limit; ++i) {
68 jbyte* card_ptr = static_cast<jbyte*>(buf[i]);
69 if (card_ptr != NULL) {
70 // Set the entry to null, so we don't do it again (via the test
71 // above) if we reconsider this buffer.
72 if (consume) buf[i] = NULL;
73 if (!cl->do_card_ptr(card_ptr, worker_i)) return false;
74 }
75 }
76 return true;
77 }
78
79 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
80 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
81 #endif // _MSC_VER
82
83 DirtyCardQueueSet::DirtyCardQueueSet(bool notify_when_complete) :
84 PtrQueueSet(notify_when_complete),
85 _mut_process_closure(NULL),
86 _shared_dirty_card_queue(this, true /*perm*/),
87 _free_ids(NULL),
88 _processed_buffers_mut(0), _processed_buffers_rs_thread(0)
89 {
90 _all_active = true;
91 }
92
93 // Determines how many mutator threads can process the buffers in parallel.
94 uint DirtyCardQueueSet::num_par_ids() {
95 return (uint)os::processor_count();
96 }
97
98 void DirtyCardQueueSet::initialize(CardTableEntryClosure* cl,
99 Monitor* cbl_mon,
100 Mutex* fl_lock,
101 int process_completed_threshold,
102 int max_completed_queue,
103 Mutex* lock,
104 DirtyCardQueueSet* fl_owner) {
105 _mut_process_closure = cl;
106 PtrQueueSet::initialize(cbl_mon,
107 fl_lock,
108 process_completed_threshold,
109 max_completed_queue,
110 fl_owner);
111 set_buffer_size(G1UpdateBufferSize);
112 _shared_dirty_card_queue.set_lock(lock);
113 _free_ids = new FreeIdSet((int) num_par_ids(), _cbl_mon);
114 }
115
116 void DirtyCardQueueSet::handle_zero_index_for_thread(JavaThread* t) {
117 t->dirty_card_queue().handle_zero_index();
118 }
119
120 void DirtyCardQueueSet::iterate_closure_all_threads(CardTableEntryClosure* cl,
121 bool consume,
122 uint worker_i) {
123 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
124 for (JavaThread* t = Threads::first(); t; t = t->next()) {
125 bool b = t->dirty_card_queue().apply_closure(cl, consume);
126 guarantee(b, "Should not be interrupted.");
127 }
128 bool b = shared_dirty_card_queue()->apply_closure(cl,
129 consume,
130 worker_i);
131 guarantee(b, "Should not be interrupted.");
132 }
133
134 bool DirtyCardQueueSet::mut_process_buffer(void** buf) {
135
136 // Used to determine if we had already claimed a par_id
137 // before entering this method.
138 bool already_claimed = false;
139
140 // We grab the current JavaThread.
141 JavaThread* thread = JavaThread::current();
142
143 // We get the the number of any par_id that this thread
144 // might have already claimed.
179
180
181 BufferNode*
182 DirtyCardQueueSet::get_completed_buffer(int stop_at) {
183 BufferNode* nd = NULL;
184 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
185
186 if ((int)_n_completed_buffers <= stop_at) {
187 _process_completed = false;
188 return NULL;
189 }
190
191 if (_completed_buffers_head != NULL) {
192 nd = _completed_buffers_head;
193 _completed_buffers_head = nd->next();
194 if (_completed_buffers_head == NULL)
195 _completed_buffers_tail = NULL;
196 _n_completed_buffers--;
197 assert(_n_completed_buffers >= 0, "Invariant");
198 }
199 DEBUG_ONLY(assert_completed_buffer_list_len_correct_locked());
200 return nd;
201 }
202
203 bool DirtyCardQueueSet::
204 apply_closure_to_completed_buffer_helper(CardTableEntryClosure* cl,
205 uint worker_i,
206 BufferNode* nd) {
207 if (nd != NULL) {
208 void **buf = BufferNode::make_buffer_from_node(nd);
209 size_t index = nd->index();
210 bool b =
211 DirtyCardQueue::apply_closure_to_buffer(cl, buf,
212 index, _sz,
213 true, worker_i);
214 if (b) {
215 deallocate_buffer(buf);
216 return true; // In normal case, go on to next buffer.
217 } else {
218 enqueue_complete_buffer(buf, index);
219 return false;
260 nd = next;
261 } else {
262 nd = actual;
263 }
264 }
265 }
266
267 // Deallocates any completed log buffers
268 void DirtyCardQueueSet::clear() {
269 BufferNode* buffers_to_delete = NULL;
270 {
271 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
272 while (_completed_buffers_head != NULL) {
273 BufferNode* nd = _completed_buffers_head;
274 _completed_buffers_head = nd->next();
275 nd->set_next(buffers_to_delete);
276 buffers_to_delete = nd;
277 }
278 _n_completed_buffers = 0;
279 _completed_buffers_tail = NULL;
280 DEBUG_ONLY(assert_completed_buffer_list_len_correct_locked());
281 }
282 while (buffers_to_delete != NULL) {
283 BufferNode* nd = buffers_to_delete;
284 buffers_to_delete = nd->next();
285 deallocate_buffer(BufferNode::make_buffer_from_node(nd));
286 }
287
288 }
289
290 void DirtyCardQueueSet::abandon_logs() {
291 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
292 clear();
293 // Since abandon is done only at safepoints, we can safely manipulate
294 // these queues.
295 for (JavaThread* t = Threads::first(); t; t = t->next()) {
296 t->dirty_card_queue().reset();
297 }
298 shared_dirty_card_queue()->reset();
299 }
300
301
302 void DirtyCardQueueSet::concatenate_logs() {
303 // Iterate over all the threads, if we find a partial log add it to
304 // the global list of logs. Temporarily turn off the limit on the number
305 // of outstanding buffers.
306 int save_max_completed_queue = _max_completed_queue;
307 _max_completed_queue = max_jint;
308 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
309 for (JavaThread* t = Threads::first(); t; t = t->next()) {
310 DirtyCardQueue& dcq = t->dirty_card_queue();
311 if (dcq.size() != 0) {
312 void** buf = dcq.get_buf();
313 // We must NULL out the unused entries, then enqueue.
314 size_t limit = dcq.byte_index_to_index(dcq.get_index());
315 for (size_t i = 0; i < limit; ++i) {
316 buf[i] = NULL;
317 }
318 enqueue_complete_buffer(dcq.get_buf(), dcq.get_index());
319 dcq.reinitialize();
320 }
321 }
322 if (_shared_dirty_card_queue.size() != 0) {
323 enqueue_complete_buffer(_shared_dirty_card_queue.get_buf(),
324 _shared_dirty_card_queue.get_index());
325 _shared_dirty_card_queue.reinitialize();
326 }
327 // Restore the completed buffer queue limit.
328 _max_completed_queue = save_max_completed_queue;
329 }
|