Mercurial > hg > graal-jvmci-8
annotate src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.hpp @ 10285:4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
Reviewed-by: stefank, tschatzl
| author | brutisso |
|---|---|
| date | Mon, 13 May 2013 14:09:05 +0200 |
| parents | 7b835924c31c |
| children | 10f759898d40 |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
6842
b9a9ed0f8eeb
7197424: update copyright year to match last edit in jdk8 hotspot repository
mikael
parents:
6197
diff
changeset
|
2 * Copyright (c) 2005, 2012, Oracle and/or its affiliates. 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
844
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
844
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
844
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARMARKBITMAP_HPP |
| 26 #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARMARKBITMAP_HPP | |
| 27 | |
|
1983
c760f78e0a53
7003125: precompiled.hpp is included when precompiled headers are not used
stefank
parents:
1972
diff
changeset
|
28 #include "memory/memRegion.hpp" |
|
10285
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
29 #include "oops/oop.hpp" |
|
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
30 #include "utilities/bitMap.hpp" |
| 1972 | 31 |
| 0 | 32 class ParMarkBitMapClosure; |
|
10285
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
33 class PSVirtualSpace; |
| 0 | 34 |
| 6197 | 35 class ParMarkBitMap: public CHeapObj<mtGC> |
| 0 | 36 { |
| 37 public: | |
| 38 typedef BitMap::idx_t idx_t; | |
| 39 | |
| 40 // Values returned by the iterate() methods. | |
| 41 enum IterationStatus { incomplete, complete, full, would_overflow }; | |
| 42 | |
| 43 inline ParMarkBitMap(); | |
| 44 bool initialize(MemRegion covered_region); | |
| 45 | |
| 46 // Atomically mark an object as live. | |
| 47 bool mark_obj(HeapWord* addr, size_t size); | |
| 48 inline bool mark_obj(oop obj, int size); | |
| 49 | |
| 50 // Return whether the specified begin or end bit is set. | |
| 51 inline bool is_obj_beg(idx_t bit) const; | |
| 52 inline bool is_obj_end(idx_t bit) const; | |
| 53 | |
| 54 // Traditional interface for testing whether an object is marked or not (these | |
| 55 // test only the begin bits). | |
| 56 inline bool is_marked(idx_t bit) const; | |
| 57 inline bool is_marked(HeapWord* addr) const; | |
| 58 inline bool is_marked(oop obj) const; | |
| 59 | |
| 60 inline bool is_unmarked(idx_t bit) const; | |
| 61 inline bool is_unmarked(HeapWord* addr) const; | |
| 62 inline bool is_unmarked(oop obj) const; | |
| 63 | |
| 64 // Convert sizes from bits to HeapWords and back. An object that is n bits | |
| 65 // long will be bits_to_words(n) words long. An object that is m words long | |
| 66 // will take up words_to_bits(m) bits in the bitmap. | |
| 67 inline static size_t bits_to_words(idx_t bits); | |
| 68 inline static idx_t words_to_bits(size_t words); | |
| 69 | |
| 70 // Return the size in words of an object given a begin bit and an end bit, or | |
| 71 // the equivalent beg_addr and end_addr. | |
| 72 inline size_t obj_size(idx_t beg_bit, idx_t end_bit) const; | |
| 73 inline size_t obj_size(HeapWord* beg_addr, HeapWord* end_addr) const; | |
| 74 | |
| 75 // Return the size in words of the object (a search is done for the end bit). | |
| 76 inline size_t obj_size(idx_t beg_bit) const; | |
| 77 inline size_t obj_size(HeapWord* addr) const; | |
| 78 | |
| 79 // Apply live_closure to each live object that lies completely within the | |
| 80 // range [live_range_beg, live_range_end). This is used to iterate over the | |
| 81 // compacted region of the heap. Return values: | |
| 82 // | |
| 83 // incomplete The iteration is not complete. The last object that | |
| 84 // begins in the range does not end in the range; | |
| 85 // closure->source() is set to the start of that object. | |
| 86 // | |
| 87 // complete The iteration is complete. All objects in the range | |
| 88 // were processed and the closure is not full; | |
| 89 // closure->source() is set one past the end of the range. | |
| 90 // | |
| 91 // full The closure is full; closure->source() is set to one | |
| 92 // past the end of the last object processed. | |
| 93 // | |
| 94 // would_overflow The next object in the range would overflow the closure; | |
| 95 // closure->source() is set to the start of that object. | |
| 96 IterationStatus iterate(ParMarkBitMapClosure* live_closure, | |
| 97 idx_t range_beg, idx_t range_end) const; | |
| 98 inline IterationStatus iterate(ParMarkBitMapClosure* live_closure, | |
| 99 HeapWord* range_beg, | |
| 100 HeapWord* range_end) const; | |
| 101 | |
| 102 // Apply live closure as above and additionally apply dead_closure to all dead | |
| 103 // space in the range [range_beg, dead_range_end). Note that dead_range_end | |
| 104 // must be >= range_end. This is used to iterate over the dense prefix. | |
| 105 // | |
| 106 // This method assumes that if the first bit in the range (range_beg) is not | |
| 107 // marked, then dead space begins at that point and the dead_closure is | |
| 108 // applied. Thus callers must ensure that range_beg is not in the middle of a | |
| 109 // live object. | |
| 110 IterationStatus iterate(ParMarkBitMapClosure* live_closure, | |
| 111 ParMarkBitMapClosure* dead_closure, | |
| 112 idx_t range_beg, idx_t range_end, | |
| 113 idx_t dead_range_end) const; | |
| 114 inline IterationStatus iterate(ParMarkBitMapClosure* live_closure, | |
| 115 ParMarkBitMapClosure* dead_closure, | |
| 116 HeapWord* range_beg, | |
| 117 HeapWord* range_end, | |
| 118 HeapWord* dead_range_end) const; | |
| 119 | |
|
10285
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
120 // Return the number of live words in the range [beg_addr, end_obj) due to |
| 0 | 121 // objects that start in the range. If a live object extends onto the range, |
| 122 // the caller must detect and account for any live words due to that object. | |
| 123 // If a live object extends beyond the end of the range, only the words within | |
|
10285
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
124 // the range are included in the result. The end of the range must be a live object, |
|
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
125 // which is the case when updating pointers. This allows a branch to be removed |
| 0 | 126 // from inside the loop. |
| 127 size_t live_words_in_range(HeapWord* beg_addr, oop end_obj) const; | |
| 128 | |
| 129 inline HeapWord* region_start() const; | |
| 130 inline HeapWord* region_end() const; | |
| 131 inline size_t region_size() const; | |
| 132 inline size_t size() const; | |
| 133 | |
| 134 // Convert a heap address to/from a bit index. | |
| 135 inline idx_t addr_to_bit(HeapWord* addr) const; | |
| 136 inline HeapWord* bit_to_addr(idx_t bit) const; | |
| 137 | |
| 138 // Return the bit index of the first marked object that begins (or ends, | |
| 139 // respectively) in the range [beg, end). If no object is found, return end. | |
| 140 inline idx_t find_obj_beg(idx_t beg, idx_t end) const; | |
| 141 inline idx_t find_obj_end(idx_t beg, idx_t end) const; | |
| 142 | |
| 143 inline HeapWord* find_obj_beg(HeapWord* beg, HeapWord* end) const; | |
| 144 inline HeapWord* find_obj_end(HeapWord* beg, HeapWord* end) const; | |
| 145 | |
| 146 // Clear a range of bits or the entire bitmap (both begin and end bits are | |
| 147 // cleared). | |
| 148 inline void clear_range(idx_t beg, idx_t end); | |
| 149 | |
| 150 // Return the number of bits required to represent the specified number of | |
| 151 // HeapWords, or the specified region. | |
| 152 static inline idx_t bits_required(size_t words); | |
| 153 static inline idx_t bits_required(MemRegion covered_region); | |
| 154 | |
|
9076
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
6842
diff
changeset
|
155 void print_on_error(outputStream* st) const { |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
6842
diff
changeset
|
156 st->print_cr("Marking Bits: (ParMarkBitMap*) " PTR_FORMAT, this); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
6842
diff
changeset
|
157 _beg_bits.print_on_error(st, " Begin Bits: "); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
6842
diff
changeset
|
158 _end_bits.print_on_error(st, " End Bits: "); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
6842
diff
changeset
|
159 } |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
6842
diff
changeset
|
160 |
| 0 | 161 #ifdef ASSERT |
| 162 void verify_clear() const; | |
| 163 inline void verify_bit(idx_t bit) const; | |
| 164 inline void verify_addr(HeapWord* addr) const; | |
| 165 #endif // #ifdef ASSERT | |
| 166 | |
| 167 private: | |
| 168 // Each bit in the bitmap represents one unit of 'object granularity.' Objects | |
| 169 // are double-word aligned in 32-bit VMs, but not in 64-bit VMs, so the 32-bit | |
| 170 // granularity is 2, 64-bit is 1. | |
| 171 static inline size_t obj_granularity() { return size_t(MinObjAlignment); } | |
|
808
353ba4575581
6814552: par compact - some compilers fail to optimize bitmap code
jcoomes
parents:
342
diff
changeset
|
172 static inline int obj_granularity_shift() { return LogMinObjAlignment; } |
| 0 | 173 |
| 174 HeapWord* _region_start; | |
| 175 size_t _region_size; | |
| 176 BitMap _beg_bits; | |
| 177 BitMap _end_bits; | |
| 178 PSVirtualSpace* _virtual_space; | |
| 179 }; | |
| 180 | |
| 181 inline ParMarkBitMap::ParMarkBitMap(): | |
|
10285
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
182 _beg_bits(), _end_bits(), _region_start(NULL), _region_size(0), _virtual_space(NULL) |
|
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
183 { } |
| 0 | 184 |
| 185 inline void ParMarkBitMap::clear_range(idx_t beg, idx_t end) | |
| 186 { | |
| 187 _beg_bits.clear_range(beg, end); | |
| 188 _end_bits.clear_range(beg, end); | |
| 189 } | |
| 190 | |
| 191 inline ParMarkBitMap::idx_t | |
| 192 ParMarkBitMap::bits_required(size_t words) | |
| 193 { | |
| 194 // Need two bits (one begin bit, one end bit) for each unit of 'object | |
| 195 // granularity' in the heap. | |
| 196 return words_to_bits(words * 2); | |
| 197 } | |
| 198 | |
| 199 inline ParMarkBitMap::idx_t | |
| 200 ParMarkBitMap::bits_required(MemRegion covered_region) | |
| 201 { | |
| 202 return bits_required(covered_region.word_size()); | |
| 203 } | |
| 204 | |
| 205 inline HeapWord* | |
| 206 ParMarkBitMap::region_start() const | |
| 207 { | |
| 208 return _region_start; | |
| 209 } | |
| 210 | |
| 211 inline HeapWord* | |
| 212 ParMarkBitMap::region_end() const | |
| 213 { | |
| 214 return region_start() + region_size(); | |
| 215 } | |
| 216 | |
| 217 inline size_t | |
| 218 ParMarkBitMap::region_size() const | |
| 219 { | |
| 220 return _region_size; | |
| 221 } | |
| 222 | |
| 223 inline size_t | |
| 224 ParMarkBitMap::size() const | |
| 225 { | |
| 226 return _beg_bits.size(); | |
| 227 } | |
| 228 | |
| 229 inline bool ParMarkBitMap::is_obj_beg(idx_t bit) const | |
| 230 { | |
| 231 return _beg_bits.at(bit); | |
| 232 } | |
| 233 | |
| 234 inline bool ParMarkBitMap::is_obj_end(idx_t bit) const | |
| 235 { | |
| 236 return _end_bits.at(bit); | |
| 237 } | |
| 238 | |
| 239 inline bool ParMarkBitMap::is_marked(idx_t bit) const | |
| 240 { | |
| 241 return is_obj_beg(bit); | |
| 242 } | |
| 243 | |
| 244 inline bool ParMarkBitMap::is_marked(HeapWord* addr) const | |
| 245 { | |
| 246 return is_marked(addr_to_bit(addr)); | |
| 247 } | |
| 248 | |
| 249 inline bool ParMarkBitMap::is_marked(oop obj) const | |
| 250 { | |
| 251 return is_marked((HeapWord*)obj); | |
| 252 } | |
| 253 | |
| 254 inline bool ParMarkBitMap::is_unmarked(idx_t bit) const | |
| 255 { | |
| 256 return !is_marked(bit); | |
| 257 } | |
| 258 | |
| 259 inline bool ParMarkBitMap::is_unmarked(HeapWord* addr) const | |
| 260 { | |
| 261 return !is_marked(addr); | |
| 262 } | |
| 263 | |
| 264 inline bool ParMarkBitMap::is_unmarked(oop obj) const | |
| 265 { | |
| 266 return !is_marked(obj); | |
| 267 } | |
| 268 | |
| 269 inline size_t | |
| 270 ParMarkBitMap::bits_to_words(idx_t bits) | |
| 271 { | |
|
808
353ba4575581
6814552: par compact - some compilers fail to optimize bitmap code
jcoomes
parents:
342
diff
changeset
|
272 return bits << obj_granularity_shift(); |
| 0 | 273 } |
| 274 | |
| 275 inline ParMarkBitMap::idx_t | |
| 276 ParMarkBitMap::words_to_bits(size_t words) | |
| 277 { | |
|
808
353ba4575581
6814552: par compact - some compilers fail to optimize bitmap code
jcoomes
parents:
342
diff
changeset
|
278 return words >> obj_granularity_shift(); |
| 0 | 279 } |
| 280 | |
| 281 inline size_t ParMarkBitMap::obj_size(idx_t beg_bit, idx_t end_bit) const | |
| 282 { | |
| 283 DEBUG_ONLY(verify_bit(beg_bit);) | |
| 284 DEBUG_ONLY(verify_bit(end_bit);) | |
| 285 return bits_to_words(end_bit - beg_bit + 1); | |
| 286 } | |
| 287 | |
| 288 inline size_t | |
| 289 ParMarkBitMap::obj_size(HeapWord* beg_addr, HeapWord* end_addr) const | |
| 290 { | |
| 291 DEBUG_ONLY(verify_addr(beg_addr);) | |
| 292 DEBUG_ONLY(verify_addr(end_addr);) | |
| 293 return pointer_delta(end_addr, beg_addr) + obj_granularity(); | |
| 294 } | |
| 295 | |
| 296 inline size_t ParMarkBitMap::obj_size(idx_t beg_bit) const | |
| 297 { | |
| 342 | 298 const idx_t end_bit = _end_bits.get_next_one_offset_inline(beg_bit, size()); |
| 0 | 299 assert(is_marked(beg_bit), "obj not marked"); |
| 300 assert(end_bit < size(), "end bit missing"); | |
| 301 return obj_size(beg_bit, end_bit); | |
| 302 } | |
| 303 | |
| 304 inline size_t ParMarkBitMap::obj_size(HeapWord* addr) const | |
| 305 { | |
| 306 return obj_size(addr_to_bit(addr)); | |
| 307 } | |
| 308 | |
| 309 inline ParMarkBitMap::IterationStatus | |
| 310 ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure, | |
| 311 HeapWord* range_beg, | |
| 312 HeapWord* range_end) const | |
| 313 { | |
| 314 return iterate(live_closure, addr_to_bit(range_beg), addr_to_bit(range_end)); | |
| 315 } | |
| 316 | |
| 317 inline ParMarkBitMap::IterationStatus | |
| 318 ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure, | |
| 319 ParMarkBitMapClosure* dead_closure, | |
| 320 HeapWord* range_beg, | |
| 321 HeapWord* range_end, | |
| 322 HeapWord* dead_range_end) const | |
| 323 { | |
| 324 return iterate(live_closure, dead_closure, | |
| 325 addr_to_bit(range_beg), addr_to_bit(range_end), | |
| 326 addr_to_bit(dead_range_end)); | |
| 327 } | |
| 328 | |
| 329 inline bool | |
| 330 ParMarkBitMap::mark_obj(oop obj, int size) | |
| 331 { | |
| 332 return mark_obj((HeapWord*)obj, (size_t)size); | |
| 333 } | |
| 334 | |
| 335 inline BitMap::idx_t | |
| 336 ParMarkBitMap::addr_to_bit(HeapWord* addr) const | |
| 337 { | |
| 338 DEBUG_ONLY(verify_addr(addr);) | |
| 339 return words_to_bits(pointer_delta(addr, region_start())); | |
| 340 } | |
| 341 | |
| 342 inline HeapWord* | |
| 343 ParMarkBitMap::bit_to_addr(idx_t bit) const | |
| 344 { | |
| 345 DEBUG_ONLY(verify_bit(bit);) | |
| 346 return region_start() + bits_to_words(bit); | |
| 347 } | |
| 348 | |
| 349 inline ParMarkBitMap::idx_t | |
| 350 ParMarkBitMap::find_obj_beg(idx_t beg, idx_t end) const | |
| 351 { | |
| 342 | 352 return _beg_bits.get_next_one_offset_inline_aligned_right(beg, end); |
| 0 | 353 } |
| 354 | |
| 355 inline ParMarkBitMap::idx_t | |
| 356 ParMarkBitMap::find_obj_end(idx_t beg, idx_t end) const | |
| 357 { | |
| 342 | 358 return _end_bits.get_next_one_offset_inline_aligned_right(beg, end); |
| 0 | 359 } |
| 360 | |
| 361 inline HeapWord* | |
| 362 ParMarkBitMap::find_obj_beg(HeapWord* beg, HeapWord* end) const | |
| 363 { | |
| 364 const idx_t beg_bit = addr_to_bit(beg); | |
| 365 const idx_t end_bit = addr_to_bit(end); | |
| 366 const idx_t search_end = BitMap::word_align_up(end_bit); | |
| 367 const idx_t res_bit = MIN2(find_obj_beg(beg_bit, search_end), end_bit); | |
| 368 return bit_to_addr(res_bit); | |
| 369 } | |
| 370 | |
| 371 inline HeapWord* | |
| 372 ParMarkBitMap::find_obj_end(HeapWord* beg, HeapWord* end) const | |
| 373 { | |
| 374 const idx_t beg_bit = addr_to_bit(beg); | |
| 375 const idx_t end_bit = addr_to_bit(end); | |
| 376 const idx_t search_end = BitMap::word_align_up(end_bit); | |
| 377 const idx_t res_bit = MIN2(find_obj_end(beg_bit, search_end), end_bit); | |
| 378 return bit_to_addr(res_bit); | |
| 379 } | |
| 380 | |
| 381 #ifdef ASSERT | |
| 382 inline void ParMarkBitMap::verify_bit(idx_t bit) const { | |
| 383 // Allow one past the last valid bit; useful for loop bounds. | |
| 384 assert(bit <= _beg_bits.size(), "bit out of range"); | |
| 385 } | |
| 386 | |
| 387 inline void ParMarkBitMap::verify_addr(HeapWord* addr) const { | |
| 388 // Allow one past the last valid address; useful for loop bounds. | |
|
10285
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
389 assert(addr >= region_start(), |
|
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
390 err_msg("addr too small, addr: " PTR_FORMAT " region start: " PTR_FORMAT, addr, region_start())); |
|
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
391 assert(addr <= region_end(), |
|
4868caa99ecf
8014339: Improve assert and remove some dead code from parMarkBitMap.hpp/cpp
brutisso
parents:
9076
diff
changeset
|
392 err_msg("addr too big, addr: " PTR_FORMAT " region end: " PTR_FORMAT, addr, region_end())); |
| 0 | 393 } |
| 394 #endif // #ifdef ASSERT | |
| 1972 | 395 |
| 396 #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PARMARKBITMAP_HPP |