Mercurial > hg > graal-compiler
annotate src/share/vm/memory/genCollectedHeap.hpp @ 208:35ca13d63fe8
6688799: Second fix for Guarantee failure "Unexpected dirty card found"
Summary: Expand cardtable without committing over existing regions.
Reviewed-by: apetrusenko
author | jmasa |
---|---|
date | Tue, 10 Jun 2008 07:26:42 -0700 |
parents | 8bd1e4487c18 |
children | d1605aabd0a1 12eea04c8b06 37f87013dfd8 |
rev | line source |
---|---|
0 | 1 /* |
2 * Copyright 2000-2007 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 class SubTasksDone; | |
26 | |
27 // A "GenCollectedHeap" is a SharedHeap that uses generational | |
28 // collection. It is represented with a sequence of Generation's. | |
29 class GenCollectedHeap : public SharedHeap { | |
30 friend class GenCollectorPolicy; | |
31 friend class Generation; | |
32 friend class DefNewGeneration; | |
33 friend class TenuredGeneration; | |
34 friend class ConcurrentMarkSweepGeneration; | |
35 friend class CMSCollector; | |
36 friend class GenMarkSweep; | |
37 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
|
38 friend class VM_GenCollectForPermanentAllocation; |
0 | 39 friend class VM_GenCollectFull; |
40 friend class VM_GenCollectFullConcurrent; | |
41 friend class VM_GC_HeapInspection; | |
42 friend class VM_HeapDumper; | |
43 friend class HeapInspection; | |
44 friend class GCCauseSetter; | |
45 friend class VMStructs; | |
46 public: | |
47 enum SomeConstants { | |
48 max_gens = 10 | |
49 }; | |
50 | |
51 friend class VM_PopulateDumpSharedSpace; | |
52 | |
53 protected: | |
54 // Fields: | |
55 static GenCollectedHeap* _gch; | |
56 | |
57 private: | |
58 int _n_gens; | |
59 Generation* _gens[max_gens]; | |
60 GenerationSpec** _gen_specs; | |
61 | |
62 // The generational collector policy. | |
63 GenCollectorPolicy* _gen_policy; | |
64 | |
65 // If a generation would bail out of an incremental collection, | |
66 // it sets this flag. If the flag is set, satisfy_failed_allocation | |
67 // will attempt allocating in all generations before doing a full GC. | |
68 bool _incremental_collection_will_fail; | |
69 bool _last_incremental_collection_failed; | |
70 | |
71 // In support of ExplicitGCInvokesConcurrent functionality | |
72 unsigned int _full_collections_completed; | |
73 | |
74 // Data structure for claiming the (potentially) parallel tasks in | |
75 // (gen-specific) strong roots processing. | |
76 SubTasksDone* _gen_process_strong_tasks; | |
77 | |
78 // In block contents verification, the number of header words to skip | |
79 NOT_PRODUCT(static size_t _skip_header_HeapWords;) | |
80 | |
81 // GC is not allowed during the dump of the shared classes. Keep track | |
82 // of this in order to provide an reasonable error message when terminating. | |
83 bool _preloading_shared_classes; | |
84 | |
85 protected: | |
86 // Directs each generation up to and including "collectedGen" to recompute | |
87 // its desired size. | |
88 void compute_new_generation_sizes(int collectedGen); | |
89 | |
90 // Helper functions for allocation | |
91 HeapWord* attempt_allocation(size_t size, | |
92 bool is_tlab, | |
93 bool first_only); | |
94 | |
95 // Helper function for two callbacks below. | |
96 // Considers collection of the first max_level+1 generations. | |
97 void do_collection(bool full, | |
98 bool clear_all_soft_refs, | |
99 size_t size, | |
100 bool is_tlab, | |
101 int max_level); | |
102 | |
103 // Callback from VM_GenCollectForAllocation operation. | |
104 // This function does everything necessary/possible to satisfy an | |
105 // allocation request that failed in the youngest generation that should | |
106 // have handled it (including collection, expansion, etc.) | |
107 HeapWord* satisfy_failed_allocation(size_t size, bool is_tlab); | |
108 | |
109 // Callback from VM_GenCollectFull operation. | |
110 // Perform a full collection of the first max_level+1 generations. | |
111 void do_full_collection(bool clear_all_soft_refs, int max_level); | |
112 | |
113 // Does the "cause" of GC indicate that | |
114 // we absolutely __must__ clear soft refs? | |
115 bool must_clear_all_soft_refs(); | |
116 | |
117 public: | |
118 GenCollectedHeap(GenCollectorPolicy *policy); | |
119 | |
120 GCStats* gc_stats(int level) const; | |
121 | |
122 // Returns JNI_OK on success | |
123 virtual jint initialize(); | |
124 char* allocate(size_t alignment, PermanentGenerationSpec* perm_gen_spec, | |
125 size_t* _total_reserved, int* _n_covered_regions, | |
126 ReservedSpace* heap_rs); | |
127 | |
128 // Does operations required after initialization has been done. | |
129 void post_initialize(); | |
130 | |
131 // Initialize ("weak") refs processing support | |
132 virtual void ref_processing_init(); | |
133 | |
134 virtual CollectedHeap::Name kind() const { | |
135 return CollectedHeap::GenCollectedHeap; | |
136 } | |
137 | |
138 // The generational collector policy. | |
139 GenCollectorPolicy* gen_policy() const { return _gen_policy; } | |
140 | |
141 // Adaptive size policy | |
142 virtual AdaptiveSizePolicy* size_policy() { | |
143 return gen_policy()->size_policy(); | |
144 } | |
145 | |
146 size_t capacity() const; | |
147 size_t used() const; | |
148 | |
149 // Save the "used_region" for generations level and lower, | |
150 // and, if perm is true, for perm gen. | |
151 void save_used_regions(int level, bool perm); | |
152 | |
153 size_t max_capacity() const; | |
154 | |
155 HeapWord* mem_allocate(size_t size, | |
156 bool is_large_noref, | |
157 bool is_tlab, | |
158 bool* gc_overhead_limit_was_exceeded); | |
159 | |
160 // We may support a shared contiguous allocation area, if the youngest | |
161 // generation does. | |
162 bool supports_inline_contig_alloc() const; | |
163 HeapWord** top_addr() const; | |
164 HeapWord** end_addr() const; | |
165 | |
166 // Return an estimate of the maximum allocation that could be performed | |
167 // without triggering any collection activity. In a generational | |
168 // collector, for example, this is probably the largest allocation that | |
169 // could be supported in the youngest generation. It is "unsafe" because | |
170 // no locks are taken; the result should be treated as an approximation, | |
171 // not a guarantee. | |
172 size_t unsafe_max_alloc(); | |
173 | |
174 // Does this heap support heap inspection? (+PrintClassHistogram) | |
175 virtual bool supports_heap_inspection() const { return true; } | |
176 | |
177 // Perform a full collection of the heap; intended for use in implementing | |
178 // "System.gc". This implies as full a collection as the CollectedHeap | |
179 // supports. Caller does not hold the Heap_lock on entry. | |
180 void collect(GCCause::Cause cause); | |
181 | |
182 // This interface assumes that it's being called by the | |
183 // vm thread. It collects the heap assuming that the | |
184 // heap lock is already held and that we are executing in | |
185 // the context of the vm thread. | |
186 void collect_as_vm_thread(GCCause::Cause cause); | |
187 | |
188 // The same as above but assume that the caller holds the Heap_lock. | |
189 void collect_locked(GCCause::Cause cause); | |
190 | |
191 // Perform a full collection of the first max_level+1 generations. | |
192 // Mostly used for testing purposes. Caller does not hold the Heap_lock on entry. | |
193 void collect(GCCause::Cause cause, int max_level); | |
194 | |
195 // Returns "TRUE" iff "p" points into the allocated area of the heap. | |
196 // The methods is_in(), is_in_closed_subset() and is_in_youngest() may | |
197 // be expensive to compute in general, so, to prevent | |
198 // their inadvertent use in product jvm's, we restrict their use to | |
199 // assertion checking or verification only. | |
200 bool is_in(const void* p) const; | |
201 | |
202 // override | |
203 bool is_in_closed_subset(const void* p) const { | |
204 if (UseConcMarkSweepGC) { | |
205 return is_in_reserved(p); | |
206 } else { | |
207 return is_in(p); | |
208 } | |
209 } | |
210 | |
211 // Returns "TRUE" iff "p" points into the youngest generation. | |
212 bool is_in_youngest(void* p); | |
213 | |
214 // Iteration functions. | |
215 void oop_iterate(OopClosure* cl); | |
216 void oop_iterate(MemRegion mr, OopClosure* cl); | |
217 void object_iterate(ObjectClosure* cl); | |
218 void object_iterate_since_last_GC(ObjectClosure* cl); | |
219 Space* space_containing(const void* addr) const; | |
220 | |
221 // A CollectedHeap is divided into a dense sequence of "blocks"; that is, | |
222 // each address in the (reserved) heap is a member of exactly | |
223 // one block. The defining characteristic of a block is that it is | |
224 // possible to find its size, and thus to progress forward to the next | |
225 // block. (Blocks may be of different sizes.) Thus, blocks may | |
226 // represent Java objects, or they might be free blocks in a | |
227 // free-list-based heap (or subheap), as long as the two kinds are | |
228 // distinguishable and the size of each is determinable. | |
229 | |
230 // Returns the address of the start of the "block" that contains the | |
231 // address "addr". We say "blocks" instead of "object" since some heaps | |
232 // may not pack objects densely; a chunk may either be an object or a | |
233 // non-object. | |
234 virtual HeapWord* block_start(const void* addr) const; | |
235 | |
236 // Requires "addr" to be the start of a chunk, and returns its size. | |
237 // "addr + size" is required to be the start of a new chunk, or the end | |
238 // of the active area of the heap. Assumes (and verifies in non-product | |
239 // builds) that addr is in the allocated part of the heap and is | |
240 // the start of a chunk. | |
241 virtual size_t block_size(const HeapWord* addr) const; | |
242 | |
243 // Requires "addr" to be the start of a block, and returns "TRUE" iff | |
244 // the block is an object. Assumes (and verifies in non-product | |
245 // builds) that addr is in the allocated part of the heap and is | |
246 // the start of a chunk. | |
247 virtual bool block_is_obj(const HeapWord* addr) const; | |
248 | |
249 // Section on TLAB's. | |
250 virtual bool supports_tlab_allocation() const; | |
251 virtual size_t tlab_capacity(Thread* thr) const; | |
252 virtual size_t unsafe_max_tlab_alloc(Thread* thr) const; | |
253 virtual HeapWord* allocate_new_tlab(size_t size); | |
254 | |
255 // The "requestor" generation is performing some garbage collection | |
256 // action for which it would be useful to have scratch space. The | |
257 // requestor promises to allocate no more than "max_alloc_words" in any | |
258 // older generation (via promotion say.) Any blocks of space that can | |
259 // be provided are returned as a list of ScratchBlocks, sorted by | |
260 // decreasing size. | |
261 ScratchBlock* gather_scratch(Generation* requestor, size_t max_alloc_words); | |
262 | |
263 size_t large_typearray_limit(); | |
264 | |
265 // Ensure parsability: override | |
266 virtual void ensure_parsability(bool retire_tlabs); | |
267 | |
268 // Time in ms since the longest time a collector ran in | |
269 // in any generation. | |
270 virtual jlong millis_since_last_gc(); | |
271 | |
272 // Total number of full collections completed. | |
273 unsigned int total_full_collections_completed() { | |
274 assert(_full_collections_completed <= _total_full_collections, | |
275 "Can't complete more collections than were started"); | |
276 return _full_collections_completed; | |
277 } | |
278 | |
279 // Update above counter, as appropriate, at the end of a stop-world GC cycle | |
280 unsigned int update_full_collections_completed(); | |
281 // Update above counter, as appropriate, at the end of a concurrent GC cycle | |
282 unsigned int update_full_collections_completed(unsigned int count); | |
283 | |
284 // Update "time of last gc" for all constituent generations | |
285 // to "now". | |
286 void update_time_of_last_gc(jlong now) { | |
287 for (int i = 0; i < _n_gens; i++) { | |
288 _gens[i]->update_time_of_last_gc(now); | |
289 } | |
290 perm_gen()->update_time_of_last_gc(now); | |
291 } | |
292 | |
293 // Update the gc statistics for each generation. | |
294 // "level" is the level of the lastest collection | |
295 void update_gc_stats(int current_level, bool full) { | |
296 for (int i = 0; i < _n_gens; i++) { | |
297 _gens[i]->update_gc_stats(current_level, full); | |
298 } | |
299 perm_gen()->update_gc_stats(current_level, full); | |
300 } | |
301 | |
302 // Override. | |
303 bool no_gc_in_progress() { return !is_gc_active(); } | |
304 | |
305 // Override. | |
306 void prepare_for_verify(); | |
307 | |
308 // Override. | |
309 void verify(bool allow_dirty, bool silent); | |
310 | |
311 // Override. | |
312 void print() const; | |
313 void print_on(outputStream* st) const; | |
314 virtual void print_gc_threads_on(outputStream* st) const; | |
315 virtual void gc_threads_do(ThreadClosure* tc) const; | |
316 virtual void print_tracing_info() const; | |
317 | |
318 // PrintGC, PrintGCDetails support | |
319 void print_heap_change(size_t prev_used) const; | |
320 void print_perm_heap_change(size_t perm_prev_used) const; | |
321 | |
322 // The functions below are helper functions that a subclass of | |
323 // "CollectedHeap" can use in the implementation of its virtual | |
324 // functions. | |
325 | |
326 class GenClosure : public StackObj { | |
327 public: | |
328 virtual void do_generation(Generation* gen) = 0; | |
329 }; | |
330 | |
331 // Apply "cl.do_generation" to all generations in the heap (not including | |
332 // the permanent generation). If "old_to_young" determines the order. | |
333 void generation_iterate(GenClosure* cl, bool old_to_young); | |
334 | |
335 void space_iterate(SpaceClosure* cl); | |
336 | |
337 // Return "true" if all generations (but perm) have reached the | |
338 // maximal committed limit that they can reach, without a garbage | |
339 // collection. | |
340 virtual bool is_maximal_no_gc() const; | |
341 | |
342 // Return the generation before "gen", or else NULL. | |
343 Generation* prev_gen(Generation* gen) const { | |
344 int l = gen->level(); | |
345 if (l == 0) return NULL; | |
346 else return _gens[l-1]; | |
347 } | |
348 | |
349 // Return the generation after "gen", or else NULL. | |
350 Generation* next_gen(Generation* gen) const { | |
351 int l = gen->level() + 1; | |
352 if (l == _n_gens) return NULL; | |
353 else return _gens[l]; | |
354 } | |
355 | |
356 Generation* get_gen(int i) const { | |
357 if (i >= 0 && i < _n_gens) | |
358 return _gens[i]; | |
359 else | |
360 return NULL; | |
361 } | |
362 | |
363 int n_gens() const { | |
364 assert(_n_gens == gen_policy()->number_of_generations(), "Sanity"); | |
365 return _n_gens; | |
366 } | |
367 | |
368 // Convenience function to be used in situations where the heap type can be | |
369 // asserted to be this type. | |
370 static GenCollectedHeap* heap(); | |
371 | |
372 void set_par_threads(int t); | |
373 | |
374 | |
375 // Invoke the "do_oop" method of one of the closures "not_older_gens" | |
376 // or "older_gens" on root locations for the generation at | |
377 // "level". (The "older_gens" closure is used for scanning references | |
378 // from older generations; "not_older_gens" is used everywhere else.) | |
379 // If "younger_gens_as_roots" is false, younger generations are | |
380 // not scanned as roots; in this case, the caller must be arranging to | |
381 // scan the younger generations itself. (For example, a generation might | |
382 // explicitly mark reachable objects in younger generations, to avoid | |
383 // excess storage retention.) If "collecting_perm_gen" is false, then | |
384 // roots that may only contain references to permGen objects are not | |
385 // scanned. The "so" argument determines which of the roots | |
386 // the closure is applied to: | |
387 // "SO_None" does none; | |
388 // "SO_AllClasses" applies the closure to all entries in the SystemDictionary; | |
389 // "SO_SystemClasses" to all the "system" classes and loaders; | |
390 // "SO_Symbols_and_Strings" applies the closure to all entries in | |
391 // SymbolsTable and StringTable. | |
392 void gen_process_strong_roots(int level, bool younger_gens_as_roots, | |
393 bool collecting_perm_gen, | |
394 SharedHeap::ScanningOption so, | |
395 OopsInGenClosure* older_gens, | |
396 OopsInGenClosure* not_older_gens); | |
397 | |
398 // Apply "blk" to all the weak roots of the system. These include | |
399 // JNI weak roots, the code cache, system dictionary, symbol table, | |
400 // string table, and referents of reachable weak refs. | |
401 void gen_process_weak_roots(OopClosure* root_closure, | |
402 OopClosure* non_root_closure); | |
403 | |
404 // Set the saved marks of generations, if that makes sense. | |
405 // In particular, if any generation might iterate over the oops | |
406 // in other generations, it should call this method. | |
407 void save_marks(); | |
408 | |
409 // Apply "cur->do_oop" or "older->do_oop" to all the oops in objects | |
410 // allocated since the last call to save_marks in generations at or above | |
411 // "level" (including the permanent generation.) The "cur" closure is | |
412 // applied to references in the generation at "level", and the "older" | |
413 // closure to older (and permanent) generations. | |
414 #define GCH_SINCE_SAVE_MARKS_ITERATE_DECL(OopClosureType, nv_suffix) \ | |
415 void oop_since_save_marks_iterate(int level, \ | |
416 OopClosureType* cur, \ | |
417 OopClosureType* older); | |
418 | |
419 ALL_SINCE_SAVE_MARKS_CLOSURES(GCH_SINCE_SAVE_MARKS_ITERATE_DECL) | |
420 | |
421 #undef GCH_SINCE_SAVE_MARKS_ITERATE_DECL | |
422 | |
423 // Returns "true" iff no allocations have occurred in any generation at | |
424 // "level" or above (including the permanent generation) since the last | |
425 // call to "save_marks". | |
426 bool no_allocs_since_save_marks(int level); | |
427 | |
428 // If a generation bails out of an incremental collection, | |
429 // it sets this flag. | |
430 bool incremental_collection_will_fail() { | |
431 return _incremental_collection_will_fail; | |
432 } | |
433 void set_incremental_collection_will_fail() { | |
434 _incremental_collection_will_fail = true; | |
435 } | |
436 void clear_incremental_collection_will_fail() { | |
437 _incremental_collection_will_fail = false; | |
438 } | |
439 | |
440 bool last_incremental_collection_failed() const { | |
441 return _last_incremental_collection_failed; | |
442 } | |
443 void set_last_incremental_collection_failed() { | |
444 _last_incremental_collection_failed = true; | |
445 } | |
446 void clear_last_incremental_collection_failed() { | |
447 _last_incremental_collection_failed = false; | |
448 } | |
449 | |
450 // Promotion of obj into gen failed. Try to promote obj to higher non-perm | |
451 // gens in ascending order; return the new location of obj if successful. | |
452 // Otherwise, try expand-and-allocate for obj in each generation starting at | |
453 // gen; return the new location of obj if successful. Otherwise, return NULL. | |
454 oop handle_failed_promotion(Generation* gen, | |
455 oop obj, | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
456 size_t obj_size); |
0 | 457 |
458 private: | |
459 // Accessor for memory state verification support | |
460 NOT_PRODUCT( | |
461 static size_t skip_header_HeapWords() { return _skip_header_HeapWords; } | |
462 ) | |
463 | |
464 // Override | |
465 void check_for_non_bad_heap_word_value(HeapWord* addr, | |
466 size_t size) PRODUCT_RETURN; | |
467 | |
468 // For use by mark-sweep. As implemented, mark-sweep-compact is global | |
469 // in an essential way: compaction is performed across generations, by | |
470 // iterating over spaces. | |
471 void prepare_for_compaction(); | |
472 | |
473 // Perform a full collection of the first max_level+1 generations. | |
474 // This is the low level interface used by the public versions of | |
475 // collect() and collect_locked(). Caller holds the Heap_lock on entry. | |
476 void collect_locked(GCCause::Cause cause, int max_level); | |
477 | |
478 // Returns success or failure. | |
479 bool create_cms_collector(); | |
480 | |
481 // In support of ExplicitGCInvokesConcurrent functionality | |
482 bool should_do_concurrent_full_gc(GCCause::Cause cause); | |
483 void collect_mostly_concurrent(GCCause::Cause cause); | |
484 | |
485 protected: | |
486 virtual void gc_prologue(bool full); | |
487 virtual void gc_epilogue(bool full); | |
488 | |
489 public: | |
490 virtual void preload_and_dump(TRAPS) KERNEL_RETURN; | |
491 }; |