Fri, 01 May 2015 17:38:12 -0400
8075215: SATB buffer processing found reclaimed humongous object
Summary: Don't assume SATB buffer entries are valid objects
Reviewed-by: brutisso, ecaspole
ysr@777 | 1 | /* |
kbarrett@7831 | 2 | * Copyright (c) 2001, 2015, 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 | #include "precompiled.hpp" |
tonyp@2469 | 26 | #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" |
stefank@2314 | 27 | #include "gc_implementation/g1/satbQueue.hpp" |
stefank@2314 | 28 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 29 | #include "memory/sharedHeap.hpp" |
coleenp@4037 | 30 | #include "oops/oop.inline.hpp" |
stefank@2314 | 31 | #include "runtime/mutexLocker.hpp" |
kbarrett@7834 | 32 | #include "runtime/safepoint.hpp" |
stefank@2314 | 33 | #include "runtime/thread.hpp" |
johnc@3175 | 34 | #include "runtime/vmThread.hpp" |
ysr@777 | 35 | |
drchase@6680 | 36 | PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC |
drchase@6680 | 37 | |
tonyp@3416 | 38 | void ObjPtrQueue::flush() { |
kbarrett@7831 | 39 | // Filter now to possibly save work later. If filtering empties the |
kbarrett@7831 | 40 | // buffer then flush_impl can deallocate the buffer. |
tonyp@3416 | 41 | filter(); |
tschatzl@7445 | 42 | flush_impl(); |
tonyp@3416 | 43 | } |
tonyp@3416 | 44 | |
kbarrett@7831 | 45 | // Return true if a SATB buffer entry refers to an object that |
kbarrett@7831 | 46 | // requires marking. |
tonyp@2469 | 47 | // |
kbarrett@7831 | 48 | // The entry must point into the G1 heap. In particular, it must not |
kbarrett@7831 | 49 | // be a NULL pointer. NULL pointers are pre-filtered and never |
kbarrett@7831 | 50 | // inserted into a SATB buffer. |
tonyp@2469 | 51 | // |
kbarrett@7831 | 52 | // An entry that is below the NTAMS pointer for the containing heap |
kbarrett@7831 | 53 | // region requires marking. Such an entry must point to a valid object. |
kbarrett@7831 | 54 | // |
kbarrett@7831 | 55 | // An entry that is at least the NTAMS pointer for the containing heap |
kbarrett@7831 | 56 | // region might be any of the following, none of which should be marked. |
kbarrett@7831 | 57 | // |
kbarrett@7831 | 58 | // * A reference to an object allocated since marking started. |
kbarrett@7831 | 59 | // According to SATB, such objects are implicitly kept live and do |
kbarrett@7831 | 60 | // not need to be dealt with via SATB buffer processing. |
kbarrett@7831 | 61 | // |
kbarrett@7831 | 62 | // * A reference to a young generation object. Young objects are |
kbarrett@7831 | 63 | // handled separately and are not marked by concurrent marking. |
kbarrett@7831 | 64 | // |
kbarrett@7831 | 65 | // * A stale reference to a young generation object. If a young |
kbarrett@7831 | 66 | // generation object reference is recorded and not filtered out |
kbarrett@7831 | 67 | // before being moved by a young collection, the reference becomes |
kbarrett@7831 | 68 | // stale. |
kbarrett@7831 | 69 | // |
kbarrett@7831 | 70 | // * A stale reference to an eagerly reclaimed humongous object. If a |
kbarrett@7831 | 71 | // humongous object is recorded and then reclaimed, the reference |
kbarrett@7831 | 72 | // becomes stale. |
kbarrett@7831 | 73 | // |
kbarrett@7831 | 74 | // The stale reference cases are implicitly handled by the NTAMS |
kbarrett@7831 | 75 | // comparison. Because of the possibility of stale references, buffer |
kbarrett@7831 | 76 | // processing must be somewhat circumspect and not assume entries |
kbarrett@7831 | 77 | // in an unfiltered buffer refer to valid objects. |
kbarrett@7831 | 78 | |
kbarrett@7831 | 79 | inline bool requires_marking(const void* entry, G1CollectedHeap* heap) { |
kbarrett@7831 | 80 | // Includes rejection of NULL pointers. |
kbarrett@7831 | 81 | assert(heap->is_in_reserved(entry), |
kbarrett@7831 | 82 | err_msg("Non-heap pointer in SATB buffer: " PTR_FORMAT, p2i(entry))); |
kbarrett@7831 | 83 | |
kbarrett@7831 | 84 | HeapRegion* region = heap->heap_region_containing_raw(entry); |
kbarrett@7831 | 85 | assert(region != NULL, err_msg("No region for " PTR_FORMAT, p2i(entry))); |
kbarrett@7831 | 86 | if (entry >= region->next_top_at_mark_start()) { |
kbarrett@7831 | 87 | return false; |
kbarrett@7831 | 88 | } |
kbarrett@7831 | 89 | |
kbarrett@7831 | 90 | assert(((oop)entry)->is_oop(true /* ignore mark word */), |
kbarrett@7831 | 91 | err_msg("Invalid oop in SATB buffer: " PTR_FORMAT, p2i(entry))); |
kbarrett@7831 | 92 | |
kbarrett@7831 | 93 | return true; |
kbarrett@7831 | 94 | } |
kbarrett@7831 | 95 | |
kbarrett@7831 | 96 | // This method removes entries from a SATB buffer that will not be |
kbarrett@7831 | 97 | // useful to the concurrent marking threads. Entries are retained if |
kbarrett@7831 | 98 | // they require marking and are not already marked. Retained entries |
kbarrett@7831 | 99 | // are compacted toward the top of the buffer. |
tonyp@2469 | 100 | |
tonyp@3416 | 101 | void ObjPtrQueue::filter() { |
tonyp@2469 | 102 | G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
tonyp@2469 | 103 | void** buf = _buf; |
tonyp@2469 | 104 | size_t sz = _sz; |
tonyp@2469 | 105 | |
tonyp@3416 | 106 | if (buf == NULL) { |
tonyp@3416 | 107 | // nothing to do |
tonyp@3416 | 108 | return; |
tonyp@3416 | 109 | } |
tonyp@3416 | 110 | |
tonyp@2469 | 111 | // Used for sanity checking at the end of the loop. |
tonyp@2469 | 112 | debug_only(size_t entries = 0; size_t retained = 0;) |
tonyp@2469 | 113 | |
tonyp@2469 | 114 | size_t i = sz; |
tonyp@2469 | 115 | size_t new_index = sz; |
tonyp@2469 | 116 | |
tonyp@2469 | 117 | while (i > _index) { |
tonyp@2469 | 118 | assert(i > 0, "we should have at least one more entry to process"); |
tonyp@2469 | 119 | i -= oopSize; |
tonyp@2469 | 120 | debug_only(entries += 1;) |
kbarrett@7831 | 121 | void** p = &buf[byte_index_to_index((int) i)]; |
kbarrett@7831 | 122 | void* entry = *p; |
tonyp@2469 | 123 | // NULL the entry so that unused parts of the buffer contain NULLs |
tonyp@2469 | 124 | // at the end. If we are going to retain it we will copy it to its |
tonyp@2469 | 125 | // final place. If we have retained all entries we have visited so |
tonyp@2469 | 126 | // far, we'll just end up copying it to the same place. |
tonyp@2469 | 127 | *p = NULL; |
tonyp@2469 | 128 | |
kbarrett@7831 | 129 | if (requires_marking(entry, g1h) && !g1h->isMarkedNext((oop)entry)) { |
tonyp@2469 | 130 | assert(new_index > 0, "we should not have already filled up the buffer"); |
tonyp@2469 | 131 | new_index -= oopSize; |
tonyp@2469 | 132 | assert(new_index >= i, |
tonyp@2469 | 133 | "new_index should never be below i, as we alwaysr compact 'up'"); |
kbarrett@7831 | 134 | void** new_p = &buf[byte_index_to_index((int) new_index)]; |
tonyp@2469 | 135 | assert(new_p >= p, "the destination location should never be below " |
tonyp@2469 | 136 | "the source as we always compact 'up'"); |
tonyp@2469 | 137 | assert(*new_p == NULL, |
tonyp@2469 | 138 | "we should have already cleared the destination location"); |
kbarrett@7831 | 139 | *new_p = entry; |
tonyp@2469 | 140 | debug_only(retained += 1;) |
tonyp@2469 | 141 | } |
tonyp@2469 | 142 | } |
tonyp@3416 | 143 | |
tonyp@3416 | 144 | #ifdef ASSERT |
tonyp@2469 | 145 | size_t entries_calc = (sz - _index) / oopSize; |
tonyp@2469 | 146 | assert(entries == entries_calc, "the number of entries we counted " |
tonyp@2469 | 147 | "should match the number of entries we calculated"); |
tonyp@2469 | 148 | size_t retained_calc = (sz - new_index) / oopSize; |
tonyp@2469 | 149 | assert(retained == retained_calc, "the number of retained entries we counted " |
tonyp@2469 | 150 | "should match the number of retained entries we calculated"); |
tonyp@3416 | 151 | #endif // ASSERT |
tonyp@3416 | 152 | |
tonyp@3416 | 153 | _index = new_index; |
tonyp@3416 | 154 | } |
tonyp@3416 | 155 | |
tonyp@3416 | 156 | // This method will first apply the above filtering to the buffer. If |
tonyp@3416 | 157 | // post-filtering a large enough chunk of the buffer has been cleared |
tonyp@3416 | 158 | // we can re-use the buffer (instead of enqueueing it) and we can just |
tonyp@3416 | 159 | // allow the mutator to carry on executing using the same buffer |
tonyp@3416 | 160 | // instead of replacing it. |
tonyp@3416 | 161 | |
tonyp@3416 | 162 | bool ObjPtrQueue::should_enqueue_buffer() { |
tonyp@3416 | 163 | assert(_lock == NULL || _lock->owned_by_self(), |
tonyp@3416 | 164 | "we should have taken the lock before calling this"); |
tonyp@3416 | 165 | |
kbarrett@7834 | 166 | // If G1SATBBufferEnqueueingThresholdPercent == 0 we could skip filtering. |
tonyp@3416 | 167 | |
tonyp@3416 | 168 | // This method should only be called if there is a non-NULL buffer |
tonyp@3416 | 169 | // that is full. |
tonyp@3416 | 170 | assert(_index == 0, "pre-condition"); |
tonyp@3416 | 171 | assert(_buf != NULL, "pre-condition"); |
tonyp@3416 | 172 | |
tonyp@3416 | 173 | filter(); |
tonyp@3416 | 174 | |
tonyp@3416 | 175 | size_t sz = _sz; |
tonyp@3416 | 176 | size_t all_entries = sz / oopSize; |
tonyp@3416 | 177 | size_t retained_entries = (sz - _index) / oopSize; |
tonyp@3416 | 178 | size_t perc = retained_entries * 100 / all_entries; |
tonyp@2469 | 179 | bool should_enqueue = perc > (size_t) G1SATBBufferEnqueueingThresholdPercent; |
tonyp@2469 | 180 | return should_enqueue; |
tonyp@2469 | 181 | } |
tonyp@2469 | 182 | |
kbarrett@7834 | 183 | void ObjPtrQueue::apply_closure_and_empty(SATBBufferClosure* cl) { |
kbarrett@7834 | 184 | assert(SafepointSynchronize::is_at_safepoint(), |
kbarrett@7834 | 185 | "SATB queues must only be processed at safepoints"); |
tonyp@3416 | 186 | if (_buf != NULL) { |
kbarrett@7834 | 187 | assert(_index % sizeof(void*) == 0, "invariant"); |
kbarrett@7834 | 188 | assert(_sz % sizeof(void*) == 0, "invariant"); |
kbarrett@7834 | 189 | assert(_index <= _sz, "invariant"); |
kbarrett@7834 | 190 | cl->do_buffer(_buf + byte_index_to_index((int)_index), |
kbarrett@7834 | 191 | byte_index_to_index((int)(_sz - _index))); |
ysr@777 | 192 | _index = _sz; |
ysr@777 | 193 | } |
ysr@777 | 194 | } |
ysr@777 | 195 | |
tonyp@3416 | 196 | #ifndef PRODUCT |
tonyp@3416 | 197 | // Helpful for debugging |
tonyp@3416 | 198 | |
tonyp@3416 | 199 | void ObjPtrQueue::print(const char* name) { |
tonyp@3416 | 200 | print(name, _buf, _index, _sz); |
tonyp@3416 | 201 | } |
tonyp@3416 | 202 | |
tonyp@3416 | 203 | void ObjPtrQueue::print(const char* name, |
tonyp@3416 | 204 | void** buf, size_t index, size_t sz) { |
tonyp@3416 | 205 | gclog_or_tty->print_cr(" SATB BUFFER [%s] buf: "PTR_FORMAT" " |
tonyp@3416 | 206 | "index: "SIZE_FORMAT" sz: "SIZE_FORMAT, |
tonyp@3416 | 207 | name, buf, index, sz); |
tonyp@3416 | 208 | } |
tonyp@3416 | 209 | #endif // PRODUCT |
tonyp@3416 | 210 | |
ysr@777 | 211 | #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away |
ysr@777 | 212 | #pragma warning( disable:4355 ) // 'this' : used in base member initializer list |
ysr@777 | 213 | #endif // _MSC_VER |
ysr@777 | 214 | |
ysr@777 | 215 | SATBMarkQueueSet::SATBMarkQueueSet() : |
kbarrett@7832 | 216 | PtrQueueSet(), |
tonyp@3416 | 217 | _shared_satb_queue(this, true /*perm*/) { } |
ysr@777 | 218 | |
ysr@777 | 219 | void SATBMarkQueueSet::initialize(Monitor* cbl_mon, Mutex* fl_lock, |
iveresov@1546 | 220 | int process_completed_threshold, |
ysr@777 | 221 | Mutex* lock) { |
iveresov@1546 | 222 | PtrQueueSet::initialize(cbl_mon, fl_lock, process_completed_threshold, -1); |
ysr@777 | 223 | _shared_satb_queue.set_lock(lock); |
ysr@777 | 224 | } |
ysr@777 | 225 | |
ysr@777 | 226 | void SATBMarkQueueSet::handle_zero_index_for_thread(JavaThread* t) { |
ysr@777 | 227 | t->satb_mark_queue().handle_zero_index(); |
ysr@777 | 228 | } |
ysr@777 | 229 | |
tonyp@1752 | 230 | #ifdef ASSERT |
pliden@6396 | 231 | void SATBMarkQueueSet::dump_active_states(bool expected_active) { |
pliden@6396 | 232 | gclog_or_tty->print_cr("Expected SATB active state: %s", |
pliden@6396 | 233 | expected_active ? "ACTIVE" : "INACTIVE"); |
pliden@6396 | 234 | gclog_or_tty->print_cr("Actual SATB active states:"); |
pliden@6396 | 235 | gclog_or_tty->print_cr(" Queue set: %s", is_active() ? "ACTIVE" : "INACTIVE"); |
pliden@6396 | 236 | for (JavaThread* t = Threads::first(); t; t = t->next()) { |
pliden@6396 | 237 | gclog_or_tty->print_cr(" Thread \"%s\" queue: %s", t->name(), |
pliden@6396 | 238 | t->satb_mark_queue().is_active() ? "ACTIVE" : "INACTIVE"); |
pliden@6396 | 239 | } |
pliden@6396 | 240 | gclog_or_tty->print_cr(" Shared queue: %s", |
pliden@6396 | 241 | shared_satb_queue()->is_active() ? "ACTIVE" : "INACTIVE"); |
pliden@6396 | 242 | } |
pliden@6396 | 243 | |
pliden@6396 | 244 | void SATBMarkQueueSet::verify_active_states(bool expected_active) { |
pliden@6396 | 245 | // Verify queue set state |
pliden@6396 | 246 | if (is_active() != expected_active) { |
pliden@6396 | 247 | dump_active_states(expected_active); |
pliden@6396 | 248 | guarantee(false, "SATB queue set has an unexpected active state"); |
pliden@6396 | 249 | } |
pliden@6396 | 250 | |
pliden@6396 | 251 | // Verify thread queue states |
pliden@6396 | 252 | for (JavaThread* t = Threads::first(); t; t = t->next()) { |
pliden@6396 | 253 | if (t->satb_mark_queue().is_active() != expected_active) { |
pliden@6396 | 254 | dump_active_states(expected_active); |
pliden@6396 | 255 | guarantee(false, "Thread SATB queue has an unexpected active state"); |
pliden@6396 | 256 | } |
pliden@6396 | 257 | } |
pliden@6396 | 258 | |
pliden@6396 | 259 | // Verify shared queue state |
pliden@6396 | 260 | if (shared_satb_queue()->is_active() != expected_active) { |
pliden@6396 | 261 | dump_active_states(expected_active); |
pliden@6396 | 262 | guarantee(false, "Shared SATB queue has an unexpected active state"); |
tonyp@1752 | 263 | } |
tonyp@1752 | 264 | } |
tonyp@1752 | 265 | #endif // ASSERT |
tonyp@1752 | 266 | |
pliden@6396 | 267 | void SATBMarkQueueSet::set_active_all_threads(bool active, bool expected_active) { |
tonyp@1752 | 268 | assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint."); |
tonyp@1752 | 269 | #ifdef ASSERT |
pliden@6396 | 270 | verify_active_states(expected_active); |
pliden@6396 | 271 | #endif // ASSERT |
pliden@6396 | 272 | _all_active = active; |
pliden@6396 | 273 | for (JavaThread* t = Threads::first(); t; t = t->next()) { |
pliden@6396 | 274 | t->satb_mark_queue().set_active(active); |
tonyp@1752 | 275 | } |
pliden@6396 | 276 | shared_satb_queue()->set_active(active); |
ysr@777 | 277 | } |
ysr@777 | 278 | |
tonyp@3416 | 279 | void SATBMarkQueueSet::filter_thread_buffers() { |
tonyp@3416 | 280 | for(JavaThread* t = Threads::first(); t; t = t->next()) { |
tonyp@3416 | 281 | t->satb_mark_queue().filter(); |
tonyp@3416 | 282 | } |
tonyp@3416 | 283 | shared_satb_queue()->filter(); |
tonyp@3416 | 284 | } |
tonyp@3416 | 285 | |
kbarrett@7834 | 286 | bool SATBMarkQueueSet::apply_closure_to_completed_buffer(SATBBufferClosure* cl) { |
iveresov@1546 | 287 | BufferNode* nd = NULL; |
ysr@777 | 288 | { |
ysr@777 | 289 | MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag); |
ysr@777 | 290 | if (_completed_buffers_head != NULL) { |
ysr@777 | 291 | nd = _completed_buffers_head; |
iveresov@1546 | 292 | _completed_buffers_head = nd->next(); |
ysr@777 | 293 | if (_completed_buffers_head == NULL) _completed_buffers_tail = NULL; |
ysr@777 | 294 | _n_completed_buffers--; |
ysr@777 | 295 | if (_n_completed_buffers == 0) _process_completed = false; |
ysr@777 | 296 | } |
ysr@777 | 297 | } |
ysr@777 | 298 | if (nd != NULL) { |
iveresov@1546 | 299 | void **buf = BufferNode::make_buffer_from_node(nd); |
kbarrett@7834 | 300 | // Skip over NULL entries at beginning (e.g. push end) of buffer. |
kbarrett@7834 | 301 | // Filtering can result in non-full completed buffers; see |
kbarrett@7834 | 302 | // should_enqueue_buffer. |
kbarrett@7834 | 303 | assert(_sz % sizeof(void*) == 0, "invariant"); |
kbarrett@7834 | 304 | size_t limit = ObjPtrQueue::byte_index_to_index((int)_sz); |
kbarrett@7834 | 305 | for (size_t i = 0; i < limit; ++i) { |
kbarrett@7834 | 306 | if (buf[i] != NULL) { |
kbarrett@7834 | 307 | // Found the end of the block of NULLs; process the remainder. |
kbarrett@7834 | 308 | cl->do_buffer(buf + i, limit - i); |
kbarrett@7834 | 309 | break; |
kbarrett@7834 | 310 | } |
kbarrett@7834 | 311 | } |
iveresov@1546 | 312 | deallocate_buffer(buf); |
ysr@777 | 313 | return true; |
ysr@777 | 314 | } else { |
ysr@777 | 315 | return false; |
ysr@777 | 316 | } |
ysr@777 | 317 | } |
ysr@777 | 318 | |
tonyp@3416 | 319 | #ifndef PRODUCT |
tonyp@3416 | 320 | // Helpful for debugging |
tonyp@3416 | 321 | |
tonyp@3416 | 322 | #define SATB_PRINTER_BUFFER_SIZE 256 |
tonyp@3416 | 323 | |
tonyp@3416 | 324 | void SATBMarkQueueSet::print_all(const char* msg) { |
tonyp@3416 | 325 | char buffer[SATB_PRINTER_BUFFER_SIZE]; |
tonyp@3416 | 326 | assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint."); |
tonyp@3416 | 327 | |
tonyp@3416 | 328 | gclog_or_tty->cr(); |
tonyp@3416 | 329 | gclog_or_tty->print_cr("SATB BUFFERS [%s]", msg); |
tonyp@3416 | 330 | |
tonyp@3416 | 331 | BufferNode* nd = _completed_buffers_head; |
tonyp@3416 | 332 | int i = 0; |
tonyp@3416 | 333 | while (nd != NULL) { |
tonyp@3416 | 334 | void** buf = BufferNode::make_buffer_from_node(nd); |
tonyp@3416 | 335 | jio_snprintf(buffer, SATB_PRINTER_BUFFER_SIZE, "Enqueued: %d", i); |
tonyp@3416 | 336 | ObjPtrQueue::print(buffer, buf, 0, _sz); |
tonyp@3416 | 337 | nd = nd->next(); |
tonyp@3416 | 338 | i += 1; |
tonyp@3416 | 339 | } |
tonyp@3416 | 340 | |
tonyp@3416 | 341 | for (JavaThread* t = Threads::first(); t; t = t->next()) { |
tonyp@3416 | 342 | jio_snprintf(buffer, SATB_PRINTER_BUFFER_SIZE, "Thread: %s", t->name()); |
tonyp@3416 | 343 | t->satb_mark_queue().print(buffer); |
tonyp@3416 | 344 | } |
tonyp@3416 | 345 | |
tonyp@3416 | 346 | shared_satb_queue()->print("Shared"); |
tonyp@3416 | 347 | |
tonyp@3416 | 348 | gclog_or_tty->cr(); |
tonyp@3416 | 349 | } |
tonyp@3416 | 350 | #endif // PRODUCT |
tonyp@3416 | 351 | |
ysr@777 | 352 | void SATBMarkQueueSet::abandon_partial_marking() { |
iveresov@1546 | 353 | BufferNode* buffers_to_delete = NULL; |
ysr@777 | 354 | { |
ysr@777 | 355 | MutexLockerEx x(_cbl_mon, Mutex::_no_safepoint_check_flag); |
ysr@777 | 356 | while (_completed_buffers_head != NULL) { |
iveresov@1546 | 357 | BufferNode* nd = _completed_buffers_head; |
iveresov@1546 | 358 | _completed_buffers_head = nd->next(); |
iveresov@1546 | 359 | nd->set_next(buffers_to_delete); |
ysr@777 | 360 | buffers_to_delete = nd; |
ysr@777 | 361 | } |
ysr@777 | 362 | _completed_buffers_tail = NULL; |
ysr@777 | 363 | _n_completed_buffers = 0; |
ysr@1280 | 364 | DEBUG_ONLY(assert_completed_buffer_list_len_correct_locked()); |
ysr@777 | 365 | } |
ysr@777 | 366 | while (buffers_to_delete != NULL) { |
iveresov@1546 | 367 | BufferNode* nd = buffers_to_delete; |
iveresov@1546 | 368 | buffers_to_delete = nd->next(); |
iveresov@1546 | 369 | deallocate_buffer(BufferNode::make_buffer_from_node(nd)); |
ysr@777 | 370 | } |
ysr@777 | 371 | assert(SafepointSynchronize::is_at_safepoint(), "Must be at safepoint."); |
ysr@777 | 372 | // So we can safely manipulate these queues. |
ysr@777 | 373 | for (JavaThread* t = Threads::first(); t; t = t->next()) { |
ysr@777 | 374 | t->satb_mark_queue().reset(); |
ysr@777 | 375 | } |
tonyp@3416 | 376 | shared_satb_queue()->reset(); |
ysr@777 | 377 | } |