1 /*
2 * Copyright (c) 2000, 2021, 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_GC_SHARED_GENCOLLECTEDHEAP_HPP
26 #define SHARE_GC_SHARED_GENCOLLECTEDHEAP_HPP
27
28 #include "gc/shared/collectedHeap.hpp"
29 #include "gc/shared/generation.hpp"
30 #include "gc/shared/oopStorageParState.hpp"
31 #include "gc/shared/preGCValues.hpp"
32 #include "gc/shared/softRefGenPolicy.hpp"
33
34 class AdaptiveSizePolicy;
35 class CardTableRS;
36 class GCPolicyCounters;
37 class GenerationSpec;
38 class StrongRootsScope;
39 class SubTasksDone;
40 class WorkerThreads;
41
42 // A "GenCollectedHeap" is a CollectedHeap that uses generational
43 // collection. It has two generations, young and old.
44 class GenCollectedHeap : public CollectedHeap {
45 friend class Generation;
46 friend class DefNewGeneration;
47 friend class TenuredGeneration;
48 friend class GenMarkSweep;
49 friend class VM_GenCollectForAllocation;
50 friend class VM_GenCollectFull;
51 friend class VM_GC_HeapInspection;
52 friend class VM_HeapDumper;
53 friend class HeapInspection;
54 friend class GCCauseSetter;
55 friend class VMStructs;
56 public:
57 friend class VM_PopulateDumpSharedSpace;
58
59 enum GenerationType {
60 YoungGen,
61 OldGen
62 };
63
64 protected:
65 Generation* _young_gen;
66 Generation* _old_gen;
67
68 private:
69 GenerationSpec* _young_gen_spec;
70 GenerationSpec* _old_gen_spec;
71
72 // The singleton CardTable Remembered Set.
73 CardTableRS* _rem_set;
74
75 SoftRefGenPolicy _soft_ref_gen_policy;
76
77 // The sizing of the heap is controlled by a sizing policy.
78 AdaptiveSizePolicy* _size_policy;
79
80 GCPolicyCounters* _gc_policy_counters;
81
82 // Indicates that the most recent previous incremental collection failed.
83 // The flag is cleared when an action is taken that might clear the
84 // condition that caused that incremental collection to fail.
85 bool _incremental_collection_failed;
86
87 // In support of ExplicitGCInvokesConcurrent functionality
88 unsigned int _full_collections_completed;
89
90 // Collects the given generation.
91 void collect_generation(Generation* gen, bool full, size_t size, bool is_tlab,
92 bool run_verification, bool clear_soft_refs);
93
94 // Reserve aligned space for the heap as needed by the contained generations.
95 ReservedHeapSpace allocate(size_t alignment);
96
97 // Initialize ("weak") refs processing support
98 void ref_processing_init();
99
100 PreGenGCValues get_pre_gc_values() const;
101
102 protected:
103
104 GCMemoryManager* _young_manager;
105 GCMemoryManager* _old_manager;
106
107 // Helper functions for allocation
108 HeapWord* attempt_allocation(size_t size,
109 bool is_tlab,
110 bool first_only);
111
112 // Helper function for two callbacks below.
113 // Considers collection of the first max_level+1 generations.
114 void do_collection(bool full,
115 bool clear_all_soft_refs,
116 size_t size,
117 bool is_tlab,
118 GenerationType max_generation);
119
120 // Callback from VM_GenCollectForAllocation operation.
121 // This function does everything necessary/possible to satisfy an
122 // allocation request that failed in the youngest generation that should
123 // have handled it (including collection, expansion, etc.)
124 HeapWord* satisfy_failed_allocation(size_t size, bool is_tlab);
125
126 // Callback from VM_GenCollectFull operation.
127 // Perform a full collection of the first max_level+1 generations.
128 virtual void do_full_collection(bool clear_all_soft_refs);
129 void do_full_collection(bool clear_all_soft_refs, GenerationType max_generation);
130
131 // Does the "cause" of GC indicate that
132 // we absolutely __must__ clear soft refs?
133 bool must_clear_all_soft_refs();
134
135 GenCollectedHeap(Generation::Name young,
136 Generation::Name old,
137 const char* policy_counters_name);
138
139 public:
140
141 // Returns JNI_OK on success
142 virtual jint initialize();
143 virtual CardTableRS* create_rem_set(const MemRegion& reserved_region);
144
145 void initialize_size_policy(size_t init_eden_size,
146 size_t init_promo_size,
147 size_t init_survivor_size);
148
149 // Does operations required after initialization has been done.
150 void post_initialize();
151
152 Generation* young_gen() const { return _young_gen; }
153 Generation* old_gen() const { return _old_gen; }
154
155 bool is_young_gen(const Generation* gen) const { return gen == _young_gen; }
156 bool is_old_gen(const Generation* gen) const { return gen == _old_gen; }
157
158 MemRegion reserved_region() const { return _reserved; }
159 bool is_in_reserved(const void* addr) const { return _reserved.contains(addr); }
160
161 GenerationSpec* young_gen_spec() const;
162 GenerationSpec* old_gen_spec() const;
163
164 virtual SoftRefPolicy* soft_ref_policy() { return &_soft_ref_gen_policy; }
165
166 // Adaptive size policy
167 virtual AdaptiveSizePolicy* size_policy() {
168 return _size_policy;
169 }
170
171 // Performance Counter support
172 GCPolicyCounters* counters() { return _gc_policy_counters; }
173
174 size_t capacity() const;
175 size_t used() const;
176
177 // Save the "used_region" for both generations.
178 void save_used_regions();
179
180 size_t max_capacity() const;
181
182 HeapWord* mem_allocate(size_t size, bool* gc_overhead_limit_was_exceeded);
183
184 // We may support a shared contiguous allocation area, if the youngest
185 // generation does.
186 bool supports_inline_contig_alloc() const;
187 HeapWord* volatile* top_addr() const;
188 HeapWord** end_addr() const;
189
190 // Perform a full collection of the heap; intended for use in implementing
191 // "System.gc". This implies as full a collection as the CollectedHeap
192 // supports. Caller does not hold the Heap_lock on entry.
193 virtual void collect(GCCause::Cause cause);
194
195 // Perform a full collection of generations up to and including max_generation.
196 // Mostly used for testing purposes. Caller does not hold the Heap_lock on entry.
197 void collect(GCCause::Cause cause, GenerationType max_generation);
198
199 // Returns "TRUE" iff "p" points into the committed areas of the heap.
200 // The methods is_in() and is_in_youngest() may be expensive to compute
201 // in general, so, to prevent their inadvertent use in product jvm's, we
202 // restrict their use to assertion checking or verification only.
203 bool is_in(const void* p) const;
204
205 // Returns true if the reference is to an object in the reserved space
206 // for the young generation.
207 // Assumes the the young gen address range is less than that of the old gen.
208 bool is_in_young(oop p);
209
210 #ifdef ASSERT
211 bool is_in_partial_collection(const void* p);
212 #endif
213
214 // Optimized nmethod scanning support routines
215 virtual void register_nmethod(nmethod* nm);
216 virtual void unregister_nmethod(nmethod* nm);
217 virtual void verify_nmethod(nmethod* nm);
218 virtual void flush_nmethod(nmethod* nm);
219
220 void prune_scavengable_nmethods();
221
222 // Iteration functions.
223 void oop_iterate(OopIterateClosure* cl);
224 void object_iterate(ObjectClosure* cl);
225 Space* space_containing(const void* addr) const;
226
227 // A CollectedHeap is divided into a dense sequence of "blocks"; that is,
228 // each address in the (reserved) heap is a member of exactly
229 // one block. The defining characteristic of a block is that it is
230 // possible to find its size, and thus to progress forward to the next
231 // block. (Blocks may be of different sizes.) Thus, blocks may
232 // represent Java objects, or they might be free blocks in a
233 // free-list-based heap (or subheap), as long as the two kinds are
234 // distinguishable and the size of each is determinable.
235
236 // Returns the address of the start of the "block" that contains the
237 // address "addr". We say "blocks" instead of "object" since some heaps
238 // may not pack objects densely; a chunk may either be an object or a
239 // non-object.
240 HeapWord* block_start(const void* addr) const;
241
242 // Requires "addr" to be the start of a block, and returns "TRUE" iff
243 // the block is an object. Assumes (and verifies in non-product
244 // builds) that addr is in the allocated part of the heap and is
245 // the start of a chunk.
246 bool block_is_obj(const HeapWord* addr) const;
247
248 // Section on TLAB's.
249 virtual size_t tlab_capacity(Thread* thr) const;
250 virtual size_t tlab_used(Thread* thr) const;
251 virtual size_t unsafe_max_tlab_alloc(Thread* thr) const;
252 virtual HeapWord* allocate_new_tlab(size_t min_size,
253 size_t requested_size,
254 size_t* actual_size);
255
256 // The "requestor" generation is performing some garbage collection
257 // action for which it would be useful to have scratch space. The
258 // requestor promises to allocate no more than "max_alloc_words" in any
259 // older generation (via promotion say.) Any blocks of space that can
260 // be provided are returned as a list of ScratchBlocks, sorted by
261 // decreasing size.
262 ScratchBlock* gather_scratch(Generation* requestor, size_t max_alloc_words);
263 // Allow each generation to reset any scratch space that it has
264 // contributed as it needs.
265 void release_scratch();
266
267 // Ensure parsability: override
268 virtual void ensure_parsability(bool retire_tlabs);
269
270 // Total number of full collections completed.
271 unsigned int total_full_collections_completed() {
272 assert(_full_collections_completed <= _total_full_collections,
273 "Can't complete more collections than were started");
274 return _full_collections_completed;
275 }
276
277 // Update above counter, as appropriate, at the end of a stop-world GC cycle
278 unsigned int update_full_collections_completed();
279
280 // Update the gc statistics for each generation.
281 void update_gc_stats(Generation* current_generation, bool full) {
282 _old_gen->update_gc_stats(current_generation, full);
283 }
284
285 bool no_gc_in_progress() { return !is_gc_active(); }
286
287 // Override.
288 void prepare_for_verify();
289
290 // Override.
291 void verify(VerifyOption option);
292
293 // Override.
294 virtual void print_on(outputStream* st) const;
295 virtual void gc_threads_do(ThreadClosure* tc) const;
296 virtual void print_tracing_info() const;
297
298 // Used to print information about locations in the hs_err file.
299 virtual bool print_location(outputStream* st, void* addr) const;
300
301 void print_heap_change(const PreGenGCValues& pre_gc_values) const;
302
303 // The functions below are helper functions that a subclass of
304 // "CollectedHeap" can use in the implementation of its virtual
305 // functions.
306
307 class GenClosure : public StackObj {
308 public:
309 virtual void do_generation(Generation* gen) = 0;
310 };
311
312 // Apply "cl.do_generation" to all generations in the heap
313 // If "old_to_young" determines the order.
314 void generation_iterate(GenClosure* cl, bool old_to_young);
315
316 // Return "true" if all generations have reached the
317 // maximal committed limit that they can reach, without a garbage
318 // collection.
319 virtual bool is_maximal_no_gc() const;
320
321 // This function returns the CardTableRS object that allows us to scan
322 // generations in a fully generational heap.
323 CardTableRS* rem_set() { return _rem_set; }
324
325 // Convenience function to be used in situations where the heap type can be
326 // asserted to be this type.
327 static GenCollectedHeap* heap();
328
329 // The ScanningOption determines which of the roots
330 // the closure is applied to:
331 // "SO_None" does none;
332 enum ScanningOption {
333 SO_None = 0x0,
334 SO_AllCodeCache = 0x8,
335 SO_ScavengeCodeCache = 0x10
336 };
337
338 protected:
339 void process_roots(ScanningOption so,
340 OopClosure* strong_roots,
341 CLDClosure* strong_cld_closure,
342 CLDClosure* weak_cld_closure,
343 CodeBlobToOopClosure* code_roots);
344
345 virtual void gc_prologue(bool full);
346 virtual void gc_epilogue(bool full);
347
348 public:
349 void full_process_roots(bool is_adjust_phase,
350 ScanningOption so,
351 bool only_strong_roots,
352 OopClosure* root_closure,
353 CLDClosure* cld_closure);
354
355 // Apply "root_closure" to all the weak roots of the system.
356 // These include JNI weak roots, string table,
357 // and referents of reachable weak refs.
358 void gen_process_weak_roots(OopClosure* root_closure);
359
360 // Set the saved marks of generations, if that makes sense.
361 // In particular, if any generation might iterate over the oops
362 // in other generations, it should call this method.
363 void save_marks();
364
365 // Returns "true" iff no allocations have occurred since the last
366 // call to "save_marks".
367 bool no_allocs_since_save_marks();
368
369 // Returns true if an incremental collection is likely to fail.
370 // We optionally consult the young gen, if asked to do so;
371 // otherwise we base our answer on whether the previous incremental
372 // collection attempt failed with no corrective action as of yet.
373 bool incremental_collection_will_fail(bool consult_young) {
374 // The first disjunct remembers if an incremental collection failed, even
375 // when we thought (second disjunct) that it would not.
376 return incremental_collection_failed() ||
377 (consult_young && !_young_gen->collection_attempt_is_safe());
378 }
379
380 // If a generation bails out of an incremental collection,
381 // it sets this flag.
382 bool incremental_collection_failed() const {
383 return _incremental_collection_failed;
384 }
385 void set_incremental_collection_failed() {
386 _incremental_collection_failed = true;
387 }
388 void clear_incremental_collection_failed() {
389 _incremental_collection_failed = false;
390 }
391
392 // Promotion of obj into gen failed. Try to promote obj to higher
393 // gens in ascending order; return the new location of obj if successful.
394 // Otherwise, try expand-and-allocate for obj in both the young and old
395 // generation; return the new location of obj if successful. Otherwise, return NULL.
396 oop handle_failed_promotion(Generation* old_gen,
397 oop obj,
398 size_t obj_size);
399
400
401 private:
402 // Return true if an allocation should be attempted in the older generation
403 // if it fails in the younger generation. Return false, otherwise.
404 bool should_try_older_generation_allocation(size_t word_size) const;
405
406 // Try to allocate space by expanding the heap.
407 HeapWord* expand_heap_and_allocate(size_t size, bool is_tlab);
408
409 HeapWord* mem_allocate_work(size_t size,
410 bool is_tlab,
411 bool* gc_overhead_limit_was_exceeded);
412
413 #if INCLUDE_SERIALGC
414 // For use by mark-sweep. As implemented, mark-sweep-compact is global
415 // in an essential way: compaction is performed across generations, by
416 // iterating over spaces.
417 void prepare_for_compaction();
418 #endif
419
420 // Save the tops of the spaces in all generations
421 void record_gen_tops_before_GC() PRODUCT_RETURN;
422
423 // Return true if we need to perform full collection.
424 bool should_do_full_collection(size_t size, bool full,
425 bool is_tlab, GenerationType max_gen) const;
426 };
427
428 #endif // SHARE_GC_SHARED_GENCOLLECTEDHEAP_HPP