Tue, 19 May 2015 15:49:27 +0200
8061715: gc/g1/TestShrinkAuxiliaryData15.java fails with java.lang.RuntimeException: heap decommit failed - after > before
Summary: added WhiteBox methods to count regions and exact aux data sizes
Reviewed-by: jwilhelm, brutisso
tschatzl@6937 | 1 | /* |
tschatzl@6937 | 2 | * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. |
tschatzl@6937 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
tschatzl@6937 | 4 | * |
tschatzl@6937 | 5 | * This code is free software; you can redistribute it and/or modify it |
tschatzl@6937 | 6 | * under the terms of the GNU General Public License version 2 only, as |
tschatzl@6937 | 7 | * published by the Free Software Foundation. |
tschatzl@6937 | 8 | * |
tschatzl@6937 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
tschatzl@6937 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
tschatzl@6937 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
tschatzl@6937 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
tschatzl@6937 | 13 | * accompanied this code). |
tschatzl@6937 | 14 | * |
tschatzl@6937 | 15 | * You should have received a copy of the GNU General Public License version |
tschatzl@6937 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
tschatzl@6937 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
tschatzl@6937 | 18 | * |
tschatzl@6937 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
tschatzl@6937 | 20 | * or visit www.oracle.com if you need additional information or have any |
tschatzl@6937 | 21 | * questions. |
tschatzl@6937 | 22 | * |
tschatzl@6937 | 23 | */ |
tschatzl@6937 | 24 | |
tschatzl@6937 | 25 | #include "precompiled.hpp" |
tschatzl@6937 | 26 | #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" |
tschatzl@6937 | 27 | #include "gc_implementation/g1/g1OopClosures.inline.hpp" |
tschatzl@6937 | 28 | #include "gc_implementation/g1/g1ParScanThreadState.inline.hpp" |
tschatzl@6937 | 29 | #include "oops/oop.inline.hpp" |
tschatzl@6937 | 30 | #include "oops/oop.pcgc.inline.hpp" |
tschatzl@6937 | 31 | #include "runtime/prefetch.inline.hpp" |
tschatzl@6937 | 32 | |
tschatzl@6937 | 33 | G1ParScanThreadState::G1ParScanThreadState(G1CollectedHeap* g1h, uint queue_num, ReferenceProcessor* rp) |
tschatzl@6937 | 34 | : _g1h(g1h), |
tschatzl@6937 | 35 | _refs(g1h->task_queue(queue_num)), |
tschatzl@6937 | 36 | _dcq(&g1h->dirty_card_queue_set()), |
tschatzl@6937 | 37 | _ct_bs(g1h->g1_barrier_set()), |
tschatzl@6937 | 38 | _g1_rem(g1h->g1_rem_set()), |
tschatzl@6937 | 39 | _hash_seed(17), _queue_num(queue_num), |
tschatzl@6937 | 40 | _term_attempts(0), |
tschatzl@7651 | 41 | _tenuring_threshold(g1h->g1_policy()->tenuring_threshold()), |
tschatzl@6939 | 42 | _age_table(false), _scanner(g1h, rp), |
sjohanss@7118 | 43 | _strong_roots_time(0), _term_time(0) { |
tschatzl@6939 | 44 | _scanner.set_par_scan_thread_state(this); |
tschatzl@6937 | 45 | // we allocate G1YoungSurvRateNumRegions plus one entries, since |
tschatzl@6937 | 46 | // we "sacrifice" entry 0 to keep track of surviving bytes for |
tschatzl@6937 | 47 | // non-young regions (where the age is -1) |
tschatzl@6937 | 48 | // We also add a few elements at the beginning and at the end in |
tschatzl@6937 | 49 | // an attempt to eliminate cache contention |
tschatzl@6937 | 50 | uint real_length = 1 + _g1h->g1_policy()->young_cset_region_length(); |
tschatzl@6937 | 51 | uint array_length = PADDING_ELEM_NUM + |
tschatzl@6937 | 52 | real_length + |
tschatzl@6937 | 53 | PADDING_ELEM_NUM; |
tschatzl@6937 | 54 | _surviving_young_words_base = NEW_C_HEAP_ARRAY(size_t, array_length, mtGC); |
tschatzl@6937 | 55 | if (_surviving_young_words_base == NULL) |
tschatzl@6937 | 56 | vm_exit_out_of_memory(array_length * sizeof(size_t), OOM_MALLOC_ERROR, |
tschatzl@6937 | 57 | "Not enough space for young surv histo."); |
tschatzl@6937 | 58 | _surviving_young_words = _surviving_young_words_base + PADDING_ELEM_NUM; |
tschatzl@6937 | 59 | memset(_surviving_young_words, 0, (size_t) real_length * sizeof(size_t)); |
tschatzl@6937 | 60 | |
sjohanss@7118 | 61 | _g1_par_allocator = G1ParGCAllocator::create_allocator(_g1h); |
tschatzl@6937 | 62 | |
tschatzl@7651 | 63 | _dest[InCSetState::NotInCSet] = InCSetState::NotInCSet; |
tschatzl@7651 | 64 | // The dest for Young is used when the objects are aged enough to |
tschatzl@7651 | 65 | // need to be moved to the next space. |
tschatzl@7651 | 66 | _dest[InCSetState::Young] = InCSetState::Old; |
tschatzl@7651 | 67 | _dest[InCSetState::Old] = InCSetState::Old; |
tschatzl@7651 | 68 | |
tschatzl@6937 | 69 | _start = os::elapsedTime(); |
tschatzl@6937 | 70 | } |
tschatzl@6937 | 71 | |
tschatzl@6938 | 72 | G1ParScanThreadState::~G1ParScanThreadState() { |
sjohanss@7118 | 73 | _g1_par_allocator->retire_alloc_buffers(); |
sjohanss@7118 | 74 | delete _g1_par_allocator; |
tschatzl@6938 | 75 | FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base, mtGC); |
tschatzl@6938 | 76 | } |
tschatzl@6938 | 77 | |
tschatzl@6937 | 78 | void |
tschatzl@6937 | 79 | G1ParScanThreadState::print_termination_stats_hdr(outputStream* const st) |
tschatzl@6937 | 80 | { |
tschatzl@6937 | 81 | st->print_raw_cr("GC Termination Stats"); |
tschatzl@6937 | 82 | st->print_raw_cr(" elapsed --strong roots-- -------termination-------" |
tschatzl@6937 | 83 | " ------waste (KiB)------"); |
tschatzl@6937 | 84 | st->print_raw_cr("thr ms ms % ms % attempts" |
tschatzl@6937 | 85 | " total alloc undo"); |
tschatzl@6937 | 86 | st->print_raw_cr("--- --------- --------- ------ --------- ------ --------" |
tschatzl@6937 | 87 | " ------- ------- -------"); |
tschatzl@6937 | 88 | } |
tschatzl@6937 | 89 | |
tschatzl@6937 | 90 | void |
tschatzl@6937 | 91 | G1ParScanThreadState::print_termination_stats(int i, |
tschatzl@6937 | 92 | outputStream* const st) const |
tschatzl@6937 | 93 | { |
tschatzl@6937 | 94 | const double elapsed_ms = elapsed_time() * 1000.0; |
tschatzl@6937 | 95 | const double s_roots_ms = strong_roots_time() * 1000.0; |
tschatzl@6937 | 96 | const double term_ms = term_time() * 1000.0; |
sjohanss@7118 | 97 | const size_t alloc_buffer_waste = _g1_par_allocator->alloc_buffer_waste(); |
sjohanss@7118 | 98 | const size_t undo_waste = _g1_par_allocator->undo_waste(); |
tschatzl@6937 | 99 | st->print_cr("%3d %9.2f %9.2f %6.2f " |
tschatzl@6937 | 100 | "%9.2f %6.2f " SIZE_FORMAT_W(8) " " |
tschatzl@6937 | 101 | SIZE_FORMAT_W(7) " " SIZE_FORMAT_W(7) " " SIZE_FORMAT_W(7), |
tschatzl@6937 | 102 | i, elapsed_ms, s_roots_ms, s_roots_ms * 100 / elapsed_ms, |
tschatzl@6937 | 103 | term_ms, term_ms * 100 / elapsed_ms, term_attempts(), |
sjohanss@7118 | 104 | (alloc_buffer_waste + undo_waste) * HeapWordSize / K, |
sjohanss@7118 | 105 | alloc_buffer_waste * HeapWordSize / K, |
sjohanss@7118 | 106 | undo_waste * HeapWordSize / K); |
tschatzl@6937 | 107 | } |
tschatzl@6937 | 108 | |
tschatzl@6937 | 109 | #ifdef ASSERT |
tschatzl@6937 | 110 | bool G1ParScanThreadState::verify_ref(narrowOop* ref) const { |
tschatzl@6937 | 111 | assert(ref != NULL, "invariant"); |
tschatzl@6937 | 112 | assert(UseCompressedOops, "sanity"); |
tschatzl@6937 | 113 | assert(!has_partial_array_mask(ref), err_msg("ref=" PTR_FORMAT, p2i(ref))); |
tschatzl@6937 | 114 | oop p = oopDesc::load_decode_heap_oop(ref); |
tschatzl@6937 | 115 | assert(_g1h->is_in_g1_reserved(p), |
tschatzl@6937 | 116 | err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p))); |
tschatzl@6937 | 117 | return true; |
tschatzl@6937 | 118 | } |
tschatzl@6937 | 119 | |
tschatzl@6937 | 120 | bool G1ParScanThreadState::verify_ref(oop* ref) const { |
tschatzl@6937 | 121 | assert(ref != NULL, "invariant"); |
tschatzl@6937 | 122 | if (has_partial_array_mask(ref)) { |
tschatzl@6937 | 123 | // Must be in the collection set--it's already been copied. |
tschatzl@6937 | 124 | oop p = clear_partial_array_mask(ref); |
tschatzl@6937 | 125 | assert(_g1h->obj_in_cs(p), |
tschatzl@6937 | 126 | err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p))); |
tschatzl@6937 | 127 | } else { |
tschatzl@6937 | 128 | oop p = oopDesc::load_decode_heap_oop(ref); |
tschatzl@6937 | 129 | assert(_g1h->is_in_g1_reserved(p), |
tschatzl@6937 | 130 | err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p))); |
tschatzl@6937 | 131 | } |
tschatzl@6937 | 132 | return true; |
tschatzl@6937 | 133 | } |
tschatzl@6937 | 134 | |
tschatzl@6937 | 135 | bool G1ParScanThreadState::verify_task(StarTask ref) const { |
tschatzl@6937 | 136 | if (ref.is_narrow()) { |
tschatzl@6937 | 137 | return verify_ref((narrowOop*) ref); |
tschatzl@6937 | 138 | } else { |
tschatzl@6937 | 139 | return verify_ref((oop*) ref); |
tschatzl@6937 | 140 | } |
tschatzl@6937 | 141 | } |
tschatzl@6937 | 142 | #endif // ASSERT |
tschatzl@6937 | 143 | |
tschatzl@6937 | 144 | void G1ParScanThreadState::trim_queue() { |
tschatzl@6937 | 145 | assert(_evac_failure_cl != NULL, "not set"); |
tschatzl@6937 | 146 | |
tschatzl@6937 | 147 | StarTask ref; |
tschatzl@6937 | 148 | do { |
tschatzl@6937 | 149 | // Drain the overflow stack first, so other threads can steal. |
tschatzl@6938 | 150 | while (_refs->pop_overflow(ref)) { |
tschatzl@6938 | 151 | dispatch_reference(ref); |
tschatzl@6937 | 152 | } |
tschatzl@6937 | 153 | |
tschatzl@6938 | 154 | while (_refs->pop_local(ref)) { |
tschatzl@6938 | 155 | dispatch_reference(ref); |
tschatzl@6937 | 156 | } |
tschatzl@6938 | 157 | } while (!_refs->is_empty()); |
tschatzl@6937 | 158 | } |
tschatzl@6937 | 159 | |
tschatzl@7651 | 160 | HeapWord* G1ParScanThreadState::allocate_in_next_plab(InCSetState const state, |
tschatzl@7651 | 161 | InCSetState* dest, |
tschatzl@7651 | 162 | size_t word_sz, |
tschatzl@7651 | 163 | AllocationContext_t const context) { |
tschatzl@7651 | 164 | assert(state.is_in_cset_or_humongous(), err_msg("Unexpected state: " CSETSTATE_FORMAT, state.value())); |
tschatzl@7651 | 165 | assert(dest->is_in_cset_or_humongous(), err_msg("Unexpected dest: " CSETSTATE_FORMAT, dest->value())); |
tschatzl@7651 | 166 | |
tschatzl@7651 | 167 | // Right now we only have two types of regions (young / old) so |
tschatzl@7651 | 168 | // let's keep the logic here simple. We can generalize it when necessary. |
tschatzl@7651 | 169 | if (dest->is_young()) { |
tschatzl@7651 | 170 | HeapWord* const obj_ptr = _g1_par_allocator->allocate(InCSetState::Old, |
tschatzl@7651 | 171 | word_sz, context); |
tschatzl@7651 | 172 | if (obj_ptr == NULL) { |
tschatzl@7651 | 173 | return NULL; |
tschatzl@7651 | 174 | } |
tschatzl@7651 | 175 | // Make sure that we won't attempt to copy any other objects out |
tschatzl@7651 | 176 | // of a survivor region (given that apparently we cannot allocate |
tschatzl@7651 | 177 | // any new ones) to avoid coming into this slow path. |
tschatzl@7651 | 178 | _tenuring_threshold = 0; |
tschatzl@7651 | 179 | dest->set_old(); |
tschatzl@7651 | 180 | return obj_ptr; |
tschatzl@7651 | 181 | } else { |
tschatzl@7651 | 182 | assert(dest->is_old(), err_msg("Unexpected dest: " CSETSTATE_FORMAT, dest->value())); |
tschatzl@7651 | 183 | // no other space to try. |
tschatzl@7651 | 184 | return NULL; |
tschatzl@7651 | 185 | } |
tschatzl@7651 | 186 | } |
tschatzl@7651 | 187 | |
tschatzl@7651 | 188 | InCSetState G1ParScanThreadState::next_state(InCSetState const state, markOop const m, uint& age) { |
tschatzl@7651 | 189 | if (state.is_young()) { |
tschatzl@7651 | 190 | age = !m->has_displaced_mark_helper() ? m->age() |
tschatzl@7651 | 191 | : m->displaced_mark_helper()->age(); |
tschatzl@7651 | 192 | if (age < _tenuring_threshold) { |
tschatzl@7651 | 193 | return state; |
tschatzl@7651 | 194 | } |
tschatzl@7651 | 195 | } |
tschatzl@7651 | 196 | return dest(state); |
tschatzl@7651 | 197 | } |
tschatzl@7651 | 198 | |
tschatzl@7651 | 199 | oop G1ParScanThreadState::copy_to_survivor_space(InCSetState const state, |
tschatzl@7651 | 200 | oop const old, |
sfriberg@7645 | 201 | markOop const old_mark) { |
tschatzl@7651 | 202 | const size_t word_sz = old->size(); |
tschatzl@7651 | 203 | HeapRegion* const from_region = _g1h->heap_region_containing_raw(old); |
tschatzl@6937 | 204 | // +1 to make the -1 indexes valid... |
tschatzl@7651 | 205 | const int young_index = from_region->young_index_in_cset()+1; |
tschatzl@6937 | 206 | assert( (from_region->is_young() && young_index > 0) || |
tschatzl@6937 | 207 | (!from_region->is_young() && young_index == 0), "invariant" ); |
tschatzl@7651 | 208 | const AllocationContext_t context = from_region->allocation_context(); |
tschatzl@7651 | 209 | |
tschatzl@7651 | 210 | uint age = 0; |
tschatzl@7651 | 211 | InCSetState dest_state = next_state(state, old_mark, age); |
tschatzl@7651 | 212 | HeapWord* obj_ptr = _g1_par_allocator->plab_allocate(dest_state, word_sz, context); |
tschatzl@7651 | 213 | |
tschatzl@7651 | 214 | // PLAB allocations should succeed most of the time, so we'll |
tschatzl@7651 | 215 | // normally check against NULL once and that's it. |
tschatzl@7651 | 216 | if (obj_ptr == NULL) { |
tschatzl@7651 | 217 | obj_ptr = _g1_par_allocator->allocate_direct_or_new_plab(dest_state, word_sz, context); |
tschatzl@7651 | 218 | if (obj_ptr == NULL) { |
tschatzl@7651 | 219 | obj_ptr = allocate_in_next_plab(state, &dest_state, word_sz, context); |
tschatzl@7651 | 220 | if (obj_ptr == NULL) { |
tschatzl@7651 | 221 | // This will either forward-to-self, or detect that someone else has |
tschatzl@7651 | 222 | // installed a forwarding pointer. |
tschatzl@7651 | 223 | return _g1h->handle_evacuation_failure_par(this, old); |
tschatzl@7651 | 224 | } |
tschatzl@7651 | 225 | } |
tschatzl@7651 | 226 | } |
tschatzl@7651 | 227 | |
tschatzl@7651 | 228 | assert(obj_ptr != NULL, "when we get here, allocation should have succeeded"); |
tschatzl@6937 | 229 | #ifndef PRODUCT |
tschatzl@6937 | 230 | // Should this evacuation fail? |
tschatzl@6937 | 231 | if (_g1h->evacuation_should_fail()) { |
tschatzl@7651 | 232 | // Doing this after all the allocation attempts also tests the |
tschatzl@7651 | 233 | // undo_allocation() method too. |
tschatzl@7651 | 234 | _g1_par_allocator->undo_allocation(dest_state, obj_ptr, word_sz, context); |
tschatzl@7651 | 235 | return _g1h->handle_evacuation_failure_par(this, old); |
tschatzl@6937 | 236 | } |
tschatzl@6937 | 237 | #endif // !PRODUCT |
tschatzl@6937 | 238 | |
tschatzl@6937 | 239 | // We're going to allocate linearly, so might as well prefetch ahead. |
tschatzl@6937 | 240 | Prefetch::write(obj_ptr, PrefetchCopyIntervalInBytes); |
tschatzl@6937 | 241 | |
tschatzl@7651 | 242 | const oop obj = oop(obj_ptr); |
tschatzl@7651 | 243 | const oop forward_ptr = old->forward_to_atomic(obj); |
tschatzl@6937 | 244 | if (forward_ptr == NULL) { |
tschatzl@6937 | 245 | Copy::aligned_disjoint_words((HeapWord*) old, obj_ptr, word_sz); |
tschatzl@6937 | 246 | |
tschatzl@7651 | 247 | if (dest_state.is_young()) { |
sfriberg@7645 | 248 | if (age < markOopDesc::max_age) { |
sfriberg@7645 | 249 | age++; |
sfriberg@7645 | 250 | } |
sfriberg@7645 | 251 | if (old_mark->has_displaced_mark_helper()) { |
sfriberg@7645 | 252 | // In this case, we have to install the mark word first, |
tschatzl@6937 | 253 | // otherwise obj looks to be forwarded (the old mark word, |
tschatzl@6937 | 254 | // which contains the forward pointer, was copied) |
sfriberg@7645 | 255 | obj->set_mark(old_mark); |
sfriberg@7645 | 256 | markOop new_mark = old_mark->displaced_mark_helper()->set_age(age); |
sfriberg@7645 | 257 | old_mark->set_displaced_mark_helper(new_mark); |
tschatzl@6937 | 258 | } else { |
sfriberg@7645 | 259 | obj->set_mark(old_mark->set_age(age)); |
tschatzl@6937 | 260 | } |
sfriberg@7645 | 261 | age_table()->add(age, word_sz); |
tschatzl@6937 | 262 | } else { |
sfriberg@7645 | 263 | obj->set_mark(old_mark); |
tschatzl@6937 | 264 | } |
tschatzl@6937 | 265 | |
tschatzl@6937 | 266 | if (G1StringDedup::is_enabled()) { |
tschatzl@7651 | 267 | const bool is_from_young = state.is_young(); |
tschatzl@7651 | 268 | const bool is_to_young = dest_state.is_young(); |
tschatzl@7651 | 269 | assert(is_from_young == _g1h->heap_region_containing_raw(old)->is_young(), |
tschatzl@7651 | 270 | "sanity"); |
tschatzl@7651 | 271 | assert(is_to_young == _g1h->heap_region_containing_raw(obj)->is_young(), |
tschatzl@7651 | 272 | "sanity"); |
tschatzl@7651 | 273 | G1StringDedup::enqueue_from_evacuation(is_from_young, |
tschatzl@7651 | 274 | is_to_young, |
tschatzl@6937 | 275 | queue_num(), |
tschatzl@6937 | 276 | obj); |
tschatzl@6937 | 277 | } |
tschatzl@6937 | 278 | |
tschatzl@7651 | 279 | size_t* const surv_young_words = surviving_young_words(); |
tschatzl@6937 | 280 | surv_young_words[young_index] += word_sz; |
tschatzl@6937 | 281 | |
tschatzl@6937 | 282 | if (obj->is_objArray() && arrayOop(obj)->length() >= ParGCArrayScanChunk) { |
tschatzl@6937 | 283 | // We keep track of the next start index in the length field of |
tschatzl@6937 | 284 | // the to-space object. The actual length can be found in the |
tschatzl@6937 | 285 | // length field of the from-space object. |
tschatzl@6937 | 286 | arrayOop(obj)->set_length(0); |
tschatzl@6937 | 287 | oop* old_p = set_partial_array_mask(old); |
tschatzl@6937 | 288 | push_on_queue(old_p); |
tschatzl@6937 | 289 | } else { |
tschatzl@7651 | 290 | HeapRegion* const to_region = _g1h->heap_region_containing_raw(obj_ptr); |
tschatzl@7651 | 291 | _scanner.set_region(to_region); |
tschatzl@6937 | 292 | obj->oop_iterate_backwards(&_scanner); |
tschatzl@6937 | 293 | } |
tschatzl@7651 | 294 | return obj; |
tschatzl@6937 | 295 | } else { |
tschatzl@7651 | 296 | _g1_par_allocator->undo_allocation(dest_state, obj_ptr, word_sz, context); |
tschatzl@7651 | 297 | return forward_ptr; |
tschatzl@6937 | 298 | } |
tschatzl@6937 | 299 | } |