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