Mercurial > hg > graal-compiler
annotate src/share/vm/gc_implementation/parallelScavenge/psParallelCompact.hpp @ 375:81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
Reviewed-by: iveresov, tonyp
| author | jcoomes |
|---|---|
| date | Tue, 30 Sep 2008 12:20:22 -0700 |
| parents | 850fdf70db2b |
| children | 0166ac265d53 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 2005-2008 Sun Microsystems, Inc. All Rights Reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
| 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 class ParallelScavengeHeap; | |
| 26 class PSAdaptiveSizePolicy; | |
| 27 class PSYoungGen; | |
| 28 class PSOldGen; | |
| 29 class PSPermGen; | |
| 30 class ParCompactionManager; | |
| 31 class ParallelTaskTerminator; | |
| 32 class PSParallelCompact; | |
| 33 class GCTaskManager; | |
| 34 class GCTaskQueue; | |
| 35 class PreGCValues; | |
| 36 class MoveAndUpdateClosure; | |
| 37 class RefProcTaskExecutor; | |
| 38 | |
| 39 class SpaceInfo | |
| 40 { | |
| 41 public: | |
| 42 MutableSpace* space() const { return _space; } | |
| 43 | |
| 44 // Where the free space will start after the collection. Valid only after the | |
| 45 // summary phase completes. | |
| 46 HeapWord* new_top() const { return _new_top; } | |
| 47 | |
| 48 // Allows new_top to be set. | |
| 49 HeapWord** new_top_addr() { return &_new_top; } | |
| 50 | |
| 51 // Where the smallest allowable dense prefix ends (used only for perm gen). | |
| 52 HeapWord* min_dense_prefix() const { return _min_dense_prefix; } | |
| 53 | |
| 54 // Where the dense prefix ends, or the compacted region begins. | |
| 55 HeapWord* dense_prefix() const { return _dense_prefix; } | |
| 56 | |
| 57 // The start array for the (generation containing the) space, or NULL if there | |
| 58 // is no start array. | |
| 59 ObjectStartArray* start_array() const { return _start_array; } | |
| 60 | |
| 61 void set_space(MutableSpace* s) { _space = s; } | |
| 62 void set_new_top(HeapWord* addr) { _new_top = addr; } | |
| 63 void set_min_dense_prefix(HeapWord* addr) { _min_dense_prefix = addr; } | |
| 64 void set_dense_prefix(HeapWord* addr) { _dense_prefix = addr; } | |
| 65 void set_start_array(ObjectStartArray* s) { _start_array = s; } | |
| 66 | |
| 67 private: | |
| 68 MutableSpace* _space; | |
| 69 HeapWord* _new_top; | |
| 70 HeapWord* _min_dense_prefix; | |
| 71 HeapWord* _dense_prefix; | |
| 72 ObjectStartArray* _start_array; | |
| 73 }; | |
| 74 | |
| 75 class ParallelCompactData | |
| 76 { | |
| 77 public: | |
| 78 // Sizes are in HeapWords, unless indicated otherwise. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
79 static const size_t Log2RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
80 static const size_t RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
81 static const size_t RegionSizeBytes; |
| 0 | 82 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
83 // Mask for the bits in a size_t to get an offset within a region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
84 static const size_t RegionSizeOffsetMask; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
85 // Mask for the bits in a pointer to get an offset within a region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
86 static const size_t RegionAddrOffsetMask; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
87 // Mask for the bits in a pointer to get the address of the start of a region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
88 static const size_t RegionAddrMask; |
| 0 | 89 |
| 90 static const size_t Log2BlockSize; | |
| 91 static const size_t BlockSize; | |
| 92 static const size_t BlockOffsetMask; | |
| 93 static const size_t BlockMask; | |
| 94 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
95 static const size_t BlocksPerRegion; |
| 0 | 96 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
97 class RegionData |
| 0 | 98 { |
| 99 public: | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
100 // Destination address of the region. |
| 0 | 101 HeapWord* destination() const { return _destination; } |
| 102 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
103 // The first region containing data destined for this region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
104 size_t source_region() const { return _source_region; } |
| 0 | 105 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
106 // The object (if any) starting in this region and ending in a different |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
107 // region that could not be updated during the main (parallel) compaction |
| 0 | 108 // phase. This is different from _partial_obj_addr, which is an object that |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
109 // extends onto a source region. However, the two uses do not overlap in |
| 0 | 110 // time, so the same field is used to save space. |
| 111 HeapWord* deferred_obj_addr() const { return _partial_obj_addr; } | |
| 112 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
113 // The starting address of the partial object extending onto the region. |
| 0 | 114 HeapWord* partial_obj_addr() const { return _partial_obj_addr; } |
| 115 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
116 // Size of the partial object extending onto the region (words). |
| 0 | 117 size_t partial_obj_size() const { return _partial_obj_size; } |
| 118 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
119 // Size of live data that lies within this region due to objects that start |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
120 // in this region (words). This does not include the partial object |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
121 // extending onto the region (if any), or the part of an object that extends |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
122 // onto the next region (if any). |
| 0 | 123 size_t live_obj_size() const { return _dc_and_los & los_mask; } |
| 124 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
125 // Total live data that lies within the region (words). |
| 0 | 126 size_t data_size() const { return partial_obj_size() + live_obj_size(); } |
| 127 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
128 // The destination_count is the number of other regions to which data from |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
129 // this region will be copied. At the end of the summary phase, the valid |
| 0 | 130 // values of destination_count are |
| 131 // | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
132 // 0 - data from the region will be compacted completely into itself, or the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
133 // region is empty. The region can be claimed and then filled. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
134 // 1 - data from the region will be compacted into 1 other region; some |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
135 // data from the region may also be compacted into the region itself. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
136 // 2 - data from the region will be copied to 2 other regions. |
| 0 | 137 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
138 // During compaction as regions are emptied, the destination_count is |
| 0 | 139 // decremented (atomically) and when it reaches 0, it can be claimed and |
| 140 // then filled. | |
| 141 // | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
142 // A region is claimed for processing by atomically changing the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
143 // destination_count to the claimed value (dc_claimed). After a region has |
| 0 | 144 // been filled, the destination_count should be set to the completed value |
| 145 // (dc_completed). | |
| 146 inline uint destination_count() const; | |
| 147 inline uint destination_count_raw() const; | |
| 148 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
149 // The location of the java heap data that corresponds to this region. |
| 0 | 150 inline HeapWord* data_location() const; |
| 151 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
152 // The highest address referenced by objects in this region. |
| 0 | 153 inline HeapWord* highest_ref() const; |
| 154 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
155 // Whether this region is available to be claimed, has been claimed, or has |
| 0 | 156 // been completed. |
| 157 // | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
158 // Minor subtlety: claimed() returns true if the region is marked |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
159 // completed(), which is desirable since a region must be claimed before it |
| 0 | 160 // can be completed. |
| 161 bool available() const { return _dc_and_los < dc_one; } | |
| 162 bool claimed() const { return _dc_and_los >= dc_claimed; } | |
| 163 bool completed() const { return _dc_and_los >= dc_completed; } | |
| 164 | |
| 165 // These are not atomic. | |
| 166 void set_destination(HeapWord* addr) { _destination = addr; } | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
167 void set_source_region(size_t region) { _source_region = region; } |
| 0 | 168 void set_deferred_obj_addr(HeapWord* addr) { _partial_obj_addr = addr; } |
| 169 void set_partial_obj_addr(HeapWord* addr) { _partial_obj_addr = addr; } | |
| 170 void set_partial_obj_size(size_t words) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
171 _partial_obj_size = (region_sz_t) words; |
| 0 | 172 } |
| 173 | |
| 174 inline void set_destination_count(uint count); | |
| 175 inline void set_live_obj_size(size_t words); | |
| 176 inline void set_data_location(HeapWord* addr); | |
| 177 inline void set_completed(); | |
| 178 inline bool claim_unsafe(); | |
| 179 | |
| 180 // These are atomic. | |
| 181 inline void add_live_obj(size_t words); | |
| 182 inline void set_highest_ref(HeapWord* addr); | |
| 183 inline void decrement_destination_count(); | |
| 184 inline bool claim(); | |
| 185 | |
| 186 private: | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
187 // The type used to represent object sizes within a region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
188 typedef uint region_sz_t; |
| 0 | 189 |
| 190 // Constants for manipulating the _dc_and_los field, which holds both the | |
| 191 // destination count and live obj size. The live obj size lives at the | |
| 192 // least significant end so no masking is necessary when adding. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
193 static const region_sz_t dc_shift; // Shift amount. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
194 static const region_sz_t dc_mask; // Mask for destination count. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
195 static const region_sz_t dc_one; // 1, shifted appropriately. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
196 static const region_sz_t dc_claimed; // Region has been claimed. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
197 static const region_sz_t dc_completed; // Region has been completed. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
198 static const region_sz_t los_mask; // Mask for live obj size. |
| 0 | 199 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
200 HeapWord* _destination; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
201 size_t _source_region; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
202 HeapWord* _partial_obj_addr; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
203 region_sz_t _partial_obj_size; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
204 region_sz_t volatile _dc_and_los; |
| 0 | 205 #ifdef ASSERT |
| 206 // These enable optimizations that are only partially implemented. Use | |
| 207 // debug builds to prevent the code fragments from breaking. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
208 HeapWord* _data_location; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
209 HeapWord* _highest_ref; |
| 0 | 210 #endif // #ifdef ASSERT |
| 211 | |
| 212 #ifdef ASSERT | |
| 213 public: | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
214 uint _pushed; // 0 until region is pushed onto a worker's stack |
| 0 | 215 private: |
| 216 #endif | |
| 217 }; | |
| 218 | |
| 219 // 'Blocks' allow shorter sections of the bitmap to be searched. Each Block | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
220 // holds an offset, which is the amount of live data in the Region to the left |
| 0 | 221 // of the first live object in the Block. This amount of live data will |
| 222 // include any object extending into the block. The first block in | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
223 // a region does not include any partial object extending into the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
224 // the region. |
| 0 | 225 // |
| 226 // The offset also encodes the | |
| 227 // 'parity' of the first 1 bit in the Block: a positive offset means the | |
| 228 // first 1 bit marks the start of an object, a negative offset means the first | |
| 229 // 1 bit marks the end of an object. | |
| 230 class BlockData | |
| 231 { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
232 public: |
| 0 | 233 typedef short int blk_ofs_t; |
| 234 | |
| 235 blk_ofs_t offset() const { return _offset >= 0 ? _offset : -_offset; } | |
| 236 blk_ofs_t raw_offset() const { return _offset; } | |
| 237 void set_first_is_start_bit(bool v) { _first_is_start_bit = v; } | |
| 238 | |
| 239 #if 0 | |
| 240 // The need for this method was anticipated but it is | |
| 241 // never actually used. Do not include it for now. If | |
| 242 // it is needed, consider the problem of what is passed | |
| 243 // as "v". To avoid warning errors the method set_start_bit_offset() | |
| 244 // was changed to take a size_t as the parameter and to do the | |
| 245 // check for the possible overflow. Doing the cast in these | |
| 246 // methods better limits the potential problems because of | |
| 247 // the size of the field to this class. | |
| 248 void set_raw_offset(blk_ofs_t v) { _offset = v; } | |
| 249 #endif | |
| 250 void set_start_bit_offset(size_t val) { | |
| 251 assert(val >= 0, "sanity"); | |
| 252 _offset = (blk_ofs_t) val; | |
| 253 assert(val == (size_t) _offset, "Value is too large"); | |
| 254 _first_is_start_bit = true; | |
| 255 } | |
| 256 void set_end_bit_offset(size_t val) { | |
| 257 assert(val >= 0, "sanity"); | |
| 258 _offset = (blk_ofs_t) val; | |
| 259 assert(val == (size_t) _offset, "Value is too large"); | |
| 260 _offset = - _offset; | |
| 261 _first_is_start_bit = false; | |
| 262 } | |
| 263 bool first_is_start_bit() { | |
| 264 assert(_set_phase > 0, "Not initialized"); | |
| 265 return _first_is_start_bit; | |
| 266 } | |
| 267 bool first_is_end_bit() { | |
| 268 assert(_set_phase > 0, "Not initialized"); | |
| 269 return !_first_is_start_bit; | |
| 270 } | |
| 271 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
272 private: |
| 0 | 273 blk_ofs_t _offset; |
| 274 // This is temporary until the mark_bitmap is separated into | |
| 275 // a start bit array and an end bit array. | |
| 276 bool _first_is_start_bit; | |
| 277 #ifdef ASSERT | |
| 278 short _set_phase; | |
| 279 static short _cur_phase; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
280 public: |
| 0 | 281 static void set_cur_phase(short v) { _cur_phase = v; } |
| 282 #endif | |
| 283 }; | |
| 284 | |
| 285 public: | |
| 286 ParallelCompactData(); | |
| 287 bool initialize(MemRegion covered_region); | |
| 288 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
289 size_t region_count() const { return _region_count; } |
| 0 | 290 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
291 // Convert region indices to/from RegionData pointers. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
292 inline RegionData* region(size_t region_idx) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
293 inline size_t region(const RegionData* const region_ptr) const; |
| 0 | 294 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
295 // Returns true if the given address is contained within the region |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
296 bool region_contains(size_t region_index, HeapWord* addr); |
| 0 | 297 |
| 298 size_t block_count() const { return _block_count; } | |
| 299 inline BlockData* block(size_t n) const; | |
| 300 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
301 // Returns true if the given block is in the given region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
302 static bool region_contains_block(size_t region_index, size_t block_index); |
| 0 | 303 |
| 304 void add_obj(HeapWord* addr, size_t len); | |
| 305 void add_obj(oop p, size_t len) { add_obj((HeapWord*)p, len); } | |
| 306 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
307 // Fill in the regions covering [beg, end) so that no data moves; i.e., the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
308 // destination of region n is simply the start of region n. The argument beg |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
309 // must be region-aligned; end need not be. |
| 0 | 310 void summarize_dense_prefix(HeapWord* beg, HeapWord* end); |
| 311 | |
| 312 bool summarize(HeapWord* target_beg, HeapWord* target_end, | |
| 313 HeapWord* source_beg, HeapWord* source_end, | |
| 314 HeapWord** target_next, HeapWord** source_next = 0); | |
| 315 | |
| 316 void clear(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
317 void clear_range(size_t beg_region, size_t end_region); |
| 0 | 318 void clear_range(HeapWord* beg, HeapWord* end) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
319 clear_range(addr_to_region_idx(beg), addr_to_region_idx(end)); |
| 0 | 320 } |
| 321 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
322 // Return the number of words between addr and the start of the region |
| 0 | 323 // containing addr. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
324 inline size_t region_offset(const HeapWord* addr) const; |
| 0 | 325 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
326 // Convert addresses to/from a region index or region pointer. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
327 inline size_t addr_to_region_idx(const HeapWord* addr) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
328 inline RegionData* addr_to_region_ptr(const HeapWord* addr) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
329 inline HeapWord* region_to_addr(size_t region) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
330 inline HeapWord* region_to_addr(size_t region, size_t offset) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
331 inline HeapWord* region_to_addr(const RegionData* region) const; |
| 0 | 332 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
333 inline HeapWord* region_align_down(HeapWord* addr) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
334 inline HeapWord* region_align_up(HeapWord* addr) const; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
335 inline bool is_region_aligned(HeapWord* addr) const; |
| 0 | 336 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
337 // Analogous to region_offset() for blocks. |
| 0 | 338 size_t block_offset(const HeapWord* addr) const; |
| 339 size_t addr_to_block_idx(const HeapWord* addr) const; | |
| 340 size_t addr_to_block_idx(const oop obj) const { | |
| 341 return addr_to_block_idx((HeapWord*) obj); | |
| 342 } | |
| 343 inline BlockData* addr_to_block_ptr(const HeapWord* addr) const; | |
| 344 inline HeapWord* block_to_addr(size_t block) const; | |
| 345 | |
| 346 // Return the address one past the end of the partial object. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
347 HeapWord* partial_obj_end(size_t region_idx) const; |
| 0 | 348 |
| 349 // Return the new location of the object p after the | |
| 350 // the compaction. | |
| 351 HeapWord* calc_new_pointer(HeapWord* addr); | |
| 352 | |
| 353 // Same as calc_new_pointer() using blocks. | |
| 354 HeapWord* block_calc_new_pointer(HeapWord* addr); | |
| 355 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
356 // Same as calc_new_pointer() using regions. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
357 HeapWord* region_calc_new_pointer(HeapWord* addr); |
| 0 | 358 |
| 359 HeapWord* calc_new_pointer(oop p) { | |
| 360 return calc_new_pointer((HeapWord*) p); | |
| 361 } | |
| 362 | |
| 363 // Return the updated address for the given klass | |
| 364 klassOop calc_new_klass(klassOop); | |
| 365 | |
| 366 // Given a block returns true if the partial object for the | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
367 // corresponding region ends in the block. Returns false, otherwise |
| 0 | 368 // If there is no partial object, returns false. |
| 369 bool partial_obj_ends_in_block(size_t block_index); | |
| 370 | |
| 371 // Returns the block index for the block | |
| 372 static size_t block_idx(BlockData* block); | |
| 373 | |
| 374 #ifdef ASSERT | |
| 375 void verify_clear(const PSVirtualSpace* vspace); | |
| 376 void verify_clear(); | |
| 377 #endif // #ifdef ASSERT | |
| 378 | |
| 379 private: | |
| 380 bool initialize_block_data(size_t region_size); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
381 bool initialize_region_data(size_t region_size); |
| 0 | 382 PSVirtualSpace* create_vspace(size_t count, size_t element_size); |
| 383 | |
| 384 private: | |
| 385 HeapWord* _region_start; | |
| 386 #ifdef ASSERT | |
| 387 HeapWord* _region_end; | |
| 388 #endif // #ifdef ASSERT | |
| 389 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
390 PSVirtualSpace* _region_vspace; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
391 RegionData* _region_data; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
392 size_t _region_count; |
| 0 | 393 |
| 394 PSVirtualSpace* _block_vspace; | |
| 395 BlockData* _block_data; | |
| 396 size_t _block_count; | |
| 397 }; | |
| 398 | |
| 399 inline uint | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
400 ParallelCompactData::RegionData::destination_count_raw() const |
| 0 | 401 { |
| 402 return _dc_and_los & dc_mask; | |
| 403 } | |
| 404 | |
| 405 inline uint | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
406 ParallelCompactData::RegionData::destination_count() const |
| 0 | 407 { |
| 408 return destination_count_raw() >> dc_shift; | |
| 409 } | |
| 410 | |
| 411 inline void | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
412 ParallelCompactData::RegionData::set_destination_count(uint count) |
| 0 | 413 { |
| 414 assert(count <= (dc_completed >> dc_shift), "count too large"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
415 const region_sz_t live_sz = (region_sz_t) live_obj_size(); |
| 0 | 416 _dc_and_los = (count << dc_shift) | live_sz; |
| 417 } | |
| 418 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
419 inline void ParallelCompactData::RegionData::set_live_obj_size(size_t words) |
| 0 | 420 { |
| 421 assert(words <= los_mask, "would overflow"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
422 _dc_and_los = destination_count_raw() | (region_sz_t)words; |
| 0 | 423 } |
| 424 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
425 inline void ParallelCompactData::RegionData::decrement_destination_count() |
| 0 | 426 { |
| 427 assert(_dc_and_los < dc_claimed, "already claimed"); | |
| 428 assert(_dc_and_los >= dc_one, "count would go negative"); | |
| 429 Atomic::add((int)dc_mask, (volatile int*)&_dc_and_los); | |
| 430 } | |
| 431 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
432 inline HeapWord* ParallelCompactData::RegionData::data_location() const |
| 0 | 433 { |
| 434 DEBUG_ONLY(return _data_location;) | |
| 435 NOT_DEBUG(return NULL;) | |
| 436 } | |
| 437 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
438 inline HeapWord* ParallelCompactData::RegionData::highest_ref() const |
| 0 | 439 { |
| 440 DEBUG_ONLY(return _highest_ref;) | |
| 441 NOT_DEBUG(return NULL;) | |
| 442 } | |
| 443 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
444 inline void ParallelCompactData::RegionData::set_data_location(HeapWord* addr) |
| 0 | 445 { |
| 446 DEBUG_ONLY(_data_location = addr;) | |
| 447 } | |
| 448 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
449 inline void ParallelCompactData::RegionData::set_completed() |
| 0 | 450 { |
| 451 assert(claimed(), "must be claimed first"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
452 _dc_and_los = dc_completed | (region_sz_t) live_obj_size(); |
| 0 | 453 } |
| 454 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
455 // MT-unsafe claiming of a region. Should only be used during single threaded |
| 0 | 456 // execution. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
457 inline bool ParallelCompactData::RegionData::claim_unsafe() |
| 0 | 458 { |
| 459 if (available()) { | |
| 460 _dc_and_los |= dc_claimed; | |
| 461 return true; | |
| 462 } | |
| 463 return false; | |
| 464 } | |
| 465 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
466 inline void ParallelCompactData::RegionData::add_live_obj(size_t words) |
| 0 | 467 { |
| 468 assert(words <= (size_t)los_mask - live_obj_size(), "overflow"); | |
| 469 Atomic::add((int) words, (volatile int*) &_dc_and_los); | |
| 470 } | |
| 471 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
472 inline void ParallelCompactData::RegionData::set_highest_ref(HeapWord* addr) |
| 0 | 473 { |
| 474 #ifdef ASSERT | |
| 475 HeapWord* tmp = _highest_ref; | |
| 476 while (addr > tmp) { | |
| 477 tmp = (HeapWord*)Atomic::cmpxchg_ptr(addr, &_highest_ref, tmp); | |
| 478 } | |
| 479 #endif // #ifdef ASSERT | |
| 480 } | |
| 481 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
482 inline bool ParallelCompactData::RegionData::claim() |
| 0 | 483 { |
| 484 const int los = (int) live_obj_size(); | |
| 485 const int old = Atomic::cmpxchg(dc_claimed | los, | |
| 486 (volatile int*) &_dc_and_los, los); | |
| 487 return old == los; | |
| 488 } | |
| 489 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
490 inline ParallelCompactData::RegionData* |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
491 ParallelCompactData::region(size_t region_idx) const |
| 0 | 492 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
493 assert(region_idx <= region_count(), "bad arg"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
494 return _region_data + region_idx; |
| 0 | 495 } |
| 496 | |
| 497 inline size_t | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
498 ParallelCompactData::region(const RegionData* const region_ptr) const |
| 0 | 499 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
500 assert(region_ptr >= _region_data, "bad arg"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
501 assert(region_ptr <= _region_data + region_count(), "bad arg"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
502 return pointer_delta(region_ptr, _region_data, sizeof(RegionData)); |
| 0 | 503 } |
| 504 | |
| 505 inline ParallelCompactData::BlockData* | |
| 506 ParallelCompactData::block(size_t n) const { | |
| 507 assert(n < block_count(), "bad arg"); | |
| 508 return _block_data + n; | |
| 509 } | |
| 510 | |
| 511 inline size_t | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
512 ParallelCompactData::region_offset(const HeapWord* addr) const |
| 0 | 513 { |
| 514 assert(addr >= _region_start, "bad addr"); | |
| 515 assert(addr <= _region_end, "bad addr"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
516 return (size_t(addr) & RegionAddrOffsetMask) >> LogHeapWordSize; |
| 0 | 517 } |
| 518 | |
| 519 inline size_t | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
520 ParallelCompactData::addr_to_region_idx(const HeapWord* addr) const |
| 0 | 521 { |
| 522 assert(addr >= _region_start, "bad addr"); | |
| 523 assert(addr <= _region_end, "bad addr"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
524 return pointer_delta(addr, _region_start) >> Log2RegionSize; |
| 0 | 525 } |
| 526 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
527 inline ParallelCompactData::RegionData* |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
528 ParallelCompactData::addr_to_region_ptr(const HeapWord* addr) const |
| 0 | 529 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
530 return region(addr_to_region_idx(addr)); |
| 0 | 531 } |
| 532 | |
| 533 inline HeapWord* | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
534 ParallelCompactData::region_to_addr(size_t region) const |
| 0 | 535 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
536 assert(region <= _region_count, "region out of range"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
537 return _region_start + (region << Log2RegionSize); |
| 0 | 538 } |
| 539 | |
| 540 inline HeapWord* | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
541 ParallelCompactData::region_to_addr(const RegionData* region) const |
| 0 | 542 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
543 return region_to_addr(pointer_delta(region, _region_data, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
544 sizeof(RegionData))); |
| 0 | 545 } |
| 546 | |
| 547 inline HeapWord* | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
548 ParallelCompactData::region_to_addr(size_t region, size_t offset) const |
| 0 | 549 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
550 assert(region <= _region_count, "region out of range"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
551 assert(offset < RegionSize, "offset too big"); // This may be too strict. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
552 return region_to_addr(region) + offset; |
| 0 | 553 } |
| 554 | |
| 555 inline HeapWord* | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
556 ParallelCompactData::region_align_down(HeapWord* addr) const |
| 0 | 557 { |
| 558 assert(addr >= _region_start, "bad addr"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
559 assert(addr < _region_end + RegionSize, "bad addr"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
560 return (HeapWord*)(size_t(addr) & RegionAddrMask); |
| 0 | 561 } |
| 562 | |
| 563 inline HeapWord* | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
564 ParallelCompactData::region_align_up(HeapWord* addr) const |
| 0 | 565 { |
| 566 assert(addr >= _region_start, "bad addr"); | |
| 567 assert(addr <= _region_end, "bad addr"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
568 return region_align_down(addr + RegionSizeOffsetMask); |
| 0 | 569 } |
| 570 | |
| 571 inline bool | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
572 ParallelCompactData::is_region_aligned(HeapWord* addr) const |
| 0 | 573 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
574 return region_offset(addr) == 0; |
| 0 | 575 } |
| 576 | |
| 577 inline size_t | |
| 578 ParallelCompactData::block_offset(const HeapWord* addr) const | |
| 579 { | |
| 580 assert(addr >= _region_start, "bad addr"); | |
| 581 assert(addr <= _region_end, "bad addr"); | |
| 582 return pointer_delta(addr, _region_start) & BlockOffsetMask; | |
| 583 } | |
| 584 | |
| 585 inline size_t | |
| 586 ParallelCompactData::addr_to_block_idx(const HeapWord* addr) const | |
| 587 { | |
| 588 assert(addr >= _region_start, "bad addr"); | |
| 589 assert(addr <= _region_end, "bad addr"); | |
| 590 return pointer_delta(addr, _region_start) >> Log2BlockSize; | |
| 591 } | |
| 592 | |
| 593 inline ParallelCompactData::BlockData* | |
| 594 ParallelCompactData::addr_to_block_ptr(const HeapWord* addr) const | |
| 595 { | |
| 596 return block(addr_to_block_idx(addr)); | |
| 597 } | |
| 598 | |
| 599 inline HeapWord* | |
| 600 ParallelCompactData::block_to_addr(size_t block) const | |
| 601 { | |
| 602 assert(block < _block_count, "block out of range"); | |
| 603 return _region_start + (block << Log2BlockSize); | |
| 604 } | |
| 605 | |
| 606 // Abstract closure for use with ParMarkBitMap::iterate(), which will invoke the | |
| 607 // do_addr() method. | |
| 608 // | |
| 609 // The closure is initialized with the number of heap words to process | |
| 610 // (words_remaining()), and becomes 'full' when it reaches 0. The do_addr() | |
| 611 // methods in subclasses should update the total as words are processed. Since | |
| 612 // only one subclass actually uses this mechanism to terminate iteration, the | |
| 613 // default initial value is > 0. The implementation is here and not in the | |
| 614 // single subclass that uses it to avoid making is_full() virtual, and thus | |
| 615 // adding a virtual call per live object. | |
| 616 | |
| 617 class ParMarkBitMapClosure: public StackObj { | |
| 618 public: | |
| 619 typedef ParMarkBitMap::idx_t idx_t; | |
| 620 typedef ParMarkBitMap::IterationStatus IterationStatus; | |
| 621 | |
| 622 public: | |
| 623 inline ParMarkBitMapClosure(ParMarkBitMap* mbm, ParCompactionManager* cm, | |
| 624 size_t words = max_uintx); | |
| 625 | |
| 626 inline ParCompactionManager* compaction_manager() const; | |
| 627 inline ParMarkBitMap* bitmap() const; | |
| 628 inline size_t words_remaining() const; | |
| 629 inline bool is_full() const; | |
| 630 inline HeapWord* source() const; | |
| 631 | |
| 632 inline void set_source(HeapWord* addr); | |
| 633 | |
| 634 virtual IterationStatus do_addr(HeapWord* addr, size_t words) = 0; | |
| 635 | |
| 636 protected: | |
| 637 inline void decrement_words_remaining(size_t words); | |
| 638 | |
| 639 private: | |
| 640 ParMarkBitMap* const _bitmap; | |
| 641 ParCompactionManager* const _compaction_manager; | |
| 642 DEBUG_ONLY(const size_t _initial_words_remaining;) // Useful in debugger. | |
| 643 size_t _words_remaining; // Words left to copy. | |
| 644 | |
| 645 protected: | |
| 646 HeapWord* _source; // Next addr that would be read. | |
| 647 }; | |
| 648 | |
| 649 inline | |
| 650 ParMarkBitMapClosure::ParMarkBitMapClosure(ParMarkBitMap* bitmap, | |
| 651 ParCompactionManager* cm, | |
| 652 size_t words): | |
| 653 _bitmap(bitmap), _compaction_manager(cm) | |
| 654 #ifdef ASSERT | |
| 655 , _initial_words_remaining(words) | |
| 656 #endif | |
| 657 { | |
| 658 _words_remaining = words; | |
| 659 _source = NULL; | |
| 660 } | |
| 661 | |
| 662 inline ParCompactionManager* ParMarkBitMapClosure::compaction_manager() const { | |
| 663 return _compaction_manager; | |
| 664 } | |
| 665 | |
| 666 inline ParMarkBitMap* ParMarkBitMapClosure::bitmap() const { | |
| 667 return _bitmap; | |
| 668 } | |
| 669 | |
| 670 inline size_t ParMarkBitMapClosure::words_remaining() const { | |
| 671 return _words_remaining; | |
| 672 } | |
| 673 | |
| 674 inline bool ParMarkBitMapClosure::is_full() const { | |
| 675 return words_remaining() == 0; | |
| 676 } | |
| 677 | |
| 678 inline HeapWord* ParMarkBitMapClosure::source() const { | |
| 679 return _source; | |
| 680 } | |
| 681 | |
| 682 inline void ParMarkBitMapClosure::set_source(HeapWord* addr) { | |
| 683 _source = addr; | |
| 684 } | |
| 685 | |
| 686 inline void ParMarkBitMapClosure::decrement_words_remaining(size_t words) { | |
| 687 assert(_words_remaining >= words, "processed too many words"); | |
| 688 _words_remaining -= words; | |
| 689 } | |
| 690 | |
| 691 // Closure for updating the block data during the summary phase. | |
| 692 class BitBlockUpdateClosure: public ParMarkBitMapClosure { | |
| 693 // ParallelCompactData::BlockData::blk_ofs_t _live_data_left; | |
| 694 size_t _live_data_left; | |
| 695 size_t _cur_block; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
696 HeapWord* _region_start; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
697 HeapWord* _region_end; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
698 size_t _region_index; |
| 0 | 699 |
| 700 public: | |
| 701 BitBlockUpdateClosure(ParMarkBitMap* mbm, | |
| 702 ParCompactionManager* cm, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
703 size_t region_index); |
| 0 | 704 |
| 705 size_t cur_block() { return _cur_block; } | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
706 size_t region_index() { return _region_index; } |
| 0 | 707 size_t live_data_left() { return _live_data_left; } |
| 708 // Returns true the first bit in the current block (cur_block) is | |
| 709 // a start bit. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
710 // Returns true if the current block is within the region for the closure; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
711 bool region_contains_cur_block(); |
| 0 | 712 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
713 // Set the region index and related region values for |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
714 // a new region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
715 void reset_region(size_t region_index); |
| 0 | 716 |
| 717 virtual IterationStatus do_addr(HeapWord* addr, size_t words); | |
| 718 }; | |
| 719 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
720 // The UseParallelOldGC collector is a stop-the-world garbage collector that |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
721 // does parts of the collection using parallel threads. The collection includes |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
722 // the tenured generation and the young generation. The permanent generation is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
723 // collected at the same time as the other two generations but the permanent |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
724 // generation is collect by a single GC thread. The permanent generation is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
725 // collected serially because of the requirement that during the processing of a |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
726 // klass AAA, any objects reference by AAA must already have been processed. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
727 // This requirement is enforced by a left (lower address) to right (higher |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
728 // address) sliding compaction. |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
729 // |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
730 // There are four phases of the collection. |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
731 // |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
732 // - marking phase |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
733 // - summary phase |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
734 // - compacting phase |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
735 // - clean up phase |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
736 // |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
737 // Roughly speaking these phases correspond, respectively, to |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
738 // - mark all the live objects |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
739 // - calculate the destination of each object at the end of the collection |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
740 // - move the objects to their destination |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
741 // - update some references and reinitialize some variables |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
742 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
743 // These three phases are invoked in PSParallelCompact::invoke_no_policy(). The |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
744 // marking phase is implemented in PSParallelCompact::marking_phase() and does a |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
745 // complete marking of the heap. The summary phase is implemented in |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
746 // PSParallelCompact::summary_phase(). The move and update phase is implemented |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
747 // in PSParallelCompact::compact(). |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
748 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
749 // A space that is being collected is divided into regions and with each region |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
750 // is associated an object of type ParallelCompactData. Each region is of a |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
751 // fixed size and typically will contain more than 1 object and may have parts |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
752 // of objects at the front and back of the region. |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
753 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
754 // region -----+---------------------+---------- |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
755 // objects covered [ AAA )[ BBB )[ CCC )[ DDD ) |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
756 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
757 // The marking phase does a complete marking of all live objects in the heap. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
758 // The marking also compiles the size of the data for all live objects covered |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
759 // by the region. This size includes the part of any live object spanning onto |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
760 // the region (part of AAA if it is live) from the front, all live objects |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
761 // contained in the region (BBB and/or CCC if they are live), and the part of |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
762 // any live objects covered by the region that extends off the region (part of |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
763 // DDD if it is live). The marking phase uses multiple GC threads and marking |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
764 // is done in a bit array of type ParMarkBitMap. The marking of the bit map is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
765 // done atomically as is the accumulation of the size of the live objects |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
766 // covered by a region. |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
767 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
768 // The summary phase calculates the total live data to the left of each region |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
769 // XXX. Based on that total and the bottom of the space, it can calculate the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
770 // starting location of the live data in XXX. The summary phase calculates for |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
771 // each region XXX quantites such as |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
772 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
773 // - the amount of live data at the beginning of a region from an object |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
774 // entering the region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
775 // - the location of the first live data on the region |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
776 // - a count of the number of regions receiving live data from XXX. |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
777 // |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
778 // See ParallelCompactData for precise details. The summary phase also |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
779 // calculates the dense prefix for the compaction. The dense prefix is a |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
780 // portion at the beginning of the space that is not moved. The objects in the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
781 // dense prefix do need to have their object references updated. See method |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
782 // summarize_dense_prefix(). |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
783 // |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
784 // The summary phase is done using 1 GC thread. |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
785 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
786 // The compaction phase moves objects to their new location and updates all |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
787 // references in the object. |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
788 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
789 // A current exception is that objects that cross a region boundary are moved |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
790 // but do not have their references updated. References are not updated because |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
791 // it cannot easily be determined if the klass pointer KKK for the object AAA |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
792 // has been updated. KKK likely resides in a region to the left of the region |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
793 // containing AAA. These AAA's have there references updated at the end in a |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
794 // clean up phase. See the method PSParallelCompact::update_deferred_objects(). |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
795 // An alternate strategy is being investigated for this deferral of updating. |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
113
diff
changeset
|
796 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
797 // Compaction is done on a region basis. A region that is ready to be filled is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
798 // put on a ready list and GC threads take region off the list and fill them. A |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
799 // region is ready to be filled if it empty of live objects. Such a region may |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
800 // have been initially empty (only contained dead objects) or may have had all |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
801 // its live objects copied out already. A region that compacts into itself is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
802 // also ready for filling. The ready list is initially filled with empty |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
803 // regions and regions compacting into themselves. There is always at least 1 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
804 // region that can be put on the ready list. The regions are atomically added |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
805 // and removed from the ready list. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
806 |
| 0 | 807 class PSParallelCompact : AllStatic { |
| 808 public: | |
| 809 // Convenient access to type names. | |
| 810 typedef ParMarkBitMap::idx_t idx_t; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
811 typedef ParallelCompactData::RegionData RegionData; |
| 0 | 812 typedef ParallelCompactData::BlockData BlockData; |
| 813 | |
| 814 typedef enum { | |
| 815 perm_space_id, old_space_id, eden_space_id, | |
| 816 from_space_id, to_space_id, last_space_id | |
| 817 } SpaceId; | |
| 818 | |
| 819 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
820 // Inline closure decls |
| 0 | 821 // |
| 822 class IsAliveClosure: public BoolObjectClosure { | |
| 823 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
824 virtual void do_object(oop p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
825 virtual bool do_object_b(oop p); |
| 0 | 826 }; |
| 827 | |
| 828 class KeepAliveClosure: public OopClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
829 private: |
| 0 | 830 ParCompactionManager* _compaction_manager; |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
831 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
832 template <class T> inline void do_oop_work(T* p); |
| 0 | 833 public: |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
834 KeepAliveClosure(ParCompactionManager* cm) : _compaction_manager(cm) { } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
835 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
836 virtual void do_oop(narrowOop* p); |
| 0 | 837 }; |
| 838 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
839 // Current unused |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
840 class FollowRootClosure: public OopsInGenClosure { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
841 private: |
| 0 | 842 ParCompactionManager* _compaction_manager; |
| 843 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
844 FollowRootClosure(ParCompactionManager* cm) : _compaction_manager(cm) { } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
845 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
846 virtual void do_oop(narrowOop* p); |
| 0 | 847 virtual const bool do_nmethods() const { return true; } |
| 848 }; | |
| 849 | |
| 850 class FollowStackClosure: public VoidClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
851 private: |
| 0 | 852 ParCompactionManager* _compaction_manager; |
| 853 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
854 FollowStackClosure(ParCompactionManager* cm) : _compaction_manager(cm) { } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
855 virtual void do_void(); |
| 0 | 856 }; |
| 857 | |
| 858 class AdjustPointerClosure: public OopsInGenClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
859 private: |
| 0 | 860 bool _is_root; |
| 861 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
862 AdjustPointerClosure(bool is_root) : _is_root(is_root) { } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
863 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
864 virtual void do_oop(narrowOop* p); |
| 0 | 865 }; |
| 866 | |
| 867 // Closure for verifying update of pointers. Does not | |
| 868 // have any side effects. | |
| 869 class VerifyUpdateClosure: public ParMarkBitMapClosure { | |
| 870 const MutableSpace* _space; // Is this ever used? | |
| 871 | |
| 872 public: | |
| 873 VerifyUpdateClosure(ParCompactionManager* cm, const MutableSpace* sp) : | |
| 874 ParMarkBitMapClosure(PSParallelCompact::mark_bitmap(), cm), _space(sp) | |
| 875 { } | |
| 876 | |
| 877 virtual IterationStatus do_addr(HeapWord* addr, size_t words); | |
| 878 | |
| 879 const MutableSpace* space() { return _space; } | |
| 880 }; | |
| 881 | |
| 882 // Closure for updating objects altered for debug checking | |
| 883 class ResetObjectsClosure: public ParMarkBitMapClosure { | |
| 884 public: | |
| 885 ResetObjectsClosure(ParCompactionManager* cm): | |
| 886 ParMarkBitMapClosure(PSParallelCompact::mark_bitmap(), cm) | |
| 887 { } | |
| 888 | |
| 889 virtual IterationStatus do_addr(HeapWord* addr, size_t words); | |
| 890 }; | |
| 891 | |
| 892 friend class KeepAliveClosure; | |
| 893 friend class FollowStackClosure; | |
| 894 friend class AdjustPointerClosure; | |
| 895 friend class FollowRootClosure; | |
| 896 friend class instanceKlassKlass; | |
| 897 friend class RefProcTaskProxy; | |
| 898 | |
| 899 private: | |
| 900 static elapsedTimer _accumulated_time; | |
| 901 static unsigned int _total_invocations; | |
| 902 static unsigned int _maximum_compaction_gc_num; | |
| 903 static jlong _time_of_last_gc; // ms | |
| 904 static CollectorCounters* _counters; | |
| 905 static ParMarkBitMap _mark_bitmap; | |
| 906 static ParallelCompactData _summary_data; | |
| 907 static IsAliveClosure _is_alive_closure; | |
| 908 static SpaceInfo _space_info[last_space_id]; | |
| 909 static bool _print_phases; | |
| 910 static AdjustPointerClosure _adjust_root_pointer_closure; | |
| 911 static AdjustPointerClosure _adjust_pointer_closure; | |
| 912 | |
| 913 // Reference processing (used in ...follow_contents) | |
| 914 static ReferenceProcessor* _ref_processor; | |
| 915 | |
| 916 // Updated location of intArrayKlassObj. | |
| 917 static klassOop _updated_int_array_klass_obj; | |
| 918 | |
| 919 // Values computed at initialization and used by dead_wood_limiter(). | |
| 920 static double _dwl_mean; | |
| 921 static double _dwl_std_dev; | |
| 922 static double _dwl_first_term; | |
| 923 static double _dwl_adjustment; | |
| 924 #ifdef ASSERT | |
| 925 static bool _dwl_initialized; | |
| 926 #endif // #ifdef ASSERT | |
| 927 | |
| 928 private: | |
| 929 // Closure accessors | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
930 static OopClosure* adjust_pointer_closure() { return (OopClosure*)&_adjust_pointer_closure; } |
| 0 | 931 static OopClosure* adjust_root_pointer_closure() { return (OopClosure*)&_adjust_root_pointer_closure; } |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
932 static BoolObjectClosure* is_alive_closure() { return (BoolObjectClosure*)&_is_alive_closure; } |
| 0 | 933 |
| 934 static void initialize_space_info(); | |
| 935 | |
| 936 // Return true if details about individual phases should be printed. | |
| 937 static inline bool print_phases(); | |
| 938 | |
| 939 // Clear the marking bitmap and summary data that cover the specified space. | |
| 940 static void clear_data_covering_space(SpaceId id); | |
| 941 | |
| 942 static void pre_compact(PreGCValues* pre_gc_values); | |
| 943 static void post_compact(); | |
| 944 | |
| 945 // Mark live objects | |
| 946 static void marking_phase(ParCompactionManager* cm, | |
| 947 bool maximum_heap_compaction); | |
| 948 static void follow_stack(ParCompactionManager* cm); | |
| 949 static void follow_weak_klass_links(ParCompactionManager* cm); | |
| 950 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
951 template <class T> static inline void adjust_pointer(T* p, bool is_root); |
| 0 | 952 static void adjust_root_pointer(oop* p) { adjust_pointer(p, true); } |
| 953 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
954 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
955 static inline void follow_root(ParCompactionManager* cm, T* p); |
| 0 | 956 |
| 957 // Compute the dense prefix for the designated space. This is an experimental | |
| 958 // implementation currently not used in production. | |
| 959 static HeapWord* compute_dense_prefix_via_density(const SpaceId id, | |
| 960 bool maximum_compaction); | |
| 961 | |
| 962 // Methods used to compute the dense prefix. | |
| 963 | |
| 964 // Compute the value of the normal distribution at x = density. The mean and | |
| 965 // standard deviation are values saved by initialize_dead_wood_limiter(). | |
| 966 static inline double normal_distribution(double density); | |
| 967 | |
| 968 // Initialize the static vars used by dead_wood_limiter(). | |
| 969 static void initialize_dead_wood_limiter(); | |
| 970 | |
| 971 // Return the percentage of space that can be treated as "dead wood" (i.e., | |
| 972 // not reclaimed). | |
| 973 static double dead_wood_limiter(double density, size_t min_percent); | |
| 974 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
975 // Find the first (left-most) region in the range [beg, end) that has at least |
| 0 | 976 // dead_words of dead space to the left. The argument beg must be the first |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
977 // region in the space that is not completely live. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
978 static RegionData* dead_wood_limit_region(const RegionData* beg, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
979 const RegionData* end, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
980 size_t dead_words); |
| 0 | 981 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
982 // Return a pointer to the first region in the range [beg, end) that is not |
| 0 | 983 // completely full. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
984 static RegionData* first_dead_space_region(const RegionData* beg, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
985 const RegionData* end); |
| 0 | 986 |
| 987 // Return a value indicating the benefit or 'yield' if the compacted region | |
| 988 // were to start (or equivalently if the dense prefix were to end) at the | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
989 // candidate region. Higher values are better. |
| 0 | 990 // |
| 991 // The value is based on the amount of space reclaimed vs. the costs of (a) | |
| 992 // updating references in the dense prefix plus (b) copying objects and | |
| 993 // updating references in the compacted region. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
994 static inline double reclaimed_ratio(const RegionData* const candidate, |
| 0 | 995 HeapWord* const bottom, |
| 996 HeapWord* const top, | |
| 997 HeapWord* const new_top); | |
| 998 | |
| 999 // Compute the dense prefix for the designated space. | |
| 1000 static HeapWord* compute_dense_prefix(const SpaceId id, | |
| 1001 bool maximum_compaction); | |
| 1002 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1003 // Return true if dead space crosses onto the specified Region; bit must be |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1004 // the bit index corresponding to the first word of the Region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1005 static inline bool dead_space_crosses_boundary(const RegionData* region, |
| 0 | 1006 idx_t bit); |
| 1007 | |
| 1008 // Summary phase utility routine to fill dead space (if any) at the dense | |
| 1009 // prefix boundary. Should only be called if the the dense prefix is | |
| 1010 // non-empty. | |
| 1011 static void fill_dense_prefix_end(SpaceId id); | |
| 1012 | |
| 1013 static void summarize_spaces_quick(); | |
| 1014 static void summarize_space(SpaceId id, bool maximum_compaction); | |
| 1015 static void summary_phase(ParCompactionManager* cm, bool maximum_compaction); | |
| 1016 | |
| 1017 static bool block_first_offset(size_t block_index, idx_t* block_offset_ptr); | |
| 1018 | |
| 1019 // Fill in the BlockData | |
| 1020 static void summarize_blocks(ParCompactionManager* cm, | |
| 1021 SpaceId first_compaction_space_id); | |
| 1022 | |
| 1023 // The space that is compacted after space_id. | |
| 1024 static SpaceId next_compaction_space_id(SpaceId space_id); | |
| 1025 | |
| 1026 // Adjust addresses in roots. Does not adjust addresses in heap. | |
| 1027 static void adjust_roots(); | |
| 1028 | |
| 1029 // Serial code executed in preparation for the compaction phase. | |
| 1030 static void compact_prologue(); | |
| 1031 | |
| 1032 // Move objects to new locations. | |
| 1033 static void compact_perm(ParCompactionManager* cm); | |
| 1034 static void compact(); | |
| 1035 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1036 // Add available regions to the stack and draining tasks to the task queue. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1037 static void enqueue_region_draining_tasks(GCTaskQueue* q, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1038 uint parallel_gc_threads); |
| 0 | 1039 |
| 1040 // Add dense prefix update tasks to the task queue. | |
| 1041 static void enqueue_dense_prefix_tasks(GCTaskQueue* q, | |
| 1042 uint parallel_gc_threads); | |
| 1043 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1044 // Add region stealing tasks to the task queue. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1045 static void enqueue_region_stealing_tasks( |
| 0 | 1046 GCTaskQueue* q, |
| 1047 ParallelTaskTerminator* terminator_ptr, | |
| 1048 uint parallel_gc_threads); | |
| 1049 | |
| 1050 // For debugging only - compacts the old gen serially | |
| 1051 static void compact_serial(ParCompactionManager* cm); | |
| 1052 | |
| 1053 // If objects are left in eden after a collection, try to move the boundary | |
| 1054 // and absorb them into the old gen. Returns true if eden was emptied. | |
| 1055 static bool absorb_live_data_from_eden(PSAdaptiveSizePolicy* size_policy, | |
| 1056 PSYoungGen* young_gen, | |
| 1057 PSOldGen* old_gen); | |
| 1058 | |
| 1059 // Reset time since last full gc | |
| 1060 static void reset_millis_since_last_gc(); | |
| 1061 | |
| 1062 protected: | |
| 1063 #ifdef VALIDATE_MARK_SWEEP | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1064 static GrowableArray<void*>* _root_refs_stack; |
| 0 | 1065 static GrowableArray<oop> * _live_oops; |
| 1066 static GrowableArray<oop> * _live_oops_moved_to; | |
| 1067 static GrowableArray<size_t>* _live_oops_size; | |
| 1068 static size_t _live_oops_index; | |
| 1069 static size_t _live_oops_index_at_perm; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1070 static GrowableArray<void*>* _other_refs_stack; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1071 static GrowableArray<void*>* _adjusted_pointers; |
| 0 | 1072 static bool _pointer_tracking; |
| 1073 static bool _root_tracking; | |
| 1074 | |
| 1075 // The following arrays are saved since the time of the last GC and | |
| 1076 // assist in tracking down problems where someone has done an errant | |
| 1077 // store into the heap, usually to an oop that wasn't properly | |
| 1078 // handleized across a GC. If we crash or otherwise fail before the | |
| 1079 // next GC, we can query these arrays to find out the object we had | |
| 1080 // intended to do the store to (assuming it is still alive) and the | |
| 1081 // offset within that object. Covered under RecordMarkSweepCompaction. | |
| 1082 static GrowableArray<HeapWord*> * _cur_gc_live_oops; | |
| 1083 static GrowableArray<HeapWord*> * _cur_gc_live_oops_moved_to; | |
| 1084 static GrowableArray<size_t>* _cur_gc_live_oops_size; | |
| 1085 static GrowableArray<HeapWord*> * _last_gc_live_oops; | |
| 1086 static GrowableArray<HeapWord*> * _last_gc_live_oops_moved_to; | |
| 1087 static GrowableArray<size_t>* _last_gc_live_oops_size; | |
| 1088 #endif | |
| 1089 | |
| 1090 public: | |
| 1091 class MarkAndPushClosure: public OopClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1092 private: |
| 0 | 1093 ParCompactionManager* _compaction_manager; |
| 1094 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1095 MarkAndPushClosure(ParCompactionManager* cm) : _compaction_manager(cm) { } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1096 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1097 virtual void do_oop(narrowOop* p); |
| 0 | 1098 virtual const bool do_nmethods() const { return true; } |
| 1099 }; | |
| 1100 | |
| 1101 PSParallelCompact(); | |
| 1102 | |
| 1103 // Convenient accessor for Universe::heap(). | |
| 1104 static ParallelScavengeHeap* gc_heap() { | |
| 1105 return (ParallelScavengeHeap*)Universe::heap(); | |
| 1106 } | |
| 1107 | |
| 1108 static void invoke(bool maximum_heap_compaction); | |
| 1109 static void invoke_no_policy(bool maximum_heap_compaction); | |
| 1110 | |
| 1111 static void post_initialize(); | |
| 1112 // Perform initialization for PSParallelCompact that requires | |
| 1113 // allocations. This should be called during the VM initialization | |
| 1114 // at a pointer where it would be appropriate to return a JNI_ENOMEM | |
| 1115 // in the event of a failure. | |
| 1116 static bool initialize(); | |
| 1117 | |
| 1118 // Public accessors | |
| 1119 static elapsedTimer* accumulated_time() { return &_accumulated_time; } | |
| 1120 static unsigned int total_invocations() { return _total_invocations; } | |
| 1121 static CollectorCounters* counters() { return _counters; } | |
| 1122 | |
| 1123 // Used to add tasks | |
| 1124 static GCTaskManager* const gc_task_manager(); | |
| 1125 static klassOop updated_int_array_klass_obj() { | |
| 1126 return _updated_int_array_klass_obj; | |
| 1127 } | |
| 1128 | |
| 1129 // Marking support | |
| 1130 static inline bool mark_obj(oop obj); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1131 // Check mark and maybe push on marking stack |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1132 template <class T> static inline void mark_and_push(ParCompactionManager* cm, |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1133 T* p); |
| 0 | 1134 |
| 1135 // Compaction support. | |
| 1136 // Return true if p is in the range [beg_addr, end_addr). | |
| 1137 static inline bool is_in(HeapWord* p, HeapWord* beg_addr, HeapWord* end_addr); | |
| 1138 static inline bool is_in(oop* p, HeapWord* beg_addr, HeapWord* end_addr); | |
| 1139 | |
| 1140 // Convenience wrappers for per-space data kept in _space_info. | |
| 1141 static inline MutableSpace* space(SpaceId space_id); | |
| 1142 static inline HeapWord* new_top(SpaceId space_id); | |
| 1143 static inline HeapWord* dense_prefix(SpaceId space_id); | |
| 1144 static inline ObjectStartArray* start_array(SpaceId space_id); | |
| 1145 | |
| 1146 // Return true if the klass should be updated. | |
| 1147 static inline bool should_update_klass(klassOop k); | |
| 1148 | |
| 1149 // Move and update the live objects in the specified space. | |
| 1150 static void move_and_update(ParCompactionManager* cm, SpaceId space_id); | |
| 1151 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1152 // Process the end of the given region range in the dense prefix. |
| 0 | 1153 // This includes saving any object not updated. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1154 static void dense_prefix_regions_epilogue(ParCompactionManager* cm, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1155 size_t region_start_index, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1156 size_t region_end_index, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1157 idx_t exiting_object_offset, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1158 idx_t region_offset_start, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1159 idx_t region_offset_end); |
| 0 | 1160 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1161 // Update a region in the dense prefix. For each live object |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1162 // in the region, update it's interior references. For each |
| 0 | 1163 // dead object, fill it with deadwood. Dead space at the end |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1164 // of a region range will be filled to the start of the next |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1165 // live object regardless of the region_index_end. None of the |
| 0 | 1166 // objects in the dense prefix move and dead space is dead |
| 1167 // (holds only dead objects that don't need any processing), so | |
| 1168 // dead space can be filled in any order. | |
| 1169 static void update_and_deadwood_in_dense_prefix(ParCompactionManager* cm, | |
| 1170 SpaceId space_id, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1171 size_t region_index_start, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1172 size_t region_index_end); |
| 0 | 1173 |
| 1174 // Return the address of the count + 1st live word in the range [beg, end). | |
| 1175 static HeapWord* skip_live_words(HeapWord* beg, HeapWord* end, size_t count); | |
| 1176 | |
| 1177 // Return the address of the word to be copied to dest_addr, which must be | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1178 // aligned to a region boundary. |
| 0 | 1179 static HeapWord* first_src_addr(HeapWord* const dest_addr, |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1180 size_t src_region_idx); |
| 0 | 1181 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1182 // Determine the next source region, set closure.source() to the start of the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1183 // new region return the region index. Parameter end_addr is the address one |
| 0 | 1184 // beyond the end of source range just processed. If necessary, switch to a |
| 1185 // new source space and set src_space_id (in-out parameter) and src_space_top | |
| 1186 // (out parameter) accordingly. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1187 static size_t next_src_region(MoveAndUpdateClosure& closure, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1188 SpaceId& src_space_id, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1189 HeapWord*& src_space_top, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1190 HeapWord* end_addr); |
| 0 | 1191 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1192 // Decrement the destination count for each non-empty source region in the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1193 // range [beg_region, region(region_align_up(end_addr))). |
| 0 | 1194 static void decrement_destination_counts(ParCompactionManager* cm, |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1195 size_t beg_region, |
| 0 | 1196 HeapWord* end_addr); |
| 1197 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1198 // Fill a region, copying objects from one or more source regions. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1199 static void fill_region(ParCompactionManager* cm, size_t region_idx); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1200 static void fill_and_update_region(ParCompactionManager* cm, size_t region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1201 fill_region(cm, region); |
| 0 | 1202 } |
| 1203 | |
| 1204 // Update the deferred objects in the space. | |
| 1205 static void update_deferred_objects(ParCompactionManager* cm, SpaceId id); | |
| 1206 | |
| 1207 // Mark pointer and follow contents. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1208 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1209 static inline void mark_and_follow(ParCompactionManager* cm, T* p); |
| 0 | 1210 |
| 1211 static ParMarkBitMap* mark_bitmap() { return &_mark_bitmap; } | |
| 1212 static ParallelCompactData& summary_data() { return _summary_data; } | |
| 1213 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1214 static inline void adjust_pointer(oop* p) { adjust_pointer(p, false); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1215 static inline void adjust_pointer(narrowOop* p) { adjust_pointer(p, false); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1216 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1217 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1218 static inline void adjust_pointer(T* p, |
| 0 | 1219 HeapWord* beg_addr, |
| 1220 HeapWord* end_addr); | |
| 1221 | |
| 1222 // Reference Processing | |
| 1223 static ReferenceProcessor* const ref_processor() { return _ref_processor; } | |
| 1224 | |
| 1225 // Return the SpaceId for the given address. | |
| 1226 static SpaceId space_id(HeapWord* addr); | |
| 1227 | |
| 1228 // Time since last full gc (in milliseconds). | |
| 1229 static jlong millis_since_last_gc(); | |
| 1230 | |
| 1231 #ifdef VALIDATE_MARK_SWEEP | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1232 static void track_adjusted_pointer(void* p, bool isroot); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1233 static void check_adjust_pointer(void* p); |
| 0 | 1234 static void track_interior_pointers(oop obj); |
| 1235 static void check_interior_pointers(); | |
| 1236 | |
| 1237 static void reset_live_oop_tracking(bool at_perm); | |
| 1238 static void register_live_oop(oop p, size_t size); | |
| 1239 static void validate_live_oop(oop p, size_t size); | |
| 1240 static void live_oop_moved_to(HeapWord* q, size_t size, HeapWord* compaction_top); | |
| 1241 static void compaction_complete(); | |
| 1242 | |
| 1243 // Querying operation of RecordMarkSweepCompaction results. | |
| 1244 // Finds and prints the current base oop and offset for a word | |
| 1245 // within an oop that was live during the last GC. Helpful for | |
| 1246 // tracking down heap stomps. | |
| 1247 static void print_new_location_of_heap_address(HeapWord* q); | |
| 1248 #endif // #ifdef VALIDATE_MARK_SWEEP | |
| 1249 | |
| 1250 // Call backs for class unloading | |
| 1251 // Update subklass/sibling/implementor links at end of marking. | |
| 1252 static void revisit_weak_klass_link(ParCompactionManager* cm, Klass* k); | |
| 1253 | |
| 1254 #ifndef PRODUCT | |
| 1255 // Debugging support. | |
| 1256 static const char* space_names[last_space_id]; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1257 static void print_region_ranges(); |
| 0 | 1258 static void print_dense_prefix_stats(const char* const algorithm, |
| 1259 const SpaceId id, | |
| 1260 const bool maximum_compaction, | |
| 1261 HeapWord* const addr); | |
| 1262 #endif // #ifndef PRODUCT | |
| 1263 | |
| 1264 #ifdef ASSERT | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1265 // Verify that all the regions have been emptied. |
| 0 | 1266 static void verify_complete(SpaceId space_id); |
| 1267 #endif // #ifdef ASSERT | |
| 1268 }; | |
| 1269 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1270 inline bool PSParallelCompact::mark_obj(oop obj) { |
| 0 | 1271 const int obj_size = obj->size(); |
| 1272 if (mark_bitmap()->mark_obj(obj, obj_size)) { | |
| 1273 _summary_data.add_obj(obj, obj_size); | |
| 1274 return true; | |
| 1275 } else { | |
| 1276 return false; | |
| 1277 } | |
| 1278 } | |
| 1279 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1280 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1281 inline void PSParallelCompact::follow_root(ParCompactionManager* cm, T* p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1282 assert(!Universe::heap()->is_in_reserved(p), |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1283 "roots shouldn't be things within the heap"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1284 #ifdef VALIDATE_MARK_SWEEP |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1285 if (ValidateMarkSweep) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1286 guarantee(!_root_refs_stack->contains(p), "should only be in here once"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1287 _root_refs_stack->push(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1288 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1289 #endif |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1290 T heap_oop = oopDesc::load_heap_oop(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1291 if (!oopDesc::is_null(heap_oop)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1292 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1293 if (mark_bitmap()->is_unmarked(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1294 if (mark_obj(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1295 obj->follow_contents(cm); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1296 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1297 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1298 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1299 follow_stack(cm); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1300 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1301 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1302 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1303 inline void PSParallelCompact::mark_and_follow(ParCompactionManager* cm, |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1304 T* p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1305 T heap_oop = oopDesc::load_heap_oop(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1306 if (!oopDesc::is_null(heap_oop)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1307 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1308 if (mark_bitmap()->is_unmarked(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1309 if (mark_obj(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1310 obj->follow_contents(cm); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1311 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1312 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1313 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1314 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1315 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1316 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1317 inline void PSParallelCompact::mark_and_push(ParCompactionManager* cm, T* p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1318 T heap_oop = oopDesc::load_heap_oop(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1319 if (!oopDesc::is_null(heap_oop)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1320 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1321 if (mark_bitmap()->is_unmarked(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1322 if (mark_obj(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1323 // This thread marked the object and owns the subsequent processing of it. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1324 cm->save_for_scanning(obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1325 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1326 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1327 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1328 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1329 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1330 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1331 inline void PSParallelCompact::adjust_pointer(T* p, bool isroot) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1332 T heap_oop = oopDesc::load_heap_oop(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1333 if (!oopDesc::is_null(heap_oop)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1334 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1335 oop new_obj = (oop)summary_data().calc_new_pointer(obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1336 assert(new_obj != NULL || // is forwarding ptr? |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1337 obj->is_shared(), // never forwarded? |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1338 "should be forwarded"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1339 // Just always do the update unconditionally? |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1340 if (new_obj != NULL) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1341 assert(Universe::heap()->is_in_reserved(new_obj), |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1342 "should be in object space"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1343 oopDesc::encode_store_heap_oop_not_null(p, new_obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1344 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1345 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1346 VALIDATE_MARK_SWEEP_ONLY(track_adjusted_pointer(p, isroot)); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1347 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1348 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1349 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1350 inline void PSParallelCompact::KeepAliveClosure::do_oop_work(T* p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1351 #ifdef VALIDATE_MARK_SWEEP |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1352 if (ValidateMarkSweep) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1353 if (!Universe::heap()->is_in_reserved(p)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1354 _root_refs_stack->push(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1355 } else { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1356 _other_refs_stack->push(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1357 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1358 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1359 #endif |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1360 mark_and_push(_compaction_manager, p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1361 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1362 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1363 inline bool PSParallelCompact::print_phases() { |
| 0 | 1364 return _print_phases; |
| 1365 } | |
| 1366 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1367 inline double PSParallelCompact::normal_distribution(double density) { |
| 0 | 1368 assert(_dwl_initialized, "uninitialized"); |
| 1369 const double squared_term = (density - _dwl_mean) / _dwl_std_dev; | |
| 1370 return _dwl_first_term * exp(-0.5 * squared_term * squared_term); | |
| 1371 } | |
| 1372 | |
| 1373 inline bool | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1374 PSParallelCompact::dead_space_crosses_boundary(const RegionData* region, |
| 0 | 1375 idx_t bit) |
| 1376 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1377 assert(bit > 0, "cannot call this for the first bit/region"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1378 assert(_summary_data.region_to_addr(region) == _mark_bitmap.bit_to_addr(bit), |
| 0 | 1379 "sanity check"); |
| 1380 | |
| 1381 // Dead space crosses the boundary if (1) a partial object does not extend | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1382 // onto the region, (2) an object does not start at the beginning of the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1383 // region, and (3) an object does not end at the end of the prior region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
269
diff
changeset
|
1384 return region->partial_obj_size() == 0 && |
| 0 | 1385 !_mark_bitmap.is_obj_beg(bit) && |
| 1386 !_mark_bitmap.is_obj_end(bit - 1); | |
| 1387 } | |
| 1388 | |
| 1389 inline bool | |
| 1390 PSParallelCompact::is_in(HeapWord* p, HeapWord* beg_addr, HeapWord* end_addr) { | |
| 1391 return p >= beg_addr && p < end_addr; | |
| 1392 } | |
| 1393 | |
| 1394 inline bool | |
| 1395 PSParallelCompact::is_in(oop* p, HeapWord* beg_addr, HeapWord* end_addr) { | |
| 1396 return is_in((HeapWord*)p, beg_addr, end_addr); | |
| 1397 } | |
| 1398 | |
| 1399 inline MutableSpace* PSParallelCompact::space(SpaceId id) { | |
| 1400 assert(id < last_space_id, "id out of range"); | |
| 1401 return _space_info[id].space(); | |
| 1402 } | |
| 1403 | |
| 1404 inline HeapWord* PSParallelCompact::new_top(SpaceId id) { | |
| 1405 assert(id < last_space_id, "id out of range"); | |
| 1406 return _space_info[id].new_top(); | |
| 1407 } | |
| 1408 | |
| 1409 inline HeapWord* PSParallelCompact::dense_prefix(SpaceId id) { | |
| 1410 assert(id < last_space_id, "id out of range"); | |
| 1411 return _space_info[id].dense_prefix(); | |
| 1412 } | |
| 1413 | |
| 1414 inline ObjectStartArray* PSParallelCompact::start_array(SpaceId id) { | |
| 1415 assert(id < last_space_id, "id out of range"); | |
| 1416 return _space_info[id].start_array(); | |
| 1417 } | |
| 1418 | |
| 1419 inline bool PSParallelCompact::should_update_klass(klassOop k) { | |
| 1420 return ((HeapWord*) k) >= dense_prefix(perm_space_id); | |
| 1421 } | |
| 1422 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1423 template <class T> |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1424 inline void PSParallelCompact::adjust_pointer(T* p, |
| 0 | 1425 HeapWord* beg_addr, |
| 1426 HeapWord* end_addr) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1427 if (is_in((HeapWord*)p, beg_addr, end_addr)) { |
| 0 | 1428 adjust_pointer(p); |
| 1429 } | |
| 1430 } | |
| 1431 | |
| 1432 class MoveAndUpdateClosure: public ParMarkBitMapClosure { | |
| 1433 public: | |
| 1434 inline MoveAndUpdateClosure(ParMarkBitMap* bitmap, ParCompactionManager* cm, | |
| 1435 ObjectStartArray* start_array, | |
| 1436 HeapWord* destination, size_t words); | |
| 1437 | |
| 1438 // Accessors. | |
| 1439 HeapWord* destination() const { return _destination; } | |
| 1440 | |
| 1441 // If the object will fit (size <= words_remaining()), copy it to the current | |
| 1442 // destination, update the interior oops and the start array and return either | |
| 1443 // full (if the closure is full) or incomplete. If the object will not fit, | |
| 1444 // return would_overflow. | |
| 1445 virtual IterationStatus do_addr(HeapWord* addr, size_t size); | |
| 1446 | |
| 1447 // Copy enough words to fill this closure, starting at source(). Interior | |
| 1448 // oops and the start array are not updated. Return full. | |
| 1449 IterationStatus copy_until_full(); | |
| 1450 | |
| 1451 // Copy enough words to fill this closure or to the end of an object, | |
| 1452 // whichever is smaller, starting at source(). Interior oops and the start | |
| 1453 // array are not updated. | |
| 1454 void copy_partial_obj(); | |
| 1455 | |
| 1456 protected: | |
| 1457 // Update variables to indicate that word_count words were processed. | |
| 1458 inline void update_state(size_t word_count); | |
| 1459 | |
| 1460 protected: | |
| 1461 ObjectStartArray* const _start_array; | |
| 1462 HeapWord* _destination; // Next addr to be written. | |
| 1463 }; | |
| 1464 | |
| 1465 inline | |
| 1466 MoveAndUpdateClosure::MoveAndUpdateClosure(ParMarkBitMap* bitmap, | |
| 1467 ParCompactionManager* cm, | |
| 1468 ObjectStartArray* start_array, | |
| 1469 HeapWord* destination, | |
| 1470 size_t words) : | |
| 1471 ParMarkBitMapClosure(bitmap, cm, words), _start_array(start_array) | |
| 1472 { | |
| 1473 _destination = destination; | |
| 1474 } | |
| 1475 | |
| 1476 inline void MoveAndUpdateClosure::update_state(size_t words) | |
| 1477 { | |
| 1478 decrement_words_remaining(words); | |
| 1479 _source += words; | |
| 1480 _destination += words; | |
| 1481 } | |
| 1482 | |
| 1483 class UpdateOnlyClosure: public ParMarkBitMapClosure { | |
| 1484 private: | |
| 1485 const PSParallelCompact::SpaceId _space_id; | |
| 1486 ObjectStartArray* const _start_array; | |
| 1487 | |
| 1488 public: | |
| 1489 UpdateOnlyClosure(ParMarkBitMap* mbm, | |
| 1490 ParCompactionManager* cm, | |
| 1491 PSParallelCompact::SpaceId space_id); | |
| 1492 | |
| 1493 // Update the object. | |
| 1494 virtual IterationStatus do_addr(HeapWord* addr, size_t words); | |
| 1495 | |
| 1496 inline void do_addr(HeapWord* addr); | |
| 1497 }; | |
| 1498 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1499 inline void UpdateOnlyClosure::do_addr(HeapWord* addr) |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1500 { |
| 0 | 1501 _start_array->allocate_block(addr); |
| 1502 oop(addr)->update_contents(compaction_manager()); | |
| 1503 } | |
| 1504 | |
| 1505 class FillClosure: public ParMarkBitMapClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1506 public: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1507 FillClosure(ParCompactionManager* cm, PSParallelCompact::SpaceId space_id) : |
| 0 | 1508 ParMarkBitMapClosure(PSParallelCompact::mark_bitmap(), cm), |
| 1509 _space_id(space_id), | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1510 _start_array(PSParallelCompact::start_array(space_id)) { |
| 0 | 1511 assert(_space_id == PSParallelCompact::perm_space_id || |
| 1512 _space_id == PSParallelCompact::old_space_id, | |
| 1513 "cannot use FillClosure in the young gen"); | |
| 1514 assert(bitmap() != NULL, "need a bitmap"); | |
| 1515 assert(_start_array != NULL, "need a start array"); | |
| 1516 } | |
| 1517 | |
| 1518 void fill_region(HeapWord* addr, size_t size) { | |
| 1519 MemRegion region(addr, size); | |
| 1520 SharedHeap::fill_region_with_object(region); | |
| 1521 _start_array->allocate_block(addr); | |
| 1522 } | |
| 1523 | |
| 1524 virtual IterationStatus do_addr(HeapWord* addr, size_t size) { | |
| 1525 fill_region(addr, size); | |
| 1526 return ParMarkBitMap::incomplete; | |
| 1527 } | |
| 1528 | |
| 1529 private: | |
| 1530 const PSParallelCompact::SpaceId _space_id; | |
| 1531 ObjectStartArray* const _start_array; | |
| 1532 }; |