Mercurial > hg > graal-jvmci-8
annotate src/share/vm/gc_implementation/g1/sparsePRT.hpp @ 1086:89f1b9ae8991
6898948: G1: forensic instrumentation for out-of-bounds recent_avg_pause_time_ratio()
Summary: Added instrumentation and (temporary) assert in non-product mode; clipped the value when found out-of-bounds in product mode. Fix of original issue will follow collection of data from this instrumentation.
Reviewed-by: jcoomes, tonyp
author | ysr |
---|---|
date | Fri, 13 Nov 2009 11:55:26 -0800 |
parents | fa2f65ebeb08 |
children | 0414c1049f15 |
rev | line source |
---|---|
342 | 1 /* |
579 | 2 * Copyright 2001-2009 Sun Microsystems, Inc. All Rights Reserved. |
342 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 // Sparse remembered set for a heap region (the "owning" region). Maps | |
26 // indices of other regions to short sequences of cards in the other region | |
27 // that might contain pointers into the owner region. | |
28 | |
29 // These tables only expand while they are accessed in parallel -- | |
30 // deletions may be done in single-threaded code. This allows us to allow | |
31 // unsynchronized reads/iterations, as long as expansions caused by | |
32 // insertions only enqueue old versions for deletions, but do not delete | |
33 // old versions synchronously. | |
34 | |
35 | |
549
fe3d7c11b4b7
6700941: G1: allocation spec missing for some G1 classes
apetrusenko
parents:
342
diff
changeset
|
36 class SparsePRTEntry: public CHeapObj { |
342 | 37 public: |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
38 |
342 | 39 enum SomePublicConstants { |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
40 CardsPerEntry = 4, |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
41 NullEntry = -1 |
342 | 42 }; |
43 | |
44 private: | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
45 RegionIdx_t _region_ind; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
46 int _next_index; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
47 CardIdx_t _cards[CardsPerEntry]; |
342 | 48 |
49 public: | |
50 | |
51 // Set the region_ind to the given value, and delete all cards. | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
52 inline void init(RegionIdx_t region_ind); |
342 | 53 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
54 RegionIdx_t r_ind() const { return _region_ind; } |
342 | 55 bool valid_entry() const { return r_ind() >= 0; } |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
56 void set_r_ind(RegionIdx_t rind) { _region_ind = rind; } |
342 | 57 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
58 int next_index() const { return _next_index; } |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
59 int* next_index_addr() { return &_next_index; } |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
60 void set_next_index(int ni) { _next_index = ni; } |
342 | 61 |
62 // Returns "true" iff the entry contains the given card index. | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
63 inline bool contains_card(CardIdx_t card_index) const; |
342 | 64 |
65 // Returns the number of non-NULL card entries. | |
66 inline int num_valid_cards() const; | |
67 | |
68 // Requires that the entry not contain the given card index. If there is | |
69 // space available, add the given card index to the entry and return | |
70 // "true"; otherwise, return "false" to indicate that the entry is full. | |
71 enum AddCardResult { | |
72 overflow, | |
73 found, | |
74 added | |
75 }; | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
76 inline AddCardResult add_card(CardIdx_t card_index); |
342 | 77 |
78 // Copy the current entry's cards into "cards". | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
79 inline void copy_cards(CardIdx_t* cards) const; |
342 | 80 // Copy the current entry's cards into the "_card" array of "e." |
81 inline void copy_cards(SparsePRTEntry* e) const; | |
82 | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
83 inline CardIdx_t card(int i) const { return _cards[i]; } |
342 | 84 }; |
85 | |
86 | |
87 class RSHashTable : public CHeapObj { | |
88 | |
89 friend class RSHashTableIter; | |
90 | |
91 enum SomePrivateConstants { | |
92 NullEntry = -1 | |
93 }; | |
94 | |
95 size_t _capacity; | |
96 size_t _capacity_mask; | |
97 size_t _occupied_entries; | |
98 size_t _occupied_cards; | |
99 | |
100 SparsePRTEntry* _entries; | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
101 int* _buckets; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
102 int _free_region; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
103 int _free_list; |
342 | 104 |
105 // Requires that the caller hold a lock preventing parallel modifying | |
106 // operations, and that the the table be less than completely full. If | |
107 // an entry for "region_ind" is already in the table, finds it and | |
108 // returns its address; otherwise returns "NULL." | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
109 SparsePRTEntry* entry_for_region_ind(RegionIdx_t region_ind) const; |
342 | 110 |
111 // Requires that the caller hold a lock preventing parallel modifying | |
112 // operations, and that the the table be less than completely full. If | |
113 // an entry for "region_ind" is already in the table, finds it and | |
114 // returns its address; otherwise allocates, initializes, inserts and | |
115 // returns a new entry for "region_ind". | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
116 SparsePRTEntry* entry_for_region_ind_create(RegionIdx_t region_ind); |
342 | 117 |
118 // Returns the index of the next free entry in "_entries". | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
119 int alloc_entry(); |
342 | 120 // Declares the entry "fi" to be free. (It must have already been |
121 // deleted from any bucket lists. | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
122 void free_entry(int fi); |
342 | 123 |
124 public: | |
125 RSHashTable(size_t capacity); | |
126 ~RSHashTable(); | |
127 | |
128 // Attempts to ensure that the given card_index in the given region is in | |
129 // the sparse table. If successful (because the card was already | |
130 // present, or because it was successfullly added) returns "true". | |
131 // Otherwise, returns "false" to indicate that the addition would | |
132 // overflow the entry for the region. The caller must transfer these | |
133 // entries to a larger-capacity representation. | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
134 bool add_card(RegionIdx_t region_id, CardIdx_t card_index); |
342 | 135 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
136 bool get_cards(RegionIdx_t region_id, CardIdx_t* cards); |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
137 bool delete_entry(RegionIdx_t region_id); |
342 | 138 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
139 bool contains_card(RegionIdx_t region_id, CardIdx_t card_index) const; |
342 | 140 |
141 void add_entry(SparsePRTEntry* e); | |
142 | |
143 void clear(); | |
144 | |
145 size_t capacity() const { return _capacity; } | |
146 size_t capacity_mask() const { return _capacity_mask; } | |
147 size_t occupied_entries() const { return _occupied_entries; } | |
148 size_t occupied_cards() const { return _occupied_cards; } | |
149 size_t mem_size() const; | |
150 | |
151 SparsePRTEntry* entry(int i) const { return &_entries[i]; } | |
152 | |
153 void print(); | |
154 }; | |
155 | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
156 // ValueObj because will be embedded in HRRS iterator. |
549
fe3d7c11b4b7
6700941: G1: allocation spec missing for some G1 classes
apetrusenko
parents:
342
diff
changeset
|
157 class RSHashTableIter VALUE_OBJ_CLASS_SPEC { |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
158 int _tbl_ind; // [-1, 0.._rsht->_capacity) |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
159 int _bl_ind; // [-1, 0.._rsht->_capacity) |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
160 short _card_ind; // [0..CardsPerEntry) |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
161 RSHashTable* _rsht; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
162 size_t _heap_bot_card_ind; |
342 | 163 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
164 // If the bucket list pointed to by _bl_ind contains a card, sets |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
165 // _bl_ind to the index of that entry, and returns the card. |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
166 // Otherwise, returns SparseEntry::NullEntry. |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
167 CardIdx_t find_first_card_in_list(); |
342 | 168 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
169 // Computes the proper card index for the card whose offset in the |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
170 // current region (as indicated by _bl_ind) is "ci". |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
171 // This is subject to errors when there is iteration concurrent with |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
172 // modification, but these errors should be benign. |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
173 size_t compute_card_ind(CardIdx_t ci); |
342 | 174 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
175 public: |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
176 RSHashTableIter(size_t heap_bot_card_ind) : |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
177 _tbl_ind(RSHashTable::NullEntry), |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
178 _bl_ind(RSHashTable::NullEntry), |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
179 _card_ind((SparsePRTEntry::CardsPerEntry-1)), |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
180 _rsht(NULL), |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
181 _heap_bot_card_ind(heap_bot_card_ind) |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
182 {} |
342 | 183 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
184 void init(RSHashTable* rsht) { |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
185 _rsht = rsht; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
186 _tbl_ind = -1; // So that first increment gets to 0. |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
187 _bl_ind = RSHashTable::NullEntry; |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
188 _card_ind = (SparsePRTEntry::CardsPerEntry-1); |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
189 } |
342 | 190 |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
191 bool has_next(size_t& card_index); |
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
192 }; |
342 | 193 |
194 // Concurrent accesss to a SparsePRT must be serialized by some external | |
195 // mutex. | |
196 | |
197 class SparsePRTIter; | |
198 | |
549
fe3d7c11b4b7
6700941: G1: allocation spec missing for some G1 classes
apetrusenko
parents:
342
diff
changeset
|
199 class SparsePRT VALUE_OBJ_CLASS_SPEC { |
342 | 200 // Iterations are done on the _cur hash table, since they only need to |
201 // see entries visible at the start of a collection pause. | |
202 // All other operations are done using the _next hash table. | |
203 RSHashTable* _cur; | |
204 RSHashTable* _next; | |
205 | |
206 HeapRegion* _hr; | |
207 | |
208 enum SomeAdditionalPrivateConstants { | |
209 InitialCapacity = 16 | |
210 }; | |
211 | |
212 void expand(); | |
213 | |
214 bool _expanded; | |
215 | |
216 bool expanded() { return _expanded; } | |
217 void set_expanded(bool b) { _expanded = b; } | |
218 | |
219 SparsePRT* _next_expanded; | |
220 | |
221 SparsePRT* next_expanded() { return _next_expanded; } | |
222 void set_next_expanded(SparsePRT* nxt) { _next_expanded = nxt; } | |
223 | |
224 static SparsePRT* _head_expanded_list; | |
225 | |
226 public: | |
227 SparsePRT(HeapRegion* hr); | |
228 | |
229 ~SparsePRT(); | |
230 | |
231 size_t occupied() const { return _next->occupied_cards(); } | |
232 size_t mem_size() const; | |
233 | |
234 // Attempts to ensure that the given card_index in the given region is in | |
235 // the sparse table. If successful (because the card was already | |
236 // present, or because it was successfullly added) returns "true". | |
237 // Otherwise, returns "false" to indicate that the addition would | |
238 // overflow the entry for the region. The caller must transfer these | |
239 // entries to a larger-capacity representation. | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
240 bool add_card(RegionIdx_t region_id, CardIdx_t card_index); |
342 | 241 |
242 // If the table hold an entry for "region_ind", Copies its | |
243 // cards into "cards", which must be an array of length at least | |
244 // "CardsPerEntry", and returns "true"; otherwise, returns "false". | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
245 bool get_cards(RegionIdx_t region_ind, CardIdx_t* cards); |
342 | 246 |
247 // If there is an entry for "region_ind", removes it and return "true"; | |
248 // otherwise returns "false." | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
249 bool delete_entry(RegionIdx_t region_ind); |
342 | 250 |
251 // Clear the table, and reinitialize to initial capacity. | |
252 void clear(); | |
253 | |
254 // Ensure that "_cur" and "_next" point to the same table. | |
255 void cleanup(); | |
256 | |
257 // Clean up all tables on the expanded list. Called single threaded. | |
258 static void cleanup_all(); | |
617
0db4adb6e914
6810698: G1: two small bugs in the sparse remembered sets
tonyp
parents:
549
diff
changeset
|
259 RSHashTable* cur() const { return _cur; } |
342 | 260 |
261 void init_iterator(SparsePRTIter* sprt_iter); | |
262 | |
263 static void add_to_expanded_list(SparsePRT* sprt); | |
264 static SparsePRT* get_from_expanded_list(); | |
265 | |
807
d44bdab1c03d
6843694: G1: assert(index < _vs.committed_size(),"bad index"), g1BlockOffsetTable.inline.hpp:55
johnc
parents:
628
diff
changeset
|
266 bool contains_card(RegionIdx_t region_id, CardIdx_t card_index) const { |
342 | 267 return _next->contains_card(region_id, card_index); |
268 } | |
269 | |
270 #if 0 | |
271 void verify_is_cleared(); | |
272 void print(); | |
273 #endif | |
274 }; | |
275 | |
276 | |
277 class SparsePRTIter: public /* RSHashTable:: */RSHashTableIter { | |
278 public: | |
279 SparsePRTIter(size_t heap_bot_card_ind) : | |
280 /* RSHashTable:: */RSHashTableIter(heap_bot_card_ind) | |
281 {} | |
282 | |
283 void init(const SparsePRT* sprt) { | |
617
0db4adb6e914
6810698: G1: two small bugs in the sparse remembered sets
tonyp
parents:
549
diff
changeset
|
284 RSHashTableIter::init(sprt->cur()); |
342 | 285 } |
286 bool has_next(size_t& card_index) { | |
287 return RSHashTableIter::has_next(card_index); | |
288 } | |
289 }; |