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 GCHeapSummary;
39 class GCTaskManager;
40 class GenerationSizer;
41 class CollectorPolicy;
42 class PSAdaptiveSizePolicy;
43 class PSHeapSummary;
44
45 class ParallelScavengeHeap : public CollectedHeap {
46 friend class VMStructs;
47 private:
48 static PSYoungGen* _young_gen;
49 static PSOldGen* _old_gen;
50
51 // Sizing policy for entire heap
52 static PSAdaptiveSizePolicy* _size_policy;
53 static PSGCAdaptivePolicyCounters* _gc_policy_counters;
54
55 static ParallelScavengeHeap* _psh;
56
57 size_t _young_gen_alignment;
58 size_t _old_gen_alignment;
59
60 GenerationSizer* _collector_policy;
61
62 inline size_t set_alignment(size_t& var, size_t val);
63
64 // Collection of generations that are adjacent in the
65 // space reserved for the heap.
66 AdjoiningGenerations* _gens;
67 unsigned int _death_march_count;
68
69 // The task manager
70 static GCTaskManager* _gc_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(), _death_march_count(0) {
84 set_alignment(_young_gen_alignment, intra_heap_alignment());
85 set_alignment(_old_gen_alignment, intra_heap_alignment());
86 }
87
88 // Return the (conservative) maximum heap alignment
89 static size_t conservative_max_heap_alignment() {
90 return GenCollectorPolicy::intra_heap_alignment();
91 }
92
93 // For use by VM operations
94 enum CollectionType {
95 Scavenge,
96 MarkSweep
97 };
98
99 ParallelScavengeHeap::Name kind() const {
100 return CollectedHeap::ParallelScavengeHeap;
101 }
102
103 virtual CollectorPolicy* collector_policy() const { return (CollectorPolicy*) _collector_policy; }
104
105 static PSYoungGen* young_gen() { return _young_gen; }
106 static PSOldGen* old_gen() { return _old_gen; }
107
108 virtual PSAdaptiveSizePolicy* size_policy() { return _size_policy; }
109
110 static PSGCAdaptivePolicyCounters* gc_policy_counters() { return _gc_policy_counters; }
111
112 static ParallelScavengeHeap* heap();
113
114 static GCTaskManager* const gc_task_manager() { return _gc_task_manager; }
115
116 AdjoiningGenerations* gens() { return _gens; }
117
118 // Returns JNI_OK on success
119 virtual jint initialize();
120
121 void post_initialize();
122 void update_counters();
123 // The alignment used for the various generations.
124 size_t young_gen_alignment() const { return _young_gen_alignment; }
125 size_t old_gen_alignment() const { return _old_gen_alignment; }
126
127 // The alignment used for eden and survivors within the young gen
128 // and for boundary between young gen and old gen.
129 size_t intra_heap_alignment() { return GenCollectorPolicy::intra_heap_alignment(); }
130
131 size_t capacity() const;
132 size_t used() const;
133
134 // Return "true" if all generations have reached the
135 // maximal committed limit that they can reach, without a garbage
136 // collection.
137 virtual bool is_maximal_no_gc() const;
138
139 // Return true if the reference points to an object that
140 // can be moved in a partial collection. For currently implemented
141 // generational collectors that means during a collection of
142 // the young gen.
143 virtual bool is_scavengable(const void* addr);
144
145 // Does this heap support heap inspection? (+PrintClassHistogram)
146 bool supports_heap_inspection() const { return true; }
147
148 size_t max_capacity() const;
149
244 void resize_young_gen(size_t eden_size, size_t survivor_size);
245
246 // Resize the old generation. The reserved space for the
247 // generation may be expanded in preparation for the resize.
248 void resize_old_gen(size_t desired_free_space);
249
250 // Save the tops of the spaces in all generations
251 void record_gen_tops_before_GC() PRODUCT_RETURN;
252
253 // Mangle the unused parts of all spaces in the heap
254 void gen_mangle_unused_area() PRODUCT_RETURN;
255
256 // Call these in sequential code around the processing of strong roots.
257 class ParStrongRootsScope : public MarkingCodeBlobClosure::MarkScope {
258 public:
259 ParStrongRootsScope();
260 ~ParStrongRootsScope();
261 };
262 };
263
264 inline size_t ParallelScavengeHeap::set_alignment(size_t& var, size_t val)
265 {
266 assert(is_power_of_2((intptr_t)val), "must be a power of 2");
267 var = round_to(val, intra_heap_alignment());
268 return var;
269 }
270
271 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP
|
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/generationSizer.hpp"
29 #include "gc_implementation/parallelScavenge/objectStartArray.hpp"
30 #include "gc_implementation/parallelScavenge/psGCAdaptivePolicyCounters.hpp"
31 #include "gc_implementation/parallelScavenge/psOldGen.hpp"
32 #include "gc_implementation/parallelScavenge/psYoungGen.hpp"
33 #include "gc_implementation/shared/gcPolicyCounters.hpp"
34 #include "gc_implementation/shared/gcWhen.hpp"
35 #include "gc_interface/collectedHeap.inline.hpp"
36 #include "memory/collectorPolicy.hpp"
37 #include "utilities/ostream.hpp"
38
39 class AdjoiningGenerations;
40 class GCHeapSummary;
41 class GCTaskManager;
42 class PSAdaptiveSizePolicy;
43 class PSHeapSummary;
44
45 class ParallelScavengeHeap : public CollectedHeap {
46 friend class VMStructs;
47 private:
48 static PSYoungGen* _young_gen;
49 static PSOldGen* _old_gen;
50
51 // Sizing policy for entire heap
52 static PSAdaptiveSizePolicy* _size_policy;
53 static PSGCAdaptivePolicyCounters* _gc_policy_counters;
54
55 static ParallelScavengeHeap* _psh;
56
57 GenerationSizer* _collector_policy;
58
59 // Collection of generations that are adjacent in the
60 // space reserved for the heap.
61 AdjoiningGenerations* _gens;
62 unsigned int _death_march_count;
63
64 // The task manager
65 static GCTaskManager* _gc_task_manager;
66
67 void trace_heap(GCWhen::Type when, GCTracer* tracer);
68
69 protected:
70 static inline size_t total_invocations();
71 HeapWord* allocate_new_tlab(size_t size);
72
73 inline bool should_alloc_in_eden(size_t size) const;
74 inline void death_march_check(HeapWord* const result, size_t size);
75 HeapWord* mem_allocate_old_gen(size_t size);
76
77 public:
78 ParallelScavengeHeap() : CollectedHeap(), _death_march_count(0) { }
79
80 // For use by VM operations
81 enum CollectionType {
82 Scavenge,
83 MarkSweep
84 };
85
86 ParallelScavengeHeap::Name kind() const {
87 return CollectedHeap::ParallelScavengeHeap;
88 }
89
90 virtual CollectorPolicy* collector_policy() const { return (CollectorPolicy*) _collector_policy; }
91
92 static PSYoungGen* young_gen() { return _young_gen; }
93 static PSOldGen* old_gen() { return _old_gen; }
94
95 virtual PSAdaptiveSizePolicy* size_policy() { return _size_policy; }
96
97 static PSGCAdaptivePolicyCounters* gc_policy_counters() { return _gc_policy_counters; }
98
99 static ParallelScavengeHeap* heap();
100
101 static GCTaskManager* const gc_task_manager() { return _gc_task_manager; }
102
103 AdjoiningGenerations* gens() { return _gens; }
104
105 // Returns JNI_OK on success
106 virtual jint initialize();
107
108 void post_initialize();
109 void update_counters();
110
111 // The alignment used for the various areas
112 size_t space_alignment() { return _collector_policy->space_alignment(); }
113 size_t generation_alignment() { return _collector_policy->gen_alignment(); }
114
115 // Return the (conservative) maximum heap alignment
116 static size_t conservative_max_heap_alignment() {
117 return CollectorPolicy::compute_heap_alignment();
118 }
119
120 size_t capacity() const;
121 size_t used() const;
122
123 // Return "true" if all generations have reached the
124 // maximal committed limit that they can reach, without a garbage
125 // collection.
126 virtual bool is_maximal_no_gc() const;
127
128 // Return true if the reference points to an object that
129 // can be moved in a partial collection. For currently implemented
130 // generational collectors that means during a collection of
131 // the young gen.
132 virtual bool is_scavengable(const void* addr);
133
134 // Does this heap support heap inspection? (+PrintClassHistogram)
135 bool supports_heap_inspection() const { return true; }
136
137 size_t max_capacity() const;
138
233 void resize_young_gen(size_t eden_size, size_t survivor_size);
234
235 // Resize the old generation. The reserved space for the
236 // generation may be expanded in preparation for the resize.
237 void resize_old_gen(size_t desired_free_space);
238
239 // Save the tops of the spaces in all generations
240 void record_gen_tops_before_GC() PRODUCT_RETURN;
241
242 // Mangle the unused parts of all spaces in the heap
243 void gen_mangle_unused_area() PRODUCT_RETURN;
244
245 // Call these in sequential code around the processing of strong roots.
246 class ParStrongRootsScope : public MarkingCodeBlobClosure::MarkScope {
247 public:
248 ParStrongRootsScope();
249 ~ParStrongRootsScope();
250 };
251 };
252
253 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP
|