1 /*
2 * Copyright (c) 2001, 2019, 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_GC_G1_HEAPREGION_HPP
26 #define SHARE_GC_G1_HEAPREGION_HPP
27
28 #include "gc/g1/g1BlockOffsetTable.hpp"
29 #include "gc/g1/g1HeapRegionTraceType.hpp"
30 #include "gc/g1/heapRegionTracer.hpp"
31 #include "gc/g1/heapRegionType.hpp"
32 #include "gc/g1/survRateGroup.hpp"
33 #include "gc/shared/ageTable.hpp"
34 #include "gc/shared/cardTable.hpp"
35 #include "gc/shared/verifyOption.hpp"
36 #include "gc/shared/spaceDecorator.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 // Each heap region is self contained. top() and end() can never
50 // be set beyond the end of the region. For humongous objects,
51 // the first region is a StartsHumongous region. If the humongous
52 // object is larger than a heap region, the following regions will
53 // be of type ContinuesHumongous. In this case the top() of the
54 // StartHumongous region and all ContinuesHumongous regions except
55 // the last will point to their own end. The last ContinuesHumongous
56 // region may have top() equal the end of object if there isn't
57 // room for filler objects to pad out to the end of the region.
58
59 class G1CollectedHeap;
60 class G1CMBitMap;
61 class G1IsAliveAndApplyClosure;
62 class HeapRegionRemSet;
63 class HeapRegion;
64 class HeapRegionSetBase;
65 class nmethod;
66
67 #define HR_FORMAT "%u:(%s)[" PTR_FORMAT "," PTR_FORMAT "," PTR_FORMAT "]"
68 #define HR_FORMAT_PARAMS(_hr_) \
69 (_hr_)->hrm_index(), \
70 (_hr_)->get_short_type_str(), \
71 p2i((_hr_)->bottom()), p2i((_hr_)->top()), p2i((_hr_)->end())
72
73 // sentinel value for hrm_index
74 #define G1_NO_HRM_INDEX ((uint) -1)
75
76 // The complicating factor is that BlockOffsetTable diverged
77 // significantly, and we need functionality that is only in the G1 version.
78 // So I copied that code, which led to an alternate G1 version of
79 // OffsetTableContigSpace. If the two versions of BlockOffsetTable could
80 // be reconciled, then G1OffsetTableContigSpace could go away.
81
82 // The idea behind time stamps is the following. We want to keep track of
83 // the highest address where it's safe to scan objects for each region.
84 // This is only relevant for current GC alloc regions so we keep a time stamp
85 // per region to determine if the region has been allocated during the current
86 // GC or not. If the time stamp is current we report a scan_top value which
87 // was saved at the end of the previous GC for retained alloc regions and which is
88 // equal to the bottom for all other regions.
89 // There is a race between card scanners and allocating gc workers where we must ensure
90 // that card scanners do not read the memory allocated by the gc workers.
91 // In order to enforce that, we must not return a value of _top which is more recent than the
92 // time stamp. This is due to the fact that a region may become a gc alloc region at
93 // some point after we've read the timestamp value as being < the current time stamp.
94 // The time stamps are re-initialized to zero at cleanup and at Full GCs.
95 // The current scheme that uses sequential unsigned ints will fail only if we have 4b
96 // evacuation pauses between two cleanups, which is _highly_ unlikely.
97 class G1ContiguousSpace: public CompactibleSpace {
98 friend class VMStructs;
99 HeapWord* volatile _top;
100 protected:
101 G1BlockOffsetTablePart _bot_part;
102 Mutex _par_alloc_lock;
103 // When we need to retire an allocation region, while other threads
104 // are also concurrently trying to allocate into it, we typically
105 // allocate a dummy object at the end of the region to ensure that
106 // no more allocations can take place in it. However, sometimes we
107 // want to know where the end of the last "real" object we allocated
108 // into the region was and this is what this keeps track.
109 HeapWord* _pre_dummy_top;
110
111 public:
112 G1ContiguousSpace(G1BlockOffsetTable* bot);
113
114 void set_top(HeapWord* value) { _top = value; }
115 HeapWord* top() const { return _top; }
116
117 protected:
118 // Reset the G1ContiguousSpace.
119 virtual void initialize(MemRegion mr, bool clear_space, bool mangle_space);
120
121 HeapWord* volatile* top_addr() { return &_top; }
122 // Try to allocate at least min_word_size and up to desired_size from this Space.
123 // Returns NULL if not possible, otherwise sets actual_word_size to the amount of
124 // space allocated.
125 // This version assumes that all allocation requests to this Space are properly
126 // synchronized.
127 inline HeapWord* allocate_impl(size_t min_word_size, size_t desired_word_size, size_t* actual_word_size);
128 // Try to allocate at least min_word_size and up to desired_size from this Space.
129 // Returns NULL if not possible, otherwise sets actual_word_size to the amount of
130 // space allocated.
131 // This version synchronizes with other calls to par_allocate_impl().
132 inline HeapWord* par_allocate_impl(size_t min_word_size, size_t desired_word_size, size_t* actual_word_size);
133
134 public:
135 void reset_after_compaction() { set_top(compaction_top()); }
136
137 size_t used() const { return byte_size(bottom(), top()); }
138 size_t free() const { return byte_size(top(), end()); }
139 bool is_free_block(const HeapWord* p) const { return p >= top(); }
140
141 MemRegion used_region() const { return MemRegion(bottom(), top()); }
142
143 void object_iterate(ObjectClosure* blk);
144 void safe_object_iterate(ObjectClosure* blk);
145
146 void mangle_unused_area() PRODUCT_RETURN;
147 void mangle_unused_area_complete() PRODUCT_RETURN;
148
149 // See the comment above in the declaration of _pre_dummy_top for an
150 // explanation of what it is.
151 void set_pre_dummy_top(HeapWord* pre_dummy_top) {
152 assert(is_in(pre_dummy_top) && pre_dummy_top <= top(), "pre-condition");
153 _pre_dummy_top = pre_dummy_top;
154 }
155 HeapWord* pre_dummy_top() {
156 return (_pre_dummy_top == NULL) ? top() : _pre_dummy_top;
157 }
158 void reset_pre_dummy_top() { _pre_dummy_top = NULL; }
159
160 virtual void clear(bool mangle_space);
161
162 HeapWord* block_start(const void* p);
163 HeapWord* block_start_const(const void* p) const;
164
165 // Allocation (return NULL if full). Assumes the caller has established
166 // mutually exclusive access to the space.
167 HeapWord* allocate(size_t min_word_size, size_t desired_word_size, size_t* actual_word_size);
168 // Allocation (return NULL if full). Enforces mutual exclusion internally.
169 HeapWord* par_allocate(size_t min_word_size, size_t desired_word_size, size_t* actual_word_size);
170
171 virtual HeapWord* allocate(size_t word_size);
172 virtual HeapWord* par_allocate(size_t word_size);
173
174 HeapWord* saved_mark_word() const { ShouldNotReachHere(); return NULL; }
175
176 // MarkSweep support phase3
177 virtual HeapWord* initialize_threshold();
178 virtual HeapWord* cross_threshold(HeapWord* start, HeapWord* end);
179
180 virtual void print() const;
181
182 void reset_bot() {
183 _bot_part.reset_bot();
184 }
185
186 void print_bot_on(outputStream* out) {
187 _bot_part.print_on(out);
188 }
189 };
190
191 class HeapRegion: public G1ContiguousSpace {
192 friend class VMStructs;
193 // Allow scan_and_forward to call (private) overrides for auxiliary functions on this class
194 template <typename SpaceType>
195 friend void CompactibleSpace::scan_and_forward(SpaceType* space, CompactPoint* cp);
196 private:
197
198 // The remembered set for this region.
199 // (Might want to make this "inline" later, to avoid some alloc failure
200 // issues.)
201 HeapRegionRemSet* _rem_set;
202
203 // Auxiliary functions for scan_and_forward support.
204 // See comments for CompactibleSpace for more information.
205 inline HeapWord* scan_limit() const {
206 return top();
207 }
208
209 inline bool scanned_block_is_obj(const HeapWord* addr) const {
210 return true; // Always true, since scan_limit is top
211 }
212
213 inline size_t scanned_block_size(const HeapWord* addr) const {
214 return HeapRegion::block_size(addr); // Avoid virtual call
215 }
216
217 void report_region_type_change(G1HeapRegionTraceType::Type to);
218
219 // Returns whether the given object address refers to a dead object, and either the
220 // size of the object (if live) or the size of the block (if dead) in size.
221 // May
222 // - only called with obj < top()
223 // - not called on humongous objects or archive regions
224 inline bool is_obj_dead_with_size(const oop obj, const G1CMBitMap* const prev_bitmap, size_t* size) const;
225
226 protected:
227 // The index of this region in the heap region sequence.
228 uint _hrm_index;
229
230 HeapRegionType _type;
231
232 // For a humongous region, region in which it starts.
233 HeapRegion* _humongous_start_region;
234
235 // True iff an attempt to evacuate an object in the region failed.
236 bool _evacuation_failed;
237
238 // Fields used by the HeapRegionSetBase class and subclasses.
239 HeapRegion* _next;
240 HeapRegion* _prev;
241 #ifdef ASSERT
242 HeapRegionSetBase* _containing_set;
243 #endif // ASSERT
244
245 // We use concurrent marking to determine the amount of live data
246 // in each heap region.
247 size_t _prev_marked_bytes; // Bytes known to be live via last completed marking.
248 size_t _next_marked_bytes; // Bytes known to be live via in-progress marking.
249
250 // The calculated GC efficiency of the region.
251 double _gc_efficiency;
252
253 static const uint InvalidCSetIndex = UINT_MAX;
254
255 // The index in the optional regions array, if this region
256 // is considered optional during a mixed collections.
257 uint _index_in_opt_cset;
258
259 // Data for young region survivor prediction.
260 uint _young_index_in_cset;
261 SurvRateGroup* _surv_rate_group;
262 int _age_index;
263
264 // The start of the unmarked area. The unmarked area extends from this
265 // word until the top and/or end of the region, and is the part
266 // of the region for which no marking was done, i.e. objects may
267 // have been allocated in this part since the last mark phase.
268 // "prev" is the top at the start of the last completed marking.
269 // "next" is the top at the start of the in-progress marking (if any.)
270 HeapWord* _prev_top_at_mark_start;
271 HeapWord* _next_top_at_mark_start;
272 // If a collection pause is in progress, this is the top at the start
273 // of that pause.
274
275 void init_top_at_mark_start() {
276 assert(_prev_marked_bytes == 0 &&
277 _next_marked_bytes == 0,
278 "Must be called after zero_marked_bytes.");
279 HeapWord* bot = bottom();
280 _prev_top_at_mark_start = bot;
281 _next_top_at_mark_start = bot;
282 }
283
284 // Cached attributes used in the collection set policy information
285
286 // The RSet length that was added to the total value
287 // for the collection set.
288 size_t _recorded_rs_length;
289
290 // The predicted elapsed time that was added to total value
291 // for the collection set.
292 double _predicted_elapsed_time_ms;
293
294 uint _node_index;
295
296 // Iterate over the references covered by the given MemRegion in a humongous
297 // object and apply the given closure to them.
298 // Humongous objects are allocated directly in the old-gen. So we need special
299 // handling for concurrent processing encountering an in-progress allocation.
300 // Returns the address after the last actually scanned or NULL if the area could
301 // not be scanned (That should only happen when invoked concurrently with the
302 // mutator).
303 template <class Closure, bool is_gc_active>
304 inline HeapWord* do_oops_on_memregion_in_humongous(MemRegion mr,
305 Closure* cl,
306 G1CollectedHeap* g1h);
307
308 // Returns the block size of the given (dead, potentially having its class unloaded) object
309 // starting at p extending to at most the prev TAMS using the given mark bitmap.
310 inline size_t block_size_using_bitmap(const HeapWord* p, const G1CMBitMap* const prev_bitmap) const;
311 public:
312 HeapRegion(uint hrm_index,
313 G1BlockOffsetTable* bot,
314 MemRegion mr);
315
316 // Initializing the HeapRegion not only resets the data structure, but also
317 // resets the BOT for that heap region.
318 // The default values for clear_space means that we will do the clearing if
319 // there's clearing to be done ourselves. We also always mangle the space.
320 virtual void initialize(MemRegion mr, bool clear_space = false, bool mangle_space = SpaceDecorator::Mangle);
321
322 static int LogOfHRGrainBytes;
323 static int LogOfHRGrainWords;
324 static int LogCardsPerRegion;
325
326 static size_t GrainBytes;
327 static size_t GrainWords;
328 static size_t CardsPerRegion;
329
330 static size_t align_up_to_region_byte_size(size_t sz) {
331 return (sz + (size_t) GrainBytes - 1) &
332 ~((1 << (size_t) LogOfHRGrainBytes) - 1);
333 }
334
335
336 // Returns whether a field is in the same region as the obj it points to.
337 template <typename T>
338 static bool is_in_same_region(T* p, oop obj) {
339 assert(p != NULL, "p can't be NULL");
340 assert(obj != NULL, "obj can't be NULL");
341 return (((uintptr_t) p ^ cast_from_oop<uintptr_t>(obj)) >> LogOfHRGrainBytes) == 0;
342 }
343
344 static size_t max_region_size();
345 static size_t min_region_size_in_words();
346
347 // It sets up the heap region size (GrainBytes / GrainWords), as
348 // well as other related fields that are based on the heap region
349 // size (LogOfHRGrainBytes / LogOfHRGrainWords /
350 // CardsPerRegion). All those fields are considered constant
351 // throughout the JVM's execution, therefore they should only be set
352 // up once during initialization time.
353 static void setup_heap_region_size(size_t initial_heap_size, size_t max_heap_size);
354
355 // All allocated blocks are occupied by objects in a HeapRegion
356 bool block_is_obj(const HeapWord* p) const;
357
358 // Returns whether the given object is dead based on TAMS and bitmap.
359 bool is_obj_dead(const oop obj, const G1CMBitMap* const prev_bitmap) const;
360
361 // Returns the object size for all valid block starts
362 // and the amount of unallocated words if called on top()
363 size_t block_size(const HeapWord* p) const;
364
365 // Scans through the region using the bitmap to determine what
366 // objects to call size_t ApplyToMarkedClosure::apply(oop) for.
367 template<typename ApplyToMarkedClosure>
368 inline void apply_to_marked_objects(G1CMBitMap* bitmap, ApplyToMarkedClosure* closure);
369 // Override for scan_and_forward support.
370 void prepare_for_compaction(CompactPoint* cp);
371 // Update heap region to be consistent after compaction.
372 void complete_compaction();
373
374 inline HeapWord* par_allocate_no_bot_updates(size_t min_word_size, size_t desired_word_size, size_t* word_size);
375 inline HeapWord* allocate_no_bot_updates(size_t word_size);
376 inline HeapWord* allocate_no_bot_updates(size_t min_word_size, size_t desired_word_size, size_t* actual_size);
377
378 // If this region is a member of a HeapRegionManager, the index in that
379 // sequence, otherwise -1.
380 uint hrm_index() const { return _hrm_index; }
381
382 // The number of bytes marked live in the region in the last marking phase.
383 size_t marked_bytes() { return _prev_marked_bytes; }
384 size_t live_bytes() {
385 return (top() - prev_top_at_mark_start()) * HeapWordSize + marked_bytes();
386 }
387
388 // The number of bytes counted in the next marking.
389 size_t next_marked_bytes() { return _next_marked_bytes; }
390 // The number of bytes live wrt the next marking.
391 size_t next_live_bytes() {
392 return
393 (top() - next_top_at_mark_start()) * HeapWordSize + next_marked_bytes();
394 }
395
396 // A lower bound on the amount of garbage bytes in the region.
397 size_t garbage_bytes() {
398 size_t used_at_mark_start_bytes =
399 (prev_top_at_mark_start() - bottom()) * HeapWordSize;
400 return used_at_mark_start_bytes - marked_bytes();
401 }
402
403 // Return the amount of bytes we'll reclaim if we collect this
404 // region. This includes not only the known garbage bytes in the
405 // region but also any unallocated space in it, i.e., [top, end),
406 // since it will also be reclaimed if we collect the region.
407 size_t reclaimable_bytes() {
408 size_t known_live_bytes = live_bytes();
409 assert(known_live_bytes <= capacity(), "sanity");
410 return capacity() - known_live_bytes;
411 }
412
413 // An upper bound on the number of live bytes in the region.
414 size_t max_live_bytes() { return used() - garbage_bytes(); }
415
416 void add_to_marked_bytes(size_t incr_bytes) {
417 _next_marked_bytes = _next_marked_bytes + incr_bytes;
418 }
419
420 void zero_marked_bytes() {
421 _prev_marked_bytes = _next_marked_bytes = 0;
422 }
423
424 const char* get_type_str() const { return _type.get_str(); }
425 const char* get_short_type_str() const { return _type.get_short_str(); }
426 G1HeapRegionTraceType::Type get_trace_type() { return _type.get_trace_type(); }
427
428 bool is_free() const { return _type.is_free(); }
429
430 bool is_young() const { return _type.is_young(); }
431 bool is_eden() const { return _type.is_eden(); }
432 bool is_survivor() const { return _type.is_survivor(); }
433
434 bool is_humongous() const { return _type.is_humongous(); }
435 bool is_starts_humongous() const { return _type.is_starts_humongous(); }
436 bool is_continues_humongous() const { return _type.is_continues_humongous(); }
437
438 bool is_old() const { return _type.is_old(); }
439
440 bool is_old_or_humongous() const { return _type.is_old_or_humongous(); }
441
442 bool is_old_or_humongous_or_archive() const { return _type.is_old_or_humongous_or_archive(); }
443
444 // A pinned region contains objects which are not moved by garbage collections.
445 // Humongous regions and archive regions are pinned.
446 bool is_pinned() const { return _type.is_pinned(); }
447
448 // An archive region is a pinned region, also tagged as old, which
449 // should not be marked during mark/sweep. This allows the address
450 // space to be shared by JVM instances.
451 bool is_archive() const { return _type.is_archive(); }
452 bool is_open_archive() const { return _type.is_open_archive(); }
453 bool is_closed_archive() const { return _type.is_closed_archive(); }
454
455 // For a humongous region, region in which it starts.
456 HeapRegion* humongous_start_region() const {
457 return _humongous_start_region;
458 }
459
460 // Makes the current region be a "starts humongous" region, i.e.,
461 // the first region in a series of one or more contiguous regions
462 // that will contain a single "humongous" object.
463 //
464 // obj_top : points to the top of the humongous object.
465 // fill_size : size of the filler object at the end of the region series.
466 void set_starts_humongous(HeapWord* obj_top, size_t fill_size);
467
468 // Makes the current region be a "continues humongous'
469 // region. first_hr is the "start humongous" region of the series
470 // which this region will be part of.
471 void set_continues_humongous(HeapRegion* first_hr);
472
473 // Unsets the humongous-related fields on the region.
474 void clear_humongous();
475
476 // If the region has a remembered set, return a pointer to it.
477 HeapRegionRemSet* rem_set() const {
478 return _rem_set;
479 }
480
481 inline bool in_collection_set() const;
482
483 // Methods used by the HeapRegionSetBase class and subclasses.
484
485 // Getter and setter for the next and prev fields used to link regions into
486 // linked lists.
487 HeapRegion* next() { return _next; }
488 HeapRegion* prev() { return _prev; }
489
490 void set_next(HeapRegion* next) { _next = next; }
491 void set_prev(HeapRegion* prev) { _prev = prev; }
492
493 // Every region added to a set is tagged with a reference to that
494 // set. This is used for doing consistency checking to make sure that
495 // the contents of a set are as they should be and it's only
496 // available in non-product builds.
497 #ifdef ASSERT
498 void set_containing_set(HeapRegionSetBase* containing_set) {
499 assert((containing_set == NULL && _containing_set != NULL) ||
500 (containing_set != NULL && _containing_set == NULL),
501 "containing_set: " PTR_FORMAT " "
502 "_containing_set: " PTR_FORMAT,
503 p2i(containing_set), p2i(_containing_set));
504
505 _containing_set = containing_set;
506 }
507
508 HeapRegionSetBase* containing_set() { return _containing_set; }
509 #else // ASSERT
510 void set_containing_set(HeapRegionSetBase* containing_set) { }
511
512 // containing_set() is only used in asserts so there's no reason
513 // to provide a dummy version of it.
514 #endif // ASSERT
515
516
517 // Reset the HeapRegion to default values.
518 // If skip_remset is true, do not clear the remembered set.
519 // If clear_space is true, clear the HeapRegion's memory.
520 // If locked is true, assume we are the only thread doing this operation.
521 void hr_clear(bool skip_remset, bool clear_space, bool locked = false);
522 // Clear the card table corresponding to this region.
523 void clear_cardtable();
524
525 // Get the start of the unmarked area in this region.
526 HeapWord* prev_top_at_mark_start() const { return _prev_top_at_mark_start; }
527 HeapWord* next_top_at_mark_start() const { return _next_top_at_mark_start; }
528
529 // Note the start or end of marking. This tells the heap region
530 // that the collector is about to start or has finished (concurrently)
531 // marking the heap.
532
533 // Notify the region that concurrent marking is starting. Initialize
534 // all fields related to the next marking info.
535 inline void note_start_of_marking();
536
537 // Notify the region that concurrent marking has finished. Copy the
538 // (now finalized) next marking info fields into the prev marking
539 // info fields.
540 inline void note_end_of_marking();
541
542 // Notify the region that we are about to start processing
543 // self-forwarded objects during evac failure handling.
544 void note_self_forwarding_removal_start(bool during_initial_mark,
545 bool during_conc_mark);
546
547 // Notify the region that we have finished processing self-forwarded
548 // objects during evac failure handling.
549 void note_self_forwarding_removal_end(size_t marked_bytes);
550
551 void reset_during_compaction() {
552 assert(is_humongous(),
553 "should only be called for humongous regions");
554
555 zero_marked_bytes();
556 init_top_at_mark_start();
557 }
558
559 void calc_gc_efficiency(void);
560 double gc_efficiency() const { return _gc_efficiency;}
561
562 uint index_in_opt_cset() const {
563 assert(has_index_in_opt_cset(), "Opt cset index not set.");
564 return _index_in_opt_cset;
565 }
566 bool has_index_in_opt_cset() const { return _index_in_opt_cset != InvalidCSetIndex; }
567 void set_index_in_opt_cset(uint index) { _index_in_opt_cset = index; }
568 void clear_index_in_opt_cset() { _index_in_opt_cset = InvalidCSetIndex; }
569
570 uint young_index_in_cset() const { return _young_index_in_cset; }
571 void clear_young_index_in_cset() { _young_index_in_cset = 0; }
572 void set_young_index_in_cset(uint index) {
573 assert(index != UINT_MAX, "just checking");
574 assert(index != 0, "just checking");
575 assert(is_young(), "pre-condition");
576 _young_index_in_cset = index;
577 }
578
579 int age_in_surv_rate_group() {
580 assert(_surv_rate_group != NULL, "pre-condition");
581 assert(_age_index > -1, "pre-condition");
582 return _surv_rate_group->age_in_group(_age_index);
583 }
584
585 void record_surv_words_in_group(size_t words_survived) {
586 assert(_surv_rate_group != NULL, "pre-condition");
587 assert(_age_index > -1, "pre-condition");
588 int age_in_group = age_in_surv_rate_group();
589 _surv_rate_group->record_surviving_words(age_in_group, words_survived);
590 }
591
592 int age_in_surv_rate_group_cond() {
593 if (_surv_rate_group != NULL)
594 return age_in_surv_rate_group();
595 else
596 return -1;
597 }
598
599 SurvRateGroup* surv_rate_group() {
600 return _surv_rate_group;
601 }
602
603 void install_surv_rate_group(SurvRateGroup* surv_rate_group) {
604 assert(surv_rate_group != NULL, "pre-condition");
605 assert(_surv_rate_group == NULL, "pre-condition");
606 assert(is_young(), "pre-condition");
607
608 _surv_rate_group = surv_rate_group;
609 _age_index = surv_rate_group->next_age_index();
610 }
611
612 void uninstall_surv_rate_group() {
613 if (_surv_rate_group != NULL) {
614 assert(_age_index > -1, "pre-condition");
615 assert(is_young(), "pre-condition");
616
617 _surv_rate_group = NULL;
618 _age_index = -1;
619 } else {
620 assert(_age_index == -1, "pre-condition");
621 }
622 }
623
624 void set_free();
625
626 void set_eden();
627 void set_eden_pre_gc();
628 void set_survivor();
629
630 void move_to_old();
631 void set_old();
632
633 void set_open_archive();
634 void set_closed_archive();
635
636 // Determine if an object has been allocated since the last
637 // mark performed by the collector. This returns true iff the object
638 // is within the unmarked area of the region.
639 bool obj_allocated_since_prev_marking(oop obj) const {
640 return (HeapWord *) obj >= prev_top_at_mark_start();
641 }
642 bool obj_allocated_since_next_marking(oop obj) const {
643 return (HeapWord *) obj >= next_top_at_mark_start();
644 }
645
646 // Returns the "evacuation_failed" property of the region.
647 bool evacuation_failed() { return _evacuation_failed; }
648
649 // Sets the "evacuation_failed" property of the region.
650 void set_evacuation_failed(bool b) {
651 _evacuation_failed = b;
652
653 if (b) {
654 _next_marked_bytes = 0;
655 }
656 }
657
658 // Iterate over the objects overlapping the given memory region, applying cl
659 // to all references in the region. This is a helper for
660 // G1RemSet::refine_card*, and is tightly coupled with them.
661 // mr must not be empty. Must be trimmed to the allocated/parseable space in this region.
662 // This region must be old or humongous.
663 // Returns the next unscanned address if the designated objects were successfully
664 // processed, NULL if an unparseable part of the heap was encountered (That should
665 // only happen when invoked concurrently with the mutator).
666 template <bool is_gc_active, class Closure>
667 inline HeapWord* oops_on_memregion_seq_iterate_careful(MemRegion mr, Closure* cl);
668
669 size_t recorded_rs_length() const { return _recorded_rs_length; }
670 double predicted_elapsed_time_ms() const { return _predicted_elapsed_time_ms; }
671
672 void set_recorded_rs_length(size_t rs_length) {
673 _recorded_rs_length = rs_length;
674 }
675
676 void set_predicted_elapsed_time_ms(double ms) {
677 _predicted_elapsed_time_ms = ms;
678 }
679
680 // Routines for managing a list of code roots (attached to the
681 // this region's RSet) that point into this heap region.
682 void add_strong_code_root(nmethod* nm);
683 void add_strong_code_root_locked(nmethod* nm);
684 void remove_strong_code_root(nmethod* nm);
685
686 // Applies blk->do_code_blob() to each of the entries in
687 // the strong code roots list for this region
688 void strong_code_roots_do(CodeBlobClosure* blk) const;
689
690 uint node_index() const { return _node_index; }
691 void set_node_index(uint node_index) { _node_index = node_index; }
692
693 // Verify that the entries on the strong code root list for this
694 // region are live and include at least one pointer into this region.
695 void verify_strong_code_roots(VerifyOption vo, bool* failures) const;
696
697 void print() const;
698 void print_on(outputStream* st) const;
699
700 // vo == UsePrevMarking -> use "prev" marking information,
701 // vo == UseNextMarking -> use "next" marking information
702 // vo == UseFullMarking -> use "next" marking bitmap but no TAMS
703 //
704 // NOTE: Only the "prev" marking information is guaranteed to be
705 // consistent most of the time, so most calls to this should use
706 // vo == UsePrevMarking.
707 // Currently, there is only one case where this is called with
708 // vo == UseNextMarking, which is to verify the "next" marking
709 // information at the end of remark.
710 // Currently there is only one place where this is called with
711 // vo == UseFullMarking, which is to verify the marking during a
712 // full GC.
713 void verify(VerifyOption vo, bool *failures) const;
714
715 // Override; it uses the "prev" marking information
716 virtual void verify() const;
717
718 void verify_rem_set(VerifyOption vo, bool *failures) const;
719 void verify_rem_set() const;
720 };
721
722 // HeapRegionClosure is used for iterating over regions.
723 // Terminates the iteration when the "do_heap_region" method returns "true".
724 class HeapRegionClosure : public StackObj {
725 friend class HeapRegionManager;
726 friend class G1CollectionSet;
727 friend class G1CollectionSetCandidates;
728
729 bool _is_complete;
730 void set_incomplete() { _is_complete = false; }
731
732 public:
733 HeapRegionClosure(): _is_complete(true) {}
734
735 // Typically called on each region until it returns true.
736 virtual bool do_heap_region(HeapRegion* r) = 0;
737
738 // True after iteration if the closure was applied to all heap regions
739 // and returned "false" in all cases.
740 bool is_complete() { return _is_complete; }
741 };
742
743 #endif // SHARE_GC_G1_HEAPREGION_HPP