Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/g1/heapRegion.hpp @ 3687:7958ebb561b0
Merge
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Fri, 18 Nov 2011 17:20:38 +0100 |
parents | 063382f9b575 |
children | c3f1170908be |
rev | line source |
---|---|
342 | 1 /* |
2133
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
2 * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
342 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
21 * questions. |
342 | 22 * |
23 */ | |
24 | |
1972 | 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGION_HPP |
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGION_HPP | |
27 | |
28 #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp" | |
29 #include "gc_implementation/g1/g1_specialized_oop_closures.hpp" | |
30 #include "gc_implementation/g1/survRateGroup.hpp" | |
31 #include "gc_implementation/shared/ageTable.hpp" | |
32 #include "gc_implementation/shared/spaceDecorator.hpp" | |
33 #include "memory/space.inline.hpp" | |
34 #include "memory/watermark.hpp" | |
35 | |
342 | 36 #ifndef SERIALGC |
37 | |
38 // A HeapRegion is the smallest piece of a G1CollectedHeap that | |
39 // can be collected independently. | |
40 | |
41 // NOTE: Although a HeapRegion is a Space, its | |
42 // Space::initDirtyCardClosure method must not be called. | |
43 // The problem is that the existence of this method breaks | |
44 // the independence of barrier sets from remembered sets. | |
45 // The solution is to remove this method from the definition | |
46 // of a Space. | |
47 | |
48 class CompactibleSpace; | |
49 class ContiguousSpace; | |
50 class HeapRegionRemSet; | |
51 class HeapRegionRemSetIterator; | |
52 class HeapRegion; | |
2152 | 53 class HeapRegionSetBase; |
54 | |
55 #define HR_FORMAT "%d:["PTR_FORMAT","PTR_FORMAT","PTR_FORMAT"]" | |
2361 | 56 #define HR_FORMAT_PARAMS(_hr_) (_hr_)->hrs_index(), (_hr_)->bottom(), \ |
57 (_hr_)->top(), (_hr_)->end() | |
342 | 58 |
59 // A dirty card to oop closure for heap regions. It | |
60 // knows how to get the G1 heap and how to use the bitmap | |
61 // in the concurrent marker used by G1 to filter remembered | |
62 // sets. | |
63 | |
64 class HeapRegionDCTOC : public ContiguousSpaceDCTOC { | |
65 public: | |
66 // Specification of possible DirtyCardToOopClosure filtering. | |
67 enum FilterKind { | |
68 NoFilterKind, | |
69 IntoCSFilterKind, | |
70 OutOfRegionFilterKind | |
71 }; | |
72 | |
73 protected: | |
74 HeapRegion* _hr; | |
75 FilterKind _fk; | |
76 G1CollectedHeap* _g1; | |
77 | |
78 void walk_mem_region_with_cl(MemRegion mr, | |
79 HeapWord* bottom, HeapWord* top, | |
80 OopClosure* cl); | |
81 | |
82 // We don't specialize this for FilteringClosure; filtering is handled by | |
83 // the "FilterKind" mechanism. But we provide this to avoid a compiler | |
84 // warning. | |
85 void walk_mem_region_with_cl(MemRegion mr, | |
86 HeapWord* bottom, HeapWord* top, | |
87 FilteringClosure* cl) { | |
88 HeapRegionDCTOC::walk_mem_region_with_cl(mr, bottom, top, | |
89 (OopClosure*)cl); | |
90 } | |
91 | |
92 // Get the actual top of the area on which the closure will | |
93 // operate, given where the top is assumed to be (the end of the | |
94 // memory region passed to do_MemRegion) and where the object | |
95 // at the top is assumed to start. For example, an object may | |
96 // start at the top but actually extend past the assumed top, | |
97 // in which case the top becomes the end of the object. | |
98 HeapWord* get_actual_top(HeapWord* top, HeapWord* top_obj) { | |
99 return ContiguousSpaceDCTOC::get_actual_top(top, top_obj); | |
100 } | |
101 | |
102 // Walk the given memory region from bottom to (actual) top | |
103 // looking for objects and applying the oop closure (_cl) to | |
104 // them. The base implementation of this treats the area as | |
105 // blocks, where a block may or may not be an object. Sub- | |
106 // classes should override this to provide more accurate | |
107 // or possibly more efficient walking. | |
108 void walk_mem_region(MemRegion mr, HeapWord* bottom, HeapWord* top) { | |
109 Filtering_DCTOC::walk_mem_region(mr, bottom, top); | |
110 } | |
111 | |
112 public: | |
113 HeapRegionDCTOC(G1CollectedHeap* g1, | |
114 HeapRegion* hr, OopClosure* cl, | |
115 CardTableModRefBS::PrecisionStyle precision, | |
116 FilterKind fk); | |
117 }; | |
118 | |
119 | |
120 // The complicating factor is that BlockOffsetTable diverged | |
121 // significantly, and we need functionality that is only in the G1 version. | |
122 // So I copied that code, which led to an alternate G1 version of | |
123 // OffsetTableContigSpace. If the two versions of BlockOffsetTable could | |
124 // be reconciled, then G1OffsetTableContigSpace could go away. | |
125 | |
126 // The idea behind time stamps is the following. Doing a save_marks on | |
127 // all regions at every GC pause is time consuming (if I remember | |
128 // well, 10ms or so). So, we would like to do that only for regions | |
129 // that are GC alloc regions. To achieve this, we use time | |
130 // stamps. For every evacuation pause, G1CollectedHeap generates a | |
131 // unique time stamp (essentially a counter that gets | |
132 // incremented). Every time we want to call save_marks on a region, | |
133 // we set the saved_mark_word to top and also copy the current GC | |
134 // time stamp to the time stamp field of the space. Reading the | |
135 // saved_mark_word involves checking the time stamp of the | |
136 // region. If it is the same as the current GC time stamp, then we | |
137 // can safely read the saved_mark_word field, as it is valid. If the | |
138 // time stamp of the region is not the same as the current GC time | |
139 // stamp, then we instead read top, as the saved_mark_word field is | |
140 // invalid. Time stamps (on the regions and also on the | |
141 // G1CollectedHeap) are reset at every cleanup (we iterate over | |
142 // the regions anyway) and at the end of a Full GC. The current scheme | |
143 // that uses sequential unsigned ints will fail only if we have 4b | |
144 // evacuation pauses between two cleanups, which is _highly_ unlikely. | |
145 | |
146 class G1OffsetTableContigSpace: public ContiguousSpace { | |
147 friend class VMStructs; | |
148 protected: | |
149 G1BlockOffsetArrayContigSpace _offsets; | |
150 Mutex _par_alloc_lock; | |
151 volatile unsigned _gc_time_stamp; | |
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
152 // When we need to retire an allocation region, while other threads |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
153 // are also concurrently trying to allocate into it, we typically |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
154 // allocate a dummy object at the end of the region to ensure that |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
155 // no more allocations can take place in it. However, sometimes we |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
156 // want to know where the end of the last "real" object we allocated |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
157 // into the region was and this is what this keeps track. |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
158 HeapWord* _pre_dummy_top; |
342 | 159 |
160 public: | |
161 // Constructor. If "is_zeroed" is true, the MemRegion "mr" may be | |
162 // assumed to contain zeros. | |
163 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray, | |
164 MemRegion mr, bool is_zeroed = false); | |
165 | |
166 void set_bottom(HeapWord* value); | |
167 void set_end(HeapWord* value); | |
168 | |
169 virtual HeapWord* saved_mark_word() const; | |
170 virtual void set_saved_mark(); | |
171 void reset_gc_time_stamp() { _gc_time_stamp = 0; } | |
172 | |
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
173 // See the comment above in the declaration of _pre_dummy_top for an |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
174 // explanation of what it is. |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
175 void set_pre_dummy_top(HeapWord* pre_dummy_top) { |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
176 assert(is_in(pre_dummy_top) && pre_dummy_top <= top(), "pre-condition"); |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
177 _pre_dummy_top = pre_dummy_top; |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
178 } |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
179 HeapWord* pre_dummy_top() { |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
180 return (_pre_dummy_top == NULL) ? top() : _pre_dummy_top; |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
181 } |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
182 void reset_pre_dummy_top() { _pre_dummy_top = NULL; } |
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
183 |
356 | 184 virtual void initialize(MemRegion mr, bool clear_space, bool mangle_space); |
185 virtual void clear(bool mangle_space); | |
342 | 186 |
187 HeapWord* block_start(const void* p); | |
188 HeapWord* block_start_const(const void* p) const; | |
189 | |
190 // Add offset table update. | |
191 virtual HeapWord* allocate(size_t word_size); | |
192 HeapWord* par_allocate(size_t word_size); | |
193 | |
194 // MarkSweep support phase3 | |
195 virtual HeapWord* initialize_threshold(); | |
196 virtual HeapWord* cross_threshold(HeapWord* start, HeapWord* end); | |
197 | |
198 virtual void print() const; | |
2133
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
199 |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
200 void reset_bot() { |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
201 _offsets.zero_bottom_entry(); |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
202 _offsets.initialize_threshold(); |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
203 } |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
204 |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
205 void update_bot_for_object(HeapWord* start, size_t word_size) { |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
206 _offsets.alloc_block(start, word_size); |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
207 } |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
208 |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
209 void print_bot_on(outputStream* out) { |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
210 _offsets.print_on(out); |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
211 } |
342 | 212 }; |
213 | |
214 class HeapRegion: public G1OffsetTableContigSpace { | |
215 friend class VMStructs; | |
216 private: | |
217 | |
355 | 218 enum HumongousType { |
219 NotHumongous = 0, | |
220 StartsHumongous, | |
221 ContinuesHumongous | |
222 }; | |
223 | |
342 | 224 // The next filter kind that should be used for a "new_dcto_cl" call with |
225 // the "traditional" signature. | |
226 HeapRegionDCTOC::FilterKind _next_fk; | |
227 | |
228 // Requires that the region "mr" be dense with objects, and begin and end | |
229 // with an object. | |
230 void oops_in_mr_iterate(MemRegion mr, OopClosure* cl); | |
231 | |
232 // The remembered set for this region. | |
233 // (Might want to make this "inline" later, to avoid some alloc failure | |
234 // issues.) | |
235 HeapRegionRemSet* _rem_set; | |
236 | |
237 G1BlockOffsetArrayContigSpace* offsets() { return &_offsets; } | |
238 | |
239 protected: | |
240 // If this region is a member of a HeapRegionSeq, the index in that | |
241 // sequence, otherwise -1. | |
242 int _hrs_index; | |
243 | |
355 | 244 HumongousType _humongous_type; |
342 | 245 // For a humongous region, region in which it starts. |
246 HeapRegion* _humongous_start_region; | |
247 // For the start region of a humongous sequence, it's original end(). | |
248 HeapWord* _orig_end; | |
249 | |
250 // True iff the region is in current collection_set. | |
251 bool _in_collection_set; | |
252 | |
253 // Is this or has it been an allocation region in the current collection | |
254 // pause. | |
255 bool _is_gc_alloc_region; | |
256 | |
257 // True iff an attempt to evacuate an object in the region failed. | |
258 bool _evacuation_failed; | |
259 | |
260 // A heap region may be a member one of a number of special subsets, each | |
261 // represented as linked lists through the field below. Currently, these | |
262 // sets include: | |
263 // The collection set. | |
264 // The set of allocation regions used in a collection pause. | |
265 // Spaces that may contain gray objects. | |
266 HeapRegion* _next_in_special_set; | |
267 | |
268 // next region in the young "generation" region set | |
269 HeapRegion* _next_young_region; | |
270 | |
796
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
271 // Next region whose cards need cleaning |
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
272 HeapRegion* _next_dirty_cards_region; |
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
273 |
2152 | 274 // Fields used by the HeapRegionSetBase class and subclasses. |
275 HeapRegion* _next; | |
276 #ifdef ASSERT | |
277 HeapRegionSetBase* _containing_set; | |
278 #endif // ASSERT | |
279 bool _pending_removal; | |
280 | |
342 | 281 // For parallel heapRegion traversal. |
282 jint _claimed; | |
283 | |
284 // We use concurrent marking to determine the amount of live data | |
285 // in each heap region. | |
286 size_t _prev_marked_bytes; // Bytes known to be live via last completed marking. | |
287 size_t _next_marked_bytes; // Bytes known to be live via in-progress marking. | |
288 | |
289 // See "sort_index" method. -1 means is not in the array. | |
290 int _sort_index; | |
291 | |
292 // <PREDICTION> | |
293 double _gc_efficiency; | |
294 // </PREDICTION> | |
295 | |
296 enum YoungType { | |
297 NotYoung, // a region is not young | |
298 Young, // a region is young | |
299 Survivor // a region is young and it contains | |
300 // survivor | |
301 }; | |
302 | |
1666
5cbac8938c4c
6956639: G1: assert(cached_ptr != card_ptr) failed: shouldn't be, concurrentG1Refine.cpp:307
johnc
parents:
1552
diff
changeset
|
303 volatile YoungType _young_type; |
342 | 304 int _young_index_in_cset; |
305 SurvRateGroup* _surv_rate_group; | |
306 int _age_index; | |
307 | |
308 // The start of the unmarked area. The unmarked area extends from this | |
309 // word until the top and/or end of the region, and is the part | |
310 // of the region for which no marking was done, i.e. objects may | |
311 // have been allocated in this part since the last mark phase. | |
312 // "prev" is the top at the start of the last completed marking. | |
313 // "next" is the top at the start of the in-progress marking (if any.) | |
314 HeapWord* _prev_top_at_mark_start; | |
315 HeapWord* _next_top_at_mark_start; | |
316 // If a collection pause is in progress, this is the top at the start | |
317 // of that pause. | |
318 | |
319 // We've counted the marked bytes of objects below here. | |
320 HeapWord* _top_at_conc_mark_count; | |
321 | |
322 void init_top_at_mark_start() { | |
323 assert(_prev_marked_bytes == 0 && | |
324 _next_marked_bytes == 0, | |
325 "Must be called after zero_marked_bytes."); | |
326 HeapWord* bot = bottom(); | |
327 _prev_top_at_mark_start = bot; | |
328 _next_top_at_mark_start = bot; | |
329 _top_at_conc_mark_count = bot; | |
330 } | |
331 | |
332 void set_young_type(YoungType new_type) { | |
333 //assert(_young_type != new_type, "setting the same type" ); | |
334 // TODO: add more assertions here | |
335 _young_type = new_type; | |
336 } | |
337 | |
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
338 // Cached attributes used in the collection set policy information |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
339 |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
340 // The RSet length that was added to the total value |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
341 // for the collection set. |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
342 size_t _recorded_rs_length; |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
343 |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
344 // The predicted elapsed time that was added to total value |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
345 // for the collection set. |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
346 double _predicted_elapsed_time_ms; |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
347 |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
348 // The predicted number of bytes to copy that was added to |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
349 // the total value for the collection set. |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
350 size_t _predicted_bytes_to_copy; |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
351 |
342 | 352 public: |
353 // If "is_zeroed" is "true", the region "mr" can be assumed to contain zeros. | |
354 HeapRegion(G1BlockOffsetSharedArray* sharedOffsetArray, | |
355 MemRegion mr, bool is_zeroed); | |
356 | |
942
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
357 static int LogOfHRGrainBytes; |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
358 static int LogOfHRGrainWords; |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
359 // The normal type of these should be size_t. However, they used to |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
360 // be members of an enum before and they are assumed by the |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
361 // compilers to be ints. To avoid going and fixing all their uses, |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
362 // I'm declaring them as ints. I'm not anticipating heap region |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
363 // sizes to reach anywhere near 2g, so using an int here is safe. |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
364 static int GrainBytes; |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
365 static int GrainWords; |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
366 static int CardsPerRegion; |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
367 |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
368 // It sets up the heap region size (GrainBytes / GrainWords), as |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
369 // well as other related fields that are based on the heap region |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
370 // size (LogOfHRGrainBytes / LogOfHRGrainWords / |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
371 // CardsPerRegion). All those fields are considered constant |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
372 // throughout the JVM's execution, therefore they should only be set |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
373 // up once during initialization time. |
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
374 static void setup_heap_region_size(uintx min_heap_size); |
342 | 375 |
355 | 376 enum ClaimValues { |
377 InitialClaimValue = 0, | |
378 FinalCountClaimValue = 1, | |
379 NoteEndClaimValue = 2, | |
390 | 380 ScrubRemSetClaimValue = 3, |
626
87fa6e083d82
6760309: G1: update remembered sets during Full GCs
apetrusenko
parents:
549
diff
changeset
|
381 ParVerifyClaimValue = 4, |
87fa6e083d82
6760309: G1: update remembered sets during Full GCs
apetrusenko
parents:
549
diff
changeset
|
382 RebuildRSClaimValue = 5 |
355 | 383 }; |
384 | |
2134
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
385 inline HeapWord* par_allocate_no_bot_updates(size_t word_size) { |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
386 assert(is_young(), "we can only skip BOT updates on young regions"); |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
387 return ContiguousSpace::par_allocate(word_size); |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
388 } |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
389 inline HeapWord* allocate_no_bot_updates(size_t word_size) { |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
390 assert(is_young(), "we can only skip BOT updates on young regions"); |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
391 return ContiguousSpace::allocate(word_size); |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
392 } |
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
393 |
342 | 394 // If this region is a member of a HeapRegionSeq, the index in that |
395 // sequence, otherwise -1. | |
396 int hrs_index() const { return _hrs_index; } | |
397 void set_hrs_index(int index) { _hrs_index = index; } | |
398 | |
399 // The number of bytes marked live in the region in the last marking phase. | |
400 size_t marked_bytes() { return _prev_marked_bytes; } | |
2435
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
401 size_t live_bytes() { |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
402 return (top() - prev_top_at_mark_start()) * HeapWordSize + marked_bytes(); |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
403 } |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
404 |
342 | 405 // The number of bytes counted in the next marking. |
406 size_t next_marked_bytes() { return _next_marked_bytes; } | |
407 // The number of bytes live wrt the next marking. | |
408 size_t next_live_bytes() { | |
2435
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
409 return |
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
410 (top() - next_top_at_mark_start()) * HeapWordSize + next_marked_bytes(); |
342 | 411 } |
412 | |
413 // A lower bound on the amount of garbage bytes in the region. | |
414 size_t garbage_bytes() { | |
415 size_t used_at_mark_start_bytes = | |
416 (prev_top_at_mark_start() - bottom()) * HeapWordSize; | |
417 assert(used_at_mark_start_bytes >= marked_bytes(), | |
418 "Can't mark more than we have."); | |
419 return used_at_mark_start_bytes - marked_bytes(); | |
420 } | |
421 | |
422 // An upper bound on the number of live bytes in the region. | |
423 size_t max_live_bytes() { return used() - garbage_bytes(); } | |
424 | |
425 void add_to_marked_bytes(size_t incr_bytes) { | |
426 _next_marked_bytes = _next_marked_bytes + incr_bytes; | |
427 guarantee( _next_marked_bytes <= used(), "invariant" ); | |
428 } | |
429 | |
430 void zero_marked_bytes() { | |
431 _prev_marked_bytes = _next_marked_bytes = 0; | |
432 } | |
433 | |
355 | 434 bool isHumongous() const { return _humongous_type != NotHumongous; } |
435 bool startsHumongous() const { return _humongous_type == StartsHumongous; } | |
436 bool continuesHumongous() const { return _humongous_type == ContinuesHumongous; } | |
342 | 437 // For a humongous region, region in which it starts. |
438 HeapRegion* humongous_start_region() const { | |
439 return _humongous_start_region; | |
440 } | |
441 | |
2133
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
442 // Makes the current region be a "starts humongous" region, i.e., |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
443 // the first region in a series of one or more contiguous regions |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
444 // that will contain a single "humongous" object. The two parameters |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
445 // are as follows: |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
446 // |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
447 // new_top : The new value of the top field of this region which |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
448 // points to the end of the humongous object that's being |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
449 // allocated. If there is more than one region in the series, top |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
450 // will lie beyond this region's original end field and on the last |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
451 // region in the series. |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
452 // |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
453 // new_end : The new value of the end field of this region which |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
454 // points to the end of the last region in the series. If there is |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
455 // one region in the series (namely: this one) end will be the same |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
456 // as the original end of this region. |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
457 // |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
458 // Updating top and end as described above makes this region look as |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
459 // if it spans the entire space taken up by all the regions in the |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
460 // series and an single allocation moved its top to new_top. This |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
461 // ensures that the space (capacity / allocated) taken up by all |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
462 // humongous regions can be calculated by just looking at the |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
463 // "starts humongous" regions and by ignoring the "continues |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
464 // humongous" regions. |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
465 void set_startsHumongous(HeapWord* new_top, HeapWord* new_end); |
342 | 466 |
2133
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
467 // Makes the current region be a "continues humongous' |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
468 // region. first_hr is the "start humongous" region of the series |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
469 // which this region will be part of. |
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
470 void set_continuesHumongous(HeapRegion* first_hr); |
342 | 471 |
2152 | 472 // Unsets the humongous-related fields on the region. |
473 void set_notHumongous(); | |
474 | |
342 | 475 // If the region has a remembered set, return a pointer to it. |
476 HeapRegionRemSet* rem_set() const { | |
477 return _rem_set; | |
478 } | |
479 | |
480 // True iff the region is in current collection_set. | |
481 bool in_collection_set() const { | |
482 return _in_collection_set; | |
483 } | |
484 void set_in_collection_set(bool b) { | |
485 _in_collection_set = b; | |
486 } | |
487 HeapRegion* next_in_collection_set() { | |
488 assert(in_collection_set(), "should only invoke on member of CS."); | |
489 assert(_next_in_special_set == NULL || | |
490 _next_in_special_set->in_collection_set(), | |
491 "Malformed CS."); | |
492 return _next_in_special_set; | |
493 } | |
494 void set_next_in_collection_set(HeapRegion* r) { | |
495 assert(in_collection_set(), "should only invoke on member of CS."); | |
496 assert(r == NULL || r->in_collection_set(), "Malformed CS."); | |
497 _next_in_special_set = r; | |
498 } | |
499 | |
500 // True iff it is or has been an allocation region in the current | |
501 // collection pause. | |
502 bool is_gc_alloc_region() const { | |
503 return _is_gc_alloc_region; | |
504 } | |
505 void set_is_gc_alloc_region(bool b) { | |
506 _is_gc_alloc_region = b; | |
507 } | |
508 HeapRegion* next_gc_alloc_region() { | |
509 assert(is_gc_alloc_region(), "should only invoke on member of CS."); | |
510 assert(_next_in_special_set == NULL || | |
511 _next_in_special_set->is_gc_alloc_region(), | |
512 "Malformed CS."); | |
513 return _next_in_special_set; | |
514 } | |
515 void set_next_gc_alloc_region(HeapRegion* r) { | |
516 assert(is_gc_alloc_region(), "should only invoke on member of CS."); | |
517 assert(r == NULL || r->is_gc_alloc_region(), "Malformed CS."); | |
518 _next_in_special_set = r; | |
519 } | |
520 | |
2152 | 521 // Methods used by the HeapRegionSetBase class and subclasses. |
342 | 522 |
2152 | 523 // Getter and setter for the next field used to link regions into |
524 // linked lists. | |
525 HeapRegion* next() { return _next; } | |
526 | |
527 void set_next(HeapRegion* next) { _next = next; } | |
342 | 528 |
2152 | 529 // Every region added to a set is tagged with a reference to that |
530 // set. This is used for doing consistency checking to make sure that | |
531 // the contents of a set are as they should be and it's only | |
532 // available in non-product builds. | |
533 #ifdef ASSERT | |
534 void set_containing_set(HeapRegionSetBase* containing_set) { | |
535 assert((containing_set == NULL && _containing_set != NULL) || | |
536 (containing_set != NULL && _containing_set == NULL), | |
537 err_msg("containing_set: "PTR_FORMAT" " | |
538 "_containing_set: "PTR_FORMAT, | |
539 containing_set, _containing_set)); | |
540 | |
541 _containing_set = containing_set; | |
2361 | 542 } |
342 | 543 |
2152 | 544 HeapRegionSetBase* containing_set() { return _containing_set; } |
545 #else // ASSERT | |
546 void set_containing_set(HeapRegionSetBase* containing_set) { } | |
342 | 547 |
2361 | 548 // containing_set() is only used in asserts so there's no reason |
2152 | 549 // to provide a dummy version of it. |
550 #endif // ASSERT | |
342 | 551 |
2152 | 552 // If we want to remove regions from a list in bulk we can simply tag |
553 // them with the pending_removal tag and call the | |
554 // remove_all_pending() method on the list. | |
342 | 555 |
2152 | 556 bool pending_removal() { return _pending_removal; } |
557 | |
558 void set_pending_removal(bool pending_removal) { | |
2361 | 559 if (pending_removal) { |
560 assert(!_pending_removal && containing_set() != NULL, | |
561 "can only set pending removal to true if it's false and " | |
562 "the region belongs to a region set"); | |
563 } else { | |
564 assert( _pending_removal && containing_set() == NULL, | |
565 "can only set pending removal to false if it's true and " | |
566 "the region does not belong to a region set"); | |
567 } | |
2152 | 568 |
569 _pending_removal = pending_removal; | |
342 | 570 } |
571 | |
572 HeapRegion* get_next_young_region() { return _next_young_region; } | |
573 void set_next_young_region(HeapRegion* hr) { | |
574 _next_young_region = hr; | |
575 } | |
576 | |
796
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
577 HeapRegion* get_next_dirty_cards_region() const { return _next_dirty_cards_region; } |
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
578 HeapRegion** next_dirty_cards_region_addr() { return &_next_dirty_cards_region; } |
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
579 void set_next_dirty_cards_region(HeapRegion* hr) { _next_dirty_cards_region = hr; } |
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
580 bool is_on_dirty_cards_region_list() const { return get_next_dirty_cards_region() != NULL; } |
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
581 |
342 | 582 // Allows logical separation between objects allocated before and after. |
583 void save_marks(); | |
584 | |
585 // Reset HR stuff to default values. | |
586 void hr_clear(bool par, bool clear_space); | |
3317
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
587 void par_clear(); |
342 | 588 |
356 | 589 void initialize(MemRegion mr, bool clear_space, bool mangle_space); |
342 | 590 |
591 // Get the start of the unmarked area in this region. | |
592 HeapWord* prev_top_at_mark_start() const { return _prev_top_at_mark_start; } | |
593 HeapWord* next_top_at_mark_start() const { return _next_top_at_mark_start; } | |
594 | |
595 // Apply "cl->do_oop" to (the addresses of) all reference fields in objects | |
596 // allocated in the current region before the last call to "save_mark". | |
597 void oop_before_save_marks_iterate(OopClosure* cl); | |
598 | |
599 // This call determines the "filter kind" argument that will be used for | |
600 // the next call to "new_dcto_cl" on this region with the "traditional" | |
601 // signature (i.e., the call below.) The default, in the absence of a | |
602 // preceding call to this method, is "NoFilterKind", and a call to this | |
603 // method is necessary for each such call, or else it reverts to the | |
604 // default. | |
605 // (This is really ugly, but all other methods I could think of changed a | |
606 // lot of main-line code for G1.) | |
607 void set_next_filter_kind(HeapRegionDCTOC::FilterKind nfk) { | |
608 _next_fk = nfk; | |
609 } | |
610 | |
611 DirtyCardToOopClosure* | |
612 new_dcto_closure(OopClosure* cl, | |
613 CardTableModRefBS::PrecisionStyle precision, | |
614 HeapRegionDCTOC::FilterKind fk); | |
615 | |
616 #if WHASSUP | |
617 DirtyCardToOopClosure* | |
618 new_dcto_closure(OopClosure* cl, | |
619 CardTableModRefBS::PrecisionStyle precision, | |
620 HeapWord* boundary) { | |
621 assert(boundary == NULL, "This arg doesn't make sense here."); | |
622 DirtyCardToOopClosure* res = new_dcto_closure(cl, precision, _next_fk); | |
623 _next_fk = HeapRegionDCTOC::NoFilterKind; | |
624 return res; | |
625 } | |
626 #endif | |
627 | |
628 // | |
629 // Note the start or end of marking. This tells the heap region | |
630 // that the collector is about to start or has finished (concurrently) | |
631 // marking the heap. | |
632 // | |
633 | |
634 // Note the start of a marking phase. Record the | |
635 // start of the unmarked area of the region here. | |
636 void note_start_of_marking(bool during_initial_mark) { | |
637 init_top_at_conc_mark_count(); | |
638 _next_marked_bytes = 0; | |
639 if (during_initial_mark && is_young() && !is_survivor()) | |
640 _next_top_at_mark_start = bottom(); | |
641 else | |
642 _next_top_at_mark_start = top(); | |
643 } | |
644 | |
645 // Note the end of a marking phase. Install the start of | |
646 // the unmarked area that was captured at start of marking. | |
647 void note_end_of_marking() { | |
648 _prev_top_at_mark_start = _next_top_at_mark_start; | |
649 _prev_marked_bytes = _next_marked_bytes; | |
650 _next_marked_bytes = 0; | |
651 | |
652 guarantee(_prev_marked_bytes <= | |
653 (size_t) (prev_top_at_mark_start() - bottom()) * HeapWordSize, | |
654 "invariant"); | |
655 } | |
656 | |
657 // After an evacuation, we need to update _next_top_at_mark_start | |
658 // to be the current top. Note this is only valid if we have only | |
659 // ever evacuated into this region. If we evacuate, allocate, and | |
660 // then evacuate we are in deep doodoo. | |
661 void note_end_of_copying() { | |
1021
1f19207eefc2
6847956: G1: crash in oopDesc*G1ParCopyHelper::copy_to_survivor_space(oopDesc*)
tonyp
parents:
1020
diff
changeset
|
662 assert(top() >= _next_top_at_mark_start, "Increase only"); |
1f19207eefc2
6847956: G1: crash in oopDesc*G1ParCopyHelper::copy_to_survivor_space(oopDesc*)
tonyp
parents:
1020
diff
changeset
|
663 _next_top_at_mark_start = top(); |
342 | 664 } |
665 | |
666 // Returns "false" iff no object in the region was allocated when the | |
667 // last mark phase ended. | |
668 bool is_marked() { return _prev_top_at_mark_start != bottom(); } | |
669 | |
670 // If "is_marked()" is true, then this is the index of the region in | |
671 // an array constructed at the end of marking of the regions in a | |
672 // "desirability" order. | |
673 int sort_index() { | |
674 return _sort_index; | |
675 } | |
676 void set_sort_index(int i) { | |
677 _sort_index = i; | |
678 } | |
679 | |
680 void init_top_at_conc_mark_count() { | |
681 _top_at_conc_mark_count = bottom(); | |
682 } | |
683 | |
684 void set_top_at_conc_mark_count(HeapWord *cur) { | |
685 assert(bottom() <= cur && cur <= end(), "Sanity."); | |
686 _top_at_conc_mark_count = cur; | |
687 } | |
688 | |
689 HeapWord* top_at_conc_mark_count() { | |
690 return _top_at_conc_mark_count; | |
691 } | |
692 | |
693 void reset_during_compaction() { | |
694 guarantee( isHumongous() && startsHumongous(), | |
695 "should only be called for humongous regions"); | |
696 | |
697 zero_marked_bytes(); | |
698 init_top_at_mark_start(); | |
699 } | |
700 | |
701 // <PREDICTION> | |
702 void calc_gc_efficiency(void); | |
703 double gc_efficiency() { return _gc_efficiency;} | |
704 // </PREDICTION> | |
705 | |
706 bool is_young() const { return _young_type != NotYoung; } | |
707 bool is_survivor() const { return _young_type == Survivor; } | |
708 | |
709 int young_index_in_cset() const { return _young_index_in_cset; } | |
710 void set_young_index_in_cset(int index) { | |
711 assert( (index == -1) || is_young(), "pre-condition" ); | |
712 _young_index_in_cset = index; | |
713 } | |
714 | |
715 int age_in_surv_rate_group() { | |
716 assert( _surv_rate_group != NULL, "pre-condition" ); | |
717 assert( _age_index > -1, "pre-condition" ); | |
718 return _surv_rate_group->age_in_group(_age_index); | |
719 } | |
720 | |
721 void record_surv_words_in_group(size_t words_survived) { | |
722 assert( _surv_rate_group != NULL, "pre-condition" ); | |
723 assert( _age_index > -1, "pre-condition" ); | |
724 int age_in_group = age_in_surv_rate_group(); | |
725 _surv_rate_group->record_surviving_words(age_in_group, words_survived); | |
726 } | |
727 | |
728 int age_in_surv_rate_group_cond() { | |
729 if (_surv_rate_group != NULL) | |
730 return age_in_surv_rate_group(); | |
731 else | |
732 return -1; | |
733 } | |
734 | |
735 SurvRateGroup* surv_rate_group() { | |
736 return _surv_rate_group; | |
737 } | |
738 | |
739 void install_surv_rate_group(SurvRateGroup* surv_rate_group) { | |
740 assert( surv_rate_group != NULL, "pre-condition" ); | |
741 assert( _surv_rate_group == NULL, "pre-condition" ); | |
742 assert( is_young(), "pre-condition" ); | |
743 | |
744 _surv_rate_group = surv_rate_group; | |
745 _age_index = surv_rate_group->next_age_index(); | |
746 } | |
747 | |
748 void uninstall_surv_rate_group() { | |
749 if (_surv_rate_group != NULL) { | |
750 assert( _age_index > -1, "pre-condition" ); | |
751 assert( is_young(), "pre-condition" ); | |
752 | |
753 _surv_rate_group = NULL; | |
754 _age_index = -1; | |
755 } else { | |
756 assert( _age_index == -1, "pre-condition" ); | |
757 } | |
758 } | |
759 | |
760 void set_young() { set_young_type(Young); } | |
761 | |
762 void set_survivor() { set_young_type(Survivor); } | |
763 | |
764 void set_not_young() { set_young_type(NotYoung); } | |
765 | |
766 // Determine if an object has been allocated since the last | |
767 // mark performed by the collector. This returns true iff the object | |
768 // is within the unmarked area of the region. | |
769 bool obj_allocated_since_prev_marking(oop obj) const { | |
770 return (HeapWord *) obj >= prev_top_at_mark_start(); | |
771 } | |
772 bool obj_allocated_since_next_marking(oop obj) const { | |
773 return (HeapWord *) obj >= next_top_at_mark_start(); | |
774 } | |
775 | |
776 // For parallel heapRegion traversal. | |
777 bool claimHeapRegion(int claimValue); | |
778 jint claim_value() { return _claimed; } | |
779 // Use this carefully: only when you're sure no one is claiming... | |
780 void set_claim_value(int claimValue) { _claimed = claimValue; } | |
781 | |
782 // Returns the "evacuation_failed" property of the region. | |
783 bool evacuation_failed() { return _evacuation_failed; } | |
784 | |
785 // Sets the "evacuation_failed" property of the region. | |
786 void set_evacuation_failed(bool b) { | |
787 _evacuation_failed = b; | |
788 | |
789 if (b) { | |
790 init_top_at_conc_mark_count(); | |
791 _next_marked_bytes = 0; | |
792 } | |
793 } | |
794 | |
795 // Requires that "mr" be entirely within the region. | |
796 // Apply "cl->do_object" to all objects that intersect with "mr". | |
797 // If the iteration encounters an unparseable portion of the region, | |
798 // or if "cl->abort()" is true after a closure application, | |
799 // terminate the iteration and return the address of the start of the | |
800 // subregion that isn't done. (The two can be distinguished by querying | |
801 // "cl->abort()".) Return of "NULL" indicates that the iteration | |
802 // completed. | |
803 HeapWord* | |
804 object_iterate_mem_careful(MemRegion mr, ObjectClosure* cl); | |
805 | |
3317
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
806 // filter_young: if true and the region is a young region then we |
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
807 // skip the iteration. |
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
808 // card_ptr: if not NULL, and we decide that the card is not young |
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
809 // and we iterate over it, we'll clean the card before we start the |
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
810 // iteration. |
342 | 811 HeapWord* |
812 oops_on_card_seq_iterate_careful(MemRegion mr, | |
1666
5cbac8938c4c
6956639: G1: assert(cached_ptr != card_ptr) failed: shouldn't be, concurrentG1Refine.cpp:307
johnc
parents:
1552
diff
changeset
|
813 FilterOutOfRegionClosure* cl, |
3317
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
814 bool filter_young, |
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
815 jbyte* card_ptr); |
342 | 816 |
817 // A version of block start that is guaranteed to find *some* block | |
818 // boundary at or before "p", but does not object iteration, and may | |
819 // therefore be used safely when the heap is unparseable. | |
820 HeapWord* block_start_careful(const void* p) const { | |
821 return _offsets.block_start_careful(p); | |
822 } | |
823 | |
824 // Requires that "addr" is within the region. Returns the start of the | |
825 // first ("careful") block that starts at or after "addr", or else the | |
826 // "end" of the region if there is no such block. | |
827 HeapWord* next_block_start_careful(HeapWord* addr); | |
828 | |
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
829 size_t recorded_rs_length() const { return _recorded_rs_length; } |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
830 double predicted_elapsed_time_ms() const { return _predicted_elapsed_time_ms; } |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
831 size_t predicted_bytes_to_copy() const { return _predicted_bytes_to_copy; } |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
832 |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
833 void set_recorded_rs_length(size_t rs_length) { |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
834 _recorded_rs_length = rs_length; |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
835 } |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
836 |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
837 void set_predicted_elapsed_time_ms(double ms) { |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
838 _predicted_elapsed_time_ms = ms; |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
839 } |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
840 |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
841 void set_predicted_bytes_to_copy(size_t bytes) { |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
842 _predicted_bytes_to_copy = bytes; |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
843 } |
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
844 |
342 | 845 #define HeapRegion_OOP_SINCE_SAVE_MARKS_DECL(OopClosureType, nv_suffix) \ |
846 virtual void oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl); | |
847 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(HeapRegion_OOP_SINCE_SAVE_MARKS_DECL) | |
848 | |
849 CompactibleSpace* next_compaction_space() const; | |
850 | |
851 virtual void reset_after_compaction(); | |
852 | |
853 void print() const; | |
854 void print_on(outputStream* st) const; | |
855 | |
811 | 856 // use_prev_marking == true -> use "prev" marking information, |
857 // use_prev_marking == false -> use "next" marking information | |
858 // NOTE: Only the "prev" marking information is guaranteed to be | |
859 // consistent most of the time, so most calls to this should use | |
860 // use_prev_marking == true. Currently, there is only one case where | |
861 // this is called with use_prev_marking == false, which is to verify | |
862 // the "next" marking information at the end of remark. | |
1020
ff2402f6a50b
6882730: G1: parallel heap verification messes up region dump
tonyp
parents:
942
diff
changeset
|
863 void verify(bool allow_dirty, bool use_prev_marking, bool *failures) const; |
811 | 864 |
865 // Override; it uses the "prev" marking information | |
342 | 866 virtual void verify(bool allow_dirty) const; |
867 }; | |
868 | |
869 // HeapRegionClosure is used for iterating over regions. | |
870 // Terminates the iteration when the "doHeapRegion" method returns "true". | |
871 class HeapRegionClosure : public StackObj { | |
872 friend class HeapRegionSeq; | |
873 friend class G1CollectedHeap; | |
874 | |
875 bool _complete; | |
876 void incomplete() { _complete = false; } | |
877 | |
878 public: | |
879 HeapRegionClosure(): _complete(true) {} | |
880 | |
881 // Typically called on each region until it returns true. | |
882 virtual bool doHeapRegion(HeapRegion* r) = 0; | |
883 | |
884 // True after iteration if the closure was applied to all heap regions | |
885 // and returned "false" in all cases. | |
886 bool complete() { return _complete; } | |
887 }; | |
888 | |
889 #endif // SERIALGC | |
1972 | 890 |
891 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGION_HPP |