Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/g1/heapRegion.hpp @ 6027:8a2e5a6a19a4
7143490: G1: Remove HeapRegion::_top_at_conc_mark_count
Summary: Removed the HeapRegion::_top_at_conc_mark_count field. It is no longer needed as a result of the changes for 6888336 and 7127706. Refactored the closures that finalize and verify the liveness counting data so that common functionality was placed into a base class.
Reviewed-by: brutisso, tonyp
| author | johnc |
|---|---|
| date | Wed, 25 Apr 2012 10:23:12 -0700 |
| parents | f7a8920427a6 |
| children | a2f7274eb6ef |
| rev | line source |
|---|---|
| 342 | 1 /* |
|
4783
023652e49ac0
7121496: G1: do the per-region evacuation failure handling work in parallel
johnc
parents:
4097
diff
changeset
|
2 * Copyright (c) 2001, 2012, 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 | |
|
6010
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
55 #define HR_FORMAT "%u:(%s)["PTR_FORMAT","PTR_FORMAT","PTR_FORMAT"]" |
| 3766 | 56 #define HR_FORMAT_PARAMS(_hr_) \ |
| 57 (_hr_)->hrs_index(), \ | |
| 58 (_hr_)->is_survivor() ? "S" : (_hr_)->is_young() ? "E" : "-", \ | |
| 59 (_hr_)->bottom(), (_hr_)->top(), (_hr_)->end() | |
| 342 | 60 |
|
6010
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
61 // sentinel value for hrs_index |
|
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
62 #define G1_NULL_HRS_INDEX ((uint) -1) |
|
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
63 |
| 342 | 64 // A dirty card to oop closure for heap regions. It |
| 65 // knows how to get the G1 heap and how to use the bitmap | |
| 66 // in the concurrent marker used by G1 to filter remembered | |
| 67 // sets. | |
| 68 | |
| 69 class HeapRegionDCTOC : public ContiguousSpaceDCTOC { | |
| 70 public: | |
| 71 // Specification of possible DirtyCardToOopClosure filtering. | |
| 72 enum FilterKind { | |
| 73 NoFilterKind, | |
| 74 IntoCSFilterKind, | |
| 75 OutOfRegionFilterKind | |
| 76 }; | |
| 77 | |
| 78 protected: | |
| 79 HeapRegion* _hr; | |
| 80 FilterKind _fk; | |
| 81 G1CollectedHeap* _g1; | |
| 82 | |
| 83 void walk_mem_region_with_cl(MemRegion mr, | |
| 84 HeapWord* bottom, HeapWord* top, | |
| 85 OopClosure* cl); | |
| 86 | |
| 87 // We don't specialize this for FilteringClosure; filtering is handled by | |
| 88 // the "FilterKind" mechanism. But we provide this to avoid a compiler | |
| 89 // warning. | |
| 90 void walk_mem_region_with_cl(MemRegion mr, | |
| 91 HeapWord* bottom, HeapWord* top, | |
| 92 FilteringClosure* cl) { | |
| 93 HeapRegionDCTOC::walk_mem_region_with_cl(mr, bottom, top, | |
| 94 (OopClosure*)cl); | |
| 95 } | |
| 96 | |
| 97 // Get the actual top of the area on which the closure will | |
| 98 // operate, given where the top is assumed to be (the end of the | |
| 99 // memory region passed to do_MemRegion) and where the object | |
| 100 // at the top is assumed to start. For example, an object may | |
| 101 // start at the top but actually extend past the assumed top, | |
| 102 // in which case the top becomes the end of the object. | |
| 103 HeapWord* get_actual_top(HeapWord* top, HeapWord* top_obj) { | |
| 104 return ContiguousSpaceDCTOC::get_actual_top(top, top_obj); | |
| 105 } | |
| 106 | |
| 107 // Walk the given memory region from bottom to (actual) top | |
| 108 // looking for objects and applying the oop closure (_cl) to | |
| 109 // them. The base implementation of this treats the area as | |
| 110 // blocks, where a block may or may not be an object. Sub- | |
| 111 // classes should override this to provide more accurate | |
| 112 // or possibly more efficient walking. | |
| 113 void walk_mem_region(MemRegion mr, HeapWord* bottom, HeapWord* top) { | |
| 114 Filtering_DCTOC::walk_mem_region(mr, bottom, top); | |
| 115 } | |
| 116 | |
| 117 public: | |
| 118 HeapRegionDCTOC(G1CollectedHeap* g1, | |
| 119 HeapRegion* hr, OopClosure* cl, | |
| 120 CardTableModRefBS::PrecisionStyle precision, | |
| 121 FilterKind fk); | |
| 122 }; | |
| 123 | |
| 124 // The complicating factor is that BlockOffsetTable diverged | |
| 125 // significantly, and we need functionality that is only in the G1 version. | |
| 126 // So I copied that code, which led to an alternate G1 version of | |
| 127 // OffsetTableContigSpace. If the two versions of BlockOffsetTable could | |
| 128 // be reconciled, then G1OffsetTableContigSpace could go away. | |
| 129 | |
| 130 // The idea behind time stamps is the following. Doing a save_marks on | |
| 131 // all regions at every GC pause is time consuming (if I remember | |
| 132 // well, 10ms or so). So, we would like to do that only for regions | |
| 133 // that are GC alloc regions. To achieve this, we use time | |
| 134 // stamps. For every evacuation pause, G1CollectedHeap generates a | |
| 135 // unique time stamp (essentially a counter that gets | |
| 136 // incremented). Every time we want to call save_marks on a region, | |
| 137 // we set the saved_mark_word to top and also copy the current GC | |
| 138 // time stamp to the time stamp field of the space. Reading the | |
| 139 // saved_mark_word involves checking the time stamp of the | |
| 140 // region. If it is the same as the current GC time stamp, then we | |
| 141 // can safely read the saved_mark_word field, as it is valid. If the | |
| 142 // time stamp of the region is not the same as the current GC time | |
| 143 // stamp, then we instead read top, as the saved_mark_word field is | |
| 144 // invalid. Time stamps (on the regions and also on the | |
| 145 // G1CollectedHeap) are reset at every cleanup (we iterate over | |
| 146 // the regions anyway) and at the end of a Full GC. The current scheme | |
| 147 // that uses sequential unsigned ints will fail only if we have 4b | |
| 148 // evacuation pauses between two cleanups, which is _highly_ unlikely. | |
| 149 | |
| 150 class G1OffsetTableContigSpace: public ContiguousSpace { | |
| 151 friend class VMStructs; | |
| 152 protected: | |
| 153 G1BlockOffsetArrayContigSpace _offsets; | |
| 154 Mutex _par_alloc_lock; | |
| 155 volatile unsigned _gc_time_stamp; | |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
156 // 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
|
157 // 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
|
158 // 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
|
159 // 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
|
160 // 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
|
161 // 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
|
162 HeapWord* _pre_dummy_top; |
| 342 | 163 |
| 164 public: | |
| 165 // Constructor. If "is_zeroed" is true, the MemRegion "mr" may be | |
| 166 // assumed to contain zeros. | |
| 167 G1OffsetTableContigSpace(G1BlockOffsetSharedArray* sharedOffsetArray, | |
| 168 MemRegion mr, bool is_zeroed = false); | |
| 169 | |
| 170 void set_bottom(HeapWord* value); | |
| 171 void set_end(HeapWord* value); | |
| 172 | |
| 173 virtual HeapWord* saved_mark_word() const; | |
| 174 virtual void set_saved_mark(); | |
| 175 void reset_gc_time_stamp() { _gc_time_stamp = 0; } | |
| 176 | |
|
2433
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
177 // 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
|
178 // explanation of what it is. |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
179 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
|
180 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
|
181 _pre_dummy_top = pre_dummy_top; |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
182 } |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
183 HeapWord* pre_dummy_top() { |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
184 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
|
185 } |
|
abdfc822206f
7023069: G1: Introduce symmetric locking in the slow allocation path
tonyp
parents:
2361
diff
changeset
|
186 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
|
187 |
| 356 | 188 virtual void initialize(MemRegion mr, bool clear_space, bool mangle_space); |
| 189 virtual void clear(bool mangle_space); | |
| 342 | 190 |
| 191 HeapWord* block_start(const void* p); | |
| 192 HeapWord* block_start_const(const void* p) const; | |
| 193 | |
| 194 // Add offset table update. | |
| 195 virtual HeapWord* allocate(size_t word_size); | |
| 196 HeapWord* par_allocate(size_t word_size); | |
| 197 | |
| 198 // MarkSweep support phase3 | |
| 199 virtual HeapWord* initialize_threshold(); | |
| 200 virtual HeapWord* cross_threshold(HeapWord* start, HeapWord* end); | |
| 201 | |
| 202 virtual void print() const; | |
|
2133
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 void reset_bot() { |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
205 _offsets.zero_bottom_entry(); |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
206 _offsets.initialize_threshold(); |
|
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 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
|
210 _offsets.alloc_block(start, word_size); |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
211 } |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
212 |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
213 void print_bot_on(outputStream* out) { |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
214 _offsets.print_on(out); |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
215 } |
| 342 | 216 }; |
| 217 | |
| 218 class HeapRegion: public G1OffsetTableContigSpace { | |
| 219 friend class VMStructs; | |
| 220 private: | |
| 221 | |
| 355 | 222 enum HumongousType { |
| 223 NotHumongous = 0, | |
| 224 StartsHumongous, | |
| 225 ContinuesHumongous | |
| 226 }; | |
| 227 | |
| 342 | 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: | |
| 3766 | 240 // The index of this region in the heap region sequence. |
|
6010
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
241 uint _hrs_index; |
| 342 | 242 |
| 355 | 243 HumongousType _humongous_type; |
| 342 | 244 // For a humongous region, region in which it starts. |
| 245 HeapRegion* _humongous_start_region; | |
| 246 // For the start region of a humongous sequence, it's original end(). | |
| 247 HeapWord* _orig_end; | |
| 248 | |
| 249 // True iff the region is in current collection_set. | |
| 250 bool _in_collection_set; | |
| 251 | |
| 252 // True iff an attempt to evacuate an object in the region failed. | |
| 253 bool _evacuation_failed; | |
| 254 | |
| 255 // A heap region may be a member one of a number of special subsets, each | |
| 256 // represented as linked lists through the field below. Currently, these | |
| 257 // sets include: | |
| 258 // The collection set. | |
| 259 // The set of allocation regions used in a collection pause. | |
| 260 // Spaces that may contain gray objects. | |
| 261 HeapRegion* _next_in_special_set; | |
| 262 | |
| 263 // next region in the young "generation" region set | |
| 264 HeapRegion* _next_young_region; | |
| 265 | |
|
796
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
266 // Next region whose cards need cleaning |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
267 HeapRegion* _next_dirty_cards_region; |
|
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
268 |
| 2152 | 269 // Fields used by the HeapRegionSetBase class and subclasses. |
| 270 HeapRegion* _next; | |
| 271 #ifdef ASSERT | |
| 272 HeapRegionSetBase* _containing_set; | |
| 273 #endif // ASSERT | |
| 274 bool _pending_removal; | |
| 275 | |
| 342 | 276 // For parallel heapRegion traversal. |
| 277 jint _claimed; | |
| 278 | |
| 279 // We use concurrent marking to determine the amount of live data | |
| 280 // in each heap region. | |
| 281 size_t _prev_marked_bytes; // Bytes known to be live via last completed marking. | |
| 282 size_t _next_marked_bytes; // Bytes known to be live via in-progress marking. | |
| 283 | |
| 6011 | 284 // The calculated GC efficiency of the region. |
| 342 | 285 double _gc_efficiency; |
| 286 | |
| 287 enum YoungType { | |
| 288 NotYoung, // a region is not young | |
| 289 Young, // a region is young | |
| 3766 | 290 Survivor // a region is young and it contains survivors |
| 342 | 291 }; |
| 292 | |
|
1666
5cbac8938c4c
6956639: G1: assert(cached_ptr != card_ptr) failed: shouldn't be, concurrentG1Refine.cpp:307
johnc
parents:
1552
diff
changeset
|
293 volatile YoungType _young_type; |
| 342 | 294 int _young_index_in_cset; |
| 295 SurvRateGroup* _surv_rate_group; | |
| 296 int _age_index; | |
| 297 | |
| 298 // The start of the unmarked area. The unmarked area extends from this | |
| 299 // word until the top and/or end of the region, and is the part | |
| 300 // of the region for which no marking was done, i.e. objects may | |
| 301 // have been allocated in this part since the last mark phase. | |
| 302 // "prev" is the top at the start of the last completed marking. | |
| 303 // "next" is the top at the start of the in-progress marking (if any.) | |
| 304 HeapWord* _prev_top_at_mark_start; | |
| 305 HeapWord* _next_top_at_mark_start; | |
| 306 // If a collection pause is in progress, this is the top at the start | |
| 307 // of that pause. | |
| 308 | |
| 309 void init_top_at_mark_start() { | |
| 310 assert(_prev_marked_bytes == 0 && | |
| 311 _next_marked_bytes == 0, | |
| 312 "Must be called after zero_marked_bytes."); | |
| 313 HeapWord* bot = bottom(); | |
| 314 _prev_top_at_mark_start = bot; | |
| 315 _next_top_at_mark_start = bot; | |
| 316 } | |
| 317 | |
| 318 void set_young_type(YoungType new_type) { | |
| 319 //assert(_young_type != new_type, "setting the same type" ); | |
| 320 // TODO: add more assertions here | |
| 321 _young_type = new_type; | |
| 322 } | |
| 323 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
324 // 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
|
325 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
326 // 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
|
327 // for the collection set. |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
328 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
|
329 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
330 // 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
|
331 // for the collection set. |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
332 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
|
333 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
334 // 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
|
335 // 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
|
336 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
|
337 |
| 342 | 338 public: |
| 339 // If "is_zeroed" is "true", the region "mr" can be assumed to contain zeros. | |
|
6010
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
340 HeapRegion(uint hrs_index, |
| 3766 | 341 G1BlockOffsetSharedArray* sharedOffsetArray, |
| 342 | 342 MemRegion mr, bool is_zeroed); |
| 343 | |
|
3986
65a8ff39a6da
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
3980
diff
changeset
|
344 static int LogOfHRGrainBytes; |
|
65a8ff39a6da
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
3980
diff
changeset
|
345 static int LogOfHRGrainWords; |
|
65a8ff39a6da
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
3980
diff
changeset
|
346 |
|
65a8ff39a6da
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
3980
diff
changeset
|
347 static size_t GrainBytes; |
|
65a8ff39a6da
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
3980
diff
changeset
|
348 static size_t GrainWords; |
|
65a8ff39a6da
7095194: G1: HeapRegion::GrainBytes, GrainWords, and CardsPerRegion should be size_t
johnc
parents:
3980
diff
changeset
|
349 static size_t CardsPerRegion; |
|
942
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
350 |
|
3980
8229bd737950
7075646: G1: fix inconsistencies in the monitoring data
tonyp
parents:
3979
diff
changeset
|
351 static size_t align_up_to_region_byte_size(size_t sz) { |
|
8229bd737950
7075646: G1: fix inconsistencies in the monitoring data
tonyp
parents:
3979
diff
changeset
|
352 return (sz + (size_t) GrainBytes - 1) & |
|
8229bd737950
7075646: G1: fix inconsistencies in the monitoring data
tonyp
parents:
3979
diff
changeset
|
353 ~((1 << (size_t) LogOfHRGrainBytes) - 1); |
|
8229bd737950
7075646: G1: fix inconsistencies in the monitoring data
tonyp
parents:
3979
diff
changeset
|
354 } |
|
8229bd737950
7075646: G1: fix inconsistencies in the monitoring data
tonyp
parents:
3979
diff
changeset
|
355 |
|
942
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
356 // 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
|
357 // 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
|
358 // size (LogOfHRGrainBytes / LogOfHRGrainWords / |
|
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
359 // CardsPerRegion). All those fields are considered constant |
|
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
360 // 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
|
361 // up once during initialization time. |
|
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
811
diff
changeset
|
362 static void setup_heap_region_size(uintx min_heap_size); |
| 342 | 363 |
| 355 | 364 enum ClaimValues { |
|
4097
dc467e8b2c5e
7112743: G1: Reduce overhead of marking closure during evacuation pauses
johnc
parents:
4093
diff
changeset
|
365 InitialClaimValue = 0, |
|
dc467e8b2c5e
7112743: G1: Reduce overhead of marking closure during evacuation pauses
johnc
parents:
4093
diff
changeset
|
366 FinalCountClaimValue = 1, |
|
dc467e8b2c5e
7112743: G1: Reduce overhead of marking closure during evacuation pauses
johnc
parents:
4093
diff
changeset
|
367 NoteEndClaimValue = 2, |
|
dc467e8b2c5e
7112743: G1: Reduce overhead of marking closure during evacuation pauses
johnc
parents:
4093
diff
changeset
|
368 ScrubRemSetClaimValue = 3, |
|
dc467e8b2c5e
7112743: G1: Reduce overhead of marking closure during evacuation pauses
johnc
parents:
4093
diff
changeset
|
369 ParVerifyClaimValue = 4, |
|
dc467e8b2c5e
7112743: G1: Reduce overhead of marking closure during evacuation pauses
johnc
parents:
4093
diff
changeset
|
370 RebuildRSClaimValue = 5, |
|
5988
2a0172480595
7127697: G1: remove dead code after recent concurrent mark changes
tonyp
parents:
4912
diff
changeset
|
371 ParEvacFailureClaimValue = 6, |
|
2a0172480595
7127697: G1: remove dead code after recent concurrent mark changes
tonyp
parents:
4912
diff
changeset
|
372 AggregateCountClaimValue = 7, |
|
2a0172480595
7127697: G1: remove dead code after recent concurrent mark changes
tonyp
parents:
4912
diff
changeset
|
373 VerifyCountClaimValue = 8 |
| 355 | 374 }; |
| 375 | |
|
2134
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
376 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
|
377 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
|
378 return ContiguousSpace::par_allocate(word_size); |
|
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
379 } |
|
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
380 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
|
381 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
|
382 return ContiguousSpace::allocate(word_size); |
|
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
383 } |
|
b158bed62ef5
6994297: G1: do first-level slow-path allocations with a CAS
tonyp
parents:
2133
diff
changeset
|
384 |
| 342 | 385 // If this region is a member of a HeapRegionSeq, the index in that |
| 386 // sequence, otherwise -1. | |
|
6010
720b6a76dd9d
7157073: G1: type change size_t -> uint for region counts / indexes
tonyp
parents:
6008
diff
changeset
|
387 uint hrs_index() const { return _hrs_index; } |
| 342 | 388 |
| 389 // The number of bytes marked live in the region in the last marking phase. | |
| 390 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
|
391 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
|
392 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
|
393 } |
|
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
394 |
| 342 | 395 // The number of bytes counted in the next marking. |
| 396 size_t next_marked_bytes() { return _next_marked_bytes; } | |
| 397 // The number of bytes live wrt the next marking. | |
| 398 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
|
399 return |
|
371bbc844bf1
7027766: G1: introduce flag to dump the liveness information per region at the end of marking
tonyp
parents:
2433
diff
changeset
|
400 (top() - next_top_at_mark_start()) * HeapWordSize + next_marked_bytes(); |
| 342 | 401 } |
| 402 | |
| 403 // A lower bound on the amount of garbage bytes in the region. | |
| 404 size_t garbage_bytes() { | |
| 405 size_t used_at_mark_start_bytes = | |
| 406 (prev_top_at_mark_start() - bottom()) * HeapWordSize; | |
| 407 assert(used_at_mark_start_bytes >= marked_bytes(), | |
| 408 "Can't mark more than we have."); | |
| 409 return used_at_mark_start_bytes - marked_bytes(); | |
| 410 } | |
| 411 | |
|
4912
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
412 // Return the amount of bytes we'll reclaim if we collect this |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
413 // region. This includes not only the known garbage bytes in the |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
414 // region but also any unallocated space in it, i.e., [top, end), |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
415 // since it will also be reclaimed if we collect the region. |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
416 size_t reclaimable_bytes() { |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
417 size_t known_live_bytes = live_bytes(); |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
418 assert(known_live_bytes <= capacity(), "sanity"); |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
419 return capacity() - known_live_bytes; |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
420 } |
|
a9647476d1a4
7132029: G1: mixed GC phase lasts for longer than it should
tonyp
parents:
4836
diff
changeset
|
421 |
| 342 | 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; | |
|
4093
6071e0581859
7111795: G1: Various cleanups identified during walk through of changes for 6484965
johnc
parents:
4023
diff
changeset
|
427 assert(_next_marked_bytes <= used(), "invariant" ); |
| 342 | 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 | |
|
4020
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
442 // Same as Space::is_in_reserved, but will use the original size of the region. |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
443 // The original size is different only for start humongous regions. They get |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
444 // their _end set up to be the end of the last continues region of the |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
445 // corresponding humongous object. |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
446 bool is_in_reserved_raw(const void* p) const { |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
447 return _bottom <= p && p < _orig_end; |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
448 } |
|
5e5d4821bf07
7097516: G1: assert(0<= from_card && from_card<HeapRegion::CardsPerRegion) failed: Must be in range.
brutisso
parents:
3986
diff
changeset
|
449 |
|
2133
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
450 // 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
|
451 // 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
|
452 // 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
|
453 // are as follows: |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
454 // |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
455 // 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
|
456 // 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
|
457 // 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
|
458 // 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
|
459 // region in the series. |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
460 // |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
461 // 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
|
462 // 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
|
463 // 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
|
464 // as the original end of this region. |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
465 // |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
466 // 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
|
467 // 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
|
468 // 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
|
469 // 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
|
470 // 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
|
471 // "starts humongous" regions and by ignoring the "continues |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
472 // humongous" regions. |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
473 void set_startsHumongous(HeapWord* new_top, HeapWord* new_end); |
| 342 | 474 |
|
2133
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
475 // Makes the current region be a "continues humongous' |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
476 // 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
|
477 // which this region will be part of. |
|
2250ee17e258
7007068: G1: refine the BOT during evac failure handling
tonyp
parents:
1972
diff
changeset
|
478 void set_continuesHumongous(HeapRegion* first_hr); |
| 342 | 479 |
| 2152 | 480 // Unsets the humongous-related fields on the region. |
| 481 void set_notHumongous(); | |
| 482 | |
| 342 | 483 // If the region has a remembered set, return a pointer to it. |
| 484 HeapRegionRemSet* rem_set() const { | |
| 485 return _rem_set; | |
| 486 } | |
| 487 | |
| 488 // True iff the region is in current collection_set. | |
| 489 bool in_collection_set() const { | |
| 490 return _in_collection_set; | |
| 491 } | |
| 492 void set_in_collection_set(bool b) { | |
| 493 _in_collection_set = b; | |
| 494 } | |
| 495 HeapRegion* next_in_collection_set() { | |
| 496 assert(in_collection_set(), "should only invoke on member of CS."); | |
| 497 assert(_next_in_special_set == NULL || | |
| 498 _next_in_special_set->in_collection_set(), | |
| 499 "Malformed CS."); | |
| 500 return _next_in_special_set; | |
| 501 } | |
| 502 void set_next_in_collection_set(HeapRegion* r) { | |
| 503 assert(in_collection_set(), "should only invoke on member of CS."); | |
| 504 assert(r == NULL || r->in_collection_set(), "Malformed CS."); | |
| 505 _next_in_special_set = r; | |
| 506 } | |
| 507 | |
| 2152 | 508 // Methods used by the HeapRegionSetBase class and subclasses. |
| 342 | 509 |
| 2152 | 510 // Getter and setter for the next field used to link regions into |
| 511 // linked lists. | |
| 512 HeapRegion* next() { return _next; } | |
| 513 | |
| 514 void set_next(HeapRegion* next) { _next = next; } | |
| 342 | 515 |
| 2152 | 516 // Every region added to a set is tagged with a reference to that |
| 517 // set. This is used for doing consistency checking to make sure that | |
| 518 // the contents of a set are as they should be and it's only | |
| 519 // available in non-product builds. | |
| 520 #ifdef ASSERT | |
| 521 void set_containing_set(HeapRegionSetBase* containing_set) { | |
| 522 assert((containing_set == NULL && _containing_set != NULL) || | |
| 523 (containing_set != NULL && _containing_set == NULL), | |
| 524 err_msg("containing_set: "PTR_FORMAT" " | |
| 525 "_containing_set: "PTR_FORMAT, | |
| 526 containing_set, _containing_set)); | |
| 527 | |
| 528 _containing_set = containing_set; | |
| 2361 | 529 } |
| 342 | 530 |
| 2152 | 531 HeapRegionSetBase* containing_set() { return _containing_set; } |
| 532 #else // ASSERT | |
| 533 void set_containing_set(HeapRegionSetBase* containing_set) { } | |
| 342 | 534 |
| 2361 | 535 // containing_set() is only used in asserts so there's no reason |
| 2152 | 536 // to provide a dummy version of it. |
| 537 #endif // ASSERT | |
| 342 | 538 |
| 2152 | 539 // If we want to remove regions from a list in bulk we can simply tag |
| 540 // them with the pending_removal tag and call the | |
| 541 // remove_all_pending() method on the list. | |
| 342 | 542 |
| 2152 | 543 bool pending_removal() { return _pending_removal; } |
| 544 | |
| 545 void set_pending_removal(bool pending_removal) { | |
| 2361 | 546 if (pending_removal) { |
| 547 assert(!_pending_removal && containing_set() != NULL, | |
| 548 "can only set pending removal to true if it's false and " | |
| 549 "the region belongs to a region set"); | |
| 550 } else { | |
| 551 assert( _pending_removal && containing_set() == NULL, | |
| 552 "can only set pending removal to false if it's true and " | |
| 553 "the region does not belong to a region set"); | |
| 554 } | |
| 2152 | 555 |
| 556 _pending_removal = pending_removal; | |
| 342 | 557 } |
| 558 | |
| 559 HeapRegion* get_next_young_region() { return _next_young_region; } | |
| 560 void set_next_young_region(HeapRegion* hr) { | |
| 561 _next_young_region = hr; | |
| 562 } | |
| 563 | |
|
796
29e7d79232b9
6819065: G1: eliminate high serial card table clearing time
apetrusenko
parents:
677
diff
changeset
|
564 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
|
565 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
|
566 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
|
567 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
|
568 |
| 3766 | 569 HeapWord* orig_end() { return _orig_end; } |
| 570 | |
| 342 | 571 // Allows logical separation between objects allocated before and after. |
| 572 void save_marks(); | |
| 573 | |
| 574 // Reset HR stuff to default values. | |
| 575 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
|
576 void par_clear(); |
| 342 | 577 |
| 356 | 578 void initialize(MemRegion mr, bool clear_space, bool mangle_space); |
| 342 | 579 |
| 580 // Get the start of the unmarked area in this region. | |
| 581 HeapWord* prev_top_at_mark_start() const { return _prev_top_at_mark_start; } | |
| 582 HeapWord* next_top_at_mark_start() const { return _next_top_at_mark_start; } | |
| 583 | |
| 584 // Apply "cl->do_oop" to (the addresses of) all reference fields in objects | |
| 585 // allocated in the current region before the last call to "save_mark". | |
| 586 void oop_before_save_marks_iterate(OopClosure* cl); | |
| 587 | |
| 588 // Note the start or end of marking. This tells the heap region | |
| 589 // that the collector is about to start or has finished (concurrently) | |
| 590 // marking the heap. | |
| 591 | |
|
4787
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
592 // Notify the region that concurrent marking is starting. Initialize |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
593 // all fields related to the next marking info. |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
594 inline void note_start_of_marking(); |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
595 |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
596 // Notify the region that concurrent marking has finished. Copy the |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
597 // (now finalized) next marking info fields into the prev marking |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
598 // info fields. |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
599 inline void note_end_of_marking(); |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
600 |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
601 // Notify the region that it will be used as to-space during a GC |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
602 // and we are about to start copying objects into it. |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
603 inline void note_start_of_copying(bool during_initial_mark); |
| 342 | 604 |
|
4787
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
605 // Notify the region that it ceases being to-space during a GC and |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
606 // we will not copy objects into it any more. |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
607 inline void note_end_of_copying(bool during_initial_mark); |
| 342 | 608 |
|
4787
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
609 // Notify the region that we are about to start processing |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
610 // self-forwarded objects during evac failure handling. |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
611 void note_self_forwarding_removal_start(bool during_initial_mark, |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
612 bool during_conc_mark); |
| 342 | 613 |
|
4787
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
614 // Notify the region that we have finished processing self-forwarded |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
615 // objects during evac failure handling. |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
616 void note_self_forwarding_removal_end(bool during_initial_mark, |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
617 bool during_conc_mark, |
|
2ace1c4ee8da
6888336: G1: avoid explicitly marking and pushing objects in survivor spaces
tonyp
parents:
4783
diff
changeset
|
618 size_t marked_bytes); |
| 342 | 619 |
| 620 // Returns "false" iff no object in the region was allocated when the | |
| 621 // last mark phase ended. | |
| 622 bool is_marked() { return _prev_top_at_mark_start != bottom(); } | |
| 623 | |
| 624 void reset_during_compaction() { | |
| 625 guarantee( isHumongous() && startsHumongous(), | |
| 626 "should only be called for humongous regions"); | |
| 627 | |
| 628 zero_marked_bytes(); | |
| 629 init_top_at_mark_start(); | |
| 630 } | |
| 631 | |
| 632 void calc_gc_efficiency(void); | |
| 633 double gc_efficiency() { return _gc_efficiency;} | |
| 634 | |
| 635 bool is_young() const { return _young_type != NotYoung; } | |
| 636 bool is_survivor() const { return _young_type == Survivor; } | |
| 637 | |
| 638 int young_index_in_cset() const { return _young_index_in_cset; } | |
| 639 void set_young_index_in_cset(int index) { | |
| 640 assert( (index == -1) || is_young(), "pre-condition" ); | |
| 641 _young_index_in_cset = index; | |
| 642 } | |
| 643 | |
| 644 int age_in_surv_rate_group() { | |
| 645 assert( _surv_rate_group != NULL, "pre-condition" ); | |
| 646 assert( _age_index > -1, "pre-condition" ); | |
| 647 return _surv_rate_group->age_in_group(_age_index); | |
| 648 } | |
| 649 | |
| 650 void record_surv_words_in_group(size_t words_survived) { | |
| 651 assert( _surv_rate_group != NULL, "pre-condition" ); | |
| 652 assert( _age_index > -1, "pre-condition" ); | |
| 653 int age_in_group = age_in_surv_rate_group(); | |
| 654 _surv_rate_group->record_surviving_words(age_in_group, words_survived); | |
| 655 } | |
| 656 | |
| 657 int age_in_surv_rate_group_cond() { | |
| 658 if (_surv_rate_group != NULL) | |
| 659 return age_in_surv_rate_group(); | |
| 660 else | |
| 661 return -1; | |
| 662 } | |
| 663 | |
| 664 SurvRateGroup* surv_rate_group() { | |
| 665 return _surv_rate_group; | |
| 666 } | |
| 667 | |
| 668 void install_surv_rate_group(SurvRateGroup* surv_rate_group) { | |
| 669 assert( surv_rate_group != NULL, "pre-condition" ); | |
| 670 assert( _surv_rate_group == NULL, "pre-condition" ); | |
| 671 assert( is_young(), "pre-condition" ); | |
| 672 | |
| 673 _surv_rate_group = surv_rate_group; | |
| 674 _age_index = surv_rate_group->next_age_index(); | |
| 675 } | |
| 676 | |
| 677 void uninstall_surv_rate_group() { | |
| 678 if (_surv_rate_group != NULL) { | |
| 679 assert( _age_index > -1, "pre-condition" ); | |
| 680 assert( is_young(), "pre-condition" ); | |
| 681 | |
| 682 _surv_rate_group = NULL; | |
| 683 _age_index = -1; | |
| 684 } else { | |
| 685 assert( _age_index == -1, "pre-condition" ); | |
| 686 } | |
| 687 } | |
| 688 | |
| 689 void set_young() { set_young_type(Young); } | |
| 690 | |
| 691 void set_survivor() { set_young_type(Survivor); } | |
| 692 | |
| 693 void set_not_young() { set_young_type(NotYoung); } | |
| 694 | |
| 695 // Determine if an object has been allocated since the last | |
| 696 // mark performed by the collector. This returns true iff the object | |
| 697 // is within the unmarked area of the region. | |
| 698 bool obj_allocated_since_prev_marking(oop obj) const { | |
| 699 return (HeapWord *) obj >= prev_top_at_mark_start(); | |
| 700 } | |
| 701 bool obj_allocated_since_next_marking(oop obj) const { | |
| 702 return (HeapWord *) obj >= next_top_at_mark_start(); | |
| 703 } | |
| 704 | |
| 705 // For parallel heapRegion traversal. | |
| 706 bool claimHeapRegion(int claimValue); | |
| 707 jint claim_value() { return _claimed; } | |
| 708 // Use this carefully: only when you're sure no one is claiming... | |
| 709 void set_claim_value(int claimValue) { _claimed = claimValue; } | |
| 710 | |
| 711 // Returns the "evacuation_failed" property of the region. | |
| 712 bool evacuation_failed() { return _evacuation_failed; } | |
| 713 | |
| 714 // Sets the "evacuation_failed" property of the region. | |
| 715 void set_evacuation_failed(bool b) { | |
| 716 _evacuation_failed = b; | |
| 717 | |
| 718 if (b) { | |
| 719 _next_marked_bytes = 0; | |
| 720 } | |
| 721 } | |
| 722 | |
| 723 // Requires that "mr" be entirely within the region. | |
| 724 // Apply "cl->do_object" to all objects that intersect with "mr". | |
| 725 // If the iteration encounters an unparseable portion of the region, | |
| 726 // or if "cl->abort()" is true after a closure application, | |
| 727 // terminate the iteration and return the address of the start of the | |
| 728 // subregion that isn't done. (The two can be distinguished by querying | |
| 729 // "cl->abort()".) Return of "NULL" indicates that the iteration | |
| 730 // completed. | |
| 731 HeapWord* | |
| 732 object_iterate_mem_careful(MemRegion mr, ObjectClosure* cl); | |
| 733 | |
|
3317
063382f9b575
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
2435
diff
changeset
|
734 // 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
|
735 // 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
|
736 // 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
|
737 // 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
|
738 // iteration. |
| 342 | 739 HeapWord* |
| 740 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
|
741 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
|
742 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
|
743 jbyte* card_ptr); |
| 342 | 744 |
| 745 // A version of block start that is guaranteed to find *some* block | |
| 746 // boundary at or before "p", but does not object iteration, and may | |
| 747 // therefore be used safely when the heap is unparseable. | |
| 748 HeapWord* block_start_careful(const void* p) const { | |
| 749 return _offsets.block_start_careful(p); | |
| 750 } | |
| 751 | |
| 752 // Requires that "addr" is within the region. Returns the start of the | |
| 753 // first ("careful") block that starts at or after "addr", or else the | |
| 754 // "end" of the region if there is no such block. | |
| 755 HeapWord* next_block_start_careful(HeapWord* addr); | |
| 756 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
757 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
|
758 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
|
759 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
|
760 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
761 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
|
762 _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
|
763 } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
764 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
765 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
|
766 _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
|
767 } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
768 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
769 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
|
770 _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
|
771 } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1021
diff
changeset
|
772 |
| 342 | 773 #define HeapRegion_OOP_SINCE_SAVE_MARKS_DECL(OopClosureType, nv_suffix) \ |
| 774 virtual void oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl); | |
| 775 SPECIALIZED_SINCE_SAVE_MARKS_CLOSURES(HeapRegion_OOP_SINCE_SAVE_MARKS_DECL) | |
| 776 | |
| 777 CompactibleSpace* next_compaction_space() const; | |
| 778 | |
| 779 virtual void reset_after_compaction(); | |
| 780 | |
| 781 void print() const; | |
| 782 void print_on(outputStream* st) const; | |
| 783 | |
|
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
784 // vo == UsePrevMarking -> use "prev" marking information, |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
785 // vo == UseNextMarking -> use "next" marking information |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
786 // vo == UseMarkWord -> use the mark word in the object header |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
787 // |
| 811 | 788 // NOTE: Only the "prev" marking information is guaranteed to be |
| 789 // consistent most of the time, so most calls to this should use | |
|
3772
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
790 // vo == UsePrevMarking. |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
791 // Currently, there is only one case where this is called with |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
792 // vo == UseNextMarking, which is to verify the "next" marking |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
793 // information at the end of remark. |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
794 // Currently there is only one place where this is called with |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
795 // vo == UseMarkWord, which is to verify the marking during a |
|
6747fd0512e0
7004681: G1: Extend marking verification to Full GCs
johnc
parents:
3766
diff
changeset
|
796 // full GC. |
| 6008 | 797 void verify(VerifyOption vo, bool *failures) const; |
| 811 | 798 |
| 799 // Override; it uses the "prev" marking information | |
| 6008 | 800 virtual void verify() const; |
| 342 | 801 }; |
| 802 | |
| 803 // HeapRegionClosure is used for iterating over regions. | |
| 804 // Terminates the iteration when the "doHeapRegion" method returns "true". | |
| 805 class HeapRegionClosure : public StackObj { | |
| 806 friend class HeapRegionSeq; | |
| 807 friend class G1CollectedHeap; | |
| 808 | |
| 809 bool _complete; | |
| 810 void incomplete() { _complete = false; } | |
| 811 | |
| 812 public: | |
| 813 HeapRegionClosure(): _complete(true) {} | |
| 814 | |
| 815 // Typically called on each region until it returns true. | |
| 816 virtual bool doHeapRegion(HeapRegion* r) = 0; | |
| 817 | |
| 818 // True after iteration if the closure was applied to all heap regions | |
| 819 // and returned "false" in all cases. | |
| 820 bool complete() { return _complete; } | |
| 821 }; | |
| 822 | |
| 823 #endif // SERIALGC | |
| 1972 | 824 |
| 825 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGION_HPP |