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