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