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 #include "precompiled.hpp"
26 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
27 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
28 #include "gc_implementation/g1/g1ParScanThreadState.inline.hpp"
29 #include "oops/oop.inline.hpp"
30 #include "oops/oop.pcgc.inline.hpp"
31 #include "runtime/prefetch.inline.hpp"
32
33 G1ParScanThreadState::G1ParScanThreadState(G1CollectedHeap* g1h, uint queue_num, ReferenceProcessor* rp)
34 : _g1h(g1h),
35 _refs(g1h->task_queue(queue_num)),
36 _dcq(&g1h->dirty_card_queue_set()),
37 _ct_bs(g1h->g1_barrier_set()),
38 _g1_rem(g1h->g1_rem_set()),
39 _hash_seed(17), _queue_num(queue_num),
40 _term_attempts(0),
41 _tenuring_threshold(g1h->g1_policy()->tenuring_threshold()),
42 _age_table(false), _scanner(g1h, rp),
43 _strong_roots_time(0), _term_time(0) {
44 _scanner.set_par_scan_thread_state(this);
45 // we allocate G1YoungSurvRateNumRegions plus one entries, since
46 // we "sacrifice" entry 0 to keep track of surviving bytes for
47 // non-young regions (where the age is -1)
48 // We also add a few elements at the beginning and at the end in
49 // an attempt to eliminate cache contention
50 uint real_length = 1 + _g1h->g1_policy()->young_cset_region_length();
51 uint array_length = PADDING_ELEM_NUM +
52 real_length +
53 PADDING_ELEM_NUM;
54 _surviving_young_words_base = NEW_C_HEAP_ARRAY(size_t, array_length, mtGC);
55 if (_surviving_young_words_base == NULL)
56 vm_exit_out_of_memory(array_length * sizeof(size_t), OOM_MALLOC_ERROR,
57 "Not enough space for young surv histo.");
58 _surviving_young_words = _surviving_young_words_base + PADDING_ELEM_NUM;
59 memset(_surviving_young_words, 0, (size_t) real_length * sizeof(size_t));
60
61 _g1_par_allocator = G1ParGCAllocator::create_allocator(_g1h);
62
63 _dest[InCSetState::NotInCSet] = InCSetState::NotInCSet;
64 // The dest for Young is used when the objects are aged enough to
65 // need to be moved to the next space.
66 _dest[InCSetState::Young] = InCSetState::Old;
67 _dest[InCSetState::Old] = InCSetState::Old;
68
69 _start = os::elapsedTime();
70 }
71
72 G1ParScanThreadState::~G1ParScanThreadState() {
73 _g1_par_allocator->retire_alloc_buffers();
74 delete _g1_par_allocator;
75 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base);
76 }
77
78 void
79 G1ParScanThreadState::print_termination_stats_hdr(outputStream* const st)
80 {
81 st->print_raw_cr("GC Termination Stats");
82 st->print_raw_cr(" elapsed --strong roots-- -------termination-------"
83 " ------waste (KiB)------");
84 st->print_raw_cr("thr ms ms % ms % attempts"
85 " total alloc undo");
86 st->print_raw_cr("--- --------- --------- ------ --------- ------ --------"
87 " ------- ------- -------");
88 }
89
90 void
91 G1ParScanThreadState::print_termination_stats(int i,
92 outputStream* const st) const
93 {
94 const double elapsed_ms = elapsed_time() * 1000.0;
95 const double s_roots_ms = strong_roots_time() * 1000.0;
96 const double term_ms = term_time() * 1000.0;
97 const size_t alloc_buffer_waste = _g1_par_allocator->alloc_buffer_waste();
98 const size_t undo_waste = _g1_par_allocator->undo_waste();
99 st->print_cr("%3d %9.2f %9.2f %6.2f "
100 "%9.2f %6.2f " SIZE_FORMAT_W(8) " "
101 SIZE_FORMAT_W(7) " " SIZE_FORMAT_W(7) " " SIZE_FORMAT_W(7),
102 i, elapsed_ms, s_roots_ms, s_roots_ms * 100 / elapsed_ms,
103 term_ms, term_ms * 100 / elapsed_ms, term_attempts(),
104 (alloc_buffer_waste + undo_waste) * HeapWordSize / K,
105 alloc_buffer_waste * HeapWordSize / K,
106 undo_waste * HeapWordSize / K);
107 }
108
109 #ifdef ASSERT
110 bool G1ParScanThreadState::verify_ref(narrowOop* ref) const {
111 assert(ref != NULL, "invariant");
112 assert(UseCompressedOops, "sanity");
113 assert(!has_partial_array_mask(ref), err_msg("ref=" PTR_FORMAT, p2i(ref)));
114 oop p = oopDesc::load_decode_heap_oop(ref);
115 assert(_g1h->is_in_g1_reserved(p),
116 err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p)));
117 return true;
118 }
119
120 bool G1ParScanThreadState::verify_ref(oop* ref) const {
121 assert(ref != NULL, "invariant");
122 if (has_partial_array_mask(ref)) {
123 // Must be in the collection set--it's already been copied.
124 oop p = clear_partial_array_mask(ref);
125 assert(_g1h->obj_in_cs(p),
126 err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p)));
127 } else {
128 oop p = oopDesc::load_decode_heap_oop(ref);
129 assert(_g1h->is_in_g1_reserved(p),
130 err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p)));
131 }
132 return true;
133 }
134
135 bool G1ParScanThreadState::verify_task(StarTask ref) const {
136 if (ref.is_narrow()) {
137 return verify_ref((narrowOop*) ref);
138 } else {
139 return verify_ref((oop*) ref);
140 }
141 }
142 #endif // ASSERT
143
144 void G1ParScanThreadState::trim_queue() {
145 assert(_evac_failure_cl != NULL, "not set");
146
147 StarTask ref;
148 do {
149 // Drain the overflow stack first, so other threads can steal.
150 while (_refs->pop_overflow(ref)) {
151 dispatch_reference(ref);
152 }
153
154 while (_refs->pop_local(ref)) {
155 dispatch_reference(ref);
156 }
157 } while (!_refs->is_empty());
158 }
159
160 HeapWord* G1ParScanThreadState::allocate_in_next_plab(InCSetState const state,
161 InCSetState* dest,
162 size_t word_sz,
163 AllocationContext_t const context) {
164 assert(state.is_in_cset_or_humongous(), err_msg("Unexpected state: " CSETSTATE_FORMAT, state.value()));
165 assert(dest->is_in_cset_or_humongous(), err_msg("Unexpected dest: " CSETSTATE_FORMAT, dest->value()));
166
167 // Right now we only have two types of regions (young / old) so
168 // let's keep the logic here simple. We can generalize it when necessary.
169 if (dest->is_young()) {
170 HeapWord* const obj_ptr = _g1_par_allocator->allocate(InCSetState::Old,
171 word_sz, context);
172 if (obj_ptr == NULL) {
173 return NULL;
174 }
175 // Make sure that we won't attempt to copy any other objects out
176 // of a survivor region (given that apparently we cannot allocate
177 // any new ones) to avoid coming into this slow path.
178 _tenuring_threshold = 0;
179 dest->set_old();
180 return obj_ptr;
181 } else {
182 assert(dest->is_old(), err_msg("Unexpected dest: " CSETSTATE_FORMAT, dest->value()));
183 // no other space to try.
184 return NULL;
185 }
186 }
187
188 InCSetState G1ParScanThreadState::next_state(InCSetState const state, markOop const m, uint& age) {
189 if (state.is_young()) {
190 age = !m->has_displaced_mark_helper() ? m->age()
191 : m->displaced_mark_helper()->age();
192 if (age < _tenuring_threshold) {
193 return state;
194 }
195 }
196 return dest(state);
197 }
198
199 oop G1ParScanThreadState::copy_to_survivor_space(InCSetState const state,
200 oop const old,
201 markOop const old_mark) {
202 const size_t word_sz = old->size();
203 HeapRegion* const from_region = _g1h->heap_region_containing_raw(old);
204 // +1 to make the -1 indexes valid...
205 const int young_index = from_region->young_index_in_cset()+1;
206 assert( (from_region->is_young() && young_index > 0) ||
207 (!from_region->is_young() && young_index == 0), "invariant" );
208 const AllocationContext_t context = from_region->allocation_context();
209
210 uint age = 0;
211 InCSetState dest_state = next_state(state, old_mark, age);
212 HeapWord* obj_ptr = _g1_par_allocator->plab_allocate(dest_state, word_sz, context);
213
214 // PLAB allocations should succeed most of the time, so we'll
215 // normally check against NULL once and that's it.
216 if (obj_ptr == NULL) {
217 obj_ptr = _g1_par_allocator->allocate_direct_or_new_plab(dest_state, word_sz, context);
218 if (obj_ptr == NULL) {
219 obj_ptr = allocate_in_next_plab(state, &dest_state, word_sz, context);
220 if (obj_ptr == NULL) {
221 // This will either forward-to-self, or detect that someone else has
222 // installed a forwarding pointer.
223 return _g1h->handle_evacuation_failure_par(this, old);
224 }
225 }
226 }
227
228 assert(obj_ptr != NULL, "when we get here, allocation should have succeeded");
229 #ifndef PRODUCT
230 // Should this evacuation fail?
231 if (_g1h->evacuation_should_fail()) {
232 // Doing this after all the allocation attempts also tests the
233 // undo_allocation() method too.
234 _g1_par_allocator->undo_allocation(dest_state, obj_ptr, word_sz, context);
235 return _g1h->handle_evacuation_failure_par(this, old);
236 }
237 #endif // !PRODUCT
238
239 // We're going to allocate linearly, so might as well prefetch ahead.
240 Prefetch::write(obj_ptr, PrefetchCopyIntervalInBytes);
241
242 const oop obj = oop(obj_ptr);
243 const oop forward_ptr = old->forward_to_atomic(obj);
244 if (forward_ptr == NULL) {
245 Copy::aligned_disjoint_words((HeapWord*) old, obj_ptr, word_sz);
246
247 if (dest_state.is_young()) {
248 if (age < markOopDesc::max_age) {
249 age++;
250 }
251 if (old_mark->has_displaced_mark_helper()) {
252 // In this case, we have to install the mark word first,
253 // otherwise obj looks to be forwarded (the old mark word,
254 // which contains the forward pointer, was copied)
255 obj->set_mark(old_mark);
256 markOop new_mark = old_mark->displaced_mark_helper()->set_age(age);
257 old_mark->set_displaced_mark_helper(new_mark);
258 } else {
259 obj->set_mark(old_mark->set_age(age));
260 }
261 age_table()->add(age, word_sz);
262 } else {
263 obj->set_mark(old_mark);
264 }
265
266 if (G1StringDedup::is_enabled()) {
267 const bool is_from_young = state.is_young();
268 const bool is_to_young = dest_state.is_young();
269 assert(is_from_young == _g1h->heap_region_containing_raw(old)->is_young(),
270 "sanity");
271 assert(is_to_young == _g1h->heap_region_containing_raw(obj)->is_young(),
272 "sanity");
273 G1StringDedup::enqueue_from_evacuation(is_from_young,
274 is_to_young,
275 queue_num(),
276 obj);
277 }
278
279 size_t* const surv_young_words = surviving_young_words();
280 surv_young_words[young_index] += word_sz;
281
282 if (obj->is_objArray() && arrayOop(obj)->length() >= ParGCArrayScanChunk) {
283 // We keep track of the next start index in the length field of
284 // the to-space object. The actual length can be found in the
285 // length field of the from-space object.
286 arrayOop(obj)->set_length(0);
287 oop* old_p = set_partial_array_mask(old);
288 push_on_queue(old_p);
289 } else {
290 HeapRegion* const to_region = _g1h->heap_region_containing_raw(obj_ptr);
291 _scanner.set_region(to_region);
292 obj->oop_iterate_backwards(&_scanner);
293 }
294 return obj;
295 } else {
296 _g1_par_allocator->undo_allocation(dest_state, obj_ptr, word_sz, context);
297 return forward_ptr;
298 }
299 }
|
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 #include "precompiled.hpp"
26 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
27 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
28 #include "gc_implementation/g1/g1ParScanThreadState.inline.hpp"
29 #include "oops/oop.inline.hpp"
30 #include "oops/oop.pcgc.inline.hpp"
31 #include "runtime/prefetch.inline.hpp"
32
33 G1ParScanThreadState::G1ParScanThreadState(G1CollectedHeap* g1h, uint worker_id)
34 : _g1h(g1h),
35 _refs(g1h->task_queue(worker_id)),
36 _dcq(&g1h->dirty_card_queue_set()),
37 _ct_bs(g1h->g1_barrier_set()),
38 _g1_rem(g1h->g1_rem_set()),
39 _hash_seed(17), _worker_id(worker_id),
40 _tenuring_threshold(g1h->g1_policy()->tenuring_threshold()),
41 _age_table(false),
42 _scanner(g1h),
43 _evac_failure_cl(g1h) {
44 _scanner.set_par_scan_thread_state(this);
45 _evac_failure_cl.set_par_scan_thread_state(this);
46 // we allocate G1YoungSurvRateNumRegions plus one entries, since
47 // we "sacrifice" entry 0 to keep track of surviving bytes for
48 // non-young regions (where the age is -1)
49 // We also add a few elements at the beginning and at the end in
50 // an attempt to eliminate cache contention
51 uint real_length = 1 + _g1h->g1_policy()->young_cset_region_length();
52 uint array_length = PADDING_ELEM_NUM +
53 real_length +
54 PADDING_ELEM_NUM;
55 _surviving_young_words_base = NEW_C_HEAP_ARRAY(size_t, array_length, mtGC);
56 if (_surviving_young_words_base == NULL)
57 vm_exit_out_of_memory(array_length * sizeof(size_t), OOM_MALLOC_ERROR,
58 "Not enough space for young surv histo.");
59 _surviving_young_words = _surviving_young_words_base + PADDING_ELEM_NUM;
60 memset(_surviving_young_words, 0, (size_t) real_length * sizeof(size_t));
61
62 _plab_allocator = PLABAllocator::create_allocator(_g1h->_allocator);
63
64 _dest[InCSetState::NotInCSet] = InCSetState::NotInCSet;
65 // The dest for Young is used when the objects are aged enough to
66 // need to be moved to the next space.
67 _dest[InCSetState::Young] = InCSetState::Old;
68 _dest[InCSetState::Old] = InCSetState::Old;
69 }
70
71 G1ParScanThreadState::~G1ParScanThreadState() {
72 _plab_allocator->flush_stats_and_retire();
73 delete _plab_allocator;
74 FREE_C_HEAP_ARRAY(size_t, _surviving_young_words_base);
75 }
76
77 size_t G1ParScanThreadState::lab_waste() const {
78 return _plab_allocator->lab_waste(InCSetState::Young) +
79 _plab_allocator->lab_waste(InCSetState::Old);
80 }
81
82 size_t G1ParScanThreadState::lab_undo_waste() const {
83 return _plab_allocator->lab_undo_waste(InCSetState::Young) +
84 _plab_allocator->lab_undo_waste(InCSetState::Old);
85 }
86
87 #ifdef ASSERT
88 bool G1ParScanThreadState::verify_ref(narrowOop* ref) const {
89 assert(ref != NULL, "invariant");
90 assert(UseCompressedOops, "sanity");
91 assert(!has_partial_array_mask(ref), err_msg("ref=" PTR_FORMAT, p2i(ref)));
92 oop p = oopDesc::load_decode_heap_oop(ref);
93 assert(_g1h->is_in_g1_reserved(p),
94 err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p)));
95 return true;
96 }
97
98 bool G1ParScanThreadState::verify_ref(oop* ref) const {
99 assert(ref != NULL, "invariant");
100 if (has_partial_array_mask(ref)) {
101 // Must be in the collection set--it's already been copied.
102 oop p = clear_partial_array_mask(ref);
103 assert(_g1h->obj_in_cs(p),
104 err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p)));
105 } else {
106 oop p = oopDesc::load_decode_heap_oop(ref);
107 assert(_g1h->is_in_g1_reserved(p),
108 err_msg("ref=" PTR_FORMAT " p=" PTR_FORMAT, p2i(ref), p2i(p)));
109 }
110 return true;
111 }
112
113 bool G1ParScanThreadState::verify_task(StarTask ref) const {
114 if (ref.is_narrow()) {
115 return verify_ref((narrowOop*) ref);
116 } else {
117 return verify_ref((oop*) ref);
118 }
119 }
120 #endif // ASSERT
121
122 void G1ParScanThreadState::trim_queue() {
123 StarTask ref;
124 do {
125 // Drain the overflow stack first, so other threads can steal.
126 while (_refs->pop_overflow(ref)) {
127 dispatch_reference(ref);
128 }
129
130 while (_refs->pop_local(ref)) {
131 dispatch_reference(ref);
132 }
133 } while (!_refs->is_empty());
134 }
135
136 HeapWord* G1ParScanThreadState::allocate_in_next_plab(InCSetState const state,
137 InCSetState* dest,
138 size_t word_sz,
139 AllocationContext_t const context) {
140 assert(state.is_in_cset_or_humongous(), err_msg("Unexpected state: " CSETSTATE_FORMAT, state.value()));
141 assert(dest->is_in_cset_or_humongous(), err_msg("Unexpected dest: " CSETSTATE_FORMAT, dest->value()));
142
143 // Right now we only have two types of regions (young / old) so
144 // let's keep the logic here simple. We can generalize it when necessary.
145 if (dest->is_young()) {
146 HeapWord* const obj_ptr = _plab_allocator->allocate(InCSetState::Old,
147 word_sz,
148 context);
149 if (obj_ptr == NULL) {
150 return NULL;
151 }
152 // Make sure that we won't attempt to copy any other objects out
153 // of a survivor region (given that apparently we cannot allocate
154 // any new ones) to avoid coming into this slow path.
155 _tenuring_threshold = 0;
156 dest->set_old();
157 return obj_ptr;
158 } else {
159 assert(dest->is_old(), err_msg("Unexpected dest: " CSETSTATE_FORMAT, dest->value()));
160 // no other space to try.
161 return NULL;
162 }
163 }
164
165 InCSetState G1ParScanThreadState::next_state(InCSetState const state, markOop const m, uint& age) {
166 if (state.is_young()) {
167 age = !m->has_displaced_mark_helper() ? m->age()
168 : m->displaced_mark_helper()->age();
169 if (age < _tenuring_threshold) {
170 return state;
171 }
172 }
173 return dest(state);
174 }
175
176 oop G1ParScanThreadState::copy_to_survivor_space(InCSetState const state,
177 oop const old,
178 markOop const old_mark) {
179 const size_t word_sz = old->size();
180 HeapRegion* const from_region = _g1h->heap_region_containing_raw(old);
181 // +1 to make the -1 indexes valid...
182 const int young_index = from_region->young_index_in_cset()+1;
183 assert( (from_region->is_young() && young_index > 0) ||
184 (!from_region->is_young() && young_index == 0), "invariant" );
185 const AllocationContext_t context = from_region->allocation_context();
186
187 uint age = 0;
188 InCSetState dest_state = next_state(state, old_mark, age);
189 HeapWord* obj_ptr = _plab_allocator->plab_allocate(dest_state, word_sz, context);
190
191 // PLAB allocations should succeed most of the time, so we'll
192 // normally check against NULL once and that's it.
193 if (obj_ptr == NULL) {
194 obj_ptr = _plab_allocator->allocate_direct_or_new_plab(dest_state, word_sz, context);
195 if (obj_ptr == NULL) {
196 obj_ptr = allocate_in_next_plab(state, &dest_state, word_sz, context);
197 if (obj_ptr == NULL) {
198 // This will either forward-to-self, or detect that someone else has
199 // installed a forwarding pointer.
200 return _g1h->handle_evacuation_failure_par(this, old);
201 }
202 }
203 }
204
205 assert(obj_ptr != NULL, "when we get here, allocation should have succeeded");
206 #ifndef PRODUCT
207 // Should this evacuation fail?
208 if (_g1h->evacuation_should_fail()) {
209 // Doing this after all the allocation attempts also tests the
210 // undo_allocation() method too.
211 _plab_allocator->undo_allocation(dest_state, obj_ptr, word_sz, context);
212 return _g1h->handle_evacuation_failure_par(this, old);
213 }
214 #endif // !PRODUCT
215
216 // We're going to allocate linearly, so might as well prefetch ahead.
217 Prefetch::write(obj_ptr, PrefetchCopyIntervalInBytes);
218
219 const oop obj = oop(obj_ptr);
220 const oop forward_ptr = old->forward_to_atomic(obj);
221 if (forward_ptr == NULL) {
222 Copy::aligned_disjoint_words((HeapWord*) old, obj_ptr, word_sz);
223
224 if (dest_state.is_young()) {
225 if (age < markOopDesc::max_age) {
226 age++;
227 }
228 if (old_mark->has_displaced_mark_helper()) {
229 // In this case, we have to install the mark word first,
230 // otherwise obj looks to be forwarded (the old mark word,
231 // which contains the forward pointer, was copied)
232 obj->set_mark(old_mark);
233 markOop new_mark = old_mark->displaced_mark_helper()->set_age(age);
234 old_mark->set_displaced_mark_helper(new_mark);
235 } else {
236 obj->set_mark(old_mark->set_age(age));
237 }
238 age_table()->add(age, word_sz);
239 } else {
240 obj->set_mark(old_mark);
241 }
242
243 if (G1StringDedup::is_enabled()) {
244 const bool is_from_young = state.is_young();
245 const bool is_to_young = dest_state.is_young();
246 assert(is_from_young == _g1h->heap_region_containing_raw(old)->is_young(),
247 "sanity");
248 assert(is_to_young == _g1h->heap_region_containing_raw(obj)->is_young(),
249 "sanity");
250 G1StringDedup::enqueue_from_evacuation(is_from_young,
251 is_to_young,
252 worker_queue_id(),
253 obj);
254 }
255
256 size_t* const surv_young_words = surviving_young_words();
257 surv_young_words[young_index] += word_sz;
258
259 if (obj->is_objArray() && arrayOop(obj)->length() >= ParGCArrayScanChunk) {
260 // We keep track of the next start index in the length field of
261 // the to-space object. The actual length can be found in the
262 // length field of the from-space object.
263 arrayOop(obj)->set_length(0);
264 oop* old_p = set_partial_array_mask(old);
265 push_on_queue(old_p);
266 } else {
267 HeapRegion* const to_region = _g1h->heap_region_containing_raw(obj_ptr);
268 _scanner.set_region(to_region);
269 obj->oop_iterate_backwards(&_scanner);
270 }
271 return obj;
272 } else {
273 _plab_allocator->undo_allocation(dest_state, obj_ptr, word_sz, context);
274 return forward_ptr;
275 }
276 }
|