1 /*
2 * Copyright (c) 2005, 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_PARALLEL_PSPARALLELCOMPACT_HPP
26 #define SHARE_GC_PARALLEL_PSPARALLELCOMPACT_HPP
27
28 #include "gc/parallel/mutableSpace.hpp"
29 #include "gc/parallel/objectStartArray.hpp"
30 #include "gc/parallel/parMarkBitMap.hpp"
31 #include "gc/parallel/parallelScavengeHeap.hpp"
32 #include "gc/shared/collectedHeap.hpp"
33 #include "gc/shared/collectorCounters.hpp"
34 #include "oops/oop.hpp"
35
36 class ParallelScavengeHeap;
37 class PSAdaptiveSizePolicy;
38 class PSYoungGen;
39 class PSOldGen;
40 class ParCompactionManager;
41 class ParallelTaskTerminator;
42 class PSParallelCompact;
43 class PreGCValues;
44 class MoveAndUpdateClosure;
45 class RefProcTaskExecutor;
46 class ParallelOldTracer;
47 class STWGCTimer;
48
49 // The SplitInfo class holds the information needed to 'split' a source region
50 // so that the live data can be copied to two destination *spaces*. Normally,
51 // all the live data in a region is copied to a single destination space (e.g.,
52 // everything live in a region in eden is copied entirely into the old gen).
53 // However, when the heap is nearly full, all the live data in eden may not fit
54 // into the old gen. Copying only some of the regions from eden to old gen
55 // requires finding a region that does not contain a partial object (i.e., no
56 // live object crosses the region boundary) somewhere near the last object that
57 // does fit into the old gen. Since it's not always possible to find such a
58 // region, splitting is necessary for predictable behavior.
59 //
60 // A region is always split at the end of the partial object. This avoids
61 // additional tests when calculating the new location of a pointer, which is a
62 // very hot code path. The partial object and everything to its left will be
63 // copied to another space (call it dest_space_1). The live data to the right
64 // of the partial object will be copied either within the space itself, or to a
65 // different destination space (distinct from dest_space_1).
66 //
67 // Split points are identified during the summary phase, when region
68 // destinations are computed: data about the split, including the
69 // partial_object_size, is recorded in a SplitInfo record and the
70 // partial_object_size field in the summary data is set to zero. The zeroing is
71 // possible (and necessary) since the partial object will move to a different
72 // destination space than anything to its right, thus the partial object should
73 // not affect the locations of any objects to its right.
74 //
75 // The recorded data is used during the compaction phase, but only rarely: when
76 // the partial object on the split region will be copied across a destination
77 // region boundary. This test is made once each time a region is filled, and is
78 // a simple address comparison, so the overhead is negligible (see
79 // PSParallelCompact::first_src_addr()).
80 //
81 // Notes:
82 //
83 // Only regions with partial objects are split; a region without a partial
84 // object does not need any extra bookkeeping.
85 //
86 // At most one region is split per space, so the amount of data required is
87 // constant.
88 //
89 // A region is split only when the destination space would overflow. Once that
90 // happens, the destination space is abandoned and no other data (even from
91 // other source spaces) is targeted to that destination space. Abandoning the
92 // destination space may leave a somewhat large unused area at the end, if a
93 // large object caused the overflow.
94 //
95 // Future work:
96 //
97 // More bookkeeping would be required to continue to use the destination space.
98 // The most general solution would allow data from regions in two different
99 // source spaces to be "joined" in a single destination region. At the very
100 // least, additional code would be required in next_src_region() to detect the
101 // join and skip to an out-of-order source region. If the join region was also
102 // the last destination region to which a split region was copied (the most
103 // likely case), then additional work would be needed to get fill_region() to
104 // stop iteration and switch to a new source region at the right point. Basic
105 // idea would be to use a fake value for the top of the source space. It is
106 // doable, if a bit tricky.
107 //
108 // A simpler (but less general) solution would fill the remainder of the
109 // destination region with a dummy object and continue filling the next
110 // destination region.
111
112 class SplitInfo
113 {
114 public:
115 // Return true if this split info is valid (i.e., if a split has been
116 // recorded). The very first region cannot have a partial object and thus is
117 // never split, so 0 is the 'invalid' value.
118 bool is_valid() const { return _src_region_idx > 0; }
119
120 // Return true if this split holds data for the specified source region.
121 inline bool is_split(size_t source_region) const;
122
123 // The index of the split region, the size of the partial object on that
124 // region and the destination of the partial object.
125 size_t src_region_idx() const { return _src_region_idx; }
126 size_t partial_obj_size() const { return _partial_obj_size; }
127 HeapWord* destination() const { return _destination; }
128
129 // The destination count of the partial object referenced by this split
130 // (either 1 or 2). This must be added to the destination count of the
131 // remainder of the source region.
132 unsigned int destination_count() const { return _destination_count; }
133
134 // If a word within the partial object will be written to the first word of a
135 // destination region, this is the address of the destination region;
136 // otherwise this is NULL.
137 HeapWord* dest_region_addr() const { return _dest_region_addr; }
138
139 // If a word within the partial object will be written to the first word of a
140 // destination region, this is the address of that word within the partial
141 // object; otherwise this is NULL.
142 HeapWord* first_src_addr() const { return _first_src_addr; }
143
144 // Record the data necessary to split the region src_region_idx.
145 void record(size_t src_region_idx, size_t partial_obj_size,
146 HeapWord* destination);
147
148 void clear();
149
150 DEBUG_ONLY(void verify_clear();)
151
152 private:
153 size_t _src_region_idx;
154 size_t _partial_obj_size;
155 HeapWord* _destination;
156 unsigned int _destination_count;
157 HeapWord* _dest_region_addr;
158 HeapWord* _first_src_addr;
159 };
160
161 inline bool SplitInfo::is_split(size_t region_idx) const
162 {
163 return _src_region_idx == region_idx && is_valid();
164 }
165
166 class SpaceInfo
167 {
168 public:
169 MutableSpace* space() const { return _space; }
170
171 // Where the free space will start after the collection. Valid only after the
172 // summary phase completes.
173 HeapWord* new_top() const { return _new_top; }
174
175 // Allows new_top to be set.
176 HeapWord** new_top_addr() { return &_new_top; }
177
178 // Where the smallest allowable dense prefix ends (used only for perm gen).
179 HeapWord* min_dense_prefix() const { return _min_dense_prefix; }
180
181 // Where the dense prefix ends, or the compacted region begins.
182 HeapWord* dense_prefix() const { return _dense_prefix; }
183
184 // The start array for the (generation containing the) space, or NULL if there
185 // is no start array.
186 ObjectStartArray* start_array() const { return _start_array; }
187
188 SplitInfo& split_info() { return _split_info; }
189
190 void set_space(MutableSpace* s) { _space = s; }
191 void set_new_top(HeapWord* addr) { _new_top = addr; }
192 void set_min_dense_prefix(HeapWord* addr) { _min_dense_prefix = addr; }
193 void set_dense_prefix(HeapWord* addr) { _dense_prefix = addr; }
194 void set_start_array(ObjectStartArray* s) { _start_array = s; }
195
196 void publish_new_top() const { _space->set_top(_new_top); }
197
198 private:
199 MutableSpace* _space;
200 HeapWord* _new_top;
201 HeapWord* _min_dense_prefix;
202 HeapWord* _dense_prefix;
203 ObjectStartArray* _start_array;
204 SplitInfo _split_info;
205 };
206
207 class ParallelCompactData
208 {
209 public:
210 // Sizes are in HeapWords, unless indicated otherwise.
211 static const size_t Log2RegionSize;
212 static const size_t RegionSize;
213 static const size_t RegionSizeBytes;
214
215 // Mask for the bits in a size_t to get an offset within a region.
216 static const size_t RegionSizeOffsetMask;
217 // Mask for the bits in a pointer to get an offset within a region.
218 static const size_t RegionAddrOffsetMask;
219 // Mask for the bits in a pointer to get the address of the start of a region.
220 static const size_t RegionAddrMask;
221
222 static const size_t Log2BlockSize;
223 static const size_t BlockSize;
224 static const size_t BlockSizeBytes;
225
226 static const size_t BlockSizeOffsetMask;
227 static const size_t BlockAddrOffsetMask;
228 static const size_t BlockAddrMask;
229
230 static const size_t BlocksPerRegion;
231 static const size_t Log2BlocksPerRegion;
232
233 class RegionData
234 {
235 public:
236 // Destination address of the region.
237 HeapWord* destination() const { return _destination; }
238
239 // The first region containing data destined for this region.
240 size_t source_region() const { return _source_region; }
241
242 // Reuse _source_region to store the corresponding shadow region index
243 size_t shadow_region() const { return _source_region; }
244
245 // The object (if any) starting in this region and ending in a different
246 // region that could not be updated during the main (parallel) compaction
247 // phase. This is different from _partial_obj_addr, which is an object that
248 // extends onto a source region. However, the two uses do not overlap in
249 // time, so the same field is used to save space.
250 HeapWord* deferred_obj_addr() const { return _partial_obj_addr; }
251
252 // The starting address of the partial object extending onto the region.
253 HeapWord* partial_obj_addr() const { return _partial_obj_addr; }
254
255 // Size of the partial object extending onto the region (words).
256 size_t partial_obj_size() const { return _partial_obj_size; }
257
258 // Size of live data that lies within this region due to objects that start
259 // in this region (words). This does not include the partial object
260 // extending onto the region (if any), or the part of an object that extends
261 // onto the next region (if any).
262 size_t live_obj_size() const { return _dc_and_los & los_mask; }
263
264 // Total live data that lies within the region (words).
265 size_t data_size() const { return partial_obj_size() + live_obj_size(); }
266
267 // The destination_count is the number of other regions to which data from
268 // this region will be copied. At the end of the summary phase, the valid
269 // values of destination_count are
270 //
271 // 0 - data from the region will be compacted completely into itself, or the
272 // region is empty. The region can be claimed and then filled.
273 // 1 - data from the region will be compacted into 1 other region; some
274 // data from the region may also be compacted into the region itself.
275 // 2 - data from the region will be copied to 2 other regions.
276 //
277 // During compaction as regions are emptied, the destination_count is
278 // decremented (atomically) and when it reaches 0, it can be claimed and
279 // then filled.
280 //
281 // A region is claimed for processing by atomically changing the
282 // destination_count to the claimed value (dc_claimed). After a region has
283 // been filled, the destination_count should be set to the completed value
284 // (dc_completed).
285 inline uint destination_count() const;
286 inline uint destination_count_raw() const;
287
288 // Whether the block table for this region has been filled.
289 inline bool blocks_filled() const;
290
291 // Number of times the block table was filled.
292 DEBUG_ONLY(inline size_t blocks_filled_count() const;)
293
294 // The location of the java heap data that corresponds to this region.
295 inline HeapWord* data_location() const;
296
297 // The highest address referenced by objects in this region.
298 inline HeapWord* highest_ref() const;
299
300 // Whether this region is available to be claimed, has been claimed, or has
301 // been completed.
302 //
303 // Minor subtlety: claimed() returns true if the region is marked
304 // completed(), which is desirable since a region must be claimed before it
305 // can be completed.
306 bool available() const { return _dc_and_los < dc_one; }
307 bool claimed() const { return _dc_and_los >= dc_claimed; }
308 bool completed() const { return _dc_and_los >= dc_completed; }
309
310 // These are not atomic.
311 void set_destination(HeapWord* addr) { _destination = addr; }
312 void set_source_region(size_t region) { _source_region = region; }
313 void set_shadow_region(size_t region) { _source_region = region; }
314 void set_deferred_obj_addr(HeapWord* addr) { _partial_obj_addr = addr; }
315 void set_partial_obj_addr(HeapWord* addr) { _partial_obj_addr = addr; }
316 void set_partial_obj_size(size_t words) {
317 _partial_obj_size = (region_sz_t) words;
318 }
319 inline void set_blocks_filled();
320
321 inline void set_destination_count(uint count);
322 inline void set_live_obj_size(size_t words);
323 inline void set_data_location(HeapWord* addr);
324 inline void set_completed();
325 inline bool claim_unsafe();
326
327 // These are atomic.
328 inline void add_live_obj(size_t words);
329 inline void set_highest_ref(HeapWord* addr);
330 inline void decrement_destination_count();
331 inline bool claim();
332
333 // Possible values of _shadow_state, and transition is as follows
334 // Normal Path:
335 // UNUSED -> try_push() -> FINISHED
336 // Steal Path:
337 // UNUSED -> try_steal() -> SHADOW -> mark_filled() -> FILLED -> try_copy() -> FINISHED
338 static const int UNUSED; // Original state
339 static const int SHADOW; // Stolen by an idle thread, and a shadow region is created for it
340 static const int FILLED; // Its shadow region has been filled and ready to be copied back
341 static const int FINISH; // Work has been done
342
343 // Preempt the region to avoid double processes
344 inline bool try_push();
345 inline bool try_steal();
346 // Mark the region as filled and ready to be copied back
347 inline void mark_filled();
348 // Preempt the region to copy the shadow region content back
349 inline bool try_copy();
350 // Special case: see the comment in PSParallelCompact::fill_shadow_region.
351 // Return to the normal path here
352 inline void mark_normal();
353
354
355 int shadow_state() { return _shadow_state; }
356
357 private:
358 // The type used to represent object sizes within a region.
359 typedef uint region_sz_t;
360
361 // Constants for manipulating the _dc_and_los field, which holds both the
362 // destination count and live obj size. The live obj size lives at the
363 // least significant end so no masking is necessary when adding.
364 static const region_sz_t dc_shift; // Shift amount.
365 static const region_sz_t dc_mask; // Mask for destination count.
366 static const region_sz_t dc_one; // 1, shifted appropriately.
367 static const region_sz_t dc_claimed; // Region has been claimed.
368 static const region_sz_t dc_completed; // Region has been completed.
369 static const region_sz_t los_mask; // Mask for live obj size.
370
371 HeapWord* _destination;
372 size_t _source_region;
373 HeapWord* _partial_obj_addr;
374 region_sz_t _partial_obj_size;
375 region_sz_t volatile _dc_and_los;
376 bool volatile _blocks_filled;
377 int volatile _shadow_state;
378
379 #ifdef ASSERT
380 size_t _blocks_filled_count; // Number of block table fills.
381
382 // These enable optimizations that are only partially implemented. Use
383 // debug builds to prevent the code fragments from breaking.
384 HeapWord* _data_location;
385 HeapWord* _highest_ref;
386 #endif // #ifdef ASSERT
387
388 #ifdef ASSERT
389 public:
390 uint _pushed; // 0 until region is pushed onto a stack
391 private:
392 #endif
393 };
394
395 // "Blocks" allow shorter sections of the bitmap to be searched. Each Block
396 // holds an offset, which is the amount of live data in the Region to the left
397 // of the first live object that starts in the Block.
398 class BlockData
399 {
400 public:
401 typedef unsigned short int blk_ofs_t;
402
403 blk_ofs_t offset() const { return _offset; }
404 void set_offset(size_t val) { _offset = (blk_ofs_t)val; }
405
406 private:
407 blk_ofs_t _offset;
408 };
409
410 public:
411 ParallelCompactData();
412 bool initialize(MemRegion covered_region);
413
414 size_t region_count() const { return _region_count; }
415 size_t reserved_byte_size() const { return _reserved_byte_size; }
416
417 // Convert region indices to/from RegionData pointers.
418 inline RegionData* region(size_t region_idx) const;
419 inline size_t region(const RegionData* const region_ptr) const;
420
421 size_t block_count() const { return _block_count; }
422 inline BlockData* block(size_t block_idx) const;
423 inline size_t block(const BlockData* block_ptr) const;
424
425 void add_obj(HeapWord* addr, size_t len);
426 void add_obj(oop p, size_t len) { add_obj((HeapWord*)p, len); }
427
428 // Fill in the regions covering [beg, end) so that no data moves; i.e., the
429 // destination of region n is simply the start of region n. The argument beg
430 // must be region-aligned; end need not be.
431 void summarize_dense_prefix(HeapWord* beg, HeapWord* end);
432
433 HeapWord* summarize_split_space(size_t src_region, SplitInfo& split_info,
434 HeapWord* destination, HeapWord* target_end,
435 HeapWord** target_next);
436 bool summarize(SplitInfo& split_info,
437 HeapWord* source_beg, HeapWord* source_end,
438 HeapWord** source_next,
439 HeapWord* target_beg, HeapWord* target_end,
440 HeapWord** target_next);
441
442 void clear();
443 void clear_range(size_t beg_region, size_t end_region);
444 void clear_range(HeapWord* beg, HeapWord* end) {
445 clear_range(addr_to_region_idx(beg), addr_to_region_idx(end));
446 }
447
448 // Return the number of words between addr and the start of the region
449 // containing addr.
450 inline size_t region_offset(const HeapWord* addr) const;
451
452 // Convert addresses to/from a region index or region pointer.
453 inline size_t addr_to_region_idx(const HeapWord* addr) const;
454 inline RegionData* addr_to_region_ptr(const HeapWord* addr) const;
455 inline HeapWord* region_to_addr(size_t region) const;
456 inline HeapWord* region_to_addr(size_t region, size_t offset) const;
457 inline HeapWord* region_to_addr(const RegionData* region) const;
458
459 inline HeapWord* region_align_down(HeapWord* addr) const;
460 inline HeapWord* region_align_up(HeapWord* addr) const;
461 inline bool is_region_aligned(HeapWord* addr) const;
462
463 // Analogous to region_offset() for blocks.
464 size_t block_offset(const HeapWord* addr) const;
465 size_t addr_to_block_idx(const HeapWord* addr) const;
466 size_t addr_to_block_idx(const oop obj) const {
467 return addr_to_block_idx((HeapWord*) obj);
468 }
469 inline BlockData* addr_to_block_ptr(const HeapWord* addr) const;
470 inline HeapWord* block_to_addr(size_t block) const;
471 inline size_t region_to_block_idx(size_t region) const;
472
473 inline HeapWord* block_align_down(HeapWord* addr) const;
474 inline HeapWord* block_align_up(HeapWord* addr) const;
475 inline bool is_block_aligned(HeapWord* addr) const;
476
477 // Return the address one past the end of the partial object.
478 HeapWord* partial_obj_end(size_t region_idx) const;
479
480 // Return the location of the object after compaction.
481 HeapWord* calc_new_pointer(HeapWord* addr, ParCompactionManager* cm);
482
483 HeapWord* calc_new_pointer(oop p, ParCompactionManager* cm) {
484 return calc_new_pointer((HeapWord*) p, cm);
485 }
486
487 #ifdef ASSERT
488 void verify_clear(const PSVirtualSpace* vspace);
489 void verify_clear();
490 #endif // #ifdef ASSERT
491
492 private:
493 bool initialize_block_data();
494 bool initialize_region_data(size_t region_size);
495 PSVirtualSpace* create_vspace(size_t count, size_t element_size);
496
497 private:
498 HeapWord* _region_start;
499 #ifdef ASSERT
500 HeapWord* _region_end;
501 #endif // #ifdef ASSERT
502
503 PSVirtualSpace* _region_vspace;
504 size_t _reserved_byte_size;
505 RegionData* _region_data;
506 size_t _region_count;
507
508 PSVirtualSpace* _block_vspace;
509 BlockData* _block_data;
510 size_t _block_count;
511 };
512
513 inline uint
514 ParallelCompactData::RegionData::destination_count_raw() const
515 {
516 return _dc_and_los & dc_mask;
517 }
518
519 inline uint
520 ParallelCompactData::RegionData::destination_count() const
521 {
522 return destination_count_raw() >> dc_shift;
523 }
524
525 inline bool
526 ParallelCompactData::RegionData::blocks_filled() const
527 {
528 bool result = _blocks_filled;
529 OrderAccess::acquire();
530 return result;
531 }
532
533 #ifdef ASSERT
534 inline size_t
535 ParallelCompactData::RegionData::blocks_filled_count() const
536 {
537 return _blocks_filled_count;
538 }
539 #endif // #ifdef ASSERT
540
541 inline void
542 ParallelCompactData::RegionData::set_blocks_filled()
543 {
544 OrderAccess::release();
545 _blocks_filled = true;
546 // Debug builds count the number of times the table was filled.
547 DEBUG_ONLY(Atomic::inc(&_blocks_filled_count));
548 }
549
550 inline void
551 ParallelCompactData::RegionData::set_destination_count(uint count)
552 {
553 assert(count <= (dc_completed >> dc_shift), "count too large");
554 const region_sz_t live_sz = (region_sz_t) live_obj_size();
555 _dc_and_los = (count << dc_shift) | live_sz;
556 }
557
558 inline void ParallelCompactData::RegionData::set_live_obj_size(size_t words)
559 {
560 assert(words <= los_mask, "would overflow");
561 _dc_and_los = destination_count_raw() | (region_sz_t)words;
562 }
563
564 inline void ParallelCompactData::RegionData::decrement_destination_count()
565 {
566 assert(_dc_and_los < dc_claimed, "already claimed");
567 assert(_dc_and_los >= dc_one, "count would go negative");
568 Atomic::add(dc_mask, &_dc_and_los);
569 }
570
571 inline HeapWord* ParallelCompactData::RegionData::data_location() const
572 {
573 DEBUG_ONLY(return _data_location;)
574 NOT_DEBUG(return NULL;)
575 }
576
577 inline HeapWord* ParallelCompactData::RegionData::highest_ref() const
578 {
579 DEBUG_ONLY(return _highest_ref;)
580 NOT_DEBUG(return NULL;)
581 }
582
583 inline void ParallelCompactData::RegionData::set_data_location(HeapWord* addr)
584 {
585 DEBUG_ONLY(_data_location = addr;)
586 }
587
588 inline void ParallelCompactData::RegionData::set_completed()
589 {
590 assert(claimed(), "must be claimed first");
591 _dc_and_los = dc_completed | (region_sz_t) live_obj_size();
592 }
593
594 // MT-unsafe claiming of a region. Should only be used during single threaded
595 // execution.
596 inline bool ParallelCompactData::RegionData::claim_unsafe()
597 {
598 if (available()) {
599 _dc_and_los |= dc_claimed;
600 return true;
601 }
602 return false;
603 }
604
605 inline void ParallelCompactData::RegionData::add_live_obj(size_t words)
606 {
607 assert(words <= (size_t)los_mask - live_obj_size(), "overflow");
608 Atomic::add(static_cast<region_sz_t>(words), &_dc_and_los);
609 }
610
611 inline void ParallelCompactData::RegionData::set_highest_ref(HeapWord* addr)
612 {
613 #ifdef ASSERT
614 HeapWord* tmp = _highest_ref;
615 while (addr > tmp) {
616 tmp = Atomic::cmpxchg(addr, &_highest_ref, tmp);
617 }
618 #endif // #ifdef ASSERT
619 }
620
621 inline bool ParallelCompactData::RegionData::claim()
622 {
623 const region_sz_t los = static_cast<region_sz_t>(live_obj_size());
624 const region_sz_t old = Atomic::cmpxchg(dc_claimed | los, &_dc_and_los, los);
625 return old == los;
626 }
627
628 inline bool ParallelCompactData::RegionData::try_push() {
629 return Atomic::cmpxchg(FINISH, &_shadow_state, UNUSED) == UNUSED;
630 }
631
632 inline bool ParallelCompactData::RegionData::try_steal() {
633 return Atomic::cmpxchg(SHADOW, &_shadow_state, UNUSED) == UNUSED;
634 }
635
636 inline void ParallelCompactData::RegionData::mark_filled() {
637 int old = Atomic::cmpxchg(FILLED, &_shadow_state, SHADOW);
638 assert(old == SHADOW, "Fail to mark the region as filled");
639 }
640
641 inline bool ParallelCompactData::RegionData::try_copy() {
642 return Atomic::cmpxchg(FINISH, &_shadow_state, FILLED) == FILLED;
643 }
644
645 void ParallelCompactData::RegionData::mark_normal() {
646 int old = Atomic::cmpxchg(FINISH, &_shadow_state, SHADOW);
647 assert(old == SHADOW, "Fail to mark the region as finish");
648 }
649
650 inline ParallelCompactData::RegionData*
651 ParallelCompactData::region(size_t region_idx) const
652 {
653 assert(region_idx <= region_count(), "bad arg");
654 return _region_data + region_idx;
655 }
656
657 inline size_t
658 ParallelCompactData::region(const RegionData* const region_ptr) const
659 {
660 assert(region_ptr >= _region_data, "bad arg");
661 assert(region_ptr <= _region_data + region_count(), "bad arg");
662 return pointer_delta(region_ptr, _region_data, sizeof(RegionData));
663 }
664
665 inline ParallelCompactData::BlockData*
666 ParallelCompactData::block(size_t n) const {
667 assert(n < block_count(), "bad arg");
668 return _block_data + n;
669 }
670
671 inline size_t
672 ParallelCompactData::region_offset(const HeapWord* addr) const
673 {
674 assert(addr >= _region_start, "bad addr");
675 assert(addr <= _region_end, "bad addr");
676 return (size_t(addr) & RegionAddrOffsetMask) >> LogHeapWordSize;
677 }
678
679 inline size_t
680 ParallelCompactData::addr_to_region_idx(const HeapWord* addr) const
681 {
682 assert(addr >= _region_start, "bad addr " PTR_FORMAT " _region_start " PTR_FORMAT, p2i(addr), p2i(_region_start));
683 assert(addr <= _region_end, "bad addr " PTR_FORMAT " _region_end " PTR_FORMAT, p2i(addr), p2i(_region_end));
684 return pointer_delta(addr, _region_start) >> Log2RegionSize;
685 }
686
687 inline ParallelCompactData::RegionData*
688 ParallelCompactData::addr_to_region_ptr(const HeapWord* addr) const
689 {
690 return region(addr_to_region_idx(addr));
691 }
692
693 inline HeapWord*
694 ParallelCompactData::region_to_addr(size_t region) const
695 {
696 assert(region <= _region_count, "region out of range");
697 return _region_start + (region << Log2RegionSize);
698 }
699
700 inline HeapWord*
701 ParallelCompactData::region_to_addr(const RegionData* region) const
702 {
703 return region_to_addr(pointer_delta(region, _region_data,
704 sizeof(RegionData)));
705 }
706
707 inline HeapWord*
708 ParallelCompactData::region_to_addr(size_t region, size_t offset) const
709 {
710 assert(region <= _region_count, "region out of range");
711 assert(offset < RegionSize, "offset too big"); // This may be too strict.
712 return region_to_addr(region) + offset;
713 }
714
715 inline HeapWord*
716 ParallelCompactData::region_align_down(HeapWord* addr) const
717 {
718 assert(addr >= _region_start, "bad addr");
719 assert(addr < _region_end + RegionSize, "bad addr");
720 return (HeapWord*)(size_t(addr) & RegionAddrMask);
721 }
722
723 inline HeapWord*
724 ParallelCompactData::region_align_up(HeapWord* addr) const
725 {
726 assert(addr >= _region_start, "bad addr");
727 assert(addr <= _region_end, "bad addr");
728 return region_align_down(addr + RegionSizeOffsetMask);
729 }
730
731 inline bool
732 ParallelCompactData::is_region_aligned(HeapWord* addr) const
733 {
734 return region_offset(addr) == 0;
735 }
736
737 inline size_t
738 ParallelCompactData::block_offset(const HeapWord* addr) const
739 {
740 assert(addr >= _region_start, "bad addr");
741 assert(addr <= _region_end, "bad addr");
742 return (size_t(addr) & BlockAddrOffsetMask) >> LogHeapWordSize;
743 }
744
745 inline size_t
746 ParallelCompactData::addr_to_block_idx(const HeapWord* addr) const
747 {
748 assert(addr >= _region_start, "bad addr");
749 assert(addr <= _region_end, "bad addr");
750 return pointer_delta(addr, _region_start) >> Log2BlockSize;
751 }
752
753 inline ParallelCompactData::BlockData*
754 ParallelCompactData::addr_to_block_ptr(const HeapWord* addr) const
755 {
756 return block(addr_to_block_idx(addr));
757 }
758
759 inline HeapWord*
760 ParallelCompactData::block_to_addr(size_t block) const
761 {
762 assert(block < _block_count, "block out of range");
763 return _region_start + (block << Log2BlockSize);
764 }
765
766 inline size_t
767 ParallelCompactData::region_to_block_idx(size_t region) const
768 {
769 return region << Log2BlocksPerRegion;
770 }
771
772 inline HeapWord*
773 ParallelCompactData::block_align_down(HeapWord* addr) const
774 {
775 assert(addr >= _region_start, "bad addr");
776 assert(addr < _region_end + RegionSize, "bad addr");
777 return (HeapWord*)(size_t(addr) & BlockAddrMask);
778 }
779
780 inline HeapWord*
781 ParallelCompactData::block_align_up(HeapWord* addr) const
782 {
783 assert(addr >= _region_start, "bad addr");
784 assert(addr <= _region_end, "bad addr");
785 return block_align_down(addr + BlockSizeOffsetMask);
786 }
787
788 inline bool
789 ParallelCompactData::is_block_aligned(HeapWord* addr) const
790 {
791 return block_offset(addr) == 0;
792 }
793
794 // Abstract closure for use with ParMarkBitMap::iterate(), which will invoke the
795 // do_addr() method.
796 //
797 // The closure is initialized with the number of heap words to process
798 // (words_remaining()), and becomes 'full' when it reaches 0. The do_addr()
799 // methods in subclasses should update the total as words are processed. Since
800 // only one subclass actually uses this mechanism to terminate iteration, the
801 // default initial value is > 0. The implementation is here and not in the
802 // single subclass that uses it to avoid making is_full() virtual, and thus
803 // adding a virtual call per live object.
804
805 class ParMarkBitMapClosure: public StackObj {
806 public:
807 typedef ParMarkBitMap::idx_t idx_t;
808 typedef ParMarkBitMap::IterationStatus IterationStatus;
809
810 public:
811 inline ParMarkBitMapClosure(ParMarkBitMap* mbm, ParCompactionManager* cm,
812 size_t words = max_uintx);
813
814 inline ParCompactionManager* compaction_manager() const;
815 inline ParMarkBitMap* bitmap() const;
816 inline size_t words_remaining() const;
817 inline bool is_full() const;
818 inline HeapWord* source() const;
819
820 inline void set_source(HeapWord* addr);
821
822 virtual IterationStatus do_addr(HeapWord* addr, size_t words) = 0;
823
824 protected:
825 inline void decrement_words_remaining(size_t words);
826
827 private:
828 ParMarkBitMap* const _bitmap;
829 ParCompactionManager* const _compaction_manager;
830 DEBUG_ONLY(const size_t _initial_words_remaining;) // Useful in debugger.
831 size_t _words_remaining; // Words left to copy.
832
833 protected:
834 HeapWord* _source; // Next addr that would be read.
835 };
836
837 inline
838 ParMarkBitMapClosure::ParMarkBitMapClosure(ParMarkBitMap* bitmap,
839 ParCompactionManager* cm,
840 size_t words):
841 _bitmap(bitmap), _compaction_manager(cm)
842 #ifdef ASSERT
843 , _initial_words_remaining(words)
844 #endif
845 {
846 _words_remaining = words;
847 _source = NULL;
848 }
849
850 inline ParCompactionManager* ParMarkBitMapClosure::compaction_manager() const {
851 return _compaction_manager;
852 }
853
854 inline ParMarkBitMap* ParMarkBitMapClosure::bitmap() const {
855 return _bitmap;
856 }
857
858 inline size_t ParMarkBitMapClosure::words_remaining() const {
859 return _words_remaining;
860 }
861
862 inline bool ParMarkBitMapClosure::is_full() const {
863 return words_remaining() == 0;
864 }
865
866 inline HeapWord* ParMarkBitMapClosure::source() const {
867 return _source;
868 }
869
870 inline void ParMarkBitMapClosure::set_source(HeapWord* addr) {
871 _source = addr;
872 }
873
874 inline void ParMarkBitMapClosure::decrement_words_remaining(size_t words) {
875 assert(_words_remaining >= words, "processed too many words");
876 _words_remaining -= words;
877 }
878
879 // The UseParallelOldGC collector is a stop-the-world garbage collector that
880 // does parts of the collection using parallel threads. The collection includes
881 // the tenured generation and the young generation. The permanent generation is
882 // collected at the same time as the other two generations but the permanent
883 // generation is collect by a single GC thread. The permanent generation is
884 // collected serially because of the requirement that during the processing of a
885 // klass AAA, any objects reference by AAA must already have been processed.
886 // This requirement is enforced by a left (lower address) to right (higher
887 // address) sliding compaction.
888 //
889 // There are four phases of the collection.
890 //
891 // - marking phase
892 // - summary phase
893 // - compacting phase
894 // - clean up phase
895 //
896 // Roughly speaking these phases correspond, respectively, to
897 // - mark all the live objects
898 // - calculate the destination of each object at the end of the collection
899 // - move the objects to their destination
900 // - update some references and reinitialize some variables
901 //
902 // These three phases are invoked in PSParallelCompact::invoke_no_policy(). The
903 // marking phase is implemented in PSParallelCompact::marking_phase() and does a
904 // complete marking of the heap. The summary phase is implemented in
905 // PSParallelCompact::summary_phase(). The move and update phase is implemented
906 // in PSParallelCompact::compact().
907 //
908 // A space that is being collected is divided into regions and with each region
909 // is associated an object of type ParallelCompactData. Each region is of a
910 // fixed size and typically will contain more than 1 object and may have parts
911 // of objects at the front and back of the region.
912 //
913 // region -----+---------------------+----------
914 // objects covered [ AAA )[ BBB )[ CCC )[ DDD )
915 //
916 // The marking phase does a complete marking of all live objects in the heap.
917 // The marking also compiles the size of the data for all live objects covered
918 // by the region. This size includes the part of any live object spanning onto
919 // the region (part of AAA if it is live) from the front, all live objects
920 // contained in the region (BBB and/or CCC if they are live), and the part of
921 // any live objects covered by the region that extends off the region (part of
922 // DDD if it is live). The marking phase uses multiple GC threads and marking
923 // is done in a bit array of type ParMarkBitMap. The marking of the bit map is
924 // done atomically as is the accumulation of the size of the live objects
925 // covered by a region.
926 //
927 // The summary phase calculates the total live data to the left of each region
928 // XXX. Based on that total and the bottom of the space, it can calculate the
929 // starting location of the live data in XXX. The summary phase calculates for
930 // each region XXX quantities such as
931 //
932 // - the amount of live data at the beginning of a region from an object
933 // entering the region.
934 // - the location of the first live data on the region
935 // - a count of the number of regions receiving live data from XXX.
936 //
937 // See ParallelCompactData for precise details. The summary phase also
938 // calculates the dense prefix for the compaction. The dense prefix is a
939 // portion at the beginning of the space that is not moved. The objects in the
940 // dense prefix do need to have their object references updated. See method
941 // summarize_dense_prefix().
942 //
943 // The summary phase is done using 1 GC thread.
944 //
945 // The compaction phase moves objects to their new location and updates all
946 // references in the object.
947 //
948 // A current exception is that objects that cross a region boundary are moved
949 // but do not have their references updated. References are not updated because
950 // it cannot easily be determined if the klass pointer KKK for the object AAA
951 // has been updated. KKK likely resides in a region to the left of the region
952 // containing AAA. These AAA's have there references updated at the end in a
953 // clean up phase. See the method PSParallelCompact::update_deferred_objects().
954 // An alternate strategy is being investigated for this deferral of updating.
955 //
956 // Compaction is done on a region basis. A region that is ready to be filled is
957 // put on a ready list and GC threads take region off the list and fill them. A
958 // region is ready to be filled if it empty of live objects. Such a region may
959 // have been initially empty (only contained dead objects) or may have had all
960 // its live objects copied out already. A region that compacts into itself is
961 // also ready for filling. The ready list is initially filled with empty
962 // regions and regions compacting into themselves. There is always at least 1
963 // region that can be put on the ready list. The regions are atomically added
964 // and removed from the ready list.
965
966 class TaskQueue;
967
968 class PSParallelCompact : AllStatic {
969 public:
970 // Convenient access to type names.
971 typedef ParMarkBitMap::idx_t idx_t;
972 typedef ParallelCompactData::RegionData RegionData;
973 typedef ParallelCompactData::BlockData BlockData;
974
975 typedef enum {
976 old_space_id, eden_space_id,
977 from_space_id, to_space_id, last_space_id
978 } SpaceId;
979
980 struct UpdateDensePrefixTask : public CHeapObj<mtGC> {
981 SpaceId _space_id;
982 size_t _region_index_start;
983 size_t _region_index_end;
984
985 UpdateDensePrefixTask() :
986 _space_id(SpaceId(0)),
987 _region_index_start(0),
988 _region_index_end(0) {}
989
990 UpdateDensePrefixTask(SpaceId space_id,
991 size_t region_index_start,
992 size_t region_index_end) :
993 _space_id(space_id),
994 _region_index_start(region_index_start),
995 _region_index_end(region_index_end) {}
996 };
997
998 public:
999 // Inline closure decls
1000 //
1001 class IsAliveClosure: public BoolObjectClosure {
1002 public:
1003 virtual bool do_object_b(oop p);
1004 };
1005
1006 friend class RefProcTaskProxy;
1007 friend class PSParallelCompactTest;
1008
1009 private:
1010 static STWGCTimer _gc_timer;
1011 static ParallelOldTracer _gc_tracer;
1012 static elapsedTimer _accumulated_time;
1013 static unsigned int _total_invocations;
1014 static unsigned int _maximum_compaction_gc_num;
1015 static jlong _time_of_last_gc; // ms
1016 static CollectorCounters* _counters;
1017 static ParMarkBitMap _mark_bitmap;
1018 static ParallelCompactData _summary_data;
1019 static IsAliveClosure _is_alive_closure;
1020 static SpaceInfo _space_info[last_space_id];
1021
1022 // Reference processing (used in ...follow_contents)
1023 static SpanSubjectToDiscoveryClosure _span_based_discoverer;
1024 static ReferenceProcessor* _ref_processor;
1025
1026 // Values computed at initialization and used by dead_wood_limiter().
1027 static double _dwl_mean;
1028 static double _dwl_std_dev;
1029 static double _dwl_first_term;
1030 static double _dwl_adjustment;
1031 #ifdef ASSERT
1032 static bool _dwl_initialized;
1033 #endif // #ifdef ASSERT
1034
1035 public:
1036 static ParallelOldTracer* gc_tracer() { return &_gc_tracer; }
1037
1038 private:
1039
1040 static void initialize_space_info();
1041
1042 // Clear the marking bitmap and summary data that cover the specified space.
1043 static void clear_data_covering_space(SpaceId id);
1044
1045 static void pre_compact();
1046 static void post_compact();
1047
1048 // Mark live objects
1049 static void marking_phase(ParCompactionManager* cm,
1050 bool maximum_heap_compaction,
1051 ParallelOldTracer *gc_tracer);
1052
1053 // Compute the dense prefix for the designated space. This is an experimental
1054 // implementation currently not used in production.
1055 static HeapWord* compute_dense_prefix_via_density(const SpaceId id,
1056 bool maximum_compaction);
1057
1058 // Methods used to compute the dense prefix.
1059
1060 // Compute the value of the normal distribution at x = density. The mean and
1061 // standard deviation are values saved by initialize_dead_wood_limiter().
1062 static inline double normal_distribution(double density);
1063
1064 // Initialize the static vars used by dead_wood_limiter().
1065 static void initialize_dead_wood_limiter();
1066
1067 // Return the percentage of space that can be treated as "dead wood" (i.e.,
1068 // not reclaimed).
1069 static double dead_wood_limiter(double density, size_t min_percent);
1070
1071 // Find the first (left-most) region in the range [beg, end) that has at least
1072 // dead_words of dead space to the left. The argument beg must be the first
1073 // region in the space that is not completely live.
1074 static RegionData* dead_wood_limit_region(const RegionData* beg,
1075 const RegionData* end,
1076 size_t dead_words);
1077
1078 // Return a pointer to the first region in the range [beg, end) that is not
1079 // completely full.
1080 static RegionData* first_dead_space_region(const RegionData* beg,
1081 const RegionData* end);
1082
1083 // Return a value indicating the benefit or 'yield' if the compacted region
1084 // were to start (or equivalently if the dense prefix were to end) at the
1085 // candidate region. Higher values are better.
1086 //
1087 // The value is based on the amount of space reclaimed vs. the costs of (a)
1088 // updating references in the dense prefix plus (b) copying objects and
1089 // updating references in the compacted region.
1090 static inline double reclaimed_ratio(const RegionData* const candidate,
1091 HeapWord* const bottom,
1092 HeapWord* const top,
1093 HeapWord* const new_top);
1094
1095 // Compute the dense prefix for the designated space.
1096 static HeapWord* compute_dense_prefix(const SpaceId id,
1097 bool maximum_compaction);
1098
1099 // Return true if dead space crosses onto the specified Region; bit must be
1100 // the bit index corresponding to the first word of the Region.
1101 static inline bool dead_space_crosses_boundary(const RegionData* region,
1102 idx_t bit);
1103
1104 // Summary phase utility routine to fill dead space (if any) at the dense
1105 // prefix boundary. Should only be called if the the dense prefix is
1106 // non-empty.
1107 static void fill_dense_prefix_end(SpaceId id);
1108
1109 static void summarize_spaces_quick();
1110 static void summarize_space(SpaceId id, bool maximum_compaction);
1111 static void summary_phase(ParCompactionManager* cm, bool maximum_compaction);
1112
1113 // Adjust addresses in roots. Does not adjust addresses in heap.
1114 static void adjust_roots(ParCompactionManager* cm);
1115
1116 DEBUG_ONLY(static void write_block_fill_histogram();)
1117
1118 // Move objects to new locations.
1119 static void compact_perm(ParCompactionManager* cm);
1120 static void compact();
1121
1122 // Add available regions to the stack and draining tasks to the task queue.
1123 static void prepare_region_draining_tasks(uint parallel_gc_threads);
1124
1125 // Add dense prefix update tasks to the task queue.
1126 static void enqueue_dense_prefix_tasks(TaskQueue& task_queue,
1127 uint parallel_gc_threads);
1128
1129 // If objects are left in eden after a collection, try to move the boundary
1130 // and absorb them into the old gen. Returns true if eden was emptied.
1131 static bool absorb_live_data_from_eden(PSAdaptiveSizePolicy* size_policy,
1132 PSYoungGen* young_gen,
1133 PSOldGen* old_gen);
1134
1135 // Reset time since last full gc
1136 static void reset_millis_since_last_gc();
1137
1138 #ifndef PRODUCT
1139 // Print generic summary data
1140 static void print_generic_summary_data(ParallelCompactData& summary_data,
1141 HeapWord* const beg_addr,
1142 HeapWord* const end_addr);
1143 #endif // #ifndef PRODUCT
1144
1145 public:
1146
1147 PSParallelCompact();
1148
1149 static void invoke(bool maximum_heap_compaction);
1150 static bool invoke_no_policy(bool maximum_heap_compaction);
1151
1152 static void post_initialize();
1153 // Perform initialization for PSParallelCompact that requires
1154 // allocations. This should be called during the VM initialization
1155 // at a pointer where it would be appropriate to return a JNI_ENOMEM
1156 // in the event of a failure.
1157 static bool initialize();
1158
1159 // Closure accessors
1160 static BoolObjectClosure* is_alive_closure() { return (BoolObjectClosure*)&_is_alive_closure; }
1161
1162 // Public accessors
1163 static elapsedTimer* accumulated_time() { return &_accumulated_time; }
1164 static unsigned int total_invocations() { return _total_invocations; }
1165 static CollectorCounters* counters() { return _counters; }
1166
1167 // Marking support
1168 static inline bool mark_obj(oop obj);
1169 static inline bool is_marked(oop obj);
1170
1171 template <class T> static inline void adjust_pointer(T* p, ParCompactionManager* cm);
1172
1173 // Compaction support.
1174 // Return true if p is in the range [beg_addr, end_addr).
1175 static inline bool is_in(HeapWord* p, HeapWord* beg_addr, HeapWord* end_addr);
1176 static inline bool is_in(oop* p, HeapWord* beg_addr, HeapWord* end_addr);
1177
1178 // Convenience wrappers for per-space data kept in _space_info.
1179 static inline MutableSpace* space(SpaceId space_id);
1180 static inline HeapWord* new_top(SpaceId space_id);
1181 static inline HeapWord* dense_prefix(SpaceId space_id);
1182 static inline ObjectStartArray* start_array(SpaceId space_id);
1183
1184 // Process the end of the given region range in the dense prefix.
1185 // This includes saving any object not updated.
1186 static void dense_prefix_regions_epilogue(ParCompactionManager* cm,
1187 size_t region_start_index,
1188 size_t region_end_index,
1189 idx_t exiting_object_offset,
1190 idx_t region_offset_start,
1191 idx_t region_offset_end);
1192
1193 // Update a region in the dense prefix. For each live object
1194 // in the region, update it's interior references. For each
1195 // dead object, fill it with deadwood. Dead space at the end
1196 // of a region range will be filled to the start of the next
1197 // live object regardless of the region_index_end. None of the
1198 // objects in the dense prefix move and dead space is dead
1199 // (holds only dead objects that don't need any processing), so
1200 // dead space can be filled in any order.
1201 static void update_and_deadwood_in_dense_prefix(ParCompactionManager* cm,
1202 SpaceId space_id,
1203 size_t region_index_start,
1204 size_t region_index_end);
1205
1206 // Return the address of the count + 1st live word in the range [beg, end).
1207 static HeapWord* skip_live_words(HeapWord* beg, HeapWord* end, size_t count);
1208
1209 // Return the address of the word to be copied to dest_addr, which must be
1210 // aligned to a region boundary.
1211 static HeapWord* first_src_addr(HeapWord* const dest_addr,
1212 SpaceId src_space_id,
1213 size_t src_region_idx);
1214
1215 // Determine the next source region, set closure.source() to the start of the
1216 // new region return the region index. Parameter end_addr is the address one
1217 // beyond the end of source range just processed. If necessary, switch to a
1218 // new source space and set src_space_id (in-out parameter) and src_space_top
1219 // (out parameter) accordingly.
1220 static size_t next_src_region(MoveAndUpdateClosure& closure,
1221 SpaceId& src_space_id,
1222 HeapWord*& src_space_top,
1223 HeapWord* end_addr);
1224
1225 // Decrement the destination count for each non-empty source region in the
1226 // range [beg_region, region(region_align_up(end_addr))). If the destination
1227 // count for a region goes to 0 and it needs to be filled, enqueue it.
1228 static void decrement_destination_counts(ParCompactionManager* cm,
1229 SpaceId src_space_id,
1230 size_t beg_region,
1231 HeapWord* end_addr);
1232
1233 static void fill_region(ParCompactionManager* cm, MoveAndUpdateClosure& closure, size_t region);
1234 static void fill_and_update_region(ParCompactionManager* cm, size_t region);
1235
1236 static bool steal_shadow_region(ParCompactionManager* cm, size_t& region_idx);
1237 static void fill_shadow_region(ParCompactionManager* cm, size_t region_idx);
1238 static void fill_and_update_shadow_region(ParCompactionManager* cm, size_t region) {
1239 fill_shadow_region(cm, region);
1240 }
1241 // Copy the content of a shadow region back to its corresponding heap region
1242 static void copy_back(HeapWord* shadow_addr, HeapWord* region_addr);
1243 // Initialize the steal record of a GC thread
1244 static void initialize_steal_record(uint which);
1245 // Reuse the empty heap regions as shadow regions, like to-space regions
1246 static void enqueue_shadow_region();
1247
1248 // Fill in the block table for the specified region.
1249 static void fill_blocks(size_t region_idx);
1250
1251 // Update the deferred objects in the space.
1252 static void update_deferred_objects(ParCompactionManager* cm, SpaceId id);
1253
1254 static ParMarkBitMap* mark_bitmap() { return &_mark_bitmap; }
1255 static ParallelCompactData& summary_data() { return _summary_data; }
1256
1257 // Reference Processing
1258 static ReferenceProcessor* const ref_processor() { return _ref_processor; }
1259
1260 static STWGCTimer* gc_timer() { return &_gc_timer; }
1261
1262 // Return the SpaceId for the given address.
1263 static SpaceId space_id(HeapWord* addr);
1264
1265 // Time since last full gc (in milliseconds).
1266 static jlong millis_since_last_gc();
1267
1268 static void print_on_error(outputStream* st);
1269
1270 #ifndef PRODUCT
1271 // Debugging support.
1272 static const char* space_names[last_space_id];
1273 static void print_region_ranges();
1274 static void print_dense_prefix_stats(const char* const algorithm,
1275 const SpaceId id,
1276 const bool maximum_compaction,
1277 HeapWord* const addr);
1278 static void summary_phase_msg(SpaceId dst_space_id,
1279 HeapWord* dst_beg, HeapWord* dst_end,
1280 SpaceId src_space_id,
1281 HeapWord* src_beg, HeapWord* src_end);
1282 #endif // #ifndef PRODUCT
1283
1284 #ifdef ASSERT
1285 // Sanity check the new location of a word in the heap.
1286 static inline void check_new_location(HeapWord* old_addr, HeapWord* new_addr);
1287 // Verify that all the regions have been emptied.
1288 static void verify_complete(SpaceId space_id);
1289 #endif // #ifdef ASSERT
1290 };
1291
1292 class MoveAndUpdateClosure: public ParMarkBitMapClosure {
1293 static inline size_t calculate_words_remaining(size_t region);
1294 public:
1295 inline MoveAndUpdateClosure(ParMarkBitMap* bitmap, ParCompactionManager* cm,
1296 size_t region);
1297
1298 // Accessors.
1299 HeapWord* destination() const { return _destination; }
1300 HeapWord* copy_destination() const { return _destination + _offset; }
1301
1302 // If the object will fit (size <= words_remaining()), copy it to the current
1303 // destination, update the interior oops and the start array and return either
1304 // full (if the closure is full) or incomplete. If the object will not fit,
1305 // return would_overflow.
1306 IterationStatus do_addr(HeapWord* addr, size_t size);
1307
1308 // Copy enough words to fill this closure, starting at source(). Interior
1309 // oops and the start array are not updated. Return full.
1310 IterationStatus copy_until_full();
1311
1312 // Copy enough words to fill this closure or to the end of an object,
1313 // whichever is smaller, starting at source(). Interior oops and the start
1314 // array are not updated.
1315 void copy_partial_obj();
1316
1317 virtual void complete_region(ParCompactionManager* cm, HeapWord* dest_addr,
1318 PSParallelCompact::RegionData* region_ptr);
1319
1320 protected:
1321 // Update variables to indicate that word_count words were processed.
1322 inline void update_state(size_t word_count);
1323
1324 protected:
1325 HeapWord* _destination; // Next addr to be written.
1326 ObjectStartArray* const _start_array;
1327 size_t _offset;
1328 };
1329
1330 inline size_t MoveAndUpdateClosure::calculate_words_remaining(size_t region) {
1331 HeapWord* dest_addr = PSParallelCompact::summary_data().region_to_addr(region);
1332 PSParallelCompact::SpaceId dest_space_id = PSParallelCompact::space_id(dest_addr);
1333 HeapWord* new_top = PSParallelCompact::new_top(dest_space_id);
1334 assert(dest_addr < new_top, "sanity");
1335
1336 return MIN2(pointer_delta(new_top, dest_addr), ParallelCompactData::RegionSize);
1337 }
1338
1339 inline
1340 MoveAndUpdateClosure::MoveAndUpdateClosure(ParMarkBitMap* bitmap,
1341 ParCompactionManager* cm,
1342 size_t region_idx) :
1343 ParMarkBitMapClosure(bitmap, cm, calculate_words_remaining(region_idx)),
1344 _destination(PSParallelCompact::summary_data().region_to_addr(region_idx)),
1345 _start_array(PSParallelCompact::start_array(PSParallelCompact::space_id(_destination))),
1346 _offset(0) { }
1347
1348
1349 inline void MoveAndUpdateClosure::update_state(size_t words)
1350 {
1351 decrement_words_remaining(words);
1352 _source += words;
1353 _destination += words;
1354 }
1355
1356 class ShadowClosure: public MoveAndUpdateClosure {
1357 inline size_t calculate_shadow_offset(size_t region_idx, size_t shadow_idx);
1358 public:
1359 inline ShadowClosure(ParMarkBitMap* bitmap, ParCompactionManager* cm,
1360 size_t region, size_t shadow);
1361
1362 virtual void complete_region(ParCompactionManager* cm, HeapWord* dest_addr,
1363 PSParallelCompact::RegionData* region_ptr);
1364
1365 private:
1366 size_t _shadow;
1367 };
1368
1369 inline size_t ShadowClosure::calculate_shadow_offset(size_t region_idx, size_t shadow_idx) {
1370 ParallelCompactData& sd = PSParallelCompact::summary_data();
1371 HeapWord* dest_addr = sd.region_to_addr(region_idx);
1372 HeapWord* shadow_addr = sd.region_to_addr(shadow_idx);
1373 return pointer_delta(shadow_addr, dest_addr);
1374 }
1375
1376 inline
1377 ShadowClosure::ShadowClosure(ParMarkBitMap *bitmap,
1378 ParCompactionManager *cm,
1379 size_t region,
1380 size_t shadow) :
1381 MoveAndUpdateClosure(bitmap, cm, region),
1382 _shadow(shadow) {
1383 _offset = calculate_shadow_offset(region, shadow);
1384 }
1385
1386 class UpdateOnlyClosure: public ParMarkBitMapClosure {
1387 private:
1388 const PSParallelCompact::SpaceId _space_id;
1389 ObjectStartArray* const _start_array;
1390
1391 public:
1392 UpdateOnlyClosure(ParMarkBitMap* mbm,
1393 ParCompactionManager* cm,
1394 PSParallelCompact::SpaceId space_id);
1395
1396 // Update the object.
1397 virtual IterationStatus do_addr(HeapWord* addr, size_t words);
1398
1399 inline void do_addr(HeapWord* addr);
1400 };
1401
1402 class FillClosure: public ParMarkBitMapClosure {
1403 public:
1404 FillClosure(ParCompactionManager* cm, PSParallelCompact::SpaceId space_id);
1405
1406 virtual IterationStatus do_addr(HeapWord* addr, size_t size);
1407
1408 private:
1409 ObjectStartArray* const _start_array;
1410 };
1411
1412 #endif // SHARE_GC_PARALLEL_PSPARALLELCOMPACT_HPP