1 /* 2 * Copyright (c) 2000, 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 * 23 */ 24 25 #ifndef SHARE_VM_MEMORY_GENCOLLECTEDHEAP_HPP 26 #define SHARE_VM_MEMORY_GENCOLLECTEDHEAP_HPP 27 28 #include "gc_implementation/shared/adaptiveSizePolicy.hpp" 29 #include "memory/collectorPolicy.hpp" 30 #include "memory/generation.hpp" 31 #include "memory/sharedHeap.hpp" 32 33 class SubTasksDone; 34 35 // A "GenCollectedHeap" is a SharedHeap that uses generational 36 // collection. It has two generations, young and old. 37 class GenCollectedHeap : public SharedHeap { 38 friend class GenCollectorPolicy; 39 friend class Generation; 40 friend class DefNewGeneration; 41 friend class TenuredGeneration; 42 friend class ConcurrentMarkSweepGeneration; 43 friend class CMSCollector; 44 friend class GenMarkSweep; 45 friend class VM_GenCollectForAllocation; 46 friend class VM_GenCollectFull; 47 friend class VM_GenCollectFullConcurrent; 48 friend class VM_GC_HeapInspection; 49 friend class VM_HeapDumper; 50 friend class HeapInspection; 51 friend class GCCauseSetter; 52 friend class VMStructs; 53 public: 54 enum SomeConstants { 55 max_gens = 10 56 }; 57 58 friend class VM_PopulateDumpSharedSpace; 59 60 protected: 61 // Fields: 62 static GenCollectedHeap* _gch; 63 64 private: 65 int _n_gens; 66 67 Generation* _young_gen; 68 Generation* _old_gen; 69 70 // The singleton Gen Remembered Set. 71 GenRemSet* _rem_set; 72 73 // The generational collector policy. 74 GenCollectorPolicy* _gen_policy; 75 76 // Indicates that the most recent previous incremental collection failed. 77 // The flag is cleared when an action is taken that might clear the 78 // condition that caused that incremental collection to fail. 79 bool _incremental_collection_failed; 80 81 // In support of ExplicitGCInvokesConcurrent functionality 82 unsigned int _full_collections_completed; 83 84 // Data structure for claiming the (potentially) parallel tasks in 85 // (gen-specific) roots processing. 86 SubTasksDone* _gen_process_roots_tasks; 87 SubTasksDone* gen_process_roots_tasks() { return _gen_process_roots_tasks; } 88 89 // Collects the given generation. 90 void collect_generation(Generation* gen, bool full, size_t size, bool is_tlab, 91 bool run_verification, bool clear_soft_refs, 92 bool restore_marks_for_biased_locking); 93 94 // In block contents verification, the number of header words to skip 95 NOT_PRODUCT(static size_t _skip_header_HeapWords;) 96 97 protected: 98 // Helper functions for allocation 99 HeapWord* attempt_allocation(size_t size, 100 bool is_tlab, 101 bool first_only); 102 103 // Helper function for two callbacks below. 104 // Considers collection of the first max_level+1 generations. 105 void do_collection(bool full, 106 bool clear_all_soft_refs, 107 size_t size, 108 bool is_tlab, 109 int max_level); 110 111 // Callback from VM_GenCollectForAllocation operation. 112 // This function does everything necessary/possible to satisfy an 113 // allocation request that failed in the youngest generation that should 114 // have handled it (including collection, expansion, etc.) 115 HeapWord* satisfy_failed_allocation(size_t size, bool is_tlab); 116 117 // Callback from VM_GenCollectFull operation. 118 // Perform a full collection of the first max_level+1 generations. 119 virtual void do_full_collection(bool clear_all_soft_refs); 120 void do_full_collection(bool clear_all_soft_refs, int max_level); 121 122 // Does the "cause" of GC indicate that 123 // we absolutely __must__ clear soft refs? 124 bool must_clear_all_soft_refs(); 125 126 public: 127 GenCollectedHeap(GenCollectorPolicy *policy); 128 129 GCStats* gc_stats(int level) const; 130 131 // Returns JNI_OK on success 132 virtual jint initialize(); 133 134 // Reserve aligned space for the heap as needed by the contained generations. 135 char* allocate(size_t alignment, ReservedSpace* heap_rs); 136 137 // Does operations required after initialization has been done. 138 void post_initialize(); 139 140 // Initialize ("weak") refs processing support 141 virtual void ref_processing_init(); 142 143 virtual CollectedHeap::Name kind() const { 144 return CollectedHeap::GenCollectedHeap; 145 } 146 147 Generation* young_gen() const { return _young_gen; } 148 Generation* old_gen() const { return _old_gen; } 149 150 // The generational collector policy. 151 GenCollectorPolicy* gen_policy() const { return _gen_policy; } 152 153 virtual CollectorPolicy* collector_policy() const { return (CollectorPolicy*) gen_policy(); } 154 155 // Adaptive size policy 156 virtual AdaptiveSizePolicy* size_policy() { 157 return gen_policy()->size_policy(); 158 } 159 160 // Return the (conservative) maximum heap alignment 161 static size_t conservative_max_heap_alignment() { 162 return Generation::GenGrain; 163 } 164 165 size_t capacity() const; 166 size_t used() const; 167 168 // Save the "used_region" for generations level and lower. 169 void save_used_regions(int level); 170 171 size_t max_capacity() const; 172 173 HeapWord* mem_allocate(size_t size, 174 bool* gc_overhead_limit_was_exceeded); 175 176 // We may support a shared contiguous allocation area, if the youngest 177 // generation does. 178 bool supports_inline_contig_alloc() const; 179 HeapWord** top_addr() const; 180 HeapWord** end_addr() const; 181 182 // Does this heap support heap inspection? (+PrintClassHistogram) 183 virtual bool supports_heap_inspection() const { return true; } 184 185 // Perform a full collection of the heap; intended for use in implementing 186 // "System.gc". This implies as full a collection as the CollectedHeap 187 // supports. Caller does not hold the Heap_lock on entry. 188 void collect(GCCause::Cause cause); 189 190 // The same as above but assume that the caller holds the Heap_lock. 191 void collect_locked(GCCause::Cause cause); 192 193 // Perform a full collection of the first max_level+1 generations. 194 // Mostly used for testing purposes. Caller does not hold the Heap_lock on entry. 195 void collect(GCCause::Cause cause, int max_level); 196 197 // Returns "TRUE" iff "p" points into the committed areas of the heap. 198 // The methods is_in(), is_in_closed_subset() and is_in_youngest() may 199 // be expensive to compute in general, so, to prevent 200 // their inadvertent use in product jvm's, we restrict their use to 201 // assertion checking or verification only. 202 bool is_in(const void* p) const; 203 204 // override 205 bool is_in_closed_subset(const void* p) const { 206 if (UseConcMarkSweepGC) { 207 return is_in_reserved(p); 208 } else { 209 return is_in(p); 210 } 211 } 212 213 // Returns true if the reference is to an object in the reserved space 214 // for the young generation. 215 // Assumes the the young gen address range is less than that of the old gen. 216 bool is_in_young(oop p); 217 218 #ifdef ASSERT 219 virtual bool is_in_partial_collection(const void* p); 220 #endif 221 222 virtual bool is_scavengable(const void* addr) { 223 return is_in_young((oop)addr); 224 } 225 226 // Iteration functions. 227 void oop_iterate(ExtendedOopClosure* cl); 228 void object_iterate(ObjectClosure* cl); 229 void safe_object_iterate(ObjectClosure* cl); 230 Space* space_containing(const void* addr) const; 231 232 // A CollectedHeap is divided into a dense sequence of "blocks"; that is, 233 // each address in the (reserved) heap is a member of exactly 234 // one block. The defining characteristic of a block is that it is 235 // possible to find its size, and thus to progress forward to the next 236 // block. (Blocks may be of different sizes.) Thus, blocks may 237 // represent Java objects, or they might be free blocks in a 238 // free-list-based heap (or subheap), as long as the two kinds are 239 // distinguishable and the size of each is determinable. 240 241 // Returns the address of the start of the "block" that contains the 242 // address "addr". We say "blocks" instead of "object" since some heaps 243 // may not pack objects densely; a chunk may either be an object or a 244 // non-object. 245 virtual HeapWord* block_start(const void* addr) const; 246 247 // Requires "addr" to be the start of a chunk, and returns its size. 248 // "addr + size" is required to be the start of a new chunk, or the end 249 // of the active area of the heap. Assumes (and verifies in non-product 250 // builds) that addr is in the allocated part of the heap and is 251 // the start of a chunk. 252 virtual size_t block_size(const HeapWord* addr) const; 253 254 // Requires "addr" to be the start of a block, and returns "TRUE" iff 255 // the block is an object. Assumes (and verifies in non-product 256 // builds) that addr is in the allocated part of the heap and is 257 // the start of a chunk. 258 virtual bool block_is_obj(const HeapWord* addr) const; 259 260 // Section on TLAB's. 261 virtual bool supports_tlab_allocation() const; 262 virtual size_t tlab_capacity(Thread* thr) const; 263 virtual size_t tlab_used(Thread* thr) const; 264 virtual size_t unsafe_max_tlab_alloc(Thread* thr) const; 265 virtual HeapWord* allocate_new_tlab(size_t size); 266 267 // Can a compiler initialize a new object without store barriers? 268 // This permission only extends from the creation of a new object 269 // via a TLAB up to the first subsequent safepoint. 270 virtual bool can_elide_tlab_store_barriers() const { 271 return true; 272 } 273 274 virtual bool card_mark_must_follow_store() const { 275 return UseConcMarkSweepGC; 276 } 277 278 // We don't need barriers for stores to objects in the 279 // young gen and, a fortiori, for initializing stores to 280 // objects therein. This applies to DefNew+Tenured and ParNew+CMS 281 // only and may need to be re-examined in case other 282 // kinds of collectors are implemented in the future. 283 virtual bool can_elide_initializing_store_barrier(oop new_obj) { 284 // We wanted to assert that:- 285 // assert(UseSerialGC || UseConcMarkSweepGC, 286 // "Check can_elide_initializing_store_barrier() for this collector"); 287 // but unfortunately the flag UseSerialGC need not necessarily always 288 // be set when DefNew+Tenured are being used. 289 return is_in_young(new_obj); 290 } 291 292 // The "requestor" generation is performing some garbage collection 293 // action for which it would be useful to have scratch space. The 294 // requestor promises to allocate no more than "max_alloc_words" in any 295 // older generation (via promotion say.) Any blocks of space that can 296 // be provided are returned as a list of ScratchBlocks, sorted by 297 // decreasing size. 298 ScratchBlock* gather_scratch(Generation* requestor, size_t max_alloc_words); 299 // Allow each generation to reset any scratch space that it has 300 // contributed as it needs. 301 void release_scratch(); 302 303 // Ensure parsability: override 304 virtual void ensure_parsability(bool retire_tlabs); 305 306 // Time in ms since the longest time a collector ran in 307 // in any generation. 308 virtual jlong millis_since_last_gc(); 309 310 // Total number of full collections completed. 311 unsigned int total_full_collections_completed() { 312 assert(_full_collections_completed <= _total_full_collections, 313 "Can't complete more collections than were started"); 314 return _full_collections_completed; 315 } 316 317 // Update above counter, as appropriate, at the end of a stop-world GC cycle 318 unsigned int update_full_collections_completed(); 319 // Update above counter, as appropriate, at the end of a concurrent GC cycle 320 unsigned int update_full_collections_completed(unsigned int count); 321 322 // Update "time of last gc" for all generations to "now". 323 void update_time_of_last_gc(jlong now) { 324 _young_gen->update_time_of_last_gc(now); 325 _old_gen->update_time_of_last_gc(now); 326 } 327 328 // Update the gc statistics for each generation. 329 // "level" is the level of the latest collection. 330 void update_gc_stats(int current_level, bool full) { 331 _young_gen->update_gc_stats(current_level, full); 332 _old_gen->update_gc_stats(current_level, full); 333 } 334 335 // Override. 336 bool no_gc_in_progress() { return !is_gc_active(); } 337 338 // Override. 339 void prepare_for_verify(); 340 341 // Override. 342 void verify(bool silent, VerifyOption option); 343 344 // Override. 345 virtual void print_on(outputStream* st) const; 346 virtual void print_gc_threads_on(outputStream* st) const; 347 virtual void gc_threads_do(ThreadClosure* tc) const; 348 virtual void print_tracing_info() const; 349 virtual void print_on_error(outputStream* st) const; 350 351 // PrintGC, PrintGCDetails support 352 void print_heap_change(size_t prev_used) const; 353 354 // The functions below are helper functions that a subclass of 355 // "CollectedHeap" can use in the implementation of its virtual 356 // functions. 357 358 class GenClosure : public StackObj { 359 public: 360 virtual void do_generation(Generation* gen) = 0; 361 }; 362 363 // Apply "cl.do_generation" to all generations in the heap 364 // If "old_to_young" determines the order. 365 void generation_iterate(GenClosure* cl, bool old_to_young); 366 367 void space_iterate(SpaceClosure* cl); 368 369 // Return "true" if all generations have reached the 370 // maximal committed limit that they can reach, without a garbage 371 // collection. 372 virtual bool is_maximal_no_gc() const; 373 374 int n_gens() const { 375 assert(_n_gens == gen_policy()->number_of_generations(), "Sanity"); 376 return _n_gens; 377 } 378 379 // This function returns the "GenRemSet" object that allows us to scan 380 // generations in a fully generational heap. 381 GenRemSet* rem_set() { return _rem_set; } 382 383 // Convenience function to be used in situations where the heap type can be 384 // asserted to be this type. 385 static GenCollectedHeap* heap(); 386 387 void set_par_threads(uint t); 388 389 // Invoke the "do_oop" method of one of the closures "not_older_gens" 390 // or "older_gens" on root locations for the generation at 391 // "level". (The "older_gens" closure is used for scanning references 392 // from older generations; "not_older_gens" is used everywhere else.) 393 // If "younger_gens_as_roots" is false, younger generations are 394 // not scanned as roots; in this case, the caller must be arranging to 395 // scan the younger generations itself. (For example, a generation might 396 // explicitly mark reachable objects in younger generations, to avoid 397 // excess storage retention.) 398 // The "so" argument determines which of the roots 399 // the closure is applied to: 400 // "SO_None" does none; 401 private: 402 void gen_process_roots(int level, 403 bool younger_gens_as_roots, 404 bool activate_scope, 405 SharedHeap::ScanningOption so, 406 OopsInGenClosure* not_older_gens, 407 OopsInGenClosure* weak_roots, 408 OopsInGenClosure* older_gens, 409 CLDClosure* cld_closure, 410 CLDClosure* weak_cld_closure, 411 CodeBlobClosure* code_closure); 412 413 public: 414 static const bool StrongAndWeakRoots = false; 415 static const bool StrongRootsOnly = true; 416 417 void gen_process_roots(int level, 418 bool younger_gens_as_roots, 419 bool activate_scope, 420 SharedHeap::ScanningOption so, 421 bool only_strong_roots, 422 OopsInGenClosure* not_older_gens, 423 OopsInGenClosure* older_gens, 424 CLDClosure* cld_closure); 425 426 // Apply "root_closure" to all the weak roots of the system. 427 // These include JNI weak roots, string table, 428 // and referents of reachable weak refs. 429 void gen_process_weak_roots(OopClosure* root_closure); 430 431 // Set the saved marks of generations, if that makes sense. 432 // In particular, if any generation might iterate over the oops 433 // in other generations, it should call this method. 434 void save_marks(); 435 436 // Apply "cur->do_oop" or "older->do_oop" to all the oops in objects 437 // allocated since the last call to save_marks in generations at or above 438 // "level". The "cur" closure is 439 // applied to references in the generation at "level", and the "older" 440 // closure to older generations. 441 #define GCH_SINCE_SAVE_MARKS_ITERATE_DECL(OopClosureType, nv_suffix) \ 442 void oop_since_save_marks_iterate(int level, \ 443 OopClosureType* cur, \ 444 OopClosureType* older); 445 446 ALL_SINCE_SAVE_MARKS_CLOSURES(GCH_SINCE_SAVE_MARKS_ITERATE_DECL) 447 448 #undef GCH_SINCE_SAVE_MARKS_ITERATE_DECL 449 450 // Returns "true" iff no allocations have occurred in any generation at 451 // "level" or above since the last 452 // call to "save_marks". 453 bool no_allocs_since_save_marks(int level); 454 455 // Returns true if an incremental collection is likely to fail. 456 // We optionally consult the young gen, if asked to do so; 457 // otherwise we base our answer on whether the previous incremental 458 // collection attempt failed with no corrective action as of yet. 459 bool incremental_collection_will_fail(bool consult_young) { 460 // Assumes a 2-generation system; the first disjunct remembers if an 461 // incremental collection failed, even when we thought (second disjunct) 462 // that it would not. 463 assert(heap()->collector_policy()->is_generation_policy(), 464 "the following definition may not be suitable for an n(>2)-generation system"); 465 return incremental_collection_failed() || 466 (consult_young && !_young_gen->collection_attempt_is_safe()); 467 } 468 469 // If a generation bails out of an incremental collection, 470 // it sets this flag. 471 bool incremental_collection_failed() const { 472 return _incremental_collection_failed; 473 } 474 void set_incremental_collection_failed() { 475 _incremental_collection_failed = true; 476 } 477 void clear_incremental_collection_failed() { 478 _incremental_collection_failed = false; 479 } 480 481 // Promotion of obj into gen failed. Try to promote obj to higher 482 // gens in ascending order; return the new location of obj if successful. 483 // Otherwise, try expand-and-allocate for obj in both the young and old 484 // generation; return the new location of obj if successful. Otherwise, return NULL. 485 oop handle_failed_promotion(Generation* old_gen, 486 oop obj, 487 size_t obj_size); 488 489 private: 490 // Accessor for memory state verification support 491 NOT_PRODUCT( 492 static size_t skip_header_HeapWords() { return _skip_header_HeapWords; } 493 ) 494 495 // Override 496 void check_for_non_bad_heap_word_value(HeapWord* addr, 497 size_t size) PRODUCT_RETURN; 498 499 // For use by mark-sweep. As implemented, mark-sweep-compact is global 500 // in an essential way: compaction is performed across generations, by 501 // iterating over spaces. 502 void prepare_for_compaction(); 503 504 // Perform a full collection of the first max_level+1 generations. 505 // This is the low level interface used by the public versions of 506 // collect() and collect_locked(). Caller holds the Heap_lock on entry. 507 void collect_locked(GCCause::Cause cause, int max_level); 508 509 // Returns success or failure. 510 bool create_cms_collector(); 511 512 // In support of ExplicitGCInvokesConcurrent functionality 513 bool should_do_concurrent_full_gc(GCCause::Cause cause); 514 void collect_mostly_concurrent(GCCause::Cause cause); 515 516 // Save the tops of the spaces in all generations 517 void record_gen_tops_before_GC() PRODUCT_RETURN; 518 519 protected: 520 virtual void gc_prologue(bool full); 521 virtual void gc_epilogue(bool full); 522 }; 523 524 #endif // SHARE_VM_MEMORY_GENCOLLECTEDHEAP_HPP