author | iveresov |
Thu, 11 Feb 2010 15:52:19 -0800 | |
changeset 4902 | 991aaddb5165 |
parent 4900 | 3fab535e2fd6 |
child 5346 | be3f9bf8c3a6 |
permissions | -rw-r--r-- |
1374 | 1 |
/* |
2105 | 2 |
* Copyright 2001-2009 Sun Microsystems, Inc. All Rights Reserved. |
1374 | 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/_heapRegionRemSet.cpp.incl" |
|
27 |
||
28 |
#define HRRS_VERBOSE 0 |
|
29 |
||
30 |
#define PRT_COUNT_OCCUPIED 1 |
|
31 |
||
32 |
// OtherRegionsTable |
|
33 |
||
34 |
class PerRegionTable: public CHeapObj { |
|
35 |
friend class OtherRegionsTable; |
|
36 |
friend class HeapRegionRemSetIterator; |
|
37 |
||
38 |
HeapRegion* _hr; |
|
39 |
BitMap _bm; |
|
40 |
#if PRT_COUNT_OCCUPIED |
|
41 |
jint _occupied; |
|
42 |
#endif |
|
43 |
PerRegionTable* _next_free; |
|
44 |
||
45 |
PerRegionTable* next_free() { return _next_free; } |
|
46 |
void set_next_free(PerRegionTable* prt) { _next_free = prt; } |
|
47 |
||
48 |
||
49 |
static PerRegionTable* _free_list; |
|
50 |
||
51 |
#ifdef _MSC_VER |
|
52 |
// For some reason even though the classes are marked as friend they are unable |
|
53 |
// to access CardsPerRegion when private/protected. Only the windows c++ compiler |
|
54 |
// says this Sun CC and linux gcc don't have a problem with access when private |
|
55 |
||
56 |
public: |
|
57 |
||
58 |
#endif // _MSC_VER |
|
59 |
||
60 |
protected: |
|
61 |
// We need access in order to union things into the base table. |
|
62 |
BitMap* bm() { return &_bm; } |
|
63 |
||
2009 | 64 |
#if PRT_COUNT_OCCUPIED |
1374 | 65 |
void recount_occupied() { |
66 |
_occupied = (jint) bm()->count_one_bits(); |
|
67 |
} |
|
2009 | 68 |
#endif |
1374 | 69 |
|
70 |
PerRegionTable(HeapRegion* hr) : |
|
71 |
_hr(hr), |
|
72 |
#if PRT_COUNT_OCCUPIED |
|
73 |
_occupied(0), |
|
74 |
#endif |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
75 |
_bm(HeapRegion::CardsPerRegion, false /* in-resource-area */) |
1374 | 76 |
{} |
77 |
||
78 |
static void free(PerRegionTable* prt) { |
|
79 |
while (true) { |
|
80 |
PerRegionTable* fl = _free_list; |
|
81 |
prt->set_next_free(fl); |
|
82 |
PerRegionTable* res = |
|
83 |
(PerRegionTable*) |
|
84 |
Atomic::cmpxchg_ptr(prt, &_free_list, fl); |
|
85 |
if (res == fl) return; |
|
86 |
} |
|
87 |
ShouldNotReachHere(); |
|
88 |
} |
|
89 |
||
90 |
static PerRegionTable* alloc(HeapRegion* hr) { |
|
91 |
PerRegionTable* fl = _free_list; |
|
92 |
while (fl != NULL) { |
|
93 |
PerRegionTable* nxt = fl->next_free(); |
|
94 |
PerRegionTable* res = |
|
95 |
(PerRegionTable*) |
|
96 |
Atomic::cmpxchg_ptr(nxt, &_free_list, fl); |
|
97 |
if (res == fl) { |
|
98 |
fl->init(hr); |
|
99 |
return fl; |
|
100 |
} else { |
|
101 |
fl = _free_list; |
|
102 |
} |
|
103 |
} |
|
104 |
assert(fl == NULL, "Loop condition."); |
|
105 |
return new PerRegionTable(hr); |
|
106 |
} |
|
107 |
||
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
108 |
void add_card_work(CardIdx_t from_card, bool par) { |
1374 | 109 |
if (!_bm.at(from_card)) { |
110 |
if (par) { |
|
111 |
if (_bm.par_at_put(from_card, 1)) { |
|
112 |
#if PRT_COUNT_OCCUPIED |
|
113 |
Atomic::inc(&_occupied); |
|
114 |
#endif |
|
115 |
} |
|
116 |
} else { |
|
117 |
_bm.at_put(from_card, 1); |
|
118 |
#if PRT_COUNT_OCCUPIED |
|
119 |
_occupied++; |
|
120 |
#endif |
|
121 |
} |
|
122 |
} |
|
123 |
} |
|
124 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
125 |
void add_reference_work(OopOrNarrowOopStar from, bool par) { |
1374 | 126 |
// Must make this robust in case "from" is not in "_hr", because of |
127 |
// concurrency. |
|
128 |
||
129 |
#if HRRS_VERBOSE |
|
130 |
gclog_or_tty->print_cr(" PRT::Add_reference_work(" PTR_FORMAT "->" PTR_FORMAT").", |
|
131 |
from, *from); |
|
132 |
#endif |
|
133 |
||
134 |
HeapRegion* loc_hr = hr(); |
|
135 |
// If the test below fails, then this table was reused concurrently |
|
136 |
// with this operation. This is OK, since the old table was coarsened, |
|
137 |
// and adding a bit to the new table is never incorrect. |
|
138 |
if (loc_hr->is_in_reserved(from)) { |
|
139 |
size_t hw_offset = pointer_delta((HeapWord*)from, loc_hr->bottom()); |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
140 |
CardIdx_t from_card = (CardIdx_t) |
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
141 |
hw_offset >> (CardTableModRefBS::card_shift - LogHeapWordSize); |
1374 | 142 |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
143 |
assert(0 <= from_card && from_card < HeapRegion::CardsPerRegion, |
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
144 |
"Must be in range."); |
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
145 |
add_card_work(from_card, par); |
1374 | 146 |
} |
147 |
} |
|
148 |
||
149 |
public: |
|
150 |
||
151 |
HeapRegion* hr() const { return _hr; } |
|
152 |
||
153 |
#if PRT_COUNT_OCCUPIED |
|
154 |
jint occupied() const { |
|
155 |
// Overkill, but if we ever need it... |
|
156 |
// guarantee(_occupied == _bm.count_one_bits(), "Check"); |
|
157 |
return _occupied; |
|
158 |
} |
|
159 |
#else |
|
160 |
jint occupied() const { |
|
161 |
return _bm.count_one_bits(); |
|
162 |
} |
|
163 |
#endif |
|
164 |
||
165 |
void init(HeapRegion* hr) { |
|
166 |
_hr = hr; |
|
167 |
#if PRT_COUNT_OCCUPIED |
|
168 |
_occupied = 0; |
|
169 |
#endif |
|
170 |
_bm.clear(); |
|
171 |
} |
|
172 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
173 |
void add_reference(OopOrNarrowOopStar from) { |
1374 | 174 |
add_reference_work(from, /*parallel*/ true); |
175 |
} |
|
176 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
177 |
void seq_add_reference(OopOrNarrowOopStar from) { |
1374 | 178 |
add_reference_work(from, /*parallel*/ false); |
179 |
} |
|
180 |
||
181 |
void scrub(CardTableModRefBS* ctbs, BitMap* card_bm) { |
|
182 |
HeapWord* hr_bot = hr()->bottom(); |
|
1676
d80e69372634
6653214: MemoryPoolMXBean.setUsageThreshold() does not support large heap sizes.
swamyv
parents:
1374
diff
changeset
|
183 |
size_t hr_first_card_index = ctbs->index_for(hr_bot); |
1374 | 184 |
bm()->set_intersection_at_offset(*card_bm, hr_first_card_index); |
185 |
#if PRT_COUNT_OCCUPIED |
|
186 |
recount_occupied(); |
|
187 |
#endif |
|
188 |
} |
|
189 |
||
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
190 |
void add_card(CardIdx_t from_card_index) { |
1374 | 191 |
add_card_work(from_card_index, /*parallel*/ true); |
192 |
} |
|
193 |
||
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
194 |
void seq_add_card(CardIdx_t from_card_index) { |
1374 | 195 |
add_card_work(from_card_index, /*parallel*/ false); |
196 |
} |
|
197 |
||
198 |
// (Destructively) union the bitmap of the current table into the given |
|
199 |
// bitmap (which is assumed to be of the same size.) |
|
200 |
void union_bitmap_into(BitMap* bm) { |
|
201 |
bm->set_union(_bm); |
|
202 |
} |
|
203 |
||
204 |
// Mem size in bytes. |
|
205 |
size_t mem_size() const { |
|
206 |
return sizeof(this) + _bm.size_in_words() * HeapWordSize; |
|
207 |
} |
|
208 |
||
209 |
static size_t fl_mem_size() { |
|
210 |
PerRegionTable* cur = _free_list; |
|
211 |
size_t res = 0; |
|
212 |
while (cur != NULL) { |
|
213 |
res += sizeof(PerRegionTable); |
|
214 |
cur = cur->next_free(); |
|
215 |
} |
|
216 |
return res; |
|
217 |
} |
|
218 |
||
219 |
// Requires "from" to be in "hr()". |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
220 |
bool contains_reference(OopOrNarrowOopStar from) const { |
1374 | 221 |
assert(hr()->is_in_reserved(from), "Precondition."); |
222 |
size_t card_ind = pointer_delta(from, hr()->bottom(), |
|
223 |
CardTableModRefBS::card_size); |
|
224 |
return _bm.at(card_ind); |
|
225 |
} |
|
226 |
}; |
|
227 |
||
228 |
PerRegionTable* PerRegionTable::_free_list = NULL; |
|
229 |
||
230 |
||
231 |
#define COUNT_PAR_EXPANDS 0 |
|
232 |
||
233 |
#if COUNT_PAR_EXPANDS |
|
234 |
static jint n_par_expands = 0; |
|
235 |
static jint n_par_contracts = 0; |
|
236 |
static jint par_expand_list_len = 0; |
|
237 |
static jint max_par_expand_list_len = 0; |
|
238 |
||
239 |
static void print_par_expand() { |
|
240 |
Atomic::inc(&n_par_expands); |
|
241 |
Atomic::inc(&par_expand_list_len); |
|
242 |
if (par_expand_list_len > max_par_expand_list_len) { |
|
243 |
max_par_expand_list_len = par_expand_list_len; |
|
244 |
} |
|
245 |
if ((n_par_expands % 10) == 0) { |
|
246 |
gclog_or_tty->print_cr("\n\n%d par expands: %d contracts, " |
|
247 |
"len = %d, max_len = %d\n.", |
|
248 |
n_par_expands, n_par_contracts, par_expand_list_len, |
|
249 |
max_par_expand_list_len); |
|
250 |
} |
|
251 |
} |
|
252 |
#endif |
|
253 |
||
254 |
class PosParPRT: public PerRegionTable { |
|
255 |
PerRegionTable** _par_tables; |
|
256 |
||
257 |
enum SomePrivateConstants { |
|
258 |
ReserveParTableExpansion = 1 |
|
259 |
}; |
|
260 |
||
261 |
void par_contract() { |
|
262 |
assert(_par_tables != NULL, "Precondition."); |
|
263 |
int n = HeapRegionRemSet::num_par_rem_sets()-1; |
|
264 |
for (int i = 0; i < n; i++) { |
|
265 |
_par_tables[i]->union_bitmap_into(bm()); |
|
266 |
PerRegionTable::free(_par_tables[i]); |
|
267 |
_par_tables[i] = NULL; |
|
268 |
} |
|
269 |
#if PRT_COUNT_OCCUPIED |
|
270 |
// We must recount the "occupied." |
|
271 |
recount_occupied(); |
|
272 |
#endif |
|
273 |
FREE_C_HEAP_ARRAY(PerRegionTable*, _par_tables); |
|
274 |
_par_tables = NULL; |
|
275 |
#if COUNT_PAR_EXPANDS |
|
276 |
Atomic::inc(&n_par_contracts); |
|
277 |
Atomic::dec(&par_expand_list_len); |
|
278 |
#endif |
|
279 |
} |
|
280 |
||
281 |
static PerRegionTable** _par_table_fl; |
|
282 |
||
283 |
PosParPRT* _next; |
|
284 |
||
285 |
static PosParPRT* _free_list; |
|
286 |
||
287 |
PerRegionTable** par_tables() const { |
|
288 |
assert(uintptr_t(NULL) == 0, "Assumption."); |
|
289 |
if (uintptr_t(_par_tables) <= ReserveParTableExpansion) |
|
290 |
return NULL; |
|
291 |
else |
|
292 |
return _par_tables; |
|
293 |
} |
|
294 |
||
295 |
PosParPRT* _next_par_expanded; |
|
296 |
PosParPRT* next_par_expanded() { return _next_par_expanded; } |
|
297 |
void set_next_par_expanded(PosParPRT* ppprt) { _next_par_expanded = ppprt; } |
|
298 |
static PosParPRT* _par_expanded_list; |
|
299 |
||
300 |
public: |
|
301 |
||
302 |
PosParPRT(HeapRegion* hr) : PerRegionTable(hr), _par_tables(NULL) {} |
|
303 |
||
304 |
jint occupied() const { |
|
305 |
jint res = PerRegionTable::occupied(); |
|
306 |
if (par_tables() != NULL) { |
|
307 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets()-1; i++) { |
|
308 |
res += par_tables()[i]->occupied(); |
|
309 |
} |
|
310 |
} |
|
311 |
return res; |
|
312 |
} |
|
313 |
||
314 |
void init(HeapRegion* hr) { |
|
315 |
PerRegionTable::init(hr); |
|
316 |
_next = NULL; |
|
317 |
if (par_tables() != NULL) { |
|
318 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets()-1; i++) { |
|
319 |
par_tables()[i]->init(hr); |
|
320 |
} |
|
321 |
} |
|
322 |
} |
|
323 |
||
324 |
static void free(PosParPRT* prt) { |
|
325 |
while (true) { |
|
326 |
PosParPRT* fl = _free_list; |
|
327 |
prt->set_next(fl); |
|
328 |
PosParPRT* res = |
|
329 |
(PosParPRT*) |
|
330 |
Atomic::cmpxchg_ptr(prt, &_free_list, fl); |
|
331 |
if (res == fl) return; |
|
332 |
} |
|
333 |
ShouldNotReachHere(); |
|
334 |
} |
|
335 |
||
336 |
static PosParPRT* alloc(HeapRegion* hr) { |
|
337 |
PosParPRT* fl = _free_list; |
|
338 |
while (fl != NULL) { |
|
339 |
PosParPRT* nxt = fl->next(); |
|
340 |
PosParPRT* res = |
|
341 |
(PosParPRT*) |
|
342 |
Atomic::cmpxchg_ptr(nxt, &_free_list, fl); |
|
343 |
if (res == fl) { |
|
344 |
fl->init(hr); |
|
345 |
return fl; |
|
346 |
} else { |
|
347 |
fl = _free_list; |
|
348 |
} |
|
349 |
} |
|
350 |
assert(fl == NULL, "Loop condition."); |
|
351 |
return new PosParPRT(hr); |
|
352 |
} |
|
353 |
||
354 |
PosParPRT* next() const { return _next; } |
|
355 |
void set_next(PosParPRT* nxt) { _next = nxt; } |
|
356 |
PosParPRT** next_addr() { return &_next; } |
|
357 |
||
4900
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
358 |
bool should_expand(int tid) { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
359 |
return par_tables() == NULL && tid > 0 && hr()->is_gc_alloc_region(); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
360 |
} |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
361 |
|
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
362 |
void par_expand() { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
363 |
int n = HeapRegionRemSet::num_par_rem_sets()-1; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
364 |
if (n <= 0) return; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
365 |
if (_par_tables == NULL) { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
366 |
PerRegionTable* res = |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
367 |
(PerRegionTable*) |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
368 |
Atomic::cmpxchg_ptr((PerRegionTable*)ReserveParTableExpansion, |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
369 |
&_par_tables, NULL); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
370 |
if (res != NULL) return; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
371 |
// Otherwise, we reserved the right to do the expansion. |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
372 |
|
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
373 |
PerRegionTable** ptables = NEW_C_HEAP_ARRAY(PerRegionTable*, n); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
374 |
for (int i = 0; i < n; i++) { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
375 |
PerRegionTable* ptable = PerRegionTable::alloc(hr()); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
376 |
ptables[i] = ptable; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
377 |
} |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
378 |
// Here we do not need an atomic. |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
379 |
_par_tables = ptables; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
380 |
#if COUNT_PAR_EXPANDS |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
381 |
print_par_expand(); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
382 |
#endif |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
383 |
// We must put this table on the expanded list. |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
384 |
PosParPRT* exp_head = _par_expanded_list; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
385 |
while (true) { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
386 |
set_next_par_expanded(exp_head); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
387 |
PosParPRT* res = |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
388 |
(PosParPRT*) |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
389 |
Atomic::cmpxchg_ptr(this, &_par_expanded_list, exp_head); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
390 |
if (res == exp_head) return; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
391 |
// Otherwise. |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
392 |
exp_head = res; |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
393 |
} |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
394 |
ShouldNotReachHere(); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
395 |
} |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
396 |
} |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
397 |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
398 |
void add_reference(OopOrNarrowOopStar from, int tid) { |
1374 | 399 |
// Expand if necessary. |
400 |
PerRegionTable** pt = par_tables(); |
|
401 |
if (pt != NULL) { |
|
402 |
// We always have to assume that mods to table 0 are in parallel, |
|
403 |
// because of the claiming scheme in parallel expansion. A thread |
|
404 |
// with tid != 0 that finds the table to be NULL, but doesn't succeed |
|
405 |
// in claiming the right of expanding it, will end up in the else |
|
406 |
// clause of the above if test. That thread could be delayed, and a |
|
407 |
// thread 0 add reference could see the table expanded, and come |
|
408 |
// here. Both threads would be adding in parallel. But we get to |
|
409 |
// not use atomics for tids > 0. |
|
410 |
if (tid == 0) { |
|
411 |
PerRegionTable::add_reference(from); |
|
412 |
} else { |
|
413 |
pt[tid-1]->seq_add_reference(from); |
|
414 |
} |
|
415 |
} else { |
|
416 |
// Not expanded -- add to the base table. |
|
417 |
PerRegionTable::add_reference(from); |
|
418 |
} |
|
419 |
} |
|
420 |
||
421 |
void scrub(CardTableModRefBS* ctbs, BitMap* card_bm) { |
|
422 |
assert(_par_tables == NULL, "Precondition"); |
|
423 |
PerRegionTable::scrub(ctbs, card_bm); |
|
424 |
} |
|
425 |
||
426 |
size_t mem_size() const { |
|
427 |
size_t res = |
|
428 |
PerRegionTable::mem_size() + sizeof(this) - sizeof(PerRegionTable); |
|
429 |
if (_par_tables != NULL) { |
|
430 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets()-1; i++) { |
|
431 |
res += _par_tables[i]->mem_size(); |
|
432 |
} |
|
433 |
} |
|
434 |
return res; |
|
435 |
} |
|
436 |
||
437 |
static size_t fl_mem_size() { |
|
438 |
PosParPRT* cur = _free_list; |
|
439 |
size_t res = 0; |
|
440 |
while (cur != NULL) { |
|
441 |
res += sizeof(PosParPRT); |
|
442 |
cur = cur->next(); |
|
443 |
} |
|
444 |
return res; |
|
445 |
} |
|
446 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
447 |
bool contains_reference(OopOrNarrowOopStar from) const { |
1374 | 448 |
if (PerRegionTable::contains_reference(from)) return true; |
449 |
if (_par_tables != NULL) { |
|
450 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets()-1; i++) { |
|
451 |
if (_par_tables[i]->contains_reference(from)) return true; |
|
452 |
} |
|
453 |
} |
|
454 |
return false; |
|
455 |
} |
|
456 |
||
457 |
static void par_contract_all(); |
|
458 |
||
459 |
}; |
|
460 |
||
461 |
void PosParPRT::par_contract_all() { |
|
462 |
PosParPRT* hd = _par_expanded_list; |
|
463 |
while (hd != NULL) { |
|
464 |
PosParPRT* nxt = hd->next_par_expanded(); |
|
465 |
PosParPRT* res = |
|
466 |
(PosParPRT*) |
|
467 |
Atomic::cmpxchg_ptr(nxt, &_par_expanded_list, hd); |
|
468 |
if (res == hd) { |
|
469 |
// We claimed the right to contract this table. |
|
470 |
hd->set_next_par_expanded(NULL); |
|
471 |
hd->par_contract(); |
|
472 |
hd = _par_expanded_list; |
|
473 |
} else { |
|
474 |
hd = res; |
|
475 |
} |
|
476 |
} |
|
477 |
} |
|
478 |
||
479 |
PosParPRT* PosParPRT::_free_list = NULL; |
|
480 |
PosParPRT* PosParPRT::_par_expanded_list = NULL; |
|
481 |
||
482 |
jint OtherRegionsTable::_cache_probes = 0; |
|
483 |
jint OtherRegionsTable::_cache_hits = 0; |
|
484 |
||
485 |
size_t OtherRegionsTable::_max_fine_entries = 0; |
|
486 |
size_t OtherRegionsTable::_mod_max_fine_entries_mask = 0; |
|
487 |
#if SAMPLE_FOR_EVICTION |
|
488 |
size_t OtherRegionsTable::_fine_eviction_stride = 0; |
|
489 |
size_t OtherRegionsTable::_fine_eviction_sample_size = 0; |
|
490 |
#endif |
|
491 |
||
492 |
OtherRegionsTable::OtherRegionsTable(HeapRegion* hr) : |
|
493 |
_g1h(G1CollectedHeap::heap()), |
|
494 |
_m(Mutex::leaf, "An OtherRegionsTable lock", true), |
|
495 |
_hr(hr), |
|
496 |
_coarse_map(G1CollectedHeap::heap()->max_regions(), |
|
497 |
false /* in-resource-area */), |
|
498 |
_fine_grain_regions(NULL), |
|
499 |
_n_fine_entries(0), _n_coarse_entries(0), |
|
500 |
#if SAMPLE_FOR_EVICTION |
|
501 |
_fine_eviction_start(0), |
|
502 |
#endif |
|
503 |
_sparse_table(hr) |
|
504 |
{ |
|
505 |
typedef PosParPRT* PosParPRTPtr; |
|
506 |
if (_max_fine_entries == 0) { |
|
507 |
assert(_mod_max_fine_entries_mask == 0, "Both or none."); |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
508 |
size_t max_entries_log = (size_t)log2_long((jlong)G1RSetRegionEntries); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
509 |
_max_fine_entries = (size_t)(1 << max_entries_log); |
1374 | 510 |
_mod_max_fine_entries_mask = _max_fine_entries - 1; |
511 |
#if SAMPLE_FOR_EVICTION |
|
512 |
assert(_fine_eviction_sample_size == 0 |
|
513 |
&& _fine_eviction_stride == 0, "All init at same time."); |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
514 |
_fine_eviction_sample_size = MAX2((size_t)4, max_entries_log); |
1374 | 515 |
_fine_eviction_stride = _max_fine_entries / _fine_eviction_sample_size; |
516 |
#endif |
|
517 |
} |
|
518 |
_fine_grain_regions = new PosParPRTPtr[_max_fine_entries]; |
|
519 |
if (_fine_grain_regions == NULL) |
|
520 |
vm_exit_out_of_memory(sizeof(void*)*_max_fine_entries, |
|
521 |
"Failed to allocate _fine_grain_entries."); |
|
522 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
|
523 |
_fine_grain_regions[i] = NULL; |
|
524 |
} |
|
525 |
} |
|
526 |
||
527 |
int** OtherRegionsTable::_from_card_cache = NULL; |
|
528 |
size_t OtherRegionsTable::_from_card_cache_max_regions = 0; |
|
529 |
size_t OtherRegionsTable::_from_card_cache_mem_size = 0; |
|
530 |
||
531 |
void OtherRegionsTable::init_from_card_cache(size_t max_regions) { |
|
532 |
_from_card_cache_max_regions = max_regions; |
|
533 |
||
534 |
int n_par_rs = HeapRegionRemSet::num_par_rem_sets(); |
|
535 |
_from_card_cache = NEW_C_HEAP_ARRAY(int*, n_par_rs); |
|
536 |
for (int i = 0; i < n_par_rs; i++) { |
|
537 |
_from_card_cache[i] = NEW_C_HEAP_ARRAY(int, max_regions); |
|
538 |
for (size_t j = 0; j < max_regions; j++) { |
|
539 |
_from_card_cache[i][j] = -1; // An invalid value. |
|
540 |
} |
|
541 |
} |
|
542 |
_from_card_cache_mem_size = n_par_rs * max_regions * sizeof(int); |
|
543 |
} |
|
544 |
||
545 |
void OtherRegionsTable::shrink_from_card_cache(size_t new_n_regs) { |
|
546 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) { |
|
547 |
assert(new_n_regs <= _from_card_cache_max_regions, "Must be within max."); |
|
548 |
for (size_t j = new_n_regs; j < _from_card_cache_max_regions; j++) { |
|
549 |
_from_card_cache[i][j] = -1; // An invalid value. |
|
550 |
} |
|
551 |
} |
|
552 |
} |
|
553 |
||
554 |
#ifndef PRODUCT |
|
555 |
void OtherRegionsTable::print_from_card_cache() { |
|
556 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) { |
|
557 |
for (size_t j = 0; j < _from_card_cache_max_regions; j++) { |
|
558 |
gclog_or_tty->print_cr("_from_card_cache[%d][%d] = %d.", |
|
559 |
i, j, _from_card_cache[i][j]); |
|
560 |
} |
|
561 |
} |
|
562 |
} |
|
563 |
#endif |
|
564 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
565 |
void OtherRegionsTable::add_reference(OopOrNarrowOopStar from, int tid) { |
1374 | 566 |
size_t cur_hrs_ind = hr()->hrs_index(); |
567 |
||
568 |
#if HRRS_VERBOSE |
|
569 |
gclog_or_tty->print_cr("ORT::add_reference_work(" PTR_FORMAT "->" PTR_FORMAT ").", |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
570 |
from, |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
571 |
UseCompressedOops |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
572 |
? oopDesc::load_decode_heap_oop((narrowOop*)from) |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
573 |
: oopDesc::load_decode_heap_oop((oop*)from)); |
1374 | 574 |
#endif |
575 |
||
576 |
int from_card = (int)(uintptr_t(from) >> CardTableModRefBS::card_shift); |
|
577 |
||
578 |
#if HRRS_VERBOSE |
|
579 |
gclog_or_tty->print_cr("Table for [" PTR_FORMAT "...): card %d (cache = %d)", |
|
580 |
hr()->bottom(), from_card, |
|
581 |
_from_card_cache[tid][cur_hrs_ind]); |
|
582 |
#endif |
|
583 |
||
584 |
#define COUNT_CACHE 0 |
|
585 |
#if COUNT_CACHE |
|
586 |
jint p = Atomic::add(1, &_cache_probes); |
|
587 |
if ((p % 10000) == 0) { |
|
588 |
jint hits = _cache_hits; |
|
589 |
gclog_or_tty->print_cr("%d/%d = %5.2f%% RS cache hits.", |
|
590 |
_cache_hits, p, 100.0* (float)hits/(float)p); |
|
591 |
} |
|
592 |
#endif |
|
593 |
if (from_card == _from_card_cache[tid][cur_hrs_ind]) { |
|
594 |
#if HRRS_VERBOSE |
|
595 |
gclog_or_tty->print_cr(" from-card cache hit."); |
|
596 |
#endif |
|
597 |
#if COUNT_CACHE |
|
598 |
Atomic::inc(&_cache_hits); |
|
599 |
#endif |
|
600 |
assert(contains_reference(from), "We just added it!"); |
|
601 |
return; |
|
602 |
} else { |
|
603 |
_from_card_cache[tid][cur_hrs_ind] = from_card; |
|
604 |
} |
|
605 |
||
606 |
// Note that this may be a continued H region. |
|
607 |
HeapRegion* from_hr = _g1h->heap_region_containing_raw(from); |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
608 |
RegionIdx_t from_hrs_ind = (RegionIdx_t) from_hr->hrs_index(); |
1374 | 609 |
|
610 |
// If the region is already coarsened, return. |
|
611 |
if (_coarse_map.at(from_hrs_ind)) { |
|
612 |
#if HRRS_VERBOSE |
|
613 |
gclog_or_tty->print_cr(" coarse map hit."); |
|
614 |
#endif |
|
615 |
assert(contains_reference(from), "We just added it!"); |
|
616 |
return; |
|
617 |
} |
|
618 |
||
619 |
// Otherwise find a per-region table to add it to. |
|
620 |
size_t ind = from_hrs_ind & _mod_max_fine_entries_mask; |
|
621 |
PosParPRT* prt = find_region_table(ind, from_hr); |
|
622 |
if (prt == NULL) { |
|
623 |
MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag); |
|
624 |
// Confirm that it's really not there... |
|
625 |
prt = find_region_table(ind, from_hr); |
|
626 |
if (prt == NULL) { |
|
627 |
||
628 |
uintptr_t from_hr_bot_card_index = |
|
629 |
uintptr_t(from_hr->bottom()) |
|
630 |
>> CardTableModRefBS::card_shift; |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
631 |
CardIdx_t card_index = from_card - from_hr_bot_card_index; |
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
632 |
assert(0 <= card_index && card_index < HeapRegion::CardsPerRegion, |
1374 | 633 |
"Must be in range."); |
634 |
if (G1HRRSUseSparseTable && |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
635 |
_sparse_table.add_card(from_hrs_ind, card_index)) { |
1374 | 636 |
if (G1RecordHRRSOops) { |
637 |
HeapRegionRemSet::record(hr(), from); |
|
638 |
#if HRRS_VERBOSE |
|
639 |
gclog_or_tty->print(" Added card " PTR_FORMAT " to region " |
|
640 |
"[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n", |
|
641 |
align_size_down(uintptr_t(from), |
|
642 |
CardTableModRefBS::card_size), |
|
643 |
hr()->bottom(), from); |
|
644 |
#endif |
|
645 |
} |
|
646 |
#if HRRS_VERBOSE |
|
647 |
gclog_or_tty->print_cr(" added card to sparse table."); |
|
648 |
#endif |
|
649 |
assert(contains_reference_locked(from), "We just added it!"); |
|
650 |
return; |
|
651 |
} else { |
|
652 |
#if HRRS_VERBOSE |
|
653 |
gclog_or_tty->print_cr(" [tid %d] sparse table entry " |
|
654 |
"overflow(f: %d, t: %d)", |
|
655 |
tid, from_hrs_ind, cur_hrs_ind); |
|
656 |
#endif |
|
657 |
} |
|
658 |
||
659 |
if (_n_fine_entries == _max_fine_entries) { |
|
660 |
prt = delete_region_table(); |
|
661 |
} else { |
|
662 |
prt = PosParPRT::alloc(from_hr); |
|
663 |
} |
|
664 |
prt->init(from_hr); |
|
665 |
// Record the outgoing pointer in the from_region's outgoing bitmap. |
|
666 |
from_hr->rem_set()->add_outgoing_reference(hr()); |
|
667 |
||
668 |
PosParPRT* first_prt = _fine_grain_regions[ind]; |
|
669 |
prt->set_next(first_prt); // XXX Maybe move to init? |
|
670 |
_fine_grain_regions[ind] = prt; |
|
671 |
_n_fine_entries++; |
|
672 |
||
673 |
if (G1HRRSUseSparseTable) { |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
674 |
// Transfer from sparse to fine-grain. |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
675 |
SparsePRTEntry *sprt_entry = _sparse_table.get_entry(from_hrs_ind); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
676 |
assert(sprt_entry != NULL, "There should have been an entry"); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
677 |
for (int i = 0; i < SparsePRTEntry::cards_num(); i++) { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
678 |
CardIdx_t c = sprt_entry->card(i); |
1374 | 679 |
if (c != SparsePRTEntry::NullEntry) { |
680 |
prt->add_card(c); |
|
681 |
} |
|
682 |
} |
|
683 |
// Now we can delete the sparse entry. |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
684 |
bool res = _sparse_table.delete_entry(from_hrs_ind); |
1374 | 685 |
assert(res, "It should have been there."); |
686 |
} |
|
687 |
} |
|
688 |
assert(prt != NULL && prt->hr() == from_hr, "consequence"); |
|
689 |
} |
|
690 |
// Note that we can't assert "prt->hr() == from_hr", because of the |
|
691 |
// possibility of concurrent reuse. But see head comment of |
|
692 |
// OtherRegionsTable for why this is OK. |
|
693 |
assert(prt != NULL, "Inv"); |
|
694 |
||
4900
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
695 |
if (prt->should_expand(tid)) { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
696 |
MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
697 |
HeapRegion* prt_hr = prt->hr(); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
698 |
if (prt_hr == from_hr) { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
699 |
// Make sure the table still corresponds to the same region |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
700 |
prt->par_expand(); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
701 |
prt->add_reference(from, tid); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
702 |
} |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
703 |
// else: The table has been concurrently coarsened, evicted, and |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
704 |
// the table data structure re-used for another table. So, we |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
705 |
// don't need to add the reference any more given that the table |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
706 |
// has been coarsened and the whole region will be scanned anyway. |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
707 |
} else { |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
708 |
prt->add_reference(from, tid); |
3fab535e2fd6
6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp
parents:
3697
diff
changeset
|
709 |
} |
1374 | 710 |
if (G1RecordHRRSOops) { |
711 |
HeapRegionRemSet::record(hr(), from); |
|
712 |
#if HRRS_VERBOSE |
|
713 |
gclog_or_tty->print("Added card " PTR_FORMAT " to region " |
|
714 |
"[" PTR_FORMAT "...) for ref " PTR_FORMAT ".\n", |
|
715 |
align_size_down(uintptr_t(from), |
|
716 |
CardTableModRefBS::card_size), |
|
717 |
hr()->bottom(), from); |
|
718 |
#endif |
|
719 |
} |
|
720 |
assert(contains_reference(from), "We just added it!"); |
|
721 |
} |
|
722 |
||
723 |
PosParPRT* |
|
724 |
OtherRegionsTable::find_region_table(size_t ind, HeapRegion* hr) const { |
|
725 |
assert(0 <= ind && ind < _max_fine_entries, "Preconditions."); |
|
726 |
PosParPRT* prt = _fine_grain_regions[ind]; |
|
727 |
while (prt != NULL && prt->hr() != hr) { |
|
728 |
prt = prt->next(); |
|
729 |
} |
|
730 |
// Loop postcondition is the method postcondition. |
|
731 |
return prt; |
|
732 |
} |
|
733 |
||
734 |
||
735 |
#define DRT_CENSUS 0 |
|
736 |
||
737 |
#if DRT_CENSUS |
|
738 |
static const int HistoSize = 6; |
|
739 |
static int global_histo[HistoSize] = { 0, 0, 0, 0, 0, 0 }; |
|
740 |
static int coarsenings = 0; |
|
741 |
static int occ_sum = 0; |
|
742 |
#endif |
|
743 |
||
744 |
jint OtherRegionsTable::_n_coarsenings = 0; |
|
745 |
||
746 |
PosParPRT* OtherRegionsTable::delete_region_table() { |
|
747 |
#if DRT_CENSUS |
|
748 |
int histo[HistoSize] = { 0, 0, 0, 0, 0, 0 }; |
|
749 |
const int histo_limits[] = { 1, 4, 16, 64, 256, 2048 }; |
|
750 |
#endif |
|
751 |
||
752 |
assert(_m.owned_by_self(), "Precondition"); |
|
753 |
assert(_n_fine_entries == _max_fine_entries, "Precondition"); |
|
754 |
PosParPRT* max = NULL; |
|
755 |
jint max_occ = 0; |
|
756 |
PosParPRT** max_prev; |
|
757 |
size_t max_ind; |
|
758 |
||
759 |
#if SAMPLE_FOR_EVICTION |
|
760 |
size_t i = _fine_eviction_start; |
|
761 |
for (size_t k = 0; k < _fine_eviction_sample_size; k++) { |
|
762 |
size_t ii = i; |
|
763 |
// Make sure we get a non-NULL sample. |
|
764 |
while (_fine_grain_regions[ii] == NULL) { |
|
765 |
ii++; |
|
766 |
if (ii == _max_fine_entries) ii = 0; |
|
767 |
guarantee(ii != i, "We must find one."); |
|
768 |
} |
|
769 |
PosParPRT** prev = &_fine_grain_regions[ii]; |
|
770 |
PosParPRT* cur = *prev; |
|
771 |
while (cur != NULL) { |
|
772 |
jint cur_occ = cur->occupied(); |
|
773 |
if (max == NULL || cur_occ > max_occ) { |
|
774 |
max = cur; |
|
775 |
max_prev = prev; |
|
776 |
max_ind = i; |
|
777 |
max_occ = cur_occ; |
|
778 |
} |
|
779 |
prev = cur->next_addr(); |
|
780 |
cur = cur->next(); |
|
781 |
} |
|
782 |
i = i + _fine_eviction_stride; |
|
783 |
if (i >= _n_fine_entries) i = i - _n_fine_entries; |
|
784 |
} |
|
785 |
_fine_eviction_start++; |
|
786 |
if (_fine_eviction_start >= _n_fine_entries) |
|
787 |
_fine_eviction_start -= _n_fine_entries; |
|
788 |
#else |
|
789 |
for (int i = 0; i < _max_fine_entries; i++) { |
|
790 |
PosParPRT** prev = &_fine_grain_regions[i]; |
|
791 |
PosParPRT* cur = *prev; |
|
792 |
while (cur != NULL) { |
|
793 |
jint cur_occ = cur->occupied(); |
|
794 |
#if DRT_CENSUS |
|
795 |
for (int k = 0; k < HistoSize; k++) { |
|
796 |
if (cur_occ <= histo_limits[k]) { |
|
797 |
histo[k]++; global_histo[k]++; break; |
|
798 |
} |
|
799 |
} |
|
800 |
#endif |
|
801 |
if (max == NULL || cur_occ > max_occ) { |
|
802 |
max = cur; |
|
803 |
max_prev = prev; |
|
804 |
max_ind = i; |
|
805 |
max_occ = cur_occ; |
|
806 |
} |
|
807 |
prev = cur->next_addr(); |
|
808 |
cur = cur->next(); |
|
809 |
} |
|
810 |
} |
|
811 |
#endif |
|
812 |
// XXX |
|
813 |
guarantee(max != NULL, "Since _n_fine_entries > 0"); |
|
814 |
#if DRT_CENSUS |
|
815 |
gclog_or_tty->print_cr("In a coarsening: histo of occs:"); |
|
816 |
for (int k = 0; k < HistoSize; k++) { |
|
817 |
gclog_or_tty->print_cr(" <= %4d: %5d.", histo_limits[k], histo[k]); |
|
818 |
} |
|
819 |
coarsenings++; |
|
820 |
occ_sum += max_occ; |
|
821 |
if ((coarsenings % 100) == 0) { |
|
822 |
gclog_or_tty->print_cr("\ncoarsenings = %d; global summary:", coarsenings); |
|
823 |
for (int k = 0; k < HistoSize; k++) { |
|
824 |
gclog_or_tty->print_cr(" <= %4d: %5d.", histo_limits[k], global_histo[k]); |
|
825 |
} |
|
826 |
gclog_or_tty->print_cr("Avg occ of deleted region = %6.2f.", |
|
827 |
(float)occ_sum/(float)coarsenings); |
|
828 |
} |
|
829 |
#endif |
|
830 |
||
831 |
// Set the corresponding coarse bit. |
|
832 |
int max_hrs_index = max->hr()->hrs_index(); |
|
833 |
if (!_coarse_map.at(max_hrs_index)) { |
|
834 |
_coarse_map.at_put(max_hrs_index, true); |
|
835 |
_n_coarse_entries++; |
|
836 |
#if 0 |
|
837 |
gclog_or_tty->print("Coarsened entry in region [" PTR_FORMAT "...] " |
|
838 |
"for region [" PTR_FORMAT "...] (%d coarse entries).\n", |
|
839 |
hr()->bottom(), |
|
840 |
max->hr()->bottom(), |
|
841 |
_n_coarse_entries); |
|
842 |
#endif |
|
843 |
} |
|
844 |
||
845 |
// Unsplice. |
|
846 |
*max_prev = max->next(); |
|
847 |
Atomic::inc(&_n_coarsenings); |
|
848 |
_n_fine_entries--; |
|
849 |
return max; |
|
850 |
} |
|
851 |
||
852 |
||
853 |
// At present, this must be called stop-world single-threaded. |
|
854 |
void OtherRegionsTable::scrub(CardTableModRefBS* ctbs, |
|
855 |
BitMap* region_bm, BitMap* card_bm) { |
|
856 |
// First eliminated garbage regions from the coarse map. |
|
857 |
if (G1RSScrubVerbose) |
|
858 |
gclog_or_tty->print_cr("Scrubbing region %d:", hr()->hrs_index()); |
|
859 |
||
860 |
assert(_coarse_map.size() == region_bm->size(), "Precondition"); |
|
861 |
if (G1RSScrubVerbose) |
|
862 |
gclog_or_tty->print(" Coarse map: before = %d...", _n_coarse_entries); |
|
863 |
_coarse_map.set_intersection(*region_bm); |
|
864 |
_n_coarse_entries = _coarse_map.count_one_bits(); |
|
865 |
if (G1RSScrubVerbose) |
|
866 |
gclog_or_tty->print_cr(" after = %d.", _n_coarse_entries); |
|
867 |
||
868 |
// Now do the fine-grained maps. |
|
869 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
|
870 |
PosParPRT* cur = _fine_grain_regions[i]; |
|
871 |
PosParPRT** prev = &_fine_grain_regions[i]; |
|
872 |
while (cur != NULL) { |
|
873 |
PosParPRT* nxt = cur->next(); |
|
874 |
// If the entire region is dead, eliminate. |
|
875 |
if (G1RSScrubVerbose) |
|
876 |
gclog_or_tty->print_cr(" For other region %d:", cur->hr()->hrs_index()); |
|
877 |
if (!region_bm->at(cur->hr()->hrs_index())) { |
|
878 |
*prev = nxt; |
|
879 |
cur->set_next(NULL); |
|
880 |
_n_fine_entries--; |
|
881 |
if (G1RSScrubVerbose) |
|
882 |
gclog_or_tty->print_cr(" deleted via region map."); |
|
883 |
PosParPRT::free(cur); |
|
884 |
} else { |
|
885 |
// Do fine-grain elimination. |
|
886 |
if (G1RSScrubVerbose) |
|
887 |
gclog_or_tty->print(" occ: before = %4d.", cur->occupied()); |
|
888 |
cur->scrub(ctbs, card_bm); |
|
889 |
if (G1RSScrubVerbose) |
|
890 |
gclog_or_tty->print_cr(" after = %4d.", cur->occupied()); |
|
891 |
// Did that empty the table completely? |
|
892 |
if (cur->occupied() == 0) { |
|
893 |
*prev = nxt; |
|
894 |
cur->set_next(NULL); |
|
895 |
_n_fine_entries--; |
|
896 |
PosParPRT::free(cur); |
|
897 |
} else { |
|
898 |
prev = cur->next_addr(); |
|
899 |
} |
|
900 |
} |
|
901 |
cur = nxt; |
|
902 |
} |
|
903 |
} |
|
904 |
// Since we may have deleted a from_card_cache entry from the RS, clear |
|
905 |
// the FCC. |
|
906 |
clear_fcc(); |
|
907 |
} |
|
908 |
||
909 |
||
910 |
size_t OtherRegionsTable::occupied() const { |
|
911 |
// Cast away const in this case. |
|
912 |
MutexLockerEx x((Mutex*)&_m, Mutex::_no_safepoint_check_flag); |
|
913 |
size_t sum = occ_fine(); |
|
914 |
sum += occ_sparse(); |
|
915 |
sum += occ_coarse(); |
|
916 |
return sum; |
|
917 |
} |
|
918 |
||
919 |
size_t OtherRegionsTable::occ_fine() const { |
|
920 |
size_t sum = 0; |
|
921 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
|
922 |
PosParPRT* cur = _fine_grain_regions[i]; |
|
923 |
while (cur != NULL) { |
|
924 |
sum += cur->occupied(); |
|
925 |
cur = cur->next(); |
|
926 |
} |
|
927 |
} |
|
928 |
return sum; |
|
929 |
} |
|
930 |
||
931 |
size_t OtherRegionsTable::occ_coarse() const { |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
932 |
return (_n_coarse_entries * HeapRegion::CardsPerRegion); |
1374 | 933 |
} |
934 |
||
935 |
size_t OtherRegionsTable::occ_sparse() const { |
|
936 |
return _sparse_table.occupied(); |
|
937 |
} |
|
938 |
||
939 |
size_t OtherRegionsTable::mem_size() const { |
|
940 |
// Cast away const in this case. |
|
941 |
MutexLockerEx x((Mutex*)&_m, Mutex::_no_safepoint_check_flag); |
|
942 |
size_t sum = 0; |
|
943 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
|
944 |
PosParPRT* cur = _fine_grain_regions[i]; |
|
945 |
while (cur != NULL) { |
|
946 |
sum += cur->mem_size(); |
|
947 |
cur = cur->next(); |
|
948 |
} |
|
949 |
} |
|
950 |
sum += (sizeof(PosParPRT*) * _max_fine_entries); |
|
951 |
sum += (_coarse_map.size_in_words() * HeapWordSize); |
|
952 |
sum += (_sparse_table.mem_size()); |
|
953 |
sum += sizeof(*this) - sizeof(_sparse_table); // Avoid double counting above. |
|
954 |
return sum; |
|
955 |
} |
|
956 |
||
957 |
size_t OtherRegionsTable::static_mem_size() { |
|
958 |
return _from_card_cache_mem_size; |
|
959 |
} |
|
960 |
||
961 |
size_t OtherRegionsTable::fl_mem_size() { |
|
962 |
return PerRegionTable::fl_mem_size() + PosParPRT::fl_mem_size(); |
|
963 |
} |
|
964 |
||
965 |
void OtherRegionsTable::clear_fcc() { |
|
966 |
for (int i = 0; i < HeapRegionRemSet::num_par_rem_sets(); i++) { |
|
967 |
_from_card_cache[i][hr()->hrs_index()] = -1; |
|
968 |
} |
|
969 |
} |
|
970 |
||
971 |
void OtherRegionsTable::clear() { |
|
972 |
MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag); |
|
973 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
|
974 |
PosParPRT* cur = _fine_grain_regions[i]; |
|
975 |
while (cur != NULL) { |
|
976 |
PosParPRT* nxt = cur->next(); |
|
977 |
PosParPRT::free(cur); |
|
978 |
cur = nxt; |
|
979 |
} |
|
980 |
_fine_grain_regions[i] = NULL; |
|
981 |
} |
|
982 |
_sparse_table.clear(); |
|
983 |
_coarse_map.clear(); |
|
984 |
_n_fine_entries = 0; |
|
985 |
_n_coarse_entries = 0; |
|
986 |
||
987 |
clear_fcc(); |
|
988 |
} |
|
989 |
||
990 |
void OtherRegionsTable::clear_incoming_entry(HeapRegion* from_hr) { |
|
991 |
MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag); |
|
992 |
size_t hrs_ind = (size_t)from_hr->hrs_index(); |
|
993 |
size_t ind = hrs_ind & _mod_max_fine_entries_mask; |
|
994 |
if (del_single_region_table(ind, from_hr)) { |
|
995 |
assert(!_coarse_map.at(hrs_ind), "Inv"); |
|
996 |
} else { |
|
997 |
_coarse_map.par_at_put(hrs_ind, 0); |
|
998 |
} |
|
999 |
// Check to see if any of the fcc entries come from here. |
|
1000 |
int hr_ind = hr()->hrs_index(); |
|
1001 |
for (int tid = 0; tid < HeapRegionRemSet::num_par_rem_sets(); tid++) { |
|
1002 |
int fcc_ent = _from_card_cache[tid][hr_ind]; |
|
1003 |
if (fcc_ent != -1) { |
|
1004 |
HeapWord* card_addr = (HeapWord*) |
|
1005 |
(uintptr_t(fcc_ent) << CardTableModRefBS::card_shift); |
|
1006 |
if (hr()->is_in_reserved(card_addr)) { |
|
1007 |
// Clear the from card cache. |
|
1008 |
_from_card_cache[tid][hr_ind] = -1; |
|
1009 |
} |
|
1010 |
} |
|
1011 |
} |
|
1012 |
} |
|
1013 |
||
1014 |
bool OtherRegionsTable::del_single_region_table(size_t ind, |
|
1015 |
HeapRegion* hr) { |
|
1016 |
assert(0 <= ind && ind < _max_fine_entries, "Preconditions."); |
|
1017 |
PosParPRT** prev_addr = &_fine_grain_regions[ind]; |
|
1018 |
PosParPRT* prt = *prev_addr; |
|
1019 |
while (prt != NULL && prt->hr() != hr) { |
|
1020 |
prev_addr = prt->next_addr(); |
|
1021 |
prt = prt->next(); |
|
1022 |
} |
|
1023 |
if (prt != NULL) { |
|
1024 |
assert(prt->hr() == hr, "Loop postcondition."); |
|
1025 |
*prev_addr = prt->next(); |
|
1026 |
PosParPRT::free(prt); |
|
1027 |
_n_fine_entries--; |
|
1028 |
return true; |
|
1029 |
} else { |
|
1030 |
return false; |
|
1031 |
} |
|
1032 |
} |
|
1033 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1034 |
bool OtherRegionsTable::contains_reference(OopOrNarrowOopStar from) const { |
1374 | 1035 |
// Cast away const in this case. |
1036 |
MutexLockerEx x((Mutex*)&_m, Mutex::_no_safepoint_check_flag); |
|
1037 |
return contains_reference_locked(from); |
|
1038 |
} |
|
1039 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1040 |
bool OtherRegionsTable::contains_reference_locked(OopOrNarrowOopStar from) const { |
1374 | 1041 |
HeapRegion* hr = _g1h->heap_region_containing_raw(from); |
1042 |
if (hr == NULL) return false; |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
1043 |
RegionIdx_t hr_ind = (RegionIdx_t) hr->hrs_index(); |
1374 | 1044 |
// Is this region in the coarse map? |
1045 |
if (_coarse_map.at(hr_ind)) return true; |
|
1046 |
||
1047 |
PosParPRT* prt = find_region_table(hr_ind & _mod_max_fine_entries_mask, |
|
1048 |
hr); |
|
1049 |
if (prt != NULL) { |
|
1050 |
return prt->contains_reference(from); |
|
1051 |
||
1052 |
} else { |
|
1053 |
uintptr_t from_card = |
|
1054 |
(uintptr_t(from) >> CardTableModRefBS::card_shift); |
|
1055 |
uintptr_t hr_bot_card_index = |
|
1056 |
uintptr_t(hr->bottom()) >> CardTableModRefBS::card_shift; |
|
1057 |
assert(from_card >= hr_bot_card_index, "Inv"); |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
1058 |
CardIdx_t card_index = from_card - hr_bot_card_index; |
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
1059 |
assert(0 <= card_index && card_index < HeapRegion::CardsPerRegion, |
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
1060 |
"Must be in range."); |
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
1061 |
return _sparse_table.contains_card(hr_ind, card_index); |
1374 | 1062 |
} |
1063 |
||
1064 |
||
1065 |
} |
|
1066 |
||
2882
d508a8bac491
6841831: G1: assert(contains_reference(from),"We just added it!") fires
iveresov
parents:
2881
diff
changeset
|
1067 |
// Determines how many threads can add records to an rset in parallel. |
d508a8bac491
6841831: G1: assert(contains_reference(from),"We just added it!") fires
iveresov
parents:
2881
diff
changeset
|
1068 |
// This can be done by either mutator threads together with the |
d508a8bac491
6841831: G1: assert(contains_reference(from),"We just added it!") fires
iveresov
parents:
2881
diff
changeset
|
1069 |
// concurrent refinement threads or GC threads. |
1374 | 1070 |
int HeapRegionRemSet::num_par_rem_sets() { |
2882
d508a8bac491
6841831: G1: assert(contains_reference(from),"We just added it!") fires
iveresov
parents:
2881
diff
changeset
|
1071 |
return (int)MAX2(DirtyCardQueueSet::num_par_ids() + ConcurrentG1Refine::thread_num(), ParallelGCThreads); |
1374 | 1072 |
} |
1073 |
||
1074 |
HeapRegionRemSet::HeapRegionRemSet(G1BlockOffsetSharedArray* bosa, |
|
1075 |
HeapRegion* hr) |
|
1076 |
: _bosa(bosa), _other_regions(hr), |
|
1077 |
_outgoing_region_map(G1CollectedHeap::heap()->max_regions(), |
|
1078 |
false /* in-resource-area */), |
|
1079 |
_iter_state(Unclaimed) |
|
1080 |
{} |
|
1081 |
||
1082 |
||
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1083 |
void HeapRegionRemSet::setup_remset_size() { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1084 |
// Setup sparse and fine-grain tables sizes. |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1085 |
// table_size = base * (log(region_size / 1M) + 1) |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1086 |
int region_size_log_mb = MAX2((int)HeapRegion::LogOfHRGrainBytes - (int)LOG_M, 0); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1087 |
if (FLAG_IS_DEFAULT(G1RSetSparseRegionEntries)) { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1088 |
G1RSetSparseRegionEntries = G1RSetSparseRegionEntriesBase * (region_size_log_mb + 1); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1089 |
} |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1090 |
if (FLAG_IS_DEFAULT(G1RSetRegionEntries)) { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1091 |
G1RSetRegionEntries = G1RSetRegionEntriesBase * (region_size_log_mb + 1); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1092 |
} |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1093 |
guarantee(G1RSetSparseRegionEntries > 0 && G1RSetRegionEntries > 0 , "Sanity"); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1094 |
} |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1095 |
|
1374 | 1096 |
void HeapRegionRemSet::init_for_par_iteration() { |
1097 |
_iter_state = Unclaimed; |
|
1098 |
} |
|
1099 |
||
1100 |
bool HeapRegionRemSet::claim_iter() { |
|
1101 |
if (_iter_state != Unclaimed) return false; |
|
1102 |
jint res = Atomic::cmpxchg(Claimed, (jint*)(&_iter_state), Unclaimed); |
|
1103 |
return (res == Unclaimed); |
|
1104 |
} |
|
1105 |
||
1106 |
void HeapRegionRemSet::set_iter_complete() { |
|
1107 |
_iter_state = Complete; |
|
1108 |
} |
|
1109 |
||
1110 |
bool HeapRegionRemSet::iter_is_complete() { |
|
1111 |
return _iter_state == Complete; |
|
1112 |
} |
|
1113 |
||
1114 |
||
1115 |
void HeapRegionRemSet::init_iterator(HeapRegionRemSetIterator* iter) const { |
|
1116 |
iter->initialize(this); |
|
1117 |
} |
|
1118 |
||
1119 |
#ifndef PRODUCT |
|
1120 |
void HeapRegionRemSet::print() const { |
|
1121 |
HeapRegionRemSetIterator iter; |
|
1122 |
init_iterator(&iter); |
|
1123 |
size_t card_index; |
|
1124 |
while (iter.has_next(card_index)) { |
|
1125 |
HeapWord* card_start = |
|
1126 |
G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index); |
|
1127 |
gclog_or_tty->print_cr(" Card " PTR_FORMAT ".", card_start); |
|
1128 |
} |
|
1129 |
// XXX |
|
1130 |
if (iter.n_yielded() != occupied()) { |
|
1131 |
gclog_or_tty->print_cr("Yielded disagrees with occupied:"); |
|
1132 |
gclog_or_tty->print_cr(" %6d yielded (%6d coarse, %6d fine).", |
|
1133 |
iter.n_yielded(), |
|
1134 |
iter.n_yielded_coarse(), iter.n_yielded_fine()); |
|
1135 |
gclog_or_tty->print_cr(" %6d occ (%6d coarse, %6d fine).", |
|
1136 |
occupied(), occ_coarse(), occ_fine()); |
|
1137 |
} |
|
1138 |
guarantee(iter.n_yielded() == occupied(), |
|
1139 |
"We should have yielded all the represented cards."); |
|
1140 |
} |
|
1141 |
#endif |
|
1142 |
||
1143 |
void HeapRegionRemSet::cleanup() { |
|
1144 |
SparsePRT::cleanup_all(); |
|
1145 |
} |
|
1146 |
||
1147 |
void HeapRegionRemSet::par_cleanup() { |
|
1148 |
PosParPRT::par_contract_all(); |
|
1149 |
} |
|
1150 |
||
1151 |
void HeapRegionRemSet::add_outgoing_reference(HeapRegion* to_hr) { |
|
1152 |
_outgoing_region_map.par_at_put(to_hr->hrs_index(), 1); |
|
1153 |
} |
|
1154 |
||
1155 |
void HeapRegionRemSet::clear() { |
|
1156 |
clear_outgoing_entries(); |
|
1157 |
_outgoing_region_map.clear(); |
|
1158 |
_other_regions.clear(); |
|
1159 |
assert(occupied() == 0, "Should be clear."); |
|
1160 |
} |
|
1161 |
||
1162 |
void HeapRegionRemSet::clear_outgoing_entries() { |
|
1163 |
G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
|
1164 |
size_t i = _outgoing_region_map.get_next_one_offset(0); |
|
1165 |
while (i < _outgoing_region_map.size()) { |
|
1166 |
HeapRegion* to_region = g1h->region_at(i); |
|
2009 | 1167 |
if (!to_region->in_collection_set()) { |
1168 |
to_region->rem_set()->clear_incoming_entry(hr()); |
|
1169 |
} |
|
1374 | 1170 |
i = _outgoing_region_map.get_next_one_offset(i+1); |
1171 |
} |
|
1172 |
} |
|
1173 |
||
1174 |
||
1175 |
void HeapRegionRemSet::scrub(CardTableModRefBS* ctbs, |
|
1176 |
BitMap* region_bm, BitMap* card_bm) { |
|
1177 |
_other_regions.scrub(ctbs, region_bm, card_bm); |
|
1178 |
} |
|
1179 |
||
1180 |
//-------------------- Iteration -------------------- |
|
1181 |
||
1182 |
HeapRegionRemSetIterator:: |
|
1183 |
HeapRegionRemSetIterator() : |
|
1184 |
_hrrs(NULL), |
|
1185 |
_g1h(G1CollectedHeap::heap()), |
|
1186 |
_bosa(NULL), |
|
1187 |
_sparse_iter(size_t(G1CollectedHeap::heap()->reserved_region().start()) |
|
1188 |
>> CardTableModRefBS::card_shift) |
|
1189 |
{} |
|
1190 |
||
1191 |
void HeapRegionRemSetIterator::initialize(const HeapRegionRemSet* hrrs) { |
|
1192 |
_hrrs = hrrs; |
|
1193 |
_coarse_map = &_hrrs->_other_regions._coarse_map; |
|
1194 |
_fine_grain_regions = _hrrs->_other_regions._fine_grain_regions; |
|
1195 |
_bosa = _hrrs->bosa(); |
|
1196 |
||
1197 |
_is = Sparse; |
|
1198 |
// Set these values so that we increment to the first region. |
|
1199 |
_coarse_cur_region_index = -1; |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
1200 |
_coarse_cur_region_cur_card = (HeapRegion::CardsPerRegion-1);; |
1374 | 1201 |
|
1202 |
_cur_region_cur_card = 0; |
|
1203 |
||
1204 |
_fine_array_index = -1; |
|
1205 |
_fine_cur_prt = NULL; |
|
1206 |
||
1207 |
_n_yielded_coarse = 0; |
|
1208 |
_n_yielded_fine = 0; |
|
1209 |
_n_yielded_sparse = 0; |
|
1210 |
||
1211 |
_sparse_iter.init(&hrrs->_other_regions._sparse_table); |
|
1212 |
} |
|
1213 |
||
1214 |
bool HeapRegionRemSetIterator::coarse_has_next(size_t& card_index) { |
|
1215 |
if (_hrrs->_other_regions._n_coarse_entries == 0) return false; |
|
1216 |
// Go to the next card. |
|
1217 |
_coarse_cur_region_cur_card++; |
|
1218 |
// Was the last the last card in the current region? |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
1219 |
if (_coarse_cur_region_cur_card == HeapRegion::CardsPerRegion) { |
1374 | 1220 |
// Yes: find the next region. This may leave _coarse_cur_region_index |
1221 |
// Set to the last index, in which case there are no more coarse |
|
1222 |
// regions. |
|
1223 |
_coarse_cur_region_index = |
|
1224 |
(int) _coarse_map->get_next_one_offset(_coarse_cur_region_index + 1); |
|
1225 |
if ((size_t)_coarse_cur_region_index < _coarse_map->size()) { |
|
1226 |
_coarse_cur_region_cur_card = 0; |
|
1227 |
HeapWord* r_bot = |
|
1228 |
_g1h->region_at(_coarse_cur_region_index)->bottom(); |
|
1229 |
_cur_region_card_offset = _bosa->index_for(r_bot); |
|
1230 |
} else { |
|
1231 |
return false; |
|
1232 |
} |
|
1233 |
} |
|
1234 |
// If we didn't return false above, then we can yield a card. |
|
1235 |
card_index = _cur_region_card_offset + _coarse_cur_region_cur_card; |
|
1236 |
return true; |
|
1237 |
} |
|
1238 |
||
1239 |
void HeapRegionRemSetIterator::fine_find_next_non_null_prt() { |
|
1240 |
// Otherwise, find the next bucket list in the array. |
|
1241 |
_fine_array_index++; |
|
1242 |
while (_fine_array_index < (int) OtherRegionsTable::_max_fine_entries) { |
|
1243 |
_fine_cur_prt = _fine_grain_regions[_fine_array_index]; |
|
1244 |
if (_fine_cur_prt != NULL) return; |
|
1245 |
else _fine_array_index++; |
|
1246 |
} |
|
1247 |
assert(_fine_cur_prt == NULL, "Loop post"); |
|
1248 |
} |
|
1249 |
||
1250 |
bool HeapRegionRemSetIterator::fine_has_next(size_t& card_index) { |
|
1251 |
if (fine_has_next()) { |
|
1252 |
_cur_region_cur_card = |
|
1253 |
_fine_cur_prt->_bm.get_next_one_offset(_cur_region_cur_card + 1); |
|
1254 |
} |
|
1255 |
while (!fine_has_next()) { |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
1256 |
if (_cur_region_cur_card == (size_t) HeapRegion::CardsPerRegion) { |
1374 | 1257 |
_cur_region_cur_card = 0; |
1258 |
_fine_cur_prt = _fine_cur_prt->next(); |
|
1259 |
} |
|
1260 |
if (_fine_cur_prt == NULL) { |
|
1261 |
fine_find_next_non_null_prt(); |
|
1262 |
if (_fine_cur_prt == NULL) return false; |
|
1263 |
} |
|
1264 |
assert(_fine_cur_prt != NULL && _cur_region_cur_card == 0, |
|
1265 |
"inv."); |
|
1266 |
HeapWord* r_bot = |
|
1267 |
_fine_cur_prt->hr()->bottom(); |
|
1268 |
_cur_region_card_offset = _bosa->index_for(r_bot); |
|
1269 |
_cur_region_cur_card = _fine_cur_prt->_bm.get_next_one_offset(0); |
|
1270 |
} |
|
1271 |
assert(fine_has_next(), "Or else we exited the loop via the return."); |
|
1272 |
card_index = _cur_region_card_offset + _cur_region_cur_card; |
|
1273 |
return true; |
|
1274 |
} |
|
1275 |
||
1276 |
bool HeapRegionRemSetIterator::fine_has_next() { |
|
1277 |
return |
|
1278 |
_fine_cur_prt != NULL && |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
1279 |
_cur_region_cur_card < (size_t) HeapRegion::CardsPerRegion; |
1374 | 1280 |
} |
1281 |
||
1282 |
bool HeapRegionRemSetIterator::has_next(size_t& card_index) { |
|
1283 |
switch (_is) { |
|
1284 |
case Sparse: |
|
1285 |
if (_sparse_iter.has_next(card_index)) { |
|
1286 |
_n_yielded_sparse++; |
|
1287 |
return true; |
|
1288 |
} |
|
1289 |
// Otherwise, deliberate fall-through |
|
1290 |
_is = Fine; |
|
1291 |
case Fine: |
|
1292 |
if (fine_has_next(card_index)) { |
|
1293 |
_n_yielded_fine++; |
|
1294 |
return true; |
|
1295 |
} |
|
1296 |
// Otherwise, deliberate fall-through |
|
1297 |
_is = Coarse; |
|
1298 |
case Coarse: |
|
1299 |
if (coarse_has_next(card_index)) { |
|
1300 |
_n_yielded_coarse++; |
|
1301 |
return true; |
|
1302 |
} |
|
1303 |
// Otherwise... |
|
1304 |
break; |
|
1305 |
} |
|
1306 |
assert(ParallelGCThreads > 1 || |
|
1307 |
n_yielded() == _hrrs->occupied(), |
|
1308 |
"Should have yielded all the cards in the rem set " |
|
1309 |
"(in the non-par case)."); |
|
1310 |
return false; |
|
1311 |
} |
|
1312 |
||
1313 |
||
1314 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1315 |
OopOrNarrowOopStar* HeapRegionRemSet::_recorded_oops = NULL; |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1316 |
HeapWord** HeapRegionRemSet::_recorded_cards = NULL; |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1317 |
HeapRegion** HeapRegionRemSet::_recorded_regions = NULL; |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1318 |
int HeapRegionRemSet::_n_recorded = 0; |
1374 | 1319 |
|
1320 |
HeapRegionRemSet::Event* HeapRegionRemSet::_recorded_events = NULL; |
|
1321 |
int* HeapRegionRemSet::_recorded_event_index = NULL; |
|
1322 |
int HeapRegionRemSet::_n_recorded_events = 0; |
|
1323 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1324 |
void HeapRegionRemSet::record(HeapRegion* hr, OopOrNarrowOopStar f) { |
1374 | 1325 |
if (_recorded_oops == NULL) { |
1326 |
assert(_n_recorded == 0 |
|
1327 |
&& _recorded_cards == NULL |
|
1328 |
&& _recorded_regions == NULL, |
|
1329 |
"Inv"); |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1330 |
_recorded_oops = NEW_C_HEAP_ARRAY(OopOrNarrowOopStar, MaxRecorded); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1331 |
_recorded_cards = NEW_C_HEAP_ARRAY(HeapWord*, MaxRecorded); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1332 |
_recorded_regions = NEW_C_HEAP_ARRAY(HeapRegion*, MaxRecorded); |
1374 | 1333 |
} |
1334 |
if (_n_recorded == MaxRecorded) { |
|
1335 |
gclog_or_tty->print_cr("Filled up 'recorded' (%d).", MaxRecorded); |
|
1336 |
} else { |
|
1337 |
_recorded_cards[_n_recorded] = |
|
1338 |
(HeapWord*)align_size_down(uintptr_t(f), |
|
1339 |
CardTableModRefBS::card_size); |
|
1340 |
_recorded_oops[_n_recorded] = f; |
|
1341 |
_recorded_regions[_n_recorded] = hr; |
|
1342 |
_n_recorded++; |
|
1343 |
} |
|
1344 |
} |
|
1345 |
||
1346 |
void HeapRegionRemSet::record_event(Event evnt) { |
|
1347 |
if (!G1RecordHRRSEvents) return; |
|
1348 |
||
1349 |
if (_recorded_events == NULL) { |
|
1350 |
assert(_n_recorded_events == 0 |
|
1351 |
&& _recorded_event_index == NULL, |
|
1352 |
"Inv"); |
|
1353 |
_recorded_events = NEW_C_HEAP_ARRAY(Event, MaxRecordedEvents); |
|
1354 |
_recorded_event_index = NEW_C_HEAP_ARRAY(int, MaxRecordedEvents); |
|
1355 |
} |
|
1356 |
if (_n_recorded_events == MaxRecordedEvents) { |
|
1357 |
gclog_or_tty->print_cr("Filled up 'recorded_events' (%d).", MaxRecordedEvents); |
|
1358 |
} else { |
|
1359 |
_recorded_events[_n_recorded_events] = evnt; |
|
1360 |
_recorded_event_index[_n_recorded_events] = _n_recorded; |
|
1361 |
_n_recorded_events++; |
|
1362 |
} |
|
1363 |
} |
|
1364 |
||
1365 |
void HeapRegionRemSet::print_event(outputStream* str, Event evnt) { |
|
1366 |
switch (evnt) { |
|
1367 |
case Event_EvacStart: |
|
1368 |
str->print("Evac Start"); |
|
1369 |
break; |
|
1370 |
case Event_EvacEnd: |
|
1371 |
str->print("Evac End"); |
|
1372 |
break; |
|
1373 |
case Event_RSUpdateEnd: |
|
1374 |
str->print("RS Update End"); |
|
1375 |
break; |
|
1376 |
} |
|
1377 |
} |
|
1378 |
||
1379 |
void HeapRegionRemSet::print_recorded() { |
|
1380 |
int cur_evnt = 0; |
|
1381 |
Event cur_evnt_kind; |
|
1382 |
int cur_evnt_ind = 0; |
|
1383 |
if (_n_recorded_events > 0) { |
|
1384 |
cur_evnt_kind = _recorded_events[cur_evnt]; |
|
1385 |
cur_evnt_ind = _recorded_event_index[cur_evnt]; |
|
1386 |
} |
|
1387 |
||
1388 |
for (int i = 0; i < _n_recorded; i++) { |
|
1389 |
while (cur_evnt < _n_recorded_events && i == cur_evnt_ind) { |
|
1390 |
gclog_or_tty->print("Event: "); |
|
1391 |
print_event(gclog_or_tty, cur_evnt_kind); |
|
1392 |
gclog_or_tty->print_cr(""); |
|
1393 |
cur_evnt++; |
|
1394 |
if (cur_evnt < MaxRecordedEvents) { |
|
1395 |
cur_evnt_kind = _recorded_events[cur_evnt]; |
|
1396 |
cur_evnt_ind = _recorded_event_index[cur_evnt]; |
|
1397 |
} |
|
1398 |
} |
|
1399 |
gclog_or_tty->print("Added card " PTR_FORMAT " to region [" PTR_FORMAT "...]" |
|
1400 |
" for ref " PTR_FORMAT ".\n", |
|
1401 |
_recorded_cards[i], _recorded_regions[i]->bottom(), |
|
1402 |
_recorded_oops[i]); |
|
1403 |
} |
|
1404 |
} |
|
1405 |
||
1406 |
#ifndef PRODUCT |
|
1407 |
void HeapRegionRemSet::test() { |
|
1408 |
os::sleep(Thread::current(), (jlong)5000, false); |
|
1409 |
G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
|
1410 |
||
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
1411 |
// Run with "-XX:G1LogRSetRegionEntries=2", so that 1 and 5 end up in same |
1374 | 1412 |
// hash bucket. |
1413 |
HeapRegion* hr0 = g1h->region_at(0); |
|
1414 |
HeapRegion* hr1 = g1h->region_at(1); |
|
1415 |
HeapRegion* hr2 = g1h->region_at(5); |
|
1416 |
HeapRegion* hr3 = g1h->region_at(6); |
|
1417 |
HeapRegion* hr4 = g1h->region_at(7); |
|
1418 |
HeapRegion* hr5 = g1h->region_at(8); |
|
1419 |
||
1420 |
HeapWord* hr1_start = hr1->bottom(); |
|
1421 |
HeapWord* hr1_mid = hr1_start + HeapRegion::GrainWords/2; |
|
1422 |
HeapWord* hr1_last = hr1->end() - 1; |
|
1423 |
||
1424 |
HeapWord* hr2_start = hr2->bottom(); |
|
1425 |
HeapWord* hr2_mid = hr2_start + HeapRegion::GrainWords/2; |
|
1426 |
HeapWord* hr2_last = hr2->end() - 1; |
|
1427 |
||
1428 |
HeapWord* hr3_start = hr3->bottom(); |
|
1429 |
HeapWord* hr3_mid = hr3_start + HeapRegion::GrainWords/2; |
|
1430 |
HeapWord* hr3_last = hr3->end() - 1; |
|
1431 |
||
1432 |
HeapRegionRemSet* hrrs = hr0->rem_set(); |
|
1433 |
||
1434 |
// Make three references from region 0x101... |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1435 |
hrrs->add_reference((OopOrNarrowOopStar)hr1_start); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1436 |
hrrs->add_reference((OopOrNarrowOopStar)hr1_mid); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1437 |
hrrs->add_reference((OopOrNarrowOopStar)hr1_last); |
1374 | 1438 |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1439 |
hrrs->add_reference((OopOrNarrowOopStar)hr2_start); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1440 |
hrrs->add_reference((OopOrNarrowOopStar)hr2_mid); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1441 |
hrrs->add_reference((OopOrNarrowOopStar)hr2_last); |
1374 | 1442 |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1443 |
hrrs->add_reference((OopOrNarrowOopStar)hr3_start); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1444 |
hrrs->add_reference((OopOrNarrowOopStar)hr3_mid); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1445 |
hrrs->add_reference((OopOrNarrowOopStar)hr3_last); |
1374 | 1446 |
|
1447 |
// Now cause a coarsening. |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1448 |
hrrs->add_reference((OopOrNarrowOopStar)hr4->bottom()); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1449 |
hrrs->add_reference((OopOrNarrowOopStar)hr5->bottom()); |
1374 | 1450 |
|
1451 |
// Now, does iteration yield these three? |
|
1452 |
HeapRegionRemSetIterator iter; |
|
1453 |
hrrs->init_iterator(&iter); |
|
1454 |
size_t sum = 0; |
|
1455 |
size_t card_index; |
|
1456 |
while (iter.has_next(card_index)) { |
|
1457 |
HeapWord* card_start = |
|
1458 |
G1CollectedHeap::heap()->bot_shared()->address_for_index(card_index); |
|
1459 |
gclog_or_tty->print_cr(" Card " PTR_FORMAT ".", card_start); |
|
1460 |
sum++; |
|
1461 |
} |
|
1462 |
guarantee(sum == 11 - 3 + 2048, "Failure"); |
|
1463 |
guarantee(sum == hrrs->occupied(), "Failure"); |
|
1464 |
} |
|
1465 |
#endif |