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