Mercurial > hg > truffle
annotate src/share/vm/gc_interface/collectedHeap.hpp @ 989:148e5441d916
6863023: need non-perm oops in code cache for JSR 292
Summary: Make a special root-list for those few nmethods which might contain non-perm oops.
Reviewed-by: twisti, kvn, never, jmasa, ysr
author | jrose |
---|---|
date | Tue, 15 Sep 2009 21:53:47 -0700 |
parents | df6caf649ff7 |
children | 54b3b351d6f9 |
rev | line source |
---|---|
0 | 1 /* |
579 | 2 * Copyright 2001-2009 Sun Microsystems, Inc. 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 * | |
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 // A "CollectedHeap" is an implementation of a java heap for HotSpot. This | |
26 // is an abstract class: there may be many different kinds of heaps. This | |
27 // class defines the functions that a heap must implement, and contains | |
28 // infrastructure common to all heaps. | |
29 | |
30 class BarrierSet; | |
31 class ThreadClosure; | |
32 class AdaptiveSizePolicy; | |
33 class Thread; | |
34 | |
35 // | |
36 // CollectedHeap | |
37 // SharedHeap | |
38 // GenCollectedHeap | |
39 // G1CollectedHeap | |
40 // ParallelScavengeHeap | |
41 // | |
42 class CollectedHeap : public CHeapObj { | |
43 friend class VMStructs; | |
44 friend class IsGCActiveMark; // Block structured external access to _is_gc_active | |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
517
diff
changeset
|
45 friend class constantPoolCacheKlass; // allocate() method inserts is_conc_safe |
0 | 46 |
47 #ifdef ASSERT | |
48 static int _fire_out_of_memory_count; | |
49 #endif | |
50 | |
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
51 // Used for filler objects (static, but initialized in ctor). |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
52 static size_t _filler_array_max_size; |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
53 |
0 | 54 protected: |
55 MemRegion _reserved; | |
56 BarrierSet* _barrier_set; | |
57 bool _is_gc_active; | |
58 unsigned int _total_collections; // ... started | |
59 unsigned int _total_full_collections; // ... started | |
60 NOT_PRODUCT(volatile size_t _promotion_failure_alot_count;) | |
61 NOT_PRODUCT(volatile size_t _promotion_failure_alot_gc_number;) | |
62 | |
63 // Reason for current garbage collection. Should be set to | |
64 // a value reflecting no collection between collections. | |
65 GCCause::Cause _gc_cause; | |
66 GCCause::Cause _gc_lastcause; | |
67 PerfStringVariable* _perf_gc_cause; | |
68 PerfStringVariable* _perf_gc_lastcause; | |
69 | |
70 // Constructor | |
71 CollectedHeap(); | |
72 | |
73 // Create a new tlab | |
74 virtual HeapWord* allocate_new_tlab(size_t size); | |
75 | |
76 // Fix up tlabs to make the heap well-formed again, | |
77 // optionally retiring the tlabs. | |
78 virtual void fill_all_tlabs(bool retire); | |
79 | |
80 // Accumulate statistics on all tlabs. | |
81 virtual void accumulate_statistics_all_tlabs(); | |
82 | |
83 // Reinitialize tlabs before resuming mutators. | |
84 virtual void resize_all_tlabs(); | |
85 | |
86 protected: | |
87 // Allocate from the current thread's TLAB, with broken-out slow path. | |
88 inline static HeapWord* allocate_from_tlab(Thread* thread, size_t size); | |
89 static HeapWord* allocate_from_tlab_slow(Thread* thread, size_t size); | |
90 | |
91 // Allocate an uninitialized block of the given size, or returns NULL if | |
92 // this is impossible. | |
93 inline static HeapWord* common_mem_allocate_noinit(size_t size, bool is_noref, TRAPS); | |
94 | |
95 // Like allocate_init, but the block returned by a successful allocation | |
96 // is guaranteed initialized to zeros. | |
97 inline static HeapWord* common_mem_allocate_init(size_t size, bool is_noref, TRAPS); | |
98 | |
99 // Same as common_mem version, except memory is allocated in the permanent area | |
100 // If there is no permanent area, revert to common_mem_allocate_noinit | |
101 inline static HeapWord* common_permanent_mem_allocate_noinit(size_t size, TRAPS); | |
102 | |
103 // Same as common_mem version, except memory is allocated in the permanent area | |
104 // If there is no permanent area, revert to common_mem_allocate_init | |
105 inline static HeapWord* common_permanent_mem_allocate_init(size_t size, TRAPS); | |
106 | |
107 // Helper functions for (VM) allocation. | |
108 inline static void post_allocation_setup_common(KlassHandle klass, | |
109 HeapWord* obj, size_t size); | |
110 inline static void post_allocation_setup_no_klass_install(KlassHandle klass, | |
111 HeapWord* objPtr, | |
112 size_t size); | |
113 | |
114 inline static void post_allocation_setup_obj(KlassHandle klass, | |
115 HeapWord* obj, size_t size); | |
116 | |
117 inline static void post_allocation_setup_array(KlassHandle klass, | |
118 HeapWord* obj, size_t size, | |
119 int length); | |
120 | |
121 // Clears an allocated object. | |
122 inline static void init_obj(HeapWord* obj, size_t size); | |
123 | |
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
124 // Filler object utilities. |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
125 static inline size_t filler_array_hdr_size(); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
126 static inline size_t filler_array_min_size(); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
127 static inline size_t filler_array_max_size(); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
128 |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
129 DEBUG_ONLY(static void fill_args_check(HeapWord* start, size_t words);) |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
130 DEBUG_ONLY(static void zap_filler_array(HeapWord* start, size_t words);) |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
131 |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
132 // Fill with a single array; caller must ensure filler_array_min_size() <= |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
133 // words <= filler_array_max_size(). |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
134 static inline void fill_with_array(HeapWord* start, size_t words); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
135 |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
136 // Fill with a single object (either an int array or a java.lang.Object). |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
137 static inline void fill_with_object_impl(HeapWord* start, size_t words); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
138 |
0 | 139 // Verification functions |
140 virtual void check_for_bad_heap_word_value(HeapWord* addr, size_t size) | |
141 PRODUCT_RETURN; | |
142 virtual void check_for_non_bad_heap_word_value(HeapWord* addr, size_t size) | |
143 PRODUCT_RETURN; | |
542
9a25e0c45327
6792421: assert(_bitMap->isMarked(addr+size-1),inconsistent Printezis mark)
jmasa
parents:
517
diff
changeset
|
144 debug_only(static void check_for_valid_allocation_state();) |
0 | 145 |
146 public: | |
147 enum Name { | |
148 Abstract, | |
149 SharedHeap, | |
150 GenCollectedHeap, | |
151 ParallelScavengeHeap, | |
152 G1CollectedHeap | |
153 }; | |
154 | |
155 virtual CollectedHeap::Name kind() const { return CollectedHeap::Abstract; } | |
156 | |
157 /** | |
158 * Returns JNI error code JNI_ENOMEM if memory could not be allocated, | |
159 * and JNI_OK on success. | |
160 */ | |
161 virtual jint initialize() = 0; | |
162 | |
163 // In many heaps, there will be a need to perform some initialization activities | |
164 // after the Universe is fully formed, but before general heap allocation is allowed. | |
165 // This is the correct place to place such initialization methods. | |
166 virtual void post_initialize() = 0; | |
167 | |
168 MemRegion reserved_region() const { return _reserved; } | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
169 address base() const { return (address)reserved_region().start(); } |
0 | 170 |
171 // Future cleanup here. The following functions should specify bytes or | |
172 // heapwords as part of their signature. | |
173 virtual size_t capacity() const = 0; | |
174 virtual size_t used() const = 0; | |
175 | |
176 // Return "true" if the part of the heap that allocates Java | |
177 // objects has reached the maximal committed limit that it can | |
178 // reach, without a garbage collection. | |
179 virtual bool is_maximal_no_gc() const = 0; | |
180 | |
181 virtual size_t permanent_capacity() const = 0; | |
182 virtual size_t permanent_used() const = 0; | |
183 | |
184 // Support for java.lang.Runtime.maxMemory(): return the maximum amount of | |
185 // memory that the vm could make available for storing 'normal' java objects. | |
186 // This is based on the reserved address space, but should not include space | |
187 // that the vm uses internally for bookkeeping or temporary storage (e.g., | |
188 // perm gen space or, in the case of the young gen, one of the survivor | |
189 // spaces). | |
190 virtual size_t max_capacity() const = 0; | |
191 | |
192 // Returns "TRUE" if "p" points into the reserved area of the heap. | |
193 bool is_in_reserved(const void* p) const { | |
194 return _reserved.contains(p); | |
195 } | |
196 | |
197 bool is_in_reserved_or_null(const void* p) const { | |
198 return p == NULL || is_in_reserved(p); | |
199 } | |
200 | |
201 // Returns "TRUE" if "p" points to the head of an allocated object in the | |
202 // heap. Since this method can be expensive in general, we restrict its | |
203 // use to assertion checking only. | |
204 virtual bool is_in(const void* p) const = 0; | |
205 | |
206 bool is_in_or_null(const void* p) const { | |
207 return p == NULL || is_in(p); | |
208 } | |
209 | |
210 // Let's define some terms: a "closed" subset of a heap is one that | |
211 // | |
212 // 1) contains all currently-allocated objects, and | |
213 // | |
214 // 2) is closed under reference: no object in the closed subset | |
215 // references one outside the closed subset. | |
216 // | |
217 // Membership in a heap's closed subset is useful for assertions. | |
218 // Clearly, the entire heap is a closed subset, so the default | |
219 // implementation is to use "is_in_reserved". But this may not be too | |
220 // liberal to perform useful checking. Also, the "is_in" predicate | |
221 // defines a closed subset, but may be too expensive, since "is_in" | |
222 // verifies that its argument points to an object head. The | |
223 // "closed_subset" method allows a heap to define an intermediate | |
224 // predicate, allowing more precise checking than "is_in_reserved" at | |
225 // lower cost than "is_in." | |
226 | |
227 // One important case is a heap composed of disjoint contiguous spaces, | |
228 // such as the Garbage-First collector. Such heaps have a convenient | |
229 // closed subset consisting of the allocated portions of those | |
230 // contiguous spaces. | |
231 | |
232 // Return "TRUE" iff the given pointer points into the heap's defined | |
233 // closed subset (which defaults to the entire heap). | |
234 virtual bool is_in_closed_subset(const void* p) const { | |
235 return is_in_reserved(p); | |
236 } | |
237 | |
238 bool is_in_closed_subset_or_null(const void* p) const { | |
239 return p == NULL || is_in_closed_subset(p); | |
240 } | |
241 | |
242 // Returns "TRUE" if "p" is allocated as "permanent" data. | |
243 // If the heap does not use "permanent" data, returns the same | |
244 // value is_in_reserved() would return. | |
245 // NOTE: this actually returns true if "p" is in reserved space | |
246 // for the space not that it is actually allocated (i.e. in committed | |
247 // space). If you need the more conservative answer use is_permanent(). | |
248 virtual bool is_in_permanent(const void *p) const = 0; | |
249 | |
250 // Returns "TRUE" if "p" is in the committed area of "permanent" data. | |
251 // If the heap does not use "permanent" data, returns the same | |
252 // value is_in() would return. | |
253 virtual bool is_permanent(const void *p) const = 0; | |
254 | |
255 bool is_in_permanent_or_null(const void *p) const { | |
256 return p == NULL || is_in_permanent(p); | |
257 } | |
258 | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
259 // An object is scavengable if its location may move during a scavenge. |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
260 // (A scavenge is a GC which is not a full GC.) |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
261 // Currently, this just means it is not perm (and not null). |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
262 // This could change if we rethink what's in perm-gen. |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
263 bool is_scavengable(const void *p) const { |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
264 return !is_in_permanent_or_null(p); |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
265 } |
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
845
diff
changeset
|
266 |
0 | 267 // Returns "TRUE" if "p" is a method oop in the |
268 // current heap, with high probability. This predicate | |
269 // is not stable, in general. | |
270 bool is_valid_method(oop p) const; | |
271 | |
272 void set_gc_cause(GCCause::Cause v) { | |
273 if (UsePerfData) { | |
274 _gc_lastcause = _gc_cause; | |
275 _perf_gc_lastcause->set_value(GCCause::to_string(_gc_lastcause)); | |
276 _perf_gc_cause->set_value(GCCause::to_string(v)); | |
277 } | |
278 _gc_cause = v; | |
279 } | |
280 GCCause::Cause gc_cause() { return _gc_cause; } | |
281 | |
282 // Preload classes into the shared portion of the heap, and then dump | |
283 // that data to a file so that it can be loaded directly by another | |
284 // VM (then terminate). | |
285 virtual void preload_and_dump(TRAPS) { ShouldNotReachHere(); } | |
286 | |
287 // General obj/array allocation facilities. | |
288 inline static oop obj_allocate(KlassHandle klass, int size, TRAPS); | |
289 inline static oop array_allocate(KlassHandle klass, int size, int length, TRAPS); | |
290 inline static oop large_typearray_allocate(KlassHandle klass, int size, int length, TRAPS); | |
291 | |
292 // Special obj/array allocation facilities. | |
293 // Some heaps may want to manage "permanent" data uniquely. These default | |
294 // to the general routines if the heap does not support such handling. | |
295 inline static oop permanent_obj_allocate(KlassHandle klass, int size, TRAPS); | |
296 // permanent_obj_allocate_no_klass_install() does not do the installation of | |
297 // the klass pointer in the newly created object (as permanent_obj_allocate() | |
298 // above does). This allows for a delay in the installation of the klass | |
299 // pointer that is needed during the create of klassKlass's. The | |
300 // method post_allocation_install_obj_klass() is used to install the | |
301 // klass pointer. | |
302 inline static oop permanent_obj_allocate_no_klass_install(KlassHandle klass, | |
303 int size, | |
304 TRAPS); | |
305 inline static void post_allocation_install_obj_klass(KlassHandle klass, | |
306 oop obj, | |
307 int size); | |
308 inline static oop permanent_array_allocate(KlassHandle klass, int size, int length, TRAPS); | |
309 | |
310 // Raw memory allocation facilities | |
311 // The obj and array allocate methods are covers for these methods. | |
312 // The permanent allocation method should default to mem_allocate if | |
313 // permanent memory isn't supported. | |
314 virtual HeapWord* mem_allocate(size_t size, | |
315 bool is_noref, | |
316 bool is_tlab, | |
317 bool* gc_overhead_limit_was_exceeded) = 0; | |
318 virtual HeapWord* permanent_mem_allocate(size_t size) = 0; | |
319 | |
320 // The boundary between a "large" and "small" array of primitives, in words. | |
321 virtual size_t large_typearray_limit() = 0; | |
322 | |
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
323 // Utilities for turning raw memory into filler objects. |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
324 // |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
325 // min_fill_size() is the smallest region that can be filled. |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
326 // fill_with_objects() can fill arbitrary-sized regions of the heap using |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
327 // multiple objects. fill_with_object() is for regions known to be smaller |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
328 // than the largest array of integers; it uses a single object to fill the |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
329 // region and has slightly less overhead. |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
330 static size_t min_fill_size() { |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
331 return size_t(align_object_size(oopDesc::header_size())); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
332 } |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
333 |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
334 static void fill_with_objects(HeapWord* start, size_t words); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
335 |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
336 static void fill_with_object(HeapWord* start, size_t words); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
337 static void fill_with_object(MemRegion region) { |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
338 fill_with_object(region.start(), region.word_size()); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
339 } |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
340 static void fill_with_object(HeapWord* start, HeapWord* end) { |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
341 fill_with_object(start, pointer_delta(end, start)); |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
342 } |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
356
diff
changeset
|
343 |
0 | 344 // Some heaps may offer a contiguous region for shared non-blocking |
345 // allocation, via inlined code (by exporting the address of the top and | |
346 // end fields defining the extent of the contiguous allocation region.) | |
347 | |
348 // This function returns "true" iff the heap supports this kind of | |
349 // allocation. (Default is "no".) | |
350 virtual bool supports_inline_contig_alloc() const { | |
351 return false; | |
352 } | |
353 // These functions return the addresses of the fields that define the | |
354 // boundaries of the contiguous allocation area. (These fields should be | |
355 // physically near to one another.) | |
356 virtual HeapWord** top_addr() const { | |
357 guarantee(false, "inline contiguous allocation not supported"); | |
358 return NULL; | |
359 } | |
360 virtual HeapWord** end_addr() const { | |
361 guarantee(false, "inline contiguous allocation not supported"); | |
362 return NULL; | |
363 } | |
364 | |
365 // Some heaps may be in an unparseable state at certain times between | |
366 // collections. This may be necessary for efficient implementation of | |
367 // certain allocation-related activities. Calling this function before | |
368 // attempting to parse a heap ensures that the heap is in a parsable | |
369 // state (provided other concurrent activity does not introduce | |
370 // unparsability). It is normally expected, therefore, that this | |
371 // method is invoked with the world stopped. | |
372 // NOTE: if you override this method, make sure you call | |
373 // super::ensure_parsability so that the non-generational | |
374 // part of the work gets done. See implementation of | |
375 // CollectedHeap::ensure_parsability and, for instance, | |
376 // that of GenCollectedHeap::ensure_parsability(). | |
377 // The argument "retire_tlabs" controls whether existing TLABs | |
378 // are merely filled or also retired, thus preventing further | |
379 // allocation from them and necessitating allocation of new TLABs. | |
380 virtual void ensure_parsability(bool retire_tlabs); | |
381 | |
382 // Return an estimate of the maximum allocation that could be performed | |
383 // without triggering any collection or expansion activity. In a | |
384 // generational collector, for example, this is probably the largest | |
385 // allocation that could be supported (without expansion) in the youngest | |
386 // generation. It is "unsafe" because no locks are taken; the result | |
387 // should be treated as an approximation, not a guarantee, for use in | |
388 // heuristic resizing decisions. | |
389 virtual size_t unsafe_max_alloc() = 0; | |
390 | |
391 // Section on thread-local allocation buffers (TLABs) | |
392 // If the heap supports thread-local allocation buffers, it should override | |
393 // the following methods: | |
394 // Returns "true" iff the heap supports thread-local allocation buffers. | |
395 // The default is "no". | |
396 virtual bool supports_tlab_allocation() const { | |
397 return false; | |
398 } | |
399 // The amount of space available for thread-local allocation buffers. | |
400 virtual size_t tlab_capacity(Thread *thr) const { | |
401 guarantee(false, "thread-local allocation buffers not supported"); | |
402 return 0; | |
403 } | |
404 // An estimate of the maximum allocation that could be performed | |
405 // for thread-local allocation buffers without triggering any | |
406 // collection or expansion activity. | |
407 virtual size_t unsafe_max_tlab_alloc(Thread *thr) const { | |
408 guarantee(false, "thread-local allocation buffers not supported"); | |
409 return 0; | |
410 } | |
411 // Can a compiler initialize a new object without store barriers? | |
412 // This permission only extends from the creation of a new object | |
413 // via a TLAB up to the first subsequent safepoint. | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
414 virtual bool can_elide_tlab_store_barriers() const = 0; |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
415 |
0 | 416 // If a compiler is eliding store barriers for TLAB-allocated objects, |
417 // there is probably a corresponding slow path which can produce | |
418 // an object allocated anywhere. The compiler's runtime support | |
419 // promises to call this function on such a slow-path-allocated | |
420 // object before performing initializations that have elided | |
421 // store barriers. Returns new_obj, or maybe a safer copy thereof. | |
422 virtual oop new_store_barrier(oop new_obj); | |
423 | |
424 // Can a compiler elide a store barrier when it writes | |
425 // a permanent oop into the heap? Applies when the compiler | |
426 // is storing x to the heap, where x->is_perm() is true. | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
427 virtual bool can_elide_permanent_oop_store_barriers() const = 0; |
0 | 428 |
429 // Does this heap support heap inspection (+PrintClassHistogram?) | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
430 virtual bool supports_heap_inspection() const = 0; |
0 | 431 |
432 // Perform a collection of the heap; intended for use in implementing | |
433 // "System.gc". This probably implies as full a collection as the | |
434 // "CollectedHeap" supports. | |
435 virtual void collect(GCCause::Cause cause) = 0; | |
436 | |
437 // This interface assumes that it's being called by the | |
438 // vm thread. It collects the heap assuming that the | |
439 // heap lock is already held and that we are executing in | |
440 // the context of the vm thread. | |
441 virtual void collect_as_vm_thread(GCCause::Cause cause) = 0; | |
442 | |
443 // Returns the barrier set for this heap | |
444 BarrierSet* barrier_set() { return _barrier_set; } | |
445 | |
446 // Returns "true" iff there is a stop-world GC in progress. (I assume | |
447 // that it should answer "false" for the concurrent part of a concurrent | |
448 // collector -- dld). | |
449 bool is_gc_active() const { return _is_gc_active; } | |
450 | |
451 // Total number of GC collections (started) | |
452 unsigned int total_collections() const { return _total_collections; } | |
453 unsigned int total_full_collections() const { return _total_full_collections;} | |
454 | |
455 // Increment total number of GC collections (started) | |
456 // Should be protected but used by PSMarkSweep - cleanup for 1.4.2 | |
457 void increment_total_collections(bool full = false) { | |
458 _total_collections++; | |
459 if (full) { | |
460 increment_total_full_collections(); | |
461 } | |
462 } | |
463 | |
464 void increment_total_full_collections() { _total_full_collections++; } | |
465 | |
466 // Return the AdaptiveSizePolicy for the heap. | |
467 virtual AdaptiveSizePolicy* size_policy() = 0; | |
468 | |
469 // Iterate over all the ref-containing fields of all objects, calling | |
470 // "cl.do_oop" on each. This includes objects in permanent memory. | |
471 virtual void oop_iterate(OopClosure* cl) = 0; | |
472 | |
473 // Iterate over all objects, calling "cl.do_object" on each. | |
474 // This includes objects in permanent memory. | |
475 virtual void object_iterate(ObjectClosure* cl) = 0; | |
476 | |
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
481
diff
changeset
|
477 // Similar to object_iterate() except iterates only |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
481
diff
changeset
|
478 // over live objects. |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
481
diff
changeset
|
479 virtual void safe_object_iterate(ObjectClosure* cl) = 0; |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
481
diff
changeset
|
480 |
0 | 481 // Behaves the same as oop_iterate, except only traverses |
482 // interior pointers contained in permanent memory. If there | |
483 // is no permanent memory, does nothing. | |
484 virtual void permanent_oop_iterate(OopClosure* cl) = 0; | |
485 | |
486 // Behaves the same as object_iterate, except only traverses | |
487 // object contained in permanent memory. If there is no | |
488 // permanent memory, does nothing. | |
489 virtual void permanent_object_iterate(ObjectClosure* cl) = 0; | |
490 | |
491 // NOTE! There is no requirement that a collector implement these | |
492 // functions. | |
493 // | |
494 // A CollectedHeap is divided into a dense sequence of "blocks"; that is, | |
495 // each address in the (reserved) heap is a member of exactly | |
496 // one block. The defining characteristic of a block is that it is | |
497 // possible to find its size, and thus to progress forward to the next | |
498 // block. (Blocks may be of different sizes.) Thus, blocks may | |
499 // represent Java objects, or they might be free blocks in a | |
500 // free-list-based heap (or subheap), as long as the two kinds are | |
501 // distinguishable and the size of each is determinable. | |
502 | |
503 // Returns the address of the start of the "block" that contains the | |
504 // address "addr". We say "blocks" instead of "object" since some heaps | |
505 // may not pack objects densely; a chunk may either be an object or a | |
506 // non-object. | |
507 virtual HeapWord* block_start(const void* addr) const = 0; | |
508 | |
509 // Requires "addr" to be the start of a chunk, and returns its size. | |
510 // "addr + size" is required to be the start of a new chunk, or the end | |
511 // of the active area of the heap. | |
512 virtual size_t block_size(const HeapWord* addr) const = 0; | |
513 | |
514 // Requires "addr" to be the start of a block, and returns "TRUE" iff | |
515 // the block is an object. | |
516 virtual bool block_is_obj(const HeapWord* addr) const = 0; | |
517 | |
518 // Returns the longest time (in ms) that has elapsed since the last | |
519 // time that any part of the heap was examined by a garbage collection. | |
520 virtual jlong millis_since_last_gc() = 0; | |
521 | |
522 // Perform any cleanup actions necessary before allowing a verification. | |
523 virtual void prepare_for_verify() = 0; | |
524 | |
615
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
542
diff
changeset
|
525 // Generate any dumps preceding or following a full gc |
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
542
diff
changeset
|
526 void pre_full_gc_dump(); |
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
542
diff
changeset
|
527 void post_full_gc_dump(); |
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
542
diff
changeset
|
528 |
0 | 529 virtual void print() const = 0; |
530 virtual void print_on(outputStream* st) const = 0; | |
531 | |
532 // Print all GC threads (other than the VM thread) | |
533 // used by this heap. | |
534 virtual void print_gc_threads_on(outputStream* st) const = 0; | |
535 void print_gc_threads() { print_gc_threads_on(tty); } | |
536 // Iterator for all GC threads (other than VM thread) | |
537 virtual void gc_threads_do(ThreadClosure* tc) const = 0; | |
538 | |
539 // Print any relevant tracing info that flags imply. | |
540 // Default implementation does nothing. | |
541 virtual void print_tracing_info() const = 0; | |
542 | |
543 // Heap verification | |
845
df6caf649ff7
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
628
diff
changeset
|
544 virtual void verify(bool allow_dirty, bool silent, bool option) = 0; |
0 | 545 |
546 // Non product verification and debugging. | |
547 #ifndef PRODUCT | |
548 // Support for PromotionFailureALot. Return true if it's time to cause a | |
549 // promotion failure. The no-argument version uses | |
550 // this->_promotion_failure_alot_count as the counter. | |
551 inline bool promotion_should_fail(volatile size_t* count); | |
552 inline bool promotion_should_fail(); | |
553 | |
554 // Reset the PromotionFailureALot counters. Should be called at the end of a | |
555 // GC in which promotion failure ocurred. | |
556 inline void reset_promotion_should_fail(volatile size_t* count); | |
557 inline void reset_promotion_should_fail(); | |
558 #endif // #ifndef PRODUCT | |
559 | |
560 #ifdef ASSERT | |
561 static int fired_fake_oom() { | |
562 return (CIFireOOMAt > 1 && _fire_out_of_memory_count >= CIFireOOMAt); | |
563 } | |
564 #endif | |
565 }; | |
566 | |
567 // Class to set and reset the GC cause for a CollectedHeap. | |
568 | |
569 class GCCauseSetter : StackObj { | |
570 CollectedHeap* _heap; | |
571 GCCause::Cause _previous_cause; | |
572 public: | |
573 GCCauseSetter(CollectedHeap* heap, GCCause::Cause cause) { | |
574 assert(SafepointSynchronize::is_at_safepoint(), | |
575 "This method manipulates heap state without locking"); | |
576 _heap = heap; | |
577 _previous_cause = _heap->gc_cause(); | |
578 _heap->set_gc_cause(cause); | |
579 } | |
580 | |
581 ~GCCauseSetter() { | |
582 assert(SafepointSynchronize::is_at_safepoint(), | |
583 "This method manipulates heap state without locking"); | |
584 _heap->set_gc_cause(_previous_cause); | |
585 } | |
586 }; |