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