1 /*
2 * Copyright (c) 2001, 2015, 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 *
83 // processing must be somewhat circumspect and not assume entries
84 // in an unfiltered buffer refer to valid objects.
85
86 inline bool requires_marking(const void* entry, G1CollectedHeap* heap) {
87 // Includes rejection of NULL pointers.
88 assert(heap->is_in_reserved(entry),
89 "Non-heap pointer in SATB buffer: " PTR_FORMAT, p2i(entry));
90
91 HeapRegion* region = heap->heap_region_containing(entry);
92 assert(region != NULL, "No region for " PTR_FORMAT, p2i(entry));
93 if (entry >= region->next_top_at_mark_start()) {
94 return false;
95 }
96
97 assert(((oop)entry)->is_oop(true /* ignore mark word */),
98 "Invalid oop in SATB buffer: " PTR_FORMAT, p2i(entry));
99
100 return true;
101 }
102
103 // This method removes entries from a SATB buffer that will not be
104 // useful to the concurrent marking threads. Entries are retained if
105 // they require marking and are not already marked. Retained entries
106 // are compacted toward the top of the buffer.
107
108 void SATBMarkQueue::filter() {
109 G1CollectedHeap* g1h = G1CollectedHeap::heap();
110 void** buf = _buf;
111
112 if (buf == NULL) {
113 // nothing to do
114 return;
115 }
116
117 // Used for sanity checking at the end of the loop.
118 DEBUG_ONLY(size_t entries = 0; size_t retained = 0;)
119
120 assert(_index <= _sz, "invariant");
121 void** limit = &buf[byte_index_to_index(_index)];
122 void** src = &buf[byte_index_to_index(_sz)];
123 void** dst = src;
124
125 while (limit < src) {
126 DEBUG_ONLY(entries += 1;)
127 --src;
128 void* entry = *src;
129 // NULL the entry so that unused parts of the buffer contain NULLs
130 // at the end. If we are going to retain it we will copy it to its
131 // final place. If we have retained all entries we have visited so
132 // far, we'll just end up copying it to the same place.
133 *src = NULL;
134
135 if (requires_marking(entry, g1h) && !g1h->isMarkedNext((oop)entry)) {
136 --dst;
137 assert(*dst == NULL, "filtering destination should be clear");
138 *dst = entry;
139 DEBUG_ONLY(retained += 1;);
140 }
141 }
142 size_t new_index = pointer_delta(dst, buf, 1);
143
144 #ifdef ASSERT
145 size_t entries_calc = (_sz - _index) / sizeof(void*);
146 assert(entries == entries_calc, "the number of entries we counted "
147 "should match the number of entries we calculated");
148 size_t retained_calc = (_sz - new_index) / sizeof(void*);
149 assert(retained == retained_calc, "the number of retained entries we counted "
150 "should match the number of retained entries we calculated");
151 #endif // ASSERT
152
153 _index = new_index;
154 }
155
156 // This method will first apply the above filtering to the buffer. If
157 // post-filtering a large enough chunk of the buffer has been cleared
158 // we can re-use the buffer (instead of enqueueing it) and we can just
159 // allow the mutator to carry on executing using the same buffer
160 // instead of replacing it.
161
162 bool SATBMarkQueue::should_enqueue_buffer() {
163 assert(_lock == NULL || _lock->owned_by_self(),
164 "we should have taken the lock before calling this");
165
166 // If G1SATBBufferEnqueueingThresholdPercent == 0 we could skip filtering.
167
168 // This method should only be called if there is a non-NULL buffer
169 // that is full.
170 assert(_index == 0, "pre-condition");
171 assert(_buf != NULL, "pre-condition");
172
173 filter();
269 for(JavaThread* t = Threads::first(); t; t = t->next()) {
270 t->satb_mark_queue().filter();
271 }
272 shared_satb_queue()->filter();
273 }
274
275 bool SATBMarkQueueSet::apply_closure_to_completed_buffer(SATBBufferClosure* cl) {
276 BufferNode* nd = NULL;
277 {
278 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
279 if (_completed_buffers_head != NULL) {
280 nd = _completed_buffers_head;
281 _completed_buffers_head = nd->next();
282 if (_completed_buffers_head == NULL) _completed_buffers_tail = NULL;
283 _n_completed_buffers--;
284 if (_n_completed_buffers == 0) _process_completed = false;
285 }
286 }
287 if (nd != NULL) {
288 void **buf = BufferNode::make_buffer_from_node(nd);
289 // Skip over NULL entries at beginning (e.g. push end) of buffer.
290 // Filtering can result in non-full completed buffers; see
291 // should_enqueue_buffer.
292 assert(_sz % sizeof(void*) == 0, "invariant");
293 size_t limit = SATBMarkQueue::byte_index_to_index(_sz);
294 for (size_t i = 0; i < limit; ++i) {
295 if (buf[i] != NULL) {
296 // Found the end of the block of NULLs; process the remainder.
297 cl->do_buffer(buf + i, limit - i);
298 break;
299 }
300 }
301 deallocate_buffer(buf);
302 return true;
303 } else {
304 return false;
305 }
306 }
307
308 #ifndef PRODUCT
309 // Helpful for debugging
310
311 #define SATB_PRINTER_BUFFER_SIZE 256
312
313 void SATBMarkQueueSet::print_all(const char* msg) {
314 char buffer[SATB_PRINTER_BUFFER_SIZE];
315 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
316
317 tty->cr();
318 tty->print_cr("SATB BUFFERS [%s]", msg);
319
320 BufferNode* nd = _completed_buffers_head;
321 int i = 0;
338 }
339 #endif // PRODUCT
340
341 void SATBMarkQueueSet::abandon_partial_marking() {
342 BufferNode* buffers_to_delete = NULL;
343 {
344 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
345 while (_completed_buffers_head != NULL) {
346 BufferNode* nd = _completed_buffers_head;
347 _completed_buffers_head = nd->next();
348 nd->set_next(buffers_to_delete);
349 buffers_to_delete = nd;
350 }
351 _completed_buffers_tail = NULL;
352 _n_completed_buffers = 0;
353 DEBUG_ONLY(assert_completed_buffer_list_len_correct_locked());
354 }
355 while (buffers_to_delete != NULL) {
356 BufferNode* nd = buffers_to_delete;
357 buffers_to_delete = nd->next();
358 deallocate_buffer(BufferNode::make_buffer_from_node(nd));
359 }
360 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
361 // So we can safely manipulate these queues.
362 for (JavaThread* t = Threads::first(); t; t = t->next()) {
363 t->satb_mark_queue().reset();
364 }
365 shared_satb_queue()->reset();
366 }
|
1 /*
2 * Copyright (c) 2001, 2016, 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 *
83 // processing must be somewhat circumspect and not assume entries
84 // in an unfiltered buffer refer to valid objects.
85
86 inline bool requires_marking(const void* entry, G1CollectedHeap* heap) {
87 // Includes rejection of NULL pointers.
88 assert(heap->is_in_reserved(entry),
89 "Non-heap pointer in SATB buffer: " PTR_FORMAT, p2i(entry));
90
91 HeapRegion* region = heap->heap_region_containing(entry);
92 assert(region != NULL, "No region for " PTR_FORMAT, p2i(entry));
93 if (entry >= region->next_top_at_mark_start()) {
94 return false;
95 }
96
97 assert(((oop)entry)->is_oop(true /* ignore mark word */),
98 "Invalid oop in SATB buffer: " PTR_FORMAT, p2i(entry));
99
100 return true;
101 }
102
103 inline bool retain_entry(const void* entry, G1CollectedHeap* heap) {
104 return requires_marking(entry, heap) && !heap->isMarkedNext((oop)entry);
105 }
106
107 // This method removes entries from a SATB buffer that will not be
108 // useful to the concurrent marking threads. Entries are retained if
109 // they require marking and are not already marked. Retained entries
110 // are compacted toward the top of the buffer.
111
112 void SATBMarkQueue::filter() {
113 G1CollectedHeap* g1h = G1CollectedHeap::heap();
114 void** buf = _buf;
115
116 if (buf == NULL) {
117 // nothing to do
118 return;
119 }
120
121 assert(_index <= _sz, "invariant");
122
123 // Two-fingered compaction toward the end.
124 void** src = &buf[byte_index_to_index(_index)];
125 void** dst = &buf[byte_index_to_index(_sz)];
126 for ( ; src < dst; ++src) {
127 // Search low to high for an entry to keep.
128 void* entry = *src;
129 if (retain_entry(entry, g1h)) {
130 // Found keeper. Search high to low for an entry to discard.
131 while (src < --dst) {
132 if (!retain_entry(*dst, g1h)) {
133 *dst = entry; // Replace discard with keeper.
134 break;
135 }
136 }
137 // If discard search failed (src == dst), the outer loop will also end.
138 }
139 }
140 // dst points to the lowest retained entry, or the end of the buffer
141 // if all the entries were filtered out.
142 _index = pointer_delta(dst, buf, 1);
143 }
144
145 // This method will first apply the above filtering to the buffer. If
146 // post-filtering a large enough chunk of the buffer has been cleared
147 // we can re-use the buffer (instead of enqueueing it) and we can just
148 // allow the mutator to carry on executing using the same buffer
149 // instead of replacing it.
150
151 bool SATBMarkQueue::should_enqueue_buffer() {
152 assert(_lock == NULL || _lock->owned_by_self(),
153 "we should have taken the lock before calling this");
154
155 // If G1SATBBufferEnqueueingThresholdPercent == 0 we could skip filtering.
156
157 // This method should only be called if there is a non-NULL buffer
158 // that is full.
159 assert(_index == 0, "pre-condition");
160 assert(_buf != NULL, "pre-condition");
161
162 filter();
258 for(JavaThread* t = Threads::first(); t; t = t->next()) {
259 t->satb_mark_queue().filter();
260 }
261 shared_satb_queue()->filter();
262 }
263
264 bool SATBMarkQueueSet::apply_closure_to_completed_buffer(SATBBufferClosure* cl) {
265 BufferNode* nd = NULL;
266 {
267 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
268 if (_completed_buffers_head != NULL) {
269 nd = _completed_buffers_head;
270 _completed_buffers_head = nd->next();
271 if (_completed_buffers_head == NULL) _completed_buffers_tail = NULL;
272 _n_completed_buffers--;
273 if (_n_completed_buffers == 0) _process_completed = false;
274 }
275 }
276 if (nd != NULL) {
277 void **buf = BufferNode::make_buffer_from_node(nd);
278 size_t index = SATBMarkQueue::byte_index_to_index(nd->index());
279 size_t size = SATBMarkQueue::byte_index_to_index(_sz);
280 assert(index <= size, "invariant");
281 cl->do_buffer(buf + index, size - index);
282 deallocate_buffer(nd);
283 return true;
284 } else {
285 return false;
286 }
287 }
288
289 #ifndef PRODUCT
290 // Helpful for debugging
291
292 #define SATB_PRINTER_BUFFER_SIZE 256
293
294 void SATBMarkQueueSet::print_all(const char* msg) {
295 char buffer[SATB_PRINTER_BUFFER_SIZE];
296 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
297
298 tty->cr();
299 tty->print_cr("SATB BUFFERS [%s]", msg);
300
301 BufferNode* nd = _completed_buffers_head;
302 int i = 0;
319 }
320 #endif // PRODUCT
321
322 void SATBMarkQueueSet::abandon_partial_marking() {
323 BufferNode* buffers_to_delete = NULL;
324 {
325 MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag);
326 while (_completed_buffers_head != NULL) {
327 BufferNode* nd = _completed_buffers_head;
328 _completed_buffers_head = nd->next();
329 nd->set_next(buffers_to_delete);
330 buffers_to_delete = nd;
331 }
332 _completed_buffers_tail = NULL;
333 _n_completed_buffers = 0;
334 DEBUG_ONLY(assert_completed_buffer_list_len_correct_locked());
335 }
336 while (buffers_to_delete != NULL) {
337 BufferNode* nd = buffers_to_delete;
338 buffers_to_delete = nd->next();
339 deallocate_buffer(nd);
340 }
341 assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint.");
342 // So we can safely manipulate these queues.
343 for (JavaThread* t = Threads::first(); t; t = t->next()) {
344 t->satb_mark_queue().reset();
345 }
346 shared_satb_queue()->reset();
347 }
|