1374
|
1 |
/*
|
|
2 |
* Copyright 2001-2007 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
20 |
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
21 |
* have any questions.
|
|
22 |
*
|
|
23 |
*/
|
|
24 |
|
|
25 |
#include "incls/_precompiled.incl"
|
|
26 |
#include "incls/_g1RemSet.cpp.incl"
|
|
27 |
|
|
28 |
#define CARD_REPEAT_HISTO 0
|
|
29 |
|
|
30 |
#if CARD_REPEAT_HISTO
|
|
31 |
static size_t ct_freq_sz;
|
|
32 |
static jbyte* ct_freq = NULL;
|
|
33 |
|
|
34 |
void init_ct_freq_table(size_t heap_sz_bytes) {
|
|
35 |
if (ct_freq == NULL) {
|
|
36 |
ct_freq_sz = heap_sz_bytes/CardTableModRefBS::card_size;
|
|
37 |
ct_freq = new jbyte[ct_freq_sz];
|
|
38 |
for (size_t j = 0; j < ct_freq_sz; j++) ct_freq[j] = 0;
|
|
39 |
}
|
|
40 |
}
|
|
41 |
|
|
42 |
void ct_freq_note_card(size_t index) {
|
|
43 |
assert(0 <= index && index < ct_freq_sz, "Bounds error.");
|
|
44 |
if (ct_freq[index] < 100) { ct_freq[index]++; }
|
|
45 |
}
|
|
46 |
|
|
47 |
static IntHistogram card_repeat_count(10, 10);
|
|
48 |
|
|
49 |
void ct_freq_update_histo_and_reset() {
|
|
50 |
for (size_t j = 0; j < ct_freq_sz; j++) {
|
|
51 |
card_repeat_count.add_entry(ct_freq[j]);
|
|
52 |
ct_freq[j] = 0;
|
|
53 |
}
|
|
54 |
|
|
55 |
}
|
|
56 |
#endif
|
|
57 |
|
|
58 |
|
|
59 |
class IntoCSOopClosure: public OopsInHeapRegionClosure {
|
|
60 |
OopsInHeapRegionClosure* _blk;
|
|
61 |
G1CollectedHeap* _g1;
|
|
62 |
public:
|
|
63 |
IntoCSOopClosure(G1CollectedHeap* g1, OopsInHeapRegionClosure* blk) :
|
|
64 |
_g1(g1), _blk(blk) {}
|
|
65 |
void set_region(HeapRegion* from) {
|
|
66 |
_blk->set_region(from);
|
|
67 |
}
|
|
68 |
virtual void do_oop(narrowOop* p) {
|
|
69 |
guarantee(false, "NYI");
|
|
70 |
}
|
|
71 |
virtual void do_oop(oop* p) {
|
|
72 |
oop obj = *p;
|
|
73 |
if (_g1->obj_in_cs(obj)) _blk->do_oop(p);
|
|
74 |
}
|
|
75 |
bool apply_to_weak_ref_discovered_field() { return true; }
|
|
76 |
bool idempotent() { return true; }
|
|
77 |
};
|
|
78 |
|
|
79 |
class IntoCSRegionClosure: public HeapRegionClosure {
|
|
80 |
IntoCSOopClosure _blk;
|
|
81 |
G1CollectedHeap* _g1;
|
|
82 |
public:
|
|
83 |
IntoCSRegionClosure(G1CollectedHeap* g1, OopsInHeapRegionClosure* blk) :
|
|
84 |
_g1(g1), _blk(g1, blk) {}
|
|
85 |
bool doHeapRegion(HeapRegion* r) {
|
|
86 |
if (!r->in_collection_set()) {
|
|
87 |
_blk.set_region(r);
|
|
88 |
if (r->isHumongous()) {
|
|
89 |
if (r->startsHumongous()) {
|
|
90 |
oop obj = oop(r->bottom());
|
|
91 |
obj->oop_iterate(&_blk);
|
|
92 |
}
|
|
93 |
} else {
|
|
94 |
r->oop_before_save_marks_iterate(&_blk);
|
|
95 |
}
|
|
96 |
}
|
|
97 |
return false;
|
|
98 |
}
|
|
99 |
};
|
|
100 |
|
|
101 |
void
|
|
102 |
StupidG1RemSet::oops_into_collection_set_do(OopsInHeapRegionClosure* oc,
|
|
103 |
int worker_i) {
|
|
104 |
IntoCSRegionClosure rc(_g1, oc);
|
|
105 |
_g1->heap_region_iterate(&rc);
|
|
106 |
}
|
|
107 |
|
|
108 |
class UpdateRSOopClosure: public OopClosure {
|
|
109 |
HeapRegion* _from;
|
|
110 |
HRInto_G1RemSet* _rs;
|
|
111 |
int _worker_i;
|
|
112 |
public:
|
|
113 |
UpdateRSOopClosure(HRInto_G1RemSet* rs, int worker_i = 0) :
|
|
114 |
_from(NULL), _rs(rs), _worker_i(worker_i) {
|
|
115 |
guarantee(_rs != NULL, "Requires an HRIntoG1RemSet");
|
|
116 |
}
|
|
117 |
|
|
118 |
void set_from(HeapRegion* from) {
|
|
119 |
assert(from != NULL, "from region must be non-NULL");
|
|
120 |
_from = from;
|
|
121 |
}
|
|
122 |
|
|
123 |
virtual void do_oop(narrowOop* p) {
|
|
124 |
guarantee(false, "NYI");
|
|
125 |
}
|
|
126 |
virtual void do_oop(oop* p) {
|
|
127 |
assert(_from != NULL, "from region must be non-NULL");
|
|
128 |
_rs->par_write_ref(_from, p, _worker_i);
|
|
129 |
}
|
|
130 |
// Override: this closure is idempotent.
|
|
131 |
// bool idempotent() { return true; }
|
|
132 |
bool apply_to_weak_ref_discovered_field() { return true; }
|
|
133 |
};
|
|
134 |
|
|
135 |
class UpdateRSOutOfRegionClosure: public HeapRegionClosure {
|
|
136 |
G1CollectedHeap* _g1h;
|
|
137 |
ModRefBarrierSet* _mr_bs;
|
|
138 |
UpdateRSOopClosure _cl;
|
|
139 |
int _worker_i;
|
|
140 |
public:
|
|
141 |
UpdateRSOutOfRegionClosure(G1CollectedHeap* g1, int worker_i = 0) :
|
|
142 |
_cl(g1->g1_rem_set()->as_HRInto_G1RemSet(), worker_i),
|
|
143 |
_mr_bs(g1->mr_bs()),
|
|
144 |
_worker_i(worker_i),
|
|
145 |
_g1h(g1)
|
|
146 |
{}
|
|
147 |
bool doHeapRegion(HeapRegion* r) {
|
|
148 |
if (!r->in_collection_set() && !r->continuesHumongous()) {
|
|
149 |
_cl.set_from(r);
|
|
150 |
r->set_next_filter_kind(HeapRegionDCTOC::OutOfRegionFilterKind);
|
|
151 |
_mr_bs->mod_oop_in_space_iterate(r, &_cl, true, true);
|
|
152 |
}
|
|
153 |
return false;
|
|
154 |
}
|
|
155 |
};
|
|
156 |
|
|
157 |
class VerifyRSCleanCardOopClosure: public OopClosure {
|
|
158 |
G1CollectedHeap* _g1;
|
|
159 |
public:
|
|
160 |
VerifyRSCleanCardOopClosure(G1CollectedHeap* g1) : _g1(g1) {}
|
|
161 |
|
|
162 |
virtual void do_oop(narrowOop* p) {
|
|
163 |
guarantee(false, "NYI");
|
|
164 |
}
|
|
165 |
virtual void do_oop(oop* p) {
|
|
166 |
oop obj = *p;
|
|
167 |
HeapRegion* to = _g1->heap_region_containing(obj);
|
|
168 |
guarantee(to == NULL || !to->in_collection_set(),
|
|
169 |
"Missed a rem set member.");
|
|
170 |
}
|
|
171 |
};
|
|
172 |
|
|
173 |
HRInto_G1RemSet::HRInto_G1RemSet(G1CollectedHeap* g1, CardTableModRefBS* ct_bs)
|
|
174 |
: G1RemSet(g1), _ct_bs(ct_bs), _g1p(_g1->g1_policy()),
|
|
175 |
_cg1r(g1->concurrent_g1_refine()),
|
|
176 |
_par_traversal_in_progress(false), _new_refs(NULL),
|
|
177 |
_cards_scanned(NULL), _total_cards_scanned(0)
|
|
178 |
{
|
|
179 |
_seq_task = new SubTasksDone(NumSeqTasks);
|
|
180 |
_new_refs = NEW_C_HEAP_ARRAY(GrowableArray<oop*>*, ParallelGCThreads);
|
|
181 |
}
|
|
182 |
|
|
183 |
HRInto_G1RemSet::~HRInto_G1RemSet() {
|
|
184 |
delete _seq_task;
|
|
185 |
}
|
|
186 |
|
|
187 |
void CountNonCleanMemRegionClosure::do_MemRegion(MemRegion mr) {
|
|
188 |
if (_g1->is_in_g1_reserved(mr.start())) {
|
|
189 |
_n += (int) ((mr.byte_size() / CardTableModRefBS::card_size));
|
|
190 |
if (_start_first == NULL) _start_first = mr.start();
|
|
191 |
}
|
|
192 |
}
|
|
193 |
|
|
194 |
class ScanRSClosure : public HeapRegionClosure {
|
|
195 |
size_t _cards_done, _cards;
|
|
196 |
G1CollectedHeap* _g1h;
|
|
197 |
OopsInHeapRegionClosure* _oc;
|
|
198 |
G1BlockOffsetSharedArray* _bot_shared;
|
|
199 |
CardTableModRefBS *_ct_bs;
|
|
200 |
int _worker_i;
|
|
201 |
bool _try_claimed;
|
|
202 |
public:
|
|
203 |
ScanRSClosure(OopsInHeapRegionClosure* oc, int worker_i) :
|
|
204 |
_oc(oc),
|
|
205 |
_cards(0),
|
|
206 |
_cards_done(0),
|
|
207 |
_worker_i(worker_i),
|
|
208 |
_try_claimed(false)
|
|
209 |
{
|
|
210 |
_g1h = G1CollectedHeap::heap();
|
|
211 |
_bot_shared = _g1h->bot_shared();
|
|
212 |
_ct_bs = (CardTableModRefBS*) (_g1h->barrier_set());
|
|
213 |
}
|
|
214 |
|
|
215 |
void set_try_claimed() { _try_claimed = true; }
|
|
216 |
|
|
217 |
void scanCard(size_t index, HeapRegion *r) {
|
|
218 |
_cards_done++;
|
|
219 |
DirtyCardToOopClosure* cl =
|
|
220 |
r->new_dcto_closure(_oc,
|
|
221 |
CardTableModRefBS::Precise,
|
|
222 |
HeapRegionDCTOC::IntoCSFilterKind);
|
|
223 |
|
|
224 |
// Set the "from" region in the closure.
|
|
225 |
_oc->set_region(r);
|
|
226 |
HeapWord* card_start = _bot_shared->address_for_index(index);
|
|
227 |
HeapWord* card_end = card_start + G1BlockOffsetSharedArray::N_words;
|
|
228 |
Space *sp = SharedHeap::heap()->space_containing(card_start);
|
|
229 |
MemRegion sm_region;
|
|
230 |
if (ParallelGCThreads > 0) {
|
|
231 |
// first find the used area
|
|
232 |
sm_region = sp->used_region_at_save_marks();
|
|
233 |
} else {
|
|
234 |
// The closure is not idempotent. We shouldn't look at objects
|
|
235 |
// allocated during the GC.
|
|
236 |
sm_region = sp->used_region_at_save_marks();
|
|
237 |
}
|
|
238 |
MemRegion mr = sm_region.intersection(MemRegion(card_start,card_end));
|
|
239 |
if (!mr.is_empty()) {
|
|
240 |
cl->do_MemRegion(mr);
|
|
241 |
}
|
|
242 |
}
|
|
243 |
|
|
244 |
void printCard(HeapRegion* card_region, size_t card_index,
|
|
245 |
HeapWord* card_start) {
|
|
246 |
gclog_or_tty->print_cr("T %d Region [" PTR_FORMAT ", " PTR_FORMAT ") "
|
|
247 |
"RS names card %p: "
|
|
248 |
"[" PTR_FORMAT ", " PTR_FORMAT ")",
|
|
249 |
_worker_i,
|
|
250 |
card_region->bottom(), card_region->end(),
|
|
251 |
card_index,
|
|
252 |
card_start, card_start + G1BlockOffsetSharedArray::N_words);
|
|
253 |
}
|
|
254 |
|
|
255 |
bool doHeapRegion(HeapRegion* r) {
|
|
256 |
assert(r->in_collection_set(), "should only be called on elements of CS.");
|
|
257 |
HeapRegionRemSet* hrrs = r->rem_set();
|
|
258 |
if (hrrs->iter_is_complete()) return false; // All done.
|
|
259 |
if (!_try_claimed && !hrrs->claim_iter()) return false;
|
|
260 |
// If we didn't return above, then
|
|
261 |
// _try_claimed || r->claim_iter()
|
|
262 |
// is true: either we're supposed to work on claimed-but-not-complete
|
|
263 |
// regions, or we successfully claimed the region.
|
|
264 |
HeapRegionRemSetIterator* iter = _g1h->rem_set_iterator(_worker_i);
|
|
265 |
hrrs->init_iterator(iter);
|
|
266 |
size_t card_index;
|
|
267 |
while (iter->has_next(card_index)) {
|
|
268 |
HeapWord* card_start = _g1h->bot_shared()->address_for_index(card_index);
|
|
269 |
|
|
270 |
#if 0
|
|
271 |
gclog_or_tty->print("Rem set iteration yielded card [" PTR_FORMAT ", " PTR_FORMAT ").\n",
|
|
272 |
card_start, card_start + CardTableModRefBS::card_size_in_words);
|
|
273 |
#endif
|
|
274 |
|
|
275 |
HeapRegion* card_region = _g1h->heap_region_containing(card_start);
|
|
276 |
assert(card_region != NULL, "Yielding cards not in the heap?");
|
|
277 |
_cards++;
|
|
278 |
|
|
279 |
if (!card_region->in_collection_set()) {
|
|
280 |
// If the card is dirty, then we will scan it during updateRS.
|
|
281 |
if (!_ct_bs->is_card_claimed(card_index) &&
|
|
282 |
!_ct_bs->is_card_dirty(card_index)) {
|
|
283 |
assert(_ct_bs->is_card_clean(card_index) ||
|
|
284 |
_ct_bs->is_card_claimed(card_index),
|
|
285 |
"Card is either dirty, clean, or claimed");
|
|
286 |
if (_ct_bs->claim_card(card_index))
|
|
287 |
scanCard(card_index, card_region);
|
|
288 |
}
|
|
289 |
}
|
|
290 |
}
|
|
291 |
hrrs->set_iter_complete();
|
|
292 |
return false;
|
|
293 |
}
|
|
294 |
// Set all cards back to clean.
|
|
295 |
void cleanup() {_g1h->cleanUpCardTable();}
|
|
296 |
size_t cards_done() { return _cards_done;}
|
|
297 |
size_t cards_looked_up() { return _cards;}
|
|
298 |
};
|
|
299 |
|
|
300 |
// We want the parallel threads to start their scanning at
|
|
301 |
// different collection set regions to avoid contention.
|
|
302 |
// If we have:
|
|
303 |
// n collection set regions
|
|
304 |
// p threads
|
|
305 |
// Then thread t will start at region t * floor (n/p)
|
|
306 |
|
|
307 |
HeapRegion* HRInto_G1RemSet::calculateStartRegion(int worker_i) {
|
|
308 |
HeapRegion* result = _g1p->collection_set();
|
|
309 |
if (ParallelGCThreads > 0) {
|
|
310 |
size_t cs_size = _g1p->collection_set_size();
|
|
311 |
int n_workers = _g1->workers()->total_workers();
|
|
312 |
size_t cs_spans = cs_size / n_workers;
|
|
313 |
size_t ind = cs_spans * worker_i;
|
|
314 |
for (size_t i = 0; i < ind; i++)
|
|
315 |
result = result->next_in_collection_set();
|
|
316 |
}
|
|
317 |
return result;
|
|
318 |
}
|
|
319 |
|
|
320 |
void HRInto_G1RemSet::scanRS(OopsInHeapRegionClosure* oc, int worker_i) {
|
|
321 |
double rs_time_start = os::elapsedTime();
|
|
322 |
HeapRegion *startRegion = calculateStartRegion(worker_i);
|
|
323 |
|
|
324 |
BufferingOopsInHeapRegionClosure boc(oc);
|
|
325 |
ScanRSClosure scanRScl(&boc, worker_i);
|
|
326 |
_g1->collection_set_iterate_from(startRegion, &scanRScl);
|
|
327 |
scanRScl.set_try_claimed();
|
|
328 |
_g1->collection_set_iterate_from(startRegion, &scanRScl);
|
|
329 |
|
|
330 |
boc.done();
|
|
331 |
double closure_app_time_sec = boc.closure_app_seconds();
|
|
332 |
double scan_rs_time_sec = (os::elapsedTime() - rs_time_start) -
|
|
333 |
closure_app_time_sec;
|
|
334 |
double closure_app_time_ms = closure_app_time_sec * 1000.0;
|
|
335 |
|
|
336 |
assert( _cards_scanned != NULL, "invariant" );
|
|
337 |
_cards_scanned[worker_i] = scanRScl.cards_done();
|
|
338 |
|
|
339 |
_g1p->record_scan_rs_start_time(worker_i, rs_time_start * 1000.0);
|
|
340 |
_g1p->record_scan_rs_time(worker_i, scan_rs_time_sec * 1000.0);
|
|
341 |
if (ParallelGCThreads > 0) {
|
|
342 |
// In this case, we called scanNewRefsRS and recorded the corresponding
|
|
343 |
// time.
|
|
344 |
double scan_new_refs_time_ms = _g1p->get_scan_new_refs_time(worker_i);
|
|
345 |
if (scan_new_refs_time_ms > 0.0) {
|
|
346 |
closure_app_time_ms += scan_new_refs_time_ms;
|
|
347 |
}
|
|
348 |
}
|
|
349 |
_g1p->record_obj_copy_time(worker_i, closure_app_time_ms);
|
|
350 |
}
|
|
351 |
|
|
352 |
void HRInto_G1RemSet::updateRS(int worker_i) {
|
|
353 |
ConcurrentG1Refine* cg1r = _g1->concurrent_g1_refine();
|
|
354 |
|
|
355 |
double start = os::elapsedTime();
|
|
356 |
_g1p->record_update_rs_start_time(worker_i, start * 1000.0);
|
|
357 |
|
|
358 |
if (G1RSBarrierUseQueue && !cg1r->do_traversal()) {
|
|
359 |
// Apply the appropriate closure to all remaining log entries.
|
|
360 |
_g1->iterate_dirty_card_closure(false, worker_i);
|
|
361 |
// Now there should be no dirty cards.
|
|
362 |
if (G1RSLogCheckCardTable) {
|
|
363 |
CountNonCleanMemRegionClosure cl(_g1);
|
|
364 |
_ct_bs->mod_card_iterate(&cl);
|
|
365 |
// XXX This isn't true any more: keeping cards of young regions
|
|
366 |
// marked dirty broke it. Need some reasonable fix.
|
|
367 |
guarantee(cl.n() == 0, "Card table should be clean.");
|
|
368 |
}
|
|
369 |
} else {
|
|
370 |
UpdateRSOutOfRegionClosure update_rs(_g1, worker_i);
|
|
371 |
_g1->heap_region_iterate(&update_rs);
|
|
372 |
// We did a traversal; no further one is necessary.
|
|
373 |
if (G1RSBarrierUseQueue) {
|
|
374 |
assert(cg1r->do_traversal(), "Or we shouldn't have gotten here.");
|
|
375 |
cg1r->set_pya_cancel();
|
|
376 |
}
|
|
377 |
if (_cg1r->use_cache()) {
|
|
378 |
_cg1r->clear_and_record_card_counts();
|
|
379 |
_cg1r->clear_hot_cache();
|
|
380 |
}
|
|
381 |
}
|
|
382 |
_g1p->record_update_rs_time(worker_i, (os::elapsedTime() - start) * 1000.0);
|
|
383 |
}
|
|
384 |
|
|
385 |
#ifndef PRODUCT
|
|
386 |
class PrintRSClosure : public HeapRegionClosure {
|
|
387 |
int _count;
|
|
388 |
public:
|
|
389 |
PrintRSClosure() : _count(0) {}
|
|
390 |
bool doHeapRegion(HeapRegion* r) {
|
|
391 |
HeapRegionRemSet* hrrs = r->rem_set();
|
|
392 |
_count += (int) hrrs->occupied();
|
|
393 |
if (hrrs->occupied() == 0) {
|
|
394 |
gclog_or_tty->print("Heap Region [" PTR_FORMAT ", " PTR_FORMAT ") "
|
|
395 |
"has no remset entries\n",
|
|
396 |
r->bottom(), r->end());
|
|
397 |
} else {
|
|
398 |
gclog_or_tty->print("Printing rem set for heap region [" PTR_FORMAT ", " PTR_FORMAT ")\n",
|
|
399 |
r->bottom(), r->end());
|
|
400 |
r->print();
|
|
401 |
hrrs->print();
|
|
402 |
gclog_or_tty->print("\nDone printing rem set\n");
|
|
403 |
}
|
|
404 |
return false;
|
|
405 |
}
|
|
406 |
int occupied() {return _count;}
|
|
407 |
};
|
|
408 |
#endif
|
|
409 |
|
|
410 |
class CountRSSizeClosure: public HeapRegionClosure {
|
|
411 |
size_t _n;
|
|
412 |
size_t _tot;
|
|
413 |
size_t _max;
|
|
414 |
HeapRegion* _max_r;
|
|
415 |
enum {
|
|
416 |
N = 20,
|
|
417 |
MIN = 6
|
|
418 |
};
|
|
419 |
int _histo[N];
|
|
420 |
public:
|
|
421 |
CountRSSizeClosure() : _n(0), _tot(0), _max(0), _max_r(NULL) {
|
|
422 |
for (int i = 0; i < N; i++) _histo[i] = 0;
|
|
423 |
}
|
|
424 |
bool doHeapRegion(HeapRegion* r) {
|
|
425 |
if (!r->continuesHumongous()) {
|
|
426 |
size_t occ = r->rem_set()->occupied();
|
|
427 |
_n++;
|
|
428 |
_tot += occ;
|
|
429 |
if (occ > _max) {
|
|
430 |
_max = occ;
|
|
431 |
_max_r = r;
|
|
432 |
}
|
|
433 |
// Fit it into a histo bin.
|
|
434 |
int s = 1 << MIN;
|
|
435 |
int i = 0;
|
|
436 |
while (occ > (size_t) s && i < (N-1)) {
|
|
437 |
s = s << 1;
|
|
438 |
i++;
|
|
439 |
}
|
|
440 |
_histo[i]++;
|
|
441 |
}
|
|
442 |
return false;
|
|
443 |
}
|
|
444 |
size_t n() { return _n; }
|
|
445 |
size_t tot() { return _tot; }
|
|
446 |
size_t mx() { return _max; }
|
|
447 |
HeapRegion* mxr() { return _max_r; }
|
|
448 |
void print_histo() {
|
|
449 |
int mx = N;
|
|
450 |
while (mx >= 0) {
|
|
451 |
if (_histo[mx-1] > 0) break;
|
|
452 |
mx--;
|
|
453 |
}
|
|
454 |
gclog_or_tty->print_cr("Number of regions with given RS sizes:");
|
|
455 |
gclog_or_tty->print_cr(" <= %8d %8d", 1 << MIN, _histo[0]);
|
|
456 |
for (int i = 1; i < mx-1; i++) {
|
|
457 |
gclog_or_tty->print_cr(" %8d - %8d %8d",
|
|
458 |
(1 << (MIN + i - 1)) + 1,
|
|
459 |
1 << (MIN + i),
|
|
460 |
_histo[i]);
|
|
461 |
}
|
|
462 |
gclog_or_tty->print_cr(" > %8d %8d", (1 << (MIN+mx-2))+1, _histo[mx-1]);
|
|
463 |
}
|
|
464 |
};
|
|
465 |
|
|
466 |
void
|
|
467 |
HRInto_G1RemSet::scanNewRefsRS(OopsInHeapRegionClosure* oc,
|
|
468 |
int worker_i) {
|
|
469 |
double scan_new_refs_start_sec = os::elapsedTime();
|
|
470 |
G1CollectedHeap* g1h = G1CollectedHeap::heap();
|
|
471 |
CardTableModRefBS* ct_bs = (CardTableModRefBS*) (g1h->barrier_set());
|
|
472 |
while (_new_refs[worker_i]->is_nonempty()) {
|
|
473 |
oop* p = _new_refs[worker_i]->pop();
|
|
474 |
oop obj = *p;
|
|
475 |
// *p was in the collection set when p was pushed on "_new_refs", but
|
|
476 |
// another thread may have processed this location from an RS, so it
|
|
477 |
// might not point into the CS any longer. If so, it's obviously been
|
|
478 |
// processed, and we don't need to do anything further.
|
|
479 |
if (g1h->obj_in_cs(obj)) {
|
|
480 |
HeapRegion* r = g1h->heap_region_containing(p);
|
|
481 |
|
|
482 |
DEBUG_ONLY(HeapRegion* to = g1h->heap_region_containing(obj));
|
|
483 |
assert(ParallelGCThreads > 1
|
|
484 |
|| to->rem_set()->contains_reference(p),
|
|
485 |
"Invariant: pushed after being added."
|
|
486 |
"(Not reliable in parallel code.)");
|
|
487 |
oc->set_region(r);
|
|
488 |
// If "p" has already been processed concurrently, this is
|
|
489 |
// idempotent.
|
|
490 |
oc->do_oop(p);
|
|
491 |
}
|
|
492 |
}
|
|
493 |
_g1p->record_scan_new_refs_time(worker_i,
|
|
494 |
(os::elapsedTime() - scan_new_refs_start_sec)
|
|
495 |
* 1000.0);
|
|
496 |
}
|
|
497 |
|
|
498 |
void HRInto_G1RemSet::set_par_traversal(bool b) {
|
|
499 |
_par_traversal_in_progress = b;
|
|
500 |
HeapRegionRemSet::set_par_traversal(b);
|
|
501 |
}
|
|
502 |
|
|
503 |
void HRInto_G1RemSet::cleanupHRRS() {
|
|
504 |
HeapRegionRemSet::cleanup();
|
|
505 |
}
|
|
506 |
|
|
507 |
void
|
|
508 |
HRInto_G1RemSet::oops_into_collection_set_do(OopsInHeapRegionClosure* oc,
|
|
509 |
int worker_i) {
|
|
510 |
#if CARD_REPEAT_HISTO
|
|
511 |
ct_freq_update_histo_and_reset();
|
|
512 |
#endif
|
|
513 |
if (worker_i == 0) {
|
|
514 |
_cg1r->clear_and_record_card_counts();
|
|
515 |
}
|
|
516 |
|
|
517 |
// Make this into a command-line flag...
|
|
518 |
if (G1RSCountHisto && (ParallelGCThreads == 0 || worker_i == 0)) {
|
|
519 |
CountRSSizeClosure count_cl;
|
|
520 |
_g1->heap_region_iterate(&count_cl);
|
|
521 |
gclog_or_tty->print_cr("Avg of %d RS counts is %f, max is %d, "
|
|
522 |
"max region is " PTR_FORMAT,
|
|
523 |
count_cl.n(), (float)count_cl.tot()/(float)count_cl.n(),
|
|
524 |
count_cl.mx(), count_cl.mxr());
|
|
525 |
count_cl.print_histo();
|
|
526 |
}
|
|
527 |
|
|
528 |
if (ParallelGCThreads > 0) {
|
|
529 |
// This is a temporary change to serialize the update and scanning
|
|
530 |
// of remembered sets. There are some race conditions when this is
|
|
531 |
// done in parallel and they are causing failures. When we resolve
|
|
532 |
// said race conditions, we'll revert back to parallel remembered
|
|
533 |
// set updating and scanning. See CRs 6677707 and 6677708.
|
|
534 |
if (worker_i == 0) {
|
|
535 |
updateRS(worker_i);
|
|
536 |
scanNewRefsRS(oc, worker_i);
|
|
537 |
scanRS(oc, worker_i);
|
|
538 |
}
|
|
539 |
} else {
|
|
540 |
assert(worker_i == 0, "invariant");
|
|
541 |
|
|
542 |
updateRS(0);
|
|
543 |
scanRS(oc, 0);
|
|
544 |
}
|
|
545 |
}
|
|
546 |
|
|
547 |
void HRInto_G1RemSet::
|
|
548 |
prepare_for_oops_into_collection_set_do() {
|
|
549 |
#if G1_REM_SET_LOGGING
|
|
550 |
PrintRSClosure cl;
|
|
551 |
_g1->collection_set_iterate(&cl);
|
|
552 |
#endif
|
|
553 |
cleanupHRRS();
|
|
554 |
ConcurrentG1Refine* cg1r = _g1->concurrent_g1_refine();
|
|
555 |
_g1->set_refine_cte_cl_concurrency(false);
|
|
556 |
DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
|
|
557 |
dcqs.concatenate_logs();
|
|
558 |
|
|
559 |
assert(!_par_traversal_in_progress, "Invariant between iterations.");
|
|
560 |
if (ParallelGCThreads > 0) {
|
|
561 |
set_par_traversal(true);
|
|
562 |
int n_workers = _g1->workers()->total_workers();
|
|
563 |
_seq_task->set_par_threads(n_workers);
|
|
564 |
for (uint i = 0; i < ParallelGCThreads; i++)
|
|
565 |
_new_refs[i] = new (ResourceObj::C_HEAP) GrowableArray<oop*>(8192,true);
|
|
566 |
|
|
567 |
if (cg1r->do_traversal()) {
|
|
568 |
updateRS(0);
|
|
569 |
// Have to do this again after updaters
|
|
570 |
cleanupHRRS();
|
|
571 |
}
|
|
572 |
}
|
|
573 |
guarantee( _cards_scanned == NULL, "invariant" );
|
|
574 |
_cards_scanned = NEW_C_HEAP_ARRAY(size_t, n_workers());
|
2009
|
575 |
for (uint i = 0; i < n_workers(); ++i) {
|
|
576 |
_cards_scanned[i] = 0;
|
|
577 |
}
|
1374
|
578 |
_total_cards_scanned = 0;
|
|
579 |
}
|
|
580 |
|
|
581 |
|
|
582 |
class cleanUpIteratorsClosure : public HeapRegionClosure {
|
|
583 |
bool doHeapRegion(HeapRegion *r) {
|
|
584 |
HeapRegionRemSet* hrrs = r->rem_set();
|
|
585 |
hrrs->init_for_par_iteration();
|
|
586 |
return false;
|
|
587 |
}
|
|
588 |
};
|
|
589 |
|
|
590 |
void HRInto_G1RemSet::cleanup_after_oops_into_collection_set_do() {
|
|
591 |
guarantee( _cards_scanned != NULL, "invariant" );
|
|
592 |
_total_cards_scanned = 0;
|
|
593 |
for (uint i = 0; i < n_workers(); ++i)
|
|
594 |
_total_cards_scanned += _cards_scanned[i];
|
|
595 |
FREE_C_HEAP_ARRAY(size_t, _cards_scanned);
|
|
596 |
_cards_scanned = NULL;
|
|
597 |
// Cleanup after copy
|
|
598 |
#if G1_REM_SET_LOGGING
|
|
599 |
PrintRSClosure cl;
|
|
600 |
_g1->heap_region_iterate(&cl);
|
|
601 |
#endif
|
|
602 |
_g1->set_refine_cte_cl_concurrency(true);
|
|
603 |
cleanUpIteratorsClosure iterClosure;
|
|
604 |
_g1->collection_set_iterate(&iterClosure);
|
|
605 |
// Set all cards back to clean.
|
|
606 |
_g1->cleanUpCardTable();
|
|
607 |
if (ParallelGCThreads > 0) {
|
|
608 |
ConcurrentG1Refine* cg1r = _g1->concurrent_g1_refine();
|
|
609 |
if (cg1r->do_traversal()) {
|
|
610 |
cg1r->cg1rThread()->set_do_traversal(false);
|
|
611 |
}
|
|
612 |
for (uint i = 0; i < ParallelGCThreads; i++) {
|
|
613 |
delete _new_refs[i];
|
|
614 |
}
|
|
615 |
set_par_traversal(false);
|
|
616 |
}
|
|
617 |
assert(!_par_traversal_in_progress, "Invariant between iterations.");
|
|
618 |
}
|
|
619 |
|
|
620 |
class UpdateRSObjectClosure: public ObjectClosure {
|
|
621 |
UpdateRSOopClosure* _update_rs_oop_cl;
|
|
622 |
public:
|
|
623 |
UpdateRSObjectClosure(UpdateRSOopClosure* update_rs_oop_cl) :
|
|
624 |
_update_rs_oop_cl(update_rs_oop_cl) {}
|
|
625 |
void do_object(oop obj) {
|
|
626 |
obj->oop_iterate(_update_rs_oop_cl);
|
|
627 |
}
|
|
628 |
|
|
629 |
};
|
|
630 |
|
|
631 |
class ScrubRSClosure: public HeapRegionClosure {
|
|
632 |
G1CollectedHeap* _g1h;
|
|
633 |
BitMap* _region_bm;
|
|
634 |
BitMap* _card_bm;
|
|
635 |
CardTableModRefBS* _ctbs;
|
|
636 |
public:
|
|
637 |
ScrubRSClosure(BitMap* region_bm, BitMap* card_bm) :
|
|
638 |
_g1h(G1CollectedHeap::heap()),
|
|
639 |
_region_bm(region_bm), _card_bm(card_bm),
|
|
640 |
_ctbs(NULL)
|
|
641 |
{
|
|
642 |
ModRefBarrierSet* bs = _g1h->mr_bs();
|
|
643 |
guarantee(bs->is_a(BarrierSet::CardTableModRef), "Precondition");
|
|
644 |
_ctbs = (CardTableModRefBS*)bs;
|
|
645 |
}
|
|
646 |
|
|
647 |
bool doHeapRegion(HeapRegion* r) {
|
|
648 |
if (!r->continuesHumongous()) {
|
|
649 |
r->rem_set()->scrub(_ctbs, _region_bm, _card_bm);
|
|
650 |
}
|
|
651 |
return false;
|
|
652 |
}
|
|
653 |
};
|
|
654 |
|
|
655 |
void HRInto_G1RemSet::scrub(BitMap* region_bm, BitMap* card_bm) {
|
|
656 |
ScrubRSClosure scrub_cl(region_bm, card_bm);
|
|
657 |
_g1->heap_region_iterate(&scrub_cl);
|
|
658 |
}
|
|
659 |
|
|
660 |
void HRInto_G1RemSet::scrub_par(BitMap* region_bm, BitMap* card_bm,
|
|
661 |
int worker_num, int claim_val) {
|
|
662 |
ScrubRSClosure scrub_cl(region_bm, card_bm);
|
|
663 |
_g1->heap_region_par_iterate_chunked(&scrub_cl, worker_num, claim_val);
|
|
664 |
}
|
|
665 |
|
|
666 |
|
|
667 |
class ConcRefineRegionClosure: public HeapRegionClosure {
|
|
668 |
G1CollectedHeap* _g1h;
|
|
669 |
CardTableModRefBS* _ctbs;
|
|
670 |
ConcurrentGCThread* _cgc_thrd;
|
|
671 |
ConcurrentG1Refine* _cg1r;
|
|
672 |
unsigned _cards_processed;
|
|
673 |
UpdateRSOopClosure _update_rs_oop_cl;
|
|
674 |
public:
|
|
675 |
ConcRefineRegionClosure(CardTableModRefBS* ctbs,
|
|
676 |
ConcurrentG1Refine* cg1r,
|
|
677 |
HRInto_G1RemSet* g1rs) :
|
|
678 |
_ctbs(ctbs), _cg1r(cg1r), _cgc_thrd(cg1r->cg1rThread()),
|
|
679 |
_update_rs_oop_cl(g1rs), _cards_processed(0),
|
|
680 |
_g1h(G1CollectedHeap::heap())
|
|
681 |
{}
|
|
682 |
|
|
683 |
bool doHeapRegion(HeapRegion* r) {
|
|
684 |
if (!r->in_collection_set() &&
|
|
685 |
!r->continuesHumongous() &&
|
|
686 |
!r->is_young()) {
|
|
687 |
_update_rs_oop_cl.set_from(r);
|
|
688 |
UpdateRSObjectClosure update_rs_obj_cl(&_update_rs_oop_cl);
|
|
689 |
|
|
690 |
// For each run of dirty card in the region:
|
|
691 |
// 1) Clear the cards.
|
|
692 |
// 2) Process the range corresponding to the run, adding any
|
|
693 |
// necessary RS entries.
|
|
694 |
// 1 must precede 2, so that a concurrent modification redirties the
|
|
695 |
// card. If a processing attempt does not succeed, because it runs
|
|
696 |
// into an unparseable region, we will do binary search to find the
|
|
697 |
// beginning of the next parseable region.
|
|
698 |
HeapWord* startAddr = r->bottom();
|
|
699 |
HeapWord* endAddr = r->used_region().end();
|
|
700 |
HeapWord* lastAddr;
|
|
701 |
HeapWord* nextAddr;
|
|
702 |
|
|
703 |
for (nextAddr = lastAddr = startAddr;
|
|
704 |
nextAddr < endAddr;
|
|
705 |
nextAddr = lastAddr) {
|
|
706 |
MemRegion dirtyRegion;
|
|
707 |
|
|
708 |
// Get and clear dirty region from card table
|
|
709 |
MemRegion next_mr(nextAddr, endAddr);
|
|
710 |
dirtyRegion =
|
|
711 |
_ctbs->dirty_card_range_after_reset(
|
|
712 |
next_mr,
|
|
713 |
true, CardTableModRefBS::clean_card_val());
|
|
714 |
assert(dirtyRegion.start() >= nextAddr,
|
|
715 |
"returned region inconsistent?");
|
|
716 |
|
|
717 |
if (!dirtyRegion.is_empty()) {
|
|
718 |
HeapWord* stop_point =
|
|
719 |
r->object_iterate_mem_careful(dirtyRegion,
|
|
720 |
&update_rs_obj_cl);
|
|
721 |
if (stop_point == NULL) {
|
|
722 |
lastAddr = dirtyRegion.end();
|
|
723 |
_cards_processed +=
|
|
724 |
(int) (dirtyRegion.word_size() / CardTableModRefBS::card_size_in_words);
|
|
725 |
} else {
|
|
726 |
// We're going to skip one or more cards that we can't parse.
|
|
727 |
HeapWord* next_parseable_card =
|
|
728 |
r->next_block_start_careful(stop_point);
|
|
729 |
// Round this up to a card boundary.
|
|
730 |
next_parseable_card =
|
|
731 |
_ctbs->addr_for(_ctbs->byte_after_const(next_parseable_card));
|
|
732 |
// Now we invalidate the intervening cards so we'll see them
|
|
733 |
// again.
|
|
734 |
MemRegion remaining_dirty =
|
|
735 |
MemRegion(stop_point, dirtyRegion.end());
|
|
736 |
MemRegion skipped =
|
|
737 |
MemRegion(stop_point, next_parseable_card);
|
|
738 |
_ctbs->invalidate(skipped.intersection(remaining_dirty));
|
|
739 |
|
|
740 |
// Now start up again where we can parse.
|
|
741 |
lastAddr = next_parseable_card;
|
|
742 |
|
|
743 |
// Count how many we did completely.
|
|
744 |
_cards_processed +=
|
|
745 |
(stop_point - dirtyRegion.start()) /
|
|
746 |
CardTableModRefBS::card_size_in_words;
|
|
747 |
}
|
|
748 |
// Allow interruption at regular intervals.
|
|
749 |
// (Might need to make them more regular, if we get big
|
|
750 |
// dirty regions.)
|
|
751 |
if (_cgc_thrd != NULL) {
|
|
752 |
if (_cgc_thrd->should_yield()) {
|
|
753 |
_cgc_thrd->yield();
|
|
754 |
switch (_cg1r->get_pya()) {
|
|
755 |
case PYA_continue:
|
|
756 |
// This may have changed: re-read.
|
|
757 |
endAddr = r->used_region().end();
|
|
758 |
continue;
|
|
759 |
case PYA_restart: case PYA_cancel:
|
|
760 |
return true;
|
|
761 |
}
|
|
762 |
}
|
|
763 |
}
|
|
764 |
} else {
|
|
765 |
break;
|
|
766 |
}
|
|
767 |
}
|
|
768 |
}
|
|
769 |
// A good yield opportunity.
|
|
770 |
if (_cgc_thrd != NULL) {
|
|
771 |
if (_cgc_thrd->should_yield()) {
|
|
772 |
_cgc_thrd->yield();
|
|
773 |
switch (_cg1r->get_pya()) {
|
|
774 |
case PYA_restart: case PYA_cancel:
|
|
775 |
return true;
|
|
776 |
default:
|
|
777 |
break;
|
|
778 |
}
|
|
779 |
|
|
780 |
}
|
|
781 |
}
|
|
782 |
return false;
|
|
783 |
}
|
|
784 |
|
|
785 |
unsigned cards_processed() { return _cards_processed; }
|
|
786 |
};
|
|
787 |
|
|
788 |
|
|
789 |
void HRInto_G1RemSet::concurrentRefinementPass(ConcurrentG1Refine* cg1r) {
|
|
790 |
ConcRefineRegionClosure cr_cl(ct_bs(), cg1r, this);
|
|
791 |
_g1->heap_region_iterate(&cr_cl);
|
|
792 |
_conc_refine_traversals++;
|
|
793 |
_conc_refine_cards += cr_cl.cards_processed();
|
|
794 |
}
|
|
795 |
|
|
796 |
static IntHistogram out_of_histo(50, 50);
|
|
797 |
|
|
798 |
|
|
799 |
|
|
800 |
void HRInto_G1RemSet::concurrentRefineOneCard(jbyte* card_ptr, int worker_i) {
|
|
801 |
// If the card is no longer dirty, nothing to do.
|
|
802 |
if (*card_ptr != CardTableModRefBS::dirty_card_val()) return;
|
|
803 |
|
|
804 |
// Construct the region representing the card.
|
|
805 |
HeapWord* start = _ct_bs->addr_for(card_ptr);
|
|
806 |
// And find the region containing it.
|
|
807 |
HeapRegion* r = _g1->heap_region_containing(start);
|
|
808 |
if (r == NULL) {
|
|
809 |
guarantee(_g1->is_in_permanent(start), "Or else where?");
|
|
810 |
return; // Not in the G1 heap (might be in perm, for example.)
|
|
811 |
}
|
|
812 |
// Why do we have to check here whether a card is on a young region,
|
|
813 |
// given that we dirty young regions and, as a result, the
|
|
814 |
// post-barrier is supposed to filter them out and never to enqueue
|
|
815 |
// them? When we allocate a new region as the "allocation region" we
|
|
816 |
// actually dirty its cards after we release the lock, since card
|
|
817 |
// dirtying while holding the lock was a performance bottleneck. So,
|
|
818 |
// as a result, it is possible for other threads to actually
|
|
819 |
// allocate objects in the region (after the acquire the lock)
|
|
820 |
// before all the cards on the region are dirtied. This is unlikely,
|
|
821 |
// and it doesn't happen often, but it can happen. So, the extra
|
|
822 |
// check below filters out those cards.
|
|
823 |
if (r->is_young()) {
|
|
824 |
return;
|
|
825 |
}
|
|
826 |
// While we are processing RSet buffers during the collection, we
|
|
827 |
// actually don't want to scan any cards on the collection set,
|
|
828 |
// since we don't want to update remebered sets with entries that
|
|
829 |
// point into the collection set, given that live objects from the
|
|
830 |
// collection set are about to move and such entries will be stale
|
|
831 |
// very soon. This change also deals with a reliability issue which
|
|
832 |
// involves scanning a card in the collection set and coming across
|
|
833 |
// an array that was being chunked and looking malformed. Note,
|
|
834 |
// however, that if evacuation fails, we have to scan any objects
|
|
835 |
// that were not moved and create any missing entries.
|
|
836 |
if (r->in_collection_set()) {
|
|
837 |
return;
|
|
838 |
}
|
|
839 |
|
|
840 |
// Should we defer it?
|
|
841 |
if (_cg1r->use_cache()) {
|
|
842 |
card_ptr = _cg1r->cache_insert(card_ptr);
|
|
843 |
// If it was not an eviction, nothing to do.
|
|
844 |
if (card_ptr == NULL) return;
|
|
845 |
|
|
846 |
// OK, we have to reset the card start, region, etc.
|
|
847 |
start = _ct_bs->addr_for(card_ptr);
|
|
848 |
r = _g1->heap_region_containing(start);
|
|
849 |
if (r == NULL) {
|
|
850 |
guarantee(_g1->is_in_permanent(start), "Or else where?");
|
|
851 |
return; // Not in the G1 heap (might be in perm, for example.)
|
|
852 |
}
|
|
853 |
guarantee(!r->is_young(), "It was evicted in the current minor cycle.");
|
|
854 |
}
|
|
855 |
|
|
856 |
HeapWord* end = _ct_bs->addr_for(card_ptr + 1);
|
|
857 |
MemRegion dirtyRegion(start, end);
|
|
858 |
|
|
859 |
#if CARD_REPEAT_HISTO
|
|
860 |
init_ct_freq_table(_g1->g1_reserved_obj_bytes());
|
|
861 |
ct_freq_note_card(_ct_bs->index_for(start));
|
|
862 |
#endif
|
|
863 |
|
|
864 |
UpdateRSOopClosure update_rs_oop_cl(this, worker_i);
|
|
865 |
update_rs_oop_cl.set_from(r);
|
|
866 |
FilterOutOfRegionClosure filter_then_update_rs_oop_cl(r, &update_rs_oop_cl);
|
|
867 |
|
|
868 |
// Undirty the card.
|
|
869 |
*card_ptr = CardTableModRefBS::clean_card_val();
|
|
870 |
// We must complete this write before we do any of the reads below.
|
|
871 |
OrderAccess::storeload();
|
|
872 |
// And process it, being careful of unallocated portions of TLAB's.
|
|
873 |
HeapWord* stop_point =
|
|
874 |
r->oops_on_card_seq_iterate_careful(dirtyRegion,
|
|
875 |
&filter_then_update_rs_oop_cl);
|
|
876 |
// If stop_point is non-null, then we encountered an unallocated region
|
|
877 |
// (perhaps the unfilled portion of a TLAB.) For now, we'll dirty the
|
|
878 |
// card and re-enqueue: if we put off the card until a GC pause, then the
|
|
879 |
// unallocated portion will be filled in. Alternatively, we might try
|
|
880 |
// the full complexity of the technique used in "regular" precleaning.
|
|
881 |
if (stop_point != NULL) {
|
|
882 |
// The card might have gotten re-dirtied and re-enqueued while we
|
|
883 |
// worked. (In fact, it's pretty likely.)
|
|
884 |
if (*card_ptr != CardTableModRefBS::dirty_card_val()) {
|
|
885 |
*card_ptr = CardTableModRefBS::dirty_card_val();
|
|
886 |
MutexLockerEx x(Shared_DirtyCardQ_lock,
|
|
887 |
Mutex::_no_safepoint_check_flag);
|
|
888 |
DirtyCardQueue* sdcq =
|
|
889 |
JavaThread::dirty_card_queue_set().shared_dirty_card_queue();
|
|
890 |
sdcq->enqueue(card_ptr);
|
|
891 |
}
|
|
892 |
} else {
|
|
893 |
out_of_histo.add_entry(filter_then_update_rs_oop_cl.out_of_region());
|
|
894 |
_conc_refine_cards++;
|
|
895 |
}
|
|
896 |
}
|
|
897 |
|
|
898 |
class HRRSStatsIter: public HeapRegionClosure {
|
|
899 |
size_t _occupied;
|
|
900 |
size_t _total_mem_sz;
|
|
901 |
size_t _max_mem_sz;
|
|
902 |
HeapRegion* _max_mem_sz_region;
|
|
903 |
public:
|
|
904 |
HRRSStatsIter() :
|
|
905 |
_occupied(0),
|
|
906 |
_total_mem_sz(0),
|
|
907 |
_max_mem_sz(0),
|
|
908 |
_max_mem_sz_region(NULL)
|
|
909 |
{}
|
|
910 |
|
|
911 |
bool doHeapRegion(HeapRegion* r) {
|
|
912 |
if (r->continuesHumongous()) return false;
|
|
913 |
size_t mem_sz = r->rem_set()->mem_size();
|
|
914 |
if (mem_sz > _max_mem_sz) {
|
|
915 |
_max_mem_sz = mem_sz;
|
|
916 |
_max_mem_sz_region = r;
|
|
917 |
}
|
|
918 |
_total_mem_sz += mem_sz;
|
|
919 |
size_t occ = r->rem_set()->occupied();
|
|
920 |
_occupied += occ;
|
|
921 |
return false;
|
|
922 |
}
|
|
923 |
size_t total_mem_sz() { return _total_mem_sz; }
|
|
924 |
size_t max_mem_sz() { return _max_mem_sz; }
|
|
925 |
size_t occupied() { return _occupied; }
|
|
926 |
HeapRegion* max_mem_sz_region() { return _max_mem_sz_region; }
|
|
927 |
};
|
|
928 |
|
|
929 |
void HRInto_G1RemSet::print_summary_info() {
|
|
930 |
G1CollectedHeap* g1 = G1CollectedHeap::heap();
|
|
931 |
ConcurrentG1RefineThread* cg1r_thrd =
|
|
932 |
g1->concurrent_g1_refine()->cg1rThread();
|
|
933 |
|
|
934 |
#if CARD_REPEAT_HISTO
|
|
935 |
gclog_or_tty->print_cr("\nG1 card_repeat count histogram: ");
|
|
936 |
gclog_or_tty->print_cr(" # of repeats --> # of cards with that number.");
|
|
937 |
card_repeat_count.print_on(gclog_or_tty);
|
|
938 |
#endif
|
|
939 |
|
|
940 |
if (FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT) {
|
|
941 |
gclog_or_tty->print_cr("\nG1 rem-set out-of-region histogram: ");
|
|
942 |
gclog_or_tty->print_cr(" # of CS ptrs --> # of cards with that number.");
|
|
943 |
out_of_histo.print_on(gclog_or_tty);
|
|
944 |
}
|
|
945 |
gclog_or_tty->print_cr("\n Concurrent RS processed %d cards in "
|
|
946 |
"%5.2fs.",
|
|
947 |
_conc_refine_cards, cg1r_thrd->vtime_accum());
|
|
948 |
|
|
949 |
DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
|
|
950 |
jint tot_processed_buffers =
|
|
951 |
dcqs.processed_buffers_mut() + dcqs.processed_buffers_rs_thread();
|
|
952 |
gclog_or_tty->print_cr(" Of %d completed buffers:", tot_processed_buffers);
|
|
953 |
gclog_or_tty->print_cr(" %8d (%5.1f%%) by conc RS thread.",
|
|
954 |
dcqs.processed_buffers_rs_thread(),
|
|
955 |
100.0*(float)dcqs.processed_buffers_rs_thread()/
|
|
956 |
(float)tot_processed_buffers);
|
|
957 |
gclog_or_tty->print_cr(" %8d (%5.1f%%) by mutator threads.",
|
|
958 |
dcqs.processed_buffers_mut(),
|
|
959 |
100.0*(float)dcqs.processed_buffers_mut()/
|
|
960 |
(float)tot_processed_buffers);
|
|
961 |
gclog_or_tty->print_cr(" Did %d concurrent refinement traversals.",
|
|
962 |
_conc_refine_traversals);
|
|
963 |
if (!G1RSBarrierUseQueue) {
|
|
964 |
gclog_or_tty->print_cr(" Scanned %8.2f cards/traversal.",
|
|
965 |
_conc_refine_traversals > 0 ?
|
|
966 |
(float)_conc_refine_cards/(float)_conc_refine_traversals :
|
|
967 |
0);
|
|
968 |
}
|
|
969 |
gclog_or_tty->print_cr("");
|
|
970 |
if (G1UseHRIntoRS) {
|
|
971 |
HRRSStatsIter blk;
|
|
972 |
g1->heap_region_iterate(&blk);
|
|
973 |
gclog_or_tty->print_cr(" Total heap region rem set sizes = " SIZE_FORMAT "K."
|
|
974 |
" Max = " SIZE_FORMAT "K.",
|
|
975 |
blk.total_mem_sz()/K, blk.max_mem_sz()/K);
|
|
976 |
gclog_or_tty->print_cr(" Static structures = " SIZE_FORMAT "K,"
|
|
977 |
" free_lists = " SIZE_FORMAT "K.",
|
|
978 |
HeapRegionRemSet::static_mem_size()/K,
|
|
979 |
HeapRegionRemSet::fl_mem_size()/K);
|
|
980 |
gclog_or_tty->print_cr(" %d occupied cards represented.",
|
|
981 |
blk.occupied());
|
|
982 |
gclog_or_tty->print_cr(" Max sz region = [" PTR_FORMAT ", " PTR_FORMAT " )"
|
|
983 |
" %s, cap = " SIZE_FORMAT "K, occ = " SIZE_FORMAT "K.",
|
|
984 |
blk.max_mem_sz_region()->bottom(), blk.max_mem_sz_region()->end(),
|
|
985 |
(blk.max_mem_sz_region()->popular() ? "POP" : ""),
|
|
986 |
(blk.max_mem_sz_region()->rem_set()->mem_size() + K - 1)/K,
|
|
987 |
(blk.max_mem_sz_region()->rem_set()->occupied() + K - 1)/K);
|
|
988 |
gclog_or_tty->print_cr(" Did %d coarsenings.",
|
|
989 |
HeapRegionRemSet::n_coarsenings());
|
|
990 |
|
|
991 |
}
|
|
992 |
}
|
|
993 |
void HRInto_G1RemSet::prepare_for_verify() {
|
|
994 |
if (G1HRRSFlushLogBuffersOnVerify && VerifyBeforeGC && !_g1->full_collection()) {
|
|
995 |
cleanupHRRS();
|
|
996 |
_g1->set_refine_cte_cl_concurrency(false);
|
|
997 |
if (SafepointSynchronize::is_at_safepoint()) {
|
|
998 |
DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set();
|
|
999 |
dcqs.concatenate_logs();
|
|
1000 |
}
|
|
1001 |
bool cg1r_use_cache = _cg1r->use_cache();
|
|
1002 |
_cg1r->set_use_cache(false);
|
|
1003 |
updateRS(0);
|
|
1004 |
_cg1r->set_use_cache(cg1r_use_cache);
|
|
1005 |
}
|
|
1006 |
}
|