author | mgerdin |
Wed, 03 Feb 2016 11:33:33 +0100 | |
changeset 35927 | 58bbbbb4a8c7 |
parent 35880 | 7b253cfc2eac |
child 37414 | 2672ba9af0dc |
permissions | -rw-r--r-- |
1374 | 1 |
/* |
35879 | 2 |
* Copyright (c) 2001, 2016, Oracle and/or its affiliates. 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5346
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5346
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
5346
diff
changeset
|
21 |
* questions. |
1374 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
30764 | 26 |
#include "gc/g1/concurrentG1Refine.hpp" |
27 |
#include "gc/g1/g1BlockOffsetTable.inline.hpp" |
|
28 |
#include "gc/g1/g1CollectedHeap.inline.hpp" |
|
29 |
#include "gc/g1/heapRegionManager.inline.hpp" |
|
30 |
#include "gc/g1/heapRegionRemSet.hpp" |
|
31 |
#include "gc/shared/space.inline.hpp" |
|
7397 | 32 |
#include "memory/allocation.hpp" |
23452
d7dca4e6b95d
8035815: Cache-align and pad the from card cache
tschatzl
parents:
23451
diff
changeset
|
33 |
#include "memory/padded.inline.hpp" |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
34 |
#include "oops/oop.inline.hpp" |
25351
7c198a690050
8044775: Improve usage of umbrella header atomic.inline.hpp.
goetz
parents:
24424
diff
changeset
|
35 |
#include "runtime/atomic.inline.hpp" |
7397 | 36 |
#include "utilities/bitMap.inline.hpp" |
37 |
#include "utilities/globalDefinitions.hpp" |
|
19339 | 38 |
#include "utilities/growableArray.hpp" |
1374 | 39 |
|
13195 | 40 |
class PerRegionTable: public CHeapObj<mtGC> { |
1374 | 41 |
friend class OtherRegionsTable; |
42 |
friend class HeapRegionRemSetIterator; |
|
43 |
||
44 |
HeapRegion* _hr; |
|
45 |
BitMap _bm; |
|
46 |
jint _occupied; |
|
47 |
||
13335 | 48 |
// next pointer for free/allocated 'all' list |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
49 |
PerRegionTable* _next; |
1374 | 50 |
|
13335 | 51 |
// prev pointer for the allocated 'all' list |
52 |
PerRegionTable* _prev; |
|
1374 | 53 |
|
13335 | 54 |
// next pointer in collision list |
55 |
PerRegionTable * _collision_list_next; |
|
1374 | 56 |
|
13335 | 57 |
// Global free list of PRTs |
58 |
static PerRegionTable* _free_list; |
|
1374 | 59 |
|
60 |
protected: |
|
61 |
// We need access in order to union things into the base table. |
|
62 |
BitMap* bm() { return &_bm; } |
|
63 |
||
64 |
void recount_occupied() { |
|
65 |
_occupied = (jint) bm()->count_one_bits(); |
|
66 |
} |
|
67 |
||
68 |
PerRegionTable(HeapRegion* hr) : |
|
69 |
_hr(hr), |
|
70 |
_occupied(0), |
|
13335 | 71 |
_bm(HeapRegion::CardsPerRegion, false /* in-resource-area */), |
72 |
_collision_list_next(NULL), _next(NULL), _prev(NULL) |
|
1374 | 73 |
{} |
74 |
||
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
75 |
void add_card_work(CardIdx_t from_card, bool par) { |
1374 | 76 |
if (!_bm.at(from_card)) { |
77 |
if (par) { |
|
78 |
if (_bm.par_at_put(from_card, 1)) { |
|
79 |
Atomic::inc(&_occupied); |
|
80 |
} |
|
81 |
} else { |
|
82 |
_bm.at_put(from_card, 1); |
|
83 |
_occupied++; |
|
84 |
} |
|
85 |
} |
|
86 |
} |
|
87 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
88 |
void add_reference_work(OopOrNarrowOopStar from, bool par) { |
1374 | 89 |
// Must make this robust in case "from" is not in "_hr", because of |
90 |
// concurrency. |
|
91 |
||
92 |
HeapRegion* loc_hr = hr(); |
|
93 |
// If the test below fails, then this table was reused concurrently |
|
94 |
// with this operation. This is OK, since the old table was coarsened, |
|
95 |
// and adding a bit to the new table is never incorrect. |
|
10767
4ce4a9b10523
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
10677
diff
changeset
|
96 |
// If the table used to belong to a continues humongous region and is |
4ce4a9b10523
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
10677
diff
changeset
|
97 |
// now reused for the corresponding start humongous region, we need to |
4ce4a9b10523
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
10677
diff
changeset
|
98 |
// make sure that we detect this. Thus, we call is_in_reserved_raw() |
4ce4a9b10523
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
10677
diff
changeset
|
99 |
// instead of just is_in_reserved() here. |
33786
ac8da6513351
8139867: Change how startsHumongous and continuesHumongous regions work in G1.
david
parents:
33783
diff
changeset
|
100 |
if (loc_hr->is_in_reserved(from)) { |
1374 | 101 |
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
|
102 |
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
|
103 |
hw_offset >> (CardTableModRefBS::card_shift - LogHeapWordSize); |
1374 | 104 |
|
10677
370a8da2d63f
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
10243
diff
changeset
|
105 |
assert(0 <= from_card && (size_t)from_card < HeapRegion::CardsPerRegion, |
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
106 |
"Must be in range."); |
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
107 |
add_card_work(from_card, par); |
1374 | 108 |
} |
109 |
} |
|
110 |
||
111 |
public: |
|
112 |
||
35875
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
113 |
HeapRegion* hr() const { |
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
114 |
return (HeapRegion*) OrderAccess::load_ptr_acquire(&_hr); |
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
115 |
} |
1374 | 116 |
|
117 |
jint occupied() const { |
|
118 |
// Overkill, but if we ever need it... |
|
119 |
// guarantee(_occupied == _bm.count_one_bits(), "Check"); |
|
120 |
return _occupied; |
|
121 |
} |
|
122 |
||
13335 | 123 |
void init(HeapRegion* hr, bool clear_links_to_all_list) { |
124 |
if (clear_links_to_all_list) { |
|
125 |
set_next(NULL); |
|
126 |
set_prev(NULL); |
|
127 |
} |
|
128 |
_collision_list_next = NULL; |
|
1374 | 129 |
_occupied = 0; |
130 |
_bm.clear(); |
|
35875
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
131 |
// Make sure that the bitmap clearing above has been finished before publishing |
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
132 |
// this PRT to concurrent threads. |
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
133 |
OrderAccess::release_store_ptr(&_hr, hr); |
1374 | 134 |
} |
135 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
136 |
void add_reference(OopOrNarrowOopStar from) { |
1374 | 137 |
add_reference_work(from, /*parallel*/ true); |
138 |
} |
|
139 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
140 |
void seq_add_reference(OopOrNarrowOopStar from) { |
1374 | 141 |
add_reference_work(from, /*parallel*/ false); |
142 |
} |
|
143 |
||
144 |
void scrub(CardTableModRefBS* ctbs, BitMap* card_bm) { |
|
145 |
HeapWord* hr_bot = hr()->bottom(); |
|
1676
d80e69372634
6653214: MemoryPoolMXBean.setUsageThreshold() does not support large heap sizes.
swamyv
parents:
1374
diff
changeset
|
146 |
size_t hr_first_card_index = ctbs->index_for(hr_bot); |
1374 | 147 |
bm()->set_intersection_at_offset(*card_bm, hr_first_card_index); |
148 |
recount_occupied(); |
|
149 |
} |
|
150 |
||
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
151 |
void add_card(CardIdx_t from_card_index) { |
1374 | 152 |
add_card_work(from_card_index, /*parallel*/ true); |
153 |
} |
|
154 |
||
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
155 |
void seq_add_card(CardIdx_t from_card_index) { |
1374 | 156 |
add_card_work(from_card_index, /*parallel*/ false); |
157 |
} |
|
158 |
||
159 |
// (Destructively) union the bitmap of the current table into the given |
|
160 |
// bitmap (which is assumed to be of the same size.) |
|
161 |
void union_bitmap_into(BitMap* bm) { |
|
162 |
bm->set_union(_bm); |
|
163 |
} |
|
164 |
||
165 |
// Mem size in bytes. |
|
166 |
size_t mem_size() const { |
|
24108
dfc2242fc6b0
8040792: G1: Memory usage calculation uses sizeof(this) instead of sizeof(classname)
tschatzl
parents:
24106
diff
changeset
|
167 |
return sizeof(PerRegionTable) + _bm.size_in_words() * HeapWordSize; |
1374 | 168 |
} |
169 |
||
170 |
// Requires "from" to be in "hr()". |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
171 |
bool contains_reference(OopOrNarrowOopStar from) const { |
1374 | 172 |
assert(hr()->is_in_reserved(from), "Precondition."); |
173 |
size_t card_ind = pointer_delta(from, hr()->bottom(), |
|
174 |
CardTableModRefBS::card_size); |
|
175 |
return _bm.at(card_ind); |
|
176 |
} |
|
177 |
||
13335 | 178 |
// Bulk-free the PRTs from prt to last, assumes that they are |
179 |
// linked together using their _next field. |
|
180 |
static void bulk_free(PerRegionTable* prt, PerRegionTable* last) { |
|
1374 | 181 |
while (true) { |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
182 |
PerRegionTable* fl = _free_list; |
13335 | 183 |
last->set_next(fl); |
184 |
PerRegionTable* res = (PerRegionTable*) Atomic::cmpxchg_ptr(prt, &_free_list, fl); |
|
185 |
if (res == fl) { |
|
186 |
return; |
|
187 |
} |
|
1374 | 188 |
} |
189 |
ShouldNotReachHere(); |
|
190 |
} |
|
191 |
||
13335 | 192 |
static void free(PerRegionTable* prt) { |
193 |
bulk_free(prt, prt); |
|
194 |
} |
|
195 |
||
196 |
// Returns an initialized PerRegionTable instance. |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
197 |
static PerRegionTable* alloc(HeapRegion* hr) { |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
198 |
PerRegionTable* fl = _free_list; |
1374 | 199 |
while (fl != NULL) { |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
200 |
PerRegionTable* nxt = fl->next(); |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
201 |
PerRegionTable* res = |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
202 |
(PerRegionTable*) |
1374 | 203 |
Atomic::cmpxchg_ptr(nxt, &_free_list, fl); |
204 |
if (res == fl) { |
|
13335 | 205 |
fl->init(hr, true); |
1374 | 206 |
return fl; |
207 |
} else { |
|
208 |
fl = _free_list; |
|
209 |
} |
|
210 |
} |
|
211 |
assert(fl == NULL, "Loop condition."); |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
212 |
return new PerRegionTable(hr); |
1374 | 213 |
} |
214 |
||
13335 | 215 |
PerRegionTable* next() const { return _next; } |
216 |
void set_next(PerRegionTable* next) { _next = next; } |
|
217 |
PerRegionTable* prev() const { return _prev; } |
|
218 |
void set_prev(PerRegionTable* prev) { _prev = prev; } |
|
219 |
||
220 |
// Accessor and Modification routines for the pointer for the |
|
221 |
// singly linked collision list that links the PRTs within the |
|
222 |
// OtherRegionsTable::_fine_grain_regions hash table. |
|
223 |
// |
|
224 |
// It might be useful to also make the collision list doubly linked |
|
225 |
// to avoid iteration over the collisions list during scrubbing/deletion. |
|
226 |
// OTOH there might not be many collisions. |
|
227 |
||
228 |
PerRegionTable* collision_list_next() const { |
|
229 |
return _collision_list_next; |
|
230 |
} |
|
231 |
||
232 |
void set_collision_list_next(PerRegionTable* next) { |
|
233 |
_collision_list_next = next; |
|
234 |
} |
|
235 |
||
236 |
PerRegionTable** collision_list_next_addr() { |
|
237 |
return &_collision_list_next; |
|
238 |
} |
|
239 |
||
1374 | 240 |
static size_t fl_mem_size() { |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
241 |
PerRegionTable* cur = _free_list; |
1374 | 242 |
size_t res = 0; |
243 |
while (cur != NULL) { |
|
17631
17992863b0ab
8014405: G1: PerRegionTable::fl_mem_size() calculates size of the free list using wrong element sizes
tschatzl
parents:
17398
diff
changeset
|
244 |
res += cur->mem_size(); |
1374 | 245 |
cur = cur->next(); |
246 |
} |
|
247 |
return res; |
|
248 |
} |
|
17631
17992863b0ab
8014405: G1: PerRegionTable::fl_mem_size() calculates size of the free list using wrong element sizes
tschatzl
parents:
17398
diff
changeset
|
249 |
|
17992863b0ab
8014405: G1: PerRegionTable::fl_mem_size() calculates size of the free list using wrong element sizes
tschatzl
parents:
17398
diff
changeset
|
250 |
static void test_fl_mem_size(); |
1374 | 251 |
}; |
252 |
||
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
253 |
PerRegionTable* PerRegionTable::_free_list = NULL; |
1374 | 254 |
|
255 |
size_t OtherRegionsTable::_max_fine_entries = 0; |
|
256 |
size_t OtherRegionsTable::_mod_max_fine_entries_mask = 0; |
|
257 |
size_t OtherRegionsTable::_fine_eviction_stride = 0; |
|
258 |
size_t OtherRegionsTable::_fine_eviction_sample_size = 0; |
|
259 |
||
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
260 |
OtherRegionsTable::OtherRegionsTable(HeapRegion* hr, Mutex* m) : |
1374 | 261 |
_g1h(G1CollectedHeap::heap()), |
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
262 |
_hr(hr), _m(m), |
1374 | 263 |
_coarse_map(G1CollectedHeap::heap()->max_regions(), |
264 |
false /* in-resource-area */), |
|
265 |
_fine_grain_regions(NULL), |
|
13335 | 266 |
_first_all_fine_prts(NULL), _last_all_fine_prts(NULL), |
1374 | 267 |
_n_fine_entries(0), _n_coarse_entries(0), |
268 |
_fine_eviction_start(0), |
|
269 |
_sparse_table(hr) |
|
270 |
{ |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
271 |
typedef PerRegionTable* PerRegionTablePtr; |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
272 |
|
1374 | 273 |
if (_max_fine_entries == 0) { |
274 |
assert(_mod_max_fine_entries_mask == 0, "Both or none."); |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
275 |
size_t max_entries_log = (size_t)log2_long((jlong)G1RSetRegionEntries); |
13752
92f03fcf979a
7197906: BlockOffsetArray::power_to_cards_back() needs to handle > 32 bit shifts
brutisso
parents:
13335
diff
changeset
|
276 |
_max_fine_entries = (size_t)1 << max_entries_log; |
1374 | 277 |
_mod_max_fine_entries_mask = _max_fine_entries - 1; |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
278 |
|
1374 | 279 |
assert(_fine_eviction_sample_size == 0 |
280 |
&& _fine_eviction_stride == 0, "All init at same time."); |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
281 |
_fine_eviction_sample_size = MAX2((size_t)4, max_entries_log); |
1374 | 282 |
_fine_eviction_stride = _max_fine_entries / _fine_eviction_sample_size; |
283 |
} |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
284 |
|
17376
4ee999c3c007
8012902: remove use of global operator new - take 2
minqi
parents:
17119
diff
changeset
|
285 |
_fine_grain_regions = NEW_C_HEAP_ARRAY3(PerRegionTablePtr, _max_fine_entries, |
25946 | 286 |
mtGC, CURRENT_PC, AllocFailStrategy::RETURN_NULL); |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
287 |
|
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
288 |
if (_fine_grain_regions == NULL) { |
17087
f0b76c4c93a0
8011661: Insufficient memory message says "malloc" when sometimes it should say "mmap"
ccheung
parents:
17031
diff
changeset
|
289 |
vm_exit_out_of_memory(sizeof(void*)*_max_fine_entries, OOM_MALLOC_ERROR, |
1374 | 290 |
"Failed to allocate _fine_grain_entries."); |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
291 |
} |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
292 |
|
1374 | 293 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
294 |
_fine_grain_regions[i] = NULL; |
|
295 |
} |
|
296 |
} |
|
297 |
||
13335 | 298 |
void OtherRegionsTable::link_to_all(PerRegionTable* prt) { |
299 |
// We always append to the beginning of the list for convenience; |
|
300 |
// the order of entries in this list does not matter. |
|
301 |
if (_first_all_fine_prts != NULL) { |
|
302 |
assert(_first_all_fine_prts->prev() == NULL, "invariant"); |
|
303 |
_first_all_fine_prts->set_prev(prt); |
|
304 |
prt->set_next(_first_all_fine_prts); |
|
305 |
} else { |
|
306 |
// this is the first element we insert. Adjust the "last" pointer |
|
307 |
_last_all_fine_prts = prt; |
|
308 |
assert(prt->next() == NULL, "just checking"); |
|
309 |
} |
|
310 |
// the new element is always the first element without a predecessor |
|
311 |
prt->set_prev(NULL); |
|
312 |
_first_all_fine_prts = prt; |
|
313 |
||
314 |
assert(prt->prev() == NULL, "just checking"); |
|
315 |
assert(_first_all_fine_prts == prt, "just checking"); |
|
316 |
assert((_first_all_fine_prts == NULL && _last_all_fine_prts == NULL) || |
|
317 |
(_first_all_fine_prts != NULL && _last_all_fine_prts != NULL), |
|
318 |
"just checking"); |
|
319 |
assert(_last_all_fine_prts == NULL || _last_all_fine_prts->next() == NULL, |
|
320 |
"just checking"); |
|
321 |
assert(_first_all_fine_prts == NULL || _first_all_fine_prts->prev() == NULL, |
|
322 |
"just checking"); |
|
323 |
} |
|
324 |
||
325 |
void OtherRegionsTable::unlink_from_all(PerRegionTable* prt) { |
|
326 |
if (prt->prev() != NULL) { |
|
327 |
assert(_first_all_fine_prts != prt, "just checking"); |
|
328 |
prt->prev()->set_next(prt->next()); |
|
329 |
// removing the last element in the list? |
|
330 |
if (_last_all_fine_prts == prt) { |
|
331 |
_last_all_fine_prts = prt->prev(); |
|
332 |
} |
|
333 |
} else { |
|
334 |
assert(_first_all_fine_prts == prt, "just checking"); |
|
335 |
_first_all_fine_prts = prt->next(); |
|
336 |
// list is empty now? |
|
337 |
if (_first_all_fine_prts == NULL) { |
|
338 |
_last_all_fine_prts = NULL; |
|
339 |
} |
|
340 |
} |
|
341 |
||
342 |
if (prt->next() != NULL) { |
|
343 |
prt->next()->set_prev(prt->prev()); |
|
344 |
} |
|
345 |
||
346 |
prt->set_next(NULL); |
|
347 |
prt->set_prev(NULL); |
|
348 |
||
349 |
assert((_first_all_fine_prts == NULL && _last_all_fine_prts == NULL) || |
|
350 |
(_first_all_fine_prts != NULL && _last_all_fine_prts != NULL), |
|
351 |
"just checking"); |
|
352 |
assert(_last_all_fine_prts == NULL || _last_all_fine_prts->next() == NULL, |
|
353 |
"just checking"); |
|
354 |
assert(_first_all_fine_prts == NULL || _first_all_fine_prts->prev() == NULL, |
|
355 |
"just checking"); |
|
356 |
} |
|
357 |
||
26850
515ff48cf5f0
8036116: Fix thread-id types in G1 remembered set implementations
brutisso
parents:
26424
diff
changeset
|
358 |
void OtherRegionsTable::add_reference(OopOrNarrowOopStar from, uint tid) { |
28030 | 359 |
uint cur_hrm_ind = _hr->hrm_index(); |
1374 | 360 |
|
361 |
int from_card = (int)(uintptr_t(from) >> CardTableModRefBS::card_shift); |
|
362 |
||
35200
7802299b31e7
8145671: Rename FromCardCache to G1FromCardCache
tschatzl
parents:
35199
diff
changeset
|
363 |
if (G1FromCardCache::contains_or_replace(tid, cur_hrm_ind, from_card)) { |
35875
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
364 |
assert(contains_reference(from), "We just found " PTR_FORMAT " in the FromCardCache", p2i(from)); |
1374 | 365 |
return; |
366 |
} |
|
367 |
||
368 |
// Note that this may be a continued H region. |
|
33786
ac8da6513351
8139867: Change how startsHumongous and continuesHumongous regions work in G1.
david
parents:
33783
diff
changeset
|
369 |
HeapRegion* from_hr = _g1h->heap_region_containing(from); |
26424
639e661f19f3
8057143: Incomplete renaming of variables containing "hrs" to "hrm" related to HeapRegionSeq
tschatzl
parents:
26422
diff
changeset
|
370 |
RegionIdx_t from_hrm_ind = (RegionIdx_t) from_hr->hrm_index(); |
1374 | 371 |
|
372 |
// If the region is already coarsened, return. |
|
26424
639e661f19f3
8057143: Incomplete renaming of variables containing "hrs" to "hrm" related to HeapRegionSeq
tschatzl
parents:
26422
diff
changeset
|
373 |
if (_coarse_map.at(from_hrm_ind)) { |
35875
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
374 |
assert(contains_reference(from), "We just found " PTR_FORMAT " in the Coarse table", p2i(from)); |
1374 | 375 |
return; |
376 |
} |
|
377 |
||
378 |
// Otherwise find a per-region table to add it to. |
|
26424
639e661f19f3
8057143: Incomplete renaming of variables containing "hrs" to "hrm" related to HeapRegionSeq
tschatzl
parents:
26422
diff
changeset
|
379 |
size_t ind = from_hrm_ind & _mod_max_fine_entries_mask; |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
380 |
PerRegionTable* prt = find_region_table(ind, from_hr); |
1374 | 381 |
if (prt == NULL) { |
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
382 |
MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag); |
1374 | 383 |
// Confirm that it's really not there... |
384 |
prt = find_region_table(ind, from_hr); |
|
385 |
if (prt == NULL) { |
|
386 |
||
387 |
uintptr_t from_hr_bot_card_index = |
|
388 |
uintptr_t(from_hr->bottom()) |
|
389 |
>> CardTableModRefBS::card_shift; |
|
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
390 |
CardIdx_t card_index = from_card - from_hr_bot_card_index; |
10677
370a8da2d63f
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
10243
diff
changeset
|
391 |
assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion, |
1374 | 392 |
"Must be in range."); |
393 |
if (G1HRRSUseSparseTable && |
|
26424
639e661f19f3
8057143: Incomplete renaming of variables containing "hrs" to "hrm" related to HeapRegionSeq
tschatzl
parents:
26422
diff
changeset
|
394 |
_sparse_table.add_card(from_hrm_ind, card_index)) { |
35875
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
395 |
assert(contains_reference_locked(from), "We just added " PTR_FORMAT " to the Sparse table", p2i(from)); |
1374 | 396 |
return; |
397 |
} |
|
398 |
||
399 |
if (_n_fine_entries == _max_fine_entries) { |
|
400 |
prt = delete_region_table(); |
|
13335 | 401 |
// There is no need to clear the links to the 'all' list here: |
402 |
// prt will be reused immediately, i.e. remain in the 'all' list. |
|
403 |
prt->init(from_hr, false /* clear_links_to_all_list */); |
|
1374 | 404 |
} else { |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
405 |
prt = PerRegionTable::alloc(from_hr); |
13335 | 406 |
link_to_all(prt); |
1374 | 407 |
} |
408 |
||
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
409 |
PerRegionTable* first_prt = _fine_grain_regions[ind]; |
13335 | 410 |
prt->set_collision_list_next(first_prt); |
30765
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
411 |
// The assignment into _fine_grain_regions allows the prt to |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
412 |
// start being used concurrently. In addition to |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
413 |
// collision_list_next which must be visible (else concurrent |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
414 |
// parsing of the list, if any, may fail to see other entries), |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
415 |
// the content of the prt must be visible (else for instance |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
416 |
// some mark bits may not yet seem cleared or a 'later' update |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
417 |
// performed by a concurrent thread could be undone when the |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
418 |
// zeroing becomes visible). This requires store ordering. |
32398da8ba8f
8035496: G1 ARM: missing remset entry noticed by VerifyAfterGC for vm/gc/concurrent/lp50yp10rp70mr30st0
bdelsart
parents:
30764
diff
changeset
|
419 |
OrderAccess::release_store_ptr((volatile PerRegionTable*)&_fine_grain_regions[ind], prt); |
1374 | 420 |
_n_fine_entries++; |
421 |
||
422 |
if (G1HRRSUseSparseTable) { |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
423 |
// Transfer from sparse to fine-grain. |
26424
639e661f19f3
8057143: Incomplete renaming of variables containing "hrs" to "hrm" related to HeapRegionSeq
tschatzl
parents:
26422
diff
changeset
|
424 |
SparsePRTEntry *sprt_entry = _sparse_table.get_entry(from_hrm_ind); |
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
425 |
assert(sprt_entry != NULL, "There should have been an entry"); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
426 |
for (int i = 0; i < SparsePRTEntry::cards_num(); i++) { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
427 |
CardIdx_t c = sprt_entry->card(i); |
1374 | 428 |
if (c != SparsePRTEntry::NullEntry) { |
429 |
prt->add_card(c); |
|
430 |
} |
|
431 |
} |
|
432 |
// Now we can delete the sparse entry. |
|
26424
639e661f19f3
8057143: Incomplete renaming of variables containing "hrs" to "hrm" related to HeapRegionSeq
tschatzl
parents:
26422
diff
changeset
|
433 |
bool res = _sparse_table.delete_entry(from_hrm_ind); |
1374 | 434 |
assert(res, "It should have been there."); |
435 |
} |
|
436 |
} |
|
437 |
assert(prt != NULL && prt->hr() == from_hr, "consequence"); |
|
438 |
} |
|
439 |
// Note that we can't assert "prt->hr() == from_hr", because of the |
|
440 |
// possibility of concurrent reuse. But see head comment of |
|
441 |
// OtherRegionsTable for why this is OK. |
|
442 |
assert(prt != NULL, "Inv"); |
|
443 |
||
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
444 |
prt->add_reference(from); |
35875
8ea0b4b0bcc8
8147087: Race when reusing PerRegionTable bitmaps may result in dropped remembered set entries
tschatzl
parents:
35461
diff
changeset
|
445 |
assert(contains_reference(from), "We just added " PTR_FORMAT " to the PRT", p2i(from)); |
1374 | 446 |
} |
447 |
||
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
448 |
PerRegionTable* |
1374 | 449 |
OtherRegionsTable::find_region_table(size_t ind, HeapRegion* hr) const { |
29580
a67a581cfe11
8073315: Enable gcc -Wtype-limits and fix upcoming issues.
goetz
parents:
28379
diff
changeset
|
450 |
assert(ind < _max_fine_entries, "Preconditions."); |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
451 |
PerRegionTable* prt = _fine_grain_regions[ind]; |
1374 | 452 |
while (prt != NULL && prt->hr() != hr) { |
13335 | 453 |
prt = prt->collision_list_next(); |
1374 | 454 |
} |
455 |
// Loop postcondition is the method postcondition. |
|
456 |
return prt; |
|
457 |
} |
|
458 |
||
459 |
jint OtherRegionsTable::_n_coarsenings = 0; |
|
460 |
||
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
461 |
PerRegionTable* OtherRegionsTable::delete_region_table() { |
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
462 |
assert(_m->owned_by_self(), "Precondition"); |
1374 | 463 |
assert(_n_fine_entries == _max_fine_entries, "Precondition"); |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
464 |
PerRegionTable* max = NULL; |
1374 | 465 |
jint max_occ = 0; |
33589
7cbd1b2c139b
8139040: Fix initializations before ShouldNotReachHere() etc. and enable -Wuninitialized on linux.
goetz
parents:
33105
diff
changeset
|
466 |
PerRegionTable** max_prev = NULL; |
1374 | 467 |
size_t max_ind; |
468 |
||
469 |
size_t i = _fine_eviction_start; |
|
470 |
for (size_t k = 0; k < _fine_eviction_sample_size; k++) { |
|
471 |
size_t ii = i; |
|
472 |
// Make sure we get a non-NULL sample. |
|
473 |
while (_fine_grain_regions[ii] == NULL) { |
|
474 |
ii++; |
|
475 |
if (ii == _max_fine_entries) ii = 0; |
|
476 |
guarantee(ii != i, "We must find one."); |
|
477 |
} |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
478 |
PerRegionTable** prev = &_fine_grain_regions[ii]; |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
479 |
PerRegionTable* cur = *prev; |
1374 | 480 |
while (cur != NULL) { |
481 |
jint cur_occ = cur->occupied(); |
|
482 |
if (max == NULL || cur_occ > max_occ) { |
|
483 |
max = cur; |
|
484 |
max_prev = prev; |
|
485 |
max_ind = i; |
|
486 |
max_occ = cur_occ; |
|
487 |
} |
|
13335 | 488 |
prev = cur->collision_list_next_addr(); |
489 |
cur = cur->collision_list_next(); |
|
1374 | 490 |
} |
491 |
i = i + _fine_eviction_stride; |
|
492 |
if (i >= _n_fine_entries) i = i - _n_fine_entries; |
|
493 |
} |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
494 |
|
1374 | 495 |
_fine_eviction_start++; |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
496 |
|
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
497 |
if (_fine_eviction_start >= _n_fine_entries) { |
1374 | 498 |
_fine_eviction_start -= _n_fine_entries; |
499 |
} |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
500 |
|
1374 | 501 |
guarantee(max != NULL, "Since _n_fine_entries > 0"); |
33589
7cbd1b2c139b
8139040: Fix initializations before ShouldNotReachHere() etc. and enable -Wuninitialized on linux.
goetz
parents:
33105
diff
changeset
|
502 |
guarantee(max_prev != NULL, "Since max != NULL."); |
1374 | 503 |
|
504 |
// Set the corresponding coarse bit. |
|
26316
93f6b40c038b
8054819: Rename HeapRegionSeq to HeapRegionManager
tschatzl
parents:
26160
diff
changeset
|
505 |
size_t max_hrm_index = (size_t) max->hr()->hrm_index(); |
93f6b40c038b
8054819: Rename HeapRegionSeq to HeapRegionManager
tschatzl
parents:
26160
diff
changeset
|
506 |
if (!_coarse_map.at(max_hrm_index)) { |
93f6b40c038b
8054819: Rename HeapRegionSeq to HeapRegionManager
tschatzl
parents:
26160
diff
changeset
|
507 |
_coarse_map.at_put(max_hrm_index, true); |
1374 | 508 |
_n_coarse_entries++; |
509 |
} |
|
510 |
||
511 |
// Unsplice. |
|
13335 | 512 |
*max_prev = max->collision_list_next(); |
1374 | 513 |
Atomic::inc(&_n_coarsenings); |
514 |
_n_fine_entries--; |
|
515 |
return max; |
|
516 |
} |
|
517 |
||
518 |
void OtherRegionsTable::scrub(CardTableModRefBS* ctbs, |
|
519 |
BitMap* region_bm, BitMap* card_bm) { |
|
520 |
// First eliminated garbage regions from the coarse map. |
|
35061 | 521 |
log_develop_trace(gc, remset, scrub)("Scrubbing region %u:", _hr->hrm_index()); |
1374 | 522 |
|
523 |
assert(_coarse_map.size() == region_bm->size(), "Precondition"); |
|
35061 | 524 |
log_develop_trace(gc, remset, scrub)(" Coarse map: before = " SIZE_FORMAT "...", _n_coarse_entries); |
1374 | 525 |
_coarse_map.set_intersection(*region_bm); |
526 |
_n_coarse_entries = _coarse_map.count_one_bits(); |
|
35061 | 527 |
log_develop_trace(gc, remset, scrub)(" after = " SIZE_FORMAT ".", _n_coarse_entries); |
1374 | 528 |
|
529 |
// Now do the fine-grained maps. |
|
530 |
for (size_t i = 0; i < _max_fine_entries; i++) { |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
531 |
PerRegionTable* cur = _fine_grain_regions[i]; |
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
532 |
PerRegionTable** prev = &_fine_grain_regions[i]; |
1374 | 533 |
while (cur != NULL) { |
13335 | 534 |
PerRegionTable* nxt = cur->collision_list_next(); |
1374 | 535 |
// If the entire region is dead, eliminate. |
35061 | 536 |
log_develop_trace(gc, remset, scrub)(" For other region %u:", cur->hr()->hrm_index()); |
26316
93f6b40c038b
8054819: Rename HeapRegionSeq to HeapRegionManager
tschatzl
parents:
26160
diff
changeset
|
537 |
if (!region_bm->at((size_t) cur->hr()->hrm_index())) { |
1374 | 538 |
*prev = nxt; |
13335 | 539 |
cur->set_collision_list_next(NULL); |
1374 | 540 |
_n_fine_entries--; |
35061 | 541 |
log_develop_trace(gc, remset, scrub)(" deleted via region map."); |
13335 | 542 |
unlink_from_all(cur); |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
543 |
PerRegionTable::free(cur); |
1374 | 544 |
} else { |
545 |
// Do fine-grain elimination. |
|
35061 | 546 |
log_develop_trace(gc, remset, scrub)(" occ: before = %4d.", cur->occupied()); |
1374 | 547 |
cur->scrub(ctbs, card_bm); |
35061 | 548 |
log_develop_trace(gc, remset, scrub)(" after = %4d.", cur->occupied()); |
1374 | 549 |
// Did that empty the table completely? |
550 |
if (cur->occupied() == 0) { |
|
551 |
*prev = nxt; |
|
13335 | 552 |
cur->set_collision_list_next(NULL); |
1374 | 553 |
_n_fine_entries--; |
13335 | 554 |
unlink_from_all(cur); |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
555 |
PerRegionTable::free(cur); |
1374 | 556 |
} else { |
13335 | 557 |
prev = cur->collision_list_next_addr(); |
1374 | 558 |
} |
559 |
} |
|
560 |
cur = nxt; |
|
561 |
} |
|
562 |
} |
|
563 |
// Since we may have deleted a from_card_cache entry from the RS, clear |
|
564 |
// the FCC. |
|
565 |
clear_fcc(); |
|
566 |
} |
|
567 |
||
28379
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
568 |
bool OtherRegionsTable::occupancy_less_or_equal_than(size_t limit) const { |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
569 |
if (limit <= (size_t)G1RSetSparseRegionEntries) { |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
570 |
return occ_coarse() == 0 && _first_all_fine_prts == NULL && occ_sparse() <= limit; |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
571 |
} else { |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
572 |
// Current uses of this method may only use values less than G1RSetSparseRegionEntries |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
573 |
// for the limit. The solution, comparing against occupied() would be too slow |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
574 |
// at this time. |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
575 |
Unimplemented(); |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
576 |
return false; |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
577 |
} |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
578 |
} |
e6784fc8fff2
8048179: Early reclaim of large objects that are referenced by a few objects
tschatzl
parents:
28170
diff
changeset
|
579 |
|
25889
221296ac4359
8027959: Early reclamation of large objects in G1
tschatzl
parents:
25492
diff
changeset
|
580 |
bool OtherRegionsTable::is_empty() const { |
221296ac4359
8027959: Early reclamation of large objects in G1
tschatzl
parents:
25492
diff
changeset
|
581 |
return occ_sparse() == 0 && occ_coarse() == 0 && _first_all_fine_prts == NULL; |
221296ac4359
8027959: Early reclamation of large objects in G1
tschatzl
parents:
25492
diff
changeset
|
582 |
} |
1374 | 583 |
|
584 |
size_t OtherRegionsTable::occupied() const { |
|
585 |
size_t sum = occ_fine(); |
|
586 |
sum += occ_sparse(); |
|
587 |
sum += occ_coarse(); |
|
588 |
return sum; |
|
589 |
} |
|
590 |
||
591 |
size_t OtherRegionsTable::occ_fine() const { |
|
592 |
size_t sum = 0; |
|
13335 | 593 |
|
594 |
size_t num = 0; |
|
595 |
PerRegionTable * cur = _first_all_fine_prts; |
|
596 |
while (cur != NULL) { |
|
597 |
sum += cur->occupied(); |
|
598 |
cur = cur->next(); |
|
599 |
num++; |
|
1374 | 600 |
} |
13335 | 601 |
guarantee(num == _n_fine_entries, "just checking"); |
1374 | 602 |
return sum; |
603 |
} |
|
604 |
||
605 |
size_t OtherRegionsTable::occ_coarse() const { |
|
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
606 |
return (_n_coarse_entries * HeapRegion::CardsPerRegion); |
1374 | 607 |
} |
608 |
||
609 |
size_t OtherRegionsTable::occ_sparse() const { |
|
610 |
return _sparse_table.occupied(); |
|
611 |
} |
|
612 |
||
613 |
size_t OtherRegionsTable::mem_size() const { |
|
614 |
size_t sum = 0; |
|
17395
2cd3ef1be718
8014240: G1: Add remembered set size information to output of G1PrintRegionLivenessInfo
tschatzl
parents:
17119
diff
changeset
|
615 |
// all PRTs are of the same size so it is sufficient to query only one of them. |
2cd3ef1be718
8014240: G1: Add remembered set size information to output of G1PrintRegionLivenessInfo
tschatzl
parents:
17119
diff
changeset
|
616 |
if (_first_all_fine_prts != NULL) { |
2cd3ef1be718
8014240: G1: Add remembered set size information to output of G1PrintRegionLivenessInfo
tschatzl
parents:
17119
diff
changeset
|
617 |
assert(_last_all_fine_prts != NULL && |
2cd3ef1be718
8014240: G1: Add remembered set size information to output of G1PrintRegionLivenessInfo
tschatzl
parents:
17119
diff
changeset
|
618 |
_first_all_fine_prts->mem_size() == _last_all_fine_prts->mem_size(), "check that mem_size() is constant"); |
2cd3ef1be718
8014240: G1: Add remembered set size information to output of G1PrintRegionLivenessInfo
tschatzl
parents:
17119
diff
changeset
|
619 |
sum += _first_all_fine_prts->mem_size() * _n_fine_entries; |
1374 | 620 |
} |
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
621 |
sum += (sizeof(PerRegionTable*) * _max_fine_entries); |
1374 | 622 |
sum += (_coarse_map.size_in_words() * HeapWordSize); |
623 |
sum += (_sparse_table.mem_size()); |
|
24108
dfc2242fc6b0
8040792: G1: Memory usage calculation uses sizeof(this) instead of sizeof(classname)
tschatzl
parents:
24106
diff
changeset
|
624 |
sum += sizeof(OtherRegionsTable) - sizeof(_sparse_table); // Avoid double counting above. |
1374 | 625 |
return sum; |
626 |
} |
|
627 |
||
628 |
size_t OtherRegionsTable::static_mem_size() { |
|
35200
7802299b31e7
8145671: Rename FromCardCache to G1FromCardCache
tschatzl
parents:
35199
diff
changeset
|
629 |
return G1FromCardCache::static_mem_size(); |
1374 | 630 |
} |
631 |
||
632 |
size_t OtherRegionsTable::fl_mem_size() { |
|
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
633 |
return PerRegionTable::fl_mem_size(); |
1374 | 634 |
} |
635 |
||
636 |
void OtherRegionsTable::clear_fcc() { |
|
35200
7802299b31e7
8145671: Rename FromCardCache to G1FromCardCache
tschatzl
parents:
35199
diff
changeset
|
637 |
G1FromCardCache::clear(_hr->hrm_index()); |
1374 | 638 |
} |
639 |
||
640 |
void OtherRegionsTable::clear() { |
|
13335 | 641 |
// if there are no entries, skip this step |
642 |
if (_first_all_fine_prts != NULL) { |
|
643 |
guarantee(_first_all_fine_prts != NULL && _last_all_fine_prts != NULL, "just checking"); |
|
644 |
PerRegionTable::bulk_free(_first_all_fine_prts, _last_all_fine_prts); |
|
645 |
memset(_fine_grain_regions, 0, _max_fine_entries * sizeof(_fine_grain_regions[0])); |
|
646 |
} else { |
|
647 |
guarantee(_first_all_fine_prts == NULL && _last_all_fine_prts == NULL, "just checking"); |
|
1374 | 648 |
} |
13335 | 649 |
|
650 |
_first_all_fine_prts = _last_all_fine_prts = NULL; |
|
1374 | 651 |
_sparse_table.clear(); |
652 |
_coarse_map.clear(); |
|
653 |
_n_fine_entries = 0; |
|
654 |
_n_coarse_entries = 0; |
|
655 |
||
656 |
clear_fcc(); |
|
657 |
} |
|
658 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
659 |
bool OtherRegionsTable::contains_reference(OopOrNarrowOopStar from) const { |
1374 | 660 |
// Cast away const in this case. |
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
661 |
MutexLockerEx x((Mutex*)_m, Mutex::_no_safepoint_check_flag); |
1374 | 662 |
return contains_reference_locked(from); |
663 |
} |
|
664 |
||
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
665 |
bool OtherRegionsTable::contains_reference_locked(OopOrNarrowOopStar from) const { |
33786
ac8da6513351
8139867: Change how startsHumongous and continuesHumongous regions work in G1.
david
parents:
33783
diff
changeset
|
666 |
HeapRegion* hr = _g1h->heap_region_containing(from); |
26316
93f6b40c038b
8054819: Rename HeapRegionSeq to HeapRegionManager
tschatzl
parents:
26160
diff
changeset
|
667 |
RegionIdx_t hr_ind = (RegionIdx_t) hr->hrm_index(); |
1374 | 668 |
// Is this region in the coarse map? |
669 |
if (_coarse_map.at(hr_ind)) return true; |
|
670 |
||
13113
ab3870a79b18
6921087: G1: remove per-GC-thread expansion tables from the fine-grain remembered sets
johnc
parents:
12779
diff
changeset
|
671 |
PerRegionTable* prt = find_region_table(hr_ind & _mod_max_fine_entries_mask, |
1374 | 672 |
hr); |
673 |
if (prt != NULL) { |
|
674 |
return prt->contains_reference(from); |
|
675 |
||
676 |
} else { |
|
677 |
uintptr_t from_card = |
|
678 |
(uintptr_t(from) >> CardTableModRefBS::card_shift); |
|
679 |
uintptr_t hr_bot_card_index = |
|
680 |
uintptr_t(hr->bottom()) >> CardTableModRefBS::card_shift; |
|
681 |
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
|
682 |
CardIdx_t card_index = from_card - hr_bot_card_index; |
10677
370a8da2d63f
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
10243
diff
changeset
|
683 |
assert(0 <= card_index && (size_t)card_index < HeapRegion::CardsPerRegion, |
3697
ea9211aa02f5
6819085: G1: use larger and/or user settable region size
tonyp
parents:
3262
diff
changeset
|
684 |
"Must be in range."); |
2996
1097030e5ec3
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
2882
diff
changeset
|
685 |
return _sparse_table.contains_card(hr_ind, card_index); |
1374 | 686 |
} |
687 |
} |
|
688 |
||
8072 | 689 |
void |
690 |
OtherRegionsTable::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) { |
|
691 |
_sparse_table.do_cleanup_work(hrrs_cleanup_task); |
|
692 |
} |
|
693 |
||
35461 | 694 |
HeapRegionRemSet::HeapRegionRemSet(G1BlockOffsetTable* bot, |
1374 | 695 |
HeapRegion* hr) |
35461 | 696 |
: _bot(bot), |
28163
322d55d167be
8047290: Make Mutex::_no_safepoint_check_flag locks verify that this lock never checks for safepoint
coleenp
parents:
26850
diff
changeset
|
697 |
_m(Mutex::leaf, FormatBuffer<128>("HeapRegionRemSet lock #%u", hr->hrm_index()), true, Monitor::_safepoint_check_never), |
26160 | 698 |
_code_roots(), _other_regions(hr, &_m), _iter_state(Unclaimed), _iter_claimed(0) { |
10000
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
699 |
reset_for_par_iteration(); |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
700 |
} |
1374 | 701 |
|
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
702 |
void HeapRegionRemSet::setup_remset_size() { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
703 |
// Setup sparse and fine-grain tables sizes. |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
704 |
// table_size = base * (log(region_size / 1M) + 1) |
12779
06778de5193e
7171936: LOG_G incorrectly defined in globalDefinitions.hpp
brutisso
parents:
12381
diff
changeset
|
705 |
const int LOG_M = 20; |
06778de5193e
7171936: LOG_G incorrectly defined in globalDefinitions.hpp
brutisso
parents:
12381
diff
changeset
|
706 |
int region_size_log_mb = MAX2(HeapRegion::LogOfHRGrainBytes - LOG_M, 0); |
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
707 |
if (FLAG_IS_DEFAULT(G1RSetSparseRegionEntries)) { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
708 |
G1RSetSparseRegionEntries = G1RSetSparseRegionEntriesBase * (region_size_log_mb + 1); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
709 |
} |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
710 |
if (FLAG_IS_DEFAULT(G1RSetRegionEntries)) { |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
711 |
G1RSetRegionEntries = G1RSetRegionEntriesBase * (region_size_log_mb + 1); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
712 |
} |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
713 |
guarantee(G1RSetSparseRegionEntries > 0 && G1RSetRegionEntries > 0 , "Sanity"); |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
714 |
} |
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
715 |
|
1374 | 716 |
bool HeapRegionRemSet::claim_iter() { |
717 |
if (_iter_state != Unclaimed) return false; |
|
718 |
jint res = Atomic::cmpxchg(Claimed, (jint*)(&_iter_state), Unclaimed); |
|
719 |
return (res == Unclaimed); |
|
720 |
} |
|
721 |
||
722 |
void HeapRegionRemSet::set_iter_complete() { |
|
723 |
_iter_state = Complete; |
|
724 |
} |
|
725 |
||
726 |
bool HeapRegionRemSet::iter_is_complete() { |
|
727 |
return _iter_state == Complete; |
|
728 |
} |
|
729 |
||
730 |
#ifndef PRODUCT |
|
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
731 |
void HeapRegionRemSet::print() { |
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
732 |
HeapRegionRemSetIterator iter(this); |
1374 | 733 |
size_t card_index; |
734 |
while (iter.has_next(card_index)) { |
|
35461 | 735 |
HeapWord* card_start = _bot->address_for_index(card_index); |
35061 | 736 |
tty->print_cr(" Card " PTR_FORMAT, p2i(card_start)); |
1374 | 737 |
} |
738 |
if (iter.n_yielded() != occupied()) { |
|
35061 | 739 |
tty->print_cr("Yielded disagrees with occupied:"); |
740 |
tty->print_cr(" " SIZE_FORMAT_W(6) " yielded (" SIZE_FORMAT_W(6) |
|
24092
e274d864545a
8039743: Use correct format specifier to print size_t values and pointers in the GC code
stefank
parents:
23858
diff
changeset
|
741 |
" coarse, " SIZE_FORMAT_W(6) " fine).", |
1374 | 742 |
iter.n_yielded(), |
743 |
iter.n_yielded_coarse(), iter.n_yielded_fine()); |
|
35061 | 744 |
tty->print_cr(" " SIZE_FORMAT_W(6) " occ (" SIZE_FORMAT_W(6) |
24092
e274d864545a
8039743: Use correct format specifier to print size_t values and pointers in the GC code
stefank
parents:
23858
diff
changeset
|
745 |
" coarse, " SIZE_FORMAT_W(6) " fine).", |
1374 | 746 |
occupied(), occ_coarse(), occ_fine()); |
747 |
} |
|
748 |
guarantee(iter.n_yielded() == occupied(), |
|
749 |
"We should have yielded all the represented cards."); |
|
750 |
} |
|
751 |
#endif |
|
752 |
||
753 |
void HeapRegionRemSet::cleanup() { |
|
754 |
SparsePRT::cleanup_all(); |
|
755 |
} |
|
756 |
||
757 |
void HeapRegionRemSet::clear() { |
|
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
758 |
MutexLockerEx x(&_m, Mutex::_no_safepoint_check_flag); |
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
759 |
clear_locked(); |
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
760 |
} |
19339 | 761 |
|
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
762 |
void HeapRegionRemSet::clear_locked() { |
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
763 |
_code_roots.clear(); |
1374 | 764 |
_other_regions.clear(); |
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
765 |
assert(occupied_locked() == 0, "Should be clear."); |
10000
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
766 |
reset_for_par_iteration(); |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
767 |
} |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
768 |
|
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
769 |
void HeapRegionRemSet::reset_for_par_iteration() { |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
770 |
_iter_state = Unclaimed; |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
771 |
_iter_claimed = 0; |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
772 |
// It's good to check this to make sure that the two methods are in sync. |
5bbb58b0dbb9
7046182: G1: remove unnecessary iterations over the collection set
tonyp
parents:
9989
diff
changeset
|
773 |
assert(verify_ready_for_par_iteration(), "post-condition"); |
1374 | 774 |
} |
775 |
||
776 |
void HeapRegionRemSet::scrub(CardTableModRefBS* ctbs, |
|
777 |
BitMap* region_bm, BitMap* card_bm) { |
|
778 |
_other_regions.scrub(ctbs, region_bm, card_bm); |
|
779 |
} |
|
780 |
||
19339 | 781 |
// Code roots support |
26422 | 782 |
// |
783 |
// The code root set is protected by two separate locking schemes |
|
784 |
// When at safepoint the per-hrrs lock must be held during modifications |
|
785 |
// except when doing a full gc. |
|
786 |
// When not at safepoint the CodeCache_lock must be held during modifications. |
|
787 |
// When concurrent readers access the contains() function |
|
788 |
// (during the evacuation phase) no removals are allowed. |
|
19339 | 789 |
|
790 |
void HeapRegionRemSet::add_strong_code_root(nmethod* nm) { |
|
791 |
assert(nm != NULL, "sanity"); |
|
35879 | 792 |
assert((!CodeCache_lock->owned_by_self() || SafepointSynchronize::is_at_safepoint()), |
793 |
"should call add_strong_code_root_locked instead. CodeCache_lock->owned_by_self(): %s, is_at_safepoint(): %s", |
|
794 |
BOOL_TO_STR(CodeCache_lock->owned_by_self()), BOOL_TO_STR(SafepointSynchronize::is_at_safepoint())); |
|
26422 | 795 |
// Optimistic unlocked contains-check |
796 |
if (!_code_roots.contains(nm)) { |
|
797 |
MutexLockerEx ml(&_m, Mutex::_no_safepoint_check_flag); |
|
798 |
add_strong_code_root_locked(nm); |
|
799 |
} |
|
800 |
} |
|
801 |
||
802 |
void HeapRegionRemSet::add_strong_code_root_locked(nmethod* nm) { |
|
803 |
assert(nm != NULL, "sanity"); |
|
35879 | 804 |
assert((CodeCache_lock->owned_by_self() || |
805 |
(SafepointSynchronize::is_at_safepoint() && |
|
806 |
(_m.owned_by_self() || Thread::current()->is_VM_thread()))), |
|
807 |
"not safely locked. CodeCache_lock->owned_by_self(): %s, is_at_safepoint(): %s, _m.owned_by_self(): %s, Thread::current()->is_VM_thread(): %s", |
|
808 |
BOOL_TO_STR(CodeCache_lock->owned_by_self()), BOOL_TO_STR(SafepointSynchronize::is_at_safepoint()), |
|
809 |
BOOL_TO_STR(_m.owned_by_self()), BOOL_TO_STR(Thread::current()->is_VM_thread())); |
|
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
810 |
_code_roots.add(nm); |
19339 | 811 |
} |
812 |
||
813 |
void HeapRegionRemSet::remove_strong_code_root(nmethod* nm) { |
|
814 |
assert(nm != NULL, "sanity"); |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
815 |
assert_locked_or_safepoint(CodeCache_lock); |
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
816 |
|
26422 | 817 |
MutexLockerEx ml(CodeCache_lock->owned_by_self() ? NULL : &_m, Mutex::_no_safepoint_check_flag); |
818 |
_code_roots.remove(nm); |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
819 |
|
19339 | 820 |
// Check that there were no duplicates |
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
821 |
guarantee(!_code_roots.contains(nm), "duplicate entry found"); |
19339 | 822 |
} |
823 |
||
26422 | 824 |
void HeapRegionRemSet::strong_code_roots_do(CodeBlobClosure* blk) const { |
825 |
_code_roots.nmethods_do(blk); |
|
19339 | 826 |
} |
827 |
||
26422 | 828 |
void HeapRegionRemSet::clean_strong_code_roots(HeapRegion* hr) { |
829 |
_code_roots.clean(hr); |
|
19339 | 830 |
} |
831 |
||
832 |
size_t HeapRegionRemSet::strong_code_roots_mem_size() { |
|
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
833 |
return _code_roots.mem_size(); |
19339 | 834 |
} |
835 |
||
23451
ed2b8bb28fed
8035406: Improve data structure for Code Cache remembered sets
tschatzl
parents:
21563
diff
changeset
|
836 |
HeapRegionRemSetIterator:: HeapRegionRemSetIterator(HeapRegionRemSet* hrrs) : |
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
837 |
_hrrs(hrrs), |
1374 | 838 |
_g1h(G1CollectedHeap::heap()), |
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
839 |
_coarse_map(&hrrs->_other_regions._coarse_map), |
35461 | 840 |
_bot(hrrs->_bot), |
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
841 |
_is(Sparse), |
1374 | 842 |
// Set these values so that we increment to the first region. |
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
843 |
_coarse_cur_region_index(-1), |
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
844 |
_coarse_cur_region_cur_card(HeapRegion::CardsPerRegion-1), |
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
845 |
_cur_card_in_prt(HeapRegion::CardsPerRegion), |
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
846 |
_fine_cur_prt(NULL), |
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
847 |
_n_yielded_coarse(0), |
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
848 |
_n_yielded_fine(0), |
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
849 |
_n_yielded_sparse(0), |
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
850 |
_sparse_iter(&hrrs->_other_regions._sparse_table) {} |
1374 | 851 |
|
852 |
bool HeapRegionRemSetIterator::coarse_has_next(size_t& card_index) { |
|
853 |
if (_hrrs->_other_regions._n_coarse_entries == 0) return false; |
|
854 |
// Go to the next card. |
|
855 |
_coarse_cur_region_cur_card++; |
|
856 |
// 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
|
857 |
if (_coarse_cur_region_cur_card == HeapRegion::CardsPerRegion) { |
1374 | 858 |
// Yes: find the next region. This may leave _coarse_cur_region_index |
859 |
// Set to the last index, in which case there are no more coarse |
|
860 |
// regions. |
|
861 |
_coarse_cur_region_index = |
|
862 |
(int) _coarse_map->get_next_one_offset(_coarse_cur_region_index + 1); |
|
863 |
if ((size_t)_coarse_cur_region_index < _coarse_map->size()) { |
|
864 |
_coarse_cur_region_cur_card = 0; |
|
865 |
HeapWord* r_bot = |
|
12381
1438e0fbfa27
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
10767
diff
changeset
|
866 |
_g1h->region_at((uint) _coarse_cur_region_index)->bottom(); |
35461 | 867 |
_cur_region_card_offset = _bot->index_for(r_bot); |
1374 | 868 |
} else { |
869 |
return false; |
|
870 |
} |
|
871 |
} |
|
872 |
// If we didn't return false above, then we can yield a card. |
|
873 |
card_index = _cur_region_card_offset + _coarse_cur_region_cur_card; |
|
874 |
return true; |
|
875 |
} |
|
876 |
||
877 |
bool HeapRegionRemSetIterator::fine_has_next(size_t& card_index) { |
|
878 |
if (fine_has_next()) { |
|
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
879 |
_cur_card_in_prt = |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
880 |
_fine_cur_prt->_bm.get_next_one_offset(_cur_card_in_prt + 1); |
1374 | 881 |
} |
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
882 |
if (_cur_card_in_prt == HeapRegion::CardsPerRegion) { |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
883 |
// _fine_cur_prt may still be NULL in case if there are not PRTs at all for |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
884 |
// the remembered set. |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
885 |
if (_fine_cur_prt == NULL || _fine_cur_prt->next() == NULL) { |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
886 |
return false; |
1374 | 887 |
} |
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
888 |
PerRegionTable* next_prt = _fine_cur_prt->next(); |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
889 |
switch_to_prt(next_prt); |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
890 |
_cur_card_in_prt = _fine_cur_prt->_bm.get_next_one_offset(_cur_card_in_prt + 1); |
1374 | 891 |
} |
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
892 |
|
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
893 |
card_index = _cur_region_card_offset + _cur_card_in_prt; |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
894 |
guarantee(_cur_card_in_prt < HeapRegion::CardsPerRegion, |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
31592
diff
changeset
|
895 |
"Card index " SIZE_FORMAT " must be within the region", _cur_card_in_prt); |
1374 | 896 |
return true; |
897 |
} |
|
898 |
||
899 |
bool HeapRegionRemSetIterator::fine_has_next() { |
|
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
900 |
return _cur_card_in_prt != HeapRegion::CardsPerRegion; |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
901 |
} |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
902 |
|
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
903 |
void HeapRegionRemSetIterator::switch_to_prt(PerRegionTable* prt) { |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
904 |
assert(prt != NULL, "Cannot switch to NULL prt"); |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
905 |
_fine_cur_prt = prt; |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
906 |
|
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
907 |
HeapWord* r_bot = _fine_cur_prt->hr()->bottom(); |
35461 | 908 |
_cur_region_card_offset = _bot->index_for(r_bot); |
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
909 |
|
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
910 |
// The bitmap scan for the PRT always scans from _cur_region_cur_card + 1. |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
911 |
// To avoid special-casing this start case, and not miss the first bitmap |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
912 |
// entry, initialize _cur_region_cur_card with -1 instead of 0. |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
913 |
_cur_card_in_prt = (size_t)-1; |
1374 | 914 |
} |
915 |
||
916 |
bool HeapRegionRemSetIterator::has_next(size_t& card_index) { |
|
917 |
switch (_is) { |
|
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
918 |
case Sparse: { |
1374 | 919 |
if (_sparse_iter.has_next(card_index)) { |
920 |
_n_yielded_sparse++; |
|
921 |
return true; |
|
922 |
} |
|
923 |
// Otherwise, deliberate fall-through |
|
924 |
_is = Fine; |
|
24101
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
925 |
PerRegionTable* initial_fine_prt = _hrrs->_other_regions._first_all_fine_prts; |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
926 |
if (initial_fine_prt != NULL) { |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
927 |
switch_to_prt(_hrrs->_other_regions._first_all_fine_prts); |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
928 |
} |
bd1a2ee20760
8037344: Use the "next" field to iterate over fine remembered instead of using the hash table
tschatzl
parents:
24092
diff
changeset
|
929 |
} |
1374 | 930 |
case Fine: |
931 |
if (fine_has_next(card_index)) { |
|
932 |
_n_yielded_fine++; |
|
933 |
return true; |
|
934 |
} |
|
935 |
// Otherwise, deliberate fall-through |
|
936 |
_is = Coarse; |
|
937 |
case Coarse: |
|
938 |
if (coarse_has_next(card_index)) { |
|
939 |
_n_yielded_coarse++; |
|
940 |
return true; |
|
941 |
} |
|
942 |
// Otherwise... |
|
943 |
break; |
|
944 |
} |
|
945 |
assert(ParallelGCThreads > 1 || |
|
946 |
n_yielded() == _hrrs->occupied(), |
|
947 |
"Should have yielded all the cards in the rem set " |
|
948 |
"(in the non-par case)."); |
|
949 |
return false; |
|
950 |
} |
|
951 |
||
8072 | 952 |
void HeapRegionRemSet::reset_for_cleanup_tasks() { |
953 |
SparsePRT::reset_for_cleanup_tasks(); |
|
954 |
} |
|
955 |
||
956 |
void HeapRegionRemSet::do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task) { |
|
957 |
_other_regions.do_cleanup_work(hrrs_cleanup_task); |
|
958 |
} |
|
959 |
||
960 |
void |
|
961 |
HeapRegionRemSet::finish_cleanup_task(HRRSCleanupTask* hrrs_cleanup_task) { |
|
962 |
SparsePRT::finish_cleanup_task(hrrs_cleanup_task); |
|
963 |
} |
|
964 |
||
1374 | 965 |
#ifndef PRODUCT |
966 |
void HeapRegionRemSet::test() { |
|
967 |
os::sleep(Thread::current(), (jlong)5000, false); |
|
968 |
G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
|
969 |
||
4902
991aaddb5165
6923991: G1: improve scalability of RSet scanning
iveresov
parents:
4900
diff
changeset
|
970 |
// Run with "-XX:G1LogRSetRegionEntries=2", so that 1 and 5 end up in same |
1374 | 971 |
// hash bucket. |
972 |
HeapRegion* hr0 = g1h->region_at(0); |
|
973 |
HeapRegion* hr1 = g1h->region_at(1); |
|
974 |
HeapRegion* hr2 = g1h->region_at(5); |
|
975 |
HeapRegion* hr3 = g1h->region_at(6); |
|
976 |
HeapRegion* hr4 = g1h->region_at(7); |
|
977 |
HeapRegion* hr5 = g1h->region_at(8); |
|
978 |
||
979 |
HeapWord* hr1_start = hr1->bottom(); |
|
980 |
HeapWord* hr1_mid = hr1_start + HeapRegion::GrainWords/2; |
|
981 |
HeapWord* hr1_last = hr1->end() - 1; |
|
982 |
||
983 |
HeapWord* hr2_start = hr2->bottom(); |
|
984 |
HeapWord* hr2_mid = hr2_start + HeapRegion::GrainWords/2; |
|
985 |
HeapWord* hr2_last = hr2->end() - 1; |
|
986 |
||
987 |
HeapWord* hr3_start = hr3->bottom(); |
|
988 |
HeapWord* hr3_mid = hr3_start + HeapRegion::GrainWords/2; |
|
989 |
HeapWord* hr3_last = hr3->end() - 1; |
|
990 |
||
991 |
HeapRegionRemSet* hrrs = hr0->rem_set(); |
|
992 |
||
993 |
// Make three references from region 0x101... |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
994 |
hrrs->add_reference((OopOrNarrowOopStar)hr1_start); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
995 |
hrrs->add_reference((OopOrNarrowOopStar)hr1_mid); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
996 |
hrrs->add_reference((OopOrNarrowOopStar)hr1_last); |
1374 | 997 |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
998 |
hrrs->add_reference((OopOrNarrowOopStar)hr2_start); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
999 |
hrrs->add_reference((OopOrNarrowOopStar)hr2_mid); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1000 |
hrrs->add_reference((OopOrNarrowOopStar)hr2_last); |
1374 | 1001 |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1002 |
hrrs->add_reference((OopOrNarrowOopStar)hr3_start); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1003 |
hrrs->add_reference((OopOrNarrowOopStar)hr3_mid); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1004 |
hrrs->add_reference((OopOrNarrowOopStar)hr3_last); |
1374 | 1005 |
|
1006 |
// Now cause a coarsening. |
|
3262
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1007 |
hrrs->add_reference((OopOrNarrowOopStar)hr4->bottom()); |
30d1c247fc25
6700789: G1: Enable use of compressed oops with G1 heaps
ysr
parents:
2996
diff
changeset
|
1008 |
hrrs->add_reference((OopOrNarrowOopStar)hr5->bottom()); |
1374 | 1009 |
|
1010 |
// Now, does iteration yield these three? |
|
17108
cf72dcf9a8f2
8011724: G1: Stack allocate instances of HeapRegionRemSetIterator
johnc
parents:
13752
diff
changeset
|
1011 |
HeapRegionRemSetIterator iter(hrrs); |
1374 | 1012 |
size_t sum = 0; |
1013 |
size_t card_index; |
|
1014 |
while (iter.has_next(card_index)) { |
|
1015 |
HeapWord* card_start = |
|
35461 | 1016 |
G1CollectedHeap::heap()->bot()->address_for_index(card_index); |
35061 | 1017 |
tty->print_cr(" Card " PTR_FORMAT ".", p2i(card_start)); |
1374 | 1018 |
sum++; |
1019 |
} |
|
1020 |
guarantee(sum == 11 - 3 + 2048, "Failure"); |
|
1021 |
guarantee(sum == hrrs->occupied(), "Failure"); |
|
1022 |
} |
|
1023 |
#endif |