1 /*
2 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP
27
28 #include "gc_implementation/parallelScavenge/objectStartArray.hpp"
29 #include "gc_implementation/parallelScavenge/psGCAdaptivePolicyCounters.hpp"
30 #include "gc_implementation/parallelScavenge/psOldGen.hpp"
31 #include "gc_implementation/parallelScavenge/psYoungGen.hpp"
32 #include "gc_implementation/shared/gcPolicyCounters.hpp"
33 #include "gc_interface/collectedHeap.inline.hpp"
34 #include "utilities/ostream.hpp"
35
36 class AdjoiningGenerations;
37 class GCTaskManager;
38 class PSAdaptiveSizePolicy;
39 class GenerationSizer;
40 class CollectorPolicy;
41
42 class ParallelScavengeHeap : public CollectedHeap {
43 friend class VMStructs;
44 private:
45 static PSYoungGen* _young_gen;
46 static PSOldGen* _old_gen;
47
48 // Sizing policy for entire heap
49 static PSAdaptiveSizePolicy* _size_policy;
50 static PSGCAdaptivePolicyCounters* _gc_policy_counters;
51
52 static ParallelScavengeHeap* _psh;
53
54 size_t _young_gen_alignment;
55 size_t _old_gen_alignment;
56
57 GenerationSizer* _collector_policy;
58
59 inline size_t set_alignment(size_t& var, size_t val);
60
61 // Collection of generations that are adjacent in the
62 // space reserved for the heap.
63 AdjoiningGenerations* _gens;
64 unsigned int _death_march_count;
65
66 static GCTaskManager* _gc_task_manager; // The task manager.
67
68 protected:
69 static inline size_t total_invocations();
70 HeapWord* allocate_new_tlab(size_t size);
71
72 inline bool should_alloc_in_eden(size_t size) const;
73 inline void death_march_check(HeapWord* const result, size_t size);
74 HeapWord* mem_allocate_old_gen(size_t size);
75
76 public:
77 ParallelScavengeHeap() : CollectedHeap() {
78 _death_march_count = 0;
79 set_alignment(_young_gen_alignment, intra_heap_alignment());
80 set_alignment(_old_gen_alignment, intra_heap_alignment());
81 }
82
83 // For use by VM operations
84 enum CollectionType {
85 Scavenge,
86 MarkSweep
87 };
202
203 virtual bool card_mark_must_follow_store() const {
204 return false;
205 }
206
207 // Return true if we don't we need a store barrier for
208 // initializing stores to an object at this address.
209 virtual bool can_elide_initializing_store_barrier(oop new_obj);
210
211 void oop_iterate(ExtendedOopClosure* cl);
212 void object_iterate(ObjectClosure* cl);
213 void safe_object_iterate(ObjectClosure* cl) { object_iterate(cl); }
214
215 HeapWord* block_start(const void* addr) const;
216 size_t block_size(const HeapWord* addr) const;
217 bool block_is_obj(const HeapWord* addr) const;
218
219 jlong millis_since_last_gc();
220
221 void prepare_for_verify();
222 virtual void print_on(outputStream* st) const;
223 virtual void print_on_error(outputStream* st) const;
224 virtual void print_gc_threads_on(outputStream* st) const;
225 virtual void gc_threads_do(ThreadClosure* tc) const;
226 virtual void print_tracing_info() const;
227
228 void verify(bool silent, VerifyOption option /* ignored */);
229
230 void print_heap_change(size_t prev_used);
231
232 // Resize the young generation. The reserved space for the
233 // generation may be expanded in preparation for the resize.
234 void resize_young_gen(size_t eden_size, size_t survivor_size);
235
236 // Resize the old generation. The reserved space for the
237 // generation may be expanded in preparation for the resize.
238 void resize_old_gen(size_t desired_free_space);
239
240 // Save the tops of the spaces in all generations
241 void record_gen_tops_before_GC() PRODUCT_RETURN;
|
1 /*
2 * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP
27
28 #include "gc_implementation/parallelScavenge/objectStartArray.hpp"
29 #include "gc_implementation/parallelScavenge/psGCAdaptivePolicyCounters.hpp"
30 #include "gc_implementation/parallelScavenge/psOldGen.hpp"
31 #include "gc_implementation/parallelScavenge/psYoungGen.hpp"
32 #include "gc_implementation/shared/gcPolicyCounters.hpp"
33 #include "gc_implementation/shared/gcWhen.hpp"
34 #include "gc_interface/collectedHeap.inline.hpp"
35 #include "utilities/ostream.hpp"
36
37 class AdjoiningGenerations;
38 class CollectorPolicy;
39 class GCHeapSummary;
40 class GCTaskManager;
41 class GenerationSizer;
42 class CollectorPolicy;
43 class PSAdaptiveSizePolicy;
44 class PSHeapSummary;
45
46 class ParallelScavengeHeap : public CollectedHeap {
47 friend class VMStructs;
48 private:
49 static PSYoungGen* _young_gen;
50 static PSOldGen* _old_gen;
51
52 // Sizing policy for entire heap
53 static PSAdaptiveSizePolicy* _size_policy;
54 static PSGCAdaptivePolicyCounters* _gc_policy_counters;
55
56 static ParallelScavengeHeap* _psh;
57
58 size_t _young_gen_alignment;
59 size_t _old_gen_alignment;
60
61 GenerationSizer* _collector_policy;
62
63 inline size_t set_alignment(size_t& var, size_t val);
64
65 // Collection of generations that are adjacent in the
66 // space reserved for the heap.
67 AdjoiningGenerations* _gens;
68 unsigned int _death_march_count;
69
70 static GCTaskManager* _gc_task_manager; // The task manager.
71
72 void trace_heap(GCWhen::Type when, GCTracer* tracer);
73
74 protected:
75 static inline size_t total_invocations();
76 HeapWord* allocate_new_tlab(size_t size);
77
78 inline bool should_alloc_in_eden(size_t size) const;
79 inline void death_march_check(HeapWord* const result, size_t size);
80 HeapWord* mem_allocate_old_gen(size_t size);
81
82 public:
83 ParallelScavengeHeap() : CollectedHeap() {
84 _death_march_count = 0;
85 set_alignment(_young_gen_alignment, intra_heap_alignment());
86 set_alignment(_old_gen_alignment, intra_heap_alignment());
87 }
88
89 // For use by VM operations
90 enum CollectionType {
91 Scavenge,
92 MarkSweep
93 };
208
209 virtual bool card_mark_must_follow_store() const {
210 return false;
211 }
212
213 // Return true if we don't we need a store barrier for
214 // initializing stores to an object at this address.
215 virtual bool can_elide_initializing_store_barrier(oop new_obj);
216
217 void oop_iterate(ExtendedOopClosure* cl);
218 void object_iterate(ObjectClosure* cl);
219 void safe_object_iterate(ObjectClosure* cl) { object_iterate(cl); }
220
221 HeapWord* block_start(const void* addr) const;
222 size_t block_size(const HeapWord* addr) const;
223 bool block_is_obj(const HeapWord* addr) const;
224
225 jlong millis_since_last_gc();
226
227 void prepare_for_verify();
228 PSHeapSummary create_ps_heap_summary();
229 virtual void print_on(outputStream* st) const;
230 virtual void print_on_error(outputStream* st) const;
231 virtual void print_gc_threads_on(outputStream* st) const;
232 virtual void gc_threads_do(ThreadClosure* tc) const;
233 virtual void print_tracing_info() const;
234
235 void verify(bool silent, VerifyOption option /* ignored */);
236
237 void print_heap_change(size_t prev_used);
238
239 // Resize the young generation. The reserved space for the
240 // generation may be expanded in preparation for the resize.
241 void resize_young_gen(size_t eden_size, size_t survivor_size);
242
243 // Resize the old generation. The reserved space for the
244 // generation may be expanded in preparation for the resize.
245 void resize_old_gen(size_t desired_free_space);
246
247 // Save the tops of the spaces in all generations
248 void record_gen_tops_before_GC() PRODUCT_RETURN;
|