20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/g1/g1Allocator.inline.hpp"
27 #include "gc/g1/g1CollectedHeap.inline.hpp"
28 #include "gc/g1/g1CollectionSet.hpp"
29 #include "gc/g1/g1OopClosures.inline.hpp"
30 #include "gc/g1/g1ParScanThreadState.inline.hpp"
31 #include "gc/g1/g1RootClosures.hpp"
32 #include "gc/g1/g1StringDedup.hpp"
33 #include "gc/shared/gcTrace.hpp"
34 #include "gc/shared/taskqueue.inline.hpp"
35 #include "memory/allocation.inline.hpp"
36 #include "oops/access.inline.hpp"
37 #include "oops/oop.inline.hpp"
38 #include "runtime/prefetch.inline.hpp"
39
40 G1ParScanThreadState::G1ParScanThreadState(G1CollectedHeap* g1h, uint worker_id, size_t young_cset_length)
41 : _g1h(g1h),
42 _refs(g1h->task_queue(worker_id)),
43 _dcq(&g1h->dirty_card_queue_set()),
44 _ct(g1h->card_table()),
45 _closures(NULL),
46 _plab_allocator(NULL),
47 _age_table(false),
48 _tenuring_threshold(g1h->g1_policy()->tenuring_threshold()),
49 _scanner(g1h, this),
50 _worker_id(worker_id),
51 _stack_trim_upper_threshold(GCDrainStackTargetSize * 2 + 1),
52 _stack_trim_lower_threshold(GCDrainStackTargetSize),
53 _trim_ticks(),
54 _old_gen_is_full(false)
55 {
56 // we allocate G1YoungSurvRateNumRegions plus one entries, since
57 // we "sacrifice" entry 0 to keep track of surviving bytes for
58 // non-young regions (where the age is -1)
59 // We also add a few elements at the beginning and at the end in
60 // an attempt to eliminate cache contention
61 size_t real_length = 1 + young_cset_length;
62 size_t array_length = PADDING_ELEM_NUM +
63 real_length +
64 PADDING_ELEM_NUM;
65 _surviving_young_words_base = NEW_C_HEAP_ARRAY(size_t, array_length, mtGC);
66 if (_surviving_young_words_base == NULL)
67 vm_exit_out_of_memory(array_length * sizeof(size_t), OOM_MALLOC_ERROR,
68 "Not enough space for young surv histo.");
69 _surviving_young_words = _surviving_young_words_base + PADDING_ELEM_NUM;
70 memset(_surviving_young_words, 0, real_length * sizeof(size_t));
71
72 _plab_allocator = new G1PLABAllocator(_g1h->allocator());
73
74 _dest[InCSetState::NotInCSet] = InCSetState::NotInCSet;
75 // The dest for Young is used when the objects are aged enough to
76 // need to be moved to the next space.
77 _dest[InCSetState::Young] = InCSetState::Old;
78 _dest[InCSetState::Old] = InCSetState::Old;
79
80 _closures = G1EvacuationRootClosures::create_root_closures(this, _g1h);
81 }
82
83 // Pass locally gathered statistics to global state.
84 void G1ParScanThreadState::flush(size_t* surviving_young_words) {
85 _dcq.flush();
86 // Update allocation statistics.
87 _plab_allocator->flush_and_retire_stats();
88 _g1h->g1_policy()->record_age_table(&_age_table);
89
90 uint length = _g1h->collection_set()->young_region_length();
91 for (uint region_index = 0; region_index < length; region_index++) {
92 surviving_young_words[region_index] += _surviving_young_words[region_index];
93 }
94 }
95
96 G1ParScanThreadState::~G1ParScanThreadState() {
97 delete _plab_allocator;
98 delete _closures;
99 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base);
100 }
101
102 void G1ParScanThreadState::waste(size_t& wasted, size_t& undo_wasted) {
103 _plab_allocator->waste(wasted, undo_wasted);
104 }
105
106 #ifdef ASSERT
107 bool G1ParScanThreadState::verify_ref(narrowOop* ref) const {
108 assert(ref != NULL, "invariant");
109 assert(UseCompressedOops, "sanity");
110 assert(!has_partial_array_mask(ref), "ref=" PTR_FORMAT, p2i(ref));
111 oop p = RawAccess<>::oop_load(ref);
112 assert(_g1h->is_in_g1_reserved(p),
113 "ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p));
114 return true;
115 }
116
117 bool G1ParScanThreadState::verify_ref(oop* ref) const {
118 assert(ref != NULL, "invariant");
119 if (has_partial_array_mask(ref)) {
307 // We keep track of the next start index in the length field of
308 // the to-space object. The actual length can be found in the
309 // length field of the from-space object.
310 arrayOop(obj)->set_length(0);
311 oop* old_p = set_partial_array_mask(old);
312 do_oop_partial_array(old_p);
313 } else {
314 G1ScanInYoungSetter x(&_scanner, dest_state.is_young());
315 obj->oop_iterate_backwards(&_scanner);
316 }
317 return obj;
318 } else {
319 _plab_allocator->undo_allocation(dest_state, obj_ptr, word_sz);
320 return forward_ptr;
321 }
322 }
323
324 G1ParScanThreadState* G1ParScanThreadStateSet::state_for_worker(uint worker_id) {
325 assert(worker_id < _n_workers, "out of bounds access");
326 if (_states[worker_id] == NULL) {
327 _states[worker_id] = new G1ParScanThreadState(_g1h, worker_id, _young_cset_length);
328 }
329 return _states[worker_id];
330 }
331
332 const size_t* G1ParScanThreadStateSet::surviving_young_words() const {
333 assert(_flushed, "thread local state from the per thread states should have been flushed");
334 return _surviving_young_words_total;
335 }
336
337 void G1ParScanThreadStateSet::flush() {
338 assert(!_flushed, "thread local state from the per thread states should be flushed once");
339
340 for (uint worker_index = 0; worker_index < _n_workers; ++worker_index) {
341 G1ParScanThreadState* pss = _states[worker_index];
342
343 if (pss == NULL) {
344 continue;
345 }
346
347 pss->flush(_surviving_young_words_total);
348 delete pss;
349 _states[worker_index] = NULL;
350 }
351 _flushed = true;
352 }
353
354 oop G1ParScanThreadState::handle_evacuation_failure_par(oop old, markOop m) {
355 assert(_g1h->is_in_cset(old), "Object " PTR_FORMAT " should be in the CSet", p2i(old));
356
357 oop forward_ptr = old->forward_to_atomic(old, m, memory_order_relaxed);
358 if (forward_ptr == NULL) {
359 // Forward-to-self succeeded. We are the "owner" of the object.
360 HeapRegion* r = _g1h->heap_region_containing(old);
361
362 if (!r->evacuation_failed()) {
363 r->set_evacuation_failed(true);
364 _g1h->hr_printer()->evac_failure(r);
365 }
366
367 _g1h->preserve_mark_during_evac_failure(_worker_id, old, m);
368
369 G1ScanInYoungSetter x(&_scanner, r->is_young());
370 old->oop_iterate_backwards(&_scanner);
371
372 return old;
373 } else {
374 // Forward-to-self failed. Either someone else managed to allocate
375 // space for this object (old != forward_ptr) or they beat us in
376 // self-forwarding it (old == forward_ptr).
377 assert(old == forward_ptr || !_g1h->is_in_cset(forward_ptr),
378 "Object " PTR_FORMAT " forwarded to: " PTR_FORMAT " "
379 "should not be in the CSet",
380 p2i(old), p2i(forward_ptr));
381 return forward_ptr;
382 }
383 }
384 G1ParScanThreadStateSet::G1ParScanThreadStateSet(G1CollectedHeap* g1h, uint n_workers, size_t young_cset_length) :
385 _g1h(g1h),
386 _states(NEW_C_HEAP_ARRAY(G1ParScanThreadState*, n_workers, mtGC)),
387 _surviving_young_words_total(NEW_C_HEAP_ARRAY(size_t, young_cset_length, mtGC)),
388 _young_cset_length(young_cset_length),
389 _n_workers(n_workers),
390 _flushed(false) {
391 for (uint i = 0; i < n_workers; ++i) {
392 _states[i] = NULL;
393 }
394 memset(_surviving_young_words_total, 0, young_cset_length * sizeof(size_t));
395 }
396
397 G1ParScanThreadStateSet::~G1ParScanThreadStateSet() {
398 assert(_flushed, "thread local state from the per thread states should have been flushed");
399 FREE_C_HEAP_ARRAY(G1ParScanThreadState*, _states);
400 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_total);
401 }
|
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/g1/g1Allocator.inline.hpp"
27 #include "gc/g1/g1CollectedHeap.inline.hpp"
28 #include "gc/g1/g1CollectionSet.hpp"
29 #include "gc/g1/g1OopClosures.inline.hpp"
30 #include "gc/g1/g1ParScanThreadState.inline.hpp"
31 #include "gc/g1/g1RootClosures.hpp"
32 #include "gc/g1/g1StringDedup.hpp"
33 #include "gc/shared/gcTrace.hpp"
34 #include "gc/shared/taskqueue.inline.hpp"
35 #include "memory/allocation.inline.hpp"
36 #include "oops/access.inline.hpp"
37 #include "oops/oop.inline.hpp"
38 #include "runtime/prefetch.inline.hpp"
39
40 G1ParScanThreadState::G1ParScanThreadState(G1CollectedHeap* g1h,
41 uint worker_id,
42 size_t young_cset_length,
43 size_t optional_cset_length)
44 : _g1h(g1h),
45 _refs(g1h->task_queue(worker_id)),
46 _dcq(&g1h->dirty_card_queue_set()),
47 _ct(g1h->card_table()),
48 _closures(NULL),
49 _plab_allocator(NULL),
50 _age_table(false),
51 _tenuring_threshold(g1h->g1_policy()->tenuring_threshold()),
52 _scanner(g1h, this),
53 _worker_id(worker_id),
54 _stack_trim_upper_threshold(GCDrainStackTargetSize * 2 + 1),
55 _stack_trim_lower_threshold(GCDrainStackTargetSize),
56 _trim_ticks(),
57 _old_gen_is_full(false),
58 _num_optional_regions(optional_cset_length)
59 {
60 // we allocate G1YoungSurvRateNumRegions plus one entries, since
61 // we "sacrifice" entry 0 to keep track of surviving bytes for
62 // non-young regions (where the age is -1)
63 // We also add a few elements at the beginning and at the end in
64 // an attempt to eliminate cache contention
65 size_t real_length = 1 + young_cset_length;
66 size_t array_length = PADDING_ELEM_NUM +
67 real_length +
68 PADDING_ELEM_NUM;
69 _surviving_young_words_base = NEW_C_HEAP_ARRAY(size_t, array_length, mtGC);
70 if (_surviving_young_words_base == NULL)
71 vm_exit_out_of_memory(array_length * sizeof(size_t), OOM_MALLOC_ERROR,
72 "Not enough space for young surv histo.");
73 _surviving_young_words = _surviving_young_words_base + PADDING_ELEM_NUM;
74 memset(_surviving_young_words, 0, real_length * sizeof(size_t));
75
76 _plab_allocator = new G1PLABAllocator(_g1h->allocator());
77
78 _dest[InCSetState::NotInCSet] = InCSetState::NotInCSet;
79 // The dest for Young is used when the objects are aged enough to
80 // need to be moved to the next space.
81 _dest[InCSetState::Young] = InCSetState::Old;
82 _dest[InCSetState::Old] = InCSetState::Old;
83
84 _closures = G1EvacuationRootClosures::create_root_closures(this, _g1h);
85
86 _oops_into_optional_regions = new G1OopStarChunkedList[_num_optional_regions];
87 }
88
89 // Pass locally gathered statistics to global state.
90 void G1ParScanThreadState::flush(size_t* surviving_young_words) {
91 _dcq.flush();
92 // Update allocation statistics.
93 _plab_allocator->flush_and_retire_stats();
94 _g1h->g1_policy()->record_age_table(&_age_table);
95
96 uint length = _g1h->collection_set()->young_region_length();
97 for (uint region_index = 0; region_index < length; region_index++) {
98 surviving_young_words[region_index] += _surviving_young_words[region_index];
99 }
100 }
101
102 G1ParScanThreadState::~G1ParScanThreadState() {
103 delete _plab_allocator;
104 delete _closures;
105 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base);
106 delete[] _oops_into_optional_regions;
107 }
108
109 void G1ParScanThreadState::waste(size_t& wasted, size_t& undo_wasted) {
110 _plab_allocator->waste(wasted, undo_wasted);
111 }
112
113 #ifdef ASSERT
114 bool G1ParScanThreadState::verify_ref(narrowOop* ref) const {
115 assert(ref != NULL, "invariant");
116 assert(UseCompressedOops, "sanity");
117 assert(!has_partial_array_mask(ref), "ref=" PTR_FORMAT, p2i(ref));
118 oop p = RawAccess<>::oop_load(ref);
119 assert(_g1h->is_in_g1_reserved(p),
120 "ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p));
121 return true;
122 }
123
124 bool G1ParScanThreadState::verify_ref(oop* ref) const {
125 assert(ref != NULL, "invariant");
126 if (has_partial_array_mask(ref)) {
314 // We keep track of the next start index in the length field of
315 // the to-space object. The actual length can be found in the
316 // length field of the from-space object.
317 arrayOop(obj)->set_length(0);
318 oop* old_p = set_partial_array_mask(old);
319 do_oop_partial_array(old_p);
320 } else {
321 G1ScanInYoungSetter x(&_scanner, dest_state.is_young());
322 obj->oop_iterate_backwards(&_scanner);
323 }
324 return obj;
325 } else {
326 _plab_allocator->undo_allocation(dest_state, obj_ptr, word_sz);
327 return forward_ptr;
328 }
329 }
330
331 G1ParScanThreadState* G1ParScanThreadStateSet::state_for_worker(uint worker_id) {
332 assert(worker_id < _n_workers, "out of bounds access");
333 if (_states[worker_id] == NULL) {
334 _states[worker_id] =
335 new G1ParScanThreadState(_g1h, worker_id, _young_cset_length, _optional_cset_length);
336 }
337 return _states[worker_id];
338 }
339
340 const size_t* G1ParScanThreadStateSet::surviving_young_words() const {
341 assert(_flushed, "thread local state from the per thread states should have been flushed");
342 return _surviving_young_words_total;
343 }
344
345 void G1ParScanThreadStateSet::flush() {
346 assert(!_flushed, "thread local state from the per thread states should be flushed once");
347
348 for (uint worker_index = 0; worker_index < _n_workers; ++worker_index) {
349 G1ParScanThreadState* pss = _states[worker_index];
350
351 if (pss == NULL) {
352 continue;
353 }
354
355 pss->flush(_surviving_young_words_total);
356 delete pss;
357 _states[worker_index] = NULL;
358 }
359 _flushed = true;
360 }
361
362 void G1ParScanThreadStateSet::record_unused_optional_region(HeapRegion* hr) {
363 for (uint worker_index = 0; worker_index < _n_workers; ++worker_index) {
364 G1ParScanThreadState* pss = _states[worker_index];
365
366 if (pss == NULL) {
367 continue;
368 }
369
370 size_t used_memory = pss->oops_into_optional_region(hr)->used_memory();
371 _g1h->g1_policy()->phase_times()->record_or_add_thread_work_item(G1GCPhaseTimes::OptScanRS, worker_index, used_memory, G1GCPhaseTimes::OptCSetUsedMemory);
372 }
373 }
374
375 oop G1ParScanThreadState::handle_evacuation_failure_par(oop old, markOop m) {
376 assert(_g1h->is_in_cset(old), "Object " PTR_FORMAT " should be in the CSet", p2i(old));
377
378 oop forward_ptr = old->forward_to_atomic(old, m, memory_order_relaxed);
379 if (forward_ptr == NULL) {
380 // Forward-to-self succeeded. We are the "owner" of the object.
381 HeapRegion* r = _g1h->heap_region_containing(old);
382
383 if (!r->evacuation_failed()) {
384 r->set_evacuation_failed(true);
385 _g1h->hr_printer()->evac_failure(r);
386 }
387
388 _g1h->preserve_mark_during_evac_failure(_worker_id, old, m);
389
390 G1ScanInYoungSetter x(&_scanner, r->is_young());
391 old->oop_iterate_backwards(&_scanner);
392
393 return old;
394 } else {
395 // Forward-to-self failed. Either someone else managed to allocate
396 // space for this object (old != forward_ptr) or they beat us in
397 // self-forwarding it (old == forward_ptr).
398 assert(old == forward_ptr || !_g1h->is_in_cset(forward_ptr),
399 "Object " PTR_FORMAT " forwarded to: " PTR_FORMAT " "
400 "should not be in the CSet",
401 p2i(old), p2i(forward_ptr));
402 return forward_ptr;
403 }
404 }
405 G1ParScanThreadStateSet::G1ParScanThreadStateSet(G1CollectedHeap* g1h,
406 uint n_workers,
407 size_t young_cset_length,
408 size_t optional_cset_length) :
409 _g1h(g1h),
410 _states(NEW_C_HEAP_ARRAY(G1ParScanThreadState*, n_workers, mtGC)),
411 _surviving_young_words_total(NEW_C_HEAP_ARRAY(size_t, young_cset_length, mtGC)),
412 _young_cset_length(young_cset_length),
413 _optional_cset_length(optional_cset_length),
414 _n_workers(n_workers),
415 _flushed(false) {
416 for (uint i = 0; i < n_workers; ++i) {
417 _states[i] = NULL;
418 }
419 memset(_surviving_young_words_total, 0, young_cset_length * sizeof(size_t));
420 }
421
422 G1ParScanThreadStateSet::~G1ParScanThreadStateSet() {
423 assert(_flushed, "thread local state from the per thread states should have been flushed");
424 FREE_C_HEAP_ARRAY(G1ParScanThreadState*, _states);
425 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_total);
426 }
|