1 /* 2 * Copyright (c) 2015, 2019, 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 #include "precompiled.hpp" 25 #include "gc/shared/locationPrinter.hpp" 26 #include "gc/z/zAddress.inline.hpp" 27 #include "gc/z/zGlobals.hpp" 28 #include "gc/z/zHeap.inline.hpp" 29 #include "gc/z/zHeapIterator.hpp" 30 #include "gc/z/zMark.inline.hpp" 31 #include "gc/z/zPage.inline.hpp" 32 #include "gc/z/zPageTable.inline.hpp" 33 #include "gc/z/zRelocationSet.inline.hpp" 34 #include "gc/z/zRelocationSetSelector.hpp" 35 #include "gc/z/zResurrection.hpp" 36 #include "gc/z/zStat.hpp" 37 #include "gc/z/zThread.inline.hpp" 38 #include "gc/z/zVerify.hpp" 39 #include "gc/z/zWorkers.inline.hpp" 40 #include "logging/log.hpp" 41 #include "memory/iterator.hpp" 42 #include "memory/resourceArea.hpp" 43 #include "runtime/handshake.hpp" 44 #include "runtime/safepoint.hpp" 45 #include "runtime/thread.hpp" 46 #include "utilities/debug.hpp" 47 48 static const ZStatSampler ZSamplerHeapUsedBeforeMark("Memory", "Heap Used Before Mark", ZStatUnitBytes); 49 static const ZStatSampler ZSamplerHeapUsedAfterMark("Memory", "Heap Used After Mark", ZStatUnitBytes); 50 static const ZStatSampler ZSamplerHeapUsedBeforeRelocation("Memory", "Heap Used Before Relocation", ZStatUnitBytes); 51 static const ZStatSampler ZSamplerHeapUsedAfterRelocation("Memory", "Heap Used After Relocation", ZStatUnitBytes); 52 static const ZStatCounter ZCounterUndoPageAllocation("Memory", "Undo Page Allocation", ZStatUnitOpsPerSecond); 53 static const ZStatCounter ZCounterOutOfMemory("Memory", "Out Of Memory", ZStatUnitOpsPerSecond); 54 55 ZHeap* ZHeap::_heap = NULL; 56 57 ZHeap::ZHeap() : 58 _workers(), 59 _object_allocator(), 60 _page_allocator(heap_min_size(), heap_initial_size(), heap_max_size(), heap_max_reserve_size()), 61 _page_table(), 62 _forwarding_table(), 63 _mark(&_workers, &_page_table), 64 _reference_processor(&_workers), 65 _weak_roots_processor(&_workers), 66 _relocate(&_workers), 67 _relocation_set(), 68 _unload(&_workers), 69 _serviceability(heap_min_size(), heap_max_size()) { 70 // Install global heap instance 71 assert(_heap == NULL, "Already initialized"); 72 _heap = this; 73 74 // Update statistics 75 ZStatHeap::set_at_initialize(heap_min_size(), heap_max_size(), heap_max_reserve_size()); 76 } 77 78 size_t ZHeap::heap_min_size() const { 79 return MinHeapSize; 80 } 81 82 size_t ZHeap::heap_initial_size() const { 83 return InitialHeapSize; 84 } 85 86 size_t ZHeap::heap_max_size() const { 87 return MaxHeapSize; 88 } 89 90 size_t ZHeap::heap_max_reserve_size() const { 91 // Reserve one small page per worker plus one shared medium page. This is still just 92 // an estimate and doesn't guarantee that we can't run out of memory during relocation. 93 const size_t max_reserve_size = (_workers.nworkers() * ZPageSizeSmall) + ZPageSizeMedium; 94 return MIN2(max_reserve_size, heap_max_size()); 95 } 96 97 bool ZHeap::is_initialized() const { 98 return _page_allocator.is_initialized() && _mark.is_initialized(); 99 } 100 101 size_t ZHeap::min_capacity() const { 102 return _page_allocator.min_capacity(); 103 } 104 105 size_t ZHeap::max_capacity() const { 106 return _page_allocator.max_capacity(); 107 } 108 109 size_t ZHeap::soft_max_capacity() const { 110 return _page_allocator.soft_max_capacity(); 111 } 112 113 size_t ZHeap::capacity() const { 114 return _page_allocator.capacity(); 115 } 116 117 size_t ZHeap::max_reserve() const { 118 return _page_allocator.max_reserve(); 119 } 120 121 size_t ZHeap::used_high() const { 122 return _page_allocator.used_high(); 123 } 124 125 size_t ZHeap::used_low() const { 126 return _page_allocator.used_low(); 127 } 128 129 size_t ZHeap::used() const { 130 return _page_allocator.used(); 131 } 132 133 size_t ZHeap::unused() const { 134 return _page_allocator.unused(); 135 } 136 137 size_t ZHeap::allocated() const { 138 return _page_allocator.allocated(); 139 } 140 141 size_t ZHeap::reclaimed() const { 142 return _page_allocator.reclaimed(); 143 } 144 145 size_t ZHeap::tlab_capacity() const { 146 return capacity(); 147 } 148 149 size_t ZHeap::tlab_used() const { 150 return _object_allocator.used(); 151 } 152 153 size_t ZHeap::max_tlab_size() const { 154 return ZObjectSizeLimitSmall; 155 } 156 157 size_t ZHeap::unsafe_max_tlab_alloc() const { 158 size_t size = _object_allocator.remaining(); 159 160 if (size < MinTLABSize) { 161 // The remaining space in the allocator is not enough to 162 // fit the smallest possible TLAB. This means that the next 163 // TLAB allocation will force the allocator to get a new 164 // backing page anyway, which in turn means that we can then 165 // fit the largest possible TLAB. 166 size = max_tlab_size(); 167 } 168 169 return MIN2(size, max_tlab_size()); 170 } 171 172 bool ZHeap::is_in(uintptr_t addr) const { 173 // An address is considered to be "in the heap" if it points into 174 // the allocated part of a page, regardless of which heap view is 175 // used. Note that an address with the finalizable metadata bit set 176 // is not pointing into a heap view, and therefore not considered 177 // to be "in the heap". 178 179 if (ZAddress::is_in(addr)) { 180 const ZPage* const page = _page_table.get(addr); 181 if (page != NULL) { 182 return page->is_in(addr); 183 } 184 } 185 186 return false; 187 } 188 189 uint ZHeap::nconcurrent_worker_threads() const { 190 return _workers.nconcurrent(); 191 } 192 193 uint ZHeap::nconcurrent_no_boost_worker_threads() const { 194 return _workers.nconcurrent_no_boost(); 195 } 196 197 void ZHeap::set_boost_worker_threads(bool boost) { 198 _workers.set_boost(boost); 199 } 200 201 void ZHeap::worker_threads_do(ThreadClosure* tc) const { 202 _workers.threads_do(tc); 203 } 204 205 void ZHeap::print_worker_threads_on(outputStream* st) const { 206 _workers.print_threads_on(st); 207 } 208 209 void ZHeap::out_of_memory() { 210 ResourceMark rm; 211 212 ZStatInc(ZCounterOutOfMemory); 213 log_info(gc)("Out Of Memory (%s)", Thread::current()->name()); 214 } 215 216 ZPage* ZHeap::alloc_page(uint8_t type, size_t size, ZAllocationFlags flags) { 217 ZPage* const page = _page_allocator.alloc_page(type, size, flags); 218 if (page != NULL) { 219 // Insert page table entry 220 _page_table.insert(page); 221 } 222 223 return page; 224 } 225 226 void ZHeap::undo_alloc_page(ZPage* page) { 227 assert(page->is_allocating(), "Invalid page state"); 228 229 ZStatInc(ZCounterUndoPageAllocation); 230 log_trace(gc)("Undo page allocation, thread: " PTR_FORMAT " (%s), page: " PTR_FORMAT ", size: " SIZE_FORMAT, 231 ZThread::id(), ZThread::name(), p2i(page), page->size()); 232 233 free_page(page, false /* reclaimed */); 234 } 235 236 void ZHeap::free_page(ZPage* page, bool reclaimed) { 237 // Remove page table entry 238 _page_table.remove(page); 239 240 // Free page 241 _page_allocator.free_page(page, reclaimed); 242 } 243 244 uint64_t ZHeap::uncommit(uint64_t delay) { 245 return _page_allocator.uncommit(delay); 246 } 247 248 void ZHeap::flip_to_marked() { 249 ZVerifyViewsFlip flip(&_page_allocator); 250 ZAddress::flip_to_marked(); 251 } 252 253 void ZHeap::flip_to_remapped() { 254 ZVerifyViewsFlip flip(&_page_allocator); 255 ZAddress::flip_to_remapped(); 256 } 257 258 void ZHeap::mark_start() { 259 assert(SafepointSynchronize::is_at_safepoint(), "Should be at safepoint"); 260 261 // Update statistics 262 ZStatSample(ZSamplerHeapUsedBeforeMark, used()); 263 264 // Flip address view 265 flip_to_marked(); 266 267 // Retire allocating pages 268 _object_allocator.retire_pages(); 269 270 // Reset allocated/reclaimed/used statistics 271 _page_allocator.reset_statistics(); 272 273 // Reset encountered/dropped/enqueued statistics 274 _reference_processor.reset_statistics(); 275 276 // Enter mark phase 277 ZGlobalPhase = ZPhaseMark; 278 279 // Reset marking information and mark roots 280 _mark.start(); 281 282 // Update statistics 283 ZStatHeap::set_at_mark_start(soft_max_capacity(), capacity(), used()); 284 } 285 286 void ZHeap::mark(bool initial) { 287 _mark.mark(initial); 288 } 289 290 void ZHeap::mark_flush_and_free(Thread* thread) { 291 _mark.flush_and_free(thread); 292 } 293 294 bool ZHeap::mark_end() { 295 assert(SafepointSynchronize::is_at_safepoint(), "Should be at safepoint"); 296 297 // Try end marking 298 if (!_mark.end()) { 299 // Marking not completed, continue concurrent mark 300 return false; 301 } 302 303 // Enter mark completed phase 304 ZGlobalPhase = ZPhaseMarkCompleted; 305 306 // Verify after mark 307 ZVerify::after_mark(); 308 309 // Update statistics 310 ZStatSample(ZSamplerHeapUsedAfterMark, used()); 311 ZStatHeap::set_at_mark_end(capacity(), allocated(), used()); 312 313 // Block resurrection of weak/phantom references 314 ZResurrection::block(); 315 316 // Process weak roots 317 _weak_roots_processor.process_weak_roots(); 318 319 // Prepare to unload stale metadata and nmethods 320 _unload.prepare(); 321 322 return true; 323 } 324 325 void ZHeap::set_soft_reference_policy(bool clear) { 326 _reference_processor.set_soft_reference_policy(clear); 327 } 328 329 class ZRendezvousClosure : public HandshakeOperation { 330 public: 331 ZRendezvousClosure() : HandshakeOperation("ZRendezvous") {} 332 void do_thread(JavaThread* thread) {} 333 }; 334 335 void ZHeap::process_non_strong_references() { 336 // Process Soft/Weak/Final/PhantomReferences 337 _reference_processor.process_references(); 338 339 // Process concurrent weak roots 340 _weak_roots_processor.process_concurrent_weak_roots(); 341 342 // Unlink stale metadata and nmethods 343 _unload.unlink(); 344 345 // Perform a handshake. This is needed 1) to make sure that stale 346 // metadata and nmethods are no longer observable. And 2), to 347 // prevent the race where a mutator first loads an oop, which is 348 // logically null but not yet cleared. Then this oop gets cleared 349 // by the reference processor and resurrection is unblocked. At 350 // this point the mutator could see the unblocked state and pass 351 // this invalid oop through the normal barrier path, which would 352 // incorrectly try to mark the oop. 353 ZRendezvousClosure zr_hs; 354 Handshake::execute(&zr_hs); 355 356 // Purge stale metadata and nmethods that were unlinked 357 _unload.purge(); 358 359 // Unblock resurrection of weak/phantom references 360 ZResurrection::unblock(); 361 362 // Enqueue Soft/Weak/Final/PhantomReferences. Note that this 363 // must be done after unblocking resurrection. Otherwise the 364 // Finalizer thread could call Reference.get() on the Finalizers 365 // that were just enqueued, which would incorrectly return null 366 // during the resurrection block window, since such referents 367 // are only Finalizable marked. 368 _reference_processor.enqueue_references(); 369 } 370 371 void ZHeap::select_relocation_set() { 372 // Do not allow pages to be deleted 373 _page_allocator.enable_deferred_delete(); 374 375 // Register relocatable pages with selector 376 ZRelocationSetSelector selector; 377 ZPageTableIterator pt_iter(&_page_table); 378 for (ZPage* page; pt_iter.next(&page);) { 379 if (!page->is_relocatable()) { 380 // Not relocatable, don't register 381 continue; 382 } 383 384 if (page->is_marked()) { 385 // Register live page 386 selector.register_live_page(page); 387 } else { 388 // Register garbage page 389 selector.register_garbage_page(page); 390 391 // Reclaim page immediately 392 free_page(page, true /* reclaimed */); 393 } 394 } 395 396 // Allow pages to be deleted 397 _page_allocator.disable_deferred_delete(); 398 399 // Select pages to relocate 400 selector.select(&_relocation_set); 401 402 // Setup forwarding table 403 ZRelocationSetIterator rs_iter(&_relocation_set); 404 for (ZForwarding* forwarding; rs_iter.next(&forwarding);) { 405 _forwarding_table.insert(forwarding); 406 } 407 408 // Update statistics 409 ZStatRelocation::set_at_select_relocation_set(selector.relocating()); 410 ZStatHeap::set_at_select_relocation_set(selector.live(), 411 selector.garbage(), 412 reclaimed()); 413 } 414 415 void ZHeap::reset_relocation_set() { 416 // Reset forwarding table 417 ZRelocationSetIterator iter(&_relocation_set); 418 for (ZForwarding* forwarding; iter.next(&forwarding);) { 419 _forwarding_table.remove(forwarding); 420 } 421 422 // Reset relocation set 423 _relocation_set.reset(); 424 } 425 426 void ZHeap::relocate_start() { 427 assert(SafepointSynchronize::is_at_safepoint(), "Should be at safepoint"); 428 429 // Finish unloading stale metadata and nmethods 430 _unload.finish(); 431 432 // Flip address view 433 flip_to_remapped(); 434 435 // Enter relocate phase 436 ZGlobalPhase = ZPhaseRelocate; 437 438 // Update statistics 439 ZStatSample(ZSamplerHeapUsedBeforeRelocation, used()); 440 ZStatHeap::set_at_relocate_start(capacity(), allocated(), used()); 441 442 // Remap/Relocate roots 443 _relocate.start(); 444 } 445 446 void ZHeap::relocate() { 447 // Relocate relocation set 448 const bool success = _relocate.relocate(&_relocation_set); 449 450 // Update statistics 451 ZStatSample(ZSamplerHeapUsedAfterRelocation, used()); 452 ZStatRelocation::set_at_relocate_end(success); 453 ZStatHeap::set_at_relocate_end(capacity(), allocated(), reclaimed(), 454 used(), used_high(), used_low()); 455 } 456 457 void ZHeap::object_iterate(ObjectClosure* cl, bool visit_weaks) { 458 assert(SafepointSynchronize::is_at_safepoint(), "Should be at safepoint"); 459 460 ZHeapIterator iter; 461 iter.objects_do(cl, visit_weaks); 462 } 463 464 void ZHeap::pages_do(ZPageClosure* cl) { 465 ZPageTableIterator iter(&_page_table); 466 for (ZPage* page; iter.next(&page);) { 467 cl->do_page(page); 468 } 469 _page_allocator.pages_do(cl); 470 } 471 472 void ZHeap::serviceability_initialize() { 473 _serviceability.initialize(); 474 } 475 476 GCMemoryManager* ZHeap::serviceability_memory_manager() { 477 return _serviceability.memory_manager(); 478 } 479 480 MemoryPool* ZHeap::serviceability_memory_pool() { 481 return _serviceability.memory_pool(); 482 } 483 484 ZServiceabilityCounters* ZHeap::serviceability_counters() { 485 return _serviceability.counters(); 486 } 487 488 void ZHeap::print_on(outputStream* st) const { 489 st->print_cr(" ZHeap used " SIZE_FORMAT "M, capacity " SIZE_FORMAT "M, max capacity " SIZE_FORMAT "M", 490 used() / M, 491 capacity() / M, 492 max_capacity() / M); 493 MetaspaceUtils::print_on(st); 494 } 495 496 void ZHeap::print_extended_on(outputStream* st) const { 497 print_on(st); 498 st->cr(); 499 500 // Do not allow pages to be deleted 501 _page_allocator.enable_deferred_delete(); 502 503 // Print all pages 504 ZPageTableIterator iter(&_page_table); 505 for (ZPage* page; iter.next(&page);) { 506 page->print_on(st); 507 } 508 509 // Allow pages to be deleted 510 _page_allocator.enable_deferred_delete(); 511 512 st->cr(); 513 } 514 515 bool ZHeap::print_location(outputStream* st, uintptr_t addr) const { 516 if (LocationPrinter::is_valid_obj((void*)addr)) { 517 st->print(PTR_FORMAT " is a %s oop: ", addr, ZAddress::is_good(addr) ? "good" : "bad"); 518 ZOop::from_address(addr)->print_on(st); 519 return true; 520 } 521 522 return false; 523 } 524 525 void ZHeap::verify() { 526 // Heap verification can only be done between mark end and 527 // relocate start. This is the only window where all oop are 528 // good and the whole heap is in a consistent state. 529 guarantee(ZGlobalPhase == ZPhaseMarkCompleted, "Invalid phase"); 530 531 ZVerify::after_weak_processing(); 532 }