Thu, 30 May 2013 13:04:51 -0700
6725714: par compact - add a table to speed up bitmap searches
Reviewed-by: jmasa, tschatzl
duke@435 | 1 | /* |
jcoomes@3541 | 2 | * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP |
stefank@2314 | 26 | #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "gc_implementation/parallelScavenge/objectStartArray.hpp" |
stefank@2314 | 29 | #include "gc_implementation/parallelScavenge/psGCAdaptivePolicyCounters.hpp" |
stefank@2314 | 30 | #include "gc_implementation/parallelScavenge/psOldGen.hpp" |
stefank@2314 | 31 | #include "gc_implementation/parallelScavenge/psYoungGen.hpp" |
stefank@2314 | 32 | #include "gc_implementation/shared/gcPolicyCounters.hpp" |
stefank@2314 | 33 | #include "gc_interface/collectedHeap.inline.hpp" |
stefank@2314 | 34 | #include "utilities/ostream.hpp" |
stefank@2314 | 35 | |
duke@435 | 36 | class AdjoiningGenerations; |
duke@435 | 37 | class GCTaskManager; |
duke@435 | 38 | class PSAdaptiveSizePolicy; |
jmasa@1822 | 39 | class GenerationSizer; |
jmasa@1822 | 40 | class CollectorPolicy; |
duke@435 | 41 | |
duke@435 | 42 | class ParallelScavengeHeap : public CollectedHeap { |
duke@435 | 43 | friend class VMStructs; |
duke@435 | 44 | private: |
duke@435 | 45 | static PSYoungGen* _young_gen; |
duke@435 | 46 | static PSOldGen* _old_gen; |
duke@435 | 47 | |
duke@435 | 48 | // Sizing policy for entire heap |
duke@435 | 49 | static PSAdaptiveSizePolicy* _size_policy; |
duke@435 | 50 | static PSGCAdaptivePolicyCounters* _gc_policy_counters; |
duke@435 | 51 | |
duke@435 | 52 | static ParallelScavengeHeap* _psh; |
duke@435 | 53 | |
duke@435 | 54 | size_t _young_gen_alignment; |
duke@435 | 55 | size_t _old_gen_alignment; |
duke@435 | 56 | |
jmasa@1822 | 57 | GenerationSizer* _collector_policy; |
jmasa@1822 | 58 | |
duke@435 | 59 | inline size_t set_alignment(size_t& var, size_t val); |
duke@435 | 60 | |
duke@435 | 61 | // Collection of generations that are adjacent in the |
duke@435 | 62 | // space reserved for the heap. |
duke@435 | 63 | AdjoiningGenerations* _gens; |
jcoomes@3541 | 64 | unsigned int _death_march_count; |
duke@435 | 65 | |
duke@435 | 66 | static GCTaskManager* _gc_task_manager; // The task manager. |
duke@435 | 67 | |
duke@435 | 68 | protected: |
duke@435 | 69 | static inline size_t total_invocations(); |
duke@435 | 70 | HeapWord* allocate_new_tlab(size_t size); |
duke@435 | 71 | |
jcoomes@3541 | 72 | inline bool should_alloc_in_eden(size_t size) const; |
jcoomes@3541 | 73 | inline void death_march_check(HeapWord* const result, size_t size); |
jcoomes@3541 | 74 | HeapWord* mem_allocate_old_gen(size_t size); |
jcoomes@3541 | 75 | |
duke@435 | 76 | public: |
duke@435 | 77 | ParallelScavengeHeap() : CollectedHeap() { |
jcoomes@3541 | 78 | _death_march_count = 0; |
jmasa@448 | 79 | set_alignment(_young_gen_alignment, intra_heap_alignment()); |
jmasa@448 | 80 | set_alignment(_old_gen_alignment, intra_heap_alignment()); |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | // For use by VM operations |
duke@435 | 84 | enum CollectionType { |
duke@435 | 85 | Scavenge, |
duke@435 | 86 | MarkSweep |
duke@435 | 87 | }; |
duke@435 | 88 | |
duke@435 | 89 | ParallelScavengeHeap::Name kind() const { |
duke@435 | 90 | return CollectedHeap::ParallelScavengeHeap; |
duke@435 | 91 | } |
duke@435 | 92 | |
coleenp@4037 | 93 | virtual CollectorPolicy* collector_policy() const { return (CollectorPolicy*) _collector_policy; } |
jmasa@1822 | 94 | |
duke@435 | 95 | static PSYoungGen* young_gen() { return _young_gen; } |
duke@435 | 96 | static PSOldGen* old_gen() { return _old_gen; } |
duke@435 | 97 | |
duke@435 | 98 | virtual PSAdaptiveSizePolicy* size_policy() { return _size_policy; } |
duke@435 | 99 | |
duke@435 | 100 | static PSGCAdaptivePolicyCounters* gc_policy_counters() { return _gc_policy_counters; } |
duke@435 | 101 | |
duke@435 | 102 | static ParallelScavengeHeap* heap(); |
duke@435 | 103 | |
duke@435 | 104 | static GCTaskManager* const gc_task_manager() { return _gc_task_manager; } |
duke@435 | 105 | |
duke@435 | 106 | AdjoiningGenerations* gens() { return _gens; } |
duke@435 | 107 | |
duke@435 | 108 | // Returns JNI_OK on success |
duke@435 | 109 | virtual jint initialize(); |
duke@435 | 110 | |
duke@435 | 111 | void post_initialize(); |
duke@435 | 112 | void update_counters(); |
duke@435 | 113 | // The alignment used for the various generations. |
duke@435 | 114 | size_t young_gen_alignment() const { return _young_gen_alignment; } |
duke@435 | 115 | size_t old_gen_alignment() const { return _old_gen_alignment; } |
duke@435 | 116 | |
jmasa@448 | 117 | // The alignment used for eden and survivors within the young gen |
jmasa@448 | 118 | // and for boundary between young gen and old gen. |
jcoomes@5201 | 119 | size_t intra_heap_alignment() const { return 64 * K * HeapWordSize; } |
duke@435 | 120 | |
duke@435 | 121 | size_t capacity() const; |
duke@435 | 122 | size_t used() const; |
duke@435 | 123 | |
coleenp@4037 | 124 | // Return "true" if all generations have reached the |
duke@435 | 125 | // maximal committed limit that they can reach, without a garbage |
duke@435 | 126 | // collection. |
duke@435 | 127 | virtual bool is_maximal_no_gc() const; |
duke@435 | 128 | |
jmasa@2909 | 129 | // Return true if the reference points to an object that |
jmasa@2909 | 130 | // can be moved in a partial collection. For currently implemented |
jmasa@2909 | 131 | // generational collectors that means during a collection of |
jmasa@2909 | 132 | // the young gen. |
jmasa@2909 | 133 | virtual bool is_scavengable(const void* addr); |
jmasa@2909 | 134 | |
duke@435 | 135 | // Does this heap support heap inspection? (+PrintClassHistogram) |
duke@435 | 136 | bool supports_heap_inspection() const { return true; } |
duke@435 | 137 | |
duke@435 | 138 | size_t max_capacity() const; |
duke@435 | 139 | |
duke@435 | 140 | // Whether p is in the allocated part of the heap |
duke@435 | 141 | bool is_in(const void* p) const; |
duke@435 | 142 | |
duke@435 | 143 | bool is_in_reserved(const void* p) const; |
duke@435 | 144 | |
jmasa@2909 | 145 | #ifdef ASSERT |
jmasa@2909 | 146 | virtual bool is_in_partial_collection(const void *p); |
jmasa@2909 | 147 | #endif |
jmasa@2909 | 148 | |
coleenp@4037 | 149 | bool is_in_young(oop p); // reserved part |
coleenp@4037 | 150 | bool is_in_old(oop p); // reserved part |
duke@435 | 151 | |
duke@435 | 152 | // Memory allocation. "gc_time_limit_was_exceeded" will |
duke@435 | 153 | // be set to true if the adaptive size policy determine that |
duke@435 | 154 | // an excessive amount of time is being spent doing collections |
duke@435 | 155 | // and caused a NULL to be returned. If a NULL is not returned, |
duke@435 | 156 | // "gc_time_limit_was_exceeded" has an undefined meaning. |
tonyp@2971 | 157 | HeapWord* mem_allocate(size_t size, |
tonyp@2971 | 158 | bool* gc_overhead_limit_was_exceeded); |
duke@435 | 159 | |
tonyp@2971 | 160 | // Allocation attempt(s) during a safepoint. It should never be called |
tonyp@2971 | 161 | // to allocate a new TLAB as this allocation might be satisfied out |
tonyp@2971 | 162 | // of the old generation. |
tonyp@2971 | 163 | HeapWord* failed_mem_allocate(size_t size); |
duke@435 | 164 | |
duke@435 | 165 | // Support for System.gc() |
duke@435 | 166 | void collect(GCCause::Cause cause); |
duke@435 | 167 | |
duke@435 | 168 | // These also should be called by the vm thread at a safepoint (e.g., from a |
duke@435 | 169 | // VM operation). |
duke@435 | 170 | // |
duke@435 | 171 | // The first collects the young generation only, unless the scavenge fails; it |
duke@435 | 172 | // will then attempt a full gc. The second collects the entire heap; if |
duke@435 | 173 | // maximum_compaction is true, it will compact everything and clear all soft |
duke@435 | 174 | // references. |
duke@435 | 175 | inline void invoke_scavenge(); |
coleenp@4037 | 176 | |
coleenp@4037 | 177 | // Perform a full collection |
coleenp@4037 | 178 | virtual void do_full_collection(bool clear_all_soft_refs); |
duke@435 | 179 | |
duke@435 | 180 | bool supports_inline_contig_alloc() const { return !UseNUMA; } |
iveresov@576 | 181 | |
iveresov@576 | 182 | HeapWord** top_addr() const { return !UseNUMA ? young_gen()->top_addr() : (HeapWord**)-1; } |
iveresov@576 | 183 | HeapWord** end_addr() const { return !UseNUMA ? young_gen()->end_addr() : (HeapWord**)-1; } |
duke@435 | 184 | |
duke@435 | 185 | void ensure_parsability(bool retire_tlabs); |
duke@435 | 186 | void accumulate_statistics_all_tlabs(); |
duke@435 | 187 | void resize_all_tlabs(); |
duke@435 | 188 | |
duke@435 | 189 | size_t unsafe_max_alloc(); |
duke@435 | 190 | |
duke@435 | 191 | bool supports_tlab_allocation() const { return true; } |
duke@435 | 192 | |
duke@435 | 193 | size_t tlab_capacity(Thread* thr) const; |
duke@435 | 194 | size_t unsafe_max_tlab_alloc(Thread* thr) const; |
duke@435 | 195 | |
ysr@777 | 196 | // Can a compiler initialize a new object without store barriers? |
ysr@777 | 197 | // This permission only extends from the creation of a new object |
ysr@777 | 198 | // via a TLAB up to the first subsequent safepoint. |
ysr@777 | 199 | virtual bool can_elide_tlab_store_barriers() const { |
ysr@777 | 200 | return true; |
ysr@777 | 201 | } |
ysr@777 | 202 | |
ysr@1601 | 203 | virtual bool card_mark_must_follow_store() const { |
ysr@1601 | 204 | return false; |
ysr@1601 | 205 | } |
ysr@1601 | 206 | |
ysr@1462 | 207 | // Return true if we don't we need a store barrier for |
ysr@1462 | 208 | // initializing stores to an object at this address. |
ysr@1462 | 209 | virtual bool can_elide_initializing_store_barrier(oop new_obj); |
ysr@1462 | 210 | |
coleenp@4037 | 211 | void oop_iterate(ExtendedOopClosure* cl); |
duke@435 | 212 | void object_iterate(ObjectClosure* cl); |
jmasa@952 | 213 | void safe_object_iterate(ObjectClosure* cl) { object_iterate(cl); } |
duke@435 | 214 | |
duke@435 | 215 | HeapWord* block_start(const void* addr) const; |
duke@435 | 216 | size_t block_size(const HeapWord* addr) const; |
duke@435 | 217 | bool block_is_obj(const HeapWord* addr) const; |
duke@435 | 218 | |
duke@435 | 219 | jlong millis_since_last_gc(); |
duke@435 | 220 | |
duke@435 | 221 | void prepare_for_verify(); |
tonyp@3269 | 222 | virtual void print_on(outputStream* st) const; |
stefank@4904 | 223 | virtual void print_on_error(outputStream* st) const; |
duke@435 | 224 | virtual void print_gc_threads_on(outputStream* st) const; |
duke@435 | 225 | virtual void gc_threads_do(ThreadClosure* tc) const; |
duke@435 | 226 | virtual void print_tracing_info() const; |
duke@435 | 227 | |
brutisso@3711 | 228 | void verify(bool silent, VerifyOption option /* ignored */); |
duke@435 | 229 | |
duke@435 | 230 | void print_heap_change(size_t prev_used); |
duke@435 | 231 | |
duke@435 | 232 | // Resize the young generation. The reserved space for the |
duke@435 | 233 | // generation may be expanded in preparation for the resize. |
duke@435 | 234 | void resize_young_gen(size_t eden_size, size_t survivor_size); |
duke@435 | 235 | |
duke@435 | 236 | // Resize the old generation. The reserved space for the |
duke@435 | 237 | // generation may be expanded in preparation for the resize. |
duke@435 | 238 | void resize_old_gen(size_t desired_free_space); |
jmasa@698 | 239 | |
jmasa@698 | 240 | // Save the tops of the spaces in all generations |
jmasa@698 | 241 | void record_gen_tops_before_GC() PRODUCT_RETURN; |
jmasa@698 | 242 | |
jmasa@698 | 243 | // Mangle the unused parts of all spaces in the heap |
jmasa@698 | 244 | void gen_mangle_unused_area() PRODUCT_RETURN; |
jrose@1424 | 245 | |
jrose@1424 | 246 | // Call these in sequential code around the processing of strong roots. |
jrose@1424 | 247 | class ParStrongRootsScope : public MarkingCodeBlobClosure::MarkScope { |
jrose@1424 | 248 | public: |
jrose@1424 | 249 | ParStrongRootsScope(); |
jrose@1424 | 250 | ~ParStrongRootsScope(); |
jrose@1424 | 251 | }; |
duke@435 | 252 | }; |
duke@435 | 253 | |
duke@435 | 254 | inline size_t ParallelScavengeHeap::set_alignment(size_t& var, size_t val) |
duke@435 | 255 | { |
duke@435 | 256 | assert(is_power_of_2((intptr_t)val), "must be a power of 2"); |
jmasa@448 | 257 | var = round_to(val, intra_heap_alignment()); |
duke@435 | 258 | return var; |
duke@435 | 259 | } |
stefank@2314 | 260 | |
stefank@2314 | 261 | #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARALLELSCAVENGEHEAP_HPP |