1 /*
2 * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #if !defined(__clang_major__) && defined(__GNUC__)
26 // FIXME, formats have issues. Disable this macro definition, compile, and study warnings for more information.
27 #define ATTRIBUTE_PRINTF(x,y)
28 #endif
29
30 #include "precompiled.hpp"
31 #include "classfile/metadataOnStackMark.hpp"
32 #include "classfile/stringTable.hpp"
33 #include "code/codeCache.hpp"
34 #include "code/icBuffer.hpp"
35 #include "gc_implementation/g1/bufferingOopClosure.hpp"
36 #include "gc_implementation/g1/concurrentG1Refine.hpp"
37 #include "gc_implementation/g1/concurrentG1RefineThread.hpp"
38 #include "gc_implementation/g1/concurrentMarkThread.inline.hpp"
39 #include "gc_implementation/g1/g1AllocRegion.inline.hpp"
40 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
41 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
42 #include "gc_implementation/g1/g1ErgoVerbose.hpp"
43 #include "gc_implementation/g1/g1EvacFailure.hpp"
44 #include "gc_implementation/g1/g1GCPhaseTimes.hpp"
45 #include "gc_implementation/g1/g1Log.hpp"
46 #include "gc_implementation/g1/g1MarkSweep.hpp"
47 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
48 #include "gc_implementation/g1/g1ParScanThreadState.inline.hpp"
49 #include "gc_implementation/g1/g1RegionToSpaceMapper.hpp"
50 #include "gc_implementation/g1/g1RemSet.inline.hpp"
51 #include "gc_implementation/g1/g1RootProcessor.hpp"
52 #include "gc_implementation/g1/g1StringDedup.hpp"
53 #include "gc_implementation/g1/g1YCTypes.hpp"
54 #include "gc_implementation/g1/heapRegion.inline.hpp"
55 #include "gc_implementation/g1/heapRegionRemSet.hpp"
56 #include "gc_implementation/g1/heapRegionSet.inline.hpp"
57 #include "gc_implementation/g1/vm_operations_g1.hpp"
58 #include "gc_implementation/shared/gcHeapSummary.hpp"
59 #include "gc_implementation/shared/gcTimer.hpp"
60 #include "gc_implementation/shared/gcTrace.hpp"
61 #include "gc_implementation/shared/gcTraceTime.hpp"
62 #include "gc_implementation/shared/isGCActiveMark.hpp"
63 #include "memory/allocation.hpp"
64 #include "memory/gcLocker.inline.hpp"
65 #include "memory/generationSpec.hpp"
66 #include "memory/iterator.hpp"
67 #include "memory/referenceProcessor.hpp"
68 #include "oops/oop.inline.hpp"
69 #include "runtime/atomic.inline.hpp"
70 #include "runtime/orderAccess.inline.hpp"
71 #include "runtime/vmThread.hpp"
72 #include "utilities/globalDefinitions.hpp"
73
74 size_t G1CollectedHeap::_humongous_object_threshold_in_words = 0;
75
76 // turn it on so that the contents of the young list (scan-only /
77 // to-be-collected) are printed at "strategic" points before / during
78 // / after the collection --- this is useful for debugging
79 #define YOUNG_LIST_VERBOSE 0
80 // CURRENT STATUS
81 // This file is under construction. Search for "FIXME".
82
83 // INVARIANTS/NOTES
84 //
85 // All allocation activity covered by the G1CollectedHeap interface is
86 // serialized by acquiring the HeapLock. This happens in mem_allocate
87 // and allocate_new_tlab, which are the "entry" points to the
88 // allocation code from the rest of the JVM. (Note that this does not
89 // apply to TLAB allocation, which is not part of this interface: it
90 // is done by clients of this interface.)
91
92 // Local to this file.
93
94 class RefineCardTableEntryClosure: public CardTableEntryClosure {
95 bool _concurrent;
96 public:
97 RefineCardTableEntryClosure() : _concurrent(true) { }
98
99 bool do_card_ptr(jbyte* card_ptr, uint worker_i) {
100 bool oops_into_cset = G1CollectedHeap::heap()->g1_rem_set()->refine_card(card_ptr, worker_i, false);
101 // This path is executed by the concurrent refine or mutator threads,
102 // concurrently, and so we do not care if card_ptr contains references
103 // that point into the collection set.
104 assert(!oops_into_cset, "should be");
105
106 if (_concurrent && SuspendibleThreadSet::should_yield()) {
107 // Caller will actually yield.
108 return false;
109 }
110 // Otherwise, we finished successfully; return true.
111 return true;
112 }
113
114 void set_concurrent(bool b) { _concurrent = b; }
115 };
116
117
118 class RedirtyLoggedCardTableEntryClosure : public CardTableEntryClosure {
119 private:
120 size_t _num_processed;
121
122 public:
123 RedirtyLoggedCardTableEntryClosure() : CardTableEntryClosure(), _num_processed(0) { }
124
125 bool do_card_ptr(jbyte* card_ptr, uint worker_i) {
126 *card_ptr = CardTableModRefBS::dirty_card_val();
127 _num_processed++;
128 return true;
129 }
130
131 size_t num_processed() const { return _num_processed; }
132 };
133
134 YoungList::YoungList(G1CollectedHeap* g1h) :
135 _g1h(g1h), _head(NULL), _length(0), _last_sampled_rs_lengths(0),
136 _survivor_head(NULL), _survivor_tail(NULL), _survivor_length(0) {
137 guarantee(check_list_empty(false), "just making sure...");
138 }
139
140 void YoungList::push_region(HeapRegion *hr) {
141 assert(!hr->is_young(), "should not already be young");
142 assert(hr->get_next_young_region() == NULL, "cause it should!");
143
144 hr->set_next_young_region(_head);
145 _head = hr;
146
147 _g1h->g1_policy()->set_region_eden(hr, (int) _length);
148 ++_length;
149 }
150
151 void YoungList::add_survivor_region(HeapRegion* hr) {
152 assert(hr->is_survivor(), "should be flagged as survivor region");
153 assert(hr->get_next_young_region() == NULL, "cause it should!");
154
155 hr->set_next_young_region(_survivor_head);
156 if (_survivor_head == NULL) {
157 _survivor_tail = hr;
158 }
159 _survivor_head = hr;
160 ++_survivor_length;
161 }
162
163 void YoungList::empty_list(HeapRegion* list) {
164 while (list != NULL) {
165 HeapRegion* next = list->get_next_young_region();
166 list->set_next_young_region(NULL);
167 list->uninstall_surv_rate_group();
168 // This is called before a Full GC and all the non-empty /
169 // non-humongous regions at the end of the Full GC will end up as
170 // old anyway.
171 list->set_old();
172 list = next;
173 }
174 }
175
176 void YoungList::empty_list() {
177 assert(check_list_well_formed(), "young list should be well formed");
178
179 empty_list(_head);
180 _head = NULL;
181 _length = 0;
182
183 empty_list(_survivor_head);
184 _survivor_head = NULL;
185 _survivor_tail = NULL;
186 _survivor_length = 0;
187
188 _last_sampled_rs_lengths = 0;
189
190 assert(check_list_empty(false), "just making sure...");
191 }
192
193 bool YoungList::check_list_well_formed() {
194 bool ret = true;
195
196 uint length = 0;
197 HeapRegion* curr = _head;
198 HeapRegion* last = NULL;
199 while (curr != NULL) {
200 if (!curr->is_young()) {
201 gclog_or_tty->print_cr("### YOUNG REGION "PTR_FORMAT"-"PTR_FORMAT" "
202 "incorrectly tagged (y: %d, surv: %d)",
203 curr->bottom(), curr->end(),
204 curr->is_young(), curr->is_survivor());
205 ret = false;
206 }
207 ++length;
208 last = curr;
209 curr = curr->get_next_young_region();
210 }
211 ret = ret && (length == _length);
212
213 if (!ret) {
214 gclog_or_tty->print_cr("### YOUNG LIST seems not well formed!");
215 gclog_or_tty->print_cr("### list has %u entries, _length is %u",
216 length, _length);
217 }
218
219 return ret;
220 }
221
222 bool YoungList::check_list_empty(bool check_sample) {
223 bool ret = true;
224
225 if (_length != 0) {
226 gclog_or_tty->print_cr("### YOUNG LIST should have 0 length, not %u",
227 _length);
228 ret = false;
229 }
230 if (check_sample && _last_sampled_rs_lengths != 0) {
231 gclog_or_tty->print_cr("### YOUNG LIST has non-zero last sampled RS lengths");
232 ret = false;
233 }
234 if (_head != NULL) {
235 gclog_or_tty->print_cr("### YOUNG LIST does not have a NULL head");
236 ret = false;
237 }
238 if (!ret) {
239 gclog_or_tty->print_cr("### YOUNG LIST does not seem empty");
240 }
241
242 return ret;
243 }
244
245 void
246 YoungList::rs_length_sampling_init() {
247 _sampled_rs_lengths = 0;
248 _curr = _head;
249 }
250
251 bool
252 YoungList::rs_length_sampling_more() {
253 return _curr != NULL;
254 }
255
256 void
257 YoungList::rs_length_sampling_next() {
258 assert( _curr != NULL, "invariant" );
259 size_t rs_length = _curr->rem_set()->occupied();
260
261 _sampled_rs_lengths += rs_length;
262
263 // The current region may not yet have been added to the
264 // incremental collection set (it gets added when it is
265 // retired as the current allocation region).
266 if (_curr->in_collection_set()) {
267 // Update the collection set policy information for this region
268 _g1h->g1_policy()->update_incremental_cset_info(_curr, rs_length);
269 }
270
271 _curr = _curr->get_next_young_region();
272 if (_curr == NULL) {
273 _last_sampled_rs_lengths = _sampled_rs_lengths;
274 // gclog_or_tty->print_cr("last sampled RS lengths = %d", _last_sampled_rs_lengths);
275 }
276 }
277
278 void
279 YoungList::reset_auxilary_lists() {
280 guarantee( is_empty(), "young list should be empty" );
281 assert(check_list_well_formed(), "young list should be well formed");
282
283 // Add survivor regions to SurvRateGroup.
284 _g1h->g1_policy()->note_start_adding_survivor_regions();
285 _g1h->g1_policy()->finished_recalculating_age_indexes(true /* is_survivors */);
286
287 int young_index_in_cset = 0;
288 for (HeapRegion* curr = _survivor_head;
289 curr != NULL;
290 curr = curr->get_next_young_region()) {
291 _g1h->g1_policy()->set_region_survivor(curr, young_index_in_cset);
292
293 // The region is a non-empty survivor so let's add it to
294 // the incremental collection set for the next evacuation
295 // pause.
296 _g1h->g1_policy()->add_region_to_incremental_cset_rhs(curr);
297 young_index_in_cset += 1;
298 }
299 assert((uint) young_index_in_cset == _survivor_length, "post-condition");
300 _g1h->g1_policy()->note_stop_adding_survivor_regions();
301
302 _head = _survivor_head;
303 _length = _survivor_length;
304 if (_survivor_head != NULL) {
305 assert(_survivor_tail != NULL, "cause it shouldn't be");
306 assert(_survivor_length > 0, "invariant");
307 _survivor_tail->set_next_young_region(NULL);
308 }
309
310 // Don't clear the survivor list handles until the start of
311 // the next evacuation pause - we need it in order to re-tag
312 // the survivor regions from this evacuation pause as 'young'
313 // at the start of the next.
314
315 _g1h->g1_policy()->finished_recalculating_age_indexes(false /* is_survivors */);
316
317 assert(check_list_well_formed(), "young list should be well formed");
318 }
319
320 void YoungList::print() {
321 HeapRegion* lists[] = {_head, _survivor_head};
322 const char* names[] = {"YOUNG", "SURVIVOR"};
323
324 for (uint list = 0; list < ARRAY_SIZE(lists); ++list) {
325 gclog_or_tty->print_cr("%s LIST CONTENTS", names[list]);
326 HeapRegion *curr = lists[list];
327 if (curr == NULL)
328 gclog_or_tty->print_cr(" empty");
329 while (curr != NULL) {
330 gclog_or_tty->print_cr(" "HR_FORMAT", P: "PTR_FORMAT ", N: "PTR_FORMAT", age: %4d",
331 HR_FORMAT_PARAMS(curr),
332 curr->prev_top_at_mark_start(),
333 curr->next_top_at_mark_start(),
334 curr->age_in_surv_rate_group_cond());
335 curr = curr->get_next_young_region();
336 }
337 }
338
339 gclog_or_tty->cr();
340 }
341
342 void G1RegionMappingChangedListener::reset_from_card_cache(uint start_idx, size_t num_regions) {
343 HeapRegionRemSet::invalidate_from_card_cache(start_idx, num_regions);
344 }
345
346 void G1RegionMappingChangedListener::on_commit(uint start_idx, size_t num_regions, bool zero_filled) {
347 // The from card cache is not the memory that is actually committed. So we cannot
348 // take advantage of the zero_filled parameter.
349 reset_from_card_cache(start_idx, num_regions);
350 }
351
352 void G1CollectedHeap::push_dirty_cards_region(HeapRegion* hr)
353 {
354 // Claim the right to put the region on the dirty cards region list
355 // by installing a self pointer.
356 HeapRegion* next = hr->get_next_dirty_cards_region();
357 if (next == NULL) {
358 HeapRegion* res = (HeapRegion*)
359 Atomic::cmpxchg_ptr(hr, hr->next_dirty_cards_region_addr(),
360 NULL);
361 if (res == NULL) {
362 HeapRegion* head;
363 do {
364 // Put the region to the dirty cards region list.
365 head = _dirty_cards_region_list;
366 next = (HeapRegion*)
367 Atomic::cmpxchg_ptr(hr, &_dirty_cards_region_list, head);
368 if (next == head) {
369 assert(hr->get_next_dirty_cards_region() == hr,
370 "hr->get_next_dirty_cards_region() != hr");
371 if (next == NULL) {
372 // The last region in the list points to itself.
373 hr->set_next_dirty_cards_region(hr);
374 } else {
375 hr->set_next_dirty_cards_region(next);
376 }
377 }
378 } while (next != head);
379 }
380 }
381 }
382
383 HeapRegion* G1CollectedHeap::pop_dirty_cards_region()
384 {
385 HeapRegion* head;
386 HeapRegion* hr;
387 do {
388 head = _dirty_cards_region_list;
389 if (head == NULL) {
390 return NULL;
391 }
392 HeapRegion* new_head = head->get_next_dirty_cards_region();
393 if (head == new_head) {
394 // The last region.
395 new_head = NULL;
396 }
397 hr = (HeapRegion*)Atomic::cmpxchg_ptr(new_head, &_dirty_cards_region_list,
398 head);
399 } while (hr != head);
400 assert(hr != NULL, "invariant");
401 hr->set_next_dirty_cards_region(NULL);
402 return hr;
403 }
404
405 // Returns true if the reference points to an object that
406 // can move in an incremental collection.
407 bool G1CollectedHeap::is_scavengable(const void* p) {
408 HeapRegion* hr = heap_region_containing(p);
409 return !hr->is_humongous();
410 }
411
412 // Private class members.
413
414 G1CollectedHeap* G1CollectedHeap::_g1h;
415
416 // Private methods.
417
418 HeapRegion*
419 G1CollectedHeap::new_region_try_secondary_free_list(bool is_old) {
420 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag);
421 while (!_secondary_free_list.is_empty() || free_regions_coming()) {
422 if (!_secondary_free_list.is_empty()) {
423 if (G1ConcRegionFreeingVerbose) {
424 gclog_or_tty->print_cr("G1ConcRegionFreeing [region alloc] : "
425 "secondary_free_list has %u entries",
426 _secondary_free_list.length());
427 }
428 // It looks as if there are free regions available on the
429 // secondary_free_list. Let's move them to the free_list and try
430 // again to allocate from it.
431 append_secondary_free_list();
432
433 assert(_hrm.num_free_regions() > 0, "if the secondary_free_list was not "
434 "empty we should have moved at least one entry to the free_list");
435 HeapRegion* res = _hrm.allocate_free_region(is_old);
436 if (G1ConcRegionFreeingVerbose) {
437 gclog_or_tty->print_cr("G1ConcRegionFreeing [region alloc] : "
438 "allocated "HR_FORMAT" from secondary_free_list",
439 HR_FORMAT_PARAMS(res));
440 }
441 return res;
442 }
443
444 // Wait here until we get notified either when (a) there are no
445 // more free regions coming or (b) some regions have been moved on
446 // the secondary_free_list.
447 SecondaryFreeList_lock->wait(Mutex::_no_safepoint_check_flag);
448 }
449
450 if (G1ConcRegionFreeingVerbose) {
451 gclog_or_tty->print_cr("G1ConcRegionFreeing [region alloc] : "
452 "could not allocate from secondary_free_list");
453 }
454 return NULL;
455 }
456
457 HeapRegion* G1CollectedHeap::new_region(size_t word_size, bool is_old, bool do_expand) {
458 assert(!is_humongous(word_size) || word_size <= HeapRegion::GrainWords,
459 "the only time we use this to allocate a humongous region is "
460 "when we are allocating a single humongous region");
461
462 HeapRegion* res;
463 if (G1StressConcRegionFreeing) {
464 if (!_secondary_free_list.is_empty()) {
465 if (G1ConcRegionFreeingVerbose) {
466 gclog_or_tty->print_cr("G1ConcRegionFreeing [region alloc] : "
467 "forced to look at the secondary_free_list");
468 }
469 res = new_region_try_secondary_free_list(is_old);
470 if (res != NULL) {
471 return res;
472 }
473 }
474 }
475
476 res = _hrm.allocate_free_region(is_old);
477
478 if (res == NULL) {
479 if (G1ConcRegionFreeingVerbose) {
480 gclog_or_tty->print_cr("G1ConcRegionFreeing [region alloc] : "
481 "res == NULL, trying the secondary_free_list");
482 }
483 res = new_region_try_secondary_free_list(is_old);
484 }
485 if (res == NULL && do_expand && _expand_heap_after_alloc_failure) {
486 // Currently, only attempts to allocate GC alloc regions set
487 // do_expand to true. So, we should only reach here during a
488 // safepoint. If this assumption changes we might have to
489 // reconsider the use of _expand_heap_after_alloc_failure.
490 assert(SafepointSynchronize::is_at_safepoint(), "invariant");
491
492 ergo_verbose1(ErgoHeapSizing,
493 "attempt heap expansion",
494 ergo_format_reason("region allocation request failed")
495 ergo_format_byte("allocation request"),
496 word_size * HeapWordSize);
497 if (expand(word_size * HeapWordSize)) {
498 // Given that expand() succeeded in expanding the heap, and we
499 // always expand the heap by an amount aligned to the heap
500 // region size, the free list should in theory not be empty.
501 // In either case allocate_free_region() will check for NULL.
502 res = _hrm.allocate_free_region(is_old);
503 } else {
504 _expand_heap_after_alloc_failure = false;
505 }
506 }
507 return res;
508 }
509
510 HeapWord*
511 G1CollectedHeap::humongous_obj_allocate_initialize_regions(uint first,
512 uint num_regions,
513 size_t word_size,
514 AllocationContext_t context) {
515 assert(first != G1_NO_HRM_INDEX, "pre-condition");
516 assert(is_humongous(word_size), "word_size should be humongous");
517 assert(num_regions * HeapRegion::GrainWords >= word_size, "pre-condition");
518
519 // Index of last region in the series + 1.
520 uint last = first + num_regions;
521
522 // We need to initialize the region(s) we just discovered. This is
523 // a bit tricky given that it can happen concurrently with
524 // refinement threads refining cards on these regions and
525 // potentially wanting to refine the BOT as they are scanning
526 // those cards (this can happen shortly after a cleanup; see CR
527 // 6991377). So we have to set up the region(s) carefully and in
528 // a specific order.
529
530 // The word size sum of all the regions we will allocate.
531 size_t word_size_sum = (size_t) num_regions * HeapRegion::GrainWords;
532 assert(word_size <= word_size_sum, "sanity");
533
534 // This will be the "starts humongous" region.
535 HeapRegion* first_hr = region_at(first);
536 // The header of the new object will be placed at the bottom of
537 // the first region.
538 HeapWord* new_obj = first_hr->bottom();
539 // This will be the new end of the first region in the series that
540 // should also match the end of the last region in the series.
541 HeapWord* new_end = new_obj + word_size_sum;
542 // This will be the new top of the first region that will reflect
543 // this allocation.
544 HeapWord* new_top = new_obj + word_size;
545
546 // First, we need to zero the header of the space that we will be
547 // allocating. When we update top further down, some refinement
548 // threads might try to scan the region. By zeroing the header we
549 // ensure that any thread that will try to scan the region will
550 // come across the zero klass word and bail out.
551 //
552 // NOTE: It would not have been correct to have used
553 // CollectedHeap::fill_with_object() and make the space look like
554 // an int array. The thread that is doing the allocation will
555 // later update the object header to a potentially different array
556 // type and, for a very short period of time, the klass and length
557 // fields will be inconsistent. This could cause a refinement
558 // thread to calculate the object size incorrectly.
559 Copy::fill_to_words(new_obj, oopDesc::header_size(), 0);
560
561 // We will set up the first region as "starts humongous". This
562 // will also update the BOT covering all the regions to reflect
563 // that there is a single object that starts at the bottom of the
564 // first region.
565 first_hr->set_starts_humongous(new_top, new_end);
566 first_hr->set_allocation_context(context);
567 // Then, if there are any, we will set up the "continues
568 // humongous" regions.
569 HeapRegion* hr = NULL;
570 for (uint i = first + 1; i < last; ++i) {
571 hr = region_at(i);
572 hr->set_continues_humongous(first_hr);
573 hr->set_allocation_context(context);
574 }
575 // If we have "continues humongous" regions (hr != NULL), then the
576 // end of the last one should match new_end.
577 assert(hr == NULL || hr->end() == new_end, "sanity");
578
579 // Up to this point no concurrent thread would have been able to
580 // do any scanning on any region in this series. All the top
581 // fields still point to bottom, so the intersection between
582 // [bottom,top] and [card_start,card_end] will be empty. Before we
583 // update the top fields, we'll do a storestore to make sure that
584 // no thread sees the update to top before the zeroing of the
585 // object header and the BOT initialization.
586 OrderAccess::storestore();
587
588 // Now that the BOT and the object header have been initialized,
589 // we can update top of the "starts humongous" region.
590 assert(first_hr->bottom() < new_top && new_top <= first_hr->end(),
591 "new_top should be in this region");
592 first_hr->set_top(new_top);
593 if (_hr_printer.is_active()) {
594 HeapWord* bottom = first_hr->bottom();
595 HeapWord* end = first_hr->orig_end();
596 if ((first + 1) == last) {
597 // the series has a single humongous region
598 _hr_printer.alloc(G1HRPrinter::SingleHumongous, first_hr, new_top);
599 } else {
600 // the series has more than one humongous regions
601 _hr_printer.alloc(G1HRPrinter::StartsHumongous, first_hr, end);
602 }
603 }
604
605 // Now, we will update the top fields of the "continues humongous"
606 // regions. The reason we need to do this is that, otherwise,
607 // these regions would look empty and this will confuse parts of
608 // G1. For example, the code that looks for a consecutive number
609 // of empty regions will consider them empty and try to
610 // re-allocate them. We can extend is_empty() to also include
611 // !is_continues_humongous(), but it is easier to just update the top
612 // fields here. The way we set top for all regions (i.e., top ==
613 // end for all regions but the last one, top == new_top for the
614 // last one) is actually used when we will free up the humongous
615 // region in free_humongous_region().
616 hr = NULL;
617 for (uint i = first + 1; i < last; ++i) {
618 hr = region_at(i);
619 if ((i + 1) == last) {
620 // last continues humongous region
621 assert(hr->bottom() < new_top && new_top <= hr->end(),
622 "new_top should fall on this region");
623 hr->set_top(new_top);
624 _hr_printer.alloc(G1HRPrinter::ContinuesHumongous, hr, new_top);
625 } else {
626 // not last one
627 assert(new_top > hr->end(), "new_top should be above this region");
628 hr->set_top(hr->end());
629 _hr_printer.alloc(G1HRPrinter::ContinuesHumongous, hr, hr->end());
630 }
631 }
632 // If we have continues humongous regions (hr != NULL), then the
633 // end of the last one should match new_end and its top should
634 // match new_top.
635 assert(hr == NULL ||
636 (hr->end() == new_end && hr->top() == new_top), "sanity");
637 check_bitmaps("Humongous Region Allocation", first_hr);
638
639 assert(first_hr->used() == word_size * HeapWordSize, "invariant");
640 _allocator->increase_used(first_hr->used());
641 _humongous_set.add(first_hr);
642
643 return new_obj;
644 }
645
646 // If could fit into free regions w/o expansion, try.
647 // Otherwise, if can expand, do so.
648 // Otherwise, if using ex regions might help, try with ex given back.
649 HeapWord* G1CollectedHeap::humongous_obj_allocate(size_t word_size, AllocationContext_t context) {
650 assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
651
652 verify_region_sets_optional();
653
654 uint first = G1_NO_HRM_INDEX;
655 uint obj_regions = (uint)(align_size_up_(word_size, HeapRegion::GrainWords) / HeapRegion::GrainWords);
656
657 if (obj_regions == 1) {
658 // Only one region to allocate, try to use a fast path by directly allocating
659 // from the free lists. Do not try to expand here, we will potentially do that
660 // later.
661 HeapRegion* hr = new_region(word_size, true /* is_old */, false /* do_expand */);
662 if (hr != NULL) {
663 first = hr->hrm_index();
664 }
665 } else {
666 // We can't allocate humongous regions spanning more than one region while
667 // cleanupComplete() is running, since some of the regions we find to be
668 // empty might not yet be added to the free list. It is not straightforward
669 // to know in which list they are on so that we can remove them. We only
670 // need to do this if we need to allocate more than one region to satisfy the
671 // current humongous allocation request. If we are only allocating one region
672 // we use the one-region region allocation code (see above), that already
673 // potentially waits for regions from the secondary free list.
674 wait_while_free_regions_coming();
675 append_secondary_free_list_if_not_empty_with_lock();
676
677 // Policy: Try only empty regions (i.e. already committed first). Maybe we
678 // are lucky enough to find some.
679 first = _hrm.find_contiguous_only_empty(obj_regions);
680 if (first != G1_NO_HRM_INDEX) {
681 _hrm.allocate_free_regions_starting_at(first, obj_regions);
682 }
683 }
684
685 if (first == G1_NO_HRM_INDEX) {
686 // Policy: We could not find enough regions for the humongous object in the
687 // free list. Look through the heap to find a mix of free and uncommitted regions.
688 // If so, try expansion.
689 first = _hrm.find_contiguous_empty_or_unavailable(obj_regions);
690 if (first != G1_NO_HRM_INDEX) {
691 // We found something. Make sure these regions are committed, i.e. expand
692 // the heap. Alternatively we could do a defragmentation GC.
693 ergo_verbose1(ErgoHeapSizing,
694 "attempt heap expansion",
695 ergo_format_reason("humongous allocation request failed")
696 ergo_format_byte("allocation request"),
697 word_size * HeapWordSize);
698
699 _hrm.expand_at(first, obj_regions);
700 g1_policy()->record_new_heap_size(num_regions());
701
702 #ifdef ASSERT
703 for (uint i = first; i < first + obj_regions; ++i) {
704 HeapRegion* hr = region_at(i);
705 assert(hr->is_free(), "sanity");
706 assert(hr->is_empty(), "sanity");
707 assert(is_on_master_free_list(hr), "sanity");
708 }
709 #endif
710 _hrm.allocate_free_regions_starting_at(first, obj_regions);
711 } else {
712 // Policy: Potentially trigger a defragmentation GC.
713 }
714 }
715
716 HeapWord* result = NULL;
717 if (first != G1_NO_HRM_INDEX) {
718 result = humongous_obj_allocate_initialize_regions(first, obj_regions,
719 word_size, context);
720 assert(result != NULL, "it should always return a valid result");
721
722 // A successful humongous object allocation changes the used space
723 // information of the old generation so we need to recalculate the
724 // sizes and update the jstat counters here.
725 g1mm()->update_sizes();
726 }
727
728 verify_region_sets_optional();
729
730 return result;
731 }
732
733 HeapWord* G1CollectedHeap::allocate_new_tlab(size_t word_size) {
734 assert_heap_not_locked_and_not_at_safepoint();
735 assert(!is_humongous(word_size), "we do not allow humongous TLABs");
736
737 uint dummy_gc_count_before;
738 uint dummy_gclocker_retry_count = 0;
739 return attempt_allocation(word_size, &dummy_gc_count_before, &dummy_gclocker_retry_count);
740 }
741
742 HeapWord*
743 G1CollectedHeap::mem_allocate(size_t word_size,
744 bool* gc_overhead_limit_was_exceeded) {
745 assert_heap_not_locked_and_not_at_safepoint();
746
747 // Loop until the allocation is satisfied, or unsatisfied after GC.
748 for (uint try_count = 1, gclocker_retry_count = 0; /* we'll return */; try_count += 1) {
749 uint gc_count_before;
750
751 HeapWord* result = NULL;
752 if (!is_humongous(word_size)) {
753 result = attempt_allocation(word_size, &gc_count_before, &gclocker_retry_count);
754 } else {
755 result = attempt_allocation_humongous(word_size, &gc_count_before, &gclocker_retry_count);
756 }
757 if (result != NULL) {
758 return result;
759 }
760
761 // Create the garbage collection operation...
762 VM_G1CollectForAllocation op(gc_count_before, word_size);
763 op.set_allocation_context(AllocationContext::current());
764
765 // ...and get the VM thread to execute it.
766 VMThread::execute(&op);
767
768 if (op.prologue_succeeded() && op.pause_succeeded()) {
769 // If the operation was successful we'll return the result even
770 // if it is NULL. If the allocation attempt failed immediately
771 // after a Full GC, it's unlikely we'll be able to allocate now.
772 HeapWord* result = op.result();
773 if (result != NULL && !is_humongous(word_size)) {
774 // Allocations that take place on VM operations do not do any
775 // card dirtying and we have to do it here. We only have to do
776 // this for non-humongous allocations, though.
777 dirty_young_block(result, word_size);
778 }
779 return result;
780 } else {
781 if (gclocker_retry_count > GCLockerRetryAllocationCount) {
782 return NULL;
783 }
784 assert(op.result() == NULL,
785 "the result should be NULL if the VM op did not succeed");
786 }
787
788 // Give a warning if we seem to be looping forever.
789 if ((QueuedAllocationWarningCount > 0) &&
790 (try_count % QueuedAllocationWarningCount == 0)) {
791 warning("G1CollectedHeap::mem_allocate retries %d times", try_count);
792 }
793 }
794
795 ShouldNotReachHere();
796 return NULL;
797 }
798
799 HeapWord* G1CollectedHeap::attempt_allocation_slow(size_t word_size,
800 AllocationContext_t context,
801 uint* gc_count_before_ret,
802 uint* gclocker_retry_count_ret) {
803 // Make sure you read the note in attempt_allocation_humongous().
804
805 assert_heap_not_locked_and_not_at_safepoint();
806 assert(!is_humongous(word_size), "attempt_allocation_slow() should not "
807 "be called for humongous allocation requests");
808
809 // We should only get here after the first-level allocation attempt
810 // (attempt_allocation()) failed to allocate.
811
812 // We will loop until a) we manage to successfully perform the
813 // allocation or b) we successfully schedule a collection which
814 // fails to perform the allocation. b) is the only case when we'll
815 // return NULL.
816 HeapWord* result = NULL;
817 for (int try_count = 1; /* we'll return */; try_count += 1) {
818 bool should_try_gc;
819 uint gc_count_before;
820
821 {
822 MutexLockerEx x(Heap_lock);
823 result = _allocator->mutator_alloc_region(context)->attempt_allocation_locked(word_size,
824 false /* bot_updates */);
825 if (result != NULL) {
826 return result;
827 }
828
829 // If we reach here, attempt_allocation_locked() above failed to
830 // allocate a new region. So the mutator alloc region should be NULL.
831 assert(_allocator->mutator_alloc_region(context)->get() == NULL, "only way to get here");
832
833 if (GC_locker::is_active_and_needs_gc()) {
834 if (g1_policy()->can_expand_young_list()) {
835 // No need for an ergo verbose message here,
836 // can_expand_young_list() does this when it returns true.
837 result = _allocator->mutator_alloc_region(context)->attempt_allocation_force(word_size,
838 false /* bot_updates */);
839 if (result != NULL) {
840 return result;
841 }
842 }
843 should_try_gc = false;
844 } else {
845 // The GCLocker may not be active but the GCLocker initiated
846 // GC may not yet have been performed (GCLocker::needs_gc()
847 // returns true). In this case we do not try this GC and
848 // wait until the GCLocker initiated GC is performed, and
849 // then retry the allocation.
850 if (GC_locker::needs_gc()) {
851 should_try_gc = false;
852 } else {
853 // Read the GC count while still holding the Heap_lock.
854 gc_count_before = total_collections();
855 should_try_gc = true;
856 }
857 }
858 }
859
860 if (should_try_gc) {
861 bool succeeded;
862 result = do_collection_pause(word_size, gc_count_before, &succeeded,
863 GCCause::_g1_inc_collection_pause);
864 if (result != NULL) {
865 assert(succeeded, "only way to get back a non-NULL result");
866 return result;
867 }
868
869 if (succeeded) {
870 // If we get here we successfully scheduled a collection which
871 // failed to allocate. No point in trying to allocate
872 // further. We'll just return NULL.
873 MutexLockerEx x(Heap_lock);
874 *gc_count_before_ret = total_collections();
875 return NULL;
876 }
877 } else {
878 if (*gclocker_retry_count_ret > GCLockerRetryAllocationCount) {
879 MutexLockerEx x(Heap_lock);
880 *gc_count_before_ret = total_collections();
881 return NULL;
882 }
883 // The GCLocker is either active or the GCLocker initiated
884 // GC has not yet been performed. Stall until it is and
885 // then retry the allocation.
886 GC_locker::stall_until_clear();
887 (*gclocker_retry_count_ret) += 1;
888 }
889
890 // We can reach here if we were unsuccessful in scheduling a
891 // collection (because another thread beat us to it) or if we were
892 // stalled due to the GC locker. In either can we should retry the
893 // allocation attempt in case another thread successfully
894 // performed a collection and reclaimed enough space. We do the
895 // first attempt (without holding the Heap_lock) here and the
896 // follow-on attempt will be at the start of the next loop
897 // iteration (after taking the Heap_lock).
898 result = _allocator->mutator_alloc_region(context)->attempt_allocation(word_size,
899 false /* bot_updates */);
900 if (result != NULL) {
901 return result;
902 }
903
904 // Give a warning if we seem to be looping forever.
905 if ((QueuedAllocationWarningCount > 0) &&
906 (try_count % QueuedAllocationWarningCount == 0)) {
907 warning("G1CollectedHeap::attempt_allocation_slow() "
908 "retries %d times", try_count);
909 }
910 }
911
912 ShouldNotReachHere();
913 return NULL;
914 }
915
916 HeapWord* G1CollectedHeap::attempt_allocation_humongous(size_t word_size,
917 uint* gc_count_before_ret,
918 uint* gclocker_retry_count_ret) {
919 // The structure of this method has a lot of similarities to
920 // attempt_allocation_slow(). The reason these two were not merged
921 // into a single one is that such a method would require several "if
922 // allocation is not humongous do this, otherwise do that"
923 // conditional paths which would obscure its flow. In fact, an early
924 // version of this code did use a unified method which was harder to
925 // follow and, as a result, it had subtle bugs that were hard to
926 // track down. So keeping these two methods separate allows each to
927 // be more readable. It will be good to keep these two in sync as
928 // much as possible.
929
930 assert_heap_not_locked_and_not_at_safepoint();
931 assert(is_humongous(word_size), "attempt_allocation_humongous() "
932 "should only be called for humongous allocations");
933
934 // Humongous objects can exhaust the heap quickly, so we should check if we
935 // need to start a marking cycle at each humongous object allocation. We do
936 // the check before we do the actual allocation. The reason for doing it
937 // before the allocation is that we avoid having to keep track of the newly
938 // allocated memory while we do a GC.
939 if (g1_policy()->need_to_start_conc_mark("concurrent humongous allocation",
940 word_size)) {
941 collect(GCCause::_g1_humongous_allocation);
942 }
943
944 // We will loop until a) we manage to successfully perform the
945 // allocation or b) we successfully schedule a collection which
946 // fails to perform the allocation. b) is the only case when we'll
947 // return NULL.
948 HeapWord* result = NULL;
949 for (int try_count = 1; /* we'll return */; try_count += 1) {
950 bool should_try_gc;
951 uint gc_count_before;
952
953 {
954 MutexLockerEx x(Heap_lock);
955
956 // Given that humongous objects are not allocated in young
957 // regions, we'll first try to do the allocation without doing a
958 // collection hoping that there's enough space in the heap.
959 result = humongous_obj_allocate(word_size, AllocationContext::current());
960 if (result != NULL) {
961 return result;
962 }
963
964 if (GC_locker::is_active_and_needs_gc()) {
965 should_try_gc = false;
966 } else {
967 // The GCLocker may not be active but the GCLocker initiated
968 // GC may not yet have been performed (GCLocker::needs_gc()
969 // returns true). In this case we do not try this GC and
970 // wait until the GCLocker initiated GC is performed, and
971 // then retry the allocation.
972 if (GC_locker::needs_gc()) {
973 should_try_gc = false;
974 } else {
975 // Read the GC count while still holding the Heap_lock.
976 gc_count_before = total_collections();
977 should_try_gc = true;
978 }
979 }
980 }
981
982 if (should_try_gc) {
983 // If we failed to allocate the humongous object, we should try to
984 // do a collection pause (if we're allowed) in case it reclaims
985 // enough space for the allocation to succeed after the pause.
986
987 bool succeeded;
988 result = do_collection_pause(word_size, gc_count_before, &succeeded,
989 GCCause::_g1_humongous_allocation);
990 if (result != NULL) {
991 assert(succeeded, "only way to get back a non-NULL result");
992 return result;
993 }
994
995 if (succeeded) {
996 // If we get here we successfully scheduled a collection which
997 // failed to allocate. No point in trying to allocate
998 // further. We'll just return NULL.
999 MutexLockerEx x(Heap_lock);
1000 *gc_count_before_ret = total_collections();
1001 return NULL;
1002 }
1003 } else {
1004 if (*gclocker_retry_count_ret > GCLockerRetryAllocationCount) {
1005 MutexLockerEx x(Heap_lock);
1006 *gc_count_before_ret = total_collections();
1007 return NULL;
1008 }
1009 // The GCLocker is either active or the GCLocker initiated
1010 // GC has not yet been performed. Stall until it is and
1011 // then retry the allocation.
1012 GC_locker::stall_until_clear();
1013 (*gclocker_retry_count_ret) += 1;
1014 }
1015
1016 // We can reach here if we were unsuccessful in scheduling a
1017 // collection (because another thread beat us to it) or if we were
1018 // stalled due to the GC locker. In either can we should retry the
1019 // allocation attempt in case another thread successfully
1020 // performed a collection and reclaimed enough space. Give a
1021 // warning if we seem to be looping forever.
1022
1023 if ((QueuedAllocationWarningCount > 0) &&
1024 (try_count % QueuedAllocationWarningCount == 0)) {
1025 warning("G1CollectedHeap::attempt_allocation_humongous() "
1026 "retries %d times", try_count);
1027 }
1028 }
1029
1030 ShouldNotReachHere();
1031 return NULL;
1032 }
1033
1034 HeapWord* G1CollectedHeap::attempt_allocation_at_safepoint(size_t word_size,
1035 AllocationContext_t context,
1036 bool expect_null_mutator_alloc_region) {
1037 assert_at_safepoint(true /* should_be_vm_thread */);
1038 assert(_allocator->mutator_alloc_region(context)->get() == NULL ||
1039 !expect_null_mutator_alloc_region,
1040 "the current alloc region was unexpectedly found to be non-NULL");
1041
1042 if (!is_humongous(word_size)) {
1043 return _allocator->mutator_alloc_region(context)->attempt_allocation_locked(word_size,
1044 false /* bot_updates */);
1045 } else {
1046 HeapWord* result = humongous_obj_allocate(word_size, context);
1047 if (result != NULL && g1_policy()->need_to_start_conc_mark("STW humongous allocation")) {
1048 g1_policy()->set_initiate_conc_mark_if_possible();
1049 }
1050 return result;
1051 }
1052
1053 ShouldNotReachHere();
1054 }
1055
1056 class PostMCRemSetClearClosure: public HeapRegionClosure {
1057 G1CollectedHeap* _g1h;
1058 ModRefBarrierSet* _mr_bs;
1059 public:
1060 PostMCRemSetClearClosure(G1CollectedHeap* g1h, ModRefBarrierSet* mr_bs) :
1061 _g1h(g1h), _mr_bs(mr_bs) {}
1062
1063 bool doHeapRegion(HeapRegion* r) {
1064 HeapRegionRemSet* hrrs = r->rem_set();
1065
1066 if (r->is_continues_humongous()) {
1067 // We'll assert that the strong code root list and RSet is empty
1068 assert(hrrs->strong_code_roots_list_length() == 0, "sanity");
1069 assert(hrrs->occupied() == 0, "RSet should be empty");
1070 return false;
1071 }
1072
1073 _g1h->reset_gc_time_stamps(r);
1074 hrrs->clear();
1075 // You might think here that we could clear just the cards
1076 // corresponding to the used region. But no: if we leave a dirty card
1077 // in a region we might allocate into, then it would prevent that card
1078 // from being enqueued, and cause it to be missed.
1079 // Re: the performance cost: we shouldn't be doing full GC anyway!
1080 _mr_bs->clear(MemRegion(r->bottom(), r->end()));
1081
1082 return false;
1083 }
1084 };
1085
1086 void G1CollectedHeap::clear_rsets_post_compaction() {
1087 PostMCRemSetClearClosure rs_clear(this, g1_barrier_set());
1088 heap_region_iterate(&rs_clear);
1089 }
1090
1091 class RebuildRSOutOfRegionClosure: public HeapRegionClosure {
1092 G1CollectedHeap* _g1h;
1093 UpdateRSOopClosure _cl;
1094 int _worker_i;
1095 public:
1096 RebuildRSOutOfRegionClosure(G1CollectedHeap* g1, int worker_i = 0) :
1097 _cl(g1->g1_rem_set(), worker_i),
1098 _worker_i(worker_i),
1099 _g1h(g1)
1100 { }
1101
1102 bool doHeapRegion(HeapRegion* r) {
1103 if (!r->is_continues_humongous()) {
1104 _cl.set_from(r);
1105 r->oop_iterate(&_cl);
1106 }
1107 return false;
1108 }
1109 };
1110
1111 class ParRebuildRSTask: public AbstractGangTask {
1112 G1CollectedHeap* _g1;
1113 HeapRegionClaimer _hrclaimer;
1114
1115 public:
1116 ParRebuildRSTask(G1CollectedHeap* g1) :
1117 AbstractGangTask("ParRebuildRSTask"), _g1(g1), _hrclaimer(g1->workers()->active_workers()) {}
1118
1119 void work(uint worker_id) {
1120 RebuildRSOutOfRegionClosure rebuild_rs(_g1, worker_id);
1121 _g1->heap_region_par_iterate(&rebuild_rs, worker_id, &_hrclaimer);
1122 }
1123 };
1124
1125 class PostCompactionPrinterClosure: public HeapRegionClosure {
1126 private:
1127 G1HRPrinter* _hr_printer;
1128 public:
1129 bool doHeapRegion(HeapRegion* hr) {
1130 assert(!hr->is_young(), "not expecting to find young regions");
1131 if (hr->is_free()) {
1132 // We only generate output for non-empty regions.
1133 } else if (hr->is_starts_humongous()) {
1134 if (hr->region_num() == 1) {
1135 // single humongous region
1136 _hr_printer->post_compaction(hr, G1HRPrinter::SingleHumongous);
1137 } else {
1138 _hr_printer->post_compaction(hr, G1HRPrinter::StartsHumongous);
1139 }
1140 } else if (hr->is_continues_humongous()) {
1141 _hr_printer->post_compaction(hr, G1HRPrinter::ContinuesHumongous);
1142 } else if (hr->is_old()) {
1143 _hr_printer->post_compaction(hr, G1HRPrinter::Old);
1144 } else {
1145 ShouldNotReachHere();
1146 }
1147 return false;
1148 }
1149
1150 PostCompactionPrinterClosure(G1HRPrinter* hr_printer)
1151 : _hr_printer(hr_printer) { }
1152 };
1153
1154 void G1CollectedHeap::print_hrm_post_compaction() {
1155 PostCompactionPrinterClosure cl(hr_printer());
1156 heap_region_iterate(&cl);
1157 }
1158
1159 bool G1CollectedHeap::do_collection(bool explicit_gc,
1160 bool clear_all_soft_refs,
1161 size_t word_size) {
1162 assert_at_safepoint(true /* should_be_vm_thread */);
1163
1164 if (GC_locker::check_active_before_gc()) {
1165 return false;
1166 }
1167
1168 STWGCTimer* gc_timer = G1MarkSweep::gc_timer();
1169 gc_timer->register_gc_start();
1170
1171 SerialOldTracer* gc_tracer = G1MarkSweep::gc_tracer();
1172 gc_tracer->report_gc_start(gc_cause(), gc_timer->gc_start());
1173
1174 SvcGCMarker sgcm(SvcGCMarker::FULL);
1175 ResourceMark rm;
1176
1177 print_heap_before_gc();
1178 trace_heap_before_gc(gc_tracer);
1179
1180 size_t metadata_prev_used = MetaspaceAux::used_bytes();
1181
1182 verify_region_sets_optional();
1183
1184 const bool do_clear_all_soft_refs = clear_all_soft_refs ||
1185 collector_policy()->should_clear_all_soft_refs();
1186
1187 ClearedAllSoftRefs casr(do_clear_all_soft_refs, collector_policy());
1188
1189 {
1190 IsGCActiveMark x;
1191
1192 // Timing
1193 assert(gc_cause() != GCCause::_java_lang_system_gc || explicit_gc, "invariant");
1194 TraceCPUTime tcpu(G1Log::finer(), true, gclog_or_tty);
1195
1196 {
1197 GCTraceTime t(GCCauseString("Full GC", gc_cause()), G1Log::fine(), true, NULL, gc_tracer->gc_id());
1198 TraceCollectorStats tcs(g1mm()->full_collection_counters());
1199 TraceMemoryManagerStats tms(true /* fullGC */, gc_cause());
1200
1201 g1_policy()->record_full_collection_start();
1202
1203 // Note: When we have a more flexible GC logging framework that
1204 // allows us to add optional attributes to a GC log record we
1205 // could consider timing and reporting how long we wait in the
1206 // following two methods.
1207 wait_while_free_regions_coming();
1208 // If we start the compaction before the CM threads finish
1209 // scanning the root regions we might trip them over as we'll
1210 // be moving objects / updating references. So let's wait until
1211 // they are done. By telling them to abort, they should complete
1212 // early.
1213 _cm->root_regions()->abort();
1214 _cm->root_regions()->wait_until_scan_finished();
1215 append_secondary_free_list_if_not_empty_with_lock();
1216
1217 gc_prologue(true);
1218 increment_total_collections(true /* full gc */);
1219 increment_old_marking_cycles_started();
1220
1221 assert(used() == recalculate_used(), "Should be equal");
1222
1223 verify_before_gc();
1224
1225 check_bitmaps("Full GC Start");
1226 pre_full_gc_dump(gc_timer);
1227
1228 COMPILER2_PRESENT(DerivedPointerTable::clear());
1229
1230 // Disable discovery and empty the discovered lists
1231 // for the CM ref processor.
1232 ref_processor_cm()->disable_discovery();
1233 ref_processor_cm()->abandon_partial_discovery();
1234 ref_processor_cm()->verify_no_references_recorded();
1235
1236 // Abandon current iterations of concurrent marking and concurrent
1237 // refinement, if any are in progress. We have to do this before
1238 // wait_until_scan_finished() below.
1239 concurrent_mark()->abort();
1240
1241 // Make sure we'll choose a new allocation region afterwards.
1242 _allocator->release_mutator_alloc_region();
1243 _allocator->abandon_gc_alloc_regions();
1244 g1_rem_set()->cleanupHRRS();
1245
1246 // We should call this after we retire any currently active alloc
1247 // regions so that all the ALLOC / RETIRE events are generated
1248 // before the start GC event.
1249 _hr_printer.start_gc(true /* full */, (size_t) total_collections());
1250
1251 // We may have added regions to the current incremental collection
1252 // set between the last GC or pause and now. We need to clear the
1253 // incremental collection set and then start rebuilding it afresh
1254 // after this full GC.
1255 abandon_collection_set(g1_policy()->inc_cset_head());
1256 g1_policy()->clear_incremental_cset();
1257 g1_policy()->stop_incremental_cset_building();
1258
1259 tear_down_region_sets(false /* free_list_only */);
1260 g1_policy()->set_gcs_are_young(true);
1261
1262 // See the comments in g1CollectedHeap.hpp and
1263 // G1CollectedHeap::ref_processing_init() about
1264 // how reference processing currently works in G1.
1265
1266 // Temporarily make discovery by the STW ref processor single threaded (non-MT).
1267 ReferenceProcessorMTDiscoveryMutator stw_rp_disc_ser(ref_processor_stw(), false);
1268
1269 // Temporarily clear the STW ref processor's _is_alive_non_header field.
1270 ReferenceProcessorIsAliveMutator stw_rp_is_alive_null(ref_processor_stw(), NULL);
1271
1272 ref_processor_stw()->enable_discovery();
1273 ref_processor_stw()->setup_policy(do_clear_all_soft_refs);
1274
1275 // Do collection work
1276 {
1277 HandleMark hm; // Discard invalid handles created during gc
1278 G1MarkSweep::invoke_at_safepoint(ref_processor_stw(), do_clear_all_soft_refs);
1279 }
1280
1281 assert(num_free_regions() == 0, "we should not have added any free regions");
1282 rebuild_region_sets(false /* free_list_only */);
1283
1284 // Enqueue any discovered reference objects that have
1285 // not been removed from the discovered lists.
1286 ref_processor_stw()->enqueue_discovered_references();
1287
1288 COMPILER2_PRESENT(DerivedPointerTable::update_pointers());
1289
1290 MemoryService::track_memory_usage();
1291
1292 assert(!ref_processor_stw()->discovery_enabled(), "Postcondition");
1293 ref_processor_stw()->verify_no_references_recorded();
1294
1295 // Delete metaspaces for unloaded class loaders and clean up loader_data graph
1296 ClassLoaderDataGraph::purge();
1297 MetaspaceAux::verify_metrics();
1298
1299 // Note: since we've just done a full GC, concurrent
1300 // marking is no longer active. Therefore we need not
1301 // re-enable reference discovery for the CM ref processor.
1302 // That will be done at the start of the next marking cycle.
1303 assert(!ref_processor_cm()->discovery_enabled(), "Postcondition");
1304 ref_processor_cm()->verify_no_references_recorded();
1305
1306 reset_gc_time_stamp();
1307 // Since everything potentially moved, we will clear all remembered
1308 // sets, and clear all cards. Later we will rebuild remembered
1309 // sets. We will also reset the GC time stamps of the regions.
1310 clear_rsets_post_compaction();
1311 check_gc_time_stamps();
1312
1313 // Resize the heap if necessary.
1314 resize_if_necessary_after_full_collection(explicit_gc ? 0 : word_size);
1315
1316 if (_hr_printer.is_active()) {
1317 // We should do this after we potentially resize the heap so
1318 // that all the COMMIT / UNCOMMIT events are generated before
1319 // the end GC event.
1320
1321 print_hrm_post_compaction();
1322 _hr_printer.end_gc(true /* full */, (size_t) total_collections());
1323 }
1324
1325 G1HotCardCache* hot_card_cache = _cg1r->hot_card_cache();
1326 if (hot_card_cache->use_cache()) {
1327 hot_card_cache->reset_card_counts();
1328 hot_card_cache->reset_hot_cache();
1329 }
1330
1331 // Rebuild remembered sets of all regions.
1332 uint n_workers =
1333 AdaptiveSizePolicy::calc_active_workers(workers()->total_workers(),
1334 workers()->active_workers(),
1335 Threads::number_of_non_daemon_threads());
1336 assert(UseDynamicNumberOfGCThreads ||
1337 n_workers == workers()->total_workers(),
1338 "If not dynamic should be using all the workers");
1339 workers()->set_active_workers(n_workers);
1340 // Set parallel threads in the heap (_n_par_threads) only
1341 // before a parallel phase and always reset it to 0 after
1342 // the phase so that the number of parallel threads does
1343 // no get carried forward to a serial phase where there
1344 // may be code that is "possibly_parallel".
1345 set_par_threads(n_workers);
1346
1347 ParRebuildRSTask rebuild_rs_task(this);
1348 assert(UseDynamicNumberOfGCThreads ||
1349 workers()->active_workers() == workers()->total_workers(),
1350 "Unless dynamic should use total workers");
1351 // Use the most recent number of active workers
1352 assert(workers()->active_workers() > 0,
1353 "Active workers not properly set");
1354 set_par_threads(workers()->active_workers());
1355 workers()->run_task(&rebuild_rs_task);
1356 set_par_threads(0);
1357
1358 // Rebuild the strong code root lists for each region
1359 rebuild_strong_code_roots();
1360
1361 if (true) { // FIXME
1362 MetaspaceGC::compute_new_size();
1363 }
1364
1365 #ifdef TRACESPINNING
1366 ParallelTaskTerminator::print_termination_counts();
1367 #endif
1368
1369 // Discard all rset updates
1370 JavaThread::dirty_card_queue_set().abandon_logs();
1371 assert(dirty_card_queue_set().completed_buffers_num() == 0, "DCQS should be empty");
1372
1373 _young_list->reset_sampled_info();
1374 // At this point there should be no regions in the
1375 // entire heap tagged as young.
1376 assert(check_young_list_empty(true /* check_heap */),
1377 "young list should be empty at this point");
1378
1379 // Update the number of full collections that have been completed.
1380 increment_old_marking_cycles_completed(false /* concurrent */);
1381
1382 _hrm.verify_optional();
1383 verify_region_sets_optional();
1384
1385 verify_after_gc();
1386
1387 // Clear the previous marking bitmap, if needed for bitmap verification.
1388 // Note we cannot do this when we clear the next marking bitmap in
1389 // ConcurrentMark::abort() above since VerifyDuringGC verifies the
1390 // objects marked during a full GC against the previous bitmap.
1391 // But we need to clear it before calling check_bitmaps below since
1392 // the full GC has compacted objects and updated TAMS but not updated
1393 // the prev bitmap.
1394 if (G1VerifyBitmaps) {
1395 ((CMBitMap*) concurrent_mark()->prevMarkBitMap())->clearAll();
1396 }
1397 check_bitmaps("Full GC End");
1398
1399 // Start a new incremental collection set for the next pause
1400 assert(g1_policy()->collection_set() == NULL, "must be");
1401 g1_policy()->start_incremental_cset_building();
1402
1403 clear_cset_fast_test();
1404
1405 _allocator->init_mutator_alloc_region();
1406
1407 g1_policy()->record_full_collection_end();
1408
1409 if (G1Log::fine()) {
1410 g1_policy()->print_heap_transition();
1411 }
1412
1413 // We must call G1MonitoringSupport::update_sizes() in the same scoping level
1414 // as an active TraceMemoryManagerStats object (i.e. before the destructor for the
1415 // TraceMemoryManagerStats is called) so that the G1 memory pools are updated
1416 // before any GC notifications are raised.
1417 g1mm()->update_sizes();
1418
1419 gc_epilogue(true);
1420 }
1421
1422 if (G1Log::finer()) {
1423 g1_policy()->print_detailed_heap_transition(true /* full */);
1424 }
1425
1426 print_heap_after_gc();
1427 trace_heap_after_gc(gc_tracer);
1428
1429 post_full_gc_dump(gc_timer);
1430
1431 gc_timer->register_gc_end();
1432 gc_tracer->report_gc_end(gc_timer->gc_end(), gc_timer->time_partitions());
1433 }
1434
1435 return true;
1436 }
1437
1438 void G1CollectedHeap::do_full_collection(bool clear_all_soft_refs) {
1439 // do_collection() will return whether it succeeded in performing
1440 // the GC. Currently, there is no facility on the
1441 // do_full_collection() API to notify the caller than the collection
1442 // did not succeed (e.g., because it was locked out by the GC
1443 // locker). So, right now, we'll ignore the return value.
1444 bool dummy = do_collection(true, /* explicit_gc */
1445 clear_all_soft_refs,
1446 0 /* word_size */);
1447 }
1448
1449 // This code is mostly copied from TenuredGeneration.
1450 void
1451 G1CollectedHeap::
1452 resize_if_necessary_after_full_collection(size_t word_size) {
1453 // Include the current allocation, if any, and bytes that will be
1454 // pre-allocated to support collections, as "used".
1455 const size_t used_after_gc = used();
1456 const size_t capacity_after_gc = capacity();
1457 const size_t free_after_gc = capacity_after_gc - used_after_gc;
1458
1459 // This is enforced in arguments.cpp.
1460 assert(MinHeapFreeRatio <= MaxHeapFreeRatio,
1461 "otherwise the code below doesn't make sense");
1462
1463 // We don't have floating point command-line arguments
1464 const double minimum_free_percentage = (double) MinHeapFreeRatio / 100.0;
1465 const double maximum_used_percentage = 1.0 - minimum_free_percentage;
1466 const double maximum_free_percentage = (double) MaxHeapFreeRatio / 100.0;
1467 const double minimum_used_percentage = 1.0 - maximum_free_percentage;
1468
1469 const size_t min_heap_size = collector_policy()->min_heap_byte_size();
1470 const size_t max_heap_size = collector_policy()->max_heap_byte_size();
1471
1472 // We have to be careful here as these two calculations can overflow
1473 // 32-bit size_t's.
1474 double used_after_gc_d = (double) used_after_gc;
1475 double minimum_desired_capacity_d = used_after_gc_d / maximum_used_percentage;
1476 double maximum_desired_capacity_d = used_after_gc_d / minimum_used_percentage;
1477
1478 // Let's make sure that they are both under the max heap size, which
1479 // by default will make them fit into a size_t.
1480 double desired_capacity_upper_bound = (double) max_heap_size;
1481 minimum_desired_capacity_d = MIN2(minimum_desired_capacity_d,
1482 desired_capacity_upper_bound);
1483 maximum_desired_capacity_d = MIN2(maximum_desired_capacity_d,
1484 desired_capacity_upper_bound);
1485
1486 // We can now safely turn them into size_t's.
1487 size_t minimum_desired_capacity = (size_t) minimum_desired_capacity_d;
1488 size_t maximum_desired_capacity = (size_t) maximum_desired_capacity_d;
1489
1490 // This assert only makes sense here, before we adjust them
1491 // with respect to the min and max heap size.
1492 assert(minimum_desired_capacity <= maximum_desired_capacity,
1493 err_msg("minimum_desired_capacity = "SIZE_FORMAT", "
1494 "maximum_desired_capacity = "SIZE_FORMAT,
1495 minimum_desired_capacity, maximum_desired_capacity));
1496
1497 // Should not be greater than the heap max size. No need to adjust
1498 // it with respect to the heap min size as it's a lower bound (i.e.,
1499 // we'll try to make the capacity larger than it, not smaller).
1500 minimum_desired_capacity = MIN2(minimum_desired_capacity, max_heap_size);
1501 // Should not be less than the heap min size. No need to adjust it
1502 // with respect to the heap max size as it's an upper bound (i.e.,
1503 // we'll try to make the capacity smaller than it, not greater).
1504 maximum_desired_capacity = MAX2(maximum_desired_capacity, min_heap_size);
1505
1506 if (capacity_after_gc < minimum_desired_capacity) {
1507 // Don't expand unless it's significant
1508 size_t expand_bytes = minimum_desired_capacity - capacity_after_gc;
1509 ergo_verbose4(ErgoHeapSizing,
1510 "attempt heap expansion",
1511 ergo_format_reason("capacity lower than "
1512 "min desired capacity after Full GC")
1513 ergo_format_byte("capacity")
1514 ergo_format_byte("occupancy")
1515 ergo_format_byte_perc("min desired capacity"),
1516 capacity_after_gc, used_after_gc,
1517 minimum_desired_capacity, (double) MinHeapFreeRatio);
1518 expand(expand_bytes);
1519
1520 // No expansion, now see if we want to shrink
1521 } else if (capacity_after_gc > maximum_desired_capacity) {
1522 // Capacity too large, compute shrinking size
1523 size_t shrink_bytes = capacity_after_gc - maximum_desired_capacity;
1524 ergo_verbose4(ErgoHeapSizing,
1525 "attempt heap shrinking",
1526 ergo_format_reason("capacity higher than "
1527 "max desired capacity after Full GC")
1528 ergo_format_byte("capacity")
1529 ergo_format_byte("occupancy")
1530 ergo_format_byte_perc("max desired capacity"),
1531 capacity_after_gc, used_after_gc,
1532 maximum_desired_capacity, (double) MaxHeapFreeRatio);
1533 shrink(shrink_bytes);
1534 }
1535 }
1536
1537
1538 HeapWord*
1539 G1CollectedHeap::satisfy_failed_allocation(size_t word_size,
1540 AllocationContext_t context,
1541 bool* succeeded) {
1542 assert_at_safepoint(true /* should_be_vm_thread */);
1543
1544 *succeeded = true;
1545 // Let's attempt the allocation first.
1546 HeapWord* result =
1547 attempt_allocation_at_safepoint(word_size,
1548 context,
1549 false /* expect_null_mutator_alloc_region */);
1550 if (result != NULL) {
1551 assert(*succeeded, "sanity");
1552 return result;
1553 }
1554
1555 // In a G1 heap, we're supposed to keep allocation from failing by
1556 // incremental pauses. Therefore, at least for now, we'll favor
1557 // expansion over collection. (This might change in the future if we can
1558 // do something smarter than full collection to satisfy a failed alloc.)
1559 result = expand_and_allocate(word_size, context);
1560 if (result != NULL) {
1561 assert(*succeeded, "sanity");
1562 return result;
1563 }
1564
1565 // Expansion didn't work, we'll try to do a Full GC.
1566 bool gc_succeeded = do_collection(false, /* explicit_gc */
1567 false, /* clear_all_soft_refs */
1568 word_size);
1569 if (!gc_succeeded) {
1570 *succeeded = false;
1571 return NULL;
1572 }
1573
1574 // Retry the allocation
1575 result = attempt_allocation_at_safepoint(word_size,
1576 context,
1577 true /* expect_null_mutator_alloc_region */);
1578 if (result != NULL) {
1579 assert(*succeeded, "sanity");
1580 return result;
1581 }
1582
1583 // Then, try a Full GC that will collect all soft references.
1584 gc_succeeded = do_collection(false, /* explicit_gc */
1585 true, /* clear_all_soft_refs */
1586 word_size);
1587 if (!gc_succeeded) {
1588 *succeeded = false;
1589 return NULL;
1590 }
1591
1592 // Retry the allocation once more
1593 result = attempt_allocation_at_safepoint(word_size,
1594 context,
1595 true /* expect_null_mutator_alloc_region */);
1596 if (result != NULL) {
1597 assert(*succeeded, "sanity");
1598 return result;
1599 }
1600
1601 assert(!collector_policy()->should_clear_all_soft_refs(),
1602 "Flag should have been handled and cleared prior to this point");
1603
1604 // What else? We might try synchronous finalization later. If the total
1605 // space available is large enough for the allocation, then a more
1606 // complete compaction phase than we've tried so far might be
1607 // appropriate.
1608 assert(*succeeded, "sanity");
1609 return NULL;
1610 }
1611
1612 // Attempting to expand the heap sufficiently
1613 // to support an allocation of the given "word_size". If
1614 // successful, perform the allocation and return the address of the
1615 // allocated block, or else "NULL".
1616
1617 HeapWord* G1CollectedHeap::expand_and_allocate(size_t word_size, AllocationContext_t context) {
1618 assert_at_safepoint(true /* should_be_vm_thread */);
1619
1620 verify_region_sets_optional();
1621
1622 size_t expand_bytes = MAX2(word_size * HeapWordSize, MinHeapDeltaBytes);
1623 ergo_verbose1(ErgoHeapSizing,
1624 "attempt heap expansion",
1625 ergo_format_reason("allocation request failed")
1626 ergo_format_byte("allocation request"),
1627 word_size * HeapWordSize);
1628 if (expand(expand_bytes)) {
1629 _hrm.verify_optional();
1630 verify_region_sets_optional();
1631 return attempt_allocation_at_safepoint(word_size,
1632 context,
1633 false /* expect_null_mutator_alloc_region */);
1634 }
1635 return NULL;
1636 }
1637
1638 bool G1CollectedHeap::expand(size_t expand_bytes) {
1639 size_t aligned_expand_bytes = ReservedSpace::page_align_size_up(expand_bytes);
1640 aligned_expand_bytes = align_size_up(aligned_expand_bytes,
1641 HeapRegion::GrainBytes);
1642 ergo_verbose2(ErgoHeapSizing,
1643 "expand the heap",
1644 ergo_format_byte("requested expansion amount")
1645 ergo_format_byte("attempted expansion amount"),
1646 expand_bytes, aligned_expand_bytes);
1647
1648 if (is_maximal_no_gc()) {
1649 ergo_verbose0(ErgoHeapSizing,
1650 "did not expand the heap",
1651 ergo_format_reason("heap already fully expanded"));
1652 return false;
1653 }
1654
1655 uint regions_to_expand = (uint)(aligned_expand_bytes / HeapRegion::GrainBytes);
1656 assert(regions_to_expand > 0, "Must expand by at least one region");
1657
1658 uint expanded_by = _hrm.expand_by(regions_to_expand);
1659
1660 if (expanded_by > 0) {
1661 size_t actual_expand_bytes = expanded_by * HeapRegion::GrainBytes;
1662 assert(actual_expand_bytes <= aligned_expand_bytes, "post-condition");
1663 g1_policy()->record_new_heap_size(num_regions());
1664 } else {
1665 ergo_verbose0(ErgoHeapSizing,
1666 "did not expand the heap",
1667 ergo_format_reason("heap expansion operation failed"));
1668 // The expansion of the virtual storage space was unsuccessful.
1669 // Let's see if it was because we ran out of swap.
1670 if (G1ExitOnExpansionFailure &&
1671 _hrm.available() >= regions_to_expand) {
1672 // We had head room...
1673 vm_exit_out_of_memory(aligned_expand_bytes, OOM_MMAP_ERROR, "G1 heap expansion");
1674 }
1675 }
1676 return regions_to_expand > 0;
1677 }
1678
1679 void G1CollectedHeap::shrink_helper(size_t shrink_bytes) {
1680 size_t aligned_shrink_bytes =
1681 ReservedSpace::page_align_size_down(shrink_bytes);
1682 aligned_shrink_bytes = align_size_down(aligned_shrink_bytes,
1683 HeapRegion::GrainBytes);
1684 uint num_regions_to_remove = (uint)(shrink_bytes / HeapRegion::GrainBytes);
1685
1686 uint num_regions_removed = _hrm.shrink_by(num_regions_to_remove);
1687 size_t shrunk_bytes = num_regions_removed * HeapRegion::GrainBytes;
1688
1689 ergo_verbose3(ErgoHeapSizing,
1690 "shrink the heap",
1691 ergo_format_byte("requested shrinking amount")
1692 ergo_format_byte("aligned shrinking amount")
1693 ergo_format_byte("attempted shrinking amount"),
1694 shrink_bytes, aligned_shrink_bytes, shrunk_bytes);
1695 if (num_regions_removed > 0) {
1696 g1_policy()->record_new_heap_size(num_regions());
1697 } else {
1698 ergo_verbose0(ErgoHeapSizing,
1699 "did not shrink the heap",
1700 ergo_format_reason("heap shrinking operation failed"));
1701 }
1702 }
1703
1704 void G1CollectedHeap::shrink(size_t shrink_bytes) {
1705 verify_region_sets_optional();
1706
1707 // We should only reach here at the end of a Full GC which means we
1708 // should not not be holding to any GC alloc regions. The method
1709 // below will make sure of that and do any remaining clean up.
1710 _allocator->abandon_gc_alloc_regions();
1711
1712 // Instead of tearing down / rebuilding the free lists here, we
1713 // could instead use the remove_all_pending() method on free_list to
1714 // remove only the ones that we need to remove.
1715 tear_down_region_sets(true /* free_list_only */);
1716 shrink_helper(shrink_bytes);
1717 rebuild_region_sets(true /* free_list_only */);
1718
1719 _hrm.verify_optional();
1720 verify_region_sets_optional();
1721 }
1722
1723 // Public methods.
1724
1725 #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away
1726 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
1727 #endif // _MSC_VER
1728
1729
1730 G1CollectedHeap::G1CollectedHeap(G1CollectorPolicy* policy_) :
1731 SharedHeap(),
1732 _g1_policy(policy_),
1733 _dirty_card_queue_set(false),
1734 _into_cset_dirty_card_queue_set(false),
1735 _is_alive_closure_cm(this),
1736 _is_alive_closure_stw(this),
1737 _ref_processor_cm(NULL),
1738 _ref_processor_stw(NULL),
1739 _bot_shared(NULL),
1740 _evac_failure_scan_stack(NULL),
1741 _mark_in_progress(false),
1742 _cg1r(NULL),
1743 _g1mm(NULL),
1744 _refine_cte_cl(NULL),
1745 _full_collection(false),
1746 _secondary_free_list("Secondary Free List", new SecondaryFreeRegionListMtSafeChecker()),
1747 _old_set("Old Set", false /* humongous */, new OldRegionSetMtSafeChecker()),
1748 _humongous_set("Master Humongous Set", true /* humongous */, new HumongousRegionSetMtSafeChecker()),
1749 _humongous_is_live(),
1750 _has_humongous_reclaim_candidates(false),
1751 _free_regions_coming(false),
1752 _young_list(new YoungList(this)),
1753 _gc_time_stamp(0),
1754 _survivor_plab_stats(YoungPLABSize, PLABWeight),
1755 _old_plab_stats(OldPLABSize, PLABWeight),
1756 _expand_heap_after_alloc_failure(true),
1757 _surviving_young_words(NULL),
1758 _old_marking_cycles_started(0),
1759 _old_marking_cycles_completed(0),
1760 _concurrent_cycle_started(false),
1761 _heap_summary_sent(false),
1762 _in_cset_fast_test(),
1763 _dirty_cards_region_list(NULL),
1764 _worker_cset_start_region(NULL),
1765 _worker_cset_start_region_time_stamp(NULL),
1766 _gc_timer_stw(new (ResourceObj::C_HEAP, mtGC) STWGCTimer()),
1767 _gc_timer_cm(new (ResourceObj::C_HEAP, mtGC) ConcurrentGCTimer()),
1768 _gc_tracer_stw(new (ResourceObj::C_HEAP, mtGC) G1NewTracer()),
1769 _gc_tracer_cm(new (ResourceObj::C_HEAP, mtGC) G1OldTracer()) {
1770
1771 _g1h = this;
1772
1773 _allocator = G1Allocator::create_allocator(_g1h);
1774 _humongous_object_threshold_in_words = HeapRegion::GrainWords / 2;
1775
1776 int n_queues = MAX2((int)ParallelGCThreads, 1);
1777 _task_queues = new RefToScanQueueSet(n_queues);
1778
1779 uint n_rem_sets = HeapRegionRemSet::num_par_rem_sets();
1780 assert(n_rem_sets > 0, "Invariant.");
1781
1782 _worker_cset_start_region = NEW_C_HEAP_ARRAY(HeapRegion*, n_queues, mtGC);
1783 _worker_cset_start_region_time_stamp = NEW_C_HEAP_ARRAY(uint, n_queues, mtGC);
1784 _evacuation_failed_info_array = NEW_C_HEAP_ARRAY(EvacuationFailedInfo, n_queues, mtGC);
1785
1786 for (int i = 0; i < n_queues; i++) {
1787 RefToScanQueue* q = new RefToScanQueue();
1788 q->initialize();
1789 _task_queues->register_queue(i, q);
1790 ::new (&_evacuation_failed_info_array[i]) EvacuationFailedInfo();
1791 }
1792 clear_cset_start_regions();
1793
1794 // Initialize the G1EvacuationFailureALot counters and flags.
1795 NOT_PRODUCT(reset_evacuation_should_fail();)
1796
1797 guarantee(_task_queues != NULL, "task_queues allocation failure.");
1798 }
1799
1800 jint G1CollectedHeap::initialize() {
1801 CollectedHeap::pre_initialize();
1802 os::enable_vtime();
1803
1804 G1Log::init();
1805
1806 // Necessary to satisfy locking discipline assertions.
1807
1808 MutexLocker x(Heap_lock);
1809
1810 // We have to initialize the printer before committing the heap, as
1811 // it will be used then.
1812 _hr_printer.set_active(G1PrintHeapRegions);
1813
1814 // While there are no constraints in the GC code that HeapWordSize
1815 // be any particular value, there are multiple other areas in the
1816 // system which believe this to be true (e.g. oop->object_size in some
1817 // cases incorrectly returns the size in wordSize units rather than
1818 // HeapWordSize).
1819 guarantee(HeapWordSize == wordSize, "HeapWordSize must equal wordSize");
1820
1821 size_t init_byte_size = collector_policy()->initial_heap_byte_size();
1822 size_t max_byte_size = collector_policy()->max_heap_byte_size();
1823 size_t heap_alignment = collector_policy()->heap_alignment();
1824
1825 // Ensure that the sizes are properly aligned.
1826 Universe::check_alignment(init_byte_size, HeapRegion::GrainBytes, "g1 heap");
1827 Universe::check_alignment(max_byte_size, HeapRegion::GrainBytes, "g1 heap");
1828 Universe::check_alignment(max_byte_size, heap_alignment, "g1 heap");
1829
1830 _refine_cte_cl = new RefineCardTableEntryClosure();
1831
1832 _cg1r = new ConcurrentG1Refine(this, _refine_cte_cl);
1833
1834 // Reserve the maximum.
1835
1836 // When compressed oops are enabled, the preferred heap base
1837 // is calculated by subtracting the requested size from the
1838 // 32Gb boundary and using the result as the base address for
1839 // heap reservation. If the requested size is not aligned to
1840 // HeapRegion::GrainBytes (i.e. the alignment that is passed
1841 // into the ReservedHeapSpace constructor) then the actual
1842 // base of the reserved heap may end up differing from the
1843 // address that was requested (i.e. the preferred heap base).
1844 // If this happens then we could end up using a non-optimal
1845 // compressed oops mode.
1846
1847 ReservedSpace heap_rs = Universe::reserve_heap(max_byte_size,
1848 heap_alignment);
1849
1850 initialize_reserved_region((HeapWord*)heap_rs.base(), (HeapWord*)(heap_rs.base() + heap_rs.size()));
1851
1852 // Create the barrier set for the entire reserved region.
1853 G1SATBCardTableLoggingModRefBS* bs
1854 = new G1SATBCardTableLoggingModRefBS(reserved_region());
1855 bs->initialize();
1856 assert(bs->is_a(BarrierSet::G1SATBCTLogging), "sanity");
1857 set_barrier_set(bs);
1858
1859 // Also create a G1 rem set.
1860 _g1_rem_set = new G1RemSet(this, g1_barrier_set());
1861
1862 // Carve out the G1 part of the heap.
1863
1864 ReservedSpace g1_rs = heap_rs.first_part(max_byte_size);
1865 G1RegionToSpaceMapper* heap_storage =
1866 G1RegionToSpaceMapper::create_mapper(g1_rs,
1867 UseLargePages ? os::large_page_size() : os::vm_page_size(),
1868 HeapRegion::GrainBytes,
1869 1,
1870 mtJavaHeap);
1871 heap_storage->set_mapping_changed_listener(&_listener);
1872
1873 // Reserve space for the block offset table. We do not support automatic uncommit
1874 // for the card table at this time. BOT only.
1875 ReservedSpace bot_rs(G1BlockOffsetSharedArray::compute_size(g1_rs.size() / HeapWordSize));
1876 G1RegionToSpaceMapper* bot_storage =
1877 G1RegionToSpaceMapper::create_mapper(bot_rs,
1878 os::vm_page_size(),
1879 HeapRegion::GrainBytes,
1880 G1BlockOffsetSharedArray::N_bytes,
1881 mtGC);
1882
1883 ReservedSpace cardtable_rs(G1SATBCardTableLoggingModRefBS::compute_size(g1_rs.size() / HeapWordSize));
1884 G1RegionToSpaceMapper* cardtable_storage =
1885 G1RegionToSpaceMapper::create_mapper(cardtable_rs,
1886 os::vm_page_size(),
1887 HeapRegion::GrainBytes,
1888 G1BlockOffsetSharedArray::N_bytes,
1889 mtGC);
1890
1891 // Reserve space for the card counts table.
1892 ReservedSpace card_counts_rs(G1BlockOffsetSharedArray::compute_size(g1_rs.size() / HeapWordSize));
1893 G1RegionToSpaceMapper* card_counts_storage =
1894 G1RegionToSpaceMapper::create_mapper(card_counts_rs,
1895 os::vm_page_size(),
1896 HeapRegion::GrainBytes,
1897 G1BlockOffsetSharedArray::N_bytes,
1898 mtGC);
1899
1900 // Reserve space for prev and next bitmap.
1901 size_t bitmap_size = CMBitMap::compute_size(g1_rs.size());
1902
1903 ReservedSpace prev_bitmap_rs(ReservedSpace::allocation_align_size_up(bitmap_size));
1904 G1RegionToSpaceMapper* prev_bitmap_storage =
1905 G1RegionToSpaceMapper::create_mapper(prev_bitmap_rs,
1906 os::vm_page_size(),
1907 HeapRegion::GrainBytes,
1908 CMBitMap::mark_distance(),
1909 mtGC);
1910
1911 ReservedSpace next_bitmap_rs(ReservedSpace::allocation_align_size_up(bitmap_size));
1912 G1RegionToSpaceMapper* next_bitmap_storage =
1913 G1RegionToSpaceMapper::create_mapper(next_bitmap_rs,
1914 os::vm_page_size(),
1915 HeapRegion::GrainBytes,
1916 CMBitMap::mark_distance(),
1917 mtGC);
1918
1919 _hrm.initialize(heap_storage, prev_bitmap_storage, next_bitmap_storage, bot_storage, cardtable_storage, card_counts_storage);
1920 g1_barrier_set()->initialize(cardtable_storage);
1921 // Do later initialization work for concurrent refinement.
1922 _cg1r->init(card_counts_storage);
1923
1924 // 6843694 - ensure that the maximum region index can fit
1925 // in the remembered set structures.
1926 const uint max_region_idx = (1U << (sizeof(RegionIdx_t)*BitsPerByte-1)) - 1;
1927 guarantee((max_regions() - 1) <= max_region_idx, "too many regions");
1928
1929 size_t max_cards_per_region = ((size_t)1 << (sizeof(CardIdx_t)*BitsPerByte-1)) - 1;
1930 guarantee(HeapRegion::CardsPerRegion > 0, "make sure it's initialized");
1931 guarantee(HeapRegion::CardsPerRegion < max_cards_per_region,
1932 "too many cards per region");
1933
1934 FreeRegionList::set_unrealistically_long_length(max_regions() + 1);
1935
1936 _bot_shared = new G1BlockOffsetSharedArray(reserved_region(), bot_storage);
1937
1938 _g1h = this;
1939
1940 _in_cset_fast_test.initialize(_hrm.reserved().start(), _hrm.reserved().end(), HeapRegion::GrainBytes);
1941 _humongous_is_live.initialize(_hrm.reserved().start(), _hrm.reserved().end(), HeapRegion::GrainBytes);
1942
1943 // Create the ConcurrentMark data structure and thread.
1944 // (Must do this late, so that "max_regions" is defined.)
1945 _cm = new ConcurrentMark(this, prev_bitmap_storage, next_bitmap_storage);
1946 if (_cm == NULL || !_cm->completed_initialization()) {
1947 vm_shutdown_during_initialization("Could not create/initialize ConcurrentMark");
1948 return JNI_ENOMEM;
1949 }
1950 _cmThread = _cm->cmThread();
1951
1952 // Initialize the from_card cache structure of HeapRegionRemSet.
1953 HeapRegionRemSet::init_heap(max_regions());
1954
1955 // Now expand into the initial heap size.
1956 if (!expand(init_byte_size)) {
1957 vm_shutdown_during_initialization("Failed to allocate initial heap.");
1958 return JNI_ENOMEM;
1959 }
1960
1961 // Perform any initialization actions delegated to the policy.
1962 g1_policy()->init();
1963
1964 JavaThread::satb_mark_queue_set().initialize(SATB_Q_CBL_mon,
1965 SATB_Q_FL_lock,
1966 G1SATBProcessCompletedThreshold,
1967 Shared_SATB_Q_lock);
1968
1969 JavaThread::dirty_card_queue_set().initialize(_refine_cte_cl,
1970 DirtyCardQ_CBL_mon,
1971 DirtyCardQ_FL_lock,
1972 concurrent_g1_refine()->yellow_zone(),
1973 concurrent_g1_refine()->red_zone(),
1974 Shared_DirtyCardQ_lock);
1975
1976 dirty_card_queue_set().initialize(NULL, // Should never be called by the Java code
1977 DirtyCardQ_CBL_mon,
1978 DirtyCardQ_FL_lock,
1979 -1, // never trigger processing
1980 -1, // no limit on length
1981 Shared_DirtyCardQ_lock,
1982 &JavaThread::dirty_card_queue_set());
1983
1984 // Initialize the card queue set used to hold cards containing
1985 // references into the collection set.
1986 _into_cset_dirty_card_queue_set.initialize(NULL, // Should never be called by the Java code
1987 DirtyCardQ_CBL_mon,
1988 DirtyCardQ_FL_lock,
1989 -1, // never trigger processing
1990 -1, // no limit on length
1991 Shared_DirtyCardQ_lock,
1992 &JavaThread::dirty_card_queue_set());
1993
1994 // Here we allocate the dummy HeapRegion that is required by the
1995 // G1AllocRegion class.
1996 HeapRegion* dummy_region = _hrm.get_dummy_region();
1997
1998 // We'll re-use the same region whether the alloc region will
1999 // require BOT updates or not and, if it doesn't, then a non-young
2000 // region will complain that it cannot support allocations without
2001 // BOT updates. So we'll tag the dummy region as eden to avoid that.
2002 dummy_region->set_eden();
2003 // Make sure it's full.
2004 dummy_region->set_top(dummy_region->end());
2005 G1AllocRegion::setup(this, dummy_region);
2006
2007 _allocator->init_mutator_alloc_region();
2008
2009 // Do create of the monitoring and management support so that
2010 // values in the heap have been properly initialized.
2011 _g1mm = new G1MonitoringSupport(this);
2012
2013 G1StringDedup::initialize();
2014
2015 return JNI_OK;
2016 }
2017
2018 void G1CollectedHeap::stop() {
2019 // Stop all concurrent threads. We do this to make sure these threads
2020 // do not continue to execute and access resources (e.g. gclog_or_tty)
2021 // that are destroyed during shutdown.
2022 _cg1r->stop();
2023 _cmThread->stop();
2024 if (G1StringDedup::is_enabled()) {
2025 G1StringDedup::stop();
2026 }
2027 }
2028
2029 void G1CollectedHeap::clear_humongous_is_live_table() {
2030 guarantee(G1EagerReclaimHumongousObjects, "Should only be called if true");
2031 _humongous_is_live.clear();
2032 }
2033
2034 size_t G1CollectedHeap::conservative_max_heap_alignment() {
2035 return HeapRegion::max_region_size();
2036 }
2037
2038 void G1CollectedHeap::post_initialize() {
2039 CollectedHeap::post_initialize();
2040 ref_processing_init();
2041 }
2042
2043 void G1CollectedHeap::ref_processing_init() {
2044 // Reference processing in G1 currently works as follows:
2045 //
2046 // * There are two reference processor instances. One is
2047 // used to record and process discovered references
2048 // during concurrent marking; the other is used to
2049 // record and process references during STW pauses
2050 // (both full and incremental).
2051 // * Both ref processors need to 'span' the entire heap as
2052 // the regions in the collection set may be dotted around.
2053 //
2054 // * For the concurrent marking ref processor:
2055 // * Reference discovery is enabled at initial marking.
2056 // * Reference discovery is disabled and the discovered
2057 // references processed etc during remarking.
2058 // * Reference discovery is MT (see below).
2059 // * Reference discovery requires a barrier (see below).
2060 // * Reference processing may or may not be MT
2061 // (depending on the value of ParallelRefProcEnabled
2062 // and ParallelGCThreads).
2063 // * A full GC disables reference discovery by the CM
2064 // ref processor and abandons any entries on it's
2065 // discovered lists.
2066 //
2067 // * For the STW processor:
2068 // * Non MT discovery is enabled at the start of a full GC.
2069 // * Processing and enqueueing during a full GC is non-MT.
2070 // * During a full GC, references are processed after marking.
2071 //
2072 // * Discovery (may or may not be MT) is enabled at the start
2073 // of an incremental evacuation pause.
2074 // * References are processed near the end of a STW evacuation pause.
2075 // * For both types of GC:
2076 // * Discovery is atomic - i.e. not concurrent.
2077 // * Reference discovery will not need a barrier.
2078
2079 MemRegion mr = reserved_region();
2080
2081 // Concurrent Mark ref processor
2082 _ref_processor_cm =
2083 new ReferenceProcessor(mr, // span
2084 ParallelRefProcEnabled && (ParallelGCThreads > 1),
2085 // mt processing
2086 (int) ParallelGCThreads,
2087 // degree of mt processing
2088 (ParallelGCThreads > 1) || (ConcGCThreads > 1),
2089 // mt discovery
2090 (int) MAX2(ParallelGCThreads, ConcGCThreads),
2091 // degree of mt discovery
2092 false,
2093 // Reference discovery is not atomic
2094 &_is_alive_closure_cm);
2095 // is alive closure
2096 // (for efficiency/performance)
2097
2098 // STW ref processor
2099 _ref_processor_stw =
2100 new ReferenceProcessor(mr, // span
2101 ParallelRefProcEnabled && (ParallelGCThreads > 1),
2102 // mt processing
2103 MAX2((int)ParallelGCThreads, 1),
2104 // degree of mt processing
2105 (ParallelGCThreads > 1),
2106 // mt discovery
2107 MAX2((int)ParallelGCThreads, 1),
2108 // degree of mt discovery
2109 true,
2110 // Reference discovery is atomic
2111 &_is_alive_closure_stw);
2112 // is alive closure
2113 // (for efficiency/performance)
2114 }
2115
2116 size_t G1CollectedHeap::capacity() const {
2117 return _hrm.length() * HeapRegion::GrainBytes;
2118 }
2119
2120 void G1CollectedHeap::reset_gc_time_stamps(HeapRegion* hr) {
2121 assert(!hr->is_continues_humongous(), "pre-condition");
2122 hr->reset_gc_time_stamp();
2123 if (hr->is_starts_humongous()) {
2124 uint first_index = hr->hrm_index() + 1;
2125 uint last_index = hr->last_hc_index();
2126 for (uint i = first_index; i < last_index; i += 1) {
2127 HeapRegion* chr = region_at(i);
2128 assert(chr->is_continues_humongous(), "sanity");
2129 chr->reset_gc_time_stamp();
2130 }
2131 }
2132 }
2133
2134 #ifndef PRODUCT
2135
2136 class CheckGCTimeStampsHRClosure : public HeapRegionClosure {
2137 private:
2138 unsigned _gc_time_stamp;
2139 bool _failures;
2140
2141 public:
2142 CheckGCTimeStampsHRClosure(unsigned gc_time_stamp) :
2143 _gc_time_stamp(gc_time_stamp), _failures(false) { }
2144
2145 virtual bool doHeapRegion(HeapRegion* hr) {
2146 unsigned region_gc_time_stamp = hr->get_gc_time_stamp();
2147 if (_gc_time_stamp != region_gc_time_stamp) {
2148 gclog_or_tty->print_cr("Region "HR_FORMAT" has GC time stamp = %d, "
2149 "expected %d", HR_FORMAT_PARAMS(hr),
2150 region_gc_time_stamp, _gc_time_stamp);
2151 _failures = true;
2152 }
2153 return false;
2154 }
2155
2156 bool failures() { return _failures; }
2157 };
2158
2159 void G1CollectedHeap::check_gc_time_stamps() {
2160 CheckGCTimeStampsHRClosure cl(_gc_time_stamp);
2161 heap_region_iterate(&cl);
2162 guarantee(!cl.failures(), "all GC time stamps should have been reset");
2163 }
2164 #endif // PRODUCT
2165
2166 void G1CollectedHeap::iterate_dirty_card_closure(CardTableEntryClosure* cl,
2167 DirtyCardQueue* into_cset_dcq,
2168 bool concurrent,
2169 uint worker_i) {
2170 // Clean cards in the hot card cache
2171 G1HotCardCache* hot_card_cache = _cg1r->hot_card_cache();
2172 hot_card_cache->drain(worker_i, g1_rem_set(), into_cset_dcq);
2173
2174 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
2175 size_t n_completed_buffers = 0;
2176 while (dcqs.apply_closure_to_completed_buffer(cl, worker_i, 0, true)) {
2177 n_completed_buffers++;
2178 }
2179 g1_policy()->phase_times()->record_thread_work_item(G1GCPhaseTimes::UpdateRS, worker_i, n_completed_buffers);
2180 dcqs.clear_n_completed_buffers();
2181 assert(!dcqs.completed_buffers_exist_dirty(), "Completed buffers exist!");
2182 }
2183
2184
2185 // Computes the sum of the storage used by the various regions.
2186 size_t G1CollectedHeap::used() const {
2187 return _allocator->used();
2188 }
2189
2190 size_t G1CollectedHeap::used_unlocked() const {
2191 return _allocator->used_unlocked();
2192 }
2193
2194 class SumUsedClosure: public HeapRegionClosure {
2195 size_t _used;
2196 public:
2197 SumUsedClosure() : _used(0) {}
2198 bool doHeapRegion(HeapRegion* r) {
2199 if (!r->is_continues_humongous()) {
2200 _used += r->used();
2201 }
2202 return false;
2203 }
2204 size_t result() { return _used; }
2205 };
2206
2207 size_t G1CollectedHeap::recalculate_used() const {
2208 double recalculate_used_start = os::elapsedTime();
2209
2210 SumUsedClosure blk;
2211 heap_region_iterate(&blk);
2212
2213 g1_policy()->phase_times()->record_evac_fail_recalc_used_time((os::elapsedTime() - recalculate_used_start) * 1000.0);
2214 return blk.result();
2215 }
2216
2217 bool G1CollectedHeap::should_do_concurrent_full_gc(GCCause::Cause cause) {
2218 switch (cause) {
2219 case GCCause::_gc_locker: return GCLockerInvokesConcurrent;
2220 case GCCause::_java_lang_system_gc: return ExplicitGCInvokesConcurrent;
2221 case GCCause::_g1_humongous_allocation: return true;
2222 case GCCause::_update_allocation_context_stats_inc: return true;
2223 case GCCause::_wb_conc_mark: return true;
2224 default: return false;
2225 }
2226 }
2227
2228 #ifndef PRODUCT
2229 void G1CollectedHeap::allocate_dummy_regions() {
2230 // Let's fill up most of the region
2231 size_t word_size = HeapRegion::GrainWords - 1024;
2232 // And as a result the region we'll allocate will be humongous.
2233 guarantee(is_humongous(word_size), "sanity");
2234
2235 for (uintx i = 0; i < G1DummyRegionsPerGC; ++i) {
2236 // Let's use the existing mechanism for the allocation
2237 HeapWord* dummy_obj = humongous_obj_allocate(word_size,
2238 AllocationContext::system());
2239 if (dummy_obj != NULL) {
2240 MemRegion mr(dummy_obj, word_size);
2241 CollectedHeap::fill_with_object(mr);
2242 } else {
2243 // If we can't allocate once, we probably cannot allocate
2244 // again. Let's get out of the loop.
2245 break;
2246 }
2247 }
2248 }
2249 #endif // !PRODUCT
2250
2251 void G1CollectedHeap::increment_old_marking_cycles_started() {
2252 assert(_old_marking_cycles_started == _old_marking_cycles_completed ||
2253 _old_marking_cycles_started == _old_marking_cycles_completed + 1,
2254 err_msg("Wrong marking cycle count (started: %d, completed: %d)",
2255 _old_marking_cycles_started, _old_marking_cycles_completed));
2256
2257 _old_marking_cycles_started++;
2258 }
2259
2260 void G1CollectedHeap::increment_old_marking_cycles_completed(bool concurrent) {
2261 MonitorLockerEx x(FullGCCount_lock, Mutex::_no_safepoint_check_flag);
2262
2263 // We assume that if concurrent == true, then the caller is a
2264 // concurrent thread that was joined the Suspendible Thread
2265 // Set. If there's ever a cheap way to check this, we should add an
2266 // assert here.
2267
2268 // Given that this method is called at the end of a Full GC or of a
2269 // concurrent cycle, and those can be nested (i.e., a Full GC can
2270 // interrupt a concurrent cycle), the number of full collections
2271 // completed should be either one (in the case where there was no
2272 // nesting) or two (when a Full GC interrupted a concurrent cycle)
2273 // behind the number of full collections started.
2274
2275 // This is the case for the inner caller, i.e. a Full GC.
2276 assert(concurrent ||
2277 (_old_marking_cycles_started == _old_marking_cycles_completed + 1) ||
2278 (_old_marking_cycles_started == _old_marking_cycles_completed + 2),
2279 err_msg("for inner caller (Full GC): _old_marking_cycles_started = %u "
2280 "is inconsistent with _old_marking_cycles_completed = %u",
2281 _old_marking_cycles_started, _old_marking_cycles_completed));
2282
2283 // This is the case for the outer caller, i.e. the concurrent cycle.
2284 assert(!concurrent ||
2285 (_old_marking_cycles_started == _old_marking_cycles_completed + 1),
2286 err_msg("for outer caller (concurrent cycle): "
2287 "_old_marking_cycles_started = %u "
2288 "is inconsistent with _old_marking_cycles_completed = %u",
2289 _old_marking_cycles_started, _old_marking_cycles_completed));
2290
2291 _old_marking_cycles_completed += 1;
2292
2293 // We need to clear the "in_progress" flag in the CM thread before
2294 // we wake up any waiters (especially when ExplicitInvokesConcurrent
2295 // is set) so that if a waiter requests another System.gc() it doesn't
2296 // incorrectly see that a marking cycle is still in progress.
2297 if (concurrent) {
2298 _cmThread->clear_in_progress();
2299 }
2300
2301 // This notify_all() will ensure that a thread that called
2302 // System.gc() with (with ExplicitGCInvokesConcurrent set or not)
2303 // and it's waiting for a full GC to finish will be woken up. It is
2304 // waiting in VM_G1IncCollectionPause::doit_epilogue().
2305 FullGCCount_lock->notify_all();
2306 }
2307
2308 void G1CollectedHeap::register_concurrent_cycle_start(const Ticks& start_time) {
2309 _concurrent_cycle_started = true;
2310 _gc_timer_cm->register_gc_start(start_time);
2311
2312 _gc_tracer_cm->report_gc_start(gc_cause(), _gc_timer_cm->gc_start());
2313 trace_heap_before_gc(_gc_tracer_cm);
2314 }
2315
2316 void G1CollectedHeap::register_concurrent_cycle_end() {
2317 if (_concurrent_cycle_started) {
2318 if (_cm->has_aborted()) {
2319 _gc_tracer_cm->report_concurrent_mode_failure();
2320 }
2321
2322 _gc_timer_cm->register_gc_end();
2323 _gc_tracer_cm->report_gc_end(_gc_timer_cm->gc_end(), _gc_timer_cm->time_partitions());
2324
2325 // Clear state variables to prepare for the next concurrent cycle.
2326 _concurrent_cycle_started = false;
2327 _heap_summary_sent = false;
2328 }
2329 }
2330
2331 void G1CollectedHeap::trace_heap_after_concurrent_cycle() {
2332 if (_concurrent_cycle_started) {
2333 // This function can be called when:
2334 // the cleanup pause is run
2335 // the concurrent cycle is aborted before the cleanup pause.
2336 // the concurrent cycle is aborted after the cleanup pause,
2337 // but before the concurrent cycle end has been registered.
2338 // Make sure that we only send the heap information once.
2339 if (!_heap_summary_sent) {
2340 trace_heap_after_gc(_gc_tracer_cm);
2341 _heap_summary_sent = true;
2342 }
2343 }
2344 }
2345
2346 G1YCType G1CollectedHeap::yc_type() {
2347 bool is_young = g1_policy()->gcs_are_young();
2348 bool is_initial_mark = g1_policy()->during_initial_mark_pause();
2349 bool is_during_mark = mark_in_progress();
2350
2351 if (is_initial_mark) {
2352 return InitialMark;
2353 } else if (is_during_mark) {
2354 return DuringMark;
2355 } else if (is_young) {
2356 return Normal;
2357 } else {
2358 return Mixed;
2359 }
2360 }
2361
2362 void G1CollectedHeap::collect(GCCause::Cause cause) {
2363 assert_heap_not_locked();
2364
2365 uint gc_count_before;
2366 uint old_marking_count_before;
2367 uint full_gc_count_before;
2368 bool retry_gc;
2369
2370 do {
2371 retry_gc = false;
2372
2373 {
2374 MutexLocker ml(Heap_lock);
2375
2376 // Read the GC count while holding the Heap_lock
2377 gc_count_before = total_collections();
2378 full_gc_count_before = total_full_collections();
2379 old_marking_count_before = _old_marking_cycles_started;
2380 }
2381
2382 if (should_do_concurrent_full_gc(cause)) {
2383 // Schedule an initial-mark evacuation pause that will start a
2384 // concurrent cycle. We're setting word_size to 0 which means that
2385 // we are not requesting a post-GC allocation.
2386 VM_G1IncCollectionPause op(gc_count_before,
2387 0, /* word_size */
2388 true, /* should_initiate_conc_mark */
2389 g1_policy()->max_pause_time_ms(),
2390 cause);
2391 op.set_allocation_context(AllocationContext::current());
2392
2393 VMThread::execute(&op);
2394 if (!op.pause_succeeded()) {
2395 if (old_marking_count_before == _old_marking_cycles_started) {
2396 retry_gc = op.should_retry_gc();
2397 } else {
2398 // A Full GC happened while we were trying to schedule the
2399 // initial-mark GC. No point in starting a new cycle given
2400 // that the whole heap was collected anyway.
2401 }
2402
2403 if (retry_gc) {
2404 if (GC_locker::is_active_and_needs_gc()) {
2405 GC_locker::stall_until_clear();
2406 }
2407 }
2408 }
2409 } else {
2410 if (cause == GCCause::_gc_locker || cause == GCCause::_wb_young_gc
2411 DEBUG_ONLY(|| cause == GCCause::_scavenge_alot)) {
2412
2413 // Schedule a standard evacuation pause. We're setting word_size
2414 // to 0 which means that we are not requesting a post-GC allocation.
2415 VM_G1IncCollectionPause op(gc_count_before,
2416 0, /* word_size */
2417 false, /* should_initiate_conc_mark */
2418 g1_policy()->max_pause_time_ms(),
2419 cause);
2420 VMThread::execute(&op);
2421 } else {
2422 // Schedule a Full GC.
2423 VM_G1CollectFull op(gc_count_before, full_gc_count_before, cause);
2424 VMThread::execute(&op);
2425 }
2426 }
2427 } while (retry_gc);
2428 }
2429
2430 bool G1CollectedHeap::is_in(const void* p) const {
2431 if (_hrm.reserved().contains(p)) {
2432 // Given that we know that p is in the reserved space,
2433 // heap_region_containing_raw() should successfully
2434 // return the containing region.
2435 HeapRegion* hr = heap_region_containing_raw(p);
2436 return hr->is_in(p);
2437 } else {
2438 return false;
2439 }
2440 }
2441
2442 #ifdef ASSERT
2443 bool G1CollectedHeap::is_in_exact(const void* p) const {
2444 bool contains = reserved_region().contains(p);
2445 bool available = _hrm.is_available(addr_to_region((HeapWord*)p));
2446 if (contains && available) {
2447 return true;
2448 } else {
2449 return false;
2450 }
2451 }
2452 #endif
2453
2454 // Iteration functions.
2455
2456 // Applies an ExtendedOopClosure onto all references of objects within a HeapRegion.
2457
2458 class IterateOopClosureRegionClosure: public HeapRegionClosure {
2459 ExtendedOopClosure* _cl;
2460 public:
2461 IterateOopClosureRegionClosure(ExtendedOopClosure* cl) : _cl(cl) {}
2462 bool doHeapRegion(HeapRegion* r) {
2463 if (!r->is_continues_humongous()) {
2464 r->oop_iterate(_cl);
2465 }
2466 return false;
2467 }
2468 };
2469
2470 void G1CollectedHeap::oop_iterate(ExtendedOopClosure* cl) {
2471 IterateOopClosureRegionClosure blk(cl);
2472 heap_region_iterate(&blk);
2473 }
2474
2475 // Iterates an ObjectClosure over all objects within a HeapRegion.
2476
2477 class IterateObjectClosureRegionClosure: public HeapRegionClosure {
2478 ObjectClosure* _cl;
2479 public:
2480 IterateObjectClosureRegionClosure(ObjectClosure* cl) : _cl(cl) {}
2481 bool doHeapRegion(HeapRegion* r) {
2482 if (!r->is_continues_humongous()) {
2483 r->object_iterate(_cl);
2484 }
2485 return false;
2486 }
2487 };
2488
2489 void G1CollectedHeap::object_iterate(ObjectClosure* cl) {
2490 IterateObjectClosureRegionClosure blk(cl);
2491 heap_region_iterate(&blk);
2492 }
2493
2494 void G1CollectedHeap::heap_region_iterate(HeapRegionClosure* cl) const {
2495 _hrm.iterate(cl);
2496 }
2497
2498 void
2499 G1CollectedHeap::heap_region_par_iterate(HeapRegionClosure* cl,
2500 uint worker_id,
2501 HeapRegionClaimer *hrclaimer,
2502 bool concurrent) const {
2503 _hrm.par_iterate(cl, worker_id, hrclaimer, concurrent);
2504 }
2505
2506 // Clear the cached CSet starting regions and (more importantly)
2507 // the time stamps. Called when we reset the GC time stamp.
2508 void G1CollectedHeap::clear_cset_start_regions() {
2509 assert(_worker_cset_start_region != NULL, "sanity");
2510 assert(_worker_cset_start_region_time_stamp != NULL, "sanity");
2511
2512 int n_queues = MAX2((int)ParallelGCThreads, 1);
2513 for (int i = 0; i < n_queues; i++) {
2514 _worker_cset_start_region[i] = NULL;
2515 _worker_cset_start_region_time_stamp[i] = 0;
2516 }
2517 }
2518
2519 // Given the id of a worker, obtain or calculate a suitable
2520 // starting region for iterating over the current collection set.
2521 HeapRegion* G1CollectedHeap::start_cset_region_for_worker(uint worker_i) {
2522 assert(get_gc_time_stamp() > 0, "should have been updated by now");
2523
2524 HeapRegion* result = NULL;
2525 unsigned gc_time_stamp = get_gc_time_stamp();
2526
2527 if (_worker_cset_start_region_time_stamp[worker_i] == gc_time_stamp) {
2528 // Cached starting region for current worker was set
2529 // during the current pause - so it's valid.
2530 // Note: the cached starting heap region may be NULL
2531 // (when the collection set is empty).
2532 result = _worker_cset_start_region[worker_i];
2533 assert(result == NULL || result->in_collection_set(), "sanity");
2534 return result;
2535 }
2536
2537 // The cached entry was not valid so let's calculate
2538 // a suitable starting heap region for this worker.
2539
2540 // We want the parallel threads to start their collection
2541 // set iteration at different collection set regions to
2542 // avoid contention.
2543 // If we have:
2544 // n collection set regions
2545 // p threads
2546 // Then thread t will start at region floor ((t * n) / p)
2547
2548 result = g1_policy()->collection_set();
2549 uint cs_size = g1_policy()->cset_region_length();
2550 uint active_workers = workers()->active_workers();
2551 assert(UseDynamicNumberOfGCThreads ||
2552 active_workers == workers()->total_workers(),
2553 "Unless dynamic should use total workers");
2554
2555 uint end_ind = (cs_size * worker_i) / active_workers;
2556 uint start_ind = 0;
2557
2558 if (worker_i > 0 &&
2559 _worker_cset_start_region_time_stamp[worker_i - 1] == gc_time_stamp) {
2560 // Previous workers starting region is valid
2561 // so let's iterate from there
2562 start_ind = (cs_size * (worker_i - 1)) / active_workers;
2563 result = _worker_cset_start_region[worker_i - 1];
2564 }
2565
2566 for (uint i = start_ind; i < end_ind; i++) {
2567 result = result->next_in_collection_set();
2568 }
2569
2570 // Note: the calculated starting heap region may be NULL
2571 // (when the collection set is empty).
2572 assert(result == NULL || result->in_collection_set(), "sanity");
2573 assert(_worker_cset_start_region_time_stamp[worker_i] != gc_time_stamp,
2574 "should be updated only once per pause");
2575 _worker_cset_start_region[worker_i] = result;
2576 OrderAccess::storestore();
2577 _worker_cset_start_region_time_stamp[worker_i] = gc_time_stamp;
2578 return result;
2579 }
2580
2581 void G1CollectedHeap::collection_set_iterate(HeapRegionClosure* cl) {
2582 HeapRegion* r = g1_policy()->collection_set();
2583 while (r != NULL) {
2584 HeapRegion* next = r->next_in_collection_set();
2585 if (cl->doHeapRegion(r)) {
2586 cl->incomplete();
2587 return;
2588 }
2589 r = next;
2590 }
2591 }
2592
2593 void G1CollectedHeap::collection_set_iterate_from(HeapRegion* r,
2594 HeapRegionClosure *cl) {
2595 if (r == NULL) {
2596 // The CSet is empty so there's nothing to do.
2597 return;
2598 }
2599
2600 assert(r->in_collection_set(),
2601 "Start region must be a member of the collection set.");
2602 HeapRegion* cur = r;
2603 while (cur != NULL) {
2604 HeapRegion* next = cur->next_in_collection_set();
2605 if (cl->doHeapRegion(cur) && false) {
2606 cl->incomplete();
2607 return;
2608 }
2609 cur = next;
2610 }
2611 cur = g1_policy()->collection_set();
2612 while (cur != r) {
2613 HeapRegion* next = cur->next_in_collection_set();
2614 if (cl->doHeapRegion(cur) && false) {
2615 cl->incomplete();
2616 return;
2617 }
2618 cur = next;
2619 }
2620 }
2621
2622 HeapRegion* G1CollectedHeap::next_compaction_region(const HeapRegion* from) const {
2623 HeapRegion* result = _hrm.next_region_in_heap(from);
2624 while (result != NULL && result->is_humongous()) {
2625 result = _hrm.next_region_in_heap(result);
2626 }
2627 return result;
2628 }
2629
2630 Space* G1CollectedHeap::space_containing(const void* addr) const {
2631 return heap_region_containing(addr);
2632 }
2633
2634 HeapWord* G1CollectedHeap::block_start(const void* addr) const {
2635 Space* sp = space_containing(addr);
2636 return sp->block_start(addr);
2637 }
2638
2639 size_t G1CollectedHeap::block_size(const HeapWord* addr) const {
2640 Space* sp = space_containing(addr);
2641 return sp->block_size(addr);
2642 }
2643
2644 bool G1CollectedHeap::block_is_obj(const HeapWord* addr) const {
2645 Space* sp = space_containing(addr);
2646 return sp->block_is_obj(addr);
2647 }
2648
2649 bool G1CollectedHeap::supports_tlab_allocation() const {
2650 return true;
2651 }
2652
2653 size_t G1CollectedHeap::tlab_capacity(Thread* ignored) const {
2654 return (_g1_policy->young_list_target_length() - young_list()->survivor_length()) * HeapRegion::GrainBytes;
2655 }
2656
2657 size_t G1CollectedHeap::tlab_used(Thread* ignored) const {
2658 return young_list()->eden_used_bytes();
2659 }
2660
2661 // For G1 TLABs should not contain humongous objects, so the maximum TLAB size
2662 // must be smaller than the humongous object limit.
2663 size_t G1CollectedHeap::max_tlab_size() const {
2664 return align_size_down(_humongous_object_threshold_in_words - 1, MinObjAlignment);
2665 }
2666
2667 size_t G1CollectedHeap::unsafe_max_tlab_alloc(Thread* ignored) const {
2668 // Return the remaining space in the cur alloc region, but not less than
2669 // the min TLAB size.
2670
2671 // Also, this value can be at most the humongous object threshold,
2672 // since we can't allow tlabs to grow big enough to accommodate
2673 // humongous objects.
2674
2675 HeapRegion* hr = _allocator->mutator_alloc_region(AllocationContext::current())->get();
2676 size_t max_tlab = max_tlab_size() * wordSize;
2677 if (hr == NULL) {
2678 return max_tlab;
2679 } else {
2680 return MIN2(MAX2(hr->free(), (size_t) MinTLABSize), max_tlab);
2681 }
2682 }
2683
2684 size_t G1CollectedHeap::max_capacity() const {
2685 return _hrm.reserved().byte_size();
2686 }
2687
2688 jlong G1CollectedHeap::millis_since_last_gc() {
2689 // assert(false, "NYI");
2690 return 0;
2691 }
2692
2693 void G1CollectedHeap::prepare_for_verify() {
2694 if (SafepointSynchronize::is_at_safepoint() || ! UseTLAB) {
2695 ensure_parsability(false);
2696 }
2697 g1_rem_set()->prepare_for_verify();
2698 }
2699
2700 bool G1CollectedHeap::allocated_since_marking(oop obj, HeapRegion* hr,
2701 VerifyOption vo) {
2702 switch (vo) {
2703 case VerifyOption_G1UsePrevMarking:
2704 return hr->obj_allocated_since_prev_marking(obj);
2705 case VerifyOption_G1UseNextMarking:
2706 return hr->obj_allocated_since_next_marking(obj);
2707 case VerifyOption_G1UseMarkWord:
2708 return false;
2709 default:
2710 ShouldNotReachHere();
2711 }
2712 return false; // keep some compilers happy
2713 }
2714
2715 HeapWord* G1CollectedHeap::top_at_mark_start(HeapRegion* hr, VerifyOption vo) {
2716 switch (vo) {
2717 case VerifyOption_G1UsePrevMarking: return hr->prev_top_at_mark_start();
2718 case VerifyOption_G1UseNextMarking: return hr->next_top_at_mark_start();
2719 case VerifyOption_G1UseMarkWord: return NULL;
2720 default: ShouldNotReachHere();
2721 }
2722 return NULL; // keep some compilers happy
2723 }
2724
2725 bool G1CollectedHeap::is_marked(oop obj, VerifyOption vo) {
2726 switch (vo) {
2727 case VerifyOption_G1UsePrevMarking: return isMarkedPrev(obj);
2728 case VerifyOption_G1UseNextMarking: return isMarkedNext(obj);
2729 case VerifyOption_G1UseMarkWord: return obj->is_gc_marked();
2730 default: ShouldNotReachHere();
2731 }
2732 return false; // keep some compilers happy
2733 }
2734
2735 const char* G1CollectedHeap::top_at_mark_start_str(VerifyOption vo) {
2736 switch (vo) {
2737 case VerifyOption_G1UsePrevMarking: return "PTAMS";
2738 case VerifyOption_G1UseNextMarking: return "NTAMS";
2739 case VerifyOption_G1UseMarkWord: return "NONE";
2740 default: ShouldNotReachHere();
2741 }
2742 return NULL; // keep some compilers happy
2743 }
2744
2745 class VerifyRootsClosure: public OopClosure {
2746 private:
2747 G1CollectedHeap* _g1h;
2748 VerifyOption _vo;
2749 bool _failures;
2750 public:
2751 // _vo == UsePrevMarking -> use "prev" marking information,
2752 // _vo == UseNextMarking -> use "next" marking information,
2753 // _vo == UseMarkWord -> use mark word from object header.
2754 VerifyRootsClosure(VerifyOption vo) :
2755 _g1h(G1CollectedHeap::heap()),
2756 _vo(vo),
2757 _failures(false) { }
2758
2759 bool failures() { return _failures; }
2760
2761 template <class T> void do_oop_nv(T* p) {
2762 T heap_oop = oopDesc::load_heap_oop(p);
2763 if (!oopDesc::is_null(heap_oop)) {
2764 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
2765 if (_g1h->is_obj_dead_cond(obj, _vo)) {
2766 gclog_or_tty->print_cr("Root location "PTR_FORMAT" "
2767 "points to dead obj "PTR_FORMAT, p, (void*) obj);
2768 if (_vo == VerifyOption_G1UseMarkWord) {
2769 gclog_or_tty->print_cr(" Mark word: "PTR_FORMAT, (void*)(obj->mark()));
2770 }
2771 obj->print_on(gclog_or_tty);
2772 _failures = true;
2773 }
2774 }
2775 }
2776
2777 void do_oop(oop* p) { do_oop_nv(p); }
2778 void do_oop(narrowOop* p) { do_oop_nv(p); }
2779 };
2780
2781 class G1VerifyCodeRootOopClosure: public OopClosure {
2782 G1CollectedHeap* _g1h;
2783 OopClosure* _root_cl;
2784 nmethod* _nm;
2785 VerifyOption _vo;
2786 bool _failures;
2787
2788 template <class T> void do_oop_work(T* p) {
2789 // First verify that this root is live
2790 _root_cl->do_oop(p);
2791
2792 if (!G1VerifyHeapRegionCodeRoots) {
2793 // We're not verifying the code roots attached to heap region.
2794 return;
2795 }
2796
2797 // Don't check the code roots during marking verification in a full GC
2798 if (_vo == VerifyOption_G1UseMarkWord) {
2799 return;
2800 }
2801
2802 // Now verify that the current nmethod (which contains p) is
2803 // in the code root list of the heap region containing the
2804 // object referenced by p.
2805
2806 T heap_oop = oopDesc::load_heap_oop(p);
2807 if (!oopDesc::is_null(heap_oop)) {
2808 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
2809
2810 // Now fetch the region containing the object
2811 HeapRegion* hr = _g1h->heap_region_containing(obj);
2812 HeapRegionRemSet* hrrs = hr->rem_set();
2813 // Verify that the strong code root list for this region
2814 // contains the nmethod
2815 if (!hrrs->strong_code_roots_list_contains(_nm)) {
2816 gclog_or_tty->print_cr("Code root location "PTR_FORMAT" "
2817 "from nmethod "PTR_FORMAT" not in strong "
2818 "code roots for region ["PTR_FORMAT","PTR_FORMAT")",
2819 p, _nm, hr->bottom(), hr->end());
2820 _failures = true;
2821 }
2822 }
2823 }
2824
2825 public:
2826 G1VerifyCodeRootOopClosure(G1CollectedHeap* g1h, OopClosure* root_cl, VerifyOption vo):
2827 _g1h(g1h), _root_cl(root_cl), _vo(vo), _nm(NULL), _failures(false) {}
2828
2829 void do_oop(oop* p) { do_oop_work(p); }
2830 void do_oop(narrowOop* p) { do_oop_work(p); }
2831
2832 void set_nmethod(nmethod* nm) { _nm = nm; }
2833 bool failures() { return _failures; }
2834 };
2835
2836 class G1VerifyCodeRootBlobClosure: public CodeBlobClosure {
2837 G1VerifyCodeRootOopClosure* _oop_cl;
2838
2839 public:
2840 G1VerifyCodeRootBlobClosure(G1VerifyCodeRootOopClosure* oop_cl):
2841 _oop_cl(oop_cl) {}
2842
2843 void do_code_blob(CodeBlob* cb) {
2844 nmethod* nm = cb->as_nmethod_or_null();
2845 if (nm != NULL) {
2846 _oop_cl->set_nmethod(nm);
2847 nm->oops_do(_oop_cl);
2848 }
2849 }
2850 };
2851
2852 class YoungRefCounterClosure : public OopClosure {
2853 G1CollectedHeap* _g1h;
2854 int _count;
2855 public:
2856 YoungRefCounterClosure(G1CollectedHeap* g1h) : _g1h(g1h), _count(0) {}
2857 void do_oop(oop* p) { if (_g1h->is_in_young(*p)) { _count++; } }
2858 void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2859
2860 int count() { return _count; }
2861 void reset_count() { _count = 0; };
2862 };
2863
2864 class VerifyKlassClosure: public KlassClosure {
2865 YoungRefCounterClosure _young_ref_counter_closure;
2866 OopClosure *_oop_closure;
2867 public:
2868 VerifyKlassClosure(G1CollectedHeap* g1h, OopClosure* cl) : _young_ref_counter_closure(g1h), _oop_closure(cl) {}
2869 void do_klass(Klass* k) {
2870 k->oops_do(_oop_closure);
2871
2872 _young_ref_counter_closure.reset_count();
2873 k->oops_do(&_young_ref_counter_closure);
2874 if (_young_ref_counter_closure.count() > 0) {
2875 guarantee(k->has_modified_oops(), err_msg("Klass " PTR_FORMAT ", has young refs but is not dirty.", k));
2876 }
2877 }
2878 };
2879
2880 class VerifyLivenessOopClosure: public OopClosure {
2881 G1CollectedHeap* _g1h;
2882 VerifyOption _vo;
2883 public:
2884 VerifyLivenessOopClosure(G1CollectedHeap* g1h, VerifyOption vo):
2885 _g1h(g1h), _vo(vo)
2886 { }
2887 void do_oop(narrowOop *p) { do_oop_work(p); }
2888 void do_oop( oop *p) { do_oop_work(p); }
2889
2890 template <class T> void do_oop_work(T *p) {
2891 oop obj = oopDesc::load_decode_heap_oop(p);
2892 guarantee(obj == NULL || !_g1h->is_obj_dead_cond(obj, _vo),
2893 "Dead object referenced by a not dead object");
2894 }
2895 };
2896
2897 class VerifyObjsInRegionClosure: public ObjectClosure {
2898 private:
2899 G1CollectedHeap* _g1h;
2900 size_t _live_bytes;
2901 HeapRegion *_hr;
2902 VerifyOption _vo;
2903 public:
2904 // _vo == UsePrevMarking -> use "prev" marking information,
2905 // _vo == UseNextMarking -> use "next" marking information,
2906 // _vo == UseMarkWord -> use mark word from object header.
2907 VerifyObjsInRegionClosure(HeapRegion *hr, VerifyOption vo)
2908 : _live_bytes(0), _hr(hr), _vo(vo) {
2909 _g1h = G1CollectedHeap::heap();
2910 }
2911 void do_object(oop o) {
2912 VerifyLivenessOopClosure isLive(_g1h, _vo);
2913 assert(o != NULL, "Huh?");
2914 if (!_g1h->is_obj_dead_cond(o, _vo)) {
2915 // If the object is alive according to the mark word,
2916 // then verify that the marking information agrees.
2917 // Note we can't verify the contra-positive of the
2918 // above: if the object is dead (according to the mark
2919 // word), it may not be marked, or may have been marked
2920 // but has since became dead, or may have been allocated
2921 // since the last marking.
2922 if (_vo == VerifyOption_G1UseMarkWord) {
2923 guarantee(!_g1h->is_obj_dead(o), "mark word and concurrent mark mismatch");
2924 }
2925
2926 o->oop_iterate_no_header(&isLive);
2927 if (!_hr->obj_allocated_since_prev_marking(o)) {
2928 size_t obj_size = o->size(); // Make sure we don't overflow
2929 _live_bytes += (obj_size * HeapWordSize);
2930 }
2931 }
2932 }
2933 size_t live_bytes() { return _live_bytes; }
2934 };
2935
2936 class PrintObjsInRegionClosure : public ObjectClosure {
2937 HeapRegion *_hr;
2938 G1CollectedHeap *_g1;
2939 public:
2940 PrintObjsInRegionClosure(HeapRegion *hr) : _hr(hr) {
2941 _g1 = G1CollectedHeap::heap();
2942 };
2943
2944 void do_object(oop o) {
2945 if (o != NULL) {
2946 HeapWord *start = (HeapWord *) o;
2947 size_t word_sz = o->size();
2948 gclog_or_tty->print("\nPrinting obj "PTR_FORMAT" of size " SIZE_FORMAT
2949 " isMarkedPrev %d isMarkedNext %d isAllocSince %d\n",
2950 (void*) o, word_sz,
2951 _g1->isMarkedPrev(o),
2952 _g1->isMarkedNext(o),
2953 _hr->obj_allocated_since_prev_marking(o));
2954 HeapWord *end = start + word_sz;
2955 HeapWord *cur;
2956 int *val;
2957 for (cur = start; cur < end; cur++) {
2958 val = (int *) cur;
2959 gclog_or_tty->print("\t "PTR_FORMAT":%d\n", val, *val);
2960 }
2961 }
2962 }
2963 };
2964
2965 class VerifyRegionClosure: public HeapRegionClosure {
2966 private:
2967 bool _par;
2968 VerifyOption _vo;
2969 bool _failures;
2970 public:
2971 // _vo == UsePrevMarking -> use "prev" marking information,
2972 // _vo == UseNextMarking -> use "next" marking information,
2973 // _vo == UseMarkWord -> use mark word from object header.
2974 VerifyRegionClosure(bool par, VerifyOption vo)
2975 : _par(par),
2976 _vo(vo),
2977 _failures(false) {}
2978
2979 bool failures() {
2980 return _failures;
2981 }
2982
2983 bool doHeapRegion(HeapRegion* r) {
2984 if (!r->is_continues_humongous()) {
2985 bool failures = false;
2986 r->verify(_vo, &failures);
2987 if (failures) {
2988 _failures = true;
2989 } else {
2990 VerifyObjsInRegionClosure not_dead_yet_cl(r, _vo);
2991 r->object_iterate(¬_dead_yet_cl);
2992 if (_vo != VerifyOption_G1UseNextMarking) {
2993 if (r->max_live_bytes() < not_dead_yet_cl.live_bytes()) {
2994 gclog_or_tty->print_cr("["PTR_FORMAT","PTR_FORMAT"] "
2995 "max_live_bytes "SIZE_FORMAT" "
2996 "< calculated "SIZE_FORMAT,
2997 r->bottom(), r->end(),
2998 r->max_live_bytes(),
2999 not_dead_yet_cl.live_bytes());
3000 _failures = true;
3001 }
3002 } else {
3003 // When vo == UseNextMarking we cannot currently do a sanity
3004 // check on the live bytes as the calculation has not been
3005 // finalized yet.
3006 }
3007 }
3008 }
3009 return false; // stop the region iteration if we hit a failure
3010 }
3011 };
3012
3013 // This is the task used for parallel verification of the heap regions
3014
3015 class G1ParVerifyTask: public AbstractGangTask {
3016 private:
3017 G1CollectedHeap* _g1h;
3018 VerifyOption _vo;
3019 bool _failures;
3020 HeapRegionClaimer _hrclaimer;
3021
3022 public:
3023 // _vo == UsePrevMarking -> use "prev" marking information,
3024 // _vo == UseNextMarking -> use "next" marking information,
3025 // _vo == UseMarkWord -> use mark word from object header.
3026 G1ParVerifyTask(G1CollectedHeap* g1h, VerifyOption vo) :
3027 AbstractGangTask("Parallel verify task"),
3028 _g1h(g1h),
3029 _vo(vo),
3030 _failures(false),
3031 _hrclaimer(g1h->workers()->active_workers()) {}
3032
3033 bool failures() {
3034 return _failures;
3035 }
3036
3037 void work(uint worker_id) {
3038 HandleMark hm;
3039 VerifyRegionClosure blk(true, _vo);
3040 _g1h->heap_region_par_iterate(&blk, worker_id, &_hrclaimer);
3041 if (blk.failures()) {
3042 _failures = true;
3043 }
3044 }
3045 };
3046
3047 void G1CollectedHeap::verify(bool silent, VerifyOption vo) {
3048 if (SafepointSynchronize::is_at_safepoint()) {
3049 assert(Thread::current()->is_VM_thread(),
3050 "Expected to be executed serially by the VM thread at this point");
3051
3052 if (!silent) { gclog_or_tty->print("Roots "); }
3053 VerifyRootsClosure rootsCl(vo);
3054 VerifyKlassClosure klassCl(this, &rootsCl);
3055 CLDToKlassAndOopClosure cldCl(&klassCl, &rootsCl, false);
3056
3057 // We apply the relevant closures to all the oops in the
3058 // system dictionary, class loader data graph, the string table
3059 // and the nmethods in the code cache.
3060 G1VerifyCodeRootOopClosure codeRootsCl(this, &rootsCl, vo);
3061 G1VerifyCodeRootBlobClosure blobsCl(&codeRootsCl);
3062
3063 {
3064 G1RootProcessor root_processor(this);
3065 root_processor.process_all_roots(&rootsCl,
3066 &cldCl,
3067 &blobsCl);
3068 }
3069
3070 bool failures = rootsCl.failures() || codeRootsCl.failures();
3071
3072 if (vo != VerifyOption_G1UseMarkWord) {
3073 // If we're verifying during a full GC then the region sets
3074 // will have been torn down at the start of the GC. Therefore
3075 // verifying the region sets will fail. So we only verify
3076 // the region sets when not in a full GC.
3077 if (!silent) { gclog_or_tty->print("HeapRegionSets "); }
3078 verify_region_sets();
3079 }
3080
3081 if (!silent) { gclog_or_tty->print("HeapRegions "); }
3082 if (GCParallelVerificationEnabled && ParallelGCThreads > 1) {
3083
3084 G1ParVerifyTask task(this, vo);
3085 assert(UseDynamicNumberOfGCThreads ||
3086 workers()->active_workers() == workers()->total_workers(),
3087 "If not dynamic should be using all the workers");
3088 int n_workers = workers()->active_workers();
3089 set_par_threads(n_workers);
3090 workers()->run_task(&task);
3091 set_par_threads(0);
3092 if (task.failures()) {
3093 failures = true;
3094 }
3095
3096 } else {
3097 VerifyRegionClosure blk(false, vo);
3098 heap_region_iterate(&blk);
3099 if (blk.failures()) {
3100 failures = true;
3101 }
3102 }
3103
3104 if (G1StringDedup::is_enabled()) {
3105 if (!silent) gclog_or_tty->print("StrDedup ");
3106 G1StringDedup::verify();
3107 }
3108
3109 if (failures) {
3110 gclog_or_tty->print_cr("Heap:");
3111 // It helps to have the per-region information in the output to
3112 // help us track down what went wrong. This is why we call
3113 // print_extended_on() instead of print_on().
3114 print_extended_on(gclog_or_tty);
3115 gclog_or_tty->cr();
3116 #ifndef PRODUCT
3117 if (VerifyDuringGC && G1VerifyDuringGCPrintReachable) {
3118 concurrent_mark()->print_reachable("at-verification-failure",
3119 vo, false /* all */);
3120 }
3121 #endif
3122 gclog_or_tty->flush();
3123 }
3124 guarantee(!failures, "there should not have been any failures");
3125 } else {
3126 if (!silent) {
3127 gclog_or_tty->print("(SKIPPING Roots, HeapRegionSets, HeapRegions, RemSet");
3128 if (G1StringDedup::is_enabled()) {
3129 gclog_or_tty->print(", StrDedup");
3130 }
3131 gclog_or_tty->print(") ");
3132 }
3133 }
3134 }
3135
3136 void G1CollectedHeap::verify(bool silent) {
3137 verify(silent, VerifyOption_G1UsePrevMarking);
3138 }
3139
3140 double G1CollectedHeap::verify(bool guard, const char* msg) {
3141 double verify_time_ms = 0.0;
3142
3143 if (guard && total_collections() >= VerifyGCStartAt) {
3144 double verify_start = os::elapsedTime();
3145 HandleMark hm; // Discard invalid handles created during verification
3146 prepare_for_verify();
3147 Universe::verify(VerifyOption_G1UsePrevMarking, msg);
3148 verify_time_ms = (os::elapsedTime() - verify_start) * 1000;
3149 }
3150
3151 return verify_time_ms;
3152 }
3153
3154 void G1CollectedHeap::verify_before_gc() {
3155 double verify_time_ms = verify(VerifyBeforeGC, " VerifyBeforeGC:");
3156 g1_policy()->phase_times()->record_verify_before_time_ms(verify_time_ms);
3157 }
3158
3159 void G1CollectedHeap::verify_after_gc() {
3160 double verify_time_ms = verify(VerifyAfterGC, " VerifyAfterGC:");
3161 g1_policy()->phase_times()->record_verify_after_time_ms(verify_time_ms);
3162 }
3163
3164 class PrintRegionClosure: public HeapRegionClosure {
3165 outputStream* _st;
3166 public:
3167 PrintRegionClosure(outputStream* st) : _st(st) {}
3168 bool doHeapRegion(HeapRegion* r) {
3169 r->print_on(_st);
3170 return false;
3171 }
3172 };
3173
3174 bool G1CollectedHeap::is_obj_dead_cond(const oop obj,
3175 const HeapRegion* hr,
3176 const VerifyOption vo) const {
3177 switch (vo) {
3178 case VerifyOption_G1UsePrevMarking: return is_obj_dead(obj, hr);
3179 case VerifyOption_G1UseNextMarking: return is_obj_ill(obj, hr);
3180 case VerifyOption_G1UseMarkWord: return !obj->is_gc_marked();
3181 default: ShouldNotReachHere();
3182 }
3183 return false; // keep some compilers happy
3184 }
3185
3186 bool G1CollectedHeap::is_obj_dead_cond(const oop obj,
3187 const VerifyOption vo) const {
3188 switch (vo) {
3189 case VerifyOption_G1UsePrevMarking: return is_obj_dead(obj);
3190 case VerifyOption_G1UseNextMarking: return is_obj_ill(obj);
3191 case VerifyOption_G1UseMarkWord: return !obj->is_gc_marked();
3192 default: ShouldNotReachHere();
3193 }
3194 return false; // keep some compilers happy
3195 }
3196
3197 void G1CollectedHeap::print_on(outputStream* st) const {
3198 st->print(" %-20s", "garbage-first heap");
3199 st->print(" total " SIZE_FORMAT "K, used " SIZE_FORMAT "K",
3200 capacity()/K, used_unlocked()/K);
3201 st->print(" [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT ")",
3202 _hrm.reserved().start(),
3203 _hrm.reserved().start() + _hrm.length() + HeapRegion::GrainWords,
3204 _hrm.reserved().end());
3205 st->cr();
3206 st->print(" region size " SIZE_FORMAT "K, ", HeapRegion::GrainBytes / K);
3207 uint young_regions = _young_list->length();
3208 st->print("%u young (" SIZE_FORMAT "K), ", young_regions,
3209 (size_t) young_regions * HeapRegion::GrainBytes / K);
3210 uint survivor_regions = g1_policy()->recorded_survivor_regions();
3211 st->print("%u survivors (" SIZE_FORMAT "K)", survivor_regions,
3212 (size_t) survivor_regions * HeapRegion::GrainBytes / K);
3213 st->cr();
3214 MetaspaceAux::print_on(st);
3215 }
3216
3217 void G1CollectedHeap::print_extended_on(outputStream* st) const {
3218 print_on(st);
3219
3220 // Print the per-region information.
3221 st->cr();
3222 st->print_cr("Heap Regions: (Y=young(eden), SU=young(survivor), "
3223 "HS=humongous(starts), HC=humongous(continues), "
3224 "CS=collection set, F=free, TS=gc time stamp, "
3225 "PTAMS=previous top-at-mark-start, "
3226 "NTAMS=next top-at-mark-start)");
3227 PrintRegionClosure blk(st);
3228 heap_region_iterate(&blk);
3229 }
3230
3231 void G1CollectedHeap::print_on_error(outputStream* st) const {
3232 this->CollectedHeap::print_on_error(st);
3233
3234 if (_cm != NULL) {
3235 st->cr();
3236 _cm->print_on_error(st);
3237 }
3238 }
3239
3240 void G1CollectedHeap::print_gc_threads_on(outputStream* st) const {
3241 workers()->print_worker_threads_on(st);
3242 _cmThread->print_on(st);
3243 st->cr();
3244 _cm->print_worker_threads_on(st);
3245 _cg1r->print_worker_threads_on(st);
3246 if (G1StringDedup::is_enabled()) {
3247 G1StringDedup::print_worker_threads_on(st);
3248 }
3249 }
3250
3251 void G1CollectedHeap::gc_threads_do(ThreadClosure* tc) const {
3252 workers()->threads_do(tc);
3253 tc->do_thread(_cmThread);
3254 _cg1r->threads_do(tc);
3255 if (G1StringDedup::is_enabled()) {
3256 G1StringDedup::threads_do(tc);
3257 }
3258 }
3259
3260 void G1CollectedHeap::print_tracing_info() const {
3261 // We'll overload this to mean "trace GC pause statistics."
3262 if (TraceYoungGenTime || TraceOldGenTime) {
3263 // The "G1CollectorPolicy" is keeping track of these stats, so delegate
3264 // to that.
3265 g1_policy()->print_tracing_info();
3266 }
3267 if (G1SummarizeRSetStats) {
3268 g1_rem_set()->print_summary_info();
3269 }
3270 if (G1SummarizeConcMark) {
3271 concurrent_mark()->print_summary_info();
3272 }
3273 g1_policy()->print_yg_surv_rate_info();
3274 }
3275
3276 #ifndef PRODUCT
3277 // Helpful for debugging RSet issues.
3278
3279 class PrintRSetsClosure : public HeapRegionClosure {
3280 private:
3281 const char* _msg;
3282 size_t _occupied_sum;
3283
3284 public:
3285 bool doHeapRegion(HeapRegion* r) {
3286 HeapRegionRemSet* hrrs = r->rem_set();
3287 size_t occupied = hrrs->occupied();
3288 _occupied_sum += occupied;
3289
3290 gclog_or_tty->print_cr("Printing RSet for region "HR_FORMAT,
3291 HR_FORMAT_PARAMS(r));
3292 if (occupied == 0) {
3293 gclog_or_tty->print_cr(" RSet is empty");
3294 } else {
3295 hrrs->print();
3296 }
3297 gclog_or_tty->print_cr("----------");
3298 return false;
3299 }
3300
3301 PrintRSetsClosure(const char* msg) : _msg(msg), _occupied_sum(0) {
3302 gclog_or_tty->cr();
3303 gclog_or_tty->print_cr("========================================");
3304 gclog_or_tty->print_cr("%s", msg);
3305 gclog_or_tty->cr();
3306 }
3307
3308 ~PrintRSetsClosure() {
3309 gclog_or_tty->print_cr("Occupied Sum: "SIZE_FORMAT, _occupied_sum);
3310 gclog_or_tty->print_cr("========================================");
3311 gclog_or_tty->cr();
3312 }
3313 };
3314
3315 void G1CollectedHeap::print_cset_rsets() {
3316 PrintRSetsClosure cl("Printing CSet RSets");
3317 collection_set_iterate(&cl);
3318 }
3319
3320 void G1CollectedHeap::print_all_rsets() {
3321 PrintRSetsClosure cl("Printing All RSets");;
3322 heap_region_iterate(&cl);
3323 }
3324 #endif // PRODUCT
3325
3326 G1CollectedHeap* G1CollectedHeap::heap() {
3327 return _g1h;
3328 }
3329
3330 void G1CollectedHeap::gc_prologue(bool full /* Ignored */) {
3331 // always_do_update_barrier = false;
3332 assert(InlineCacheBuffer::is_empty(), "should have cleaned up ICBuffer");
3333 // Fill TLAB's and such
3334 accumulate_statistics_all_tlabs();
3335 ensure_parsability(true);
3336
3337 if (G1SummarizeRSetStats && (G1SummarizeRSetStatsPeriod > 0) &&
3338 (total_collections() % G1SummarizeRSetStatsPeriod == 0)) {
3339 g1_rem_set()->print_periodic_summary_info("Before GC RS summary");
3340 }
3341 }
3342
3343 void G1CollectedHeap::gc_epilogue(bool full) {
3344
3345 if (G1SummarizeRSetStats &&
3346 (G1SummarizeRSetStatsPeriod > 0) &&
3347 // we are at the end of the GC. Total collections has already been increased.
3348 ((total_collections() - 1) % G1SummarizeRSetStatsPeriod == 0)) {
3349 g1_rem_set()->print_periodic_summary_info("After GC RS summary");
3350 }
3351
3352 // FIXME: what is this about?
3353 // I'm ignoring the "fill_newgen()" call if "alloc_event_enabled"
3354 // is set.
3355 COMPILER2_PRESENT(assert(DerivedPointerTable::is_empty(),
3356 "derived pointer present"));
3357 // always_do_update_barrier = true;
3358
3359 resize_all_tlabs();
3360 allocation_context_stats().update(full);
3361
3362 // We have just completed a GC. Update the soft reference
3363 // policy with the new heap occupancy
3364 Universe::update_heap_info_at_gc();
3365 }
3366
3367 HeapWord* G1CollectedHeap::do_collection_pause(size_t word_size,
3368 uint gc_count_before,
3369 bool* succeeded,
3370 GCCause::Cause gc_cause) {
3371 assert_heap_not_locked_and_not_at_safepoint();
3372 g1_policy()->record_stop_world_start();
3373 VM_G1IncCollectionPause op(gc_count_before,
3374 word_size,
3375 false, /* should_initiate_conc_mark */
3376 g1_policy()->max_pause_time_ms(),
3377 gc_cause);
3378
3379 op.set_allocation_context(AllocationContext::current());
3380 VMThread::execute(&op);
3381
3382 HeapWord* result = op.result();
3383 bool ret_succeeded = op.prologue_succeeded() && op.pause_succeeded();
3384 assert(result == NULL || ret_succeeded,
3385 "the result should be NULL if the VM did not succeed");
3386 *succeeded = ret_succeeded;
3387
3388 assert_heap_not_locked();
3389 return result;
3390 }
3391
3392 void
3393 G1CollectedHeap::doConcurrentMark() {
3394 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag);
3395 if (!_cmThread->in_progress()) {
3396 _cmThread->set_started();
3397 CGC_lock->notify();
3398 }
3399 }
3400
3401 size_t G1CollectedHeap::pending_card_num() {
3402 size_t extra_cards = 0;
3403 JavaThread *curr = Threads::first();
3404 while (curr != NULL) {
3405 DirtyCardQueue& dcq = curr->dirty_card_queue();
3406 extra_cards += dcq.size();
3407 curr = curr->next();
3408 }
3409 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
3410 size_t buffer_size = dcqs.buffer_size();
3411 size_t buffer_num = dcqs.completed_buffers_num();
3412
3413 // PtrQueueSet::buffer_size() and PtrQueue:size() return sizes
3414 // in bytes - not the number of 'entries'. We need to convert
3415 // into a number of cards.
3416 return (buffer_size * buffer_num + extra_cards) / oopSize;
3417 }
3418
3419 size_t G1CollectedHeap::cards_scanned() {
3420 return g1_rem_set()->cardsScanned();
3421 }
3422
3423 bool G1CollectedHeap::humongous_region_is_always_live(uint index) {
3424 HeapRegion* region = region_at(index);
3425 assert(region->is_starts_humongous(), "Must start a humongous object");
3426 return oop(region->bottom())->is_objArray() || !region->rem_set()->is_empty();
3427 }
3428
3429 class RegisterHumongousWithInCSetFastTestClosure : public HeapRegionClosure {
3430 private:
3431 size_t _total_humongous;
3432 size_t _candidate_humongous;
3433
3434 DirtyCardQueue _dcq;
3435
3436 bool humongous_region_is_candidate(uint index) {
3437 HeapRegion* region = G1CollectedHeap::heap()->region_at(index);
3438 assert(region->is_starts_humongous(), "Must start a humongous object");
3439 HeapRegionRemSet* const rset = region->rem_set();
3440 bool const allow_stale_refs = G1EagerReclaimHumongousObjectsWithStaleRefs;
3441 return !oop(region->bottom())->is_objArray() &&
3442 ((allow_stale_refs && rset->occupancy_less_or_equal_than(G1RSetSparseRegionEntries)) ||
3443 (!allow_stale_refs && rset->is_empty()));
3444 }
3445
3446 public:
3447 RegisterHumongousWithInCSetFastTestClosure()
3448 : _total_humongous(0),
3449 _candidate_humongous(0),
3450 _dcq(&JavaThread::dirty_card_queue_set()) {
3451 }
3452
3453 virtual bool doHeapRegion(HeapRegion* r) {
3454 if (!r->is_starts_humongous()) {
3455 return false;
3456 }
3457 G1CollectedHeap* g1h = G1CollectedHeap::heap();
3458
3459 uint region_idx = r->hrm_index();
3460 bool is_candidate = humongous_region_is_candidate(region_idx);
3461 // Is_candidate already filters out humongous object with large remembered sets.
3462 // If we have a humongous object with a few remembered sets, we simply flush these
3463 // remembered set entries into the DCQS. That will result in automatic
3464 // re-evaluation of their remembered set entries during the following evacuation
3465 // phase.
3466 if (is_candidate) {
3467 if (!r->rem_set()->is_empty()) {
3468 guarantee(r->rem_set()->occupancy_less_or_equal_than(G1RSetSparseRegionEntries),
3469 "Found a not-small remembered set here. This is inconsistent with previous assumptions.");
3470 G1SATBCardTableLoggingModRefBS* bs = g1h->g1_barrier_set();
3471 HeapRegionRemSetIterator hrrs(r->rem_set());
3472 size_t card_index;
3473 while (hrrs.has_next(card_index)) {
3474 jbyte* card_ptr = (jbyte*)bs->byte_for_index(card_index);
3475 // The remembered set might contain references to already freed
3476 // regions. Filter out such entries to avoid failing card table
3477 // verification.
3478 if (!g1h->heap_region_containing(bs->addr_for(card_ptr))->is_free()) {
3479 if (*card_ptr != CardTableModRefBS::dirty_card_val()) {
3480 *card_ptr = CardTableModRefBS::dirty_card_val();
3481 _dcq.enqueue(card_ptr);
3482 }
3483 }
3484 }
3485 r->rem_set()->clear_locked();
3486 }
3487 assert(r->rem_set()->is_empty(), "At this point any humongous candidate remembered set must be empty.");
3488 g1h->register_humongous_region_with_cset(region_idx);
3489 _candidate_humongous++;
3490 }
3491 _total_humongous++;
3492
3493 return false;
3494 }
3495
3496 size_t total_humongous() const { return _total_humongous; }
3497 size_t candidate_humongous() const { return _candidate_humongous; }
3498
3499 void flush_rem_set_entries() { _dcq.flush(); }
3500 };
3501
3502 void G1CollectedHeap::register_humongous_regions_with_cset() {
3503 if (!G1EagerReclaimHumongousObjects) {
3504 g1_policy()->phase_times()->record_fast_reclaim_humongous_stats(0.0, 0, 0);
3505 return;
3506 }
3507 double time = os::elapsed_counter();
3508
3509 RegisterHumongousWithInCSetFastTestClosure cl;
3510 heap_region_iterate(&cl);
3511
3512 time = ((double)(os::elapsed_counter() - time) / os::elapsed_frequency()) * 1000.0;
3513 g1_policy()->phase_times()->record_fast_reclaim_humongous_stats(time,
3514 cl.total_humongous(),
3515 cl.candidate_humongous());
3516 _has_humongous_reclaim_candidates = cl.candidate_humongous() > 0;
3517
3518 if (_has_humongous_reclaim_candidates || G1TraceEagerReclaimHumongousObjects) {
3519 clear_humongous_is_live_table();
3520 }
3521
3522 // Finally flush all remembered set entries to re-check into the global DCQS.
3523 cl.flush_rem_set_entries();
3524 }
3525
3526 void
3527 G1CollectedHeap::setup_surviving_young_words() {
3528 assert(_surviving_young_words == NULL, "pre-condition");
3529 uint array_length = g1_policy()->young_cset_region_length();
3530 _surviving_young_words = NEW_C_HEAP_ARRAY(size_t, (size_t) array_length, mtGC);
3531 if (_surviving_young_words == NULL) {
3532 vm_exit_out_of_memory(sizeof(size_t) * array_length, OOM_MALLOC_ERROR,
3533 "Not enough space for young surv words summary.");
3534 }
3535 memset(_surviving_young_words, 0, (size_t) array_length * sizeof(size_t));
3536 #ifdef ASSERT
3537 for (uint i = 0; i < array_length; ++i) {
3538 assert( _surviving_young_words[i] == 0, "memset above" );
3539 }
3540 #endif // !ASSERT
3541 }
3542
3543 void
3544 G1CollectedHeap::update_surviving_young_words(size_t* surv_young_words) {
3545 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag);
3546 uint array_length = g1_policy()->young_cset_region_length();
3547 for (uint i = 0; i < array_length; ++i) {
3548 _surviving_young_words[i] += surv_young_words[i];
3549 }
3550 }
3551
3552 void
3553 G1CollectedHeap::cleanup_surviving_young_words() {
3554 guarantee( _surviving_young_words != NULL, "pre-condition" );
3555 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words);
3556 _surviving_young_words = NULL;
3557 }
3558
3559 #ifdef ASSERT
3560 class VerifyCSetClosure: public HeapRegionClosure {
3561 public:
3562 bool doHeapRegion(HeapRegion* hr) {
3563 // Here we check that the CSet region's RSet is ready for parallel
3564 // iteration. The fields that we'll verify are only manipulated
3565 // when the region is part of a CSet and is collected. Afterwards,
3566 // we reset these fields when we clear the region's RSet (when the
3567 // region is freed) so they are ready when the region is
3568 // re-allocated. The only exception to this is if there's an
3569 // evacuation failure and instead of freeing the region we leave
3570 // it in the heap. In that case, we reset these fields during
3571 // evacuation failure handling.
3572 guarantee(hr->rem_set()->verify_ready_for_par_iteration(), "verification");
3573
3574 // Here's a good place to add any other checks we'd like to
3575 // perform on CSet regions.
3576 return false;
3577 }
3578 };
3579 #endif // ASSERT
3580
3581 #if TASKQUEUE_STATS
3582 void G1CollectedHeap::print_taskqueue_stats_hdr(outputStream* const st) {
3583 st->print_raw_cr("GC Task Stats");
3584 st->print_raw("thr "); TaskQueueStats::print_header(1, st); st->cr();
3585 st->print_raw("--- "); TaskQueueStats::print_header(2, st); st->cr();
3586 }
3587
3588 void G1CollectedHeap::print_taskqueue_stats(outputStream* const st) const {
3589 print_taskqueue_stats_hdr(st);
3590
3591 TaskQueueStats totals;
3592 const int n = workers()->total_workers();
3593 for (int i = 0; i < n; ++i) {
3594 st->print("%3d ", i); task_queue(i)->stats.print(st); st->cr();
3595 totals += task_queue(i)->stats;
3596 }
3597 st->print_raw("tot "); totals.print(st); st->cr();
3598
3599 DEBUG_ONLY(totals.verify());
3600 }
3601
3602 void G1CollectedHeap::reset_taskqueue_stats() {
3603 const int n = workers()->total_workers();
3604 for (int i = 0; i < n; ++i) {
3605 task_queue(i)->stats.reset();
3606 }
3607 }
3608 #endif // TASKQUEUE_STATS
3609
3610 void G1CollectedHeap::log_gc_header() {
3611 if (!G1Log::fine()) {
3612 return;
3613 }
3614
3615 gclog_or_tty->gclog_stamp(_gc_tracer_stw->gc_id());
3616
3617 GCCauseString gc_cause_str = GCCauseString("GC pause", gc_cause())
3618 .append(g1_policy()->gcs_are_young() ? "(young)" : "(mixed)")
3619 .append(g1_policy()->during_initial_mark_pause() ? " (initial-mark)" : "");
3620
3621 gclog_or_tty->print("[%s", (const char*)gc_cause_str);
3622 }
3623
3624 void G1CollectedHeap::log_gc_footer(double pause_time_sec) {
3625 if (!G1Log::fine()) {
3626 return;
3627 }
3628
3629 if (G1Log::finer()) {
3630 if (evacuation_failed()) {
3631 gclog_or_tty->print(" (to-space exhausted)");
3632 }
3633 gclog_or_tty->print_cr(", %3.7f secs]", pause_time_sec);
3634 g1_policy()->phase_times()->note_gc_end();
3635 g1_policy()->phase_times()->print(pause_time_sec);
3636 g1_policy()->print_detailed_heap_transition();
3637 } else {
3638 if (evacuation_failed()) {
3639 gclog_or_tty->print("--");
3640 }
3641 g1_policy()->print_heap_transition();
3642 gclog_or_tty->print_cr(", %3.7f secs]", pause_time_sec);
3643 }
3644 gclog_or_tty->flush();
3645 }
3646
3647 bool
3648 G1CollectedHeap::do_collection_pause_at_safepoint(double target_pause_time_ms) {
3649 assert_at_safepoint(true /* should_be_vm_thread */);
3650 guarantee(!is_gc_active(), "collection is not reentrant");
3651
3652 if (GC_locker::check_active_before_gc()) {
3653 return false;
3654 }
3655
3656 _gc_timer_stw->register_gc_start();
3657
3658 _gc_tracer_stw->report_gc_start(gc_cause(), _gc_timer_stw->gc_start());
3659
3660 SvcGCMarker sgcm(SvcGCMarker::MINOR);
3661 ResourceMark rm;
3662
3663 print_heap_before_gc();
3664 trace_heap_before_gc(_gc_tracer_stw);
3665
3666 verify_region_sets_optional();
3667 verify_dirty_young_regions();
3668
3669 // This call will decide whether this pause is an initial-mark
3670 // pause. If it is, during_initial_mark_pause() will return true
3671 // for the duration of this pause.
3672 g1_policy()->decide_on_conc_mark_initiation();
3673
3674 // We do not allow initial-mark to be piggy-backed on a mixed GC.
3675 assert(!g1_policy()->during_initial_mark_pause() ||
3676 g1_policy()->gcs_are_young(), "sanity");
3677
3678 // We also do not allow mixed GCs during marking.
3679 assert(!mark_in_progress() || g1_policy()->gcs_are_young(), "sanity");
3680
3681 // Record whether this pause is an initial mark. When the current
3682 // thread has completed its logging output and it's safe to signal
3683 // the CM thread, the flag's value in the policy has been reset.
3684 bool should_start_conc_mark = g1_policy()->during_initial_mark_pause();
3685
3686 // Inner scope for scope based logging, timers, and stats collection
3687 {
3688 EvacuationInfo evacuation_info;
3689
3690 if (g1_policy()->during_initial_mark_pause()) {
3691 // We are about to start a marking cycle, so we increment the
3692 // full collection counter.
3693 increment_old_marking_cycles_started();
3694 register_concurrent_cycle_start(_gc_timer_stw->gc_start());
3695 }
3696
3697 _gc_tracer_stw->report_yc_type(yc_type());
3698
3699 TraceCPUTime tcpu(G1Log::finer(), true, gclog_or_tty);
3700
3701 uint active_workers = AdaptiveSizePolicy::calc_active_workers(workers()->total_workers(),
3702 workers()->active_workers(),
3703 Threads::number_of_non_daemon_threads());
3704 assert(UseDynamicNumberOfGCThreads ||
3705 active_workers == workers()->total_workers(),
3706 "If not dynamic should be using all the workers");
3707 workers()->set_active_workers(active_workers);
3708
3709 double pause_start_sec = os::elapsedTime();
3710 g1_policy()->phase_times()->note_gc_start(active_workers, mark_in_progress());
3711 log_gc_header();
3712
3713 TraceCollectorStats tcs(g1mm()->incremental_collection_counters());
3714 TraceMemoryManagerStats tms(false /* fullGC */, gc_cause());
3715
3716 // If the secondary_free_list is not empty, append it to the
3717 // free_list. No need to wait for the cleanup operation to finish;
3718 // the region allocation code will check the secondary_free_list
3719 // and wait if necessary. If the G1StressConcRegionFreeing flag is
3720 // set, skip this step so that the region allocation code has to
3721 // get entries from the secondary_free_list.
3722 if (!G1StressConcRegionFreeing) {
3723 append_secondary_free_list_if_not_empty_with_lock();
3724 }
3725
3726 assert(check_young_list_well_formed(), "young list should be well formed");
3727
3728 // Don't dynamically change the number of GC threads this early. A value of
3729 // 0 is used to indicate serial work. When parallel work is done,
3730 // it will be set.
3731
3732 { // Call to jvmpi::post_class_unload_events must occur outside of active GC
3733 IsGCActiveMark x;
3734
3735 gc_prologue(false);
3736 increment_total_collections(false /* full gc */);
3737 increment_gc_time_stamp();
3738
3739 verify_before_gc();
3740
3741 check_bitmaps("GC Start");
3742
3743 COMPILER2_PRESENT(DerivedPointerTable::clear());
3744
3745 // Please see comment in g1CollectedHeap.hpp and
3746 // G1CollectedHeap::ref_processing_init() to see how
3747 // reference processing currently works in G1.
3748
3749 // Enable discovery in the STW reference processor
3750 ref_processor_stw()->enable_discovery();
3751
3752 {
3753 // We want to temporarily turn off discovery by the
3754 // CM ref processor, if necessary, and turn it back on
3755 // on again later if we do. Using a scoped
3756 // NoRefDiscovery object will do this.
3757 NoRefDiscovery no_cm_discovery(ref_processor_cm());
3758
3759 // Forget the current alloc region (we might even choose it to be part
3760 // of the collection set!).
3761 _allocator->release_mutator_alloc_region();
3762
3763 // We should call this after we retire the mutator alloc
3764 // region(s) so that all the ALLOC / RETIRE events are generated
3765 // before the start GC event.
3766 _hr_printer.start_gc(false /* full */, (size_t) total_collections());
3767
3768 // This timing is only used by the ergonomics to handle our pause target.
3769 // It is unclear why this should not include the full pause. We will
3770 // investigate this in CR 7178365.
3771 //
3772 // Preserving the old comment here if that helps the investigation:
3773 //
3774 // The elapsed time induced by the start time below deliberately elides
3775 // the possible verification above.
3776 double sample_start_time_sec = os::elapsedTime();
3777
3778 #if YOUNG_LIST_VERBOSE
3779 gclog_or_tty->print_cr("\nBefore recording pause start.\nYoung_list:");
3780 _young_list->print();
3781 g1_policy()->print_collection_set(g1_policy()->inc_cset_head(), gclog_or_tty);
3782 #endif // YOUNG_LIST_VERBOSE
3783
3784 g1_policy()->record_collection_pause_start(sample_start_time_sec);
3785
3786 double scan_wait_start = os::elapsedTime();
3787 // We have to wait until the CM threads finish scanning the
3788 // root regions as it's the only way to ensure that all the
3789 // objects on them have been correctly scanned before we start
3790 // moving them during the GC.
3791 bool waited = _cm->root_regions()->wait_until_scan_finished();
3792 double wait_time_ms = 0.0;
3793 if (waited) {
3794 double scan_wait_end = os::elapsedTime();
3795 wait_time_ms = (scan_wait_end - scan_wait_start) * 1000.0;
3796 }
3797 g1_policy()->phase_times()->record_root_region_scan_wait_time(wait_time_ms);
3798
3799 #if YOUNG_LIST_VERBOSE
3800 gclog_or_tty->print_cr("\nAfter recording pause start.\nYoung_list:");
3801 _young_list->print();
3802 #endif // YOUNG_LIST_VERBOSE
3803
3804 if (g1_policy()->during_initial_mark_pause()) {
3805 concurrent_mark()->checkpointRootsInitialPre();
3806 }
3807
3808 #if YOUNG_LIST_VERBOSE
3809 gclog_or_tty->print_cr("\nBefore choosing collection set.\nYoung_list:");
3810 _young_list->print();
3811 g1_policy()->print_collection_set(g1_policy()->inc_cset_head(), gclog_or_tty);
3812 #endif // YOUNG_LIST_VERBOSE
3813
3814 g1_policy()->finalize_cset(target_pause_time_ms, evacuation_info);
3815
3816 register_humongous_regions_with_cset();
3817
3818 assert(check_cset_fast_test(), "Inconsistency in the InCSetState table.");
3819
3820 _cm->note_start_of_gc();
3821 // We should not verify the per-thread SATB buffers given that
3822 // we have not filtered them yet (we'll do so during the
3823 // GC). We also call this after finalize_cset() to
3824 // ensure that the CSet has been finalized.
3825 _cm->verify_no_cset_oops(true /* verify_stacks */,
3826 true /* verify_enqueued_buffers */,
3827 false /* verify_thread_buffers */,
3828 true /* verify_fingers */);
3829
3830 if (_hr_printer.is_active()) {
3831 HeapRegion* hr = g1_policy()->collection_set();
3832 while (hr != NULL) {
3833 _hr_printer.cset(hr);
3834 hr = hr->next_in_collection_set();
3835 }
3836 }
3837
3838 #ifdef ASSERT
3839 VerifyCSetClosure cl;
3840 collection_set_iterate(&cl);
3841 #endif // ASSERT
3842
3843 setup_surviving_young_words();
3844
3845 // Initialize the GC alloc regions.
3846 _allocator->init_gc_alloc_regions(evacuation_info);
3847
3848 // Actually do the work...
3849 evacuate_collection_set(evacuation_info);
3850
3851 // We do this to mainly verify the per-thread SATB buffers
3852 // (which have been filtered by now) since we didn't verify
3853 // them earlier. No point in re-checking the stacks / enqueued
3854 // buffers given that the CSet has not changed since last time
3855 // we checked.
3856 _cm->verify_no_cset_oops(false /* verify_stacks */,
3857 false /* verify_enqueued_buffers */,
3858 true /* verify_thread_buffers */,
3859 true /* verify_fingers */);
3860
3861 free_collection_set(g1_policy()->collection_set(), evacuation_info);
3862
3863 eagerly_reclaim_humongous_regions();
3864
3865 g1_policy()->clear_collection_set();
3866
3867 cleanup_surviving_young_words();
3868
3869 // Start a new incremental collection set for the next pause.
3870 g1_policy()->start_incremental_cset_building();
3871
3872 clear_cset_fast_test();
3873
3874 _young_list->reset_sampled_info();
3875
3876 // Don't check the whole heap at this point as the
3877 // GC alloc regions from this pause have been tagged
3878 // as survivors and moved on to the survivor list.
3879 // Survivor regions will fail the !is_young() check.
3880 assert(check_young_list_empty(false /* check_heap */),
3881 "young list should be empty");
3882
3883 #if YOUNG_LIST_VERBOSE
3884 gclog_or_tty->print_cr("Before recording survivors.\nYoung List:");
3885 _young_list->print();
3886 #endif // YOUNG_LIST_VERBOSE
3887
3888 g1_policy()->record_survivor_regions(_young_list->survivor_length(),
3889 _young_list->first_survivor_region(),
3890 _young_list->last_survivor_region());
3891
3892 _young_list->reset_auxilary_lists();
3893
3894 if (evacuation_failed()) {
3895 _allocator->set_used(recalculate_used());
3896 uint n_queues = MAX2((int)ParallelGCThreads, 1);
3897 for (uint i = 0; i < n_queues; i++) {
3898 if (_evacuation_failed_info_array[i].has_failed()) {
3899 _gc_tracer_stw->report_evacuation_failed(_evacuation_failed_info_array[i]);
3900 }
3901 }
3902 } else {
3903 // The "used" of the the collection set have already been subtracted
3904 // when they were freed. Add in the bytes evacuated.
3905 _allocator->increase_used(g1_policy()->bytes_copied_during_gc());
3906 }
3907
3908 if (g1_policy()->during_initial_mark_pause()) {
3909 // We have to do this before we notify the CM threads that
3910 // they can start working to make sure that all the
3911 // appropriate initialization is done on the CM object.
3912 concurrent_mark()->checkpointRootsInitialPost();
3913 set_marking_started();
3914 // Note that we don't actually trigger the CM thread at
3915 // this point. We do that later when we're sure that
3916 // the current thread has completed its logging output.
3917 }
3918
3919 allocate_dummy_regions();
3920
3921 #if YOUNG_LIST_VERBOSE
3922 gclog_or_tty->print_cr("\nEnd of the pause.\nYoung_list:");
3923 _young_list->print();
3924 g1_policy()->print_collection_set(g1_policy()->inc_cset_head(), gclog_or_tty);
3925 #endif // YOUNG_LIST_VERBOSE
3926
3927 _allocator->init_mutator_alloc_region();
3928
3929 {
3930 size_t expand_bytes = g1_policy()->expansion_amount();
3931 if (expand_bytes > 0) {
3932 size_t bytes_before = capacity();
3933 // No need for an ergo verbose message here,
3934 // expansion_amount() does this when it returns a value > 0.
3935 if (!expand(expand_bytes)) {
3936 // We failed to expand the heap. Cannot do anything about it.
3937 }
3938 }
3939 }
3940
3941 // We redo the verification but now wrt to the new CSet which
3942 // has just got initialized after the previous CSet was freed.
3943 _cm->verify_no_cset_oops(true /* verify_stacks */,
3944 true /* verify_enqueued_buffers */,
3945 true /* verify_thread_buffers */,
3946 true /* verify_fingers */);
3947 _cm->note_end_of_gc();
3948
3949 // This timing is only used by the ergonomics to handle our pause target.
3950 // It is unclear why this should not include the full pause. We will
3951 // investigate this in CR 7178365.
3952 double sample_end_time_sec = os::elapsedTime();
3953 double pause_time_ms = (sample_end_time_sec - sample_start_time_sec) * MILLIUNITS;
3954 g1_policy()->record_collection_pause_end(pause_time_ms, evacuation_info);
3955
3956 MemoryService::track_memory_usage();
3957
3958 // In prepare_for_verify() below we'll need to scan the deferred
3959 // update buffers to bring the RSets up-to-date if
3960 // G1HRRSFlushLogBuffersOnVerify has been set. While scanning
3961 // the update buffers we'll probably need to scan cards on the
3962 // regions we just allocated to (i.e., the GC alloc
3963 // regions). However, during the last GC we called
3964 // set_saved_mark() on all the GC alloc regions, so card
3965 // scanning might skip the [saved_mark_word()...top()] area of
3966 // those regions (i.e., the area we allocated objects into
3967 // during the last GC). But it shouldn't. Given that
3968 // saved_mark_word() is conditional on whether the GC time stamp
3969 // on the region is current or not, by incrementing the GC time
3970 // stamp here we invalidate all the GC time stamps on all the
3971 // regions and saved_mark_word() will simply return top() for
3972 // all the regions. This is a nicer way of ensuring this rather
3973 // than iterating over the regions and fixing them. In fact, the
3974 // GC time stamp increment here also ensures that
3975 // saved_mark_word() will return top() between pauses, i.e.,
3976 // during concurrent refinement. So we don't need the
3977 // is_gc_active() check to decided which top to use when
3978 // scanning cards (see CR 7039627).
3979 increment_gc_time_stamp();
3980
3981 verify_after_gc();
3982 check_bitmaps("GC End");
3983
3984 assert(!ref_processor_stw()->discovery_enabled(), "Postcondition");
3985 ref_processor_stw()->verify_no_references_recorded();
3986
3987 // CM reference discovery will be re-enabled if necessary.
3988 }
3989
3990 // We should do this after we potentially expand the heap so
3991 // that all the COMMIT events are generated before the end GC
3992 // event, and after we retire the GC alloc regions so that all
3993 // RETIRE events are generated before the end GC event.
3994 _hr_printer.end_gc(false /* full */, (size_t) total_collections());
3995
3996 #ifdef TRACESPINNING
3997 ParallelTaskTerminator::print_termination_counts();
3998 #endif
3999
4000 gc_epilogue(false);
4001 }
4002
4003 // Print the remainder of the GC log output.
4004 log_gc_footer(os::elapsedTime() - pause_start_sec);
4005
4006 // It is not yet to safe to tell the concurrent mark to
4007 // start as we have some optional output below. We don't want the
4008 // output from the concurrent mark thread interfering with this
4009 // logging output either.
4010
4011 _hrm.verify_optional();
4012 verify_region_sets_optional();
4013
4014 TASKQUEUE_STATS_ONLY(if (PrintTaskqueue) print_taskqueue_stats());
4015 TASKQUEUE_STATS_ONLY(reset_taskqueue_stats());
4016
4017 print_heap_after_gc();
4018 trace_heap_after_gc(_gc_tracer_stw);
4019
4020 // We must call G1MonitoringSupport::update_sizes() in the same scoping level
4021 // as an active TraceMemoryManagerStats object (i.e. before the destructor for the
4022 // TraceMemoryManagerStats is called) so that the G1 memory pools are updated
4023 // before any GC notifications are raised.
4024 g1mm()->update_sizes();
4025
4026 _gc_tracer_stw->report_evacuation_info(&evacuation_info);
4027 _gc_tracer_stw->report_tenuring_threshold(_g1_policy->tenuring_threshold());
4028 _gc_timer_stw->register_gc_end();
4029 _gc_tracer_stw->report_gc_end(_gc_timer_stw->gc_end(), _gc_timer_stw->time_partitions());
4030 }
4031 // It should now be safe to tell the concurrent mark thread to start
4032 // without its logging output interfering with the logging output
4033 // that came from the pause.
4034
4035 if (should_start_conc_mark) {
4036 // CAUTION: after the doConcurrentMark() call below,
4037 // the concurrent marking thread(s) could be running
4038 // concurrently with us. Make sure that anything after
4039 // this point does not assume that we are the only GC thread
4040 // running. Note: of course, the actual marking work will
4041 // not start until the safepoint itself is released in
4042 // SuspendibleThreadSet::desynchronize().
4043 doConcurrentMark();
4044 }
4045
4046 return true;
4047 }
4048
4049 void G1CollectedHeap::init_for_evac_failure(OopsInHeapRegionClosure* cl) {
4050 _drain_in_progress = false;
4051 set_evac_failure_closure(cl);
4052 _evac_failure_scan_stack = new (ResourceObj::C_HEAP, mtGC) GrowableArray<oop>(40, true);
4053 }
4054
4055 void G1CollectedHeap::finalize_for_evac_failure() {
4056 assert(_evac_failure_scan_stack != NULL &&
4057 _evac_failure_scan_stack->length() == 0,
4058 "Postcondition");
4059 assert(!_drain_in_progress, "Postcondition");
4060 delete _evac_failure_scan_stack;
4061 _evac_failure_scan_stack = NULL;
4062 }
4063
4064 void G1CollectedHeap::remove_self_forwarding_pointers() {
4065 double remove_self_forwards_start = os::elapsedTime();
4066
4067 set_par_threads();
4068 G1ParRemoveSelfForwardPtrsTask rsfp_task(this);
4069 workers()->run_task(&rsfp_task);
4070 set_par_threads(0);
4071
4072 // Now restore saved marks, if any.
4073 assert(_objs_with_preserved_marks.size() ==
4074 _preserved_marks_of_objs.size(), "Both or none.");
4075 while (!_objs_with_preserved_marks.is_empty()) {
4076 oop obj = _objs_with_preserved_marks.pop();
4077 markOop m = _preserved_marks_of_objs.pop();
4078 obj->set_mark(m);
4079 }
4080 _objs_with_preserved_marks.clear(true);
4081 _preserved_marks_of_objs.clear(true);
4082
4083 g1_policy()->phase_times()->record_evac_fail_remove_self_forwards((os::elapsedTime() - remove_self_forwards_start) * 1000.0);
4084 }
4085
4086 void G1CollectedHeap::push_on_evac_failure_scan_stack(oop obj) {
4087 _evac_failure_scan_stack->push(obj);
4088 }
4089
4090 void G1CollectedHeap::drain_evac_failure_scan_stack() {
4091 assert(_evac_failure_scan_stack != NULL, "precondition");
4092
4093 while (_evac_failure_scan_stack->length() > 0) {
4094 oop obj = _evac_failure_scan_stack->pop();
4095 _evac_failure_closure->set_region(heap_region_containing(obj));
4096 obj->oop_iterate_backwards(_evac_failure_closure);
4097 }
4098 }
4099
4100 oop
4101 G1CollectedHeap::handle_evacuation_failure_par(G1ParScanThreadState* _par_scan_state,
4102 oop old) {
4103 assert(obj_in_cs(old),
4104 err_msg("obj: "PTR_FORMAT" should still be in the CSet",
4105 (HeapWord*) old));
4106 markOop m = old->mark();
4107 oop forward_ptr = old->forward_to_atomic(old);
4108 if (forward_ptr == NULL) {
4109 // Forward-to-self succeeded.
4110 assert(_par_scan_state != NULL, "par scan state");
4111 OopsInHeapRegionClosure* cl = _par_scan_state->evac_failure_closure();
4112 uint queue_num = _par_scan_state->queue_num();
4113
4114 _evacuation_failed = true;
4115 _evacuation_failed_info_array[queue_num].register_copy_failure(old->size());
4116 if (_evac_failure_closure != cl) {
4117 MutexLockerEx x(EvacFailureStack_lock, Mutex::_no_safepoint_check_flag);
4118 assert(!_drain_in_progress,
4119 "Should only be true while someone holds the lock.");
4120 // Set the global evac-failure closure to the current thread's.
4121 assert(_evac_failure_closure == NULL, "Or locking has failed.");
4122 set_evac_failure_closure(cl);
4123 // Now do the common part.
4124 handle_evacuation_failure_common(old, m);
4125 // Reset to NULL.
4126 set_evac_failure_closure(NULL);
4127 } else {
4128 // The lock is already held, and this is recursive.
4129 assert(_drain_in_progress, "This should only be the recursive case.");
4130 handle_evacuation_failure_common(old, m);
4131 }
4132 return old;
4133 } else {
4134 // Forward-to-self failed. Either someone else managed to allocate
4135 // space for this object (old != forward_ptr) or they beat us in
4136 // self-forwarding it (old == forward_ptr).
4137 assert(old == forward_ptr || !obj_in_cs(forward_ptr),
4138 err_msg("obj: "PTR_FORMAT" forwarded to: "PTR_FORMAT" "
4139 "should not be in the CSet",
4140 (HeapWord*) old, (HeapWord*) forward_ptr));
4141 return forward_ptr;
4142 }
4143 }
4144
4145 void G1CollectedHeap::handle_evacuation_failure_common(oop old, markOop m) {
4146 preserve_mark_if_necessary(old, m);
4147
4148 HeapRegion* r = heap_region_containing(old);
4149 if (!r->evacuation_failed()) {
4150 r->set_evacuation_failed(true);
4151 _hr_printer.evac_failure(r);
4152 }
4153
4154 push_on_evac_failure_scan_stack(old);
4155
4156 if (!_drain_in_progress) {
4157 // prevent recursion in copy_to_survivor_space()
4158 _drain_in_progress = true;
4159 drain_evac_failure_scan_stack();
4160 _drain_in_progress = false;
4161 }
4162 }
4163
4164 void G1CollectedHeap::preserve_mark_if_necessary(oop obj, markOop m) {
4165 assert(evacuation_failed(), "Oversaving!");
4166 // We want to call the "for_promotion_failure" version only in the
4167 // case of a promotion failure.
4168 if (m->must_be_preserved_for_promotion_failure(obj)) {
4169 _objs_with_preserved_marks.push(obj);
4170 _preserved_marks_of_objs.push(m);
4171 }
4172 }
4173
4174 void G1ParCopyHelper::mark_object(oop obj) {
4175 assert(!_g1->heap_region_containing(obj)->in_collection_set(), "should not mark objects in the CSet");
4176
4177 // We know that the object is not moving so it's safe to read its size.
4178 _cm->grayRoot(obj, (size_t) obj->size(), _worker_id);
4179 }
4180
4181 void G1ParCopyHelper::mark_forwarded_object(oop from_obj, oop to_obj) {
4182 assert(from_obj->is_forwarded(), "from obj should be forwarded");
4183 assert(from_obj->forwardee() == to_obj, "to obj should be the forwardee");
4184 assert(from_obj != to_obj, "should not be self-forwarded");
4185
4186 assert(_g1->heap_region_containing(from_obj)->in_collection_set(), "from obj should be in the CSet");
4187 assert(!_g1->heap_region_containing(to_obj)->in_collection_set(), "should not mark objects in the CSet");
4188
4189 // The object might be in the process of being copied by another
4190 // worker so we cannot trust that its to-space image is
4191 // well-formed. So we have to read its size from its from-space
4192 // image which we know should not be changing.
4193 _cm->grayRoot(to_obj, (size_t) from_obj->size(), _worker_id);
4194 }
4195
4196 template <class T>
4197 void G1ParCopyHelper::do_klass_barrier(T* p, oop new_obj) {
4198 if (_g1->heap_region_containing_raw(new_obj)->is_young()) {
4199 _scanned_klass->record_modified_oops();
4200 }
4201 }
4202
4203 template <G1Barrier barrier, G1Mark do_mark_object>
4204 template <class T>
4205 void G1ParCopyClosure<barrier, do_mark_object>::do_oop_work(T* p) {
4206 T heap_oop = oopDesc::load_heap_oop(p);
4207
4208 if (oopDesc::is_null(heap_oop)) {
4209 return;
4210 }
4211
4212 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
4213
4214 assert(_worker_id == _par_scan_state->queue_num(), "sanity");
4215
4216 const InCSetState state = _g1->in_cset_state(obj);
4217 if (state.is_in_cset()) {
4218 oop forwardee;
4219 markOop m = obj->mark();
4220 if (m->is_marked()) {
4221 forwardee = (oop) m->decode_pointer();
4222 } else {
4223 forwardee = _par_scan_state->copy_to_survivor_space(state, obj, m);
4224 }
4225 assert(forwardee != NULL, "forwardee should not be NULL");
4226 oopDesc::encode_store_heap_oop(p, forwardee);
4227 if (do_mark_object != G1MarkNone && forwardee != obj) {
4228 // If the object is self-forwarded we don't need to explicitly
4229 // mark it, the evacuation failure protocol will do so.
4230 mark_forwarded_object(obj, forwardee);
4231 }
4232
4233 if (barrier == G1BarrierKlass) {
4234 do_klass_barrier(p, forwardee);
4235 }
4236 } else {
4237 if (state.is_humongous()) {
4238 _g1->set_humongous_is_live(obj);
4239 }
4240 // The object is not in collection set. If we're a root scanning
4241 // closure during an initial mark pause then attempt to mark the object.
4242 if (do_mark_object == G1MarkFromRoot) {
4243 mark_object(obj);
4244 }
4245 }
4246
4247 if (barrier == G1BarrierEvac) {
4248 _par_scan_state->update_rs(_from, p, _worker_id);
4249 }
4250 }
4251
4252 template void G1ParCopyClosure<G1BarrierEvac, G1MarkNone>::do_oop_work(oop* p);
4253 template void G1ParCopyClosure<G1BarrierEvac, G1MarkNone>::do_oop_work(narrowOop* p);
4254
4255 class G1ParEvacuateFollowersClosure : public VoidClosure {
4256 protected:
4257 G1CollectedHeap* _g1h;
4258 G1ParScanThreadState* _par_scan_state;
4259 RefToScanQueueSet* _queues;
4260 ParallelTaskTerminator* _terminator;
4261
4262 G1ParScanThreadState* par_scan_state() { return _par_scan_state; }
4263 RefToScanQueueSet* queues() { return _queues; }
4264 ParallelTaskTerminator* terminator() { return _terminator; }
4265
4266 public:
4267 G1ParEvacuateFollowersClosure(G1CollectedHeap* g1h,
4268 G1ParScanThreadState* par_scan_state,
4269 RefToScanQueueSet* queues,
4270 ParallelTaskTerminator* terminator)
4271 : _g1h(g1h), _par_scan_state(par_scan_state),
4272 _queues(queues), _terminator(terminator) {}
4273
4274 void do_void();
4275
4276 private:
4277 inline bool offer_termination();
4278 };
4279
4280 bool G1ParEvacuateFollowersClosure::offer_termination() {
4281 G1ParScanThreadState* const pss = par_scan_state();
4282 pss->start_term_time();
4283 const bool res = terminator()->offer_termination();
4284 pss->end_term_time();
4285 return res;
4286 }
4287
4288 void G1ParEvacuateFollowersClosure::do_void() {
4289 G1ParScanThreadState* const pss = par_scan_state();
4290 pss->trim_queue();
4291 do {
4292 pss->steal_and_trim_queue(queues());
4293 } while (!offer_termination());
4294 }
4295
4296 class G1KlassScanClosure : public KlassClosure {
4297 G1ParCopyHelper* _closure;
4298 bool _process_only_dirty;
4299 int _count;
4300 public:
4301 G1KlassScanClosure(G1ParCopyHelper* closure, bool process_only_dirty)
4302 : _process_only_dirty(process_only_dirty), _closure(closure), _count(0) {}
4303 void do_klass(Klass* klass) {
4304 // If the klass has not been dirtied we know that there's
4305 // no references into the young gen and we can skip it.
4306 if (!_process_only_dirty || klass->has_modified_oops()) {
4307 // Clean the klass since we're going to scavenge all the metadata.
4308 klass->clear_modified_oops();
4309
4310 // Tell the closure that this klass is the Klass to scavenge
4311 // and is the one to dirty if oops are left pointing into the young gen.
4312 _closure->set_scanned_klass(klass);
4313
4314 klass->oops_do(_closure);
4315
4316 _closure->set_scanned_klass(NULL);
4317 }
4318 _count++;
4319 }
4320 };
4321
4322 class G1ParTask : public AbstractGangTask {
4323 protected:
4324 G1CollectedHeap* _g1h;
4325 RefToScanQueueSet *_queues;
4326 G1RootProcessor* _root_processor;
4327 ParallelTaskTerminator _terminator;
4328 uint _n_workers;
4329
4330 Mutex _stats_lock;
4331 Mutex* stats_lock() { return &_stats_lock; }
4332
4333 public:
4334 G1ParTask(G1CollectedHeap* g1h, RefToScanQueueSet *task_queues, G1RootProcessor* root_processor)
4335 : AbstractGangTask("G1 collection"),
4336 _g1h(g1h),
4337 _queues(task_queues),
4338 _root_processor(root_processor),
4339 _terminator(0, _queues),
4340 _stats_lock(Mutex::leaf, "parallel G1 stats lock", true)
4341 {}
4342
4343 RefToScanQueueSet* queues() { return _queues; }
4344
4345 RefToScanQueue *work_queue(int i) {
4346 return queues()->queue(i);
4347 }
4348
4349 ParallelTaskTerminator* terminator() { return &_terminator; }
4350
4351 virtual void set_for_termination(int active_workers) {
4352 _root_processor->set_num_workers(active_workers);
4353 terminator()->reset_for_reuse(active_workers);
4354 _n_workers = active_workers;
4355 }
4356
4357 // Helps out with CLD processing.
4358 //
4359 // During InitialMark we need to:
4360 // 1) Scavenge all CLDs for the young GC.
4361 // 2) Mark all objects directly reachable from strong CLDs.
4362 template <G1Mark do_mark_object>
4363 class G1CLDClosure : public CLDClosure {
4364 G1ParCopyClosure<G1BarrierNone, do_mark_object>* _oop_closure;
4365 G1ParCopyClosure<G1BarrierKlass, do_mark_object> _oop_in_klass_closure;
4366 G1KlassScanClosure _klass_in_cld_closure;
4367 bool _claim;
4368
4369 public:
4370 G1CLDClosure(G1ParCopyClosure<G1BarrierNone, do_mark_object>* oop_closure,
4371 bool only_young, bool claim)
4372 : _oop_closure(oop_closure),
4373 _oop_in_klass_closure(oop_closure->g1(),
4374 oop_closure->pss(),
4375 oop_closure->rp()),
4376 _klass_in_cld_closure(&_oop_in_klass_closure, only_young),
4377 _claim(claim) {
4378
4379 }
4380
4381 void do_cld(ClassLoaderData* cld) {
4382 cld->oops_do(_oop_closure, &_klass_in_cld_closure, _claim);
4383 }
4384 };
4385
4386 void work(uint worker_id) {
4387 if (worker_id >= _n_workers) return; // no work needed this round
4388
4389 _g1h->g1_policy()->phase_times()->record_time_secs(G1GCPhaseTimes::GCWorkerStart, worker_id, os::elapsedTime());
4390
4391 {
4392 ResourceMark rm;
4393 HandleMark hm;
4394
4395 ReferenceProcessor* rp = _g1h->ref_processor_stw();
4396
4397 G1ParScanThreadState pss(_g1h, worker_id, rp);
4398 G1ParScanHeapEvacFailureClosure evac_failure_cl(_g1h, &pss, rp);
4399
4400 pss.set_evac_failure_closure(&evac_failure_cl);
4401
4402 bool only_young = _g1h->g1_policy()->gcs_are_young();
4403
4404 // Non-IM young GC.
4405 G1ParCopyClosure<G1BarrierNone, G1MarkNone> scan_only_root_cl(_g1h, &pss, rp);
4406 G1CLDClosure<G1MarkNone> scan_only_cld_cl(&scan_only_root_cl,
4407 only_young, // Only process dirty klasses.
4408 false); // No need to claim CLDs.
4409 // IM young GC.
4410 // Strong roots closures.
4411 G1ParCopyClosure<G1BarrierNone, G1MarkFromRoot> scan_mark_root_cl(_g1h, &pss, rp);
4412 G1CLDClosure<G1MarkFromRoot> scan_mark_cld_cl(&scan_mark_root_cl,
4413 false, // Process all klasses.
4414 true); // Need to claim CLDs.
4415 // Weak roots closures.
4416 G1ParCopyClosure<G1BarrierNone, G1MarkPromotedFromRoot> scan_mark_weak_root_cl(_g1h, &pss, rp);
4417 G1CLDClosure<G1MarkPromotedFromRoot> scan_mark_weak_cld_cl(&scan_mark_weak_root_cl,
4418 false, // Process all klasses.
4419 true); // Need to claim CLDs.
4420
4421 OopClosure* strong_root_cl;
4422 OopClosure* weak_root_cl;
4423 CLDClosure* strong_cld_cl;
4424 CLDClosure* weak_cld_cl;
4425
4426 bool trace_metadata = false;
4427
4428 if (_g1h->g1_policy()->during_initial_mark_pause()) {
4429 // We also need to mark copied objects.
4430 strong_root_cl = &scan_mark_root_cl;
4431 strong_cld_cl = &scan_mark_cld_cl;
4432 if (ClassUnloadingWithConcurrentMark) {
4433 weak_root_cl = &scan_mark_weak_root_cl;
4434 weak_cld_cl = &scan_mark_weak_cld_cl;
4435 trace_metadata = true;
4436 } else {
4437 weak_root_cl = &scan_mark_root_cl;
4438 weak_cld_cl = &scan_mark_cld_cl;
4439 }
4440 } else {
4441 strong_root_cl = &scan_only_root_cl;
4442 weak_root_cl = &scan_only_root_cl;
4443 strong_cld_cl = &scan_only_cld_cl;
4444 weak_cld_cl = &scan_only_cld_cl;
4445 }
4446
4447 pss.start_strong_roots();
4448
4449 _root_processor->evacuate_roots(strong_root_cl,
4450 weak_root_cl,
4451 strong_cld_cl,
4452 weak_cld_cl,
4453 trace_metadata,
4454 worker_id);
4455
4456 G1ParPushHeapRSClosure push_heap_rs_cl(_g1h, &pss);
4457 _root_processor->scan_remembered_sets(&push_heap_rs_cl,
4458 weak_root_cl,
4459 worker_id);
4460 pss.end_strong_roots();
4461
4462 {
4463 double start = os::elapsedTime();
4464 G1ParEvacuateFollowersClosure evac(_g1h, &pss, _queues, &_terminator);
4465 evac.do_void();
4466 double elapsed_sec = os::elapsedTime() - start;
4467 double term_sec = pss.term_time();
4468 _g1h->g1_policy()->phase_times()->add_time_secs(G1GCPhaseTimes::ObjCopy, worker_id, elapsed_sec - term_sec);
4469 _g1h->g1_policy()->phase_times()->record_time_secs(G1GCPhaseTimes::Termination, worker_id, term_sec);
4470 _g1h->g1_policy()->phase_times()->record_thread_work_item(G1GCPhaseTimes::Termination, worker_id, pss.term_attempts());
4471 }
4472 _g1h->g1_policy()->record_thread_age_table(pss.age_table());
4473 _g1h->update_surviving_young_words(pss.surviving_young_words()+1);
4474
4475 if (PrintTerminationStats) {
4476 MutexLocker x(stats_lock());
4477 pss.print_termination_stats(worker_id);
4478 }
4479
4480 assert(pss.queue_is_empty(), "should be empty");
4481
4482 // Close the inner scope so that the ResourceMark and HandleMark
4483 // destructors are executed here and are included as part of the
4484 // "GC Worker Time".
4485 }
4486 _g1h->g1_policy()->phase_times()->record_time_secs(G1GCPhaseTimes::GCWorkerEnd, worker_id, os::elapsedTime());
4487 }
4488 };
4489
4490 class G1StringSymbolTableUnlinkTask : public AbstractGangTask {
4491 private:
4492 BoolObjectClosure* _is_alive;
4493 int _initial_string_table_size;
4494 int _initial_symbol_table_size;
4495
4496 bool _process_strings;
4497 int _strings_processed;
4498 int _strings_removed;
4499
4500 bool _process_symbols;
4501 int _symbols_processed;
4502 int _symbols_removed;
4503
4504 public:
4505 G1StringSymbolTableUnlinkTask(BoolObjectClosure* is_alive, bool process_strings, bool process_symbols) :
4506 AbstractGangTask("String/Symbol Unlinking"),
4507 _is_alive(is_alive),
4508 _process_strings(process_strings), _strings_processed(0), _strings_removed(0),
4509 _process_symbols(process_symbols), _symbols_processed(0), _symbols_removed(0) {
4510
4511 _initial_string_table_size = StringTable::the_table()->table_size();
4512 _initial_symbol_table_size = SymbolTable::the_table()->table_size();
4513 if (process_strings) {
4514 StringTable::clear_parallel_claimed_index();
4515 }
4516 if (process_symbols) {
4517 SymbolTable::clear_parallel_claimed_index();
4518 }
4519 }
4520
4521 ~G1StringSymbolTableUnlinkTask() {
4522 guarantee(!_process_strings || StringTable::parallel_claimed_index() >= _initial_string_table_size,
4523 err_msg("claim value %d after unlink less than initial string table size %d",
4524 StringTable::parallel_claimed_index(), _initial_string_table_size));
4525 guarantee(!_process_symbols || SymbolTable::parallel_claimed_index() >= _initial_symbol_table_size,
4526 err_msg("claim value %d after unlink less than initial symbol table size %d",
4527 SymbolTable::parallel_claimed_index(), _initial_symbol_table_size));
4528
4529 if (G1TraceStringSymbolTableScrubbing) {
4530 gclog_or_tty->print_cr("Cleaned string and symbol table, "
4531 "strings: "SIZE_FORMAT" processed, "SIZE_FORMAT" removed, "
4532 "symbols: "SIZE_FORMAT" processed, "SIZE_FORMAT" removed",
4533 strings_processed(), strings_removed(),
4534 symbols_processed(), symbols_removed());
4535 }
4536 }
4537
4538 void work(uint worker_id) {
4539 int strings_processed = 0;
4540 int strings_removed = 0;
4541 int symbols_processed = 0;
4542 int symbols_removed = 0;
4543 if (_process_strings) {
4544 StringTable::possibly_parallel_unlink(_is_alive, &strings_processed, &strings_removed);
4545 Atomic::add(strings_processed, &_strings_processed);
4546 Atomic::add(strings_removed, &_strings_removed);
4547 }
4548 if (_process_symbols) {
4549 SymbolTable::possibly_parallel_unlink(&symbols_processed, &symbols_removed);
4550 Atomic::add(symbols_processed, &_symbols_processed);
4551 Atomic::add(symbols_removed, &_symbols_removed);
4552 }
4553 }
4554
4555 size_t strings_processed() const { return (size_t)_strings_processed; }
4556 size_t strings_removed() const { return (size_t)_strings_removed; }
4557
4558 size_t symbols_processed() const { return (size_t)_symbols_processed; }
4559 size_t symbols_removed() const { return (size_t)_symbols_removed; }
4560 };
4561
4562 class G1CodeCacheUnloadingTask VALUE_OBJ_CLASS_SPEC {
4563 private:
4564 static Monitor* _lock;
4565
4566 BoolObjectClosure* const _is_alive;
4567 const bool _unloading_occurred;
4568 const uint _num_workers;
4569
4570 // Variables used to claim nmethods.
4571 nmethod* _first_nmethod;
4572 volatile nmethod* _claimed_nmethod;
4573
4574 // The list of nmethods that need to be processed by the second pass.
4575 volatile nmethod* _postponed_list;
4576 volatile uint _num_entered_barrier;
4577
4578 public:
4579 G1CodeCacheUnloadingTask(uint num_workers, BoolObjectClosure* is_alive, bool unloading_occurred) :
4580 _is_alive(is_alive),
4581 _unloading_occurred(unloading_occurred),
4582 _num_workers(num_workers),
4583 _first_nmethod(NULL),
4584 _claimed_nmethod(NULL),
4585 _postponed_list(NULL),
4586 _num_entered_barrier(0)
4587 {
4588 nmethod::increase_unloading_clock();
4589 // Get first alive nmethod
4590 NMethodIterator iter = NMethodIterator();
4591 if(iter.next_alive()) {
4592 _first_nmethod = iter.method();
4593 }
4594 _claimed_nmethod = (volatile nmethod*)_first_nmethod;
4595 }
4596
4597 ~G1CodeCacheUnloadingTask() {
4598 CodeCache::verify_clean_inline_caches();
4599
4600 CodeCache::set_needs_cache_clean(false);
4601 guarantee(CodeCache::scavenge_root_nmethods() == NULL, "Must be");
4602
4603 CodeCache::verify_icholder_relocations();
4604 }
4605
4606 private:
4607 void add_to_postponed_list(nmethod* nm) {
4608 nmethod* old;
4609 do {
4610 old = (nmethod*)_postponed_list;
4611 nm->set_unloading_next(old);
4612 } while ((nmethod*)Atomic::cmpxchg_ptr(nm, &_postponed_list, old) != old);
4613 }
4614
4615 void clean_nmethod(nmethod* nm) {
4616 bool postponed = nm->do_unloading_parallel(_is_alive, _unloading_occurred);
4617
4618 if (postponed) {
4619 // This nmethod referred to an nmethod that has not been cleaned/unloaded yet.
4620 add_to_postponed_list(nm);
4621 }
4622
4623 // Mark that this thread has been cleaned/unloaded.
4624 // After this call, it will be safe to ask if this nmethod was unloaded or not.
4625 nm->set_unloading_clock(nmethod::global_unloading_clock());
4626 }
4627
4628 void clean_nmethod_postponed(nmethod* nm) {
4629 nm->do_unloading_parallel_postponed(_is_alive, _unloading_occurred);
4630 }
4631
4632 static const int MaxClaimNmethods = 16;
4633
4634 void claim_nmethods(nmethod** claimed_nmethods, int *num_claimed_nmethods) {
4635 nmethod* first;
4636 NMethodIterator last;
4637
4638 do {
4639 *num_claimed_nmethods = 0;
4640
4641 first = (nmethod*)_claimed_nmethod;
4642 last = NMethodIterator(first);
4643
4644 if (first != NULL) {
4645
4646 for (int i = 0; i < MaxClaimNmethods; i++) {
4647 if (!last.next_alive()) {
4648 break;
4649 }
4650 claimed_nmethods[i] = last.method();
4651 (*num_claimed_nmethods)++;
4652 }
4653 }
4654
4655 } while ((nmethod*)Atomic::cmpxchg_ptr(last.method(), &_claimed_nmethod, first) != first);
4656 }
4657
4658 nmethod* claim_postponed_nmethod() {
4659 nmethod* claim;
4660 nmethod* next;
4661
4662 do {
4663 claim = (nmethod*)_postponed_list;
4664 if (claim == NULL) {
4665 return NULL;
4666 }
4667
4668 next = claim->unloading_next();
4669
4670 } while ((nmethod*)Atomic::cmpxchg_ptr(next, &_postponed_list, claim) != claim);
4671
4672 return claim;
4673 }
4674
4675 public:
4676 // Mark that we're done with the first pass of nmethod cleaning.
4677 void barrier_mark(uint worker_id) {
4678 MonitorLockerEx ml(_lock, Mutex::_no_safepoint_check_flag);
4679 _num_entered_barrier++;
4680 if (_num_entered_barrier == _num_workers) {
4681 ml.notify_all();
4682 }
4683 }
4684
4685 // See if we have to wait for the other workers to
4686 // finish their first-pass nmethod cleaning work.
4687 void barrier_wait(uint worker_id) {
4688 if (_num_entered_barrier < _num_workers) {
4689 MonitorLockerEx ml(_lock, Mutex::_no_safepoint_check_flag);
4690 while (_num_entered_barrier < _num_workers) {
4691 ml.wait(Mutex::_no_safepoint_check_flag, 0, false);
4692 }
4693 }
4694 }
4695
4696 // Cleaning and unloading of nmethods. Some work has to be postponed
4697 // to the second pass, when we know which nmethods survive.
4698 void work_first_pass(uint worker_id) {
4699 // The first nmethods is claimed by the first worker.
4700 if (worker_id == 0 && _first_nmethod != NULL) {
4701 clean_nmethod(_first_nmethod);
4702 _first_nmethod = NULL;
4703 }
4704
4705 int num_claimed_nmethods;
4706 nmethod* claimed_nmethods[MaxClaimNmethods];
4707
4708 while (true) {
4709 claim_nmethods(claimed_nmethods, &num_claimed_nmethods);
4710
4711 if (num_claimed_nmethods == 0) {
4712 break;
4713 }
4714
4715 for (int i = 0; i < num_claimed_nmethods; i++) {
4716 clean_nmethod(claimed_nmethods[i]);
4717 }
4718 }
4719 }
4720
4721 void work_second_pass(uint worker_id) {
4722 nmethod* nm;
4723 // Take care of postponed nmethods.
4724 while ((nm = claim_postponed_nmethod()) != NULL) {
4725 clean_nmethod_postponed(nm);
4726 }
4727 }
4728 };
4729
4730 Monitor* G1CodeCacheUnloadingTask::_lock = new Monitor(Mutex::leaf, "Code Cache Unload lock", false, Monitor::_safepoint_check_never);
4731
4732 class G1KlassCleaningTask : public StackObj {
4733 BoolObjectClosure* _is_alive;
4734 volatile jint _clean_klass_tree_claimed;
4735 ClassLoaderDataGraphKlassIteratorAtomic _klass_iterator;
4736
4737 public:
4738 G1KlassCleaningTask(BoolObjectClosure* is_alive) :
4739 _is_alive(is_alive),
4740 _clean_klass_tree_claimed(0),
4741 _klass_iterator() {
4742 }
4743
4744 private:
4745 bool claim_clean_klass_tree_task() {
4746 if (_clean_klass_tree_claimed) {
4747 return false;
4748 }
4749
4750 return Atomic::cmpxchg(1, (jint*)&_clean_klass_tree_claimed, 0) == 0;
4751 }
4752
4753 InstanceKlass* claim_next_klass() {
4754 Klass* klass;
4755 do {
4756 klass =_klass_iterator.next_klass();
4757 } while (klass != NULL && !klass->oop_is_instance());
4758
4759 return (InstanceKlass*)klass;
4760 }
4761
4762 public:
4763
4764 void clean_klass(InstanceKlass* ik) {
4765 ik->clean_implementors_list(_is_alive);
4766 ik->clean_method_data(_is_alive);
4767
4768 // G1 specific cleanup work that has
4769 // been moved here to be done in parallel.
4770 ik->clean_dependent_nmethods();
4771 }
4772
4773 void work() {
4774 ResourceMark rm;
4775
4776 // One worker will clean the subklass/sibling klass tree.
4777 if (claim_clean_klass_tree_task()) {
4778 Klass::clean_subklass_tree(_is_alive);
4779 }
4780
4781 // All workers will help cleaning the classes,
4782 InstanceKlass* klass;
4783 while ((klass = claim_next_klass()) != NULL) {
4784 clean_klass(klass);
4785 }
4786 }
4787 };
4788
4789 // To minimize the remark pause times, the tasks below are done in parallel.
4790 class G1ParallelCleaningTask : public AbstractGangTask {
4791 private:
4792 G1StringSymbolTableUnlinkTask _string_symbol_task;
4793 G1CodeCacheUnloadingTask _code_cache_task;
4794 G1KlassCleaningTask _klass_cleaning_task;
4795
4796 public:
4797 // The constructor is run in the VMThread.
4798 G1ParallelCleaningTask(BoolObjectClosure* is_alive, bool process_strings, bool process_symbols, uint num_workers, bool unloading_occurred) :
4799 AbstractGangTask("Parallel Cleaning"),
4800 _string_symbol_task(is_alive, process_strings, process_symbols),
4801 _code_cache_task(num_workers, is_alive, unloading_occurred),
4802 _klass_cleaning_task(is_alive) {
4803 }
4804
4805 // The parallel work done by all worker threads.
4806 void work(uint worker_id) {
4807 // Do first pass of code cache cleaning.
4808 _code_cache_task.work_first_pass(worker_id);
4809
4810 // Let the threads mark that the first pass is done.
4811 _code_cache_task.barrier_mark(worker_id);
4812
4813 // Clean the Strings and Symbols.
4814 _string_symbol_task.work(worker_id);
4815
4816 // Wait for all workers to finish the first code cache cleaning pass.
4817 _code_cache_task.barrier_wait(worker_id);
4818
4819 // Do the second code cache cleaning work, which realize on
4820 // the liveness information gathered during the first pass.
4821 _code_cache_task.work_second_pass(worker_id);
4822
4823 // Clean all klasses that were not unloaded.
4824 _klass_cleaning_task.work();
4825 }
4826 };
4827
4828
4829 void G1CollectedHeap::parallel_cleaning(BoolObjectClosure* is_alive,
4830 bool process_strings,
4831 bool process_symbols,
4832 bool class_unloading_occurred) {
4833 uint n_workers = workers()->active_workers();
4834
4835 G1ParallelCleaningTask g1_unlink_task(is_alive, process_strings, process_symbols,
4836 n_workers, class_unloading_occurred);
4837 set_par_threads(n_workers);
4838 workers()->run_task(&g1_unlink_task);
4839 set_par_threads(0);
4840 }
4841
4842 void G1CollectedHeap::unlink_string_and_symbol_table(BoolObjectClosure* is_alive,
4843 bool process_strings, bool process_symbols) {
4844 {
4845 uint n_workers = _g1h->workers()->active_workers();
4846 G1StringSymbolTableUnlinkTask g1_unlink_task(is_alive, process_strings, process_symbols);
4847 set_par_threads(n_workers);
4848 workers()->run_task(&g1_unlink_task);
4849 set_par_threads(0);
4850 }
4851
4852 if (G1StringDedup::is_enabled()) {
4853 G1StringDedup::unlink(is_alive);
4854 }
4855 }
4856
4857 class G1RedirtyLoggedCardsTask : public AbstractGangTask {
4858 private:
4859 DirtyCardQueueSet* _queue;
4860 public:
4861 G1RedirtyLoggedCardsTask(DirtyCardQueueSet* queue) : AbstractGangTask("Redirty Cards"), _queue(queue) { }
4862
4863 virtual void work(uint worker_id) {
4864 G1GCPhaseTimes* phase_times = G1CollectedHeap::heap()->g1_policy()->phase_times();
4865 G1GCParPhaseTimesTracker x(phase_times, G1GCPhaseTimes::RedirtyCards, worker_id);
4866
4867 RedirtyLoggedCardTableEntryClosure cl;
4868 _queue->par_apply_closure_to_all_completed_buffers(&cl);
4869
4870 phase_times->record_thread_work_item(G1GCPhaseTimes::RedirtyCards, worker_id, cl.num_processed());
4871 }
4872 };
4873
4874 void G1CollectedHeap::redirty_logged_cards() {
4875 double redirty_logged_cards_start = os::elapsedTime();
4876
4877 uint n_workers = _g1h->workers()->active_workers();
4878
4879 G1RedirtyLoggedCardsTask redirty_task(&dirty_card_queue_set());
4880 dirty_card_queue_set().reset_for_par_iteration();
4881 set_par_threads(n_workers);
4882 workers()->run_task(&redirty_task);
4883 set_par_threads(0);
4884
4885 DirtyCardQueueSet& dcq = JavaThread::dirty_card_queue_set();
4886 dcq.merge_bufferlists(&dirty_card_queue_set());
4887 assert(dirty_card_queue_set().completed_buffers_num() == 0, "All should be consumed");
4888
4889 g1_policy()->phase_times()->record_redirty_logged_cards_time_ms((os::elapsedTime() - redirty_logged_cards_start) * 1000.0);
4890 }
4891
4892 // Weak Reference Processing support
4893
4894 // An always "is_alive" closure that is used to preserve referents.
4895 // If the object is non-null then it's alive. Used in the preservation
4896 // of referent objects that are pointed to by reference objects
4897 // discovered by the CM ref processor.
4898 class G1AlwaysAliveClosure: public BoolObjectClosure {
4899 G1CollectedHeap* _g1;
4900 public:
4901 G1AlwaysAliveClosure(G1CollectedHeap* g1) : _g1(g1) {}
4902 bool do_object_b(oop p) {
4903 if (p != NULL) {
4904 return true;
4905 }
4906 return false;
4907 }
4908 };
4909
4910 bool G1STWIsAliveClosure::do_object_b(oop p) {
4911 // An object is reachable if it is outside the collection set,
4912 // or is inside and copied.
4913 return !_g1->obj_in_cs(p) || p->is_forwarded();
4914 }
4915
4916 // Non Copying Keep Alive closure
4917 class G1KeepAliveClosure: public OopClosure {
4918 G1CollectedHeap* _g1;
4919 public:
4920 G1KeepAliveClosure(G1CollectedHeap* g1) : _g1(g1) {}
4921 void do_oop(narrowOop* p) { guarantee(false, "Not needed"); }
4922 void do_oop(oop* p) {
4923 oop obj = *p;
4924 assert(obj != NULL, "the caller should have filtered out NULL values");
4925
4926 const InCSetState cset_state = _g1->in_cset_state(obj);
4927 if (!cset_state.is_in_cset_or_humongous()) {
4928 return;
4929 }
4930 if (cset_state.is_in_cset()) {
4931 assert( obj->is_forwarded(), "invariant" );
4932 *p = obj->forwardee();
4933 } else {
4934 assert(!obj->is_forwarded(), "invariant" );
4935 assert(cset_state.is_humongous(),
4936 err_msg("Only allowed InCSet state is IsHumongous, but is %d", cset_state.value()));
4937 _g1->set_humongous_is_live(obj);
4938 }
4939 }
4940 };
4941
4942 // Copying Keep Alive closure - can be called from both
4943 // serial and parallel code as long as different worker
4944 // threads utilize different G1ParScanThreadState instances
4945 // and different queues.
4946
4947 class G1CopyingKeepAliveClosure: public OopClosure {
4948 G1CollectedHeap* _g1h;
4949 OopClosure* _copy_non_heap_obj_cl;
4950 G1ParScanThreadState* _par_scan_state;
4951
4952 public:
4953 G1CopyingKeepAliveClosure(G1CollectedHeap* g1h,
4954 OopClosure* non_heap_obj_cl,
4955 G1ParScanThreadState* pss):
4956 _g1h(g1h),
4957 _copy_non_heap_obj_cl(non_heap_obj_cl),
4958 _par_scan_state(pss)
4959 {}
4960
4961 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
4962 virtual void do_oop( oop* p) { do_oop_work(p); }
4963
4964 template <class T> void do_oop_work(T* p) {
4965 oop obj = oopDesc::load_decode_heap_oop(p);
4966
4967 if (_g1h->is_in_cset_or_humongous(obj)) {
4968 // If the referent object has been forwarded (either copied
4969 // to a new location or to itself in the event of an
4970 // evacuation failure) then we need to update the reference
4971 // field and, if both reference and referent are in the G1
4972 // heap, update the RSet for the referent.
4973 //
4974 // If the referent has not been forwarded then we have to keep
4975 // it alive by policy. Therefore we have copy the referent.
4976 //
4977 // If the reference field is in the G1 heap then we can push
4978 // on the PSS queue. When the queue is drained (after each
4979 // phase of reference processing) the object and it's followers
4980 // will be copied, the reference field set to point to the
4981 // new location, and the RSet updated. Otherwise we need to
4982 // use the the non-heap or metadata closures directly to copy
4983 // the referent object and update the pointer, while avoiding
4984 // updating the RSet.
4985
4986 if (_g1h->is_in_g1_reserved(p)) {
4987 _par_scan_state->push_on_queue(p);
4988 } else {
4989 assert(!Metaspace::contains((const void*)p),
4990 err_msg("Unexpectedly found a pointer from metadata: "
4991 PTR_FORMAT, p));
4992 _copy_non_heap_obj_cl->do_oop(p);
4993 }
4994 }
4995 }
4996 };
4997
4998 // Serial drain queue closure. Called as the 'complete_gc'
4999 // closure for each discovered list in some of the
5000 // reference processing phases.
5001
5002 class G1STWDrainQueueClosure: public VoidClosure {
5003 protected:
5004 G1CollectedHeap* _g1h;
5005 G1ParScanThreadState* _par_scan_state;
5006
5007 G1ParScanThreadState* par_scan_state() { return _par_scan_state; }
5008
5009 public:
5010 G1STWDrainQueueClosure(G1CollectedHeap* g1h, G1ParScanThreadState* pss) :
5011 _g1h(g1h),
5012 _par_scan_state(pss)
5013 { }
5014
5015 void do_void() {
5016 G1ParScanThreadState* const pss = par_scan_state();
5017 pss->trim_queue();
5018 }
5019 };
5020
5021 // Parallel Reference Processing closures
5022
5023 // Implementation of AbstractRefProcTaskExecutor for parallel reference
5024 // processing during G1 evacuation pauses.
5025
5026 class G1STWRefProcTaskExecutor: public AbstractRefProcTaskExecutor {
5027 private:
5028 G1CollectedHeap* _g1h;
5029 RefToScanQueueSet* _queues;
5030 FlexibleWorkGang* _workers;
5031 int _active_workers;
5032
5033 public:
5034 G1STWRefProcTaskExecutor(G1CollectedHeap* g1h,
5035 FlexibleWorkGang* workers,
5036 RefToScanQueueSet *task_queues,
5037 int n_workers) :
5038 _g1h(g1h),
5039 _queues(task_queues),
5040 _workers(workers),
5041 _active_workers(n_workers)
5042 {
5043 assert(n_workers > 0, "shouldn't call this otherwise");
5044 }
5045
5046 // Executes the given task using concurrent marking worker threads.
5047 virtual void execute(ProcessTask& task);
5048 virtual void execute(EnqueueTask& task);
5049 };
5050
5051 // Gang task for possibly parallel reference processing
5052
5053 class G1STWRefProcTaskProxy: public AbstractGangTask {
5054 typedef AbstractRefProcTaskExecutor::ProcessTask ProcessTask;
5055 ProcessTask& _proc_task;
5056 G1CollectedHeap* _g1h;
5057 RefToScanQueueSet *_task_queues;
5058 ParallelTaskTerminator* _terminator;
5059
5060 public:
5061 G1STWRefProcTaskProxy(ProcessTask& proc_task,
5062 G1CollectedHeap* g1h,
5063 RefToScanQueueSet *task_queues,
5064 ParallelTaskTerminator* terminator) :
5065 AbstractGangTask("Process reference objects in parallel"),
5066 _proc_task(proc_task),
5067 _g1h(g1h),
5068 _task_queues(task_queues),
5069 _terminator(terminator)
5070 {}
5071
5072 virtual void work(uint worker_id) {
5073 // The reference processing task executed by a single worker.
5074 ResourceMark rm;
5075 HandleMark hm;
5076
5077 G1STWIsAliveClosure is_alive(_g1h);
5078
5079 G1ParScanThreadState pss(_g1h, worker_id, NULL);
5080 G1ParScanHeapEvacFailureClosure evac_failure_cl(_g1h, &pss, NULL);
5081
5082 pss.set_evac_failure_closure(&evac_failure_cl);
5083
5084 G1ParScanExtRootClosure only_copy_non_heap_cl(_g1h, &pss, NULL);
5085
5086 G1ParScanAndMarkExtRootClosure copy_mark_non_heap_cl(_g1h, &pss, NULL);
5087
5088 OopClosure* copy_non_heap_cl = &only_copy_non_heap_cl;
5089
5090 if (_g1h->g1_policy()->during_initial_mark_pause()) {
5091 // We also need to mark copied objects.
5092 copy_non_heap_cl = ©_mark_non_heap_cl;
5093 }
5094
5095 // Keep alive closure.
5096 G1CopyingKeepAliveClosure keep_alive(_g1h, copy_non_heap_cl, &pss);
5097
5098 // Complete GC closure
5099 G1ParEvacuateFollowersClosure drain_queue(_g1h, &pss, _task_queues, _terminator);
5100
5101 // Call the reference processing task's work routine.
5102 _proc_task.work(worker_id, is_alive, keep_alive, drain_queue);
5103
5104 // Note we cannot assert that the refs array is empty here as not all
5105 // of the processing tasks (specifically phase2 - pp2_work) execute
5106 // the complete_gc closure (which ordinarily would drain the queue) so
5107 // the queue may not be empty.
5108 }
5109 };
5110
5111 // Driver routine for parallel reference processing.
5112 // Creates an instance of the ref processing gang
5113 // task and has the worker threads execute it.
5114 void G1STWRefProcTaskExecutor::execute(ProcessTask& proc_task) {
5115 assert(_workers != NULL, "Need parallel worker threads.");
5116
5117 ParallelTaskTerminator terminator(_active_workers, _queues);
5118 G1STWRefProcTaskProxy proc_task_proxy(proc_task, _g1h, _queues, &terminator);
5119
5120 _g1h->set_par_threads(_active_workers);
5121 _workers->run_task(&proc_task_proxy);
5122 _g1h->set_par_threads(0);
5123 }
5124
5125 // Gang task for parallel reference enqueueing.
5126
5127 class G1STWRefEnqueueTaskProxy: public AbstractGangTask {
5128 typedef AbstractRefProcTaskExecutor::EnqueueTask EnqueueTask;
5129 EnqueueTask& _enq_task;
5130
5131 public:
5132 G1STWRefEnqueueTaskProxy(EnqueueTask& enq_task) :
5133 AbstractGangTask("Enqueue reference objects in parallel"),
5134 _enq_task(enq_task)
5135 { }
5136
5137 virtual void work(uint worker_id) {
5138 _enq_task.work(worker_id);
5139 }
5140 };
5141
5142 // Driver routine for parallel reference enqueueing.
5143 // Creates an instance of the ref enqueueing gang
5144 // task and has the worker threads execute it.
5145
5146 void G1STWRefProcTaskExecutor::execute(EnqueueTask& enq_task) {
5147 assert(_workers != NULL, "Need parallel worker threads.");
5148
5149 G1STWRefEnqueueTaskProxy enq_task_proxy(enq_task);
5150
5151 _g1h->set_par_threads(_active_workers);
5152 _workers->run_task(&enq_task_proxy);
5153 _g1h->set_par_threads(0);
5154 }
5155
5156 // End of weak reference support closures
5157
5158 // Abstract task used to preserve (i.e. copy) any referent objects
5159 // that are in the collection set and are pointed to by reference
5160 // objects discovered by the CM ref processor.
5161
5162 class G1ParPreserveCMReferentsTask: public AbstractGangTask {
5163 protected:
5164 G1CollectedHeap* _g1h;
5165 RefToScanQueueSet *_queues;
5166 ParallelTaskTerminator _terminator;
5167 uint _n_workers;
5168
5169 public:
5170 G1ParPreserveCMReferentsTask(G1CollectedHeap* g1h,int workers, RefToScanQueueSet *task_queues) :
5171 AbstractGangTask("ParPreserveCMReferents"),
5172 _g1h(g1h),
5173 _queues(task_queues),
5174 _terminator(workers, _queues),
5175 _n_workers(workers)
5176 { }
5177
5178 void work(uint worker_id) {
5179 ResourceMark rm;
5180 HandleMark hm;
5181
5182 G1ParScanThreadState pss(_g1h, worker_id, NULL);
5183 G1ParScanHeapEvacFailureClosure evac_failure_cl(_g1h, &pss, NULL);
5184
5185 pss.set_evac_failure_closure(&evac_failure_cl);
5186
5187 assert(pss.queue_is_empty(), "both queue and overflow should be empty");
5188
5189 G1ParScanExtRootClosure only_copy_non_heap_cl(_g1h, &pss, NULL);
5190
5191 G1ParScanAndMarkExtRootClosure copy_mark_non_heap_cl(_g1h, &pss, NULL);
5192
5193 OopClosure* copy_non_heap_cl = &only_copy_non_heap_cl;
5194
5195 if (_g1h->g1_policy()->during_initial_mark_pause()) {
5196 // We also need to mark copied objects.
5197 copy_non_heap_cl = ©_mark_non_heap_cl;
5198 }
5199
5200 // Is alive closure
5201 G1AlwaysAliveClosure always_alive(_g1h);
5202
5203 // Copying keep alive closure. Applied to referent objects that need
5204 // to be copied.
5205 G1CopyingKeepAliveClosure keep_alive(_g1h, copy_non_heap_cl, &pss);
5206
5207 ReferenceProcessor* rp = _g1h->ref_processor_cm();
5208
5209 uint limit = ReferenceProcessor::number_of_subclasses_of_ref() * rp->max_num_q();
5210 uint stride = MIN2(MAX2(_n_workers, 1U), limit);
5211
5212 // limit is set using max_num_q() - which was set using ParallelGCThreads.
5213 // So this must be true - but assert just in case someone decides to
5214 // change the worker ids.
5215 assert(worker_id < limit, "sanity");
5216 assert(!rp->discovery_is_atomic(), "check this code");
5217
5218 // Select discovered lists [i, i+stride, i+2*stride,...,limit)
5219 for (uint idx = worker_id; idx < limit; idx += stride) {
5220 DiscoveredList& ref_list = rp->discovered_refs()[idx];
5221
5222 DiscoveredListIterator iter(ref_list, &keep_alive, &always_alive);
5223 while (iter.has_next()) {
5224 // Since discovery is not atomic for the CM ref processor, we
5225 // can see some null referent objects.
5226 iter.load_ptrs(DEBUG_ONLY(true));
5227 oop ref = iter.obj();
5228
5229 // This will filter nulls.
5230 if (iter.is_referent_alive()) {
5231 iter.make_referent_alive();
5232 }
5233 iter.move_to_next();
5234 }
5235 }
5236
5237 // Drain the queue - which may cause stealing
5238 G1ParEvacuateFollowersClosure drain_queue(_g1h, &pss, _queues, &_terminator);
5239 drain_queue.do_void();
5240 // Allocation buffers were retired at the end of G1ParEvacuateFollowersClosure
5241 assert(pss.queue_is_empty(), "should be");
5242 }
5243 };
5244
5245 // Weak Reference processing during an evacuation pause (part 1).
5246 void G1CollectedHeap::process_discovered_references(uint no_of_gc_workers) {
5247 double ref_proc_start = os::elapsedTime();
5248
5249 ReferenceProcessor* rp = _ref_processor_stw;
5250 assert(rp->discovery_enabled(), "should have been enabled");
5251
5252 // Any reference objects, in the collection set, that were 'discovered'
5253 // by the CM ref processor should have already been copied (either by
5254 // applying the external root copy closure to the discovered lists, or
5255 // by following an RSet entry).
5256 //
5257 // But some of the referents, that are in the collection set, that these
5258 // reference objects point to may not have been copied: the STW ref
5259 // processor would have seen that the reference object had already
5260 // been 'discovered' and would have skipped discovering the reference,
5261 // but would not have treated the reference object as a regular oop.
5262 // As a result the copy closure would not have been applied to the
5263 // referent object.
5264 //
5265 // We need to explicitly copy these referent objects - the references
5266 // will be processed at the end of remarking.
5267 //
5268 // We also need to do this copying before we process the reference
5269 // objects discovered by the STW ref processor in case one of these
5270 // referents points to another object which is also referenced by an
5271 // object discovered by the STW ref processor.
5272
5273 assert(no_of_gc_workers == workers()->active_workers(), "Need to reset active GC workers");
5274
5275 set_par_threads(no_of_gc_workers);
5276 G1ParPreserveCMReferentsTask keep_cm_referents(this,
5277 no_of_gc_workers,
5278 _task_queues);
5279
5280 workers()->run_task(&keep_cm_referents);
5281
5282 set_par_threads(0);
5283
5284 // Closure to test whether a referent is alive.
5285 G1STWIsAliveClosure is_alive(this);
5286
5287 // Even when parallel reference processing is enabled, the processing
5288 // of JNI refs is serial and performed serially by the current thread
5289 // rather than by a worker. The following PSS will be used for processing
5290 // JNI refs.
5291
5292 // Use only a single queue for this PSS.
5293 G1ParScanThreadState pss(this, 0, NULL);
5294
5295 // We do not embed a reference processor in the copying/scanning
5296 // closures while we're actually processing the discovered
5297 // reference objects.
5298 G1ParScanHeapEvacFailureClosure evac_failure_cl(this, &pss, NULL);
5299
5300 pss.set_evac_failure_closure(&evac_failure_cl);
5301
5302 assert(pss.queue_is_empty(), "pre-condition");
5303
5304 G1ParScanExtRootClosure only_copy_non_heap_cl(this, &pss, NULL);
5305
5306 G1ParScanAndMarkExtRootClosure copy_mark_non_heap_cl(this, &pss, NULL);
5307
5308 OopClosure* copy_non_heap_cl = &only_copy_non_heap_cl;
5309
5310 if (_g1h->g1_policy()->during_initial_mark_pause()) {
5311 // We also need to mark copied objects.
5312 copy_non_heap_cl = ©_mark_non_heap_cl;
5313 }
5314
5315 // Keep alive closure.
5316 G1CopyingKeepAliveClosure keep_alive(this, copy_non_heap_cl, &pss);
5317
5318 // Serial Complete GC closure
5319 G1STWDrainQueueClosure drain_queue(this, &pss);
5320
5321 // Setup the soft refs policy...
5322 rp->setup_policy(false);
5323
5324 ReferenceProcessorStats stats;
5325 if (!rp->processing_is_mt()) {
5326 // Serial reference processing...
5327 stats = rp->process_discovered_references(&is_alive,
5328 &keep_alive,
5329 &drain_queue,
5330 NULL,
5331 _gc_timer_stw,
5332 _gc_tracer_stw->gc_id());
5333 } else {
5334 // Parallel reference processing
5335 assert(rp->num_q() == no_of_gc_workers, "sanity");
5336 assert(no_of_gc_workers <= rp->max_num_q(), "sanity");
5337
5338 G1STWRefProcTaskExecutor par_task_executor(this, workers(), _task_queues, no_of_gc_workers);
5339 stats = rp->process_discovered_references(&is_alive,
5340 &keep_alive,
5341 &drain_queue,
5342 &par_task_executor,
5343 _gc_timer_stw,
5344 _gc_tracer_stw->gc_id());
5345 }
5346
5347 _gc_tracer_stw->report_gc_reference_stats(stats);
5348
5349 // We have completed copying any necessary live referent objects.
5350 assert(pss.queue_is_empty(), "both queue and overflow should be empty");
5351
5352 double ref_proc_time = os::elapsedTime() - ref_proc_start;
5353 g1_policy()->phase_times()->record_ref_proc_time(ref_proc_time * 1000.0);
5354 }
5355
5356 // Weak Reference processing during an evacuation pause (part 2).
5357 void G1CollectedHeap::enqueue_discovered_references(uint no_of_gc_workers) {
5358 double ref_enq_start = os::elapsedTime();
5359
5360 ReferenceProcessor* rp = _ref_processor_stw;
5361 assert(!rp->discovery_enabled(), "should have been disabled as part of processing");
5362
5363 // Now enqueue any remaining on the discovered lists on to
5364 // the pending list.
5365 if (!rp->processing_is_mt()) {
5366 // Serial reference processing...
5367 rp->enqueue_discovered_references();
5368 } else {
5369 // Parallel reference enqueueing
5370
5371 assert(no_of_gc_workers == workers()->active_workers(),
5372 "Need to reset active workers");
5373 assert(rp->num_q() == no_of_gc_workers, "sanity");
5374 assert(no_of_gc_workers <= rp->max_num_q(), "sanity");
5375
5376 G1STWRefProcTaskExecutor par_task_executor(this, workers(), _task_queues, no_of_gc_workers);
5377 rp->enqueue_discovered_references(&par_task_executor);
5378 }
5379
5380 rp->verify_no_references_recorded();
5381 assert(!rp->discovery_enabled(), "should have been disabled");
5382
5383 // FIXME
5384 // CM's reference processing also cleans up the string and symbol tables.
5385 // Should we do that here also? We could, but it is a serial operation
5386 // and could significantly increase the pause time.
5387
5388 double ref_enq_time = os::elapsedTime() - ref_enq_start;
5389 g1_policy()->phase_times()->record_ref_enq_time(ref_enq_time * 1000.0);
5390 }
5391
5392 void G1CollectedHeap::evacuate_collection_set(EvacuationInfo& evacuation_info) {
5393 _expand_heap_after_alloc_failure = true;
5394 _evacuation_failed = false;
5395
5396 // Should G1EvacuationFailureALot be in effect for this GC?
5397 NOT_PRODUCT(set_evacuation_failure_alot_for_current_gc();)
5398
5399 g1_rem_set()->prepare_for_oops_into_collection_set_do();
5400
5401 // Disable the hot card cache.
5402 G1HotCardCache* hot_card_cache = _cg1r->hot_card_cache();
5403 hot_card_cache->reset_hot_cache_claimed_index();
5404 hot_card_cache->set_use_cache(false);
5405
5406 const uint n_workers = workers()->active_workers();
5407 assert(UseDynamicNumberOfGCThreads ||
5408 n_workers == workers()->total_workers(),
5409 "If not dynamic should be using all the workers");
5410 set_par_threads(n_workers);
5411
5412
5413 init_for_evac_failure(NULL);
5414
5415 assert(dirty_card_queue_set().completed_buffers_num() == 0, "Should be empty");
5416 double start_par_time_sec = os::elapsedTime();
5417 double end_par_time_sec;
5418
5419 {
5420 G1RootProcessor root_processor(this);
5421 G1ParTask g1_par_task(this, _task_queues, &root_processor);
5422 // InitialMark needs claim bits to keep track of the marked-through CLDs.
5423 if (g1_policy()->during_initial_mark_pause()) {
5424 ClassLoaderDataGraph::clear_claimed_marks();
5425 }
5426
5427 // The individual threads will set their evac-failure closures.
5428 if (PrintTerminationStats) G1ParScanThreadState::print_termination_stats_hdr();
5429 // These tasks use ShareHeap::_process_strong_tasks
5430 assert(UseDynamicNumberOfGCThreads ||
5431 workers()->active_workers() == workers()->total_workers(),
5432 "If not dynamic should be using all the workers");
5433 workers()->run_task(&g1_par_task);
5434 end_par_time_sec = os::elapsedTime();
5435
5436 // Closing the inner scope will execute the destructor
5437 // for the G1RootProcessor object. We record the current
5438 // elapsed time before closing the scope so that time
5439 // taken for the destructor is NOT included in the
5440 // reported parallel time.
5441 }
5442
5443 G1GCPhaseTimes* phase_times = g1_policy()->phase_times();
5444
5445 double par_time_ms = (end_par_time_sec - start_par_time_sec) * 1000.0;
5446 phase_times->record_par_time(par_time_ms);
5447
5448 double code_root_fixup_time_ms =
5449 (os::elapsedTime() - end_par_time_sec) * 1000.0;
5450 phase_times->record_code_root_fixup_time(code_root_fixup_time_ms);
5451
5452 set_par_threads(0);
5453
5454 // Process any discovered reference objects - we have
5455 // to do this _before_ we retire the GC alloc regions
5456 // as we may have to copy some 'reachable' referent
5457 // objects (and their reachable sub-graphs) that were
5458 // not copied during the pause.
5459 process_discovered_references(n_workers);
5460
5461 if (G1StringDedup::is_enabled()) {
5462 double fixup_start = os::elapsedTime();
5463
5464 G1STWIsAliveClosure is_alive(this);
5465 G1KeepAliveClosure keep_alive(this);
5466 G1StringDedup::unlink_or_oops_do(&is_alive, &keep_alive, true, phase_times);
5467
5468 double fixup_time_ms = (os::elapsedTime() - fixup_start) * 1000.0;
5469 phase_times->record_string_dedup_fixup_time(fixup_time_ms);
5470 }
5471
5472 _allocator->release_gc_alloc_regions(n_workers, evacuation_info);
5473 g1_rem_set()->cleanup_after_oops_into_collection_set_do();
5474
5475 // Reset and re-enable the hot card cache.
5476 // Note the counts for the cards in the regions in the
5477 // collection set are reset when the collection set is freed.
5478 hot_card_cache->reset_hot_cache();
5479 hot_card_cache->set_use_cache(true);
5480
5481 purge_code_root_memory();
5482
5483 finalize_for_evac_failure();
5484
5485 if (evacuation_failed()) {
5486 remove_self_forwarding_pointers();
5487
5488 // Reset the G1EvacuationFailureALot counters and flags
5489 // Note: the values are reset only when an actual
5490 // evacuation failure occurs.
5491 NOT_PRODUCT(reset_evacuation_should_fail();)
5492 }
5493
5494 // Enqueue any remaining references remaining on the STW
5495 // reference processor's discovered lists. We need to do
5496 // this after the card table is cleaned (and verified) as
5497 // the act of enqueueing entries on to the pending list
5498 // will log these updates (and dirty their associated
5499 // cards). We need these updates logged to update any
5500 // RSets.
5501 enqueue_discovered_references(n_workers);
5502
5503 redirty_logged_cards();
5504 COMPILER2_PRESENT(DerivedPointerTable::update_pointers());
5505 }
5506
5507 void G1CollectedHeap::free_region(HeapRegion* hr,
5508 FreeRegionList* free_list,
5509 bool par,
5510 bool locked) {
5511 assert(!hr->is_free(), "the region should not be free");
5512 assert(!hr->is_empty(), "the region should not be empty");
5513 assert(_hrm.is_available(hr->hrm_index()), "region should be committed");
5514 assert(free_list != NULL, "pre-condition");
5515
5516 if (G1VerifyBitmaps) {
5517 MemRegion mr(hr->bottom(), hr->end());
5518 concurrent_mark()->clearRangePrevBitmap(mr);
5519 }
5520
5521 // Clear the card counts for this region.
5522 // Note: we only need to do this if the region is not young
5523 // (since we don't refine cards in young regions).
5524 if (!hr->is_young()) {
5525 _cg1r->hot_card_cache()->reset_card_counts(hr);
5526 }
5527 hr->hr_clear(par, true /* clear_space */, locked /* locked */);
5528 free_list->add_ordered(hr);
5529 }
5530
5531 void G1CollectedHeap::free_humongous_region(HeapRegion* hr,
5532 FreeRegionList* free_list,
5533 bool par) {
5534 assert(hr->is_starts_humongous(), "this is only for starts humongous regions");
5535 assert(free_list != NULL, "pre-condition");
5536
5537 size_t hr_capacity = hr->capacity();
5538 // We need to read this before we make the region non-humongous,
5539 // otherwise the information will be gone.
5540 uint last_index = hr->last_hc_index();
5541 hr->clear_humongous();
5542 free_region(hr, free_list, par);
5543
5544 uint i = hr->hrm_index() + 1;
5545 while (i < last_index) {
5546 HeapRegion* curr_hr = region_at(i);
5547 assert(curr_hr->is_continues_humongous(), "invariant");
5548 curr_hr->clear_humongous();
5549 free_region(curr_hr, free_list, par);
5550 i += 1;
5551 }
5552 }
5553
5554 void G1CollectedHeap::remove_from_old_sets(const HeapRegionSetCount& old_regions_removed,
5555 const HeapRegionSetCount& humongous_regions_removed) {
5556 if (old_regions_removed.length() > 0 || humongous_regions_removed.length() > 0) {
5557 MutexLockerEx x(OldSets_lock, Mutex::_no_safepoint_check_flag);
5558 _old_set.bulk_remove(old_regions_removed);
5559 _humongous_set.bulk_remove(humongous_regions_removed);
5560 }
5561
5562 }
5563
5564 void G1CollectedHeap::prepend_to_freelist(FreeRegionList* list) {
5565 assert(list != NULL, "list can't be null");
5566 if (!list->is_empty()) {
5567 MutexLockerEx x(FreeList_lock, Mutex::_no_safepoint_check_flag);
5568 _hrm.insert_list_into_free_list(list);
5569 }
5570 }
5571
5572 void G1CollectedHeap::decrement_summary_bytes(size_t bytes) {
5573 _allocator->decrease_used(bytes);
5574 }
5575
5576 class G1ParCleanupCTTask : public AbstractGangTask {
5577 G1SATBCardTableModRefBS* _ct_bs;
5578 G1CollectedHeap* _g1h;
5579 HeapRegion* volatile _su_head;
5580 public:
5581 G1ParCleanupCTTask(G1SATBCardTableModRefBS* ct_bs,
5582 G1CollectedHeap* g1h) :
5583 AbstractGangTask("G1 Par Cleanup CT Task"),
5584 _ct_bs(ct_bs), _g1h(g1h) { }
5585
5586 void work(uint worker_id) {
5587 HeapRegion* r;
5588 while (r = _g1h->pop_dirty_cards_region()) {
5589 clear_cards(r);
5590 }
5591 }
5592
5593 void clear_cards(HeapRegion* r) {
5594 // Cards of the survivors should have already been dirtied.
5595 if (!r->is_survivor()) {
5596 _ct_bs->clear(MemRegion(r->bottom(), r->end()));
5597 }
5598 }
5599 };
5600
5601 #ifndef PRODUCT
5602 class G1VerifyCardTableCleanup: public HeapRegionClosure {
5603 G1CollectedHeap* _g1h;
5604 G1SATBCardTableModRefBS* _ct_bs;
5605 public:
5606 G1VerifyCardTableCleanup(G1CollectedHeap* g1h, G1SATBCardTableModRefBS* ct_bs)
5607 : _g1h(g1h), _ct_bs(ct_bs) { }
5608 virtual bool doHeapRegion(HeapRegion* r) {
5609 if (r->is_survivor()) {
5610 _g1h->verify_dirty_region(r);
5611 } else {
5612 _g1h->verify_not_dirty_region(r);
5613 }
5614 return false;
5615 }
5616 };
5617
5618 void G1CollectedHeap::verify_not_dirty_region(HeapRegion* hr) {
5619 // All of the region should be clean.
5620 G1SATBCardTableModRefBS* ct_bs = g1_barrier_set();
5621 MemRegion mr(hr->bottom(), hr->end());
5622 ct_bs->verify_not_dirty_region(mr);
5623 }
5624
5625 void G1CollectedHeap::verify_dirty_region(HeapRegion* hr) {
5626 // We cannot guarantee that [bottom(),end()] is dirty. Threads
5627 // dirty allocated blocks as they allocate them. The thread that
5628 // retires each region and replaces it with a new one will do a
5629 // maximal allocation to fill in [pre_dummy_top(),end()] but will
5630 // not dirty that area (one less thing to have to do while holding
5631 // a lock). So we can only verify that [bottom(),pre_dummy_top()]
5632 // is dirty.
5633 G1SATBCardTableModRefBS* ct_bs = g1_barrier_set();
5634 MemRegion mr(hr->bottom(), hr->pre_dummy_top());
5635 if (hr->is_young()) {
5636 ct_bs->verify_g1_young_region(mr);
5637 } else {
5638 ct_bs->verify_dirty_region(mr);
5639 }
5640 }
5641
5642 void G1CollectedHeap::verify_dirty_young_list(HeapRegion* head) {
5643 G1SATBCardTableModRefBS* ct_bs = g1_barrier_set();
5644 for (HeapRegion* hr = head; hr != NULL; hr = hr->get_next_young_region()) {
5645 verify_dirty_region(hr);
5646 }
5647 }
5648
5649 void G1CollectedHeap::verify_dirty_young_regions() {
5650 verify_dirty_young_list(_young_list->first_region());
5651 }
5652
5653 bool G1CollectedHeap::verify_no_bits_over_tams(const char* bitmap_name, CMBitMapRO* bitmap,
5654 HeapWord* tams, HeapWord* end) {
5655 guarantee(tams <= end,
5656 err_msg("tams: "PTR_FORMAT" end: "PTR_FORMAT, tams, end));
5657 HeapWord* result = bitmap->getNextMarkedWordAddress(tams, end);
5658 if (result < end) {
5659 gclog_or_tty->cr();
5660 gclog_or_tty->print_cr("## wrong marked address on %s bitmap: "PTR_FORMAT,
5661 bitmap_name, result);
5662 gclog_or_tty->print_cr("## %s tams: "PTR_FORMAT" end: "PTR_FORMAT,
5663 bitmap_name, tams, end);
5664 return false;
5665 }
5666 return true;
5667 }
5668
5669 bool G1CollectedHeap::verify_bitmaps(const char* caller, HeapRegion* hr) {
5670 CMBitMapRO* prev_bitmap = concurrent_mark()->prevMarkBitMap();
5671 CMBitMapRO* next_bitmap = (CMBitMapRO*) concurrent_mark()->nextMarkBitMap();
5672
5673 HeapWord* bottom = hr->bottom();
5674 HeapWord* ptams = hr->prev_top_at_mark_start();
5675 HeapWord* ntams = hr->next_top_at_mark_start();
5676 HeapWord* end = hr->end();
5677
5678 bool res_p = verify_no_bits_over_tams("prev", prev_bitmap, ptams, end);
5679
5680 bool res_n = true;
5681 // We reset mark_in_progress() before we reset _cmThread->in_progress() and in this window
5682 // we do the clearing of the next bitmap concurrently. Thus, we can not verify the bitmap
5683 // if we happen to be in that state.
5684 if (mark_in_progress() || !_cmThread->in_progress()) {
5685 res_n = verify_no_bits_over_tams("next", next_bitmap, ntams, end);
5686 }
5687 if (!res_p || !res_n) {
5688 gclog_or_tty->print_cr("#### Bitmap verification failed for "HR_FORMAT,
5689 HR_FORMAT_PARAMS(hr));
5690 gclog_or_tty->print_cr("#### Caller: %s", caller);
5691 return false;
5692 }
5693 return true;
5694 }
5695
5696 void G1CollectedHeap::check_bitmaps(const char* caller, HeapRegion* hr) {
5697 if (!G1VerifyBitmaps) return;
5698
5699 guarantee(verify_bitmaps(caller, hr), "bitmap verification");
5700 }
5701
5702 class G1VerifyBitmapClosure : public HeapRegionClosure {
5703 private:
5704 const char* _caller;
5705 G1CollectedHeap* _g1h;
5706 bool _failures;
5707
5708 public:
5709 G1VerifyBitmapClosure(const char* caller, G1CollectedHeap* g1h) :
5710 _caller(caller), _g1h(g1h), _failures(false) { }
5711
5712 bool failures() { return _failures; }
5713
5714 virtual bool doHeapRegion(HeapRegion* hr) {
5715 if (hr->is_continues_humongous()) return false;
5716
5717 bool result = _g1h->verify_bitmaps(_caller, hr);
5718 if (!result) {
5719 _failures = true;
5720 }
5721 return false;
5722 }
5723 };
5724
5725 void G1CollectedHeap::check_bitmaps(const char* caller) {
5726 if (!G1VerifyBitmaps) return;
5727
5728 G1VerifyBitmapClosure cl(caller, this);
5729 heap_region_iterate(&cl);
5730 guarantee(!cl.failures(), "bitmap verification");
5731 }
5732
5733 class G1CheckCSetFastTableClosure : public HeapRegionClosure {
5734 private:
5735 bool _failures;
5736 public:
5737 G1CheckCSetFastTableClosure() : HeapRegionClosure(), _failures(false) { }
5738
5739 virtual bool doHeapRegion(HeapRegion* hr) {
5740 uint i = hr->hrm_index();
5741 InCSetState cset_state = (InCSetState) G1CollectedHeap::heap()->_in_cset_fast_test.get_by_index(i);
5742 if (hr->is_humongous()) {
5743 if (hr->in_collection_set()) {
5744 gclog_or_tty->print_cr("\n## humongous region %u in CSet", i);
5745 _failures = true;
5746 return true;
5747 }
5748 if (cset_state.is_in_cset()) {
5749 gclog_or_tty->print_cr("\n## inconsistent cset state %d for humongous region %u", cset_state.value(), i);
5750 _failures = true;
5751 return true;
5752 }
5753 if (hr->is_continues_humongous() && cset_state.is_humongous()) {
5754 gclog_or_tty->print_cr("\n## inconsistent cset state %d for continues humongous region %u", cset_state.value(), i);
5755 _failures = true;
5756 return true;
5757 }
5758 } else {
5759 if (cset_state.is_humongous()) {
5760 gclog_or_tty->print_cr("\n## inconsistent cset state %d for non-humongous region %u", cset_state.value(), i);
5761 _failures = true;
5762 return true;
5763 }
5764 if (hr->in_collection_set() != cset_state.is_in_cset()) {
5765 gclog_or_tty->print_cr("\n## in CSet %d / cset state %d inconsistency for region %u",
5766 hr->in_collection_set(), cset_state.value(), i);
5767 _failures = true;
5768 return true;
5769 }
5770 if (cset_state.is_in_cset()) {
5771 if (hr->is_young() != (cset_state.is_young())) {
5772 gclog_or_tty->print_cr("\n## is_young %d / cset state %d inconsistency for region %u",
5773 hr->is_young(), cset_state.value(), i);
5774 _failures = true;
5775 return true;
5776 }
5777 if (hr->is_old() != (cset_state.is_old())) {
5778 gclog_or_tty->print_cr("\n## is_old %d / cset state %d inconsistency for region %u",
5779 hr->is_old(), cset_state.value(), i);
5780 _failures = true;
5781 return true;
5782 }
5783 }
5784 }
5785 return false;
5786 }
5787
5788 bool failures() const { return _failures; }
5789 };
5790
5791 bool G1CollectedHeap::check_cset_fast_test() {
5792 G1CheckCSetFastTableClosure cl;
5793 _hrm.iterate(&cl);
5794 return !cl.failures();
5795 }
5796 #endif // PRODUCT
5797
5798 void G1CollectedHeap::cleanUpCardTable() {
5799 G1SATBCardTableModRefBS* ct_bs = g1_barrier_set();
5800 double start = os::elapsedTime();
5801
5802 {
5803 // Iterate over the dirty cards region list.
5804 G1ParCleanupCTTask cleanup_task(ct_bs, this);
5805
5806 set_par_threads();
5807 workers()->run_task(&cleanup_task);
5808 set_par_threads(0);
5809 #ifndef PRODUCT
5810 if (G1VerifyCTCleanup || VerifyAfterGC) {
5811 G1VerifyCardTableCleanup cleanup_verifier(this, ct_bs);
5812 heap_region_iterate(&cleanup_verifier);
5813 }
5814 #endif
5815 }
5816
5817 double elapsed = os::elapsedTime() - start;
5818 g1_policy()->phase_times()->record_clear_ct_time(elapsed * 1000.0);
5819 }
5820
5821 void G1CollectedHeap::free_collection_set(HeapRegion* cs_head, EvacuationInfo& evacuation_info) {
5822 size_t pre_used = 0;
5823 FreeRegionList local_free_list("Local List for CSet Freeing");
5824
5825 double young_time_ms = 0.0;
5826 double non_young_time_ms = 0.0;
5827
5828 // Since the collection set is a superset of the the young list,
5829 // all we need to do to clear the young list is clear its
5830 // head and length, and unlink any young regions in the code below
5831 _young_list->clear();
5832
5833 G1CollectorPolicy* policy = g1_policy();
5834
5835 double start_sec = os::elapsedTime();
5836 bool non_young = true;
5837
5838 HeapRegion* cur = cs_head;
5839 int age_bound = -1;
5840 size_t rs_lengths = 0;
5841
5842 while (cur != NULL) {
5843 assert(!is_on_master_free_list(cur), "sanity");
5844 if (non_young) {
5845 if (cur->is_young()) {
5846 double end_sec = os::elapsedTime();
5847 double elapsed_ms = (end_sec - start_sec) * 1000.0;
5848 non_young_time_ms += elapsed_ms;
5849
5850 start_sec = os::elapsedTime();
5851 non_young = false;
5852 }
5853 } else {
5854 if (!cur->is_young()) {
5855 double end_sec = os::elapsedTime();
5856 double elapsed_ms = (end_sec - start_sec) * 1000.0;
5857 young_time_ms += elapsed_ms;
5858
5859 start_sec = os::elapsedTime();
5860 non_young = true;
5861 }
5862 }
5863
5864 rs_lengths += cur->rem_set()->occupied_locked();
5865
5866 HeapRegion* next = cur->next_in_collection_set();
5867 assert(cur->in_collection_set(), "bad CS");
5868 cur->set_next_in_collection_set(NULL);
5869 clear_in_cset(cur);
5870
5871 if (cur->is_young()) {
5872 int index = cur->young_index_in_cset();
5873 assert(index != -1, "invariant");
5874 assert((uint) index < policy->young_cset_region_length(), "invariant");
5875 size_t words_survived = _surviving_young_words[index];
5876 cur->record_surv_words_in_group(words_survived);
5877
5878 // At this point the we have 'popped' cur from the collection set
5879 // (linked via next_in_collection_set()) but it is still in the
5880 // young list (linked via next_young_region()). Clear the
5881 // _next_young_region field.
5882 cur->set_next_young_region(NULL);
5883 } else {
5884 int index = cur->young_index_in_cset();
5885 assert(index == -1, "invariant");
5886 }
5887
5888 assert( (cur->is_young() && cur->young_index_in_cset() > -1) ||
5889 (!cur->is_young() && cur->young_index_in_cset() == -1),
5890 "invariant" );
5891
5892 if (!cur->evacuation_failed()) {
5893 MemRegion used_mr = cur->used_region();
5894
5895 // And the region is empty.
5896 assert(!used_mr.is_empty(), "Should not have empty regions in a CS.");
5897 pre_used += cur->used();
5898 free_region(cur, &local_free_list, false /* par */, true /* locked */);
5899 } else {
5900 cur->uninstall_surv_rate_group();
5901 if (cur->is_young()) {
5902 cur->set_young_index_in_cset(-1);
5903 }
5904 cur->set_evacuation_failed(false);
5905 // The region is now considered to be old.
5906 cur->set_old();
5907 _old_set.add(cur);
5908 evacuation_info.increment_collectionset_used_after(cur->used());
5909 }
5910 cur = next;
5911 }
5912
5913 evacuation_info.set_regions_freed(local_free_list.length());
5914 policy->record_max_rs_lengths(rs_lengths);
5915 policy->cset_regions_freed();
5916
5917 double end_sec = os::elapsedTime();
5918 double elapsed_ms = (end_sec - start_sec) * 1000.0;
5919
5920 if (non_young) {
5921 non_young_time_ms += elapsed_ms;
5922 } else {
5923 young_time_ms += elapsed_ms;
5924 }
5925
5926 prepend_to_freelist(&local_free_list);
5927 decrement_summary_bytes(pre_used);
5928 policy->phase_times()->record_young_free_cset_time_ms(young_time_ms);
5929 policy->phase_times()->record_non_young_free_cset_time_ms(non_young_time_ms);
5930 }
5931
5932 class G1FreeHumongousRegionClosure : public HeapRegionClosure {
5933 private:
5934 FreeRegionList* _free_region_list;
5935 HeapRegionSet* _proxy_set;
5936 HeapRegionSetCount _humongous_regions_removed;
5937 size_t _freed_bytes;
5938 public:
5939
5940 G1FreeHumongousRegionClosure(FreeRegionList* free_region_list) :
5941 _free_region_list(free_region_list), _humongous_regions_removed(), _freed_bytes(0) {
5942 }
5943
5944 virtual bool doHeapRegion(HeapRegion* r) {
5945 if (!r->is_starts_humongous()) {
5946 return false;
5947 }
5948
5949 G1CollectedHeap* g1h = G1CollectedHeap::heap();
5950
5951 oop obj = (oop)r->bottom();
5952 CMBitMap* next_bitmap = g1h->concurrent_mark()->nextMarkBitMap();
5953
5954 // The following checks whether the humongous object is live are sufficient.
5955 // The main additional check (in addition to having a reference from the roots
5956 // or the young gen) is whether the humongous object has a remembered set entry.
5957 //
5958 // A humongous object cannot be live if there is no remembered set for it
5959 // because:
5960 // - there can be no references from within humongous starts regions referencing
5961 // the object because we never allocate other objects into them.
5962 // (I.e. there are no intra-region references that may be missed by the
5963 // remembered set)
5964 // - as soon there is a remembered set entry to the humongous starts region
5965 // (i.e. it has "escaped" to an old object) this remembered set entry will stay
5966 // until the end of a concurrent mark.
5967 //
5968 // It is not required to check whether the object has been found dead by marking
5969 // or not, in fact it would prevent reclamation within a concurrent cycle, as
5970 // all objects allocated during that time are considered live.
5971 // SATB marking is even more conservative than the remembered set.
5972 // So if at this point in the collection there is no remembered set entry,
5973 // nobody has a reference to it.
5974 // At the start of collection we flush all refinement logs, and remembered sets
5975 // are completely up-to-date wrt to references to the humongous object.
5976 //
5977 // Other implementation considerations:
5978 // - never consider object arrays at this time because they would pose
5979 // considerable effort for cleaning up the the remembered sets. This is
5980 // required because stale remembered sets might reference locations that
5981 // are currently allocated into.
5982 uint region_idx = r->hrm_index();
5983 if (g1h->humongous_is_live(region_idx) ||
5984 g1h->humongous_region_is_always_live(region_idx)) {
5985
5986 if (G1TraceEagerReclaimHumongousObjects) {
5987 gclog_or_tty->print_cr("Live humongous region %u size "SIZE_FORMAT" start "PTR_FORMAT" length "UINT32_FORMAT" with remset "SIZE_FORMAT" code roots "SIZE_FORMAT" is marked %d live-other %d obj array %d",
5988 region_idx,
5989 obj->size()*HeapWordSize,
5990 r->bottom(),
5991 r->region_num(),
5992 r->rem_set()->occupied(),
5993 r->rem_set()->strong_code_roots_list_length(),
5994 next_bitmap->isMarked(r->bottom()),
5995 g1h->humongous_is_live(region_idx),
5996 obj->is_objArray()
5997 );
5998 }
5999
6000 return false;
6001 }
6002
6003 guarantee(!obj->is_objArray(),
6004 err_msg("Eagerly reclaiming object arrays is not supported, but the object "PTR_FORMAT" is.",
6005 r->bottom()));
6006
6007 if (G1TraceEagerReclaimHumongousObjects) {
6008 gclog_or_tty->print_cr("Dead humongous region %u size "SIZE_FORMAT" start "PTR_FORMAT" length "UINT32_FORMAT" with remset "SIZE_FORMAT" code roots "SIZE_FORMAT" is marked %d live-other %d obj array %d",
6009 region_idx,
6010 obj->size()*HeapWordSize,
6011 r->bottom(),
6012 r->region_num(),
6013 r->rem_set()->occupied(),
6014 r->rem_set()->strong_code_roots_list_length(),
6015 next_bitmap->isMarked(r->bottom()),
6016 g1h->humongous_is_live(region_idx),
6017 obj->is_objArray()
6018 );
6019 }
6020 // Need to clear mark bit of the humongous object if already set.
6021 if (next_bitmap->isMarked(r->bottom())) {
6022 next_bitmap->clear(r->bottom());
6023 }
6024 _freed_bytes += r->used();
6025 r->set_containing_set(NULL);
6026 _humongous_regions_removed.increment(1u, r->capacity());
6027 g1h->free_humongous_region(r, _free_region_list, false);
6028
6029 return false;
6030 }
6031
6032 HeapRegionSetCount& humongous_free_count() {
6033 return _humongous_regions_removed;
6034 }
6035
6036 size_t bytes_freed() const {
6037 return _freed_bytes;
6038 }
6039
6040 size_t humongous_reclaimed() const {
6041 return _humongous_regions_removed.length();
6042 }
6043 };
6044
6045 void G1CollectedHeap::eagerly_reclaim_humongous_regions() {
6046 assert_at_safepoint(true);
6047
6048 if (!G1EagerReclaimHumongousObjects ||
6049 (!_has_humongous_reclaim_candidates && !G1TraceEagerReclaimHumongousObjects)) {
6050 g1_policy()->phase_times()->record_fast_reclaim_humongous_time_ms(0.0, 0);
6051 return;
6052 }
6053
6054 double start_time = os::elapsedTime();
6055
6056 FreeRegionList local_cleanup_list("Local Humongous Cleanup List");
6057
6058 G1FreeHumongousRegionClosure cl(&local_cleanup_list);
6059 heap_region_iterate(&cl);
6060
6061 HeapRegionSetCount empty_set;
6062 remove_from_old_sets(empty_set, cl.humongous_free_count());
6063
6064 G1HRPrinter* hr_printer = _g1h->hr_printer();
6065 if (hr_printer->is_active()) {
6066 FreeRegionListIterator iter(&local_cleanup_list);
6067 while (iter.more_available()) {
6068 HeapRegion* hr = iter.get_next();
6069 hr_printer->cleanup(hr);
6070 }
6071 }
6072
6073 prepend_to_freelist(&local_cleanup_list);
6074 decrement_summary_bytes(cl.bytes_freed());
6075
6076 g1_policy()->phase_times()->record_fast_reclaim_humongous_time_ms((os::elapsedTime() - start_time) * 1000.0,
6077 cl.humongous_reclaimed());
6078 }
6079
6080 // This routine is similar to the above but does not record
6081 // any policy statistics or update free lists; we are abandoning
6082 // the current incremental collection set in preparation of a
6083 // full collection. After the full GC we will start to build up
6084 // the incremental collection set again.
6085 // This is only called when we're doing a full collection
6086 // and is immediately followed by the tearing down of the young list.
6087
6088 void G1CollectedHeap::abandon_collection_set(HeapRegion* cs_head) {
6089 HeapRegion* cur = cs_head;
6090
6091 while (cur != NULL) {
6092 HeapRegion* next = cur->next_in_collection_set();
6093 assert(cur->in_collection_set(), "bad CS");
6094 cur->set_next_in_collection_set(NULL);
6095 clear_in_cset(cur);
6096 cur->set_young_index_in_cset(-1);
6097 cur = next;
6098 }
6099 }
6100
6101 void G1CollectedHeap::set_free_regions_coming() {
6102 if (G1ConcRegionFreeingVerbose) {
6103 gclog_or_tty->print_cr("G1ConcRegionFreeing [cm thread] : "
6104 "setting free regions coming");
6105 }
6106
6107 assert(!free_regions_coming(), "pre-condition");
6108 _free_regions_coming = true;
6109 }
6110
6111 void G1CollectedHeap::reset_free_regions_coming() {
6112 assert(free_regions_coming(), "pre-condition");
6113
6114 {
6115 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag);
6116 _free_regions_coming = false;
6117 SecondaryFreeList_lock->notify_all();
6118 }
6119
6120 if (G1ConcRegionFreeingVerbose) {
6121 gclog_or_tty->print_cr("G1ConcRegionFreeing [cm thread] : "
6122 "reset free regions coming");
6123 }
6124 }
6125
6126 void G1CollectedHeap::wait_while_free_regions_coming() {
6127 // Most of the time we won't have to wait, so let's do a quick test
6128 // first before we take the lock.
6129 if (!free_regions_coming()) {
6130 return;
6131 }
6132
6133 if (G1ConcRegionFreeingVerbose) {
6134 gclog_or_tty->print_cr("G1ConcRegionFreeing [other] : "
6135 "waiting for free regions");
6136 }
6137
6138 {
6139 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag);
6140 while (free_regions_coming()) {
6141 SecondaryFreeList_lock->wait(Mutex::_no_safepoint_check_flag);
6142 }
6143 }
6144
6145 if (G1ConcRegionFreeingVerbose) {
6146 gclog_or_tty->print_cr("G1ConcRegionFreeing [other] : "
6147 "done waiting for free regions");
6148 }
6149 }
6150
6151 void G1CollectedHeap::set_region_short_lived_locked(HeapRegion* hr) {
6152 _young_list->push_region(hr);
6153 }
6154
6155 class NoYoungRegionsClosure: public HeapRegionClosure {
6156 private:
6157 bool _success;
6158 public:
6159 NoYoungRegionsClosure() : _success(true) { }
6160 bool doHeapRegion(HeapRegion* r) {
6161 if (r->is_young()) {
6162 gclog_or_tty->print_cr("Region ["PTR_FORMAT", "PTR_FORMAT") tagged as young",
6163 r->bottom(), r->end());
6164 _success = false;
6165 }
6166 return false;
6167 }
6168 bool success() { return _success; }
6169 };
6170
6171 bool G1CollectedHeap::check_young_list_empty(bool check_heap, bool check_sample) {
6172 bool ret = _young_list->check_list_empty(check_sample);
6173
6174 if (check_heap) {
6175 NoYoungRegionsClosure closure;
6176 heap_region_iterate(&closure);
6177 ret = ret && closure.success();
6178 }
6179
6180 return ret;
6181 }
6182
6183 class TearDownRegionSetsClosure : public HeapRegionClosure {
6184 private:
6185 HeapRegionSet *_old_set;
6186
6187 public:
6188 TearDownRegionSetsClosure(HeapRegionSet* old_set) : _old_set(old_set) { }
6189
6190 bool doHeapRegion(HeapRegion* r) {
6191 if (r->is_old()) {
6192 _old_set->remove(r);
6193 } else {
6194 // We ignore free regions, we'll empty the free list afterwards.
6195 // We ignore young regions, we'll empty the young list afterwards.
6196 // We ignore humongous regions, we're not tearing down the
6197 // humongous regions set.
6198 assert(r->is_free() || r->is_young() || r->is_humongous(),
6199 "it cannot be another type");
6200 }
6201 return false;
6202 }
6203
6204 ~TearDownRegionSetsClosure() {
6205 assert(_old_set->is_empty(), "post-condition");
6206 }
6207 };
6208
6209 void G1CollectedHeap::tear_down_region_sets(bool free_list_only) {
6210 assert_at_safepoint(true /* should_be_vm_thread */);
6211
6212 if (!free_list_only) {
6213 TearDownRegionSetsClosure cl(&_old_set);
6214 heap_region_iterate(&cl);
6215
6216 // Note that emptying the _young_list is postponed and instead done as
6217 // the first step when rebuilding the regions sets again. The reason for
6218 // this is that during a full GC string deduplication needs to know if
6219 // a collected region was young or old when the full GC was initiated.
6220 }
6221 _hrm.remove_all_free_regions();
6222 }
6223
6224 class RebuildRegionSetsClosure : public HeapRegionClosure {
6225 private:
6226 bool _free_list_only;
6227 HeapRegionSet* _old_set;
6228 HeapRegionManager* _hrm;
6229 size_t _total_used;
6230
6231 public:
6232 RebuildRegionSetsClosure(bool free_list_only,
6233 HeapRegionSet* old_set, HeapRegionManager* hrm) :
6234 _free_list_only(free_list_only),
6235 _old_set(old_set), _hrm(hrm), _total_used(0) {
6236 assert(_hrm->num_free_regions() == 0, "pre-condition");
6237 if (!free_list_only) {
6238 assert(_old_set->is_empty(), "pre-condition");
6239 }
6240 }
6241
6242 bool doHeapRegion(HeapRegion* r) {
6243 if (r->is_continues_humongous()) {
6244 return false;
6245 }
6246
6247 if (r->is_empty()) {
6248 // Add free regions to the free list
6249 r->set_free();
6250 r->set_allocation_context(AllocationContext::system());
6251 _hrm->insert_into_free_list(r);
6252 } else if (!_free_list_only) {
6253 assert(!r->is_young(), "we should not come across young regions");
6254
6255 if (r->is_humongous()) {
6256 // We ignore humongous regions, we left the humongous set unchanged
6257 } else {
6258 // Objects that were compacted would have ended up on regions
6259 // that were previously old or free.
6260 assert(r->is_free() || r->is_old(), "invariant");
6261 // We now consider them old, so register as such.
6262 r->set_old();
6263 _old_set->add(r);
6264 }
6265 _total_used += r->used();
6266 }
6267
6268 return false;
6269 }
6270
6271 size_t total_used() {
6272 return _total_used;
6273 }
6274 };
6275
6276 void G1CollectedHeap::rebuild_region_sets(bool free_list_only) {
6277 assert_at_safepoint(true /* should_be_vm_thread */);
6278
6279 if (!free_list_only) {
6280 _young_list->empty_list();
6281 }
6282
6283 RebuildRegionSetsClosure cl(free_list_only, &_old_set, &_hrm);
6284 heap_region_iterate(&cl);
6285
6286 if (!free_list_only) {
6287 _allocator->set_used(cl.total_used());
6288 }
6289 assert(_allocator->used_unlocked() == recalculate_used(),
6290 err_msg("inconsistent _allocator->used_unlocked(), "
6291 "value: "SIZE_FORMAT" recalculated: "SIZE_FORMAT,
6292 _allocator->used_unlocked(), recalculate_used()));
6293 }
6294
6295 void G1CollectedHeap::set_refine_cte_cl_concurrency(bool concurrent) {
6296 _refine_cte_cl->set_concurrent(concurrent);
6297 }
6298
6299 bool G1CollectedHeap::is_in_closed_subset(const void* p) const {
6300 HeapRegion* hr = heap_region_containing(p);
6301 return hr->is_in(p);
6302 }
6303
6304 // Methods for the mutator alloc region
6305
6306 HeapRegion* G1CollectedHeap::new_mutator_alloc_region(size_t word_size,
6307 bool force) {
6308 assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
6309 assert(!force || g1_policy()->can_expand_young_list(),
6310 "if force is true we should be able to expand the young list");
6311 bool young_list_full = g1_policy()->is_young_list_full();
6312 if (force || !young_list_full) {
6313 HeapRegion* new_alloc_region = new_region(word_size,
6314 false /* is_old */,
6315 false /* do_expand */);
6316 if (new_alloc_region != NULL) {
6317 set_region_short_lived_locked(new_alloc_region);
6318 _hr_printer.alloc(new_alloc_region, G1HRPrinter::Eden, young_list_full);
6319 check_bitmaps("Mutator Region Allocation", new_alloc_region);
6320 return new_alloc_region;
6321 }
6322 }
6323 return NULL;
6324 }
6325
6326 void G1CollectedHeap::retire_mutator_alloc_region(HeapRegion* alloc_region,
6327 size_t allocated_bytes) {
6328 assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
6329 assert(alloc_region->is_eden(), "all mutator alloc regions should be eden");
6330
6331 g1_policy()->add_region_to_incremental_cset_lhs(alloc_region);
6332 _allocator->increase_used(allocated_bytes);
6333 _hr_printer.retire(alloc_region);
6334 // We update the eden sizes here, when the region is retired,
6335 // instead of when it's allocated, since this is the point that its
6336 // used space has been recored in _summary_bytes_used.
6337 g1mm()->update_eden_size();
6338 }
6339
6340 void G1CollectedHeap::set_par_threads() {
6341 // Don't change the number of workers. Use the value previously set
6342 // in the workgroup.
6343 uint n_workers = workers()->active_workers();
6344 assert(UseDynamicNumberOfGCThreads ||
6345 n_workers == workers()->total_workers(),
6346 "Otherwise should be using the total number of workers");
6347 if (n_workers == 0) {
6348 assert(false, "Should have been set in prior evacuation pause.");
6349 n_workers = ParallelGCThreads;
6350 workers()->set_active_workers(n_workers);
6351 }
6352 set_par_threads(n_workers);
6353 }
6354
6355 // Methods for the GC alloc regions
6356
6357 HeapRegion* G1CollectedHeap::new_gc_alloc_region(size_t word_size,
6358 uint count,
6359 InCSetState dest) {
6360 assert(FreeList_lock->owned_by_self(), "pre-condition");
6361
6362 if (count < g1_policy()->max_regions(dest)) {
6363 const bool is_survivor = (dest.is_young());
6364 HeapRegion* new_alloc_region = new_region(word_size,
6365 !is_survivor,
6366 true /* do_expand */);
6367 if (new_alloc_region != NULL) {
6368 // We really only need to do this for old regions given that we
6369 // should never scan survivors. But it doesn't hurt to do it
6370 // for survivors too.
6371 new_alloc_region->record_timestamp();
6372 if (is_survivor) {
6373 new_alloc_region->set_survivor();
6374 _hr_printer.alloc(new_alloc_region, G1HRPrinter::Survivor);
6375 check_bitmaps("Survivor Region Allocation", new_alloc_region);
6376 } else {
6377 new_alloc_region->set_old();
6378 _hr_printer.alloc(new_alloc_region, G1HRPrinter::Old);
6379 check_bitmaps("Old Region Allocation", new_alloc_region);
6380 }
6381 bool during_im = g1_policy()->during_initial_mark_pause();
6382 new_alloc_region->note_start_of_copying(during_im);
6383 return new_alloc_region;
6384 }
6385 }
6386 return NULL;
6387 }
6388
6389 void G1CollectedHeap::retire_gc_alloc_region(HeapRegion* alloc_region,
6390 size_t allocated_bytes,
6391 InCSetState dest) {
6392 bool during_im = g1_policy()->during_initial_mark_pause();
6393 alloc_region->note_end_of_copying(during_im);
6394 g1_policy()->record_bytes_copied_during_gc(allocated_bytes);
6395 if (dest.is_young()) {
6396 young_list()->add_survivor_region(alloc_region);
6397 } else {
6398 _old_set.add(alloc_region);
6399 }
6400 _hr_printer.retire(alloc_region);
6401 }
6402
6403 // Heap region set verification
6404
6405 class VerifyRegionListsClosure : public HeapRegionClosure {
6406 private:
6407 HeapRegionSet* _old_set;
6408 HeapRegionSet* _humongous_set;
6409 HeapRegionManager* _hrm;
6410
6411 public:
6412 HeapRegionSetCount _old_count;
6413 HeapRegionSetCount _humongous_count;
6414 HeapRegionSetCount _free_count;
6415
6416 VerifyRegionListsClosure(HeapRegionSet* old_set,
6417 HeapRegionSet* humongous_set,
6418 HeapRegionManager* hrm) :
6419 _old_set(old_set), _humongous_set(humongous_set), _hrm(hrm),
6420 _old_count(), _humongous_count(), _free_count(){ }
6421
6422 bool doHeapRegion(HeapRegion* hr) {
6423 if (hr->is_continues_humongous()) {
6424 return false;
6425 }
6426
6427 if (hr->is_young()) {
6428 // TODO
6429 } else if (hr->is_starts_humongous()) {
6430 assert(hr->containing_set() == _humongous_set, err_msg("Heap region %u is starts humongous but not in humongous set.", hr->hrm_index()));
6431 _humongous_count.increment(1u, hr->capacity());
6432 } else if (hr->is_empty()) {
6433 assert(_hrm->is_free(hr), err_msg("Heap region %u is empty but not on the free list.", hr->hrm_index()));
6434 _free_count.increment(1u, hr->capacity());
6435 } else if (hr->is_old()) {
6436 assert(hr->containing_set() == _old_set, err_msg("Heap region %u is old but not in the old set.", hr->hrm_index()));
6437 _old_count.increment(1u, hr->capacity());
6438 } else {
6439 ShouldNotReachHere();
6440 }
6441 return false;
6442 }
6443
6444 void verify_counts(HeapRegionSet* old_set, HeapRegionSet* humongous_set, HeapRegionManager* free_list) {
6445 guarantee(old_set->length() == _old_count.length(), err_msg("Old set count mismatch. Expected %u, actual %u.", old_set->length(), _old_count.length()));
6446 guarantee(old_set->total_capacity_bytes() == _old_count.capacity(), err_msg("Old set capacity mismatch. Expected " SIZE_FORMAT ", actual " SIZE_FORMAT,
6447 old_set->total_capacity_bytes(), _old_count.capacity()));
6448
6449 guarantee(humongous_set->length() == _humongous_count.length(), err_msg("Hum set count mismatch. Expected %u, actual %u.", humongous_set->length(), _humongous_count.length()));
6450 guarantee(humongous_set->total_capacity_bytes() == _humongous_count.capacity(), err_msg("Hum set capacity mismatch. Expected " SIZE_FORMAT ", actual " SIZE_FORMAT,
6451 humongous_set->total_capacity_bytes(), _humongous_count.capacity()));
6452
6453 guarantee(free_list->num_free_regions() == _free_count.length(), err_msg("Free list count mismatch. Expected %u, actual %u.", free_list->num_free_regions(), _free_count.length()));
6454 guarantee(free_list->total_capacity_bytes() == _free_count.capacity(), err_msg("Free list capacity mismatch. Expected " SIZE_FORMAT ", actual " SIZE_FORMAT,
6455 free_list->total_capacity_bytes(), _free_count.capacity()));
6456 }
6457 };
6458
6459 void G1CollectedHeap::verify_region_sets() {
6460 assert_heap_locked_or_at_safepoint(true /* should_be_vm_thread */);
6461
6462 // First, check the explicit lists.
6463 _hrm.verify();
6464 {
6465 // Given that a concurrent operation might be adding regions to
6466 // the secondary free list we have to take the lock before
6467 // verifying it.
6468 MutexLockerEx x(SecondaryFreeList_lock, Mutex::_no_safepoint_check_flag);
6469 _secondary_free_list.verify_list();
6470 }
6471
6472 // If a concurrent region freeing operation is in progress it will
6473 // be difficult to correctly attributed any free regions we come
6474 // across to the correct free list given that they might belong to
6475 // one of several (free_list, secondary_free_list, any local lists,
6476 // etc.). So, if that's the case we will skip the rest of the
6477 // verification operation. Alternatively, waiting for the concurrent
6478 // operation to complete will have a non-trivial effect on the GC's
6479 // operation (no concurrent operation will last longer than the
6480 // interval between two calls to verification) and it might hide
6481 // any issues that we would like to catch during testing.
6482 if (free_regions_coming()) {
6483 return;
6484 }
6485
6486 // Make sure we append the secondary_free_list on the free_list so
6487 // that all free regions we will come across can be safely
6488 // attributed to the free_list.
6489 append_secondary_free_list_if_not_empty_with_lock();
6490
6491 // Finally, make sure that the region accounting in the lists is
6492 // consistent with what we see in the heap.
6493
6494 VerifyRegionListsClosure cl(&_old_set, &_humongous_set, &_hrm);
6495 heap_region_iterate(&cl);
6496 cl.verify_counts(&_old_set, &_humongous_set, &_hrm);
6497 }
6498
6499 // Optimized nmethod scanning
6500
6501 class RegisterNMethodOopClosure: public OopClosure {
6502 G1CollectedHeap* _g1h;
6503 nmethod* _nm;
6504
6505 template <class T> void do_oop_work(T* p) {
6506 T heap_oop = oopDesc::load_heap_oop(p);
6507 if (!oopDesc::is_null(heap_oop)) {
6508 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
6509 HeapRegion* hr = _g1h->heap_region_containing(obj);
6510 assert(!hr->is_continues_humongous(),
6511 err_msg("trying to add code root "PTR_FORMAT" in continuation of humongous region "HR_FORMAT
6512 " starting at "HR_FORMAT,
6513 _nm, HR_FORMAT_PARAMS(hr), HR_FORMAT_PARAMS(hr->humongous_start_region())));
6514
6515 // HeapRegion::add_strong_code_root_locked() avoids adding duplicate entries.
6516 hr->add_strong_code_root_locked(_nm);
6517 }
6518 }
6519
6520 public:
6521 RegisterNMethodOopClosure(G1CollectedHeap* g1h, nmethod* nm) :
6522 _g1h(g1h), _nm(nm) {}
6523
6524 void do_oop(oop* p) { do_oop_work(p); }
6525 void do_oop(narrowOop* p) { do_oop_work(p); }
6526 };
6527
6528 class UnregisterNMethodOopClosure: public OopClosure {
6529 G1CollectedHeap* _g1h;
6530 nmethod* _nm;
6531
6532 template <class T> void do_oop_work(T* p) {
6533 T heap_oop = oopDesc::load_heap_oop(p);
6534 if (!oopDesc::is_null(heap_oop)) {
6535 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
6536 HeapRegion* hr = _g1h->heap_region_containing(obj);
6537 assert(!hr->is_continues_humongous(),
6538 err_msg("trying to remove code root "PTR_FORMAT" in continuation of humongous region "HR_FORMAT
6539 " starting at "HR_FORMAT,
6540 _nm, HR_FORMAT_PARAMS(hr), HR_FORMAT_PARAMS(hr->humongous_start_region())));
6541
6542 hr->remove_strong_code_root(_nm);
6543 }
6544 }
6545
6546 public:
6547 UnregisterNMethodOopClosure(G1CollectedHeap* g1h, nmethod* nm) :
6548 _g1h(g1h), _nm(nm) {}
6549
6550 void do_oop(oop* p) { do_oop_work(p); }
6551 void do_oop(narrowOop* p) { do_oop_work(p); }
6552 };
6553
6554 void G1CollectedHeap::register_nmethod(nmethod* nm) {
6555 CollectedHeap::register_nmethod(nm);
6556
6557 guarantee(nm != NULL, "sanity");
6558 RegisterNMethodOopClosure reg_cl(this, nm);
6559 nm->oops_do(®_cl);
6560 }
6561
6562 void G1CollectedHeap::unregister_nmethod(nmethod* nm) {
6563 CollectedHeap::unregister_nmethod(nm);
6564
6565 guarantee(nm != NULL, "sanity");
6566 UnregisterNMethodOopClosure reg_cl(this, nm);
6567 nm->oops_do(®_cl, true);
6568 }
6569
6570 void G1CollectedHeap::purge_code_root_memory() {
6571 double purge_start = os::elapsedTime();
6572 G1CodeRootSet::purge();
6573 double purge_time_ms = (os::elapsedTime() - purge_start) * 1000.0;
6574 g1_policy()->phase_times()->record_strong_code_root_purge_time(purge_time_ms);
6575 }
6576
6577 class RebuildStrongCodeRootClosure: public CodeBlobClosure {
6578 G1CollectedHeap* _g1h;
6579
6580 public:
6581 RebuildStrongCodeRootClosure(G1CollectedHeap* g1h) :
6582 _g1h(g1h) {}
6583
6584 void do_code_blob(CodeBlob* cb) {
6585 nmethod* nm = (cb != NULL) ? cb->as_nmethod_or_null() : NULL;
6586 if (nm == NULL) {
6587 return;
6588 }
6589
6590 if (ScavengeRootsInCode) {
6591 _g1h->register_nmethod(nm);
6592 }
6593 }
6594 };
6595
6596 void G1CollectedHeap::rebuild_strong_code_roots() {
6597 RebuildStrongCodeRootClosure blob_cl(this);
6598 CodeCache::blobs_do(&blob_cl);
6599 }