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