1 /*
2 * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
27
28 #include "gc_implementation/g1/sparsePRT.hpp"
29
30 // Remembered set for a heap region. Represent a set of "cards" that
31 // contain pointers into the owner heap region. Cards are defined somewhat
32 // abstractly, in terms of what the "BlockOffsetTable" in use can parse.
33
34 class G1CollectedHeap;
35 class G1BlockOffsetSharedArray;
36 class HeapRegion;
37 class HeapRegionRemSetIterator;
38 class PerRegionTable;
39 class SparsePRT;
40 class nmethod;
41
42 // Essentially a wrapper around SparsePRTCleanupTask. See
43 // sparsePRT.hpp for more details.
44 class HRRSCleanupTask : public SparsePRTCleanupTask {
45 };
46
47 // The "_coarse_map" is a bitmap with one bit for each region, where set
55 // we would overflow this cap.
56
57 // We use a mixture of locking and lock-free techniques here. We allow
58 // threads to locate PRTs without locking, but threads attempting to alter
59 // a bucket list obtain a lock. This means that any failing attempt to
60 // find a PRT must be retried with the lock. It might seem dangerous that
61 // a read can find a PRT that is concurrently deleted. This is all right,
62 // because:
63 //
64 // 1) We only actually free PRT's at safe points (though we reuse them at
65 // other times).
66 // 2) We find PRT's in an attempt to add entries. If a PRT is deleted,
67 // it's _coarse_map bit is set, so the that we were attempting to add
68 // is represented. If a deleted PRT is re-used, a thread adding a bit,
69 // thinking the PRT is for a different region, does no harm.
70
71 class OtherRegionsTable VALUE_OBJ_CLASS_SPEC {
72 friend class HeapRegionRemSetIterator;
73
74 G1CollectedHeap* _g1h;
75 Mutex _m;
76 HeapRegion* _hr;
77
78 // These are protected by "_m".
79 BitMap _coarse_map;
80 size_t _n_coarse_entries;
81 static jint _n_coarsenings;
82
83 PerRegionTable** _fine_grain_regions;
84 size_t _n_fine_entries;
85
86 // The fine grain remembered sets are doubly linked together using
87 // their 'next' and 'prev' fields.
88 // This allows fast bulk freeing of all the fine grain remembered
89 // set entries, and fast finding of all of them without iterating
90 // over the _fine_grain_regions table.
91 PerRegionTable * _first_all_fine_prts;
92 PerRegionTable * _last_all_fine_prts;
93
94 // Used to sample a subset of the fine grain PRTs to determine which
95 // PRT to evict and coarsen.
114 PerRegionTable* delete_region_table();
115
116 // If a PRT for "hr" is in the bucket list indicated by "ind" (which must
117 // be the correct index for "hr"), delete it and return true; else return
118 // false.
119 bool del_single_region_table(size_t ind, HeapRegion* hr);
120
121 // Indexed by thread X heap region, to minimize thread contention.
122 static int** _from_card_cache;
123 static size_t _from_card_cache_max_regions;
124 static size_t _from_card_cache_mem_size;
125
126 // link/add the given fine grain remembered set into the "all" list
127 void link_to_all(PerRegionTable * prt);
128 // unlink/remove the given fine grain remembered set into the "all" list
129 void unlink_from_all(PerRegionTable * prt);
130
131 public:
132 OtherRegionsTable(HeapRegion* hr);
133
134 HeapRegion* hr() const { return _hr; }
135
136 // For now. Could "expand" some tables in the future, so that this made
137 // sense.
138 void add_reference(OopOrNarrowOopStar from, int tid);
139
140 // Removes any entries shown by the given bitmaps to contain only dead
141 // objects.
142 void scrub(CardTableModRefBS* ctbs, BitMap* region_bm, BitMap* card_bm);
143
144 // Not const because it takes a lock.
145 size_t occupied() const;
146 size_t occ_fine() const;
147 size_t occ_coarse() const;
148 size_t occ_sparse() const;
149
150 static jint n_coarsenings() { return _n_coarsenings; }
151
152 // Returns size in bytes.
153 // Not const because it takes a lock.
154 size_t mem_size() const;
155 static size_t static_mem_size();
156 static size_t fl_mem_size();
157
158 bool contains_reference(OopOrNarrowOopStar from) const;
159 bool contains_reference_locked(OopOrNarrowOopStar from) const;
160
161 void clear();
162
163 // Specifically clear the from_card_cache.
164 void clear_fcc();
175 // Declares that only regions i s.t. 0 <= i < new_n_regs are in use.
176 // Make sure any entries for higher regions are invalid.
177 static void shrink_from_card_cache(size_t new_n_regs);
178
179 static void print_from_card_cache();
180 };
181
182 class HeapRegionRemSet : public CHeapObj<mtGC> {
183 friend class VMStructs;
184 friend class HeapRegionRemSetIterator;
185
186 public:
187 enum Event {
188 Event_EvacStart, Event_EvacEnd, Event_RSUpdateEnd
189 };
190
191 private:
192 G1BlockOffsetSharedArray* _bosa;
193 G1BlockOffsetSharedArray* bosa() const { return _bosa; }
194
195 // A list of code blobs (nmethods) whose code contains pointers into
196 // the region that owns this RSet.
197 GrowableArray<nmethod*>* _strong_code_roots_list;
198
199 OtherRegionsTable _other_regions;
200
201 enum ParIterState { Unclaimed, Claimed, Complete };
202 volatile ParIterState _iter_state;
203 volatile jlong _iter_claimed;
204
205 // Unused unless G1RecordHRRSOops is true.
206
207 static const int MaxRecorded = 1000000;
208 static OopOrNarrowOopStar* _recorded_oops;
209 static HeapWord** _recorded_cards;
210 static HeapRegion** _recorded_regions;
211 static int _n_recorded;
212
213 static const int MaxRecordedEvents = 1000;
214 static Event* _recorded_events;
215 static int* _recorded_event_index;
216 static int _n_recorded_events;
217
218 static void print_event(outputStream* str, Event evnt);
219
220 public:
221 HeapRegionRemSet(G1BlockOffsetSharedArray* bosa,
222 HeapRegion* hr);
223
224 static int num_par_rem_sets();
225 static void setup_remset_size();
226
227 HeapRegion* hr() const {
228 return _other_regions.hr();
229 }
230
231 size_t occupied() const {
232 return _other_regions.occupied();
233 }
234 size_t occ_fine() const {
235 return _other_regions.occ_fine();
236 }
237 size_t occ_coarse() const {
238 return _other_regions.occ_coarse();
239 }
240 size_t occ_sparse() const {
241 return _other_regions.occ_sparse();
242 }
243
244 static jint n_coarsenings() { return OtherRegionsTable::n_coarsenings(); }
245
246 // Used in the sequential case.
247 void add_reference(OopOrNarrowOopStar from) {
248 _other_regions.add_reference(from, 0);
249 }
250
251 // Used in the parallel case.
252 void add_reference(OopOrNarrowOopStar from, int tid) {
253 _other_regions.add_reference(from, tid);
254 }
255
256 // Removes any entries shown by the given bitmaps to contain only dead
257 // objects.
258 void scrub(CardTableModRefBS* ctbs, BitMap* region_bm, BitMap* card_bm);
259
260 // The region is being reclaimed; clear its remset, and any mention of
261 // entries for this region in other remsets.
262 void clear();
263
264 // Attempt to claim the region. Returns true iff this call caused an
265 // atomic transition from Unclaimed to Claimed.
266 bool claim_iter();
267 // Sets the iteration state to "complete".
268 void set_iter_complete();
269 // Returns "true" iff the region's iteration is complete.
270 bool iter_is_complete();
271
272 // Support for claiming blocks of cards during iteration
273 size_t iter_claimed() const { return (size_t)_iter_claimed; }
274 // Claim the next block of cards
275 size_t iter_claimed_next(size_t step) {
276 size_t current, next;
277 do {
278 current = iter_claimed();
279 next = current + step;
280 } while (Atomic::cmpxchg((jlong)next, &_iter_claimed, (jlong)current) != (jlong)current);
281 return current;
282 }
283 void reset_for_par_iteration();
284
285 bool verify_ready_for_par_iteration() {
286 return (_iter_state == Unclaimed) && (_iter_claimed == 0);
287 }
288
289 // The actual # of bytes this hr_remset takes up.
290 // Note also includes the strong code root set.
291 size_t mem_size() {
292 return _other_regions.mem_size()
293 // This correction is necessary because the above includes the second
294 // part.
295 + (sizeof(this) - sizeof(OtherRegionsTable))
296 + strong_code_roots_mem_size();
297 }
298
299 // Returns the memory occupancy of all static data structures associated
300 // with remembered sets.
301 static size_t static_mem_size() {
302 return OtherRegionsTable::static_mem_size();
303 }
304
305 // Returns the memory occupancy of all free_list data structures associated
306 // with remembered sets.
307 static size_t fl_mem_size() {
308 return OtherRegionsTable::fl_mem_size();
309 }
310
311 bool contains_reference(OopOrNarrowOopStar from) const {
312 return _other_regions.contains_reference(from);
313 }
314
315 // Routines for managing the list of code roots that point into
316 // the heap region that owns this RSet.
317 void add_strong_code_root(nmethod* nm);
318 void remove_strong_code_root(nmethod* nm);
319
320 // During a collection, migrate the successfully evacuated strong
321 // code roots that referenced into the region that owns this RSet
322 // to the RSets of the new regions that they now point into.
323 // Unsuccessfully evacuated code roots are not migrated.
324 void migrate_strong_code_roots();
325
326 // Applies blk->do_code_blob() to each of the entries in
327 // the strong code roots list
328 void strong_code_roots_do(CodeBlobClosure* blk) const;
329
330 // Returns the number of elements in the strong code roots list
331 int strong_code_roots_list_length() {
332 return _strong_code_roots_list->length();
333 }
334
335 // Returns true if the strong code roots contains the given
336 // nmethod.
337 bool strong_code_roots_list_contains(nmethod* nm) {
338 return _strong_code_roots_list->contains(nm);
339 }
340
341 // Returns the amount of memory, in bytes, currently
342 // consumed by the strong code roots.
343 size_t strong_code_roots_mem_size();
344
345 void print() const;
346
347 // Called during a stop-world phase to perform any deferred cleanups.
348 static void cleanup();
349
350 // Declare the heap size (in # of regions) to the HeapRegionRemSet(s).
351 // (Uses it to initialize from_card_cache).
352 static void init_heap(uint max_regions) {
353 OtherRegionsTable::init_from_card_cache((size_t) max_regions);
354 }
355
356 // Declares that only regions i s.t. 0 <= i < new_n_regs are in use.
357 static void shrink_heap(uint new_n_regs) {
358 OtherRegionsTable::shrink_from_card_cache((size_t) new_n_regs);
359 }
360
361 #ifndef PRODUCT
362 static void print_from_card_cache() {
363 OtherRegionsTable::print_from_card_cache();
364 }
365 #endif
366
367 static void record(HeapRegion* hr, OopOrNarrowOopStar f);
368 static void print_recorded();
369 static void record_event(Event evnt);
370
371 // These are wrappers for the similarly-named methods on
372 // SparsePRT. Look at sparsePRT.hpp for more details.
373 static void reset_for_cleanup_tasks();
374 void do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task);
375 static void finish_cleanup_task(HRRSCleanupTask* hrrs_cleanup_task);
376
377 // Run unit tests.
378 #ifndef PRODUCT
379 static void test_prt();
380 static void test();
381 #endif
382 };
383
384 class HeapRegionRemSetIterator : public StackObj {
385
386 // The region RSet over which we're iterating.
387 const HeapRegionRemSet* _hrrs;
388
389 // Local caching of HRRS fields.
390 const BitMap* _coarse_map;
391 PerRegionTable** _fine_grain_regions;
392
393 G1BlockOffsetSharedArray* _bosa;
394 G1CollectedHeap* _g1h;
395
396 // The number yielded since initialization.
397 size_t _n_yielded_fine;
398 size_t _n_yielded_coarse;
399 size_t _n_yielded_sparse;
400
401 // Indicates what granularity of table that we're currently iterating over.
402 // We start iterating over the sparse table, progress to the fine grain
403 // table, and then finish with the coarse table.
404 // See HeapRegionRemSetIterator::has_next().
405 enum IterState {
406 Sparse,
407 Fine,
424 bool coarse_has_next(size_t& card_index);
425
426 // Fine table iteration fields:
427
428 // Index of bucket-list we're working on.
429 int _fine_array_index;
430
431 // Per Region Table we're doing within current bucket list.
432 PerRegionTable* _fine_cur_prt;
433
434 /* SparsePRT::*/ SparsePRTIter _sparse_iter;
435
436 void fine_find_next_non_null_prt();
437
438 bool fine_has_next();
439 bool fine_has_next(size_t& card_index);
440
441 public:
442 // We require an iterator to be initialized before use, so the
443 // constructor does little.
444 HeapRegionRemSetIterator(const HeapRegionRemSet* hrrs);
445
446 // If there remains one or more cards to be yielded, returns true and
447 // sets "card_index" to one of those cards (which is then considered
448 // yielded.) Otherwise, returns false (and leaves "card_index"
449 // undefined.)
450 bool has_next(size_t& card_index);
451
452 size_t n_yielded_fine() { return _n_yielded_fine; }
453 size_t n_yielded_coarse() { return _n_yielded_coarse; }
454 size_t n_yielded_sparse() { return _n_yielded_sparse; }
455 size_t n_yielded() {
456 return n_yielded_fine() + n_yielded_coarse() + n_yielded_sparse();
457 }
458 };
459
460 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
|
1 /*
2 * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
27
28 #include "gc_implementation/g1/g1CodeCacheRemSet.hpp"
29 #include "gc_implementation/g1/sparsePRT.hpp"
30
31 // Remembered set for a heap region. Represent a set of "cards" that
32 // contain pointers into the owner heap region. Cards are defined somewhat
33 // abstractly, in terms of what the "BlockOffsetTable" in use can parse.
34
35 class G1CollectedHeap;
36 class G1BlockOffsetSharedArray;
37 class HeapRegion;
38 class HeapRegionRemSetIterator;
39 class PerRegionTable;
40 class SparsePRT;
41 class nmethod;
42
43 // Essentially a wrapper around SparsePRTCleanupTask. See
44 // sparsePRT.hpp for more details.
45 class HRRSCleanupTask : public SparsePRTCleanupTask {
46 };
47
48 // The "_coarse_map" is a bitmap with one bit for each region, where set
56 // we would overflow this cap.
57
58 // We use a mixture of locking and lock-free techniques here. We allow
59 // threads to locate PRTs without locking, but threads attempting to alter
60 // a bucket list obtain a lock. This means that any failing attempt to
61 // find a PRT must be retried with the lock. It might seem dangerous that
62 // a read can find a PRT that is concurrently deleted. This is all right,
63 // because:
64 //
65 // 1) We only actually free PRT's at safe points (though we reuse them at
66 // other times).
67 // 2) We find PRT's in an attempt to add entries. If a PRT is deleted,
68 // it's _coarse_map bit is set, so the that we were attempting to add
69 // is represented. If a deleted PRT is re-used, a thread adding a bit,
70 // thinking the PRT is for a different region, does no harm.
71
72 class OtherRegionsTable VALUE_OBJ_CLASS_SPEC {
73 friend class HeapRegionRemSetIterator;
74
75 G1CollectedHeap* _g1h;
76 Mutex* _m;
77 HeapRegion* _hr;
78
79 // These are protected by "_m".
80 BitMap _coarse_map;
81 size_t _n_coarse_entries;
82 static jint _n_coarsenings;
83
84 PerRegionTable** _fine_grain_regions;
85 size_t _n_fine_entries;
86
87 // The fine grain remembered sets are doubly linked together using
88 // their 'next' and 'prev' fields.
89 // This allows fast bulk freeing of all the fine grain remembered
90 // set entries, and fast finding of all of them without iterating
91 // over the _fine_grain_regions table.
92 PerRegionTable * _first_all_fine_prts;
93 PerRegionTable * _last_all_fine_prts;
94
95 // Used to sample a subset of the fine grain PRTs to determine which
96 // PRT to evict and coarsen.
115 PerRegionTable* delete_region_table();
116
117 // If a PRT for "hr" is in the bucket list indicated by "ind" (which must
118 // be the correct index for "hr"), delete it and return true; else return
119 // false.
120 bool del_single_region_table(size_t ind, HeapRegion* hr);
121
122 // Indexed by thread X heap region, to minimize thread contention.
123 static int** _from_card_cache;
124 static size_t _from_card_cache_max_regions;
125 static size_t _from_card_cache_mem_size;
126
127 // link/add the given fine grain remembered set into the "all" list
128 void link_to_all(PerRegionTable * prt);
129 // unlink/remove the given fine grain remembered set into the "all" list
130 void unlink_from_all(PerRegionTable * prt);
131
132 public:
133 OtherRegionsTable(HeapRegion* hr);
134
135 void set_mutex(Mutex* m) { _m = m; }
136
137 HeapRegion* hr() const { return _hr; }
138
139 // For now. Could "expand" some tables in the future, so that this made
140 // sense.
141 void add_reference(OopOrNarrowOopStar from, int tid);
142
143 // Removes any entries shown by the given bitmaps to contain only dead
144 // objects.
145 void scrub(CardTableModRefBS* ctbs, BitMap* region_bm, BitMap* card_bm);
146
147 size_t occupied() const;
148 size_t occ_fine() const;
149 size_t occ_coarse() const;
150 size_t occ_sparse() const;
151
152 static jint n_coarsenings() { return _n_coarsenings; }
153
154 // Returns size in bytes.
155 // Not const because it takes a lock.
156 size_t mem_size() const;
157 static size_t static_mem_size();
158 static size_t fl_mem_size();
159
160 bool contains_reference(OopOrNarrowOopStar from) const;
161 bool contains_reference_locked(OopOrNarrowOopStar from) const;
162
163 void clear();
164
165 // Specifically clear the from_card_cache.
166 void clear_fcc();
177 // Declares that only regions i s.t. 0 <= i < new_n_regs are in use.
178 // Make sure any entries for higher regions are invalid.
179 static void shrink_from_card_cache(size_t new_n_regs);
180
181 static void print_from_card_cache();
182 };
183
184 class HeapRegionRemSet : public CHeapObj<mtGC> {
185 friend class VMStructs;
186 friend class HeapRegionRemSetIterator;
187
188 public:
189 enum Event {
190 Event_EvacStart, Event_EvacEnd, Event_RSUpdateEnd
191 };
192
193 private:
194 G1BlockOffsetSharedArray* _bosa;
195 G1BlockOffsetSharedArray* bosa() const { return _bosa; }
196
197 // A set of code blobs (nmethods) whose code contains pointers into
198 // the region that owns this RSet.
199 G1CodeRootSet _code_roots;
200
201 Mutex* _m;
202
203 OtherRegionsTable _other_regions;
204
205 enum ParIterState { Unclaimed, Claimed, Complete };
206 volatile ParIterState _iter_state;
207 volatile jlong _iter_claimed;
208
209 // Unused unless G1RecordHRRSOops is true.
210
211 static const int MaxRecorded = 1000000;
212 static OopOrNarrowOopStar* _recorded_oops;
213 static HeapWord** _recorded_cards;
214 static HeapRegion** _recorded_regions;
215 static int _n_recorded;
216
217 static const int MaxRecordedEvents = 1000;
218 static Event* _recorded_events;
219 static int* _recorded_event_index;
220 static int _n_recorded_events;
221
222 static void print_event(outputStream* str, Event evnt);
223
224 public:
225 HeapRegionRemSet(G1BlockOffsetSharedArray* bosa, HeapRegion* hr);
226 ~HeapRegionRemSet();
227
228 static int num_par_rem_sets();
229 static void setup_remset_size();
230
231 HeapRegion* hr() const {
232 return _other_regions.hr();
233 }
234
235 size_t occupied() {
236 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
237 return occupied_locked();
238 }
239 size_t occupied_locked() {
240 return _other_regions.occupied();
241 }
242 size_t occ_fine() const {
243 return _other_regions.occ_fine();
244 }
245 size_t occ_coarse() const {
246 return _other_regions.occ_coarse();
247 }
248 size_t occ_sparse() const {
249 return _other_regions.occ_sparse();
250 }
251
252 static jint n_coarsenings() { return OtherRegionsTable::n_coarsenings(); }
253
254 // Used in the sequential case.
255 void add_reference(OopOrNarrowOopStar from) {
256 _other_regions.add_reference(from, 0);
257 }
258
259 // Used in the parallel case.
260 void add_reference(OopOrNarrowOopStar from, int tid) {
261 _other_regions.add_reference(from, tid);
262 }
263
264 // Removes any entries shown by the given bitmaps to contain only dead
265 // objects.
266 void scrub(CardTableModRefBS* ctbs, BitMap* region_bm, BitMap* card_bm);
267
268 // The region is being reclaimed; clear its remset, and any mention of
269 // entries for this region in other remsets.
270 void clear();
271 void clear_locked();
272
273 // Attempt to claim the region. Returns true iff this call caused an
274 // atomic transition from Unclaimed to Claimed.
275 bool claim_iter();
276 // Sets the iteration state to "complete".
277 void set_iter_complete();
278 // Returns "true" iff the region's iteration is complete.
279 bool iter_is_complete();
280
281 // Support for claiming blocks of cards during iteration
282 size_t iter_claimed() const { return (size_t)_iter_claimed; }
283 // Claim the next block of cards
284 size_t iter_claimed_next(size_t step) {
285 size_t current, next;
286 do {
287 current = iter_claimed();
288 next = current + step;
289 } while (Atomic::cmpxchg((jlong)next, &_iter_claimed, (jlong)current) != (jlong)current);
290 return current;
291 }
292 void reset_for_par_iteration();
293
294 bool verify_ready_for_par_iteration() {
295 return (_iter_state == Unclaimed) && (_iter_claimed == 0);
296 }
297
298 // The actual # of bytes this hr_remset takes up.
299 // Note also includes the strong code root set.
300 size_t mem_size() {
301 MutexLockerEx x(_m, Mutex::_no_safepoint_check_flag);
302 return _other_regions.mem_size()
303 // This correction is necessary because the above includes the second
304 // part.
305 + (sizeof(this) - sizeof(OtherRegionsTable))
306 + strong_code_roots_mem_size();
307 }
308
309 // Returns the memory occupancy of all static data structures associated
310 // with remembered sets.
311 static size_t static_mem_size() {
312 return OtherRegionsTable::static_mem_size() + G1CodeRootSet::static_mem_size();
313 }
314
315 // Returns the memory occupancy of all free_list data structures associated
316 // with remembered sets.
317 static size_t fl_mem_size() {
318 return OtherRegionsTable::fl_mem_size() + G1CodeRootSet::fl_mem_size();
319 }
320
321 bool contains_reference(OopOrNarrowOopStar from) const {
322 return _other_regions.contains_reference(from);
323 }
324
325 // Routines for managing the list of code roots that point into
326 // the heap region that owns this RSet.
327 void add_strong_code_root(nmethod* nm);
328 void remove_strong_code_root(nmethod* nm);
329
330 // During a collection, migrate the successfully evacuated strong
331 // code roots that referenced into the region that owns this RSet
332 // to the RSets of the new regions that they now point into.
333 // Unsuccessfully evacuated code roots are not migrated.
334 void migrate_strong_code_roots();
335
336 // Applies blk->do_code_blob() to each of the entries in
337 // the strong code roots list
338 void strong_code_roots_do(CodeBlobClosure* blk) const;
339
340 // Returns the number of elements in the strong code roots list
341 size_t strong_code_roots_list_length() {
342 return _code_roots.length();
343 }
344
345 // Returns true if the strong code roots contains the given
346 // nmethod.
347 bool strong_code_roots_list_contains(nmethod* nm) {
348 return _code_roots.contains(nm);
349 }
350
351 // Returns the amount of memory, in bytes, currently
352 // consumed by the strong code roots.
353 size_t strong_code_roots_mem_size();
354
355 void print() PRODUCT_RETURN;
356
357 // Called during a stop-world phase to perform any deferred cleanups.
358 static void cleanup();
359
360 // Declare the heap size (in # of regions) to the HeapRegionRemSet(s).
361 // (Uses it to initialize from_card_cache).
362 static void init_heap(uint max_regions) {
363 G1CodeRootSet::initialize();
364 OtherRegionsTable::init_from_card_cache((size_t) max_regions);
365 }
366
367 // Declares that only regions i s.t. 0 <= i < new_n_regs are in use.
368 static void shrink_heap(uint new_n_regs) {
369 OtherRegionsTable::shrink_from_card_cache((size_t) new_n_regs);
370 }
371
372 #ifndef PRODUCT
373 static void print_from_card_cache() {
374 OtherRegionsTable::print_from_card_cache();
375 }
376 #endif
377
378 static void record(HeapRegion* hr, OopOrNarrowOopStar f);
379 static void print_recorded();
380 static void record_event(Event evnt);
381
382 // These are wrappers for the similarly-named methods on
383 // SparsePRT. Look at sparsePRT.hpp for more details.
384 static void reset_for_cleanup_tasks();
385 void do_cleanup_work(HRRSCleanupTask* hrrs_cleanup_task);
386 static void finish_cleanup_task(HRRSCleanupTask* hrrs_cleanup_task);
387
388 // Run unit tests.
389 #ifndef PRODUCT
390 static void test_prt();
391 static void test();
392 #endif
393 };
394
395 class HeapRegionRemSetIterator : public StackObj {
396
397 // The region RSet over which we're iterating.
398 HeapRegionRemSet* _hrrs;
399
400 // Local caching of HRRS fields.
401 const BitMap* _coarse_map;
402 PerRegionTable** _fine_grain_regions;
403
404 G1BlockOffsetSharedArray* _bosa;
405 G1CollectedHeap* _g1h;
406
407 // The number yielded since initialization.
408 size_t _n_yielded_fine;
409 size_t _n_yielded_coarse;
410 size_t _n_yielded_sparse;
411
412 // Indicates what granularity of table that we're currently iterating over.
413 // We start iterating over the sparse table, progress to the fine grain
414 // table, and then finish with the coarse table.
415 // See HeapRegionRemSetIterator::has_next().
416 enum IterState {
417 Sparse,
418 Fine,
435 bool coarse_has_next(size_t& card_index);
436
437 // Fine table iteration fields:
438
439 // Index of bucket-list we're working on.
440 int _fine_array_index;
441
442 // Per Region Table we're doing within current bucket list.
443 PerRegionTable* _fine_cur_prt;
444
445 /* SparsePRT::*/ SparsePRTIter _sparse_iter;
446
447 void fine_find_next_non_null_prt();
448
449 bool fine_has_next();
450 bool fine_has_next(size_t& card_index);
451
452 public:
453 // We require an iterator to be initialized before use, so the
454 // constructor does little.
455 HeapRegionRemSetIterator(HeapRegionRemSet* hrrs);
456
457 // If there remains one or more cards to be yielded, returns true and
458 // sets "card_index" to one of those cards (which is then considered
459 // yielded.) Otherwise, returns false (and leaves "card_index"
460 // undefined.)
461 bool has_next(size_t& card_index);
462
463 size_t n_yielded_fine() { return _n_yielded_fine; }
464 size_t n_yielded_coarse() { return _n_yielded_coarse; }
465 size_t n_yielded_sparse() { return _n_yielded_sparse; }
466 size_t n_yielded() {
467 return n_yielded_fine() + n_yielded_coarse() + n_yielded_sparse();
468 }
469 };
470
471 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONREMSET_HPP
|