1 /* 2 * Copyright (c) 2014, 2018, 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 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "gc/g1/g1Allocator.inline.hpp" 27 #include "gc/g1/g1AllocRegion.inline.hpp" 28 #include "gc/g1/g1EvacStats.inline.hpp" 29 #include "gc/g1/g1CollectedHeap.inline.hpp" 30 #include "gc/g1/g1Policy.hpp" 31 #include "gc/g1/heapRegion.inline.hpp" 32 #include "gc/g1/heapRegionSet.inline.hpp" 33 #include "gc/g1/heapRegionType.hpp" 34 #include "utilities/align.hpp" 35 36 G1Allocator::G1Allocator(G1CollectedHeap* heap) : 37 _g1h(heap), 38 _survivor_is_full(false), 39 _old_is_full(false), 40 _retained_old_gc_alloc_region(NULL), 41 _survivor_gc_alloc_region(heap->alloc_buffer_stats(InCSetState::Young)), 42 _old_gc_alloc_region(heap->alloc_buffer_stats(InCSetState::Old)) { 43 } 44 45 void G1Allocator::init_mutator_alloc_region() { 46 assert(_mutator_alloc_region.get() == NULL, "pre-condition"); 47 _mutator_alloc_region.init(); 48 } 49 50 void G1Allocator::release_mutator_alloc_region() { 51 _mutator_alloc_region.release(); 52 assert(_mutator_alloc_region.get() == NULL, "post-condition"); 53 } 54 55 bool G1Allocator::is_retained_old_region(HeapRegion* hr) { 56 return _retained_old_gc_alloc_region == hr; 57 } 58 59 void G1Allocator::reuse_retained_old_region(EvacuationInfo& evacuation_info, 60 OldGCAllocRegion* old, 61 HeapRegion** retained_old) { 62 HeapRegion* retained_region = *retained_old; 63 *retained_old = NULL; 64 assert(retained_region == NULL || !retained_region->is_archive(), 65 "Archive region should not be alloc region (index %u)", retained_region->hrm_index()); 66 67 // We will discard the current GC alloc region if: 68 // a) it's in the collection set (it can happen!), 69 // b) it's already full (no point in using it), 70 // c) it's empty (this means that it was emptied during 71 // a cleanup and it should be on the free list now), or 72 // d) it's humongous (this means that it was emptied 73 // during a cleanup and was added to the free list, but 74 // has been subsequently used to allocate a humongous 75 // object that may be less than the region size). 76 if (retained_region != NULL && 77 !retained_region->in_collection_set() && 78 !(retained_region->top() == retained_region->end()) && 79 !retained_region->is_empty() && 80 !retained_region->is_humongous()) { 81 // The retained region was added to the old region set when it was 82 // retired. We have to remove it now, since we don't allow regions 83 // we allocate to in the region sets. We'll re-add it later, when 84 // it's retired again. 85 _g1h->old_set_remove(retained_region); 86 bool during_im = _g1h->collector_state()->in_initial_mark_gc(); 87 retained_region->note_start_of_copying(during_im); 88 old->set(retained_region); 89 _g1h->hr_printer()->reuse(retained_region); 90 evacuation_info.set_alloc_regions_used_before(retained_region->used()); 91 } 92 } 93 94 void G1Allocator::init_gc_alloc_regions(EvacuationInfo& evacuation_info) { 95 assert_at_safepoint_on_vm_thread(); 96 97 _survivor_is_full = false; 98 _old_is_full = false; 99 100 _survivor_gc_alloc_region.init(); 101 _old_gc_alloc_region.init(); 102 reuse_retained_old_region(evacuation_info, 103 &_old_gc_alloc_region, 104 &_retained_old_gc_alloc_region); 105 } 106 107 void G1Allocator::release_gc_alloc_regions(EvacuationInfo& evacuation_info) { 108 evacuation_info.set_allocation_regions(survivor_gc_alloc_region()->count() + 109 old_gc_alloc_region()->count()); 110 survivor_gc_alloc_region()->release(); 111 // If we have an old GC alloc region to release, we'll save it in 112 // _retained_old_gc_alloc_region. If we don't 113 // _retained_old_gc_alloc_region will become NULL. This is what we 114 // want either way so no reason to check explicitly for either 115 // condition. 116 _retained_old_gc_alloc_region = old_gc_alloc_region()->release(); 117 } 118 119 void G1Allocator::abandon_gc_alloc_regions() { 120 assert(survivor_gc_alloc_region()->get() == NULL, "pre-condition"); 121 assert(old_gc_alloc_region()->get() == NULL, "pre-condition"); 122 _retained_old_gc_alloc_region = NULL; 123 } 124 125 bool G1Allocator::survivor_is_full() const { 126 return _survivor_is_full; 127 } 128 129 bool G1Allocator::old_is_full() const { 130 return _old_is_full; 131 } 132 133 void G1Allocator::set_survivor_full() { 134 _survivor_is_full = true; 135 } 136 137 void G1Allocator::set_old_full() { 138 _old_is_full = true; 139 } 140 141 size_t G1Allocator::unsafe_max_tlab_alloc() { 142 // Return the remaining space in the cur alloc region, but not less than 143 // the min TLAB size. 144 145 // Also, this value can be at most the humongous object threshold, 146 // since we can't allow tlabs to grow big enough to accommodate 147 // humongous objects. 148 149 HeapRegion* hr = mutator_alloc_region()->get(); 150 size_t max_tlab = _g1h->max_tlab_size() * wordSize; 151 if (hr == NULL) { 152 return max_tlab; 153 } else { 154 return MIN2(MAX2(hr->free(), (size_t) MinTLABSize), max_tlab); 155 } 156 } 157 158 size_t G1Allocator::used_in_alloc_regions() { 159 assert(Heap_lock->owner() != NULL, "Should be owned on this thread's behalf."); 160 return mutator_alloc_region()->used_in_alloc_regions(); 161 } 162 163 164 HeapWord* G1Allocator::par_allocate_during_gc(InCSetState dest, 165 size_t word_size) { 166 size_t temp = 0; 167 HeapWord* result = par_allocate_during_gc(dest, word_size, word_size, &temp); 168 assert(result == NULL || temp == word_size, 169 "Requested " SIZE_FORMAT " words, but got " SIZE_FORMAT " at " PTR_FORMAT, 170 word_size, temp, p2i(result)); 171 return result; 172 } 173 174 HeapWord* G1Allocator::par_allocate_during_gc(InCSetState dest, 175 size_t min_word_size, 176 size_t desired_word_size, 177 size_t* actual_word_size) { 178 switch (dest.value()) { 179 case InCSetState::Young: 180 return survivor_attempt_allocation(min_word_size, desired_word_size, actual_word_size); 181 case InCSetState::Old: 182 return old_attempt_allocation(min_word_size, desired_word_size, actual_word_size); 183 default: 184 ShouldNotReachHere(); 185 return NULL; // Keep some compilers happy 186 } 187 } 188 189 HeapWord* G1Allocator::survivor_attempt_allocation(size_t min_word_size, 190 size_t desired_word_size, 191 size_t* actual_word_size) { 192 assert(!_g1h->is_humongous(desired_word_size), 193 "we should not be seeing humongous-size allocations in this path"); 194 195 HeapWord* result = survivor_gc_alloc_region()->attempt_allocation(min_word_size, 196 desired_word_size, 197 actual_word_size); 198 if (result == NULL && !survivor_is_full()) { 199 MutexLockerEx x(FreeList_lock, Mutex::_no_safepoint_check_flag); 200 result = survivor_gc_alloc_region()->attempt_allocation_locked(min_word_size, 201 desired_word_size, 202 actual_word_size); 203 if (result == NULL) { 204 set_survivor_full(); 205 } 206 } 207 if (result != NULL) { 208 _g1h->dirty_young_block(result, *actual_word_size); 209 } 210 return result; 211 } 212 213 HeapWord* G1Allocator::old_attempt_allocation(size_t min_word_size, 214 size_t desired_word_size, 215 size_t* actual_word_size) { 216 assert(!_g1h->is_humongous(desired_word_size), 217 "we should not be seeing humongous-size allocations in this path"); 218 219 HeapWord* result = old_gc_alloc_region()->attempt_allocation(min_word_size, 220 desired_word_size, 221 actual_word_size); 222 if (result == NULL && !old_is_full()) { 223 MutexLockerEx x(FreeList_lock, Mutex::_no_safepoint_check_flag); 224 result = old_gc_alloc_region()->attempt_allocation_locked(min_word_size, 225 desired_word_size, 226 actual_word_size); 227 if (result == NULL) { 228 set_old_full(); 229 } 230 } 231 return result; 232 } 233 234 uint G1PLABAllocator::calc_survivor_alignment_bytes() { 235 assert(SurvivorAlignmentInBytes >= ObjectAlignmentInBytes, "sanity"); 236 if (SurvivorAlignmentInBytes == ObjectAlignmentInBytes) { 237 // No need to align objects in the survivors differently, return 0 238 // which means "survivor alignment is not used". 239 return 0; 240 } else { 241 assert(SurvivorAlignmentInBytes > 0, "sanity"); 242 return SurvivorAlignmentInBytes; 243 } 244 } 245 246 G1PLABAllocator::G1PLABAllocator(G1Allocator* allocator) : 247 _g1h(G1CollectedHeap::heap()), 248 _allocator(allocator), 249 _surviving_alloc_buffer(_g1h->desired_plab_sz(InCSetState::Young)), 250 _tenured_alloc_buffer(_g1h->desired_plab_sz(InCSetState::Old)), 251 _survivor_alignment_bytes(calc_survivor_alignment_bytes()) { 252 for (uint state = 0; state < InCSetState::Num; state++) { 253 _direct_allocated[state] = 0; 254 _alloc_buffers[state] = NULL; 255 } 256 _alloc_buffers[InCSetState::Young] = &_surviving_alloc_buffer; 257 _alloc_buffers[InCSetState::Old] = &_tenured_alloc_buffer; 258 } 259 260 bool G1PLABAllocator::may_throw_away_buffer(size_t const allocation_word_sz, size_t const buffer_size) const { 261 return (allocation_word_sz * 100 < buffer_size * ParallelGCBufferWastePct); 262 } 263 264 HeapWord* G1PLABAllocator::allocate_direct_or_new_plab(InCSetState dest, 265 size_t word_sz, 266 bool* plab_refill_failed) { 267 size_t plab_word_size = _g1h->desired_plab_sz(dest); 268 size_t required_in_plab = PLAB::size_required_for_allocation(word_sz); 269 270 // Only get a new PLAB if the allocation fits and it would not waste more than 271 // ParallelGCBufferWastePct in the existing buffer. 272 if ((required_in_plab <= plab_word_size) && 273 may_throw_away_buffer(required_in_plab, plab_word_size)) { 274 275 PLAB* alloc_buf = alloc_buffer(dest); 276 alloc_buf->retire(); 277 278 size_t actual_plab_size = 0; 279 HeapWord* buf = _allocator->par_allocate_during_gc(dest, 280 required_in_plab, 281 plab_word_size, 282 &actual_plab_size); 283 284 assert(buf == NULL || ((actual_plab_size >= required_in_plab) && (actual_plab_size <= plab_word_size)), 285 "Requested at minimum " SIZE_FORMAT ", desired " SIZE_FORMAT " words, but got " SIZE_FORMAT " at " PTR_FORMAT, 286 required_in_plab, plab_word_size, actual_plab_size, p2i(buf)); 287 288 if (buf != NULL) { 289 alloc_buf->set_buf(buf, actual_plab_size); 290 291 HeapWord* const obj = alloc_buf->allocate(word_sz); 292 assert(obj != NULL, "PLAB should have been big enough, tried to allocate " 293 SIZE_FORMAT " requiring " SIZE_FORMAT " PLAB size " SIZE_FORMAT, 294 word_sz, required_in_plab, plab_word_size); 295 return obj; 296 } 297 // Otherwise. 298 *plab_refill_failed = true; 299 } 300 // Try direct allocation. 301 HeapWord* result = _allocator->par_allocate_during_gc(dest, word_sz); 302 if (result != NULL) { 303 _direct_allocated[dest.value()] += word_sz; 304 } 305 return result; 306 } 307 308 void G1PLABAllocator::undo_allocation(InCSetState dest, HeapWord* obj, size_t word_sz) { 309 alloc_buffer(dest)->undo_allocation(obj, word_sz); 310 } 311 312 void G1PLABAllocator::flush_and_retire_stats() { 313 for (uint state = 0; state < InCSetState::Num; state++) { 314 PLAB* const buf = _alloc_buffers[state]; 315 if (buf != NULL) { 316 G1EvacStats* stats = _g1h->alloc_buffer_stats(state); 317 buf->flush_and_retire_stats(stats); 318 stats->add_direct_allocated(_direct_allocated[state]); 319 _direct_allocated[state] = 0; 320 } 321 } 322 } 323 324 void G1PLABAllocator::waste(size_t& wasted, size_t& undo_wasted) { 325 wasted = 0; 326 undo_wasted = 0; 327 for (uint state = 0; state < InCSetState::Num; state++) { 328 PLAB * const buf = _alloc_buffers[state]; 329 if (buf != NULL) { 330 wasted += buf->waste(); 331 undo_wasted += buf->undo_waste(); 332 } 333 } 334 } 335 336 bool G1ArchiveAllocator::_archive_check_enabled = false; 337 G1ArchiveRegionMap G1ArchiveAllocator::_closed_archive_region_map; 338 G1ArchiveRegionMap G1ArchiveAllocator::_open_archive_region_map; 339 340 G1ArchiveAllocator* G1ArchiveAllocator::create_allocator(G1CollectedHeap* g1h, bool open) { 341 // Create the archive allocator, and also enable archive object checking 342 // in mark-sweep, since we will be creating archive regions. 343 G1ArchiveAllocator* result = new G1ArchiveAllocator(g1h, open); 344 enable_archive_object_check(); 345 return result; 346 } 347 348 bool G1ArchiveAllocator::alloc_new_region() { 349 // Allocate the highest free region in the reserved heap, 350 // and add it to our list of allocated regions. It is marked 351 // archive and added to the old set. 352 HeapRegion* hr = _g1h->alloc_highest_free_region(); 353 if (hr == NULL) { 354 return false; 355 } 356 assert(hr->is_empty(), "expected empty region (index %u)", hr->hrm_index()); 357 if (_open) { 358 hr->set_open_archive(); 359 } else { 360 hr->set_closed_archive(); 361 } 362 _g1h->g1_policy()->remset_tracker()->update_at_allocate(hr); 363 _g1h->old_set_add(hr); 364 _g1h->hr_printer()->alloc(hr); 365 _allocated_regions.append(hr); 366 _allocation_region = hr; 367 368 // Set up _bottom and _max to begin allocating in the lowest 369 // min_region_size'd chunk of the allocated G1 region. 370 _bottom = hr->bottom(); 371 _max = _bottom + HeapRegion::min_region_size_in_words(); 372 373 // Tell mark-sweep that objects in this region are not to be marked. 374 set_range_archive(MemRegion(_bottom, HeapRegion::GrainWords), _open); 375 376 // Since we've modified the old set, call update_sizes. 377 _g1h->g1mm()->update_sizes(); 378 return true; 379 } 380 381 HeapWord* G1ArchiveAllocator::archive_mem_allocate(size_t word_size) { 382 assert(word_size != 0, "size must not be zero"); 383 if (_allocation_region == NULL) { 384 if (!alloc_new_region()) { 385 return NULL; 386 } 387 } 388 HeapWord* old_top = _allocation_region->top(); 389 assert(_bottom >= _allocation_region->bottom(), 390 "inconsistent allocation state: " PTR_FORMAT " < " PTR_FORMAT, 391 p2i(_bottom), p2i(_allocation_region->bottom())); 392 assert(_max <= _allocation_region->end(), 393 "inconsistent allocation state: " PTR_FORMAT " > " PTR_FORMAT, 394 p2i(_max), p2i(_allocation_region->end())); 395 assert(_bottom <= old_top && old_top <= _max, 396 "inconsistent allocation state: expected " 397 PTR_FORMAT " <= " PTR_FORMAT " <= " PTR_FORMAT, 398 p2i(_bottom), p2i(old_top), p2i(_max)); 399 400 // Allocate the next word_size words in the current allocation chunk. 401 // If allocation would cross the _max boundary, insert a filler and begin 402 // at the base of the next min_region_size'd chunk. Also advance to the next 403 // chunk if we don't yet cross the boundary, but the remainder would be too 404 // small to fill. 405 HeapWord* new_top = old_top + word_size; 406 size_t remainder = pointer_delta(_max, new_top); 407 if ((new_top > _max) || 408 ((new_top < _max) && (remainder < CollectedHeap::min_fill_size()))) { 409 if (old_top != _max) { 410 size_t fill_size = pointer_delta(_max, old_top); 411 CollectedHeap::fill_with_object(old_top, fill_size); 412 _summary_bytes_used += fill_size * HeapWordSize; 413 } 414 _allocation_region->set_top(_max); 415 old_top = _bottom = _max; 416 417 // Check if we've just used up the last min_region_size'd chunk 418 // in the current region, and if so, allocate a new one. 419 if (_bottom != _allocation_region->end()) { 420 _max = _bottom + HeapRegion::min_region_size_in_words(); 421 } else { 422 if (!alloc_new_region()) { 423 return NULL; 424 } 425 old_top = _allocation_region->bottom(); 426 } 427 } 428 _allocation_region->set_top(old_top + word_size); 429 _summary_bytes_used += word_size * HeapWordSize; 430 431 return old_top; 432 } 433 434 void G1ArchiveAllocator::complete_archive(GrowableArray<MemRegion>* ranges, 435 size_t end_alignment_in_bytes) { 436 assert((end_alignment_in_bytes >> LogHeapWordSize) < HeapRegion::min_region_size_in_words(), 437 "alignment " SIZE_FORMAT " too large", end_alignment_in_bytes); 438 assert(is_aligned(end_alignment_in_bytes, HeapWordSize), 439 "alignment " SIZE_FORMAT " is not HeapWord (%u) aligned", end_alignment_in_bytes, HeapWordSize); 440 441 // If we've allocated nothing, simply return. 442 if (_allocation_region == NULL) { 443 return; 444 } 445 446 // If an end alignment was requested, insert filler objects. 447 if (end_alignment_in_bytes != 0) { 448 HeapWord* currtop = _allocation_region->top(); 449 HeapWord* newtop = align_up(currtop, end_alignment_in_bytes); 450 size_t fill_size = pointer_delta(newtop, currtop); 451 if (fill_size != 0) { 452 if (fill_size < CollectedHeap::min_fill_size()) { 453 // If the required fill is smaller than we can represent, 454 // bump up to the next aligned address. We know we won't exceed the current 455 // region boundary because the max supported alignment is smaller than the min 456 // region size, and because the allocation code never leaves space smaller than 457 // the min_fill_size at the top of the current allocation region. 458 newtop = align_up(currtop + CollectedHeap::min_fill_size(), 459 end_alignment_in_bytes); 460 fill_size = pointer_delta(newtop, currtop); 461 } 462 HeapWord* fill = archive_mem_allocate(fill_size); 463 CollectedHeap::fill_with_objects(fill, fill_size); 464 } 465 } 466 467 // Loop through the allocated regions, and create MemRegions summarizing 468 // the allocated address range, combining contiguous ranges. Add the 469 // MemRegions to the GrowableArray provided by the caller. 470 int index = _allocated_regions.length() - 1; 471 assert(_allocated_regions.at(index) == _allocation_region, 472 "expected region %u at end of array, found %u", 473 _allocation_region->hrm_index(), _allocated_regions.at(index)->hrm_index()); 474 HeapWord* base_address = _allocation_region->bottom(); 475 HeapWord* top = base_address; 476 477 while (index >= 0) { 478 HeapRegion* next = _allocated_regions.at(index); 479 HeapWord* new_base = next->bottom(); 480 HeapWord* new_top = next->top(); 481 if (new_base != top) { 482 ranges->append(MemRegion(base_address, pointer_delta(top, base_address))); 483 base_address = new_base; 484 } 485 top = new_top; 486 index = index - 1; 487 } 488 489 assert(top != base_address, "zero-sized range, address " PTR_FORMAT, p2i(base_address)); 490 ranges->append(MemRegion(base_address, pointer_delta(top, base_address))); 491 _allocated_regions.clear(); 492 _allocation_region = NULL; 493 };