Mercurial > hg > graal-compiler
annotate src/share/vm/memory/genCollectedHeap.hpp @ 3905:c26de9aef2ed
7071307: MethodHandle bimorphic inlining should consider the frequency
Reviewed-by: twisti, roland, kvn, iveresov
author | never |
---|---|
date | Fri, 02 Sep 2011 20:58:21 -0700 |
parents | c9ca3f51cf41 |
children | 53074c2c4600 |
rev | line source |
---|---|
0 | 1 /* |
3774
c9ca3f51cf41
6994322: Remove the is_tlab and is_noref / is_large_noref parameters from the CollectedHeap
tonyp
parents:
3772
diff
changeset
|
2 * Copyright (c) 2000, 2011, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1166
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1166
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1166
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 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 | |
0 | 33 class SubTasksDone; |
34 | |
35 // A "GenCollectedHeap" is a SharedHeap that uses generational | |
36 // collection. It is represented with a sequence of Generation's. | |
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; | |
139
c0492d52d55b
6539517: CR 6186200 should be extended to perm gen allocation to prevent spurious OOM's from perm gen
apetrusenko
parents:
0
diff
changeset
|
46 friend class VM_GenCollectForPermanentAllocation; |
0 | 47 friend class VM_GenCollectFull; |
48 friend class VM_GenCollectFullConcurrent; | |
49 friend class VM_GC_HeapInspection; | |
50 friend class VM_HeapDumper; | |
51 friend class HeapInspection; | |
52 friend class GCCauseSetter; | |
53 friend class VMStructs; | |
54 public: | |
55 enum SomeConstants { | |
56 max_gens = 10 | |
57 }; | |
58 | |
59 friend class VM_PopulateDumpSharedSpace; | |
60 | |
61 protected: | |
62 // Fields: | |
63 static GenCollectedHeap* _gch; | |
64 | |
65 private: | |
66 int _n_gens; | |
67 Generation* _gens[max_gens]; | |
68 GenerationSpec** _gen_specs; | |
69 | |
70 // The generational collector policy. | |
71 GenCollectorPolicy* _gen_policy; | |
72 | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
73 // Indicates that the most recent previous incremental collection failed. |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
74 // The flag is cleared when an action is taken that might clear the |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
75 // condition that caused that incremental collection to fail. |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
76 bool _incremental_collection_failed; |
0 | 77 |
78 // In support of ExplicitGCInvokesConcurrent functionality | |
79 unsigned int _full_collections_completed; | |
80 | |
81 // Data structure for claiming the (potentially) parallel tasks in | |
82 // (gen-specific) strong roots processing. | |
83 SubTasksDone* _gen_process_strong_tasks; | |
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1552
diff
changeset
|
84 SubTasksDone* gen_process_strong_tasks() { return _gen_process_strong_tasks; } |
0 | 85 |
86 // In block contents verification, the number of header words to skip | |
87 NOT_PRODUCT(static size_t _skip_header_HeapWords;) | |
88 | |
89 // GC is not allowed during the dump of the shared classes. Keep track | |
90 // of this in order to provide an reasonable error message when terminating. | |
91 bool _preloading_shared_classes; | |
92 | |
93 protected: | |
94 // Directs each generation up to and including "collectedGen" to recompute | |
95 // its desired size. | |
96 void compute_new_generation_sizes(int collectedGen); | |
97 | |
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 void do_full_collection(bool clear_all_soft_refs, int max_level); | |
120 | |
121 // Does the "cause" of GC indicate that | |
122 // we absolutely __must__ clear soft refs? | |
123 bool must_clear_all_soft_refs(); | |
124 | |
125 public: | |
126 GenCollectedHeap(GenCollectorPolicy *policy); | |
127 | |
128 GCStats* gc_stats(int level) const; | |
129 | |
130 // Returns JNI_OK on success | |
131 virtual jint initialize(); | |
132 char* allocate(size_t alignment, PermanentGenerationSpec* perm_gen_spec, | |
133 size_t* _total_reserved, int* _n_covered_regions, | |
134 ReservedSpace* heap_rs); | |
135 | |
136 // Does operations required after initialization has been done. | |
137 void post_initialize(); | |
138 | |
139 // Initialize ("weak") refs processing support | |
140 virtual void ref_processing_init(); | |
141 | |
142 virtual CollectedHeap::Name kind() const { | |
143 return CollectedHeap::GenCollectedHeap; | |
144 } | |
145 | |
146 // The generational collector policy. | |
147 GenCollectorPolicy* gen_policy() const { return _gen_policy; } | |
148 | |
149 // Adaptive size policy | |
150 virtual AdaptiveSizePolicy* size_policy() { | |
151 return gen_policy()->size_policy(); | |
152 } | |
153 | |
154 size_t capacity() const; | |
155 size_t used() const; | |
156 | |
157 // Save the "used_region" for generations level and lower, | |
158 // and, if perm is true, for perm gen. | |
159 void save_used_regions(int level, bool perm); | |
160 | |
161 size_t max_capacity() const; | |
162 | |
163 HeapWord* mem_allocate(size_t size, | |
164 bool* gc_overhead_limit_was_exceeded); | |
165 | |
166 // We may support a shared contiguous allocation area, if the youngest | |
167 // generation does. | |
168 bool supports_inline_contig_alloc() const; | |
169 HeapWord** top_addr() const; | |
170 HeapWord** end_addr() const; | |
171 | |
172 // Return an estimate of the maximum allocation that could be performed | |
173 // without triggering any collection activity. In a generational | |
174 // collector, for example, this is probably the largest allocation that | |
175 // could be supported in the youngest generation. It is "unsafe" because | |
176 // no locks are taken; the result should be treated as an approximation, | |
177 // not a guarantee. | |
178 size_t unsafe_max_alloc(); | |
179 | |
180 // Does this heap support heap inspection? (+PrintClassHistogram) | |
181 virtual bool supports_heap_inspection() const { return true; } | |
182 | |
183 // Perform a full collection of the heap; intended for use in implementing | |
184 // "System.gc". This implies as full a collection as the CollectedHeap | |
185 // supports. Caller does not hold the Heap_lock on entry. | |
186 void collect(GCCause::Cause cause); | |
187 | |
188 // This interface assumes that it's being called by the | |
189 // vm thread. It collects the heap assuming that the | |
190 // heap lock is already held and that we are executing in | |
191 // the context of the vm thread. | |
192 void collect_as_vm_thread(GCCause::Cause cause); | |
193 | |
194 // The same as above but assume that the caller holds the Heap_lock. | |
195 void collect_locked(GCCause::Cause cause); | |
196 | |
197 // Perform a full collection of the first max_level+1 generations. | |
198 // Mostly used for testing purposes. Caller does not hold the Heap_lock on entry. | |
199 void collect(GCCause::Cause cause, int max_level); | |
200 | |
201 // Returns "TRUE" iff "p" points into the allocated area of the heap. | |
202 // The methods is_in(), is_in_closed_subset() and is_in_youngest() may | |
203 // be expensive to compute in general, so, to prevent | |
204 // their inadvertent use in product jvm's, we restrict their use to | |
205 // assertion checking or verification only. | |
206 bool is_in(const void* p) const; | |
207 | |
208 // override | |
209 bool is_in_closed_subset(const void* p) const { | |
210 if (UseConcMarkSweepGC) { | |
211 return is_in_reserved(p); | |
212 } else { | |
213 return is_in(p); | |
214 } | |
215 } | |
216 | |
3377
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
217 // Returns true if the reference is to an object in the reserved space |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
218 // for the young generation. |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
219 // Assumes the the young gen address range is less than that of the old gen. |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
220 bool is_in_young(oop p); |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
221 |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
222 #ifdef ASSERT |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
223 virtual bool is_in_partial_collection(const void* p); |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
224 #endif |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
225 |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
226 virtual bool is_scavengable(const void* addr) { |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
227 return is_in_young((oop)addr); |
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
228 } |
0 | 229 |
230 // Iteration functions. | |
231 void oop_iterate(OopClosure* cl); | |
232 void oop_iterate(MemRegion mr, OopClosure* cl); | |
233 void object_iterate(ObjectClosure* cl); | |
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
234 void safe_object_iterate(ObjectClosure* cl); |
0 | 235 void object_iterate_since_last_GC(ObjectClosure* cl); |
236 Space* space_containing(const void* addr) const; | |
237 | |
238 // A CollectedHeap is divided into a dense sequence of "blocks"; that is, | |
239 // each address in the (reserved) heap is a member of exactly | |
240 // one block. The defining characteristic of a block is that it is | |
241 // possible to find its size, and thus to progress forward to the next | |
242 // block. (Blocks may be of different sizes.) Thus, blocks may | |
243 // represent Java objects, or they might be free blocks in a | |
244 // free-list-based heap (or subheap), as long as the two kinds are | |
245 // distinguishable and the size of each is determinable. | |
246 | |
247 // Returns the address of the start of the "block" that contains the | |
248 // address "addr". We say "blocks" instead of "object" since some heaps | |
249 // may not pack objects densely; a chunk may either be an object or a | |
250 // non-object. | |
251 virtual HeapWord* block_start(const void* addr) const; | |
252 | |
253 // Requires "addr" to be the start of a chunk, and returns its size. | |
254 // "addr + size" is required to be the start of a new chunk, or the end | |
255 // of the active area of the heap. 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 size_t block_size(const HeapWord* addr) const; | |
259 | |
260 // Requires "addr" to be the start of a block, and returns "TRUE" iff | |
261 // the block is an object. Assumes (and verifies in non-product | |
262 // builds) that addr is in the allocated part of the heap and is | |
263 // the start of a chunk. | |
264 virtual bool block_is_obj(const HeapWord* addr) const; | |
265 | |
266 // Section on TLAB's. | |
267 virtual bool supports_tlab_allocation() const; | |
268 virtual size_t tlab_capacity(Thread* thr) const; | |
269 virtual size_t unsafe_max_tlab_alloc(Thread* thr) const; | |
270 virtual HeapWord* allocate_new_tlab(size_t size); | |
271 | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
272 // Can a compiler initialize a new object without store barriers? |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
273 // This permission only extends from the creation of a new object |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
274 // via a TLAB up to the first subsequent safepoint. |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
275 virtual bool can_elide_tlab_store_barriers() const { |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
276 return true; |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
277 } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
278 |
1166 | 279 virtual bool card_mark_must_follow_store() const { |
280 return UseConcMarkSweepGC; | |
281 } | |
282 | |
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
283 // We don't need barriers for stores to objects in the |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
284 // young gen and, a fortiori, for initializing stores to |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
285 // objects therein. This applies to {DefNew,ParNew}+{Tenured,CMS} |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
286 // only and may need to be re-examined in case other |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
287 // kinds of collectors are implemented in the future. |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
288 virtual bool can_elide_initializing_store_barrier(oop new_obj) { |
1028
052a899eec3e
6892749: assert(UseParNewGC || UseSerialGC || UseConcMarkSweepGC, "...") fails
ysr
parents:
1027
diff
changeset
|
289 // We wanted to assert that:- |
052a899eec3e
6892749: assert(UseParNewGC || UseSerialGC || UseConcMarkSweepGC, "...") fails
ysr
parents:
1027
diff
changeset
|
290 // assert(UseParNewGC || UseSerialGC || UseConcMarkSweepGC, |
052a899eec3e
6892749: assert(UseParNewGC || UseSerialGC || UseConcMarkSweepGC, "...") fails
ysr
parents:
1027
diff
changeset
|
291 // "Check can_elide_initializing_store_barrier() for this collector"); |
052a899eec3e
6892749: assert(UseParNewGC || UseSerialGC || UseConcMarkSweepGC, "...") fails
ysr
parents:
1027
diff
changeset
|
292 // but unfortunately the flag UseSerialGC need not necessarily always |
052a899eec3e
6892749: assert(UseParNewGC || UseSerialGC || UseConcMarkSweepGC, "...") fails
ysr
parents:
1027
diff
changeset
|
293 // be set when DefNew+Tenured are being used. |
3377
2aa9ddbb9e60
7041789: 30% perf regression with c2/arm following 7017732
jmasa
parents:
3293
diff
changeset
|
294 return is_in_young(new_obj); |
1027
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
295 } |
39b01ab7035a
6888898: CMS: ReduceInitialCardMarks unsafe in the presence of cms precleaning
ysr
parents:
989
diff
changeset
|
296 |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
297 // Can a compiler elide a store barrier when it writes |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
298 // a permanent oop into the heap? Applies when the compiler |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
299 // is storing x to the heap, where x->is_perm() is true. |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
300 virtual bool can_elide_permanent_oop_store_barriers() const { |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
301 // CMS needs to see all, even intra-generational, ref updates. |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
302 return !UseConcMarkSweepGC; |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
303 } |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
142
diff
changeset
|
304 |
0 | 305 // The "requestor" generation is performing some garbage collection |
306 // action for which it would be useful to have scratch space. The | |
307 // requestor promises to allocate no more than "max_alloc_words" in any | |
308 // older generation (via promotion say.) Any blocks of space that can | |
309 // be provided are returned as a list of ScratchBlocks, sorted by | |
310 // decreasing size. | |
311 ScratchBlock* gather_scratch(Generation* requestor, size_t max_alloc_words); | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
142
diff
changeset
|
312 // Allow each generation to reset any scratch space that it has |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
142
diff
changeset
|
313 // contributed as it needs. |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
142
diff
changeset
|
314 void release_scratch(); |
0 | 315 |
316 // Ensure parsability: override | |
317 virtual void ensure_parsability(bool retire_tlabs); | |
318 | |
319 // Time in ms since the longest time a collector ran in | |
320 // in any generation. | |
321 virtual jlong millis_since_last_gc(); | |
322 | |
323 // Total number of full collections completed. | |
324 unsigned int total_full_collections_completed() { | |
325 assert(_full_collections_completed <= _total_full_collections, | |
326 "Can't complete more collections than were started"); | |
327 return _full_collections_completed; | |
328 } | |
329 | |
330 // Update above counter, as appropriate, at the end of a stop-world GC cycle | |
331 unsigned int update_full_collections_completed(); | |
332 // Update above counter, as appropriate, at the end of a concurrent GC cycle | |
333 unsigned int update_full_collections_completed(unsigned int count); | |
334 | |
335 // Update "time of last gc" for all constituent generations | |
336 // to "now". | |
337 void update_time_of_last_gc(jlong now) { | |
338 for (int i = 0; i < _n_gens; i++) { | |
339 _gens[i]->update_time_of_last_gc(now); | |
340 } | |
341 perm_gen()->update_time_of_last_gc(now); | |
342 } | |
343 | |
344 // Update the gc statistics for each generation. | |
345 // "level" is the level of the lastest collection | |
346 void update_gc_stats(int current_level, bool full) { | |
347 for (int i = 0; i < _n_gens; i++) { | |
348 _gens[i]->update_gc_stats(current_level, full); | |
349 } | |
350 perm_gen()->update_gc_stats(current_level, full); | |
351 } | |
352 | |
353 // Override. | |
354 bool no_gc_in_progress() { return !is_gc_active(); } | |
355 | |
356 // Override. | |
357 void prepare_for_verify(); | |
358 | |
359 // Override. | |
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3377
diff
changeset
|
360 void verify(bool allow_dirty, bool silent, VerifyOption option); |
0 | 361 |
362 // Override. | |
363 void print() const; | |
364 void print_on(outputStream* st) const; | |
365 virtual void print_gc_threads_on(outputStream* st) const; | |
366 virtual void gc_threads_do(ThreadClosure* tc) const; | |
367 virtual void print_tracing_info() const; | |
368 | |
369 // PrintGC, PrintGCDetails support | |
370 void print_heap_change(size_t prev_used) const; | |
371 void print_perm_heap_change(size_t perm_prev_used) const; | |
372 | |
373 // The functions below are helper functions that a subclass of | |
374 // "CollectedHeap" can use in the implementation of its virtual | |
375 // functions. | |
376 | |
377 class GenClosure : public StackObj { | |
378 public: | |
379 virtual void do_generation(Generation* gen) = 0; | |
380 }; | |
381 | |
382 // Apply "cl.do_generation" to all generations in the heap (not including | |
383 // the permanent generation). If "old_to_young" determines the order. | |
384 void generation_iterate(GenClosure* cl, bool old_to_young); | |
385 | |
386 void space_iterate(SpaceClosure* cl); | |
387 | |
388 // Return "true" if all generations (but perm) have reached the | |
389 // maximal committed limit that they can reach, without a garbage | |
390 // collection. | |
391 virtual bool is_maximal_no_gc() const; | |
392 | |
393 // Return the generation before "gen", or else NULL. | |
394 Generation* prev_gen(Generation* gen) const { | |
395 int l = gen->level(); | |
396 if (l == 0) return NULL; | |
397 else return _gens[l-1]; | |
398 } | |
399 | |
400 // Return the generation after "gen", or else NULL. | |
401 Generation* next_gen(Generation* gen) const { | |
402 int l = gen->level() + 1; | |
403 if (l == _n_gens) return NULL; | |
404 else return _gens[l]; | |
405 } | |
406 | |
407 Generation* get_gen(int i) const { | |
408 if (i >= 0 && i < _n_gens) | |
409 return _gens[i]; | |
410 else | |
411 return NULL; | |
412 } | |
413 | |
414 int n_gens() const { | |
415 assert(_n_gens == gen_policy()->number_of_generations(), "Sanity"); | |
416 return _n_gens; | |
417 } | |
418 | |
419 // Convenience function to be used in situations where the heap type can be | |
420 // asserted to be this type. | |
421 static GenCollectedHeap* heap(); | |
422 | |
423 void set_par_threads(int t); | |
424 | |
425 | |
426 // Invoke the "do_oop" method of one of the closures "not_older_gens" | |
427 // or "older_gens" on root locations for the generation at | |
428 // "level". (The "older_gens" closure is used for scanning references | |
429 // from older generations; "not_older_gens" is used everywhere else.) | |
430 // If "younger_gens_as_roots" is false, younger generations are | |
431 // not scanned as roots; in this case, the caller must be arranging to | |
432 // scan the younger generations itself. (For example, a generation might | |
433 // explicitly mark reachable objects in younger generations, to avoid | |
434 // excess storage retention.) If "collecting_perm_gen" is false, then | |
435 // roots that may only contain references to permGen objects are not | |
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
1994
diff
changeset
|
436 // scanned; instead, the older_gens closure is applied to all outgoing |
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
1994
diff
changeset
|
437 // references in the perm gen. The "so" argument determines which of the roots |
0 | 438 // the closure is applied to: |
439 // "SO_None" does none; | |
440 // "SO_AllClasses" applies the closure to all entries in the SystemDictionary; | |
441 // "SO_SystemClasses" to all the "system" classes and loaders; | |
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
1994
diff
changeset
|
442 // "SO_Strings" applies the closure to all entries in the StringTable. |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
443 void gen_process_strong_roots(int level, |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
444 bool younger_gens_as_roots, |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
445 // The remaining arguments are in an order |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
446 // consistent with SharedHeap::process_strong_roots: |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
447 bool activate_scope, |
0 | 448 bool collecting_perm_gen, |
449 SharedHeap::ScanningOption so, | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
450 OopsInGenClosure* not_older_gens, |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
451 bool do_code_roots, |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
452 OopsInGenClosure* older_gens); |
0 | 453 |
454 // Apply "blk" to all the weak roots of the system. These include | |
455 // JNI weak roots, the code cache, system dictionary, symbol table, | |
456 // string table, and referents of reachable weak refs. | |
457 void gen_process_weak_roots(OopClosure* root_closure, | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
458 CodeBlobClosure* code_roots, |
0 | 459 OopClosure* non_root_closure); |
460 | |
461 // Set the saved marks of generations, if that makes sense. | |
462 // In particular, if any generation might iterate over the oops | |
463 // in other generations, it should call this method. | |
464 void save_marks(); | |
465 | |
466 // Apply "cur->do_oop" or "older->do_oop" to all the oops in objects | |
467 // allocated since the last call to save_marks in generations at or above | |
468 // "level" (including the permanent generation.) The "cur" closure is | |
469 // applied to references in the generation at "level", and the "older" | |
470 // closure to older (and permanent) generations. | |
471 #define GCH_SINCE_SAVE_MARKS_ITERATE_DECL(OopClosureType, nv_suffix) \ | |
472 void oop_since_save_marks_iterate(int level, \ | |
473 OopClosureType* cur, \ | |
474 OopClosureType* older); | |
475 | |
476 ALL_SINCE_SAVE_MARKS_CLOSURES(GCH_SINCE_SAVE_MARKS_ITERATE_DECL) | |
477 | |
478 #undef GCH_SINCE_SAVE_MARKS_ITERATE_DECL | |
479 | |
480 // Returns "true" iff no allocations have occurred in any generation at | |
481 // "level" or above (including the permanent generation) since the last | |
482 // call to "save_marks". | |
483 bool no_allocs_since_save_marks(int level); | |
484 | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
485 // Returns true if an incremental collection is likely to fail. |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
486 // We optionally consult the young gen, if asked to do so; |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
487 // otherwise we base our answer on whether the previous incremental |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
488 // collection attempt failed with no corrective action as of yet. |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
489 bool incremental_collection_will_fail(bool consult_young) { |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
490 // Assumes a 2-generation system; the first disjunct remembers if an |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
491 // incremental collection failed, even when we thought (second disjunct) |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
492 // that it would not. |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
493 assert(heap()->collector_policy()->is_two_generation_policy(), |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
494 "the following definition may not be suitable for an n(>2)-generation system"); |
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
495 return incremental_collection_failed() || |
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
496 (consult_young && !get_gen(0)->collection_attempt_is_safe()); |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
497 } |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
498 |
0 | 499 // If a generation bails out of an incremental collection, |
500 // it sets this flag. | |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
501 bool incremental_collection_failed() const { |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
502 return _incremental_collection_failed; |
0 | 503 } |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
504 void set_incremental_collection_failed() { |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
505 _incremental_collection_failed = true; |
0 | 506 } |
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
507 void clear_incremental_collection_failed() { |
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1833
diff
changeset
|
508 _incremental_collection_failed = false; |
0 | 509 } |
510 | |
511 // Promotion of obj into gen failed. Try to promote obj to higher non-perm | |
512 // gens in ascending order; return the new location of obj if successful. | |
513 // Otherwise, try expand-and-allocate for obj in each generation starting at | |
514 // gen; return the new location of obj if successful. Otherwise, return NULL. | |
515 oop handle_failed_promotion(Generation* gen, | |
516 oop obj, | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
517 size_t obj_size); |
0 | 518 |
519 private: | |
520 // Accessor for memory state verification support | |
521 NOT_PRODUCT( | |
522 static size_t skip_header_HeapWords() { return _skip_header_HeapWords; } | |
523 ) | |
524 | |
525 // Override | |
526 void check_for_non_bad_heap_word_value(HeapWord* addr, | |
527 size_t size) PRODUCT_RETURN; | |
528 | |
529 // For use by mark-sweep. As implemented, mark-sweep-compact is global | |
530 // in an essential way: compaction is performed across generations, by | |
531 // iterating over spaces. | |
532 void prepare_for_compaction(); | |
533 | |
534 // Perform a full collection of the first max_level+1 generations. | |
535 // This is the low level interface used by the public versions of | |
536 // collect() and collect_locked(). Caller holds the Heap_lock on entry. | |
537 void collect_locked(GCCause::Cause cause, int max_level); | |
538 | |
539 // Returns success or failure. | |
540 bool create_cms_collector(); | |
541 | |
542 // In support of ExplicitGCInvokesConcurrent functionality | |
543 bool should_do_concurrent_full_gc(GCCause::Cause cause); | |
544 void collect_mostly_concurrent(GCCause::Cause cause); | |
545 | |
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
142
diff
changeset
|
546 // Save the tops of the spaces in all generations |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
142
diff
changeset
|
547 void record_gen_tops_before_GC() PRODUCT_RETURN; |
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
142
diff
changeset
|
548 |
0 | 549 protected: |
550 virtual void gc_prologue(bool full); | |
551 virtual void gc_epilogue(bool full); | |
552 | |
553 public: | |
554 virtual void preload_and_dump(TRAPS) KERNEL_RETURN; | |
555 }; | |
1972 | 556 |
557 #endif // SHARE_VM_MEMORY_GENCOLLECTEDHEAP_HPP |