8199604_cardtablemodrefbs_rename
12 * accompanied this code).
13 *
14 * You should have received a copy of the GNU General Public License version
15 * 2 along with this work; if not, write to the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17 *
18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19 * or visit www.oracle.com if you need additional information or have any
20 * questions.
21 *
22 */
23
24 #ifndef SHARE_VM_GC_PARALLEL_PARALLELSCAVENGEHEAP_HPP
25 #define SHARE_VM_GC_PARALLEL_PARALLELSCAVENGEHEAP_HPP
26
27 #include "gc/parallel/generationSizer.hpp"
28 #include "gc/parallel/objectStartArray.hpp"
29 #include "gc/parallel/psGCAdaptivePolicyCounters.hpp"
30 #include "gc/parallel/psOldGen.hpp"
31 #include "gc/parallel/psYoungGen.hpp"
32 #include "gc/shared/cardTableModRefBS.hpp"
33 #include "gc/shared/collectedHeap.hpp"
34 #include "gc/shared/collectorPolicy.hpp"
35 #include "gc/shared/gcPolicyCounters.hpp"
36 #include "gc/shared/gcWhen.hpp"
37 #include "gc/shared/softRefPolicy.hpp"
38 #include "gc/shared/strongRootsScope.hpp"
39 #include "memory/metaspace.hpp"
40 #include "utilities/growableArray.hpp"
41 #include "utilities/ostream.hpp"
42
43 class AdjoiningGenerations;
44 class GCHeapSummary;
45 class GCTaskManager;
46 class MemoryManager;
47 class MemoryPool;
48 class PSAdaptiveSizePolicy;
49 class PSCardTable;
50 class PSHeapSummary;
51
|
12 * accompanied this code).
13 *
14 * You should have received a copy of the GNU General Public License version
15 * 2 along with this work; if not, write to the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
17 *
18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
19 * or visit www.oracle.com if you need additional information or have any
20 * questions.
21 *
22 */
23
24 #ifndef SHARE_VM_GC_PARALLEL_PARALLELSCAVENGEHEAP_HPP
25 #define SHARE_VM_GC_PARALLEL_PARALLELSCAVENGEHEAP_HPP
26
27 #include "gc/parallel/generationSizer.hpp"
28 #include "gc/parallel/objectStartArray.hpp"
29 #include "gc/parallel/psGCAdaptivePolicyCounters.hpp"
30 #include "gc/parallel/psOldGen.hpp"
31 #include "gc/parallel/psYoungGen.hpp"
32 #include "gc/shared/cardTableBarrierSet.hpp"
33 #include "gc/shared/collectedHeap.hpp"
34 #include "gc/shared/collectorPolicy.hpp"
35 #include "gc/shared/gcPolicyCounters.hpp"
36 #include "gc/shared/gcWhen.hpp"
37 #include "gc/shared/softRefPolicy.hpp"
38 #include "gc/shared/strongRootsScope.hpp"
39 #include "memory/metaspace.hpp"
40 #include "utilities/growableArray.hpp"
41 #include "utilities/ostream.hpp"
42
43 class AdjoiningGenerations;
44 class GCHeapSummary;
45 class GCTaskManager;
46 class MemoryManager;
47 class MemoryPool;
48 class PSAdaptiveSizePolicy;
49 class PSCardTable;
50 class PSHeapSummary;
51
|
109 }
110
111 virtual CollectorPolicy* collector_policy() const { return _collector_policy; }
112
113 virtual SoftRefPolicy* soft_ref_policy() { return &_soft_ref_policy; }
114
115 virtual GrowableArray<GCMemoryManager*> memory_managers();
116 virtual GrowableArray<MemoryPool*> memory_pools();
117
118 static PSYoungGen* young_gen() { return _young_gen; }
119 static PSOldGen* old_gen() { return _old_gen; }
120
121 virtual PSAdaptiveSizePolicy* size_policy() { return _size_policy; }
122
123 static PSGCAdaptivePolicyCounters* gc_policy_counters() { return _gc_policy_counters; }
124
125 static ParallelScavengeHeap* heap();
126
127 static GCTaskManager* const gc_task_manager() { return _gc_task_manager; }
128
129 CardTableModRefBS* barrier_set();
130 PSCardTable* card_table();
131
132 AdjoiningGenerations* gens() { return _gens; }
133
134 // Returns JNI_OK on success
135 virtual jint initialize();
136
137 void post_initialize();
138 void update_counters();
139
140 // The alignment used for the various areas
141 size_t space_alignment() { return _collector_policy->space_alignment(); }
142 size_t generation_alignment() { return _collector_policy->gen_alignment(); }
143
144 // Return the (conservative) maximum heap alignment
145 static size_t conservative_max_heap_alignment() {
146 return CollectorPolicy::compute_heap_alignment();
147 }
148
|
109 }
110
111 virtual CollectorPolicy* collector_policy() const { return _collector_policy; }
112
113 virtual SoftRefPolicy* soft_ref_policy() { return &_soft_ref_policy; }
114
115 virtual GrowableArray<GCMemoryManager*> memory_managers();
116 virtual GrowableArray<MemoryPool*> memory_pools();
117
118 static PSYoungGen* young_gen() { return _young_gen; }
119 static PSOldGen* old_gen() { return _old_gen; }
120
121 virtual PSAdaptiveSizePolicy* size_policy() { return _size_policy; }
122
123 static PSGCAdaptivePolicyCounters* gc_policy_counters() { return _gc_policy_counters; }
124
125 static ParallelScavengeHeap* heap();
126
127 static GCTaskManager* const gc_task_manager() { return _gc_task_manager; }
128
129 CardTableBarrierSet* barrier_set();
130 PSCardTable* card_table();
131
132 AdjoiningGenerations* gens() { return _gens; }
133
134 // Returns JNI_OK on success
135 virtual jint initialize();
136
137 void post_initialize();
138 void update_counters();
139
140 // The alignment used for the various areas
141 size_t space_alignment() { return _collector_policy->space_alignment(); }
142 size_t generation_alignment() { return _collector_policy->gen_alignment(); }
143
144 // Return the (conservative) maximum heap alignment
145 static size_t conservative_max_heap_alignment() {
146 return CollectorPolicy::compute_heap_alignment();
147 }
148
|