1 /* 2 * Copyright (c) 2001, 2016, 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_PARALLEL_PARALLELSCAVENGEHEAP_HPP 26 #define SHARE_VM_GC_PARALLEL_PARALLELSCAVENGEHEAP_HPP 27 28 #include "gc/parallel/psCardTable.hpp" 29 #include "gc/parallel/generationSizer.hpp" 30 #include "gc/parallel/objectStartArray.hpp" 31 #include "gc/parallel/psGCAdaptivePolicyCounters.hpp" 32 #include "gc/parallel/psOldGen.hpp" 33 #include "gc/parallel/psYoungGen.hpp" 34 #include "gc/shared/cardTableModRefBS.hpp" 35 #include "gc/shared/collectedHeap.hpp" 36 #include "gc/shared/collectorPolicy.hpp" 37 #include "gc/shared/gcPolicyCounters.hpp" 38 #include "gc/shared/gcWhen.hpp" 39 #include "gc/shared/strongRootsScope.hpp" 40 #include "memory/metaspace.hpp" 41 #include "utilities/ostream.hpp" 42 43 class AdjoiningGenerations; 44 class GCHeapSummary; 45 class GCTaskManager; 46 class PSAdaptiveSizePolicy; 47 class PSHeapSummary; 48 49 class ParallelScavengeHeap : public CollectedHeap { 50 friend class VMStructs; 51 private: 52 static PSYoungGen* _young_gen; 53 static PSOldGen* _old_gen; 54 55 // Sizing policy for entire heap 56 static PSAdaptiveSizePolicy* _size_policy; 57 static PSGCAdaptivePolicyCounters* _gc_policy_counters; 58 59 GenerationSizer* _collector_policy; 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 // The task manager 67 static GCTaskManager* _gc_task_manager; 68 69 void trace_heap(GCWhen::Type when, const GCTracer* tracer); 70 71 protected: 72 static inline size_t total_invocations(); 73 HeapWord* allocate_new_tlab(size_t size); 74 75 inline bool should_alloc_in_eden(size_t size) const; 76 inline void death_march_check(HeapWord* const result, size_t size); 77 HeapWord* mem_allocate_old_gen(size_t size); 78 79 public: 80 ParallelScavengeHeap(GenerationSizer* policy) : 81 CollectedHeap(), _collector_policy(policy), _death_march_count(0) { } 82 83 // For use by VM operations 84 enum CollectionType { 85 Scavenge, 86 MarkSweep 87 }; 88 89 virtual Name kind() const { 90 return CollectedHeap::ParallelScavengeHeap; 91 } 92 93 virtual const char* name() const { 94 return "Parallel"; 95 } 96 97 virtual CollectorPolicy* collector_policy() const { return _collector_policy; } 98 99 static PSYoungGen* young_gen() { return _young_gen; } 100 static PSOldGen* old_gen() { return _old_gen; } 101 102 virtual PSAdaptiveSizePolicy* size_policy() { return _size_policy; } 103 104 static PSGCAdaptivePolicyCounters* gc_policy_counters() { return _gc_policy_counters; } 105 106 static ParallelScavengeHeap* heap(); 107 108 static GCTaskManager* const gc_task_manager() { return _gc_task_manager; } 109 110 AdjoiningGenerations* gens() { return _gens; } 111 112 // Returns JNI_OK on success 113 virtual jint initialize(); 114 115 void post_initialize(); 116 void update_counters(); 117 118 // The alignment used for the various areas 119 size_t space_alignment() { return _collector_policy->space_alignment(); } 120 size_t generation_alignment() { return _collector_policy->gen_alignment(); } 121 122 // Return the (conservative) maximum heap alignment 123 static size_t conservative_max_heap_alignment() { 124 return CollectorPolicy::compute_heap_alignment(); 125 } 126 127 size_t capacity() const; 128 size_t used() const; 129 130 // Return "true" if all generations have reached the 131 // maximal committed limit that they can reach, without a garbage 132 // collection. 133 virtual bool is_maximal_no_gc() const; 134 135 // Return true if the reference points to an object that 136 // can be moved in a partial collection. For currently implemented 137 // generational collectors that means during a collection of 138 // the young gen. 139 virtual bool is_scavengable(const void* addr); 140 141 size_t max_capacity() const; 142 143 // Whether p is in the allocated part of the heap 144 bool is_in(const void* p) const; 145 146 bool is_in_reserved(const void* p) const; 147 148 bool is_in_young(oop p); // reserved part 149 bool is_in_old(oop p); // reserved part 150 151 // Memory allocation. "gc_time_limit_was_exceeded" will 152 // be set to true if the adaptive size policy determine that 153 // an excessive amount of time is being spent doing collections 154 // and caused a NULL to be returned. If a NULL is not returned, 155 // "gc_time_limit_was_exceeded" has an undefined meaning. 156 HeapWord* mem_allocate(size_t size, bool* gc_overhead_limit_was_exceeded); 157 158 // Allocation attempt(s) during a safepoint. It should never be called 159 // to allocate a new TLAB as this allocation might be satisfied out 160 // of the old generation. 161 HeapWord* failed_mem_allocate(size_t size); 162 163 // Support for System.gc() 164 void collect(GCCause::Cause cause); 165 166 // These also should be called by the vm thread at a safepoint (e.g., from a 167 // VM operation). 168 // 169 // The first collects the young generation only, unless the scavenge fails; it 170 // will then attempt a full gc. The second collects the entire heap; if 171 // maximum_compaction is true, it will compact everything and clear all soft 172 // references. 173 inline void invoke_scavenge(); 174 175 // Perform a full collection 176 virtual void do_full_collection(bool clear_all_soft_refs); 177 178 bool supports_inline_contig_alloc() const { return !UseNUMA; } 179 180 HeapWord* volatile* top_addr() const { return !UseNUMA ? young_gen()->top_addr() : (HeapWord* volatile*)-1; } 181 HeapWord** end_addr() const { return !UseNUMA ? young_gen()->end_addr() : (HeapWord**)-1; } 182 183 void ensure_parsability(bool retire_tlabs); 184 void accumulate_statistics_all_tlabs(); 185 void resize_all_tlabs(); 186 187 bool supports_tlab_allocation() const { return true; } 188 189 size_t tlab_capacity(Thread* thr) const; 190 size_t tlab_used(Thread* thr) const; 191 size_t unsafe_max_tlab_alloc(Thread* thr) const; 192 193 void object_iterate(ObjectClosure* cl); 194 void safe_object_iterate(ObjectClosure* cl) { object_iterate(cl); } 195 196 HeapWord* block_start(const void* addr) const; 197 size_t block_size(const HeapWord* addr) const; 198 bool block_is_obj(const HeapWord* addr) const; 199 200 jlong millis_since_last_gc(); 201 202 void prepare_for_verify(); 203 PSHeapSummary create_ps_heap_summary(); 204 virtual void print_on(outputStream* st) const; 205 virtual void print_on_error(outputStream* st) const; 206 virtual void print_gc_threads_on(outputStream* st) const; 207 virtual void gc_threads_do(ThreadClosure* tc) const; 208 virtual void print_tracing_info() const; 209 210 void verify(VerifyOption option /* ignored */); 211 212 // Resize the young generation. The reserved space for the 213 // generation may be expanded in preparation for the resize. 214 void resize_young_gen(size_t eden_size, size_t survivor_size); 215 216 // Resize the old generation. The reserved space for the 217 // generation may be expanded in preparation for the resize. 218 void resize_old_gen(size_t desired_free_space); 219 220 // Save the tops of the spaces in all generations 221 void record_gen_tops_before_GC() PRODUCT_RETURN; 222 223 // Mangle the unused parts of all spaces in the heap 224 void gen_mangle_unused_area() PRODUCT_RETURN; 225 226 CardTableModRefBS* barrier_set() { 227 return barrier_set_cast<CardTableModRefBS>(CollectedHeap::barrier_set()); 228 } 229 230 PSCardTable* card_table() { 231 return static_cast<PSCardTable*>(barrier_set()->card_table()); 232 } 233 234 // Call these in sequential code around the processing of strong roots. 235 class ParStrongRootsScope : public MarkScope { 236 public: 237 ParStrongRootsScope(); 238 ~ParStrongRootsScope(); 239 }; 240 }; 241 242 // Simple class for storing info about the heap at the start of GC, to be used 243 // after GC for comparison/printing. 244 class PreGCValues { 245 public: 246 PreGCValues(ParallelScavengeHeap* heap) : 247 _heap_used(heap->used()), 248 _young_gen_used(heap->young_gen()->used_in_bytes()), 249 _old_gen_used(heap->old_gen()->used_in_bytes()), 250 _metadata_used(MetaspaceAux::used_bytes()) { }; 251 252 size_t heap_used() const { return _heap_used; } 253 size_t young_gen_used() const { return _young_gen_used; } 254 size_t old_gen_used() const { return _old_gen_used; } 255 size_t metadata_used() const { return _metadata_used; } 256 257 private: 258 size_t _heap_used; 259 size_t _young_gen_used; 260 size_t _old_gen_used; 261 size_t _metadata_used; 262 }; 263 264 #endif // SHARE_VM_GC_PARALLEL_PARALLELSCAVENGEHEAP_HPP