Wed, 02 Nov 2011 08:04:23 +0100
7106751: G1: gc/gctests/nativeGC03 crashes VM with SIGSEGV
Summary: _cset_rs_update_cl[] was indexed with values beyond what it is set up to handle.
Reviewed-by: ysr, jmasa, johnc
ysr@777 | 1 | /* |
tonyp@2453 | 2 | * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
ysr@777 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
ysr@777 | 4 | * |
ysr@777 | 5 | * This code is free software; you can redistribute it and/or modify it |
ysr@777 | 6 | * under the terms of the GNU General Public License version 2 only, as |
ysr@777 | 7 | * published by the Free Software Foundation. |
ysr@777 | 8 | * |
ysr@777 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
ysr@777 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
ysr@777 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
ysr@777 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
ysr@777 | 13 | * accompanied this code). |
ysr@777 | 14 | * |
ysr@777 | 15 | * You should have received a copy of the GNU General Public License version |
ysr@777 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
ysr@777 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
ysr@777 | 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. |
ysr@777 | 22 | * |
ysr@777 | 23 | */ |
ysr@777 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP |
stefank@2314 | 26 | #define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "gc_implementation/g1/concurrentMark.hpp" |
tonyp@2715 | 29 | #include "gc_implementation/g1/g1AllocRegion.hpp" |
tonyp@2975 | 30 | #include "gc_implementation/g1/g1HRPrinter.hpp" |
stefank@2314 | 31 | #include "gc_implementation/g1/g1RemSet.hpp" |
jmasa@2821 | 32 | #include "gc_implementation/g1/g1MonitoringSupport.hpp" |
tonyp@2963 | 33 | #include "gc_implementation/g1/heapRegionSeq.hpp" |
tonyp@2472 | 34 | #include "gc_implementation/g1/heapRegionSets.hpp" |
jmasa@2821 | 35 | #include "gc_implementation/shared/hSpaceCounters.hpp" |
stefank@2314 | 36 | #include "gc_implementation/parNew/parGCAllocBuffer.hpp" |
stefank@2314 | 37 | #include "memory/barrierSet.hpp" |
stefank@2314 | 38 | #include "memory/memRegion.hpp" |
stefank@2314 | 39 | #include "memory/sharedHeap.hpp" |
stefank@2314 | 40 | |
ysr@777 | 41 | // A "G1CollectedHeap" is an implementation of a java heap for HotSpot. |
ysr@777 | 42 | // It uses the "Garbage First" heap organization and algorithm, which |
ysr@777 | 43 | // may combine concurrent marking with parallel, incremental compaction of |
ysr@777 | 44 | // heap subsets that will yield large amounts of garbage. |
ysr@777 | 45 | |
ysr@777 | 46 | class HeapRegion; |
tonyp@2493 | 47 | class HRRSCleanupTask; |
ysr@777 | 48 | class PermanentGenerationSpec; |
ysr@777 | 49 | class GenerationSpec; |
ysr@777 | 50 | class OopsInHeapRegionClosure; |
ysr@777 | 51 | class G1ScanHeapEvacClosure; |
ysr@777 | 52 | class ObjectClosure; |
ysr@777 | 53 | class SpaceClosure; |
ysr@777 | 54 | class CompactibleSpaceClosure; |
ysr@777 | 55 | class Space; |
ysr@777 | 56 | class G1CollectorPolicy; |
ysr@777 | 57 | class GenRemSet; |
ysr@777 | 58 | class G1RemSet; |
ysr@777 | 59 | class HeapRegionRemSetIterator; |
ysr@777 | 60 | class ConcurrentMark; |
ysr@777 | 61 | class ConcurrentMarkThread; |
ysr@777 | 62 | class ConcurrentG1Refine; |
jmasa@2821 | 63 | class GenerationCounters; |
ysr@777 | 64 | |
jcoomes@2064 | 65 | typedef OverflowTaskQueue<StarTask> RefToScanQueue; |
jcoomes@1746 | 66 | typedef GenericTaskQueueSet<RefToScanQueue> RefToScanQueueSet; |
ysr@777 | 67 | |
johnc@1242 | 68 | typedef int RegionIdx_t; // needs to hold [ 0..max_regions() ) |
johnc@1242 | 69 | typedef int CardIdx_t; // needs to hold [ 0..CardsPerRegion ) |
johnc@1242 | 70 | |
ysr@777 | 71 | enum GCAllocPurpose { |
ysr@777 | 72 | GCAllocForTenured, |
ysr@777 | 73 | GCAllocForSurvived, |
ysr@777 | 74 | GCAllocPurposeCount |
ysr@777 | 75 | }; |
ysr@777 | 76 | |
ysr@777 | 77 | class YoungList : public CHeapObj { |
ysr@777 | 78 | private: |
ysr@777 | 79 | G1CollectedHeap* _g1h; |
ysr@777 | 80 | |
ysr@777 | 81 | HeapRegion* _head; |
ysr@777 | 82 | |
johnc@1829 | 83 | HeapRegion* _survivor_head; |
johnc@1829 | 84 | HeapRegion* _survivor_tail; |
johnc@1829 | 85 | |
johnc@1829 | 86 | HeapRegion* _curr; |
johnc@1829 | 87 | |
ysr@777 | 88 | size_t _length; |
johnc@1829 | 89 | size_t _survivor_length; |
ysr@777 | 90 | |
ysr@777 | 91 | size_t _last_sampled_rs_lengths; |
ysr@777 | 92 | size_t _sampled_rs_lengths; |
ysr@777 | 93 | |
johnc@1829 | 94 | void empty_list(HeapRegion* list); |
ysr@777 | 95 | |
ysr@777 | 96 | public: |
ysr@777 | 97 | YoungList(G1CollectedHeap* g1h); |
ysr@777 | 98 | |
johnc@1829 | 99 | void push_region(HeapRegion* hr); |
johnc@1829 | 100 | void add_survivor_region(HeapRegion* hr); |
johnc@1829 | 101 | |
johnc@1829 | 102 | void empty_list(); |
johnc@1829 | 103 | bool is_empty() { return _length == 0; } |
johnc@1829 | 104 | size_t length() { return _length; } |
johnc@1829 | 105 | size_t survivor_length() { return _survivor_length; } |
ysr@777 | 106 | |
tonyp@2961 | 107 | // Currently we do not keep track of the used byte sum for the |
tonyp@2961 | 108 | // young list and the survivors and it'd be quite a lot of work to |
tonyp@2961 | 109 | // do so. When we'll eventually replace the young list with |
tonyp@2961 | 110 | // instances of HeapRegionLinkedList we'll get that for free. So, |
tonyp@2961 | 111 | // we'll report the more accurate information then. |
tonyp@2961 | 112 | size_t eden_used_bytes() { |
tonyp@2961 | 113 | assert(length() >= survivor_length(), "invariant"); |
tonyp@2961 | 114 | return (length() - survivor_length()) * HeapRegion::GrainBytes; |
tonyp@2961 | 115 | } |
tonyp@2961 | 116 | size_t survivor_used_bytes() { |
tonyp@2961 | 117 | return survivor_length() * HeapRegion::GrainBytes; |
tonyp@2961 | 118 | } |
tonyp@2961 | 119 | |
ysr@777 | 120 | void rs_length_sampling_init(); |
ysr@777 | 121 | bool rs_length_sampling_more(); |
ysr@777 | 122 | void rs_length_sampling_next(); |
ysr@777 | 123 | |
ysr@777 | 124 | void reset_sampled_info() { |
ysr@777 | 125 | _last_sampled_rs_lengths = 0; |
ysr@777 | 126 | } |
ysr@777 | 127 | size_t sampled_rs_lengths() { return _last_sampled_rs_lengths; } |
ysr@777 | 128 | |
ysr@777 | 129 | // for development purposes |
ysr@777 | 130 | void reset_auxilary_lists(); |
johnc@1829 | 131 | void clear() { _head = NULL; _length = 0; } |
johnc@1829 | 132 | |
johnc@1829 | 133 | void clear_survivors() { |
johnc@1829 | 134 | _survivor_head = NULL; |
johnc@1829 | 135 | _survivor_tail = NULL; |
johnc@1829 | 136 | _survivor_length = 0; |
johnc@1829 | 137 | } |
johnc@1829 | 138 | |
ysr@777 | 139 | HeapRegion* first_region() { return _head; } |
ysr@777 | 140 | HeapRegion* first_survivor_region() { return _survivor_head; } |
apetrusenko@980 | 141 | HeapRegion* last_survivor_region() { return _survivor_tail; } |
ysr@777 | 142 | |
ysr@777 | 143 | // debugging |
ysr@777 | 144 | bool check_list_well_formed(); |
johnc@1829 | 145 | bool check_list_empty(bool check_sample = true); |
ysr@777 | 146 | void print(); |
ysr@777 | 147 | }; |
ysr@777 | 148 | |
tonyp@2715 | 149 | class MutatorAllocRegion : public G1AllocRegion { |
tonyp@2715 | 150 | protected: |
tonyp@2715 | 151 | virtual HeapRegion* allocate_new_region(size_t word_size, bool force); |
tonyp@2715 | 152 | virtual void retire_region(HeapRegion* alloc_region, size_t allocated_bytes); |
tonyp@2715 | 153 | public: |
tonyp@2715 | 154 | MutatorAllocRegion() |
tonyp@2715 | 155 | : G1AllocRegion("Mutator Alloc Region", false /* bot_updates */) { } |
tonyp@2715 | 156 | }; |
tonyp@2715 | 157 | |
johnc@3175 | 158 | // The G1 STW is alive closure. |
johnc@3175 | 159 | // An instance is embedded into the G1CH and used as the |
johnc@3175 | 160 | // (optional) _is_alive_non_header closure in the STW |
johnc@3175 | 161 | // reference processor. It is also extensively used during |
johnc@3175 | 162 | // refence processing during STW evacuation pauses. |
johnc@3175 | 163 | class G1STWIsAliveClosure: public BoolObjectClosure { |
johnc@3175 | 164 | G1CollectedHeap* _g1; |
johnc@3175 | 165 | public: |
johnc@3175 | 166 | G1STWIsAliveClosure(G1CollectedHeap* g1) : _g1(g1) {} |
johnc@3175 | 167 | void do_object(oop p) { assert(false, "Do not call."); } |
johnc@3175 | 168 | bool do_object_b(oop p); |
johnc@3175 | 169 | }; |
johnc@3175 | 170 | |
tonyp@3028 | 171 | class SurvivorGCAllocRegion : public G1AllocRegion { |
tonyp@3028 | 172 | protected: |
tonyp@3028 | 173 | virtual HeapRegion* allocate_new_region(size_t word_size, bool force); |
tonyp@3028 | 174 | virtual void retire_region(HeapRegion* alloc_region, size_t allocated_bytes); |
tonyp@3028 | 175 | public: |
tonyp@3028 | 176 | SurvivorGCAllocRegion() |
tonyp@3028 | 177 | : G1AllocRegion("Survivor GC Alloc Region", false /* bot_updates */) { } |
tonyp@3028 | 178 | }; |
tonyp@3028 | 179 | |
tonyp@3028 | 180 | class OldGCAllocRegion : public G1AllocRegion { |
tonyp@3028 | 181 | protected: |
tonyp@3028 | 182 | virtual HeapRegion* allocate_new_region(size_t word_size, bool force); |
tonyp@3028 | 183 | virtual void retire_region(HeapRegion* alloc_region, size_t allocated_bytes); |
tonyp@3028 | 184 | public: |
tonyp@3028 | 185 | OldGCAllocRegion() |
tonyp@3028 | 186 | : G1AllocRegion("Old GC Alloc Region", true /* bot_updates */) { } |
tonyp@3028 | 187 | }; |
tonyp@3028 | 188 | |
ysr@777 | 189 | class RefineCardTableEntryClosure; |
johnc@3175 | 190 | |
ysr@777 | 191 | class G1CollectedHeap : public SharedHeap { |
ysr@777 | 192 | friend class VM_G1CollectForAllocation; |
ysr@777 | 193 | friend class VM_GenCollectForPermanentAllocation; |
ysr@777 | 194 | friend class VM_G1CollectFull; |
ysr@777 | 195 | friend class VM_G1IncCollectionPause; |
ysr@777 | 196 | friend class VMStructs; |
tonyp@2715 | 197 | friend class MutatorAllocRegion; |
tonyp@3028 | 198 | friend class SurvivorGCAllocRegion; |
tonyp@3028 | 199 | friend class OldGCAllocRegion; |
ysr@777 | 200 | |
ysr@777 | 201 | // Closures used in implementation. |
ysr@777 | 202 | friend class G1ParCopyHelper; |
ysr@777 | 203 | friend class G1IsAliveClosure; |
ysr@777 | 204 | friend class G1EvacuateFollowersClosure; |
ysr@777 | 205 | friend class G1ParScanThreadState; |
ysr@777 | 206 | friend class G1ParScanClosureSuper; |
ysr@777 | 207 | friend class G1ParEvacuateFollowersClosure; |
ysr@777 | 208 | friend class G1ParTask; |
ysr@777 | 209 | friend class G1FreeGarbageRegionClosure; |
ysr@777 | 210 | friend class RefineCardTableEntryClosure; |
ysr@777 | 211 | friend class G1PrepareCompactClosure; |
ysr@777 | 212 | friend class RegionSorter; |
tonyp@2472 | 213 | friend class RegionResetter; |
ysr@777 | 214 | friend class CountRCClosure; |
ysr@777 | 215 | friend class EvacPopObjClosure; |
apetrusenko@1231 | 216 | friend class G1ParCleanupCTTask; |
ysr@777 | 217 | |
ysr@777 | 218 | // Other related classes. |
ysr@777 | 219 | friend class G1MarkSweep; |
ysr@777 | 220 | |
ysr@777 | 221 | private: |
ysr@777 | 222 | // The one and only G1CollectedHeap, so static functions can find it. |
ysr@777 | 223 | static G1CollectedHeap* _g1h; |
ysr@777 | 224 | |
tonyp@1377 | 225 | static size_t _humongous_object_threshold_in_words; |
tonyp@1377 | 226 | |
ysr@777 | 227 | // Storage for the G1 heap (excludes the permanent generation). |
ysr@777 | 228 | VirtualSpace _g1_storage; |
ysr@777 | 229 | MemRegion _g1_reserved; |
ysr@777 | 230 | |
ysr@777 | 231 | // The part of _g1_storage that is currently committed. |
ysr@777 | 232 | MemRegion _g1_committed; |
ysr@777 | 233 | |
tonyp@2472 | 234 | // The master free list. It will satisfy all new region allocations. |
tonyp@2472 | 235 | MasterFreeRegionList _free_list; |
tonyp@2472 | 236 | |
tonyp@2472 | 237 | // The secondary free list which contains regions that have been |
tonyp@2472 | 238 | // freed up during the cleanup process. This will be appended to the |
tonyp@2472 | 239 | // master free list when appropriate. |
tonyp@2472 | 240 | SecondaryFreeRegionList _secondary_free_list; |
tonyp@2472 | 241 | |
tonyp@2472 | 242 | // It keeps track of the humongous regions. |
tonyp@2472 | 243 | MasterHumongousRegionSet _humongous_set; |
ysr@777 | 244 | |
ysr@777 | 245 | // The number of regions we could create by expansion. |
ysr@777 | 246 | size_t _expansion_regions; |
ysr@777 | 247 | |
ysr@777 | 248 | // The block offset table for the G1 heap. |
ysr@777 | 249 | G1BlockOffsetSharedArray* _bot_shared; |
ysr@777 | 250 | |
ysr@777 | 251 | // Move all of the regions off the free lists, then rebuild those free |
ysr@777 | 252 | // lists, before and after full GC. |
ysr@777 | 253 | void tear_down_region_lists(); |
ysr@777 | 254 | void rebuild_region_lists(); |
ysr@777 | 255 | |
ysr@777 | 256 | // The sequence of all heap regions in the heap. |
tonyp@2963 | 257 | HeapRegionSeq _hrs; |
ysr@777 | 258 | |
tonyp@2715 | 259 | // Alloc region used to satisfy mutator allocation requests. |
tonyp@2715 | 260 | MutatorAllocRegion _mutator_alloc_region; |
ysr@777 | 261 | |
tonyp@3028 | 262 | // Alloc region used to satisfy allocation requests by the GC for |
tonyp@3028 | 263 | // survivor objects. |
tonyp@3028 | 264 | SurvivorGCAllocRegion _survivor_gc_alloc_region; |
tonyp@3028 | 265 | |
tonyp@3028 | 266 | // Alloc region used to satisfy allocation requests by the GC for |
tonyp@3028 | 267 | // old objects. |
tonyp@3028 | 268 | OldGCAllocRegion _old_gc_alloc_region; |
tonyp@3028 | 269 | |
tonyp@3028 | 270 | // The last old region we allocated to during the last GC. |
tonyp@3028 | 271 | // Typically, it is not full so we should re-use it during the next GC. |
tonyp@3028 | 272 | HeapRegion* _retained_old_gc_alloc_region; |
tonyp@3028 | 273 | |
tonyp@2715 | 274 | // It resets the mutator alloc region before new allocations can take place. |
tonyp@2715 | 275 | void init_mutator_alloc_region(); |
tonyp@2715 | 276 | |
tonyp@2715 | 277 | // It releases the mutator alloc region. |
tonyp@2715 | 278 | void release_mutator_alloc_region(); |
tonyp@2715 | 279 | |
tonyp@3028 | 280 | // It initializes the GC alloc regions at the start of a GC. |
tonyp@3028 | 281 | void init_gc_alloc_regions(); |
tonyp@3028 | 282 | |
tonyp@3028 | 283 | // It releases the GC alloc regions at the end of a GC. |
tonyp@3028 | 284 | void release_gc_alloc_regions(); |
tonyp@3028 | 285 | |
tonyp@3028 | 286 | // It does any cleanup that needs to be done on the GC alloc regions |
tonyp@3028 | 287 | // before a Full GC. |
tonyp@1071 | 288 | void abandon_gc_alloc_regions(); |
ysr@777 | 289 | |
jmasa@2821 | 290 | // Helper for monitoring and management support. |
jmasa@2821 | 291 | G1MonitoringSupport* _g1mm; |
jmasa@2821 | 292 | |
apetrusenko@1826 | 293 | // Determines PLAB size for a particular allocation purpose. |
apetrusenko@1826 | 294 | static size_t desired_plab_sz(GCAllocPurpose purpose); |
apetrusenko@1826 | 295 | |
ysr@777 | 296 | // Outside of GC pauses, the number of bytes used in all regions other |
ysr@777 | 297 | // than the current allocation region. |
ysr@777 | 298 | size_t _summary_bytes_used; |
ysr@777 | 299 | |
tonyp@961 | 300 | // This is used for a quick test on whether a reference points into |
tonyp@961 | 301 | // the collection set or not. Basically, we have an array, with one |
tonyp@961 | 302 | // byte per region, and that byte denotes whether the corresponding |
tonyp@961 | 303 | // region is in the collection set or not. The entry corresponding |
tonyp@961 | 304 | // the bottom of the heap, i.e., region 0, is pointed to by |
tonyp@961 | 305 | // _in_cset_fast_test_base. The _in_cset_fast_test field has been |
tonyp@961 | 306 | // biased so that it actually points to address 0 of the address |
tonyp@961 | 307 | // space, to make the test as fast as possible (we can simply shift |
tonyp@961 | 308 | // the address to address into it, instead of having to subtract the |
tonyp@961 | 309 | // bottom of the heap from the address before shifting it; basically |
tonyp@961 | 310 | // it works in the same way the card table works). |
tonyp@961 | 311 | bool* _in_cset_fast_test; |
tonyp@961 | 312 | |
tonyp@961 | 313 | // The allocated array used for the fast test on whether a reference |
tonyp@961 | 314 | // points into the collection set or not. This field is also used to |
tonyp@961 | 315 | // free the array. |
tonyp@961 | 316 | bool* _in_cset_fast_test_base; |
tonyp@961 | 317 | |
tonyp@961 | 318 | // The length of the _in_cset_fast_test_base array. |
tonyp@961 | 319 | size_t _in_cset_fast_test_length; |
tonyp@961 | 320 | |
iveresov@788 | 321 | volatile unsigned _gc_time_stamp; |
ysr@777 | 322 | |
ysr@777 | 323 | size_t* _surviving_young_words; |
ysr@777 | 324 | |
tonyp@2975 | 325 | G1HRPrinter _hr_printer; |
tonyp@2975 | 326 | |
ysr@777 | 327 | void setup_surviving_young_words(); |
ysr@777 | 328 | void update_surviving_young_words(size_t* surv_young_words); |
ysr@777 | 329 | void cleanup_surviving_young_words(); |
ysr@777 | 330 | |
tonyp@2011 | 331 | // It decides whether an explicit GC should start a concurrent cycle |
tonyp@2011 | 332 | // instead of doing a STW GC. Currently, a concurrent cycle is |
tonyp@2011 | 333 | // explicitly started if: |
tonyp@2011 | 334 | // (a) cause == _gc_locker and +GCLockerInvokesConcurrent, or |
tonyp@2011 | 335 | // (b) cause == _java_lang_system_gc and +ExplicitGCInvokesConcurrent. |
tonyp@2011 | 336 | bool should_do_concurrent_full_gc(GCCause::Cause cause); |
tonyp@2011 | 337 | |
tonyp@2011 | 338 | // Keeps track of how many "full collections" (i.e., Full GCs or |
tonyp@2011 | 339 | // concurrent cycles) we have completed. The number of them we have |
tonyp@2011 | 340 | // started is maintained in _total_full_collections in CollectedHeap. |
tonyp@2011 | 341 | volatile unsigned int _full_collections_completed; |
tonyp@2011 | 342 | |
tonyp@2817 | 343 | // This is a non-product method that is helpful for testing. It is |
tonyp@2817 | 344 | // called at the end of a GC and artificially expands the heap by |
tonyp@2817 | 345 | // allocating a number of dead regions. This way we can induce very |
tonyp@2817 | 346 | // frequent marking cycles and stress the cleanup / concurrent |
tonyp@2817 | 347 | // cleanup code more (as all the regions that will be allocated by |
tonyp@2817 | 348 | // this method will be found dead by the marking cycle). |
tonyp@2817 | 349 | void allocate_dummy_regions() PRODUCT_RETURN; |
tonyp@2817 | 350 | |
tonyp@2315 | 351 | // These are macros so that, if the assert fires, we get the correct |
tonyp@2315 | 352 | // line number, file, etc. |
tonyp@2315 | 353 | |
tonyp@2643 | 354 | #define heap_locking_asserts_err_msg(_extra_message_) \ |
tonyp@2472 | 355 | err_msg("%s : Heap_lock locked: %s, at safepoint: %s, is VM thread: %s", \ |
tonyp@2643 | 356 | (_extra_message_), \ |
tonyp@2472 | 357 | BOOL_TO_STR(Heap_lock->owned_by_self()), \ |
tonyp@2472 | 358 | BOOL_TO_STR(SafepointSynchronize::is_at_safepoint()), \ |
tonyp@2472 | 359 | BOOL_TO_STR(Thread::current()->is_VM_thread())) |
tonyp@2315 | 360 | |
tonyp@2315 | 361 | #define assert_heap_locked() \ |
tonyp@2315 | 362 | do { \ |
tonyp@2315 | 363 | assert(Heap_lock->owned_by_self(), \ |
tonyp@2315 | 364 | heap_locking_asserts_err_msg("should be holding the Heap_lock")); \ |
tonyp@2315 | 365 | } while (0) |
tonyp@2315 | 366 | |
tonyp@2643 | 367 | #define assert_heap_locked_or_at_safepoint(_should_be_vm_thread_) \ |
tonyp@2315 | 368 | do { \ |
tonyp@2315 | 369 | assert(Heap_lock->owned_by_self() || \ |
tonyp@2472 | 370 | (SafepointSynchronize::is_at_safepoint() && \ |
tonyp@2643 | 371 | ((_should_be_vm_thread_) == Thread::current()->is_VM_thread())), \ |
tonyp@2315 | 372 | heap_locking_asserts_err_msg("should be holding the Heap_lock or " \ |
tonyp@2315 | 373 | "should be at a safepoint")); \ |
tonyp@2315 | 374 | } while (0) |
tonyp@2315 | 375 | |
tonyp@2315 | 376 | #define assert_heap_locked_and_not_at_safepoint() \ |
tonyp@2315 | 377 | do { \ |
tonyp@2315 | 378 | assert(Heap_lock->owned_by_self() && \ |
tonyp@2315 | 379 | !SafepointSynchronize::is_at_safepoint(), \ |
tonyp@2315 | 380 | heap_locking_asserts_err_msg("should be holding the Heap_lock and " \ |
tonyp@2315 | 381 | "should not be at a safepoint")); \ |
tonyp@2315 | 382 | } while (0) |
tonyp@2315 | 383 | |
tonyp@2315 | 384 | #define assert_heap_not_locked() \ |
tonyp@2315 | 385 | do { \ |
tonyp@2315 | 386 | assert(!Heap_lock->owned_by_self(), \ |
tonyp@2315 | 387 | heap_locking_asserts_err_msg("should not be holding the Heap_lock")); \ |
tonyp@2315 | 388 | } while (0) |
tonyp@2315 | 389 | |
tonyp@2315 | 390 | #define assert_heap_not_locked_and_not_at_safepoint() \ |
tonyp@2315 | 391 | do { \ |
tonyp@2315 | 392 | assert(!Heap_lock->owned_by_self() && \ |
tonyp@2315 | 393 | !SafepointSynchronize::is_at_safepoint(), \ |
tonyp@2315 | 394 | heap_locking_asserts_err_msg("should not be holding the Heap_lock and " \ |
tonyp@2315 | 395 | "should not be at a safepoint")); \ |
tonyp@2315 | 396 | } while (0) |
tonyp@2315 | 397 | |
tonyp@2643 | 398 | #define assert_at_safepoint(_should_be_vm_thread_) \ |
tonyp@2315 | 399 | do { \ |
tonyp@2472 | 400 | assert(SafepointSynchronize::is_at_safepoint() && \ |
tonyp@2643 | 401 | ((_should_be_vm_thread_) == Thread::current()->is_VM_thread()), \ |
tonyp@2315 | 402 | heap_locking_asserts_err_msg("should be at a safepoint")); \ |
tonyp@2315 | 403 | } while (0) |
tonyp@2315 | 404 | |
tonyp@2315 | 405 | #define assert_not_at_safepoint() \ |
tonyp@2315 | 406 | do { \ |
tonyp@2315 | 407 | assert(!SafepointSynchronize::is_at_safepoint(), \ |
tonyp@2315 | 408 | heap_locking_asserts_err_msg("should not be at a safepoint")); \ |
tonyp@2315 | 409 | } while (0) |
tonyp@2315 | 410 | |
ysr@777 | 411 | protected: |
ysr@777 | 412 | |
johnc@3021 | 413 | // The young region list. |
ysr@777 | 414 | YoungList* _young_list; |
ysr@777 | 415 | |
ysr@777 | 416 | // The current policy object for the collector. |
ysr@777 | 417 | G1CollectorPolicy* _g1_policy; |
ysr@777 | 418 | |
tonyp@2472 | 419 | // This is the second level of trying to allocate a new region. If |
tonyp@2715 | 420 | // new_region() didn't find a region on the free_list, this call will |
tonyp@2715 | 421 | // check whether there's anything available on the |
tonyp@2715 | 422 | // secondary_free_list and/or wait for more regions to appear on |
tonyp@2715 | 423 | // that list, if _free_regions_coming is set. |
tonyp@2643 | 424 | HeapRegion* new_region_try_secondary_free_list(); |
ysr@777 | 425 | |
tonyp@2643 | 426 | // Try to allocate a single non-humongous HeapRegion sufficient for |
tonyp@2643 | 427 | // an allocation of the given word_size. If do_expand is true, |
tonyp@2643 | 428 | // attempt to expand the heap if necessary to satisfy the allocation |
tonyp@2643 | 429 | // request. |
tonyp@2715 | 430 | HeapRegion* new_region(size_t word_size, bool do_expand); |
ysr@777 | 431 | |
tonyp@2643 | 432 | // Attempt to satisfy a humongous allocation request of the given |
tonyp@2643 | 433 | // size by finding a contiguous set of free regions of num_regions |
tonyp@2643 | 434 | // length and remove them from the master free list. Return the |
tonyp@2963 | 435 | // index of the first region or G1_NULL_HRS_INDEX if the search |
tonyp@2963 | 436 | // was unsuccessful. |
tonyp@2963 | 437 | size_t humongous_obj_allocate_find_first(size_t num_regions, |
tonyp@2963 | 438 | size_t word_size); |
ysr@777 | 439 | |
tonyp@2643 | 440 | // Initialize a contiguous set of free regions of length num_regions |
tonyp@2643 | 441 | // and starting at index first so that they appear as a single |
tonyp@2643 | 442 | // humongous region. |
tonyp@2963 | 443 | HeapWord* humongous_obj_allocate_initialize_regions(size_t first, |
tonyp@2643 | 444 | size_t num_regions, |
tonyp@2643 | 445 | size_t word_size); |
tonyp@2643 | 446 | |
tonyp@2643 | 447 | // Attempt to allocate a humongous object of the given size. Return |
tonyp@2643 | 448 | // NULL if unsuccessful. |
tonyp@2472 | 449 | HeapWord* humongous_obj_allocate(size_t word_size); |
ysr@777 | 450 | |
tonyp@2315 | 451 | // The following two methods, allocate_new_tlab() and |
tonyp@2315 | 452 | // mem_allocate(), are the two main entry points from the runtime |
tonyp@2315 | 453 | // into the G1's allocation routines. They have the following |
tonyp@2315 | 454 | // assumptions: |
tonyp@2315 | 455 | // |
tonyp@2315 | 456 | // * They should both be called outside safepoints. |
tonyp@2315 | 457 | // |
tonyp@2315 | 458 | // * They should both be called without holding the Heap_lock. |
tonyp@2315 | 459 | // |
tonyp@2315 | 460 | // * All allocation requests for new TLABs should go to |
tonyp@2315 | 461 | // allocate_new_tlab(). |
tonyp@2315 | 462 | // |
tonyp@2971 | 463 | // * All non-TLAB allocation requests should go to mem_allocate(). |
tonyp@2315 | 464 | // |
tonyp@2315 | 465 | // * If either call cannot satisfy the allocation request using the |
tonyp@2315 | 466 | // current allocating region, they will try to get a new one. If |
tonyp@2315 | 467 | // this fails, they will attempt to do an evacuation pause and |
tonyp@2315 | 468 | // retry the allocation. |
tonyp@2315 | 469 | // |
tonyp@2315 | 470 | // * If all allocation attempts fail, even after trying to schedule |
tonyp@2315 | 471 | // an evacuation pause, allocate_new_tlab() will return NULL, |
tonyp@2315 | 472 | // whereas mem_allocate() will attempt a heap expansion and/or |
tonyp@2315 | 473 | // schedule a Full GC. |
tonyp@2315 | 474 | // |
tonyp@2315 | 475 | // * We do not allow humongous-sized TLABs. So, allocate_new_tlab |
tonyp@2315 | 476 | // should never be called with word_size being humongous. All |
tonyp@2315 | 477 | // humongous allocation requests should go to mem_allocate() which |
tonyp@2315 | 478 | // will satisfy them with a special path. |
ysr@777 | 479 | |
tonyp@2315 | 480 | virtual HeapWord* allocate_new_tlab(size_t word_size); |
tonyp@2315 | 481 | |
tonyp@2315 | 482 | virtual HeapWord* mem_allocate(size_t word_size, |
tonyp@2315 | 483 | bool* gc_overhead_limit_was_exceeded); |
tonyp@2315 | 484 | |
tonyp@2715 | 485 | // The following three methods take a gc_count_before_ret |
tonyp@2715 | 486 | // parameter which is used to return the GC count if the method |
tonyp@2715 | 487 | // returns NULL. Given that we are required to read the GC count |
tonyp@2715 | 488 | // while holding the Heap_lock, and these paths will take the |
tonyp@2715 | 489 | // Heap_lock at some point, it's easier to get them to read the GC |
tonyp@2715 | 490 | // count while holding the Heap_lock before they return NULL instead |
tonyp@2715 | 491 | // of the caller (namely: mem_allocate()) having to also take the |
tonyp@2715 | 492 | // Heap_lock just to read the GC count. |
tonyp@2315 | 493 | |
tonyp@2715 | 494 | // First-level mutator allocation attempt: try to allocate out of |
tonyp@2715 | 495 | // the mutator alloc region without taking the Heap_lock. This |
tonyp@2715 | 496 | // should only be used for non-humongous allocations. |
tonyp@2715 | 497 | inline HeapWord* attempt_allocation(size_t word_size, |
tonyp@2715 | 498 | unsigned int* gc_count_before_ret); |
tonyp@2315 | 499 | |
tonyp@2715 | 500 | // Second-level mutator allocation attempt: take the Heap_lock and |
tonyp@2715 | 501 | // retry the allocation attempt, potentially scheduling a GC |
tonyp@2715 | 502 | // pause. This should only be used for non-humongous allocations. |
tonyp@2715 | 503 | HeapWord* attempt_allocation_slow(size_t word_size, |
tonyp@2715 | 504 | unsigned int* gc_count_before_ret); |
tonyp@2315 | 505 | |
tonyp@2715 | 506 | // Takes the Heap_lock and attempts a humongous allocation. It can |
tonyp@2715 | 507 | // potentially schedule a GC pause. |
tonyp@2715 | 508 | HeapWord* attempt_allocation_humongous(size_t word_size, |
tonyp@2715 | 509 | unsigned int* gc_count_before_ret); |
tonyp@2454 | 510 | |
tonyp@2715 | 511 | // Allocation attempt that should be called during safepoints (e.g., |
tonyp@2715 | 512 | // at the end of a successful GC). expect_null_mutator_alloc_region |
tonyp@2715 | 513 | // specifies whether the mutator alloc region is expected to be NULL |
tonyp@2715 | 514 | // or not. |
tonyp@2315 | 515 | HeapWord* attempt_allocation_at_safepoint(size_t word_size, |
tonyp@2715 | 516 | bool expect_null_mutator_alloc_region); |
tonyp@2315 | 517 | |
tonyp@2315 | 518 | // It dirties the cards that cover the block so that so that the post |
tonyp@2315 | 519 | // write barrier never queues anything when updating objects on this |
tonyp@2315 | 520 | // block. It is assumed (and in fact we assert) that the block |
tonyp@2315 | 521 | // belongs to a young region. |
tonyp@2315 | 522 | inline void dirty_young_block(HeapWord* start, size_t word_size); |
ysr@777 | 523 | |
ysr@777 | 524 | // Allocate blocks during garbage collection. Will ensure an |
ysr@777 | 525 | // allocation region, either by picking one or expanding the |
ysr@777 | 526 | // heap, and then allocate a block of the given size. The block |
ysr@777 | 527 | // may not be a humongous - it must fit into a single heap region. |
ysr@777 | 528 | HeapWord* par_allocate_during_gc(GCAllocPurpose purpose, size_t word_size); |
ysr@777 | 529 | |
ysr@777 | 530 | HeapWord* allocate_during_gc_slow(GCAllocPurpose purpose, |
ysr@777 | 531 | HeapRegion* alloc_region, |
ysr@777 | 532 | bool par, |
ysr@777 | 533 | size_t word_size); |
ysr@777 | 534 | |
ysr@777 | 535 | // Ensure that no further allocations can happen in "r", bearing in mind |
ysr@777 | 536 | // that parallel threads might be attempting allocations. |
ysr@777 | 537 | void par_allocate_remaining_space(HeapRegion* r); |
ysr@777 | 538 | |
tonyp@3028 | 539 | // Allocation attempt during GC for a survivor object / PLAB. |
tonyp@3028 | 540 | inline HeapWord* survivor_attempt_allocation(size_t word_size); |
apetrusenko@980 | 541 | |
tonyp@3028 | 542 | // Allocation attempt during GC for an old object / PLAB. |
tonyp@3028 | 543 | inline HeapWord* old_attempt_allocation(size_t word_size); |
tonyp@2715 | 544 | |
tonyp@3028 | 545 | // These methods are the "callbacks" from the G1AllocRegion class. |
tonyp@3028 | 546 | |
tonyp@3028 | 547 | // For mutator alloc regions. |
tonyp@2715 | 548 | HeapRegion* new_mutator_alloc_region(size_t word_size, bool force); |
tonyp@2715 | 549 | void retire_mutator_alloc_region(HeapRegion* alloc_region, |
tonyp@2715 | 550 | size_t allocated_bytes); |
tonyp@2715 | 551 | |
tonyp@3028 | 552 | // For GC alloc regions. |
tonyp@3028 | 553 | HeapRegion* new_gc_alloc_region(size_t word_size, size_t count, |
tonyp@3028 | 554 | GCAllocPurpose ap); |
tonyp@3028 | 555 | void retire_gc_alloc_region(HeapRegion* alloc_region, |
tonyp@3028 | 556 | size_t allocated_bytes, GCAllocPurpose ap); |
tonyp@3028 | 557 | |
tonyp@2011 | 558 | // - if explicit_gc is true, the GC is for a System.gc() or a heap |
tonyp@2315 | 559 | // inspection request and should collect the entire heap |
tonyp@2315 | 560 | // - if clear_all_soft_refs is true, all soft references should be |
tonyp@2315 | 561 | // cleared during the GC |
tonyp@2011 | 562 | // - if explicit_gc is false, word_size describes the allocation that |
tonyp@2315 | 563 | // the GC should attempt (at least) to satisfy |
tonyp@2315 | 564 | // - it returns false if it is unable to do the collection due to the |
tonyp@2315 | 565 | // GC locker being active, true otherwise |
tonyp@2315 | 566 | bool do_collection(bool explicit_gc, |
tonyp@2011 | 567 | bool clear_all_soft_refs, |
ysr@777 | 568 | size_t word_size); |
ysr@777 | 569 | |
ysr@777 | 570 | // Callback from VM_G1CollectFull operation. |
ysr@777 | 571 | // Perform a full collection. |
ysr@777 | 572 | void do_full_collection(bool clear_all_soft_refs); |
ysr@777 | 573 | |
ysr@777 | 574 | // Resize the heap if necessary after a full collection. If this is |
ysr@777 | 575 | // after a collect-for allocation, "word_size" is the allocation size, |
ysr@777 | 576 | // and will be considered part of the used portion of the heap. |
ysr@777 | 577 | void resize_if_necessary_after_full_collection(size_t word_size); |
ysr@777 | 578 | |
ysr@777 | 579 | // Callback from VM_G1CollectForAllocation operation. |
ysr@777 | 580 | // This function does everything necessary/possible to satisfy a |
ysr@777 | 581 | // failed allocation request (including collection, expansion, etc.) |
tonyp@2315 | 582 | HeapWord* satisfy_failed_allocation(size_t word_size, bool* succeeded); |
ysr@777 | 583 | |
ysr@777 | 584 | // Attempting to expand the heap sufficiently |
ysr@777 | 585 | // to support an allocation of the given "word_size". If |
ysr@777 | 586 | // successful, perform the allocation and return the address of the |
ysr@777 | 587 | // allocated block, or else "NULL". |
tonyp@2315 | 588 | HeapWord* expand_and_allocate(size_t word_size); |
ysr@777 | 589 | |
johnc@3175 | 590 | // Process any reference objects discovered during |
johnc@3175 | 591 | // an incremental evacuation pause. |
johnc@3175 | 592 | void process_discovered_references(); |
johnc@3175 | 593 | |
johnc@3175 | 594 | // Enqueue any remaining discovered references |
johnc@3175 | 595 | // after processing. |
johnc@3175 | 596 | void enqueue_discovered_references(); |
johnc@3175 | 597 | |
ysr@777 | 598 | public: |
jmasa@2821 | 599 | |
tonyp@3176 | 600 | G1MonitoringSupport* g1mm() { |
tonyp@3176 | 601 | assert(_g1mm != NULL, "should have been initialized"); |
tonyp@3176 | 602 | return _g1mm; |
tonyp@3176 | 603 | } |
jmasa@2821 | 604 | |
ysr@777 | 605 | // Expand the garbage-first heap by at least the given size (in bytes!). |
johnc@2504 | 606 | // Returns true if the heap was expanded by the requested amount; |
johnc@2504 | 607 | // false otherwise. |
ysr@777 | 608 | // (Rounds up to a HeapRegion boundary.) |
johnc@2504 | 609 | bool expand(size_t expand_bytes); |
ysr@777 | 610 | |
ysr@777 | 611 | // Do anything common to GC's. |
ysr@777 | 612 | virtual void gc_prologue(bool full); |
ysr@777 | 613 | virtual void gc_epilogue(bool full); |
ysr@777 | 614 | |
tonyp@961 | 615 | // We register a region with the fast "in collection set" test. We |
tonyp@961 | 616 | // simply set to true the array slot corresponding to this region. |
tonyp@961 | 617 | void register_region_with_in_cset_fast_test(HeapRegion* r) { |
tonyp@961 | 618 | assert(_in_cset_fast_test_base != NULL, "sanity"); |
tonyp@961 | 619 | assert(r->in_collection_set(), "invariant"); |
tonyp@2963 | 620 | size_t index = r->hrs_index(); |
tonyp@2963 | 621 | assert(index < _in_cset_fast_test_length, "invariant"); |
tonyp@961 | 622 | assert(!_in_cset_fast_test_base[index], "invariant"); |
tonyp@961 | 623 | _in_cset_fast_test_base[index] = true; |
tonyp@961 | 624 | } |
tonyp@961 | 625 | |
tonyp@961 | 626 | // This is a fast test on whether a reference points into the |
tonyp@961 | 627 | // collection set or not. It does not assume that the reference |
tonyp@961 | 628 | // points into the heap; if it doesn't, it will return false. |
tonyp@961 | 629 | bool in_cset_fast_test(oop obj) { |
tonyp@961 | 630 | assert(_in_cset_fast_test != NULL, "sanity"); |
tonyp@961 | 631 | if (_g1_committed.contains((HeapWord*) obj)) { |
tonyp@961 | 632 | // no need to subtract the bottom of the heap from obj, |
tonyp@961 | 633 | // _in_cset_fast_test is biased |
tonyp@961 | 634 | size_t index = ((size_t) obj) >> HeapRegion::LogOfHRGrainBytes; |
tonyp@961 | 635 | bool ret = _in_cset_fast_test[index]; |
tonyp@961 | 636 | // let's make sure the result is consistent with what the slower |
tonyp@961 | 637 | // test returns |
tonyp@961 | 638 | assert( ret || !obj_in_cs(obj), "sanity"); |
tonyp@961 | 639 | assert(!ret || obj_in_cs(obj), "sanity"); |
tonyp@961 | 640 | return ret; |
tonyp@961 | 641 | } else { |
tonyp@961 | 642 | return false; |
tonyp@961 | 643 | } |
tonyp@961 | 644 | } |
tonyp@961 | 645 | |
johnc@1829 | 646 | void clear_cset_fast_test() { |
johnc@1829 | 647 | assert(_in_cset_fast_test_base != NULL, "sanity"); |
johnc@1829 | 648 | memset(_in_cset_fast_test_base, false, |
johnc@1829 | 649 | _in_cset_fast_test_length * sizeof(bool)); |
johnc@1829 | 650 | } |
johnc@1829 | 651 | |
tonyp@2011 | 652 | // This is called at the end of either a concurrent cycle or a Full |
tonyp@2011 | 653 | // GC to update the number of full collections completed. Those two |
tonyp@2011 | 654 | // can happen in a nested fashion, i.e., we start a concurrent |
tonyp@2011 | 655 | // cycle, a Full GC happens half-way through it which ends first, |
tonyp@2011 | 656 | // and then the cycle notices that a Full GC happened and ends |
tonyp@2372 | 657 | // too. The concurrent parameter is a boolean to help us do a bit |
tonyp@2372 | 658 | // tighter consistency checking in the method. If concurrent is |
tonyp@2372 | 659 | // false, the caller is the inner caller in the nesting (i.e., the |
tonyp@2372 | 660 | // Full GC). If concurrent is true, the caller is the outer caller |
tonyp@2372 | 661 | // in this nesting (i.e., the concurrent cycle). Further nesting is |
tonyp@2372 | 662 | // not currently supported. The end of the this call also notifies |
tonyp@2372 | 663 | // the FullGCCount_lock in case a Java thread is waiting for a full |
tonyp@2372 | 664 | // GC to happen (e.g., it called System.gc() with |
tonyp@2011 | 665 | // +ExplicitGCInvokesConcurrent). |
tonyp@2372 | 666 | void increment_full_collections_completed(bool concurrent); |
tonyp@2011 | 667 | |
tonyp@2011 | 668 | unsigned int full_collections_completed() { |
tonyp@2011 | 669 | return _full_collections_completed; |
tonyp@2011 | 670 | } |
tonyp@2011 | 671 | |
tonyp@2975 | 672 | G1HRPrinter* hr_printer() { return &_hr_printer; } |
tonyp@2975 | 673 | |
ysr@777 | 674 | protected: |
ysr@777 | 675 | |
ysr@777 | 676 | // Shrink the garbage-first heap by at most the given size (in bytes!). |
ysr@777 | 677 | // (Rounds down to a HeapRegion boundary.) |
ysr@777 | 678 | virtual void shrink(size_t expand_bytes); |
ysr@777 | 679 | void shrink_helper(size_t expand_bytes); |
ysr@777 | 680 | |
jcoomes@2064 | 681 | #if TASKQUEUE_STATS |
jcoomes@2064 | 682 | static void print_taskqueue_stats_hdr(outputStream* const st = gclog_or_tty); |
jcoomes@2064 | 683 | void print_taskqueue_stats(outputStream* const st = gclog_or_tty) const; |
jcoomes@2064 | 684 | void reset_taskqueue_stats(); |
jcoomes@2064 | 685 | #endif // TASKQUEUE_STATS |
jcoomes@2064 | 686 | |
tonyp@2315 | 687 | // Schedule the VM operation that will do an evacuation pause to |
tonyp@2315 | 688 | // satisfy an allocation request of word_size. *succeeded will |
tonyp@2315 | 689 | // return whether the VM operation was successful (it did do an |
tonyp@2315 | 690 | // evacuation pause) or not (another thread beat us to it or the GC |
tonyp@2315 | 691 | // locker was active). Given that we should not be holding the |
tonyp@2315 | 692 | // Heap_lock when we enter this method, we will pass the |
tonyp@2315 | 693 | // gc_count_before (i.e., total_collections()) as a parameter since |
tonyp@2315 | 694 | // it has to be read while holding the Heap_lock. Currently, both |
tonyp@2315 | 695 | // methods that call do_collection_pause() release the Heap_lock |
tonyp@2315 | 696 | // before the call, so it's easy to read gc_count_before just before. |
tonyp@2315 | 697 | HeapWord* do_collection_pause(size_t word_size, |
tonyp@2315 | 698 | unsigned int gc_count_before, |
tonyp@2315 | 699 | bool* succeeded); |
ysr@777 | 700 | |
ysr@777 | 701 | // The guts of the incremental collection pause, executed by the vm |
tonyp@2315 | 702 | // thread. It returns false if it is unable to do the collection due |
tonyp@2315 | 703 | // to the GC locker being active, true otherwise |
tonyp@2315 | 704 | bool do_collection_pause_at_safepoint(double target_pause_time_ms); |
ysr@777 | 705 | |
ysr@777 | 706 | // Actually do the work of evacuating the collection set. |
tonyp@2315 | 707 | void evacuate_collection_set(); |
ysr@777 | 708 | |
ysr@777 | 709 | // The g1 remembered set of the heap. |
ysr@777 | 710 | G1RemSet* _g1_rem_set; |
ysr@777 | 711 | // And it's mod ref barrier set, used to track updates for the above. |
ysr@777 | 712 | ModRefBarrierSet* _mr_bs; |
ysr@777 | 713 | |
iveresov@1051 | 714 | // A set of cards that cover the objects for which the Rsets should be updated |
iveresov@1051 | 715 | // concurrently after the collection. |
iveresov@1051 | 716 | DirtyCardQueueSet _dirty_card_queue_set; |
iveresov@1051 | 717 | |
ysr@777 | 718 | // The Heap Region Rem Set Iterator. |
ysr@777 | 719 | HeapRegionRemSetIterator** _rem_set_iterator; |
ysr@777 | 720 | |
ysr@777 | 721 | // The closure used to refine a single card. |
ysr@777 | 722 | RefineCardTableEntryClosure* _refine_cte_cl; |
ysr@777 | 723 | |
ysr@777 | 724 | // A function to check the consistency of dirty card logs. |
ysr@777 | 725 | void check_ct_logs_at_safepoint(); |
ysr@777 | 726 | |
johnc@2060 | 727 | // A DirtyCardQueueSet that is used to hold cards that contain |
johnc@2060 | 728 | // references into the current collection set. This is used to |
johnc@2060 | 729 | // update the remembered sets of the regions in the collection |
johnc@2060 | 730 | // set in the event of an evacuation failure. |
johnc@2060 | 731 | DirtyCardQueueSet _into_cset_dirty_card_queue_set; |
johnc@2060 | 732 | |
ysr@777 | 733 | // After a collection pause, make the regions in the CS into free |
ysr@777 | 734 | // regions. |
ysr@777 | 735 | void free_collection_set(HeapRegion* cs_head); |
ysr@777 | 736 | |
johnc@1829 | 737 | // Abandon the current collection set without recording policy |
johnc@1829 | 738 | // statistics or updating free lists. |
johnc@1829 | 739 | void abandon_collection_set(HeapRegion* cs_head); |
johnc@1829 | 740 | |
ysr@777 | 741 | // Applies "scan_non_heap_roots" to roots outside the heap, |
ysr@777 | 742 | // "scan_rs" to roots inside the heap (having done "set_region" to |
ysr@777 | 743 | // indicate the region in which the root resides), and does "scan_perm" |
ysr@777 | 744 | // (setting the generation to the perm generation.) If "scan_rs" is |
ysr@777 | 745 | // NULL, then this step is skipped. The "worker_i" |
ysr@777 | 746 | // param is for use with parallel roots processing, and should be |
ysr@777 | 747 | // the "i" of the calling parallel worker thread's work(i) function. |
ysr@777 | 748 | // In the sequential case this param will be ignored. |
ysr@777 | 749 | void g1_process_strong_roots(bool collecting_perm_gen, |
ysr@777 | 750 | SharedHeap::ScanningOption so, |
ysr@777 | 751 | OopClosure* scan_non_heap_roots, |
ysr@777 | 752 | OopsInHeapRegionClosure* scan_rs, |
ysr@777 | 753 | OopsInGenClosure* scan_perm, |
ysr@777 | 754 | int worker_i); |
ysr@777 | 755 | |
ysr@777 | 756 | // Apply "blk" to all the weak roots of the system. These include |
ysr@777 | 757 | // JNI weak roots, the code cache, system dictionary, symbol table, |
ysr@777 | 758 | // string table, and referents of reachable weak refs. |
ysr@777 | 759 | void g1_process_weak_roots(OopClosure* root_closure, |
ysr@777 | 760 | OopClosure* non_root_closure); |
ysr@777 | 761 | |
tonyp@2643 | 762 | // Frees a non-humongous region by initializing its contents and |
tonyp@2472 | 763 | // adding it to the free list that's passed as a parameter (this is |
tonyp@2472 | 764 | // usually a local list which will be appended to the master free |
tonyp@2472 | 765 | // list later). The used bytes of freed regions are accumulated in |
tonyp@2472 | 766 | // pre_used. If par is true, the region's RSet will not be freed |
tonyp@2472 | 767 | // up. The assumption is that this will be done later. |
tonyp@2472 | 768 | void free_region(HeapRegion* hr, |
tonyp@2472 | 769 | size_t* pre_used, |
tonyp@2472 | 770 | FreeRegionList* free_list, |
tonyp@2472 | 771 | bool par); |
ysr@777 | 772 | |
tonyp@2643 | 773 | // Frees a humongous region by collapsing it into individual regions |
tonyp@2643 | 774 | // and calling free_region() for each of them. The freed regions |
tonyp@2643 | 775 | // will be added to the free list that's passed as a parameter (this |
tonyp@2643 | 776 | // is usually a local list which will be appended to the master free |
tonyp@2643 | 777 | // list later). The used bytes of freed regions are accumulated in |
tonyp@2643 | 778 | // pre_used. If par is true, the region's RSet will not be freed |
tonyp@2643 | 779 | // up. The assumption is that this will be done later. |
tonyp@2472 | 780 | void free_humongous_region(HeapRegion* hr, |
tonyp@2472 | 781 | size_t* pre_used, |
tonyp@2472 | 782 | FreeRegionList* free_list, |
tonyp@2472 | 783 | HumongousRegionSet* humongous_proxy_set, |
tonyp@2472 | 784 | bool par); |
ysr@777 | 785 | |
tonyp@2963 | 786 | // Notifies all the necessary spaces that the committed space has |
tonyp@2963 | 787 | // been updated (either expanded or shrunk). It should be called |
tonyp@2963 | 788 | // after _g1_storage is updated. |
tonyp@2963 | 789 | void update_committed_space(HeapWord* old_end, HeapWord* new_end); |
tonyp@2963 | 790 | |
ysr@777 | 791 | // The concurrent marker (and the thread it runs in.) |
ysr@777 | 792 | ConcurrentMark* _cm; |
ysr@777 | 793 | ConcurrentMarkThread* _cmThread; |
ysr@777 | 794 | bool _mark_in_progress; |
ysr@777 | 795 | |
ysr@777 | 796 | // The concurrent refiner. |
ysr@777 | 797 | ConcurrentG1Refine* _cg1r; |
ysr@777 | 798 | |
ysr@777 | 799 | // The parallel task queues |
ysr@777 | 800 | RefToScanQueueSet *_task_queues; |
ysr@777 | 801 | |
ysr@777 | 802 | // True iff a evacuation has failed in the current collection. |
ysr@777 | 803 | bool _evacuation_failed; |
ysr@777 | 804 | |
ysr@777 | 805 | // Set the attribute indicating whether evacuation has failed in the |
ysr@777 | 806 | // current collection. |
ysr@777 | 807 | void set_evacuation_failed(bool b) { _evacuation_failed = b; } |
ysr@777 | 808 | |
ysr@777 | 809 | // Failed evacuations cause some logical from-space objects to have |
ysr@777 | 810 | // forwarding pointers to themselves. Reset them. |
ysr@777 | 811 | void remove_self_forwarding_pointers(); |
ysr@777 | 812 | |
ysr@777 | 813 | // When one is non-null, so is the other. Together, they each pair is |
ysr@777 | 814 | // an object with a preserved mark, and its mark value. |
ysr@777 | 815 | GrowableArray<oop>* _objs_with_preserved_marks; |
ysr@777 | 816 | GrowableArray<markOop>* _preserved_marks_of_objs; |
ysr@777 | 817 | |
ysr@777 | 818 | // Preserve the mark of "obj", if necessary, in preparation for its mark |
ysr@777 | 819 | // word being overwritten with a self-forwarding-pointer. |
ysr@777 | 820 | void preserve_mark_if_necessary(oop obj, markOop m); |
ysr@777 | 821 | |
ysr@777 | 822 | // The stack of evac-failure objects left to be scanned. |
ysr@777 | 823 | GrowableArray<oop>* _evac_failure_scan_stack; |
ysr@777 | 824 | // The closure to apply to evac-failure objects. |
ysr@777 | 825 | |
ysr@777 | 826 | OopsInHeapRegionClosure* _evac_failure_closure; |
ysr@777 | 827 | // Set the field above. |
ysr@777 | 828 | void |
ysr@777 | 829 | set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_closure) { |
ysr@777 | 830 | _evac_failure_closure = evac_failure_closure; |
ysr@777 | 831 | } |
ysr@777 | 832 | |
ysr@777 | 833 | // Push "obj" on the scan stack. |
ysr@777 | 834 | void push_on_evac_failure_scan_stack(oop obj); |
ysr@777 | 835 | // Process scan stack entries until the stack is empty. |
ysr@777 | 836 | void drain_evac_failure_scan_stack(); |
ysr@777 | 837 | // True iff an invocation of "drain_scan_stack" is in progress; to |
ysr@777 | 838 | // prevent unnecessary recursion. |
ysr@777 | 839 | bool _drain_in_progress; |
ysr@777 | 840 | |
ysr@777 | 841 | // Do any necessary initialization for evacuation-failure handling. |
ysr@777 | 842 | // "cl" is the closure that will be used to process evac-failure |
ysr@777 | 843 | // objects. |
ysr@777 | 844 | void init_for_evac_failure(OopsInHeapRegionClosure* cl); |
ysr@777 | 845 | // Do any necessary cleanup for evacuation-failure handling data |
ysr@777 | 846 | // structures. |
ysr@777 | 847 | void finalize_for_evac_failure(); |
ysr@777 | 848 | |
ysr@777 | 849 | // An attempt to evacuate "obj" has failed; take necessary steps. |
johnc@3169 | 850 | oop handle_evacuation_failure_par(OopsInHeapRegionClosure* cl, oop obj, |
johnc@3169 | 851 | bool should_mark_root); |
ysr@777 | 852 | void handle_evacuation_failure_common(oop obj, markOop m); |
ysr@777 | 853 | |
johnc@3175 | 854 | // ("Weak") Reference processing support. |
johnc@3175 | 855 | // |
johnc@3175 | 856 | // G1 has 2 instances of the referece processor class. One |
johnc@3175 | 857 | // (_ref_processor_cm) handles reference object discovery |
johnc@3175 | 858 | // and subsequent processing during concurrent marking cycles. |
johnc@3175 | 859 | // |
johnc@3175 | 860 | // The other (_ref_processor_stw) handles reference object |
johnc@3175 | 861 | // discovery and processing during full GCs and incremental |
johnc@3175 | 862 | // evacuation pauses. |
johnc@3175 | 863 | // |
johnc@3175 | 864 | // During an incremental pause, reference discovery will be |
johnc@3175 | 865 | // temporarily disabled for _ref_processor_cm and will be |
johnc@3175 | 866 | // enabled for _ref_processor_stw. At the end of the evacuation |
johnc@3175 | 867 | // pause references discovered by _ref_processor_stw will be |
johnc@3175 | 868 | // processed and discovery will be disabled. The previous |
johnc@3175 | 869 | // setting for reference object discovery for _ref_processor_cm |
johnc@3175 | 870 | // will be re-instated. |
johnc@3175 | 871 | // |
johnc@3175 | 872 | // At the start of marking: |
johnc@3175 | 873 | // * Discovery by the CM ref processor is verified to be inactive |
johnc@3175 | 874 | // and it's discovered lists are empty. |
johnc@3175 | 875 | // * Discovery by the CM ref processor is then enabled. |
johnc@3175 | 876 | // |
johnc@3175 | 877 | // At the end of marking: |
johnc@3175 | 878 | // * Any references on the CM ref processor's discovered |
johnc@3175 | 879 | // lists are processed (possibly MT). |
johnc@3175 | 880 | // |
johnc@3175 | 881 | // At the start of full GC we: |
johnc@3175 | 882 | // * Disable discovery by the CM ref processor and |
johnc@3175 | 883 | // empty CM ref processor's discovered lists |
johnc@3175 | 884 | // (without processing any entries). |
johnc@3175 | 885 | // * Verify that the STW ref processor is inactive and it's |
johnc@3175 | 886 | // discovered lists are empty. |
johnc@3175 | 887 | // * Temporarily set STW ref processor discovery as single threaded. |
johnc@3175 | 888 | // * Temporarily clear the STW ref processor's _is_alive_non_header |
johnc@3175 | 889 | // field. |
johnc@3175 | 890 | // * Finally enable discovery by the STW ref processor. |
johnc@3175 | 891 | // |
johnc@3175 | 892 | // The STW ref processor is used to record any discovered |
johnc@3175 | 893 | // references during the full GC. |
johnc@3175 | 894 | // |
johnc@3175 | 895 | // At the end of a full GC we: |
johnc@3175 | 896 | // * Enqueue any reference objects discovered by the STW ref processor |
johnc@3175 | 897 | // that have non-live referents. This has the side-effect of |
johnc@3175 | 898 | // making the STW ref processor inactive by disabling discovery. |
johnc@3175 | 899 | // * Verify that the CM ref processor is still inactive |
johnc@3175 | 900 | // and no references have been placed on it's discovered |
johnc@3175 | 901 | // lists (also checked as a precondition during initial marking). |
johnc@3175 | 902 | |
johnc@3175 | 903 | // The (stw) reference processor... |
johnc@3175 | 904 | ReferenceProcessor* _ref_processor_stw; |
johnc@3175 | 905 | |
johnc@3175 | 906 | // During reference object discovery, the _is_alive_non_header |
johnc@3175 | 907 | // closure (if non-null) is applied to the referent object to |
johnc@3175 | 908 | // determine whether the referent is live. If so then the |
johnc@3175 | 909 | // reference object does not need to be 'discovered' and can |
johnc@3175 | 910 | // be treated as a regular oop. This has the benefit of reducing |
johnc@3175 | 911 | // the number of 'discovered' reference objects that need to |
johnc@3175 | 912 | // be processed. |
johnc@3175 | 913 | // |
johnc@3175 | 914 | // Instance of the is_alive closure for embedding into the |
johnc@3175 | 915 | // STW reference processor as the _is_alive_non_header field. |
johnc@3175 | 916 | // Supplying a value for the _is_alive_non_header field is |
johnc@3175 | 917 | // optional but doing so prevents unnecessary additions to |
johnc@3175 | 918 | // the discovered lists during reference discovery. |
johnc@3175 | 919 | G1STWIsAliveClosure _is_alive_closure_stw; |
johnc@3175 | 920 | |
johnc@3175 | 921 | // The (concurrent marking) reference processor... |
johnc@3175 | 922 | ReferenceProcessor* _ref_processor_cm; |
johnc@3175 | 923 | |
johnc@2379 | 924 | // Instance of the concurrent mark is_alive closure for embedding |
johnc@3175 | 925 | // into the Concurrent Marking reference processor as the |
johnc@3175 | 926 | // _is_alive_non_header field. Supplying a value for the |
johnc@3175 | 927 | // _is_alive_non_header field is optional but doing so prevents |
johnc@3175 | 928 | // unnecessary additions to the discovered lists during reference |
johnc@3175 | 929 | // discovery. |
johnc@3175 | 930 | G1CMIsAliveClosure _is_alive_closure_cm; |
ysr@777 | 931 | |
ysr@777 | 932 | enum G1H_process_strong_roots_tasks { |
ysr@777 | 933 | G1H_PS_mark_stack_oops_do, |
ysr@777 | 934 | G1H_PS_refProcessor_oops_do, |
ysr@777 | 935 | // Leave this one last. |
ysr@777 | 936 | G1H_PS_NumElements |
ysr@777 | 937 | }; |
ysr@777 | 938 | |
ysr@777 | 939 | SubTasksDone* _process_strong_tasks; |
ysr@777 | 940 | |
tonyp@2472 | 941 | volatile bool _free_regions_coming; |
ysr@777 | 942 | |
ysr@777 | 943 | public: |
jmasa@2188 | 944 | |
jmasa@2188 | 945 | SubTasksDone* process_strong_tasks() { return _process_strong_tasks; } |
jmasa@2188 | 946 | |
ysr@777 | 947 | void set_refine_cte_cl_concurrency(bool concurrent); |
ysr@777 | 948 | |
jcoomes@2064 | 949 | RefToScanQueue *task_queue(int i) const; |
ysr@777 | 950 | |
iveresov@1051 | 951 | // A set of cards where updates happened during the GC |
iveresov@1051 | 952 | DirtyCardQueueSet& dirty_card_queue_set() { return _dirty_card_queue_set; } |
iveresov@1051 | 953 | |
johnc@2060 | 954 | // A DirtyCardQueueSet that is used to hold cards that contain |
johnc@2060 | 955 | // references into the current collection set. This is used to |
johnc@2060 | 956 | // update the remembered sets of the regions in the collection |
johnc@2060 | 957 | // set in the event of an evacuation failure. |
johnc@2060 | 958 | DirtyCardQueueSet& into_cset_dirty_card_queue_set() |
johnc@2060 | 959 | { return _into_cset_dirty_card_queue_set; } |
johnc@2060 | 960 | |
ysr@777 | 961 | // Create a G1CollectedHeap with the specified policy. |
ysr@777 | 962 | // Must call the initialize method afterwards. |
ysr@777 | 963 | // May not return if something goes wrong. |
ysr@777 | 964 | G1CollectedHeap(G1CollectorPolicy* policy); |
ysr@777 | 965 | |
ysr@777 | 966 | // Initialize the G1CollectedHeap to have the initial and |
ysr@777 | 967 | // maximum sizes, permanent generation, and remembered and barrier sets |
ysr@777 | 968 | // specified by the policy object. |
ysr@777 | 969 | jint initialize(); |
ysr@777 | 970 | |
johnc@3175 | 971 | // Initialize weak reference processing. |
johnc@2379 | 972 | virtual void ref_processing_init(); |
ysr@777 | 973 | |
ysr@777 | 974 | void set_par_threads(int t) { |
ysr@777 | 975 | SharedHeap::set_par_threads(t); |
jmasa@2188 | 976 | _process_strong_tasks->set_n_threads(t); |
ysr@777 | 977 | } |
ysr@777 | 978 | |
ysr@777 | 979 | virtual CollectedHeap::Name kind() const { |
ysr@777 | 980 | return CollectedHeap::G1CollectedHeap; |
ysr@777 | 981 | } |
ysr@777 | 982 | |
ysr@777 | 983 | // The current policy object for the collector. |
ysr@777 | 984 | G1CollectorPolicy* g1_policy() const { return _g1_policy; } |
ysr@777 | 985 | |
ysr@777 | 986 | // Adaptive size policy. No such thing for g1. |
ysr@777 | 987 | virtual AdaptiveSizePolicy* size_policy() { return NULL; } |
ysr@777 | 988 | |
ysr@777 | 989 | // The rem set and barrier set. |
ysr@777 | 990 | G1RemSet* g1_rem_set() const { return _g1_rem_set; } |
ysr@777 | 991 | ModRefBarrierSet* mr_bs() const { return _mr_bs; } |
ysr@777 | 992 | |
ysr@777 | 993 | // The rem set iterator. |
ysr@777 | 994 | HeapRegionRemSetIterator* rem_set_iterator(int i) { |
ysr@777 | 995 | return _rem_set_iterator[i]; |
ysr@777 | 996 | } |
ysr@777 | 997 | |
ysr@777 | 998 | HeapRegionRemSetIterator* rem_set_iterator() { |
ysr@777 | 999 | return _rem_set_iterator[0]; |
ysr@777 | 1000 | } |
ysr@777 | 1001 | |
ysr@777 | 1002 | unsigned get_gc_time_stamp() { |
ysr@777 | 1003 | return _gc_time_stamp; |
ysr@777 | 1004 | } |
ysr@777 | 1005 | |
ysr@777 | 1006 | void reset_gc_time_stamp() { |
ysr@777 | 1007 | _gc_time_stamp = 0; |
iveresov@788 | 1008 | OrderAccess::fence(); |
iveresov@788 | 1009 | } |
iveresov@788 | 1010 | |
iveresov@788 | 1011 | void increment_gc_time_stamp() { |
iveresov@788 | 1012 | ++_gc_time_stamp; |
iveresov@788 | 1013 | OrderAccess::fence(); |
ysr@777 | 1014 | } |
ysr@777 | 1015 | |
johnc@2060 | 1016 | void iterate_dirty_card_closure(CardTableEntryClosure* cl, |
johnc@2060 | 1017 | DirtyCardQueue* into_cset_dcq, |
johnc@2060 | 1018 | bool concurrent, int worker_i); |
ysr@777 | 1019 | |
ysr@777 | 1020 | // The shared block offset table array. |
ysr@777 | 1021 | G1BlockOffsetSharedArray* bot_shared() const { return _bot_shared; } |
ysr@777 | 1022 | |
johnc@3175 | 1023 | // Reference Processing accessors |
johnc@3175 | 1024 | |
johnc@3175 | 1025 | // The STW reference processor.... |
johnc@3175 | 1026 | ReferenceProcessor* ref_processor_stw() const { return _ref_processor_stw; } |
johnc@3175 | 1027 | |
johnc@3175 | 1028 | // The Concurent Marking reference processor... |
johnc@3175 | 1029 | ReferenceProcessor* ref_processor_cm() const { return _ref_processor_cm; } |
ysr@777 | 1030 | |
ysr@777 | 1031 | virtual size_t capacity() const; |
ysr@777 | 1032 | virtual size_t used() const; |
tonyp@1281 | 1033 | // This should be called when we're not holding the heap lock. The |
tonyp@1281 | 1034 | // result might be a bit inaccurate. |
tonyp@1281 | 1035 | size_t used_unlocked() const; |
ysr@777 | 1036 | size_t recalculate_used() const; |
ysr@777 | 1037 | |
ysr@777 | 1038 | // These virtual functions do the actual allocation. |
ysr@777 | 1039 | // Some heaps may offer a contiguous region for shared non-blocking |
ysr@777 | 1040 | // allocation, via inlined code (by exporting the address of the top and |
ysr@777 | 1041 | // end fields defining the extent of the contiguous allocation region.) |
ysr@777 | 1042 | // But G1CollectedHeap doesn't yet support this. |
ysr@777 | 1043 | |
ysr@777 | 1044 | // Return an estimate of the maximum allocation that could be performed |
ysr@777 | 1045 | // without triggering any collection or expansion activity. In a |
ysr@777 | 1046 | // generational collector, for example, this is probably the largest |
ysr@777 | 1047 | // allocation that could be supported (without expansion) in the youngest |
ysr@777 | 1048 | // generation. It is "unsafe" because no locks are taken; the result |
ysr@777 | 1049 | // should be treated as an approximation, not a guarantee, for use in |
ysr@777 | 1050 | // heuristic resizing decisions. |
ysr@777 | 1051 | virtual size_t unsafe_max_alloc(); |
ysr@777 | 1052 | |
ysr@777 | 1053 | virtual bool is_maximal_no_gc() const { |
ysr@777 | 1054 | return _g1_storage.uncommitted_size() == 0; |
ysr@777 | 1055 | } |
ysr@777 | 1056 | |
ysr@777 | 1057 | // The total number of regions in the heap. |
tonyp@2963 | 1058 | size_t n_regions() { return _hrs.length(); } |
tonyp@2963 | 1059 | |
tonyp@2963 | 1060 | // The max number of regions in the heap. |
tonyp@2963 | 1061 | size_t max_regions() { return _hrs.max_length(); } |
ysr@777 | 1062 | |
ysr@777 | 1063 | // The number of regions that are completely free. |
tonyp@2963 | 1064 | size_t free_regions() { return _free_list.length(); } |
ysr@777 | 1065 | |
ysr@777 | 1066 | // The number of regions that are not completely free. |
ysr@777 | 1067 | size_t used_regions() { return n_regions() - free_regions(); } |
ysr@777 | 1068 | |
ysr@777 | 1069 | // The number of regions available for "regular" expansion. |
ysr@777 | 1070 | size_t expansion_regions() { return _expansion_regions; } |
ysr@777 | 1071 | |
tonyp@2963 | 1072 | // Factory method for HeapRegion instances. It will return NULL if |
tonyp@2963 | 1073 | // the allocation fails. |
tonyp@2963 | 1074 | HeapRegion* new_heap_region(size_t hrs_index, HeapWord* bottom); |
tonyp@2963 | 1075 | |
tonyp@2849 | 1076 | void verify_not_dirty_region(HeapRegion* hr) PRODUCT_RETURN; |
tonyp@2849 | 1077 | void verify_dirty_region(HeapRegion* hr) PRODUCT_RETURN; |
tonyp@2715 | 1078 | void verify_dirty_young_list(HeapRegion* head) PRODUCT_RETURN; |
tonyp@2715 | 1079 | void verify_dirty_young_regions() PRODUCT_RETURN; |
tonyp@2715 | 1080 | |
tonyp@2472 | 1081 | // verify_region_sets() performs verification over the region |
tonyp@2472 | 1082 | // lists. It will be compiled in the product code to be used when |
tonyp@2472 | 1083 | // necessary (i.e., during heap verification). |
tonyp@2472 | 1084 | void verify_region_sets(); |
ysr@777 | 1085 | |
tonyp@2472 | 1086 | // verify_region_sets_optional() is planted in the code for |
tonyp@2472 | 1087 | // list verification in non-product builds (and it can be enabled in |
tonyp@2472 | 1088 | // product builds by definning HEAP_REGION_SET_FORCE_VERIFY to be 1). |
tonyp@2472 | 1089 | #if HEAP_REGION_SET_FORCE_VERIFY |
tonyp@2472 | 1090 | void verify_region_sets_optional() { |
tonyp@2472 | 1091 | verify_region_sets(); |
tonyp@2472 | 1092 | } |
tonyp@2472 | 1093 | #else // HEAP_REGION_SET_FORCE_VERIFY |
tonyp@2472 | 1094 | void verify_region_sets_optional() { } |
tonyp@2472 | 1095 | #endif // HEAP_REGION_SET_FORCE_VERIFY |
ysr@777 | 1096 | |
tonyp@2472 | 1097 | #ifdef ASSERT |
tonyp@2643 | 1098 | bool is_on_master_free_list(HeapRegion* hr) { |
tonyp@2472 | 1099 | return hr->containing_set() == &_free_list; |
tonyp@2472 | 1100 | } |
ysr@777 | 1101 | |
tonyp@2643 | 1102 | bool is_in_humongous_set(HeapRegion* hr) { |
tonyp@2472 | 1103 | return hr->containing_set() == &_humongous_set; |
tonyp@2643 | 1104 | } |
tonyp@2472 | 1105 | #endif // ASSERT |
ysr@777 | 1106 | |
tonyp@2472 | 1107 | // Wrapper for the region list operations that can be called from |
tonyp@2472 | 1108 | // methods outside this class. |
ysr@777 | 1109 | |
tonyp@2472 | 1110 | void secondary_free_list_add_as_tail(FreeRegionList* list) { |
tonyp@2472 | 1111 | _secondary_free_list.add_as_tail(list); |
tonyp@2472 | 1112 | } |
ysr@777 | 1113 | |
tonyp@2472 | 1114 | void append_secondary_free_list() { |
tonyp@2714 | 1115 | _free_list.add_as_head(&_secondary_free_list); |
tonyp@2472 | 1116 | } |
ysr@777 | 1117 | |
tonyp@2643 | 1118 | void append_secondary_free_list_if_not_empty_with_lock() { |
tonyp@2643 | 1119 | // If the secondary free list looks empty there's no reason to |
tonyp@2643 | 1120 | // take the lock and then try to append it. |
tonyp@2472 | 1121 | if (!_secondary_free_list.is_empty()) { |
tonyp@2472 | 1122 | MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag); |
tonyp@2472 | 1123 | append_secondary_free_list(); |
tonyp@2472 | 1124 | } |
tonyp@2472 | 1125 | } |
ysr@777 | 1126 | |
tonyp@2472 | 1127 | void set_free_regions_coming(); |
tonyp@2472 | 1128 | void reset_free_regions_coming(); |
tonyp@2472 | 1129 | bool free_regions_coming() { return _free_regions_coming; } |
tonyp@2472 | 1130 | void wait_while_free_regions_coming(); |
ysr@777 | 1131 | |
ysr@777 | 1132 | // Perform a collection of the heap; intended for use in implementing |
ysr@777 | 1133 | // "System.gc". This probably implies as full a collection as the |
ysr@777 | 1134 | // "CollectedHeap" supports. |
ysr@777 | 1135 | virtual void collect(GCCause::Cause cause); |
ysr@777 | 1136 | |
ysr@777 | 1137 | // The same as above but assume that the caller holds the Heap_lock. |
ysr@777 | 1138 | void collect_locked(GCCause::Cause cause); |
ysr@777 | 1139 | |
ysr@777 | 1140 | // This interface assumes that it's being called by the |
ysr@777 | 1141 | // vm thread. It collects the heap assuming that the |
ysr@777 | 1142 | // heap lock is already held and that we are executing in |
ysr@777 | 1143 | // the context of the vm thread. |
ysr@777 | 1144 | virtual void collect_as_vm_thread(GCCause::Cause cause); |
ysr@777 | 1145 | |
ysr@777 | 1146 | // True iff a evacuation has failed in the most-recent collection. |
ysr@777 | 1147 | bool evacuation_failed() { return _evacuation_failed; } |
ysr@777 | 1148 | |
tonyp@2472 | 1149 | // It will free a region if it has allocated objects in it that are |
tonyp@2472 | 1150 | // all dead. It calls either free_region() or |
tonyp@2472 | 1151 | // free_humongous_region() depending on the type of the region that |
tonyp@2472 | 1152 | // is passed to it. |
tonyp@2493 | 1153 | void free_region_if_empty(HeapRegion* hr, |
tonyp@2493 | 1154 | size_t* pre_used, |
tonyp@2493 | 1155 | FreeRegionList* free_list, |
tonyp@2493 | 1156 | HumongousRegionSet* humongous_proxy_set, |
tonyp@2493 | 1157 | HRRSCleanupTask* hrrs_cleanup_task, |
tonyp@2493 | 1158 | bool par); |
ysr@777 | 1159 | |
tonyp@2472 | 1160 | // It appends the free list to the master free list and updates the |
tonyp@2472 | 1161 | // master humongous list according to the contents of the proxy |
tonyp@2472 | 1162 | // list. It also adjusts the total used bytes according to pre_used |
tonyp@2472 | 1163 | // (if par is true, it will do so by taking the ParGCRareEvent_lock). |
tonyp@2472 | 1164 | void update_sets_after_freeing_regions(size_t pre_used, |
tonyp@2472 | 1165 | FreeRegionList* free_list, |
tonyp@2472 | 1166 | HumongousRegionSet* humongous_proxy_set, |
tonyp@2472 | 1167 | bool par); |
ysr@777 | 1168 | |
ysr@777 | 1169 | // Returns "TRUE" iff "p" points into the allocated area of the heap. |
ysr@777 | 1170 | virtual bool is_in(const void* p) const; |
ysr@777 | 1171 | |
ysr@777 | 1172 | // Return "TRUE" iff the given object address is within the collection |
ysr@777 | 1173 | // set. |
ysr@777 | 1174 | inline bool obj_in_cs(oop obj); |
ysr@777 | 1175 | |
ysr@777 | 1176 | // Return "TRUE" iff the given object address is in the reserved |
ysr@777 | 1177 | // region of g1 (excluding the permanent generation). |
ysr@777 | 1178 | bool is_in_g1_reserved(const void* p) const { |
ysr@777 | 1179 | return _g1_reserved.contains(p); |
ysr@777 | 1180 | } |
ysr@777 | 1181 | |
tonyp@2717 | 1182 | // Returns a MemRegion that corresponds to the space that has been |
tonyp@2717 | 1183 | // reserved for the heap |
tonyp@2717 | 1184 | MemRegion g1_reserved() { |
tonyp@2717 | 1185 | return _g1_reserved; |
tonyp@2717 | 1186 | } |
tonyp@2717 | 1187 | |
tonyp@2717 | 1188 | // Returns a MemRegion that corresponds to the space that has been |
ysr@777 | 1189 | // committed in the heap |
ysr@777 | 1190 | MemRegion g1_committed() { |
ysr@777 | 1191 | return _g1_committed; |
ysr@777 | 1192 | } |
ysr@777 | 1193 | |
johnc@2593 | 1194 | virtual bool is_in_closed_subset(const void* p) const; |
ysr@777 | 1195 | |
ysr@777 | 1196 | // This resets the card table to all zeros. It is used after |
ysr@777 | 1197 | // a collection pause which used the card table to claim cards. |
ysr@777 | 1198 | void cleanUpCardTable(); |
ysr@777 | 1199 | |
ysr@777 | 1200 | // Iteration functions. |
ysr@777 | 1201 | |
ysr@777 | 1202 | // Iterate over all the ref-containing fields of all objects, calling |
ysr@777 | 1203 | // "cl.do_oop" on each. |
iveresov@1113 | 1204 | virtual void oop_iterate(OopClosure* cl) { |
iveresov@1113 | 1205 | oop_iterate(cl, true); |
iveresov@1113 | 1206 | } |
iveresov@1113 | 1207 | void oop_iterate(OopClosure* cl, bool do_perm); |
ysr@777 | 1208 | |
ysr@777 | 1209 | // Same as above, restricted to a memory region. |
iveresov@1113 | 1210 | virtual void oop_iterate(MemRegion mr, OopClosure* cl) { |
iveresov@1113 | 1211 | oop_iterate(mr, cl, true); |
iveresov@1113 | 1212 | } |
iveresov@1113 | 1213 | void oop_iterate(MemRegion mr, OopClosure* cl, bool do_perm); |
ysr@777 | 1214 | |
ysr@777 | 1215 | // Iterate over all objects, calling "cl.do_object" on each. |
iveresov@1113 | 1216 | virtual void object_iterate(ObjectClosure* cl) { |
iveresov@1113 | 1217 | object_iterate(cl, true); |
iveresov@1113 | 1218 | } |
iveresov@1113 | 1219 | virtual void safe_object_iterate(ObjectClosure* cl) { |
iveresov@1113 | 1220 | object_iterate(cl, true); |
iveresov@1113 | 1221 | } |
iveresov@1113 | 1222 | void object_iterate(ObjectClosure* cl, bool do_perm); |
ysr@777 | 1223 | |
ysr@777 | 1224 | // Iterate over all objects allocated since the last collection, calling |
ysr@777 | 1225 | // "cl.do_object" on each. The heap must have been initialized properly |
ysr@777 | 1226 | // to support this function, or else this call will fail. |
ysr@777 | 1227 | virtual void object_iterate_since_last_GC(ObjectClosure* cl); |
ysr@777 | 1228 | |
ysr@777 | 1229 | // Iterate over all spaces in use in the heap, in ascending address order. |
ysr@777 | 1230 | virtual void space_iterate(SpaceClosure* cl); |
ysr@777 | 1231 | |
ysr@777 | 1232 | // Iterate over heap regions, in address order, terminating the |
ysr@777 | 1233 | // iteration early if the "doHeapRegion" method returns "true". |
tonyp@2963 | 1234 | void heap_region_iterate(HeapRegionClosure* blk) const; |
ysr@777 | 1235 | |
ysr@777 | 1236 | // Iterate over heap regions starting with r (or the first region if "r" |
ysr@777 | 1237 | // is NULL), in address order, terminating early if the "doHeapRegion" |
ysr@777 | 1238 | // method returns "true". |
tonyp@2963 | 1239 | void heap_region_iterate_from(HeapRegion* r, HeapRegionClosure* blk) const; |
ysr@777 | 1240 | |
tonyp@2963 | 1241 | // Return the region with the given index. It assumes the index is valid. |
tonyp@2963 | 1242 | HeapRegion* region_at(size_t index) const { return _hrs.at(index); } |
ysr@777 | 1243 | |
ysr@777 | 1244 | // Divide the heap region sequence into "chunks" of some size (the number |
ysr@777 | 1245 | // of regions divided by the number of parallel threads times some |
ysr@777 | 1246 | // overpartition factor, currently 4). Assumes that this will be called |
ysr@777 | 1247 | // in parallel by ParallelGCThreads worker threads with discinct worker |
ysr@777 | 1248 | // ids in the range [0..max(ParallelGCThreads-1, 1)], that all parallel |
ysr@777 | 1249 | // calls will use the same "claim_value", and that that claim value is |
ysr@777 | 1250 | // different from the claim_value of any heap region before the start of |
ysr@777 | 1251 | // the iteration. Applies "blk->doHeapRegion" to each of the regions, by |
ysr@777 | 1252 | // attempting to claim the first region in each chunk, and, if |
ysr@777 | 1253 | // successful, applying the closure to each region in the chunk (and |
ysr@777 | 1254 | // setting the claim value of the second and subsequent regions of the |
ysr@777 | 1255 | // chunk.) For now requires that "doHeapRegion" always returns "false", |
ysr@777 | 1256 | // i.e., that a closure never attempt to abort a traversal. |
ysr@777 | 1257 | void heap_region_par_iterate_chunked(HeapRegionClosure* blk, |
ysr@777 | 1258 | int worker, |
ysr@777 | 1259 | jint claim_value); |
ysr@777 | 1260 | |
tonyp@825 | 1261 | // It resets all the region claim values to the default. |
tonyp@825 | 1262 | void reset_heap_region_claim_values(); |
tonyp@825 | 1263 | |
tonyp@790 | 1264 | #ifdef ASSERT |
tonyp@790 | 1265 | bool check_heap_region_claim_values(jint claim_value); |
tonyp@790 | 1266 | #endif // ASSERT |
tonyp@790 | 1267 | |
ysr@777 | 1268 | // Iterate over the regions (if any) in the current collection set. |
ysr@777 | 1269 | void collection_set_iterate(HeapRegionClosure* blk); |
ysr@777 | 1270 | |
ysr@777 | 1271 | // As above but starting from region r |
ysr@777 | 1272 | void collection_set_iterate_from(HeapRegion* r, HeapRegionClosure *blk); |
ysr@777 | 1273 | |
ysr@777 | 1274 | // Returns the first (lowest address) compactible space in the heap. |
ysr@777 | 1275 | virtual CompactibleSpace* first_compactible_space(); |
ysr@777 | 1276 | |
ysr@777 | 1277 | // A CollectedHeap will contain some number of spaces. This finds the |
ysr@777 | 1278 | // space containing a given address, or else returns NULL. |
ysr@777 | 1279 | virtual Space* space_containing(const void* addr) const; |
ysr@777 | 1280 | |
ysr@777 | 1281 | // A G1CollectedHeap will contain some number of heap regions. This |
ysr@777 | 1282 | // finds the region containing a given address, or else returns NULL. |
tonyp@2963 | 1283 | template <class T> |
tonyp@2963 | 1284 | inline HeapRegion* heap_region_containing(const T addr) const; |
ysr@777 | 1285 | |
ysr@777 | 1286 | // Like the above, but requires "addr" to be in the heap (to avoid a |
ysr@777 | 1287 | // null-check), and unlike the above, may return an continuing humongous |
ysr@777 | 1288 | // region. |
tonyp@2963 | 1289 | template <class T> |
tonyp@2963 | 1290 | inline HeapRegion* heap_region_containing_raw(const T addr) const; |
ysr@777 | 1291 | |
ysr@777 | 1292 | // A CollectedHeap is divided into a dense sequence of "blocks"; that is, |
ysr@777 | 1293 | // each address in the (reserved) heap is a member of exactly |
ysr@777 | 1294 | // one block. The defining characteristic of a block is that it is |
ysr@777 | 1295 | // possible to find its size, and thus to progress forward to the next |
ysr@777 | 1296 | // block. (Blocks may be of different sizes.) Thus, blocks may |
ysr@777 | 1297 | // represent Java objects, or they might be free blocks in a |
ysr@777 | 1298 | // free-list-based heap (or subheap), as long as the two kinds are |
ysr@777 | 1299 | // distinguishable and the size of each is determinable. |
ysr@777 | 1300 | |
ysr@777 | 1301 | // Returns the address of the start of the "block" that contains the |
ysr@777 | 1302 | // address "addr". We say "blocks" instead of "object" since some heaps |
ysr@777 | 1303 | // may not pack objects densely; a chunk may either be an object or a |
ysr@777 | 1304 | // non-object. |
ysr@777 | 1305 | virtual HeapWord* block_start(const void* addr) const; |
ysr@777 | 1306 | |
ysr@777 | 1307 | // Requires "addr" to be the start of a chunk, and returns its size. |
ysr@777 | 1308 | // "addr + size" is required to be the start of a new chunk, or the end |
ysr@777 | 1309 | // of the active area of the heap. |
ysr@777 | 1310 | virtual size_t block_size(const HeapWord* addr) const; |
ysr@777 | 1311 | |
ysr@777 | 1312 | // Requires "addr" to be the start of a block, and returns "TRUE" iff |
ysr@777 | 1313 | // the block is an object. |
ysr@777 | 1314 | virtual bool block_is_obj(const HeapWord* addr) const; |
ysr@777 | 1315 | |
ysr@777 | 1316 | // Does this heap support heap inspection? (+PrintClassHistogram) |
ysr@777 | 1317 | virtual bool supports_heap_inspection() const { return true; } |
ysr@777 | 1318 | |
ysr@777 | 1319 | // Section on thread-local allocation buffers (TLABs) |
ysr@777 | 1320 | // See CollectedHeap for semantics. |
ysr@777 | 1321 | |
ysr@777 | 1322 | virtual bool supports_tlab_allocation() const; |
ysr@777 | 1323 | virtual size_t tlab_capacity(Thread* thr) const; |
ysr@777 | 1324 | virtual size_t unsafe_max_tlab_alloc(Thread* thr) const; |
ysr@777 | 1325 | |
ysr@777 | 1326 | // Can a compiler initialize a new object without store barriers? |
ysr@777 | 1327 | // This permission only extends from the creation of a new object |
ysr@1462 | 1328 | // via a TLAB up to the first subsequent safepoint. If such permission |
ysr@1462 | 1329 | // is granted for this heap type, the compiler promises to call |
ysr@1462 | 1330 | // defer_store_barrier() below on any slow path allocation of |
ysr@1462 | 1331 | // a new object for which such initializing store barriers will |
ysr@1462 | 1332 | // have been elided. G1, like CMS, allows this, but should be |
ysr@1462 | 1333 | // ready to provide a compensating write barrier as necessary |
ysr@1462 | 1334 | // if that storage came out of a non-young region. The efficiency |
ysr@1462 | 1335 | // of this implementation depends crucially on being able to |
ysr@1462 | 1336 | // answer very efficiently in constant time whether a piece of |
ysr@1462 | 1337 | // storage in the heap comes from a young region or not. |
ysr@1462 | 1338 | // See ReduceInitialCardMarks. |
ysr@777 | 1339 | virtual bool can_elide_tlab_store_barriers() const { |
brutisso@3184 | 1340 | return true; |
ysr@1462 | 1341 | } |
ysr@1462 | 1342 | |
ysr@1601 | 1343 | virtual bool card_mark_must_follow_store() const { |
ysr@1601 | 1344 | return true; |
ysr@1601 | 1345 | } |
ysr@1601 | 1346 | |
tonyp@2963 | 1347 | bool is_in_young(const oop obj) { |
ysr@1462 | 1348 | HeapRegion* hr = heap_region_containing(obj); |
ysr@1462 | 1349 | return hr != NULL && hr->is_young(); |
ysr@1462 | 1350 | } |
ysr@1462 | 1351 | |
jmasa@2909 | 1352 | #ifdef ASSERT |
jmasa@2909 | 1353 | virtual bool is_in_partial_collection(const void* p); |
jmasa@2909 | 1354 | #endif |
jmasa@2909 | 1355 | |
jmasa@2909 | 1356 | virtual bool is_scavengable(const void* addr); |
jmasa@2909 | 1357 | |
ysr@1462 | 1358 | // We don't need barriers for initializing stores to objects |
ysr@1462 | 1359 | // in the young gen: for the SATB pre-barrier, there is no |
ysr@1462 | 1360 | // pre-value that needs to be remembered; for the remembered-set |
ysr@1462 | 1361 | // update logging post-barrier, we don't maintain remembered set |
brutisso@3065 | 1362 | // information for young gen objects. |
ysr@1462 | 1363 | virtual bool can_elide_initializing_store_barrier(oop new_obj) { |
ysr@1462 | 1364 | return is_in_young(new_obj); |
ysr@777 | 1365 | } |
ysr@777 | 1366 | |
ysr@777 | 1367 | // Can a compiler elide a store barrier when it writes |
ysr@777 | 1368 | // a permanent oop into the heap? Applies when the compiler |
ysr@777 | 1369 | // is storing x to the heap, where x->is_perm() is true. |
ysr@777 | 1370 | virtual bool can_elide_permanent_oop_store_barriers() const { |
ysr@777 | 1371 | // At least until perm gen collection is also G1-ified, at |
ysr@777 | 1372 | // which point this should return false. |
ysr@777 | 1373 | return true; |
ysr@777 | 1374 | } |
ysr@777 | 1375 | |
ysr@777 | 1376 | // Returns "true" iff the given word_size is "very large". |
ysr@777 | 1377 | static bool isHumongous(size_t word_size) { |
johnc@1748 | 1378 | // Note this has to be strictly greater-than as the TLABs |
johnc@1748 | 1379 | // are capped at the humongous thresold and we want to |
johnc@1748 | 1380 | // ensure that we don't try to allocate a TLAB as |
johnc@1748 | 1381 | // humongous and that we don't allocate a humongous |
johnc@1748 | 1382 | // object in a TLAB. |
johnc@1748 | 1383 | return word_size > _humongous_object_threshold_in_words; |
ysr@777 | 1384 | } |
ysr@777 | 1385 | |
ysr@777 | 1386 | // Update mod union table with the set of dirty cards. |
ysr@777 | 1387 | void updateModUnion(); |
ysr@777 | 1388 | |
ysr@777 | 1389 | // Set the mod union bits corresponding to the given memRegion. Note |
ysr@777 | 1390 | // that this is always a safe operation, since it doesn't clear any |
ysr@777 | 1391 | // bits. |
ysr@777 | 1392 | void markModUnionRange(MemRegion mr); |
ysr@777 | 1393 | |
ysr@777 | 1394 | // Records the fact that a marking phase is no longer in progress. |
ysr@777 | 1395 | void set_marking_complete() { |
ysr@777 | 1396 | _mark_in_progress = false; |
ysr@777 | 1397 | } |
ysr@777 | 1398 | void set_marking_started() { |
ysr@777 | 1399 | _mark_in_progress = true; |
ysr@777 | 1400 | } |
ysr@777 | 1401 | bool mark_in_progress() { |
ysr@777 | 1402 | return _mark_in_progress; |
ysr@777 | 1403 | } |
ysr@777 | 1404 | |
ysr@777 | 1405 | // Print the maximum heap capacity. |
ysr@777 | 1406 | virtual size_t max_capacity() const; |
ysr@777 | 1407 | |
ysr@777 | 1408 | virtual jlong millis_since_last_gc(); |
ysr@777 | 1409 | |
ysr@777 | 1410 | // Perform any cleanup actions necessary before allowing a verification. |
ysr@777 | 1411 | virtual void prepare_for_verify(); |
ysr@777 | 1412 | |
ysr@777 | 1413 | // Perform verification. |
tonyp@1246 | 1414 | |
johnc@2969 | 1415 | // vo == UsePrevMarking -> use "prev" marking information, |
johnc@2969 | 1416 | // vo == UseNextMarking -> use "next" marking information |
johnc@2969 | 1417 | // vo == UseMarkWord -> use the mark word in the object header |
johnc@2969 | 1418 | // |
tonyp@1246 | 1419 | // NOTE: Only the "prev" marking information is guaranteed to be |
tonyp@1246 | 1420 | // consistent most of the time, so most calls to this should use |
johnc@2969 | 1421 | // vo == UsePrevMarking. |
johnc@2969 | 1422 | // Currently, there is only one case where this is called with |
johnc@2969 | 1423 | // vo == UseNextMarking, which is to verify the "next" marking |
johnc@2969 | 1424 | // information at the end of remark. |
johnc@2969 | 1425 | // Currently there is only one place where this is called with |
johnc@2969 | 1426 | // vo == UseMarkWord, which is to verify the marking during a |
johnc@2969 | 1427 | // full GC. |
johnc@2969 | 1428 | void verify(bool allow_dirty, bool silent, VerifyOption vo); |
tonyp@1246 | 1429 | |
tonyp@1246 | 1430 | // Override; it uses the "prev" marking information |
ysr@777 | 1431 | virtual void verify(bool allow_dirty, bool silent); |
tonyp@1273 | 1432 | // Default behavior by calling print(tty); |
ysr@777 | 1433 | virtual void print() const; |
tonyp@1273 | 1434 | // This calls print_on(st, PrintHeapAtGCExtended). |
ysr@777 | 1435 | virtual void print_on(outputStream* st) const; |
tonyp@1273 | 1436 | // If extended is true, it will print out information for all |
tonyp@1273 | 1437 | // regions in the heap by calling print_on_extended(st). |
tonyp@1273 | 1438 | virtual void print_on(outputStream* st, bool extended) const; |
tonyp@1273 | 1439 | virtual void print_on_extended(outputStream* st) const; |
ysr@777 | 1440 | |
ysr@777 | 1441 | virtual void print_gc_threads_on(outputStream* st) const; |
ysr@777 | 1442 | virtual void gc_threads_do(ThreadClosure* tc) const; |
ysr@777 | 1443 | |
ysr@777 | 1444 | // Override |
ysr@777 | 1445 | void print_tracing_info() const; |
ysr@777 | 1446 | |
tonyp@2974 | 1447 | // The following two methods are helpful for debugging RSet issues. |
tonyp@2974 | 1448 | void print_cset_rsets() PRODUCT_RETURN; |
tonyp@2974 | 1449 | void print_all_rsets() PRODUCT_RETURN; |
tonyp@2974 | 1450 | |
ysr@777 | 1451 | // Convenience function to be used in situations where the heap type can be |
ysr@777 | 1452 | // asserted to be this type. |
ysr@777 | 1453 | static G1CollectedHeap* heap(); |
ysr@777 | 1454 | |
ysr@777 | 1455 | void empty_young_list(); |
ysr@777 | 1456 | |
ysr@777 | 1457 | void set_region_short_lived_locked(HeapRegion* hr); |
ysr@777 | 1458 | // add appropriate methods for any other surv rate groups |
ysr@777 | 1459 | |
johnc@1829 | 1460 | YoungList* young_list() { return _young_list; } |
ysr@777 | 1461 | |
ysr@777 | 1462 | // debugging |
ysr@777 | 1463 | bool check_young_list_well_formed() { |
ysr@777 | 1464 | return _young_list->check_list_well_formed(); |
ysr@777 | 1465 | } |
johnc@1829 | 1466 | |
johnc@1829 | 1467 | bool check_young_list_empty(bool check_heap, |
ysr@777 | 1468 | bool check_sample = true); |
ysr@777 | 1469 | |
ysr@777 | 1470 | // *** Stuff related to concurrent marking. It's not clear to me that so |
ysr@777 | 1471 | // many of these need to be public. |
ysr@777 | 1472 | |
ysr@777 | 1473 | // The functions below are helper functions that a subclass of |
ysr@777 | 1474 | // "CollectedHeap" can use in the implementation of its virtual |
ysr@777 | 1475 | // functions. |
ysr@777 | 1476 | // This performs a concurrent marking of the live objects in a |
ysr@777 | 1477 | // bitmap off to the side. |
ysr@777 | 1478 | void doConcurrentMark(); |
ysr@777 | 1479 | |
ysr@777 | 1480 | bool isMarkedPrev(oop obj) const; |
ysr@777 | 1481 | bool isMarkedNext(oop obj) const; |
ysr@777 | 1482 | |
johnc@2969 | 1483 | // vo == UsePrevMarking -> use "prev" marking information, |
johnc@2969 | 1484 | // vo == UseNextMarking -> use "next" marking information, |
johnc@2969 | 1485 | // vo == UseMarkWord -> use mark word from object header |
tonyp@1246 | 1486 | bool is_obj_dead_cond(const oop obj, |
tonyp@1246 | 1487 | const HeapRegion* hr, |
johnc@2969 | 1488 | const VerifyOption vo) const { |
johnc@2969 | 1489 | |
johnc@2969 | 1490 | switch (vo) { |
johnc@2969 | 1491 | case VerifyOption_G1UsePrevMarking: |
johnc@2969 | 1492 | return is_obj_dead(obj, hr); |
johnc@2969 | 1493 | case VerifyOption_G1UseNextMarking: |
johnc@2969 | 1494 | return is_obj_ill(obj, hr); |
johnc@2969 | 1495 | default: |
johnc@2969 | 1496 | assert(vo == VerifyOption_G1UseMarkWord, "must be"); |
johnc@2969 | 1497 | return !obj->is_gc_marked(); |
tonyp@1246 | 1498 | } |
tonyp@1246 | 1499 | } |
tonyp@1246 | 1500 | |
ysr@777 | 1501 | // Determine if an object is dead, given the object and also |
ysr@777 | 1502 | // the region to which the object belongs. An object is dead |
ysr@777 | 1503 | // iff a) it was not allocated since the last mark and b) it |
ysr@777 | 1504 | // is not marked. |
ysr@777 | 1505 | |
ysr@777 | 1506 | bool is_obj_dead(const oop obj, const HeapRegion* hr) const { |
ysr@777 | 1507 | return |
ysr@777 | 1508 | !hr->obj_allocated_since_prev_marking(obj) && |
ysr@777 | 1509 | !isMarkedPrev(obj); |
ysr@777 | 1510 | } |
ysr@777 | 1511 | |
ysr@777 | 1512 | // This is used when copying an object to survivor space. |
ysr@777 | 1513 | // If the object is marked live, then we mark the copy live. |
ysr@777 | 1514 | // If the object is allocated since the start of this mark |
ysr@777 | 1515 | // cycle, then we mark the copy live. |
ysr@777 | 1516 | // If the object has been around since the previous mark |
ysr@777 | 1517 | // phase, and hasn't been marked yet during this phase, |
ysr@777 | 1518 | // then we don't mark it, we just wait for the |
ysr@777 | 1519 | // current marking cycle to get to it. |
ysr@777 | 1520 | |
ysr@777 | 1521 | // This function returns true when an object has been |
ysr@777 | 1522 | // around since the previous marking and hasn't yet |
ysr@777 | 1523 | // been marked during this marking. |
ysr@777 | 1524 | |
ysr@777 | 1525 | bool is_obj_ill(const oop obj, const HeapRegion* hr) const { |
ysr@777 | 1526 | return |
ysr@777 | 1527 | !hr->obj_allocated_since_next_marking(obj) && |
ysr@777 | 1528 | !isMarkedNext(obj); |
ysr@777 | 1529 | } |
ysr@777 | 1530 | |
ysr@777 | 1531 | // Determine if an object is dead, given only the object itself. |
ysr@777 | 1532 | // This will find the region to which the object belongs and |
ysr@777 | 1533 | // then call the region version of the same function. |
ysr@777 | 1534 | |
ysr@777 | 1535 | // Added if it is in permanent gen it isn't dead. |
ysr@777 | 1536 | // Added if it is NULL it isn't dead. |
ysr@777 | 1537 | |
johnc@2969 | 1538 | // vo == UsePrevMarking -> use "prev" marking information, |
johnc@2969 | 1539 | // vo == UseNextMarking -> use "next" marking information, |
johnc@2969 | 1540 | // vo == UseMarkWord -> use mark word from object header |
tonyp@1246 | 1541 | bool is_obj_dead_cond(const oop obj, |
johnc@2969 | 1542 | const VerifyOption vo) const { |
johnc@2969 | 1543 | |
johnc@2969 | 1544 | switch (vo) { |
johnc@2969 | 1545 | case VerifyOption_G1UsePrevMarking: |
johnc@2969 | 1546 | return is_obj_dead(obj); |
johnc@2969 | 1547 | case VerifyOption_G1UseNextMarking: |
johnc@2969 | 1548 | return is_obj_ill(obj); |
johnc@2969 | 1549 | default: |
johnc@2969 | 1550 | assert(vo == VerifyOption_G1UseMarkWord, "must be"); |
johnc@2969 | 1551 | return !obj->is_gc_marked(); |
tonyp@1246 | 1552 | } |
tonyp@1246 | 1553 | } |
tonyp@1246 | 1554 | |
johnc@2969 | 1555 | bool is_obj_dead(const oop obj) const { |
tonyp@1246 | 1556 | const HeapRegion* hr = heap_region_containing(obj); |
ysr@777 | 1557 | if (hr == NULL) { |
ysr@777 | 1558 | if (Universe::heap()->is_in_permanent(obj)) |
ysr@777 | 1559 | return false; |
ysr@777 | 1560 | else if (obj == NULL) return false; |
ysr@777 | 1561 | else return true; |
ysr@777 | 1562 | } |
ysr@777 | 1563 | else return is_obj_dead(obj, hr); |
ysr@777 | 1564 | } |
ysr@777 | 1565 | |
johnc@2969 | 1566 | bool is_obj_ill(const oop obj) const { |
tonyp@1246 | 1567 | const HeapRegion* hr = heap_region_containing(obj); |
ysr@777 | 1568 | if (hr == NULL) { |
ysr@777 | 1569 | if (Universe::heap()->is_in_permanent(obj)) |
ysr@777 | 1570 | return false; |
ysr@777 | 1571 | else if (obj == NULL) return false; |
ysr@777 | 1572 | else return true; |
ysr@777 | 1573 | } |
ysr@777 | 1574 | else return is_obj_ill(obj, hr); |
ysr@777 | 1575 | } |
ysr@777 | 1576 | |
ysr@777 | 1577 | // The following is just to alert the verification code |
ysr@777 | 1578 | // that a full collection has occurred and that the |
ysr@777 | 1579 | // remembered sets are no longer up to date. |
ysr@777 | 1580 | bool _full_collection; |
ysr@777 | 1581 | void set_full_collection() { _full_collection = true;} |
ysr@777 | 1582 | void clear_full_collection() {_full_collection = false;} |
ysr@777 | 1583 | bool full_collection() {return _full_collection;} |
ysr@777 | 1584 | |
ysr@777 | 1585 | ConcurrentMark* concurrent_mark() const { return _cm; } |
ysr@777 | 1586 | ConcurrentG1Refine* concurrent_g1_refine() const { return _cg1r; } |
ysr@777 | 1587 | |
apetrusenko@1231 | 1588 | // The dirty cards region list is used to record a subset of regions |
apetrusenko@1231 | 1589 | // whose cards need clearing. The list if populated during the |
apetrusenko@1231 | 1590 | // remembered set scanning and drained during the card table |
apetrusenko@1231 | 1591 | // cleanup. Although the methods are reentrant, population/draining |
apetrusenko@1231 | 1592 | // phases must not overlap. For synchronization purposes the last |
apetrusenko@1231 | 1593 | // element on the list points to itself. |
apetrusenko@1231 | 1594 | HeapRegion* _dirty_cards_region_list; |
apetrusenko@1231 | 1595 | void push_dirty_cards_region(HeapRegion* hr); |
apetrusenko@1231 | 1596 | HeapRegion* pop_dirty_cards_region(); |
apetrusenko@1231 | 1597 | |
ysr@777 | 1598 | public: |
ysr@777 | 1599 | void stop_conc_gc_threads(); |
ysr@777 | 1600 | |
ysr@777 | 1601 | // <NEW PREDICTION> |
ysr@777 | 1602 | |
ysr@777 | 1603 | double predict_region_elapsed_time_ms(HeapRegion* hr, bool young); |
ysr@777 | 1604 | void check_if_region_is_too_expensive(double predicted_time_ms); |
ysr@777 | 1605 | size_t pending_card_num(); |
ysr@777 | 1606 | size_t max_pending_card_num(); |
ysr@777 | 1607 | size_t cards_scanned(); |
ysr@777 | 1608 | |
ysr@777 | 1609 | // </NEW PREDICTION> |
ysr@777 | 1610 | |
ysr@777 | 1611 | protected: |
ysr@777 | 1612 | size_t _max_heap_capacity; |
ysr@777 | 1613 | }; |
ysr@777 | 1614 | |
ysr@1280 | 1615 | #define use_local_bitmaps 1 |
ysr@1280 | 1616 | #define verify_local_bitmaps 0 |
ysr@1280 | 1617 | #define oop_buffer_length 256 |
ysr@1280 | 1618 | |
ysr@1280 | 1619 | #ifndef PRODUCT |
ysr@1280 | 1620 | class GCLabBitMap; |
ysr@1280 | 1621 | class GCLabBitMapClosure: public BitMapClosure { |
ysr@1280 | 1622 | private: |
ysr@1280 | 1623 | ConcurrentMark* _cm; |
ysr@1280 | 1624 | GCLabBitMap* _bitmap; |
ysr@1280 | 1625 | |
ysr@1280 | 1626 | public: |
ysr@1280 | 1627 | GCLabBitMapClosure(ConcurrentMark* cm, |
ysr@1280 | 1628 | GCLabBitMap* bitmap) { |
ysr@1280 | 1629 | _cm = cm; |
ysr@1280 | 1630 | _bitmap = bitmap; |
ysr@1280 | 1631 | } |
ysr@1280 | 1632 | |
ysr@1280 | 1633 | virtual bool do_bit(size_t offset); |
ysr@1280 | 1634 | }; |
ysr@1280 | 1635 | #endif // !PRODUCT |
ysr@1280 | 1636 | |
ysr@1280 | 1637 | class GCLabBitMap: public BitMap { |
ysr@1280 | 1638 | private: |
ysr@1280 | 1639 | ConcurrentMark* _cm; |
ysr@1280 | 1640 | |
ysr@1280 | 1641 | int _shifter; |
ysr@1280 | 1642 | size_t _bitmap_word_covers_words; |
ysr@1280 | 1643 | |
ysr@1280 | 1644 | // beginning of the heap |
ysr@1280 | 1645 | HeapWord* _heap_start; |
ysr@1280 | 1646 | |
ysr@1280 | 1647 | // this is the actual start of the GCLab |
ysr@1280 | 1648 | HeapWord* _real_start_word; |
ysr@1280 | 1649 | |
ysr@1280 | 1650 | // this is the actual end of the GCLab |
ysr@1280 | 1651 | HeapWord* _real_end_word; |
ysr@1280 | 1652 | |
ysr@1280 | 1653 | // this is the first word, possibly located before the actual start |
ysr@1280 | 1654 | // of the GCLab, that corresponds to the first bit of the bitmap |
ysr@1280 | 1655 | HeapWord* _start_word; |
ysr@1280 | 1656 | |
ysr@1280 | 1657 | // size of a GCLab in words |
ysr@1280 | 1658 | size_t _gclab_word_size; |
ysr@1280 | 1659 | |
ysr@1280 | 1660 | static int shifter() { |
ysr@1280 | 1661 | return MinObjAlignment - 1; |
ysr@1280 | 1662 | } |
ysr@1280 | 1663 | |
ysr@1280 | 1664 | // how many heap words does a single bitmap word corresponds to? |
ysr@1280 | 1665 | static size_t bitmap_word_covers_words() { |
ysr@1280 | 1666 | return BitsPerWord << shifter(); |
ysr@1280 | 1667 | } |
ysr@1280 | 1668 | |
apetrusenko@1826 | 1669 | size_t gclab_word_size() const { |
apetrusenko@1826 | 1670 | return _gclab_word_size; |
ysr@1280 | 1671 | } |
ysr@1280 | 1672 | |
apetrusenko@1826 | 1673 | // Calculates actual GCLab size in words |
apetrusenko@1826 | 1674 | size_t gclab_real_word_size() const { |
apetrusenko@1826 | 1675 | return bitmap_size_in_bits(pointer_delta(_real_end_word, _start_word)) |
apetrusenko@1826 | 1676 | / BitsPerWord; |
apetrusenko@1826 | 1677 | } |
apetrusenko@1826 | 1678 | |
apetrusenko@1826 | 1679 | static size_t bitmap_size_in_bits(size_t gclab_word_size) { |
apetrusenko@1826 | 1680 | size_t bits_in_bitmap = gclab_word_size >> shifter(); |
ysr@1280 | 1681 | // We are going to ensure that the beginning of a word in this |
ysr@1280 | 1682 | // bitmap also corresponds to the beginning of a word in the |
ysr@1280 | 1683 | // global marking bitmap. To handle the case where a GCLab |
ysr@1280 | 1684 | // starts from the middle of the bitmap, we need to add enough |
ysr@1280 | 1685 | // space (i.e. up to a bitmap word) to ensure that we have |
ysr@1280 | 1686 | // enough bits in the bitmap. |
ysr@1280 | 1687 | return bits_in_bitmap + BitsPerWord - 1; |
ysr@1280 | 1688 | } |
ysr@1280 | 1689 | public: |
apetrusenko@1826 | 1690 | GCLabBitMap(HeapWord* heap_start, size_t gclab_word_size) |
apetrusenko@1826 | 1691 | : BitMap(bitmap_size_in_bits(gclab_word_size)), |
ysr@1280 | 1692 | _cm(G1CollectedHeap::heap()->concurrent_mark()), |
ysr@1280 | 1693 | _shifter(shifter()), |
ysr@1280 | 1694 | _bitmap_word_covers_words(bitmap_word_covers_words()), |
ysr@1280 | 1695 | _heap_start(heap_start), |
apetrusenko@1826 | 1696 | _gclab_word_size(gclab_word_size), |
ysr@1280 | 1697 | _real_start_word(NULL), |
ysr@1280 | 1698 | _real_end_word(NULL), |
ysr@1280 | 1699 | _start_word(NULL) |
ysr@1280 | 1700 | { |
ysr@1280 | 1701 | guarantee( size_in_words() >= bitmap_size_in_words(), |
ysr@1280 | 1702 | "just making sure"); |
ysr@1280 | 1703 | } |
ysr@1280 | 1704 | |
ysr@1280 | 1705 | inline unsigned heapWordToOffset(HeapWord* addr) { |
ysr@1280 | 1706 | unsigned offset = (unsigned) pointer_delta(addr, _start_word) >> _shifter; |
ysr@1280 | 1707 | assert(offset < size(), "offset should be within bounds"); |
ysr@1280 | 1708 | return offset; |
ysr@1280 | 1709 | } |
ysr@1280 | 1710 | |
ysr@1280 | 1711 | inline HeapWord* offsetToHeapWord(size_t offset) { |
ysr@1280 | 1712 | HeapWord* addr = _start_word + (offset << _shifter); |
ysr@1280 | 1713 | assert(_real_start_word <= addr && addr < _real_end_word, "invariant"); |
ysr@1280 | 1714 | return addr; |
ysr@1280 | 1715 | } |
ysr@1280 | 1716 | |
ysr@1280 | 1717 | bool fields_well_formed() { |
ysr@1280 | 1718 | bool ret1 = (_real_start_word == NULL) && |
ysr@1280 | 1719 | (_real_end_word == NULL) && |
ysr@1280 | 1720 | (_start_word == NULL); |
ysr@1280 | 1721 | if (ret1) |
ysr@1280 | 1722 | return true; |
ysr@1280 | 1723 | |
ysr@1280 | 1724 | bool ret2 = _real_start_word >= _start_word && |
ysr@1280 | 1725 | _start_word < _real_end_word && |
ysr@1280 | 1726 | (_real_start_word + _gclab_word_size) == _real_end_word && |
ysr@1280 | 1727 | (_start_word + _gclab_word_size + _bitmap_word_covers_words) |
ysr@1280 | 1728 | > _real_end_word; |
ysr@1280 | 1729 | return ret2; |
ysr@1280 | 1730 | } |
ysr@1280 | 1731 | |
ysr@1280 | 1732 | inline bool mark(HeapWord* addr) { |
ysr@1280 | 1733 | guarantee(use_local_bitmaps, "invariant"); |
ysr@1280 | 1734 | assert(fields_well_formed(), "invariant"); |
ysr@1280 | 1735 | |
ysr@1280 | 1736 | if (addr >= _real_start_word && addr < _real_end_word) { |
ysr@1280 | 1737 | assert(!isMarked(addr), "should not have already been marked"); |
ysr@1280 | 1738 | |
ysr@1280 | 1739 | // first mark it on the bitmap |
ysr@1280 | 1740 | at_put(heapWordToOffset(addr), true); |
ysr@1280 | 1741 | |
ysr@1280 | 1742 | return true; |
ysr@1280 | 1743 | } else { |
ysr@1280 | 1744 | return false; |
ysr@1280 | 1745 | } |
ysr@1280 | 1746 | } |
ysr@1280 | 1747 | |
ysr@1280 | 1748 | inline bool isMarked(HeapWord* addr) { |
ysr@1280 | 1749 | guarantee(use_local_bitmaps, "invariant"); |
ysr@1280 | 1750 | assert(fields_well_formed(), "invariant"); |
ysr@1280 | 1751 | |
ysr@1280 | 1752 | return at(heapWordToOffset(addr)); |
ysr@1280 | 1753 | } |
ysr@1280 | 1754 | |
ysr@1280 | 1755 | void set_buffer(HeapWord* start) { |
ysr@1280 | 1756 | guarantee(use_local_bitmaps, "invariant"); |
ysr@1280 | 1757 | clear(); |
ysr@1280 | 1758 | |
ysr@1280 | 1759 | assert(start != NULL, "invariant"); |
ysr@1280 | 1760 | _real_start_word = start; |
ysr@1280 | 1761 | _real_end_word = start + _gclab_word_size; |
ysr@1280 | 1762 | |
ysr@1280 | 1763 | size_t diff = |
ysr@1280 | 1764 | pointer_delta(start, _heap_start) % _bitmap_word_covers_words; |
ysr@1280 | 1765 | _start_word = start - diff; |
ysr@1280 | 1766 | |
ysr@1280 | 1767 | assert(fields_well_formed(), "invariant"); |
ysr@1280 | 1768 | } |
ysr@1280 | 1769 | |
ysr@1280 | 1770 | #ifndef PRODUCT |
ysr@1280 | 1771 | void verify() { |
ysr@1280 | 1772 | // verify that the marks have been propagated |
ysr@1280 | 1773 | GCLabBitMapClosure cl(_cm, this); |
ysr@1280 | 1774 | iterate(&cl); |
ysr@1280 | 1775 | } |
ysr@1280 | 1776 | #endif // PRODUCT |
ysr@1280 | 1777 | |
ysr@1280 | 1778 | void retire() { |
ysr@1280 | 1779 | guarantee(use_local_bitmaps, "invariant"); |
ysr@1280 | 1780 | assert(fields_well_formed(), "invariant"); |
ysr@1280 | 1781 | |
ysr@1280 | 1782 | if (_start_word != NULL) { |
ysr@1280 | 1783 | CMBitMap* mark_bitmap = _cm->nextMarkBitMap(); |
ysr@1280 | 1784 | |
ysr@1280 | 1785 | // this means that the bitmap was set up for the GCLab |
ysr@1280 | 1786 | assert(_real_start_word != NULL && _real_end_word != NULL, "invariant"); |
ysr@1280 | 1787 | |
ysr@1280 | 1788 | mark_bitmap->mostly_disjoint_range_union(this, |
ysr@1280 | 1789 | 0, // always start from the start of the bitmap |
ysr@1280 | 1790 | _start_word, |
apetrusenko@1826 | 1791 | gclab_real_word_size()); |
ysr@1280 | 1792 | _cm->grayRegionIfNecessary(MemRegion(_real_start_word, _real_end_word)); |
ysr@1280 | 1793 | |
ysr@1280 | 1794 | #ifndef PRODUCT |
ysr@1280 | 1795 | if (use_local_bitmaps && verify_local_bitmaps) |
ysr@1280 | 1796 | verify(); |
ysr@1280 | 1797 | #endif // PRODUCT |
ysr@1280 | 1798 | } else { |
ysr@1280 | 1799 | assert(_real_start_word == NULL && _real_end_word == NULL, "invariant"); |
ysr@1280 | 1800 | } |
ysr@1280 | 1801 | } |
ysr@1280 | 1802 | |
apetrusenko@1826 | 1803 | size_t bitmap_size_in_words() const { |
apetrusenko@1826 | 1804 | return (bitmap_size_in_bits(gclab_word_size()) + BitsPerWord - 1) / BitsPerWord; |
ysr@1280 | 1805 | } |
apetrusenko@1826 | 1806 | |
ysr@1280 | 1807 | }; |
ysr@1280 | 1808 | |
ysr@1280 | 1809 | class G1ParGCAllocBuffer: public ParGCAllocBuffer { |
ysr@1280 | 1810 | private: |
ysr@1280 | 1811 | bool _retired; |
johnc@3086 | 1812 | bool _should_mark_objects; |
ysr@1280 | 1813 | GCLabBitMap _bitmap; |
ysr@1280 | 1814 | |
ysr@1280 | 1815 | public: |
johnc@3086 | 1816 | G1ParGCAllocBuffer(size_t gclab_word_size); |
ysr@1280 | 1817 | |
ysr@1280 | 1818 | inline bool mark(HeapWord* addr) { |
ysr@1280 | 1819 | guarantee(use_local_bitmaps, "invariant"); |
johnc@3086 | 1820 | assert(_should_mark_objects, "invariant"); |
ysr@1280 | 1821 | return _bitmap.mark(addr); |
ysr@1280 | 1822 | } |
ysr@1280 | 1823 | |
ysr@1280 | 1824 | inline void set_buf(HeapWord* buf) { |
johnc@3086 | 1825 | if (use_local_bitmaps && _should_mark_objects) { |
ysr@1280 | 1826 | _bitmap.set_buffer(buf); |
johnc@3086 | 1827 | } |
ysr@1280 | 1828 | ParGCAllocBuffer::set_buf(buf); |
ysr@1280 | 1829 | _retired = false; |
ysr@1280 | 1830 | } |
ysr@1280 | 1831 | |
ysr@1280 | 1832 | inline void retire(bool end_of_gc, bool retain) { |
ysr@1280 | 1833 | if (_retired) |
ysr@1280 | 1834 | return; |
johnc@3086 | 1835 | if (use_local_bitmaps && _should_mark_objects) { |
ysr@1280 | 1836 | _bitmap.retire(); |
ysr@1280 | 1837 | } |
ysr@1280 | 1838 | ParGCAllocBuffer::retire(end_of_gc, retain); |
ysr@1280 | 1839 | _retired = true; |
ysr@1280 | 1840 | } |
ysr@1280 | 1841 | }; |
ysr@1280 | 1842 | |
ysr@1280 | 1843 | class G1ParScanThreadState : public StackObj { |
ysr@1280 | 1844 | protected: |
ysr@1280 | 1845 | G1CollectedHeap* _g1h; |
ysr@1280 | 1846 | RefToScanQueue* _refs; |
ysr@1280 | 1847 | DirtyCardQueue _dcq; |
ysr@1280 | 1848 | CardTableModRefBS* _ct_bs; |
ysr@1280 | 1849 | G1RemSet* _g1_rem; |
ysr@1280 | 1850 | |
apetrusenko@1826 | 1851 | G1ParGCAllocBuffer _surviving_alloc_buffer; |
apetrusenko@1826 | 1852 | G1ParGCAllocBuffer _tenured_alloc_buffer; |
apetrusenko@1826 | 1853 | G1ParGCAllocBuffer* _alloc_buffers[GCAllocPurposeCount]; |
apetrusenko@1826 | 1854 | ageTable _age_table; |
ysr@1280 | 1855 | |
ysr@1280 | 1856 | size_t _alloc_buffer_waste; |
ysr@1280 | 1857 | size_t _undo_waste; |
ysr@1280 | 1858 | |
ysr@1280 | 1859 | OopsInHeapRegionClosure* _evac_failure_cl; |
ysr@1280 | 1860 | G1ParScanHeapEvacClosure* _evac_cl; |
ysr@1280 | 1861 | G1ParScanPartialArrayClosure* _partial_scan_cl; |
ysr@1280 | 1862 | |
ysr@1280 | 1863 | int _hash_seed; |
ysr@1280 | 1864 | int _queue_num; |
ysr@1280 | 1865 | |
tonyp@1966 | 1866 | size_t _term_attempts; |
ysr@1280 | 1867 | |
ysr@1280 | 1868 | double _start; |
ysr@1280 | 1869 | double _start_strong_roots; |
ysr@1280 | 1870 | double _strong_roots_time; |
ysr@1280 | 1871 | double _start_term; |
ysr@1280 | 1872 | double _term_time; |
ysr@1280 | 1873 | |
ysr@1280 | 1874 | // Map from young-age-index (0 == not young, 1 is youngest) to |
ysr@1280 | 1875 | // surviving words. base is what we get back from the malloc call |
ysr@1280 | 1876 | size_t* _surviving_young_words_base; |
ysr@1280 | 1877 | // this points into the array, as we use the first few entries for padding |
ysr@1280 | 1878 | size_t* _surviving_young_words; |
ysr@1280 | 1879 | |
jcoomes@2064 | 1880 | #define PADDING_ELEM_NUM (DEFAULT_CACHE_LINE_SIZE / sizeof(size_t)) |
ysr@1280 | 1881 | |
ysr@1280 | 1882 | void add_to_alloc_buffer_waste(size_t waste) { _alloc_buffer_waste += waste; } |
ysr@1280 | 1883 | |
ysr@1280 | 1884 | void add_to_undo_waste(size_t waste) { _undo_waste += waste; } |
ysr@1280 | 1885 | |
ysr@1280 | 1886 | DirtyCardQueue& dirty_card_queue() { return _dcq; } |
ysr@1280 | 1887 | CardTableModRefBS* ctbs() { return _ct_bs; } |
ysr@1280 | 1888 | |
ysr@1280 | 1889 | template <class T> void immediate_rs_update(HeapRegion* from, T* p, int tid) { |
ysr@1280 | 1890 | if (!from->is_survivor()) { |
ysr@1280 | 1891 | _g1_rem->par_write_ref(from, p, tid); |
ysr@1280 | 1892 | } |
ysr@1280 | 1893 | } |
ysr@1280 | 1894 | |
ysr@1280 | 1895 | template <class T> void deferred_rs_update(HeapRegion* from, T* p, int tid) { |
ysr@1280 | 1896 | // If the new value of the field points to the same region or |
ysr@1280 | 1897 | // is the to-space, we don't need to include it in the Rset updates. |
ysr@1280 | 1898 | if (!from->is_in_reserved(oopDesc::load_decode_heap_oop(p)) && !from->is_survivor()) { |
ysr@1280 | 1899 | size_t card_index = ctbs()->index_for(p); |
ysr@1280 | 1900 | // If the card hasn't been added to the buffer, do it. |
ysr@1280 | 1901 | if (ctbs()->mark_card_deferred(card_index)) { |
ysr@1280 | 1902 | dirty_card_queue().enqueue((jbyte*)ctbs()->byte_for_index(card_index)); |
ysr@1280 | 1903 | } |
ysr@1280 | 1904 | } |
ysr@1280 | 1905 | } |
ysr@1280 | 1906 | |
ysr@1280 | 1907 | public: |
ysr@1280 | 1908 | G1ParScanThreadState(G1CollectedHeap* g1h, int queue_num); |
ysr@1280 | 1909 | |
ysr@1280 | 1910 | ~G1ParScanThreadState() { |
ysr@1280 | 1911 | FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base); |
ysr@1280 | 1912 | } |
ysr@1280 | 1913 | |
ysr@1280 | 1914 | RefToScanQueue* refs() { return _refs; } |
ysr@1280 | 1915 | ageTable* age_table() { return &_age_table; } |
ysr@1280 | 1916 | |
ysr@1280 | 1917 | G1ParGCAllocBuffer* alloc_buffer(GCAllocPurpose purpose) { |
apetrusenko@1826 | 1918 | return _alloc_buffers[purpose]; |
ysr@1280 | 1919 | } |
ysr@1280 | 1920 | |
jcoomes@2064 | 1921 | size_t alloc_buffer_waste() const { return _alloc_buffer_waste; } |
jcoomes@2064 | 1922 | size_t undo_waste() const { return _undo_waste; } |
ysr@1280 | 1923 | |
jcoomes@2217 | 1924 | #ifdef ASSERT |
jcoomes@2217 | 1925 | bool verify_ref(narrowOop* ref) const; |
jcoomes@2217 | 1926 | bool verify_ref(oop* ref) const; |
jcoomes@2217 | 1927 | bool verify_task(StarTask ref) const; |
jcoomes@2217 | 1928 | #endif // ASSERT |
jcoomes@2217 | 1929 | |
ysr@1280 | 1930 | template <class T> void push_on_queue(T* ref) { |
jcoomes@2217 | 1931 | assert(verify_ref(ref), "sanity"); |
jcoomes@2064 | 1932 | refs()->push(ref); |
ysr@1280 | 1933 | } |
ysr@1280 | 1934 | |
ysr@1280 | 1935 | template <class T> void update_rs(HeapRegion* from, T* p, int tid) { |
ysr@1280 | 1936 | if (G1DeferredRSUpdate) { |
ysr@1280 | 1937 | deferred_rs_update(from, p, tid); |
ysr@1280 | 1938 | } else { |
ysr@1280 | 1939 | immediate_rs_update(from, p, tid); |
ysr@1280 | 1940 | } |
ysr@1280 | 1941 | } |
ysr@1280 | 1942 | |
ysr@1280 | 1943 | HeapWord* allocate_slow(GCAllocPurpose purpose, size_t word_sz) { |
ysr@1280 | 1944 | |
ysr@1280 | 1945 | HeapWord* obj = NULL; |
apetrusenko@1826 | 1946 | size_t gclab_word_size = _g1h->desired_plab_sz(purpose); |
apetrusenko@1826 | 1947 | if (word_sz * 100 < gclab_word_size * ParallelGCBufferWastePct) { |
ysr@1280 | 1948 | G1ParGCAllocBuffer* alloc_buf = alloc_buffer(purpose); |
apetrusenko@1826 | 1949 | assert(gclab_word_size == alloc_buf->word_sz(), |
apetrusenko@1826 | 1950 | "dynamic resizing is not supported"); |
ysr@1280 | 1951 | add_to_alloc_buffer_waste(alloc_buf->words_remaining()); |
ysr@1280 | 1952 | alloc_buf->retire(false, false); |
ysr@1280 | 1953 | |
apetrusenko@1826 | 1954 | HeapWord* buf = _g1h->par_allocate_during_gc(purpose, gclab_word_size); |
ysr@1280 | 1955 | if (buf == NULL) return NULL; // Let caller handle allocation failure. |
ysr@1280 | 1956 | // Otherwise. |
ysr@1280 | 1957 | alloc_buf->set_buf(buf); |
ysr@1280 | 1958 | |
ysr@1280 | 1959 | obj = alloc_buf->allocate(word_sz); |
ysr@1280 | 1960 | assert(obj != NULL, "buffer was definitely big enough..."); |
ysr@1280 | 1961 | } else { |
ysr@1280 | 1962 | obj = _g1h->par_allocate_during_gc(purpose, word_sz); |
ysr@1280 | 1963 | } |
ysr@1280 | 1964 | return obj; |
ysr@1280 | 1965 | } |
ysr@1280 | 1966 | |
ysr@1280 | 1967 | HeapWord* allocate(GCAllocPurpose purpose, size_t word_sz) { |
ysr@1280 | 1968 | HeapWord* obj = alloc_buffer(purpose)->allocate(word_sz); |
ysr@1280 | 1969 | if (obj != NULL) return obj; |
ysr@1280 | 1970 | return allocate_slow(purpose, word_sz); |
ysr@1280 | 1971 | } |
ysr@1280 | 1972 | |
ysr@1280 | 1973 | void undo_allocation(GCAllocPurpose purpose, HeapWord* obj, size_t word_sz) { |
ysr@1280 | 1974 | if (alloc_buffer(purpose)->contains(obj)) { |
ysr@1280 | 1975 | assert(alloc_buffer(purpose)->contains(obj + word_sz - 1), |
ysr@1280 | 1976 | "should contain whole object"); |
ysr@1280 | 1977 | alloc_buffer(purpose)->undo_allocation(obj, word_sz); |
ysr@1280 | 1978 | } else { |
ysr@1280 | 1979 | CollectedHeap::fill_with_object(obj, word_sz); |
ysr@1280 | 1980 | add_to_undo_waste(word_sz); |
ysr@1280 | 1981 | } |
ysr@1280 | 1982 | } |
ysr@1280 | 1983 | |
ysr@1280 | 1984 | void set_evac_failure_closure(OopsInHeapRegionClosure* evac_failure_cl) { |
ysr@1280 | 1985 | _evac_failure_cl = evac_failure_cl; |
ysr@1280 | 1986 | } |
ysr@1280 | 1987 | OopsInHeapRegionClosure* evac_failure_closure() { |
ysr@1280 | 1988 | return _evac_failure_cl; |
ysr@1280 | 1989 | } |
ysr@1280 | 1990 | |
ysr@1280 | 1991 | void set_evac_closure(G1ParScanHeapEvacClosure* evac_cl) { |
ysr@1280 | 1992 | _evac_cl = evac_cl; |
ysr@1280 | 1993 | } |
ysr@1280 | 1994 | |
ysr@1280 | 1995 | void set_partial_scan_closure(G1ParScanPartialArrayClosure* partial_scan_cl) { |
ysr@1280 | 1996 | _partial_scan_cl = partial_scan_cl; |
ysr@1280 | 1997 | } |
ysr@1280 | 1998 | |
ysr@1280 | 1999 | int* hash_seed() { return &_hash_seed; } |
ysr@1280 | 2000 | int queue_num() { return _queue_num; } |
ysr@1280 | 2001 | |
jcoomes@2064 | 2002 | size_t term_attempts() const { return _term_attempts; } |
tonyp@1966 | 2003 | void note_term_attempt() { _term_attempts++; } |
ysr@1280 | 2004 | |
ysr@1280 | 2005 | void start_strong_roots() { |
ysr@1280 | 2006 | _start_strong_roots = os::elapsedTime(); |
ysr@1280 | 2007 | } |
ysr@1280 | 2008 | void end_strong_roots() { |
ysr@1280 | 2009 | _strong_roots_time += (os::elapsedTime() - _start_strong_roots); |
ysr@1280 | 2010 | } |
jcoomes@2064 | 2011 | double strong_roots_time() const { return _strong_roots_time; } |
ysr@1280 | 2012 | |
ysr@1280 | 2013 | void start_term_time() { |
ysr@1280 | 2014 | note_term_attempt(); |
ysr@1280 | 2015 | _start_term = os::elapsedTime(); |
ysr@1280 | 2016 | } |
ysr@1280 | 2017 | void end_term_time() { |
ysr@1280 | 2018 | _term_time += (os::elapsedTime() - _start_term); |
ysr@1280 | 2019 | } |
jcoomes@2064 | 2020 | double term_time() const { return _term_time; } |
ysr@1280 | 2021 | |
jcoomes@2064 | 2022 | double elapsed_time() const { |
ysr@1280 | 2023 | return os::elapsedTime() - _start; |
ysr@1280 | 2024 | } |
ysr@1280 | 2025 | |
jcoomes@2064 | 2026 | static void |
jcoomes@2064 | 2027 | print_termination_stats_hdr(outputStream* const st = gclog_or_tty); |
jcoomes@2064 | 2028 | void |
jcoomes@2064 | 2029 | print_termination_stats(int i, outputStream* const st = gclog_or_tty) const; |
jcoomes@2064 | 2030 | |
ysr@1280 | 2031 | size_t* surviving_young_words() { |
ysr@1280 | 2032 | // We add on to hide entry 0 which accumulates surviving words for |
ysr@1280 | 2033 | // age -1 regions (i.e. non-young ones) |
ysr@1280 | 2034 | return _surviving_young_words; |
ysr@1280 | 2035 | } |
ysr@1280 | 2036 | |
ysr@1280 | 2037 | void retire_alloc_buffers() { |
ysr@1280 | 2038 | for (int ap = 0; ap < GCAllocPurposeCount; ++ap) { |
apetrusenko@1826 | 2039 | size_t waste = _alloc_buffers[ap]->words_remaining(); |
ysr@1280 | 2040 | add_to_alloc_buffer_waste(waste); |
apetrusenko@1826 | 2041 | _alloc_buffers[ap]->retire(true, false); |
ysr@1280 | 2042 | } |
ysr@1280 | 2043 | } |
ysr@1280 | 2044 | |
ysr@1280 | 2045 | template <class T> void deal_with_reference(T* ref_to_scan) { |
ysr@1280 | 2046 | if (has_partial_array_mask(ref_to_scan)) { |
ysr@1280 | 2047 | _partial_scan_cl->do_oop_nv(ref_to_scan); |
ysr@1280 | 2048 | } else { |
ysr@1280 | 2049 | // Note: we can use "raw" versions of "region_containing" because |
ysr@1280 | 2050 | // "obj_to_scan" is definitely in the heap, and is not in a |
ysr@1280 | 2051 | // humongous region. |
ysr@1280 | 2052 | HeapRegion* r = _g1h->heap_region_containing_raw(ref_to_scan); |
ysr@1280 | 2053 | _evac_cl->set_region(r); |
ysr@1280 | 2054 | _evac_cl->do_oop_nv(ref_to_scan); |
ysr@1280 | 2055 | } |
ysr@1280 | 2056 | } |
ysr@1280 | 2057 | |
jcoomes@2217 | 2058 | void deal_with_reference(StarTask ref) { |
jcoomes@2217 | 2059 | assert(verify_task(ref), "sanity"); |
jcoomes@2217 | 2060 | if (ref.is_narrow()) { |
jcoomes@2217 | 2061 | deal_with_reference((narrowOop*)ref); |
jcoomes@2217 | 2062 | } else { |
jcoomes@2217 | 2063 | deal_with_reference((oop*)ref); |
ysr@1280 | 2064 | } |
ysr@1280 | 2065 | } |
jcoomes@2217 | 2066 | |
jcoomes@2217 | 2067 | public: |
jcoomes@2217 | 2068 | void trim_queue(); |
ysr@1280 | 2069 | }; |
stefank@2314 | 2070 | |
stefank@2314 | 2071 | #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTEDHEAP_HPP |