Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/parallelScavenge/psParallelCompact.cpp @ 481:7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
Reviewed-by: apetrusenko, ysr
| author | jcoomes |
|---|---|
| date | Thu, 11 Dec 2008 12:05:08 -0800 |
| parents | 27a80744a83b |
| children | 7c2386d67889 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 2005-2008 Sun Microsystems, Inc. All Rights Reserved. |
| 0 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 #include "incls/_precompiled.incl" | |
| 26 #include "incls/_psParallelCompact.cpp.incl" | |
| 27 | |
| 28 #include <math.h> | |
| 29 | |
| 30 // All sizes are in HeapWords. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
31 const size_t ParallelCompactData::Log2RegionSize = 9; // 512 words |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
32 const size_t ParallelCompactData::RegionSize = (size_t)1 << Log2RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
33 const size_t ParallelCompactData::RegionSizeBytes = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
34 RegionSize << LogHeapWordSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
35 const size_t ParallelCompactData::RegionSizeOffsetMask = RegionSize - 1; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
36 const size_t ParallelCompactData::RegionAddrOffsetMask = RegionSizeBytes - 1; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
37 const size_t ParallelCompactData::RegionAddrMask = ~RegionAddrOffsetMask; |
| 0 | 38 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
39 const ParallelCompactData::RegionData::region_sz_t |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
40 ParallelCompactData::RegionData::dc_shift = 27; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
41 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
42 const ParallelCompactData::RegionData::region_sz_t |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
43 ParallelCompactData::RegionData::dc_mask = ~0U << dc_shift; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
44 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
45 const ParallelCompactData::RegionData::region_sz_t |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
46 ParallelCompactData::RegionData::dc_one = 0x1U << dc_shift; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
47 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
48 const ParallelCompactData::RegionData::region_sz_t |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
49 ParallelCompactData::RegionData::los_mask = ~dc_mask; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
50 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
51 const ParallelCompactData::RegionData::region_sz_t |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
52 ParallelCompactData::RegionData::dc_claimed = 0x8U << dc_shift; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
53 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
54 const ParallelCompactData::RegionData::region_sz_t |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
55 ParallelCompactData::RegionData::dc_completed = 0xcU << dc_shift; |
| 0 | 56 |
| 57 SpaceInfo PSParallelCompact::_space_info[PSParallelCompact::last_space_id]; | |
| 58 bool PSParallelCompact::_print_phases = false; | |
| 59 | |
| 60 ReferenceProcessor* PSParallelCompact::_ref_processor = NULL; | |
| 61 klassOop PSParallelCompact::_updated_int_array_klass_obj = NULL; | |
| 62 | |
| 63 double PSParallelCompact::_dwl_mean; | |
| 64 double PSParallelCompact::_dwl_std_dev; | |
| 65 double PSParallelCompact::_dwl_first_term; | |
| 66 double PSParallelCompact::_dwl_adjustment; | |
| 67 #ifdef ASSERT | |
| 68 bool PSParallelCompact::_dwl_initialized = false; | |
| 69 #endif // #ifdef ASSERT | |
| 70 | |
| 71 #ifdef VALIDATE_MARK_SWEEP | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
72 GrowableArray<void*>* PSParallelCompact::_root_refs_stack = NULL; |
| 0 | 73 GrowableArray<oop> * PSParallelCompact::_live_oops = NULL; |
| 74 GrowableArray<oop> * PSParallelCompact::_live_oops_moved_to = NULL; | |
| 75 GrowableArray<size_t>* PSParallelCompact::_live_oops_size = NULL; | |
| 76 size_t PSParallelCompact::_live_oops_index = 0; | |
| 77 size_t PSParallelCompact::_live_oops_index_at_perm = 0; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
78 GrowableArray<void*>* PSParallelCompact::_other_refs_stack = NULL; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
79 GrowableArray<void*>* PSParallelCompact::_adjusted_pointers = NULL; |
| 0 | 80 bool PSParallelCompact::_pointer_tracking = false; |
| 81 bool PSParallelCompact::_root_tracking = true; | |
| 82 | |
| 83 GrowableArray<HeapWord*>* PSParallelCompact::_cur_gc_live_oops = NULL; | |
| 84 GrowableArray<HeapWord*>* PSParallelCompact::_cur_gc_live_oops_moved_to = NULL; | |
| 85 GrowableArray<size_t> * PSParallelCompact::_cur_gc_live_oops_size = NULL; | |
| 86 GrowableArray<HeapWord*>* PSParallelCompact::_last_gc_live_oops = NULL; | |
| 87 GrowableArray<HeapWord*>* PSParallelCompact::_last_gc_live_oops_moved_to = NULL; | |
| 88 GrowableArray<size_t> * PSParallelCompact::_last_gc_live_oops_size = NULL; | |
| 89 #endif | |
| 90 | |
| 91 #ifndef PRODUCT | |
| 92 const char* PSParallelCompact::space_names[] = { | |
| 93 "perm", "old ", "eden", "from", "to " | |
| 94 }; | |
| 95 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
96 void PSParallelCompact::print_region_ranges() |
| 0 | 97 { |
| 98 tty->print_cr("space bottom top end new_top"); | |
| 99 tty->print_cr("------ ---------- ---------- ---------- ----------"); | |
| 100 | |
| 101 for (unsigned int id = 0; id < last_space_id; ++id) { | |
| 102 const MutableSpace* space = _space_info[id].space(); | |
| 103 tty->print_cr("%u %s " | |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
104 SIZE_FORMAT_W(10) " " SIZE_FORMAT_W(10) " " |
|
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
105 SIZE_FORMAT_W(10) " " SIZE_FORMAT_W(10) " ", |
| 0 | 106 id, space_names[id], |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
107 summary_data().addr_to_region_idx(space->bottom()), |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
108 summary_data().addr_to_region_idx(space->top()), |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
109 summary_data().addr_to_region_idx(space->end()), |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
110 summary_data().addr_to_region_idx(_space_info[id].new_top())); |
| 0 | 111 } |
| 112 } | |
| 113 | |
| 114 void | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
115 print_generic_summary_region(size_t i, const ParallelCompactData::RegionData* c) |
| 0 | 116 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
117 #define REGION_IDX_FORMAT SIZE_FORMAT_W(7) |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
118 #define REGION_DATA_FORMAT SIZE_FORMAT_W(5) |
| 0 | 119 |
| 120 ParallelCompactData& sd = PSParallelCompact::summary_data(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
121 size_t dci = c->destination() ? sd.addr_to_region_idx(c->destination()) : 0; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
122 tty->print_cr(REGION_IDX_FORMAT " " PTR_FORMAT " " |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
123 REGION_IDX_FORMAT " " PTR_FORMAT " " |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
124 REGION_DATA_FORMAT " " REGION_DATA_FORMAT " " |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
125 REGION_DATA_FORMAT " " REGION_IDX_FORMAT " %d", |
| 0 | 126 i, c->data_location(), dci, c->destination(), |
| 127 c->partial_obj_size(), c->live_obj_size(), | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
128 c->data_size(), c->source_region(), c->destination_count()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
129 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
130 #undef REGION_IDX_FORMAT |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
131 #undef REGION_DATA_FORMAT |
| 0 | 132 } |
| 133 | |
| 134 void | |
| 135 print_generic_summary_data(ParallelCompactData& summary_data, | |
| 136 HeapWord* const beg_addr, | |
| 137 HeapWord* const end_addr) | |
| 138 { | |
| 139 size_t total_words = 0; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
140 size_t i = summary_data.addr_to_region_idx(beg_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
141 const size_t last = summary_data.addr_to_region_idx(end_addr); |
| 0 | 142 HeapWord* pdest = 0; |
| 143 | |
| 144 while (i <= last) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
145 ParallelCompactData::RegionData* c = summary_data.region(i); |
| 0 | 146 if (c->data_size() != 0 || c->destination() != pdest) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
147 print_generic_summary_region(i, c); |
| 0 | 148 total_words += c->data_size(); |
| 149 pdest = c->destination(); | |
| 150 } | |
| 151 ++i; | |
| 152 } | |
| 153 | |
| 154 tty->print_cr("summary_data_bytes=" SIZE_FORMAT, total_words * HeapWordSize); | |
| 155 } | |
| 156 | |
| 157 void | |
| 158 print_generic_summary_data(ParallelCompactData& summary_data, | |
| 159 SpaceInfo* space_info) | |
| 160 { | |
| 161 for (unsigned int id = 0; id < PSParallelCompact::last_space_id; ++id) { | |
| 162 const MutableSpace* space = space_info[id].space(); | |
| 163 print_generic_summary_data(summary_data, space->bottom(), | |
| 164 MAX2(space->top(), space_info[id].new_top())); | |
| 165 } | |
| 166 } | |
| 167 | |
| 168 void | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
169 print_initial_summary_region(size_t i, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
170 const ParallelCompactData::RegionData* c, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
171 bool newline = true) |
| 0 | 172 { |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
173 tty->print(SIZE_FORMAT_W(5) " " PTR_FORMAT " " |
|
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
174 SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " " |
|
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
175 SIZE_FORMAT_W(5) " " SIZE_FORMAT_W(5) " %d", |
| 0 | 176 i, c->destination(), |
| 177 c->partial_obj_size(), c->live_obj_size(), | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
178 c->data_size(), c->source_region(), c->destination_count()); |
| 0 | 179 if (newline) tty->cr(); |
| 180 } | |
| 181 | |
| 182 void | |
| 183 print_initial_summary_data(ParallelCompactData& summary_data, | |
| 184 const MutableSpace* space) { | |
| 185 if (space->top() == space->bottom()) { | |
| 186 return; | |
| 187 } | |
| 188 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
189 const size_t region_size = ParallelCompactData::RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
190 typedef ParallelCompactData::RegionData RegionData; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
191 HeapWord* const top_aligned_up = summary_data.region_align_up(space->top()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
192 const size_t end_region = summary_data.addr_to_region_idx(top_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
193 const RegionData* c = summary_data.region(end_region - 1); |
| 0 | 194 HeapWord* end_addr = c->destination() + c->data_size(); |
| 195 const size_t live_in_space = pointer_delta(end_addr, space->bottom()); | |
| 196 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
197 // Print (and count) the full regions at the beginning of the space. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
198 size_t full_region_count = 0; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
199 size_t i = summary_data.addr_to_region_idx(space->bottom()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
200 while (i < end_region && summary_data.region(i)->data_size() == region_size) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
201 print_initial_summary_region(i, summary_data.region(i)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
202 ++full_region_count; |
| 0 | 203 ++i; |
| 204 } | |
| 205 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
206 size_t live_to_right = live_in_space - full_region_count * region_size; |
| 0 | 207 |
| 208 double max_reclaimed_ratio = 0.0; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
209 size_t max_reclaimed_ratio_region = 0; |
| 0 | 210 size_t max_dead_to_right = 0; |
| 211 size_t max_live_to_right = 0; | |
| 212 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
213 // Print the 'reclaimed ratio' for regions while there is something live in |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
214 // the region or to the right of it. The remaining regions are empty (and |
| 0 | 215 // uninteresting), and computing the ratio will result in division by 0. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
216 while (i < end_region && live_to_right > 0) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
217 c = summary_data.region(i); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
218 HeapWord* const region_addr = summary_data.region_to_addr(i); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
219 const size_t used_to_right = pointer_delta(space->top(), region_addr); |
| 0 | 220 const size_t dead_to_right = used_to_right - live_to_right; |
| 221 const double reclaimed_ratio = double(dead_to_right) / live_to_right; | |
| 222 | |
| 223 if (reclaimed_ratio > max_reclaimed_ratio) { | |
| 224 max_reclaimed_ratio = reclaimed_ratio; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
225 max_reclaimed_ratio_region = i; |
| 0 | 226 max_dead_to_right = dead_to_right; |
| 227 max_live_to_right = live_to_right; | |
| 228 } | |
| 229 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
230 print_initial_summary_region(i, c, false); |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
231 tty->print_cr(" %12.10f " SIZE_FORMAT_W(10) " " SIZE_FORMAT_W(10), |
| 0 | 232 reclaimed_ratio, dead_to_right, live_to_right); |
| 233 | |
| 234 live_to_right -= c->data_size(); | |
| 235 ++i; | |
| 236 } | |
| 237 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
238 // Any remaining regions are empty. Print one more if there is one. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
239 if (i < end_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
240 print_initial_summary_region(i, summary_data.region(i)); |
| 0 | 241 } |
| 242 | |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
243 tty->print_cr("max: " SIZE_FORMAT_W(4) " d2r=" SIZE_FORMAT_W(10) " " |
|
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
244 "l2r=" SIZE_FORMAT_W(10) " max_ratio=%14.12f", |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
245 max_reclaimed_ratio_region, max_dead_to_right, |
| 0 | 246 max_live_to_right, max_reclaimed_ratio); |
| 247 } | |
| 248 | |
| 249 void | |
| 250 print_initial_summary_data(ParallelCompactData& summary_data, | |
| 251 SpaceInfo* space_info) { | |
| 252 unsigned int id = PSParallelCompact::perm_space_id; | |
| 253 const MutableSpace* space; | |
| 254 do { | |
| 255 space = space_info[id].space(); | |
| 256 print_initial_summary_data(summary_data, space); | |
| 257 } while (++id < PSParallelCompact::eden_space_id); | |
| 258 | |
| 259 do { | |
| 260 space = space_info[id].space(); | |
| 261 print_generic_summary_data(summary_data, space->bottom(), space->top()); | |
| 262 } while (++id < PSParallelCompact::last_space_id); | |
| 263 } | |
| 264 #endif // #ifndef PRODUCT | |
| 265 | |
| 266 #ifdef ASSERT | |
| 267 size_t add_obj_count; | |
| 268 size_t add_obj_size; | |
| 269 size_t mark_bitmap_count; | |
| 270 size_t mark_bitmap_size; | |
| 271 #endif // #ifdef ASSERT | |
| 272 | |
| 273 ParallelCompactData::ParallelCompactData() | |
| 274 { | |
| 275 _region_start = 0; | |
| 276 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
277 _region_vspace = 0; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
278 _region_data = 0; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
279 _region_count = 0; |
| 0 | 280 } |
| 281 | |
| 282 bool ParallelCompactData::initialize(MemRegion covered_region) | |
| 283 { | |
| 284 _region_start = covered_region.start(); | |
| 285 const size_t region_size = covered_region.word_size(); | |
| 286 DEBUG_ONLY(_region_end = _region_start + region_size;) | |
| 287 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
288 assert(region_align_down(_region_start) == _region_start, |
| 0 | 289 "region start not aligned"); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
290 assert((region_size & RegionSizeOffsetMask) == 0, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
291 "region size not a multiple of RegionSize"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
292 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
293 bool result = initialize_region_data(region_size); |
| 0 | 294 |
| 295 return result; | |
| 296 } | |
| 297 | |
| 298 PSVirtualSpace* | |
| 299 ParallelCompactData::create_vspace(size_t count, size_t element_size) | |
| 300 { | |
| 301 const size_t raw_bytes = count * element_size; | |
| 302 const size_t page_sz = os::page_size_for_region(raw_bytes, raw_bytes, 10); | |
| 303 const size_t granularity = os::vm_allocation_granularity(); | |
| 304 const size_t bytes = align_size_up(raw_bytes, MAX2(page_sz, granularity)); | |
| 305 | |
| 306 const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 : | |
| 307 MAX2(page_sz, granularity); | |
|
79
82db0859acbe
6642862: Code cache allocation fails with large pages after 6588638
jcoomes
parents:
0
diff
changeset
|
308 ReservedSpace rs(bytes, rs_align, rs_align > 0); |
| 0 | 309 os::trace_page_sizes("par compact", raw_bytes, raw_bytes, page_sz, rs.base(), |
| 310 rs.size()); | |
| 311 PSVirtualSpace* vspace = new PSVirtualSpace(rs, page_sz); | |
| 312 if (vspace != 0) { | |
| 313 if (vspace->expand_by(bytes)) { | |
| 314 return vspace; | |
| 315 } | |
| 316 delete vspace; | |
|
237
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
317 // Release memory reserved in the space. |
|
1fdb98a17101
6716785: implicit null checks not triggering with CompressedOops
coleenp
parents:
235
diff
changeset
|
318 rs.release(); |
| 0 | 319 } |
| 320 | |
| 321 return 0; | |
| 322 } | |
| 323 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
324 bool ParallelCompactData::initialize_region_data(size_t region_size) |
| 0 | 325 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
326 const size_t count = (region_size + RegionSizeOffsetMask) >> Log2RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
327 _region_vspace = create_vspace(count, sizeof(RegionData)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
328 if (_region_vspace != 0) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
329 _region_data = (RegionData*)_region_vspace->reserved_low_addr(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
330 _region_count = count; |
| 0 | 331 return true; |
| 332 } | |
| 333 return false; | |
| 334 } | |
| 335 | |
| 336 void ParallelCompactData::clear() | |
| 337 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
338 memset(_region_data, 0, _region_vspace->committed_size()); |
| 0 | 339 } |
| 340 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
341 void ParallelCompactData::clear_range(size_t beg_region, size_t end_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
342 assert(beg_region <= _region_count, "beg_region out of range"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
343 assert(end_region <= _region_count, "end_region out of range"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
344 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
345 const size_t region_cnt = end_region - beg_region; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
346 memset(_region_data + beg_region, 0, region_cnt * sizeof(RegionData)); |
| 0 | 347 } |
| 348 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
349 HeapWord* ParallelCompactData::partial_obj_end(size_t region_idx) const |
| 0 | 350 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
351 const RegionData* cur_cp = region(region_idx); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
352 const RegionData* const end_cp = region(region_count() - 1); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
353 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
354 HeapWord* result = region_to_addr(region_idx); |
| 0 | 355 if (cur_cp < end_cp) { |
| 356 do { | |
| 357 result += cur_cp->partial_obj_size(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
358 } while (cur_cp->partial_obj_size() == RegionSize && ++cur_cp < end_cp); |
| 0 | 359 } |
| 360 return result; | |
| 361 } | |
| 362 | |
| 363 void ParallelCompactData::add_obj(HeapWord* addr, size_t len) | |
| 364 { | |
| 365 const size_t obj_ofs = pointer_delta(addr, _region_start); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
366 const size_t beg_region = obj_ofs >> Log2RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
367 const size_t end_region = (obj_ofs + len - 1) >> Log2RegionSize; |
| 0 | 368 |
| 369 DEBUG_ONLY(Atomic::inc_ptr(&add_obj_count);) | |
| 370 DEBUG_ONLY(Atomic::add_ptr(len, &add_obj_size);) | |
| 371 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
372 if (beg_region == end_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
373 // All in one region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
374 _region_data[beg_region].add_live_obj(len); |
| 0 | 375 return; |
| 376 } | |
| 377 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
378 // First region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
379 const size_t beg_ofs = region_offset(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
380 _region_data[beg_region].add_live_obj(RegionSize - beg_ofs); |
| 0 | 381 |
| 382 klassOop klass = ((oop)addr)->klass(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
383 // Middle regions--completely spanned by this object. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
384 for (size_t region = beg_region + 1; region < end_region; ++region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
385 _region_data[region].set_partial_obj_size(RegionSize); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
386 _region_data[region].set_partial_obj_addr(addr); |
| 0 | 387 } |
| 388 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
389 // Last region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
390 const size_t end_ofs = region_offset(addr + len - 1); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
391 _region_data[end_region].set_partial_obj_size(end_ofs + 1); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
392 _region_data[end_region].set_partial_obj_addr(addr); |
| 0 | 393 } |
| 394 | |
| 395 void | |
| 396 ParallelCompactData::summarize_dense_prefix(HeapWord* beg, HeapWord* end) | |
| 397 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
398 assert(region_offset(beg) == 0, "not RegionSize aligned"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
399 assert(region_offset(end) == 0, "not RegionSize aligned"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
400 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
401 size_t cur_region = addr_to_region_idx(beg); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
402 const size_t end_region = addr_to_region_idx(end); |
| 0 | 403 HeapWord* addr = beg; |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
404 while (cur_region < end_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
405 _region_data[cur_region].set_destination(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
406 _region_data[cur_region].set_destination_count(0); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
407 _region_data[cur_region].set_source_region(cur_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
408 _region_data[cur_region].set_data_location(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
409 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
410 // Update live_obj_size so the region appears completely full. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
411 size_t live_size = RegionSize - _region_data[cur_region].partial_obj_size(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
412 _region_data[cur_region].set_live_obj_size(live_size); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
413 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
414 ++cur_region; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
415 addr += RegionSize; |
| 0 | 416 } |
| 417 } | |
| 418 | |
| 419 bool ParallelCompactData::summarize(HeapWord* target_beg, HeapWord* target_end, | |
| 420 HeapWord* source_beg, HeapWord* source_end, | |
| 421 HeapWord** target_next, | |
| 422 HeapWord** source_next) { | |
| 423 // This is too strict. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
424 // assert(region_offset(source_beg) == 0, "not RegionSize aligned"); |
| 0 | 425 |
| 426 if (TraceParallelOldGCSummaryPhase) { | |
| 427 tty->print_cr("tb=" PTR_FORMAT " te=" PTR_FORMAT " " | |
| 428 "sb=" PTR_FORMAT " se=" PTR_FORMAT " " | |
| 429 "tn=" PTR_FORMAT " sn=" PTR_FORMAT, | |
| 430 target_beg, target_end, | |
| 431 source_beg, source_end, | |
| 432 target_next != 0 ? *target_next : (HeapWord*) 0, | |
| 433 source_next != 0 ? *source_next : (HeapWord*) 0); | |
| 434 } | |
| 435 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
436 size_t cur_region = addr_to_region_idx(source_beg); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
437 const size_t end_region = addr_to_region_idx(region_align_up(source_end)); |
| 0 | 438 |
| 439 HeapWord *dest_addr = target_beg; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
440 while (cur_region < end_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
441 size_t words = _region_data[cur_region].data_size(); |
| 0 | 442 |
| 443 #if 1 | |
| 444 assert(pointer_delta(target_end, dest_addr) >= words, | |
| 445 "source region does not fit into target region"); | |
| 446 #else | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
447 // XXX - need some work on the corner cases here. If the region does not |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
448 // fit, then must either make sure any partial_obj from the region fits, or |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
449 // "undo" the initial part of the partial_obj that is in the previous |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
450 // region. |
| 0 | 451 if (dest_addr + words >= target_end) { |
| 452 // Let the caller know where to continue. | |
| 453 *target_next = dest_addr; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
454 *source_next = region_to_addr(cur_region); |
| 0 | 455 return false; |
| 456 } | |
| 457 #endif // #if 1 | |
| 458 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
459 _region_data[cur_region].set_destination(dest_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
460 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
461 // Set the destination_count for cur_region, and if necessary, update |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
462 // source_region for a destination region. The source_region field is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
463 // updated if cur_region is the first (left-most) region to be copied to a |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
464 // destination region. |
| 0 | 465 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
466 // The destination_count calculation is a bit subtle. A region that has |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
467 // data that compacts into itself does not count itself as a destination. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
468 // This maintains the invariant that a zero count means the region is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
469 // available and can be claimed and then filled. |
| 0 | 470 if (words > 0) { |
| 471 HeapWord* const last_addr = dest_addr + words - 1; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
472 const size_t dest_region_1 = addr_to_region_idx(dest_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
473 const size_t dest_region_2 = addr_to_region_idx(last_addr); |
| 0 | 474 #if 0 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
475 // Initially assume that the destination regions will be the same and |
| 0 | 476 // adjust the value below if necessary. Under this assumption, if |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
477 // cur_region == dest_region_2, then cur_region will be compacted |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
478 // completely into itself. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
479 uint destination_count = cur_region == dest_region_2 ? 0 : 1; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
480 if (dest_region_1 != dest_region_2) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
481 // Destination regions differ; adjust destination_count. |
| 0 | 482 destination_count += 1; |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
483 // Data from cur_region will be copied to the start of dest_region_2. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
484 _region_data[dest_region_2].set_source_region(cur_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
485 } else if (region_offset(dest_addr) == 0) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
486 // Data from cur_region will be copied to the start of the destination |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
487 // region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
488 _region_data[dest_region_1].set_source_region(cur_region); |
| 0 | 489 } |
| 490 #else | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
491 // Initially assume that the destination regions will be different and |
| 0 | 492 // adjust the value below if necessary. Under this assumption, if |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
493 // cur_region == dest_region2, then cur_region will be compacted partially |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
494 // into dest_region_1 and partially into itself. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
495 uint destination_count = cur_region == dest_region_2 ? 1 : 2; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
496 if (dest_region_1 != dest_region_2) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
497 // Data from cur_region will be copied to the start of dest_region_2. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
498 _region_data[dest_region_2].set_source_region(cur_region); |
| 0 | 499 } else { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
500 // Destination regions are the same; adjust destination_count. |
| 0 | 501 destination_count -= 1; |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
502 if (region_offset(dest_addr) == 0) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
503 // Data from cur_region will be copied to the start of the destination |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
504 // region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
505 _region_data[dest_region_1].set_source_region(cur_region); |
| 0 | 506 } |
| 507 } | |
| 508 #endif // #if 0 | |
| 509 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
510 _region_data[cur_region].set_destination_count(destination_count); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
511 _region_data[cur_region].set_data_location(region_to_addr(cur_region)); |
| 0 | 512 dest_addr += words; |
| 513 } | |
| 514 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
515 ++cur_region; |
| 0 | 516 } |
| 517 | |
| 518 *target_next = dest_addr; | |
| 519 return true; | |
| 520 } | |
| 521 | |
| 522 HeapWord* ParallelCompactData::calc_new_pointer(HeapWord* addr) { | |
| 523 assert(addr != NULL, "Should detect NULL oop earlier"); | |
| 524 assert(PSParallelCompact::gc_heap()->is_in(addr), "addr not in heap"); | |
| 525 #ifdef ASSERT | |
| 526 if (PSParallelCompact::mark_bitmap()->is_unmarked(addr)) { | |
| 527 gclog_or_tty->print_cr("calc_new_pointer:: addr " PTR_FORMAT, addr); | |
| 528 } | |
| 529 #endif | |
| 530 assert(PSParallelCompact::mark_bitmap()->is_marked(addr), "obj not marked"); | |
| 531 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
532 // Region covering the object. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
533 size_t region_index = addr_to_region_idx(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
534 const RegionData* const region_ptr = region(region_index); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
535 HeapWord* const region_addr = region_align_down(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
536 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
537 assert(addr < region_addr + RegionSize, "Region does not cover object"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
538 assert(addr_to_region_ptr(region_addr) == region_ptr, "sanity check"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
539 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
540 HeapWord* result = region_ptr->destination(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
541 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
542 // If all the data in the region is live, then the new location of the object |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
543 // can be calculated from the destination of the region plus the offset of the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
544 // object in the region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
545 if (region_ptr->data_size() == RegionSize) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
546 result += pointer_delta(addr, region_addr); |
| 0 | 547 return result; |
| 548 } | |
| 549 | |
| 550 // The new location of the object is | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
551 // region destination + |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
552 // size of the partial object extending onto the region + |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
553 // sizes of the live objects in the Region that are to the left of addr |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
554 const size_t partial_obj_size = region_ptr->partial_obj_size(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
555 HeapWord* const search_start = region_addr + partial_obj_size; |
| 0 | 556 |
| 557 const ParMarkBitMap* bitmap = PSParallelCompact::mark_bitmap(); | |
| 558 size_t live_to_left = bitmap->live_words_in_range(search_start, oop(addr)); | |
| 559 | |
| 560 result += partial_obj_size + live_to_left; | |
| 561 assert(result <= addr, "object cannot move to the right"); | |
| 562 return result; | |
| 563 } | |
| 564 | |
| 565 klassOop ParallelCompactData::calc_new_klass(klassOop old_klass) { | |
| 566 klassOop updated_klass; | |
| 567 if (PSParallelCompact::should_update_klass(old_klass)) { | |
| 568 updated_klass = (klassOop) calc_new_pointer(old_klass); | |
| 569 } else { | |
| 570 updated_klass = old_klass; | |
| 571 } | |
| 572 | |
| 573 return updated_klass; | |
| 574 } | |
| 575 | |
| 576 #ifdef ASSERT | |
| 577 void ParallelCompactData::verify_clear(const PSVirtualSpace* vspace) | |
| 578 { | |
| 579 const size_t* const beg = (const size_t*)vspace->committed_low_addr(); | |
| 580 const size_t* const end = (const size_t*)vspace->committed_high_addr(); | |
| 581 for (const size_t* p = beg; p < end; ++p) { | |
| 582 assert(*p == 0, "not zero"); | |
| 583 } | |
| 584 } | |
| 585 | |
| 586 void ParallelCompactData::verify_clear() | |
| 587 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
588 verify_clear(_region_vspace); |
| 0 | 589 } |
| 590 #endif // #ifdef ASSERT | |
| 591 | |
| 592 #ifdef NOT_PRODUCT | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
593 ParallelCompactData::RegionData* debug_region(size_t region_index) { |
| 0 | 594 ParallelCompactData& sd = PSParallelCompact::summary_data(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
595 return sd.region(region_index); |
| 0 | 596 } |
| 597 #endif | |
| 598 | |
| 599 elapsedTimer PSParallelCompact::_accumulated_time; | |
| 600 unsigned int PSParallelCompact::_total_invocations = 0; | |
| 601 unsigned int PSParallelCompact::_maximum_compaction_gc_num = 0; | |
| 602 jlong PSParallelCompact::_time_of_last_gc = 0; | |
| 603 CollectorCounters* PSParallelCompact::_counters = NULL; | |
| 604 ParMarkBitMap PSParallelCompact::_mark_bitmap; | |
| 605 ParallelCompactData PSParallelCompact::_summary_data; | |
| 606 | |
| 607 PSParallelCompact::IsAliveClosure PSParallelCompact::_is_alive_closure; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
608 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
609 void PSParallelCompact::IsAliveClosure::do_object(oop p) { ShouldNotReachHere(); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
610 bool PSParallelCompact::IsAliveClosure::do_object_b(oop p) { return mark_bitmap()->is_marked(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
611 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
612 void PSParallelCompact::KeepAliveClosure::do_oop(oop* p) { PSParallelCompact::KeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
613 void PSParallelCompact::KeepAliveClosure::do_oop(narrowOop* p) { PSParallelCompact::KeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
614 |
| 0 | 615 PSParallelCompact::AdjustPointerClosure PSParallelCompact::_adjust_root_pointer_closure(true); |
| 616 PSParallelCompact::AdjustPointerClosure PSParallelCompact::_adjust_pointer_closure(false); | |
| 617 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
618 void PSParallelCompact::AdjustPointerClosure::do_oop(oop* p) { adjust_pointer(p, _is_root); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
619 void PSParallelCompact::AdjustPointerClosure::do_oop(narrowOop* p) { adjust_pointer(p, _is_root); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
620 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
621 void PSParallelCompact::FollowStackClosure::do_void() { follow_stack(_compaction_manager); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
622 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
623 void PSParallelCompact::MarkAndPushClosure::do_oop(oop* p) { mark_and_push(_compaction_manager, p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
624 void PSParallelCompact::MarkAndPushClosure::do_oop(narrowOop* p) { mark_and_push(_compaction_manager, p); } |
| 0 | 625 |
| 626 void PSParallelCompact::post_initialize() { | |
| 627 ParallelScavengeHeap* heap = gc_heap(); | |
| 628 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); | |
| 629 | |
| 630 MemRegion mr = heap->reserved_region(); | |
| 631 _ref_processor = ReferenceProcessor::create_ref_processor( | |
| 632 mr, // span | |
| 633 true, // atomic_discovery | |
| 634 true, // mt_discovery | |
| 635 &_is_alive_closure, | |
| 636 ParallelGCThreads, | |
| 637 ParallelRefProcEnabled); | |
| 638 _counters = new CollectorCounters("PSParallelCompact", 1); | |
| 639 | |
| 640 // Initialize static fields in ParCompactionManager. | |
| 641 ParCompactionManager::initialize(mark_bitmap()); | |
| 642 } | |
| 643 | |
| 644 bool PSParallelCompact::initialize() { | |
| 645 ParallelScavengeHeap* heap = gc_heap(); | |
| 646 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); | |
| 647 MemRegion mr = heap->reserved_region(); | |
| 648 | |
| 649 // Was the old gen get allocated successfully? | |
| 650 if (!heap->old_gen()->is_allocated()) { | |
| 651 return false; | |
| 652 } | |
| 653 | |
| 654 initialize_space_info(); | |
| 655 initialize_dead_wood_limiter(); | |
| 656 | |
| 657 if (!_mark_bitmap.initialize(mr)) { | |
| 658 vm_shutdown_during_initialization("Unable to allocate bit map for " | |
| 659 "parallel garbage collection for the requested heap size."); | |
| 660 return false; | |
| 661 } | |
| 662 | |
| 663 if (!_summary_data.initialize(mr)) { | |
| 664 vm_shutdown_during_initialization("Unable to allocate tables for " | |
| 665 "parallel garbage collection for the requested heap size."); | |
| 666 return false; | |
| 667 } | |
| 668 | |
| 669 return true; | |
| 670 } | |
| 671 | |
| 672 void PSParallelCompact::initialize_space_info() | |
| 673 { | |
| 674 memset(&_space_info, 0, sizeof(_space_info)); | |
| 675 | |
| 676 ParallelScavengeHeap* heap = gc_heap(); | |
| 677 PSYoungGen* young_gen = heap->young_gen(); | |
| 678 MutableSpace* perm_space = heap->perm_gen()->object_space(); | |
| 679 | |
| 680 _space_info[perm_space_id].set_space(perm_space); | |
| 681 _space_info[old_space_id].set_space(heap->old_gen()->object_space()); | |
| 682 _space_info[eden_space_id].set_space(young_gen->eden_space()); | |
| 683 _space_info[from_space_id].set_space(young_gen->from_space()); | |
| 684 _space_info[to_space_id].set_space(young_gen->to_space()); | |
| 685 | |
| 686 _space_info[perm_space_id].set_start_array(heap->perm_gen()->start_array()); | |
| 687 _space_info[old_space_id].set_start_array(heap->old_gen()->start_array()); | |
| 688 | |
| 689 _space_info[perm_space_id].set_min_dense_prefix(perm_space->top()); | |
| 690 if (TraceParallelOldGCDensePrefix) { | |
| 691 tty->print_cr("perm min_dense_prefix=" PTR_FORMAT, | |
| 692 _space_info[perm_space_id].min_dense_prefix()); | |
| 693 } | |
| 694 } | |
| 695 | |
| 696 void PSParallelCompact::initialize_dead_wood_limiter() | |
| 697 { | |
| 698 const size_t max = 100; | |
| 699 _dwl_mean = double(MIN2(ParallelOldDeadWoodLimiterMean, max)) / 100.0; | |
| 700 _dwl_std_dev = double(MIN2(ParallelOldDeadWoodLimiterStdDev, max)) / 100.0; | |
| 701 _dwl_first_term = 1.0 / (sqrt(2.0 * M_PI) * _dwl_std_dev); | |
| 702 DEBUG_ONLY(_dwl_initialized = true;) | |
| 703 _dwl_adjustment = normal_distribution(1.0); | |
| 704 } | |
| 705 | |
| 706 // Simple class for storing info about the heap at the start of GC, to be used | |
| 707 // after GC for comparison/printing. | |
| 708 class PreGCValues { | |
| 709 public: | |
| 710 PreGCValues() { } | |
| 711 PreGCValues(ParallelScavengeHeap* heap) { fill(heap); } | |
| 712 | |
| 713 void fill(ParallelScavengeHeap* heap) { | |
| 714 _heap_used = heap->used(); | |
| 715 _young_gen_used = heap->young_gen()->used_in_bytes(); | |
| 716 _old_gen_used = heap->old_gen()->used_in_bytes(); | |
| 717 _perm_gen_used = heap->perm_gen()->used_in_bytes(); | |
| 718 }; | |
| 719 | |
| 720 size_t heap_used() const { return _heap_used; } | |
| 721 size_t young_gen_used() const { return _young_gen_used; } | |
| 722 size_t old_gen_used() const { return _old_gen_used; } | |
| 723 size_t perm_gen_used() const { return _perm_gen_used; } | |
| 724 | |
| 725 private: | |
| 726 size_t _heap_used; | |
| 727 size_t _young_gen_used; | |
| 728 size_t _old_gen_used; | |
| 729 size_t _perm_gen_used; | |
| 730 }; | |
| 731 | |
| 732 void | |
| 733 PSParallelCompact::clear_data_covering_space(SpaceId id) | |
| 734 { | |
| 735 // At this point, top is the value before GC, new_top() is the value that will | |
| 736 // be set at the end of GC. The marking bitmap is cleared to top; nothing | |
| 737 // should be marked above top. The summary data is cleared to the larger of | |
| 738 // top & new_top. | |
| 739 MutableSpace* const space = _space_info[id].space(); | |
| 740 HeapWord* const bot = space->bottom(); | |
| 741 HeapWord* const top = space->top(); | |
| 742 HeapWord* const max_top = MAX2(top, _space_info[id].new_top()); | |
| 743 | |
| 744 const idx_t beg_bit = _mark_bitmap.addr_to_bit(bot); | |
| 745 const idx_t end_bit = BitMap::word_align_up(_mark_bitmap.addr_to_bit(top)); | |
| 746 _mark_bitmap.clear_range(beg_bit, end_bit); | |
| 747 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
748 const size_t beg_region = _summary_data.addr_to_region_idx(bot); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
749 const size_t end_region = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
750 _summary_data.addr_to_region_idx(_summary_data.region_align_up(max_top)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
751 _summary_data.clear_range(beg_region, end_region); |
| 0 | 752 } |
| 753 | |
| 754 void PSParallelCompact::pre_compact(PreGCValues* pre_gc_values) | |
| 755 { | |
| 756 // Update the from & to space pointers in space_info, since they are swapped | |
| 757 // at each young gen gc. Do the update unconditionally (even though a | |
| 758 // promotion failure does not swap spaces) because an unknown number of minor | |
| 759 // collections will have swapped the spaces an unknown number of times. | |
| 760 TraceTime tm("pre compact", print_phases(), true, gclog_or_tty); | |
| 761 ParallelScavengeHeap* heap = gc_heap(); | |
| 762 _space_info[from_space_id].set_space(heap->young_gen()->from_space()); | |
| 763 _space_info[to_space_id].set_space(heap->young_gen()->to_space()); | |
| 764 | |
| 765 pre_gc_values->fill(heap); | |
| 766 | |
| 767 ParCompactionManager::reset(); | |
| 768 NOT_PRODUCT(_mark_bitmap.reset_counters()); | |
| 769 DEBUG_ONLY(add_obj_count = add_obj_size = 0;) | |
| 770 DEBUG_ONLY(mark_bitmap_count = mark_bitmap_size = 0;) | |
| 771 | |
| 772 // Increment the invocation count | |
|
139
c0492d52d55b
6539517: CR 6186200 should be extended to perm gen allocation to prevent spurious OOM's from perm gen
apetrusenko
parents:
0
diff
changeset
|
773 heap->increment_total_collections(true); |
| 0 | 774 |
| 775 // We need to track unique mark sweep invocations as well. | |
| 776 _total_invocations++; | |
| 777 | |
| 778 if (PrintHeapAtGC) { | |
| 779 Universe::print_heap_before_gc(); | |
| 780 } | |
| 781 | |
| 782 // Fill in TLABs | |
| 783 heap->accumulate_statistics_all_tlabs(); | |
| 784 heap->ensure_parsability(true); // retire TLABs | |
| 785 | |
| 786 if (VerifyBeforeGC && heap->total_collections() >= VerifyGCStartAt) { | |
| 787 HandleMark hm; // Discard invalid handles created during verification | |
| 788 gclog_or_tty->print(" VerifyBeforeGC:"); | |
| 789 Universe::verify(true); | |
| 790 } | |
| 791 | |
| 792 // Verify object start arrays | |
| 793 if (VerifyObjectStartArray && | |
| 794 VerifyBeforeGC) { | |
| 795 heap->old_gen()->verify_object_start_array(); | |
| 796 heap->perm_gen()->verify_object_start_array(); | |
| 797 } | |
| 798 | |
| 799 DEBUG_ONLY(mark_bitmap()->verify_clear();) | |
| 800 DEBUG_ONLY(summary_data().verify_clear();) | |
| 210 | 801 |
| 802 // Have worker threads release resources the next time they run a task. | |
| 803 gc_task_manager()->release_all_resources(); | |
| 0 | 804 } |
| 805 | |
| 806 void PSParallelCompact::post_compact() | |
| 807 { | |
| 808 TraceTime tm("post compact", print_phases(), true, gclog_or_tty); | |
| 809 | |
| 810 // Clear the marking bitmap and summary data and update top() in each space. | |
| 811 for (unsigned int id = perm_space_id; id < last_space_id; ++id) { | |
| 812 clear_data_covering_space(SpaceId(id)); | |
| 813 _space_info[id].space()->set_top(_space_info[id].new_top()); | |
| 814 } | |
| 815 | |
| 816 MutableSpace* const eden_space = _space_info[eden_space_id].space(); | |
| 817 MutableSpace* const from_space = _space_info[from_space_id].space(); | |
| 818 MutableSpace* const to_space = _space_info[to_space_id].space(); | |
| 819 | |
| 820 ParallelScavengeHeap* heap = gc_heap(); | |
| 821 bool eden_empty = eden_space->is_empty(); | |
| 822 if (!eden_empty) { | |
| 823 eden_empty = absorb_live_data_from_eden(heap->size_policy(), | |
| 824 heap->young_gen(), heap->old_gen()); | |
| 825 } | |
| 826 | |
| 827 // Update heap occupancy information which is used as input to the soft ref | |
| 828 // clearing policy at the next gc. | |
| 829 Universe::update_heap_info_at_gc(); | |
| 830 | |
| 831 bool young_gen_empty = eden_empty && from_space->is_empty() && | |
| 832 to_space->is_empty(); | |
| 833 | |
| 834 BarrierSet* bs = heap->barrier_set(); | |
| 835 if (bs->is_a(BarrierSet::ModRef)) { | |
| 836 ModRefBarrierSet* modBS = (ModRefBarrierSet*)bs; | |
| 837 MemRegion old_mr = heap->old_gen()->reserved(); | |
| 838 MemRegion perm_mr = heap->perm_gen()->reserved(); | |
| 839 assert(perm_mr.end() <= old_mr.start(), "Generations out of order"); | |
| 840 | |
| 841 if (young_gen_empty) { | |
| 842 modBS->clear(MemRegion(perm_mr.start(), old_mr.end())); | |
| 843 } else { | |
| 844 modBS->invalidate(MemRegion(perm_mr.start(), old_mr.end())); | |
| 845 } | |
| 846 } | |
| 847 | |
| 848 Threads::gc_epilogue(); | |
| 849 CodeCache::gc_epilogue(); | |
| 850 | |
| 851 COMPILER2_PRESENT(DerivedPointerTable::update_pointers()); | |
| 852 | |
| 853 ref_processor()->enqueue_discovered_references(NULL); | |
| 854 | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
855 if (ZapUnusedHeapArea) { |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
856 heap->gen_mangle_unused_area(); |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
857 } |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
858 |
| 0 | 859 // Update time of last GC |
| 860 reset_millis_since_last_gc(); | |
| 861 } | |
| 862 | |
| 863 HeapWord* | |
| 864 PSParallelCompact::compute_dense_prefix_via_density(const SpaceId id, | |
| 865 bool maximum_compaction) | |
| 866 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
867 const size_t region_size = ParallelCompactData::RegionSize; |
| 0 | 868 const ParallelCompactData& sd = summary_data(); |
| 869 | |
| 870 const MutableSpace* const space = _space_info[id].space(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
871 HeapWord* const top_aligned_up = sd.region_align_up(space->top()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
872 const RegionData* const beg_cp = sd.addr_to_region_ptr(space->bottom()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
873 const RegionData* const end_cp = sd.addr_to_region_ptr(top_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
874 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
875 // Skip full regions at the beginning of the space--they are necessarily part |
| 0 | 876 // of the dense prefix. |
| 877 size_t full_count = 0; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
878 const RegionData* cp; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
879 for (cp = beg_cp; cp < end_cp && cp->data_size() == region_size; ++cp) { |
| 0 | 880 ++full_count; |
| 881 } | |
| 882 | |
| 883 assert(total_invocations() >= _maximum_compaction_gc_num, "sanity"); | |
| 884 const size_t gcs_since_max = total_invocations() - _maximum_compaction_gc_num; | |
| 885 const bool interval_ended = gcs_since_max > HeapMaximumCompactionInterval; | |
| 886 if (maximum_compaction || cp == end_cp || interval_ended) { | |
| 887 _maximum_compaction_gc_num = total_invocations(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
888 return sd.region_to_addr(cp); |
| 0 | 889 } |
| 890 | |
| 891 HeapWord* const new_top = _space_info[id].new_top(); | |
| 892 const size_t space_live = pointer_delta(new_top, space->bottom()); | |
| 893 const size_t space_used = space->used_in_words(); | |
| 894 const size_t space_capacity = space->capacity_in_words(); | |
| 895 | |
| 896 const double cur_density = double(space_live) / space_capacity; | |
| 897 const double deadwood_density = | |
| 898 (1.0 - cur_density) * (1.0 - cur_density) * cur_density * cur_density; | |
| 899 const size_t deadwood_goal = size_t(space_capacity * deadwood_density); | |
| 900 | |
| 901 if (TraceParallelOldGCDensePrefix) { | |
| 902 tty->print_cr("cur_dens=%5.3f dw_dens=%5.3f dw_goal=" SIZE_FORMAT, | |
| 903 cur_density, deadwood_density, deadwood_goal); | |
| 904 tty->print_cr("space_live=" SIZE_FORMAT " " "space_used=" SIZE_FORMAT " " | |
| 905 "space_cap=" SIZE_FORMAT, | |
| 906 space_live, space_used, | |
| 907 space_capacity); | |
| 908 } | |
| 909 | |
| 910 // XXX - Use binary search? | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
911 HeapWord* dense_prefix = sd.region_to_addr(cp); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
912 const RegionData* full_cp = cp; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
913 const RegionData* const top_cp = sd.addr_to_region_ptr(space->top() - 1); |
| 0 | 914 while (cp < end_cp) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
915 HeapWord* region_destination = cp->destination(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
916 const size_t cur_deadwood = pointer_delta(dense_prefix, region_destination); |
| 0 | 917 if (TraceParallelOldGCDensePrefix && Verbose) { |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
918 tty->print_cr("c#=" SIZE_FORMAT_W(4) " dst=" PTR_FORMAT " " |
|
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
919 "dp=" SIZE_FORMAT_W(8) " " "cdw=" SIZE_FORMAT_W(8), |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
920 sd.region(cp), region_destination, |
| 0 | 921 dense_prefix, cur_deadwood); |
| 922 } | |
| 923 | |
| 924 if (cur_deadwood >= deadwood_goal) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
925 // Found the region that has the correct amount of deadwood to the left. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
926 // This typically occurs after crossing a fairly sparse set of regions, so |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
927 // iterate backwards over those sparse regions, looking for the region |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
928 // that has the lowest density of live objects 'to the right.' |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
929 size_t space_to_left = sd.region(cp) * region_size; |
| 0 | 930 size_t live_to_left = space_to_left - cur_deadwood; |
| 931 size_t space_to_right = space_capacity - space_to_left; | |
| 932 size_t live_to_right = space_live - live_to_left; | |
| 933 double density_to_right = double(live_to_right) / space_to_right; | |
| 934 while (cp > full_cp) { | |
| 935 --cp; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
936 const size_t prev_region_live_to_right = live_to_right - |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
937 cp->data_size(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
938 const size_t prev_region_space_to_right = space_to_right + region_size; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
939 double prev_region_density_to_right = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
940 double(prev_region_live_to_right) / prev_region_space_to_right; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
941 if (density_to_right <= prev_region_density_to_right) { |
| 0 | 942 return dense_prefix; |
| 943 } | |
| 944 if (TraceParallelOldGCDensePrefix && Verbose) { | |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
945 tty->print_cr("backing up from c=" SIZE_FORMAT_W(4) " d2r=%10.8f " |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
946 "pc_d2r=%10.8f", sd.region(cp), density_to_right, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
947 prev_region_density_to_right); |
| 0 | 948 } |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
949 dense_prefix -= region_size; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
950 live_to_right = prev_region_live_to_right; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
951 space_to_right = prev_region_space_to_right; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
952 density_to_right = prev_region_density_to_right; |
| 0 | 953 } |
| 954 return dense_prefix; | |
| 955 } | |
| 956 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
957 dense_prefix += region_size; |
| 0 | 958 ++cp; |
| 959 } | |
| 960 | |
| 961 return dense_prefix; | |
| 962 } | |
| 963 | |
| 964 #ifndef PRODUCT | |
| 965 void PSParallelCompact::print_dense_prefix_stats(const char* const algorithm, | |
| 966 const SpaceId id, | |
| 967 const bool maximum_compaction, | |
| 968 HeapWord* const addr) | |
| 969 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
970 const size_t region_idx = summary_data().addr_to_region_idx(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
971 RegionData* const cp = summary_data().region(region_idx); |
| 0 | 972 const MutableSpace* const space = _space_info[id].space(); |
| 973 HeapWord* const new_top = _space_info[id].new_top(); | |
| 974 | |
| 975 const size_t space_live = pointer_delta(new_top, space->bottom()); | |
| 976 const size_t dead_to_left = pointer_delta(addr, cp->destination()); | |
| 977 const size_t space_cap = space->capacity_in_words(); | |
| 978 const double dead_to_left_pct = double(dead_to_left) / space_cap; | |
| 979 const size_t live_to_right = new_top - cp->destination(); | |
| 980 const size_t dead_to_right = space->top() - addr - live_to_right; | |
| 981 | |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
982 tty->print_cr("%s=" PTR_FORMAT " dpc=" SIZE_FORMAT_W(5) " " |
| 0 | 983 "spl=" SIZE_FORMAT " " |
| 984 "d2l=" SIZE_FORMAT " d2l%%=%6.4f " | |
| 985 "d2r=" SIZE_FORMAT " l2r=" SIZE_FORMAT | |
| 986 " ratio=%10.8f", | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
987 algorithm, addr, region_idx, |
| 0 | 988 space_live, |
| 989 dead_to_left, dead_to_left_pct, | |
| 990 dead_to_right, live_to_right, | |
| 991 double(dead_to_right) / live_to_right); | |
| 992 } | |
| 993 #endif // #ifndef PRODUCT | |
| 994 | |
| 995 // Return a fraction indicating how much of the generation can be treated as | |
| 996 // "dead wood" (i.e., not reclaimed). The function uses a normal distribution | |
| 997 // based on the density of live objects in the generation to determine a limit, | |
| 998 // which is then adjusted so the return value is min_percent when the density is | |
| 999 // 1. | |
| 1000 // | |
| 1001 // The following table shows some return values for a different values of the | |
| 1002 // standard deviation (ParallelOldDeadWoodLimiterStdDev); the mean is 0.5 and | |
| 1003 // min_percent is 1. | |
| 1004 // | |
| 1005 // fraction allowed as dead wood | |
| 1006 // ----------------------------------------------------------------- | |
| 1007 // density std_dev=70 std_dev=75 std_dev=80 std_dev=85 std_dev=90 std_dev=95 | |
| 1008 // ------- ---------- ---------- ---------- ---------- ---------- ---------- | |
| 1009 // 0.00000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 | |
| 1010 // 0.05000 0.03193096 0.02836880 0.02550828 0.02319280 0.02130337 0.01974941 | |
| 1011 // 0.10000 0.05247504 0.04547452 0.03988045 0.03537016 0.03170171 0.02869272 | |
| 1012 // 0.15000 0.07135702 0.06111390 0.05296419 0.04641639 0.04110601 0.03676066 | |
| 1013 // 0.20000 0.08831616 0.07509618 0.06461766 0.05622444 0.04943437 0.04388975 | |
| 1014 // 0.25000 0.10311208 0.08724696 0.07471205 0.06469760 0.05661313 0.05002313 | |
| 1015 // 0.30000 0.11553050 0.09741183 0.08313394 0.07175114 0.06257797 0.05511132 | |
| 1016 // 0.35000 0.12538832 0.10545958 0.08978741 0.07731366 0.06727491 0.05911289 | |
| 1017 // 0.40000 0.13253818 0.11128511 0.09459590 0.08132834 0.07066107 0.06199500 | |
| 1018 // 0.45000 0.13687208 0.11481163 0.09750361 0.08375387 0.07270534 0.06373386 | |
| 1019 // 0.50000 0.13832410 0.11599237 0.09847664 0.08456518 0.07338887 0.06431510 | |
| 1020 // 0.55000 0.13687208 0.11481163 0.09750361 0.08375387 0.07270534 0.06373386 | |
| 1021 // 0.60000 0.13253818 0.11128511 0.09459590 0.08132834 0.07066107 0.06199500 | |
| 1022 // 0.65000 0.12538832 0.10545958 0.08978741 0.07731366 0.06727491 0.05911289 | |
| 1023 // 0.70000 0.11553050 0.09741183 0.08313394 0.07175114 0.06257797 0.05511132 | |
| 1024 // 0.75000 0.10311208 0.08724696 0.07471205 0.06469760 0.05661313 0.05002313 | |
| 1025 // 0.80000 0.08831616 0.07509618 0.06461766 0.05622444 0.04943437 0.04388975 | |
| 1026 // 0.85000 0.07135702 0.06111390 0.05296419 0.04641639 0.04110601 0.03676066 | |
| 1027 // 0.90000 0.05247504 0.04547452 0.03988045 0.03537016 0.03170171 0.02869272 | |
| 1028 // 0.95000 0.03193096 0.02836880 0.02550828 0.02319280 0.02130337 0.01974941 | |
| 1029 // 1.00000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 0.01000000 | |
| 1030 | |
| 1031 double PSParallelCompact::dead_wood_limiter(double density, size_t min_percent) | |
| 1032 { | |
| 1033 assert(_dwl_initialized, "uninitialized"); | |
| 1034 | |
| 1035 // The raw limit is the value of the normal distribution at x = density. | |
| 1036 const double raw_limit = normal_distribution(density); | |
| 1037 | |
| 1038 // Adjust the raw limit so it becomes the minimum when the density is 1. | |
| 1039 // | |
| 1040 // First subtract the adjustment value (which is simply the precomputed value | |
| 1041 // normal_distribution(1.0)); this yields a value of 0 when the density is 1. | |
| 1042 // Then add the minimum value, so the minimum is returned when the density is | |
| 1043 // 1. Finally, prevent negative values, which occur when the mean is not 0.5. | |
| 1044 const double min = double(min_percent) / 100.0; | |
| 1045 const double limit = raw_limit - _dwl_adjustment + min; | |
| 1046 return MAX2(limit, 0.0); | |
| 1047 } | |
| 1048 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1049 ParallelCompactData::RegionData* |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1050 PSParallelCompact::first_dead_space_region(const RegionData* beg, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1051 const RegionData* end) |
| 0 | 1052 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1053 const size_t region_size = ParallelCompactData::RegionSize; |
| 0 | 1054 ParallelCompactData& sd = summary_data(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1055 size_t left = sd.region(beg); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1056 size_t right = end > beg ? sd.region(end) - 1 : left; |
| 0 | 1057 |
| 1058 // Binary search. | |
| 1059 while (left < right) { | |
| 1060 // Equivalent to (left + right) / 2, but does not overflow. | |
| 1061 const size_t middle = left + (right - left) / 2; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1062 RegionData* const middle_ptr = sd.region(middle); |
| 0 | 1063 HeapWord* const dest = middle_ptr->destination(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1064 HeapWord* const addr = sd.region_to_addr(middle); |
| 0 | 1065 assert(dest != NULL, "sanity"); |
| 1066 assert(dest <= addr, "must move left"); | |
| 1067 | |
| 1068 if (middle > left && dest < addr) { | |
| 1069 right = middle - 1; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1070 } else if (middle < right && middle_ptr->data_size() == region_size) { |
| 0 | 1071 left = middle + 1; |
| 1072 } else { | |
| 1073 return middle_ptr; | |
| 1074 } | |
| 1075 } | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1076 return sd.region(left); |
| 0 | 1077 } |
| 1078 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1079 ParallelCompactData::RegionData* |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1080 PSParallelCompact::dead_wood_limit_region(const RegionData* beg, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1081 const RegionData* end, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1082 size_t dead_words) |
| 0 | 1083 { |
| 1084 ParallelCompactData& sd = summary_data(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1085 size_t left = sd.region(beg); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1086 size_t right = end > beg ? sd.region(end) - 1 : left; |
| 0 | 1087 |
| 1088 // Binary search. | |
| 1089 while (left < right) { | |
| 1090 // Equivalent to (left + right) / 2, but does not overflow. | |
| 1091 const size_t middle = left + (right - left) / 2; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1092 RegionData* const middle_ptr = sd.region(middle); |
| 0 | 1093 HeapWord* const dest = middle_ptr->destination(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1094 HeapWord* const addr = sd.region_to_addr(middle); |
| 0 | 1095 assert(dest != NULL, "sanity"); |
| 1096 assert(dest <= addr, "must move left"); | |
| 1097 | |
| 1098 const size_t dead_to_left = pointer_delta(addr, dest); | |
| 1099 if (middle > left && dead_to_left > dead_words) { | |
| 1100 right = middle - 1; | |
| 1101 } else if (middle < right && dead_to_left < dead_words) { | |
| 1102 left = middle + 1; | |
| 1103 } else { | |
| 1104 return middle_ptr; | |
| 1105 } | |
| 1106 } | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1107 return sd.region(left); |
| 0 | 1108 } |
| 1109 | |
| 1110 // The result is valid during the summary phase, after the initial summarization | |
| 1111 // of each space into itself, and before final summarization. | |
| 1112 inline double | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1113 PSParallelCompact::reclaimed_ratio(const RegionData* const cp, |
| 0 | 1114 HeapWord* const bottom, |
| 1115 HeapWord* const top, | |
| 1116 HeapWord* const new_top) | |
| 1117 { | |
| 1118 ParallelCompactData& sd = summary_data(); | |
| 1119 | |
| 1120 assert(cp != NULL, "sanity"); | |
| 1121 assert(bottom != NULL, "sanity"); | |
| 1122 assert(top != NULL, "sanity"); | |
| 1123 assert(new_top != NULL, "sanity"); | |
| 1124 assert(top >= new_top, "summary data problem?"); | |
| 1125 assert(new_top > bottom, "space is empty; should not be here"); | |
| 1126 assert(new_top >= cp->destination(), "sanity"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1127 assert(top >= sd.region_to_addr(cp), "sanity"); |
| 0 | 1128 |
| 1129 HeapWord* const destination = cp->destination(); | |
| 1130 const size_t dense_prefix_live = pointer_delta(destination, bottom); | |
| 1131 const size_t compacted_region_live = pointer_delta(new_top, destination); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1132 const size_t compacted_region_used = pointer_delta(top, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1133 sd.region_to_addr(cp)); |
| 0 | 1134 const size_t reclaimable = compacted_region_used - compacted_region_live; |
| 1135 | |
| 1136 const double divisor = dense_prefix_live + 1.25 * compacted_region_live; | |
| 1137 return double(reclaimable) / divisor; | |
| 1138 } | |
| 1139 | |
| 1140 // Return the address of the end of the dense prefix, a.k.a. the start of the | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1141 // compacted region. The address is always on a region boundary. |
| 0 | 1142 // |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1143 // Completely full regions at the left are skipped, since no compaction can |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1144 // occur in those regions. Then the maximum amount of dead wood to allow is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1145 // computed, based on the density (amount live / capacity) of the generation; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1146 // the region with approximately that amount of dead space to the left is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1147 // identified as the limit region. Regions between the last completely full |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1148 // region and the limit region are scanned and the one that has the best |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1149 // (maximum) reclaimed_ratio() is selected. |
| 0 | 1150 HeapWord* |
| 1151 PSParallelCompact::compute_dense_prefix(const SpaceId id, | |
| 1152 bool maximum_compaction) | |
| 1153 { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1154 const size_t region_size = ParallelCompactData::RegionSize; |
| 0 | 1155 const ParallelCompactData& sd = summary_data(); |
| 1156 | |
| 1157 const MutableSpace* const space = _space_info[id].space(); | |
| 1158 HeapWord* const top = space->top(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1159 HeapWord* const top_aligned_up = sd.region_align_up(top); |
| 0 | 1160 HeapWord* const new_top = _space_info[id].new_top(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1161 HeapWord* const new_top_aligned_up = sd.region_align_up(new_top); |
| 0 | 1162 HeapWord* const bottom = space->bottom(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1163 const RegionData* const beg_cp = sd.addr_to_region_ptr(bottom); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1164 const RegionData* const top_cp = sd.addr_to_region_ptr(top_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1165 const RegionData* const new_top_cp = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1166 sd.addr_to_region_ptr(new_top_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1167 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1168 // Skip full regions at the beginning of the space--they are necessarily part |
| 0 | 1169 // of the dense prefix. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1170 const RegionData* const full_cp = first_dead_space_region(beg_cp, new_top_cp); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1171 assert(full_cp->destination() == sd.region_to_addr(full_cp) || |
| 0 | 1172 space->is_empty(), "no dead space allowed to the left"); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1173 assert(full_cp->data_size() < region_size || full_cp == new_top_cp - 1, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1174 "region must have dead space"); |
| 0 | 1175 |
| 1176 // The gc number is saved whenever a maximum compaction is done, and used to | |
| 1177 // determine when the maximum compaction interval has expired. This avoids | |
| 1178 // successive max compactions for different reasons. | |
| 1179 assert(total_invocations() >= _maximum_compaction_gc_num, "sanity"); | |
| 1180 const size_t gcs_since_max = total_invocations() - _maximum_compaction_gc_num; | |
| 1181 const bool interval_ended = gcs_since_max > HeapMaximumCompactionInterval || | |
| 1182 total_invocations() == HeapFirstMaximumCompactionCount; | |
| 1183 if (maximum_compaction || full_cp == top_cp || interval_ended) { | |
| 1184 _maximum_compaction_gc_num = total_invocations(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1185 return sd.region_to_addr(full_cp); |
| 0 | 1186 } |
| 1187 | |
| 1188 const size_t space_live = pointer_delta(new_top, bottom); | |
| 1189 const size_t space_used = space->used_in_words(); | |
| 1190 const size_t space_capacity = space->capacity_in_words(); | |
| 1191 | |
| 1192 const double density = double(space_live) / double(space_capacity); | |
| 1193 const size_t min_percent_free = | |
| 1194 id == perm_space_id ? PermMarkSweepDeadRatio : MarkSweepDeadRatio; | |
| 1195 const double limiter = dead_wood_limiter(density, min_percent_free); | |
| 1196 const size_t dead_wood_max = space_used - space_live; | |
| 1197 const size_t dead_wood_limit = MIN2(size_t(space_capacity * limiter), | |
| 1198 dead_wood_max); | |
| 1199 | |
| 1200 if (TraceParallelOldGCDensePrefix) { | |
| 1201 tty->print_cr("space_live=" SIZE_FORMAT " " "space_used=" SIZE_FORMAT " " | |
| 1202 "space_cap=" SIZE_FORMAT, | |
| 1203 space_live, space_used, | |
| 1204 space_capacity); | |
| 1205 tty->print_cr("dead_wood_limiter(%6.4f, %d)=%6.4f " | |
| 1206 "dead_wood_max=" SIZE_FORMAT " dead_wood_limit=" SIZE_FORMAT, | |
| 1207 density, min_percent_free, limiter, | |
| 1208 dead_wood_max, dead_wood_limit); | |
| 1209 } | |
| 1210 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1211 // Locate the region with the desired amount of dead space to the left. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1212 const RegionData* const limit_cp = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1213 dead_wood_limit_region(full_cp, top_cp, dead_wood_limit); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1214 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1215 // Scan from the first region with dead space to the limit region and find the |
| 0 | 1216 // one with the best (largest) reclaimed ratio. |
| 1217 double best_ratio = 0.0; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1218 const RegionData* best_cp = full_cp; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1219 for (const RegionData* cp = full_cp; cp < limit_cp; ++cp) { |
| 0 | 1220 double tmp_ratio = reclaimed_ratio(cp, bottom, top, new_top); |
| 1221 if (tmp_ratio > best_ratio) { | |
| 1222 best_cp = cp; | |
| 1223 best_ratio = tmp_ratio; | |
| 1224 } | |
| 1225 } | |
| 1226 | |
| 1227 #if 0 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1228 // Something to consider: if the region with the best ratio is 'close to' the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1229 // first region w/free space, choose the first region with free space |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1230 // ("first-free"). The first-free region is usually near the start of the |
| 0 | 1231 // heap, which means we are copying most of the heap already, so copy a bit |
| 1232 // more to get complete compaction. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1233 if (pointer_delta(best_cp, full_cp, sizeof(RegionData)) < 4) { |
| 0 | 1234 _maximum_compaction_gc_num = total_invocations(); |
| 1235 best_cp = full_cp; | |
| 1236 } | |
| 1237 #endif // #if 0 | |
| 1238 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1239 return sd.region_to_addr(best_cp); |
| 0 | 1240 } |
| 1241 | |
| 1242 void PSParallelCompact::summarize_spaces_quick() | |
| 1243 { | |
| 1244 for (unsigned int i = 0; i < last_space_id; ++i) { | |
| 1245 const MutableSpace* space = _space_info[i].space(); | |
| 1246 bool result = _summary_data.summarize(space->bottom(), space->end(), | |
| 1247 space->bottom(), space->top(), | |
| 1248 _space_info[i].new_top_addr()); | |
| 1249 assert(result, "should never fail"); | |
| 1250 _space_info[i].set_dense_prefix(space->bottom()); | |
| 1251 } | |
| 1252 } | |
| 1253 | |
| 1254 void PSParallelCompact::fill_dense_prefix_end(SpaceId id) | |
| 1255 { | |
| 1256 HeapWord* const dense_prefix_end = dense_prefix(id); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1257 const RegionData* region = _summary_data.addr_to_region_ptr(dense_prefix_end); |
| 0 | 1258 const idx_t dense_prefix_bit = _mark_bitmap.addr_to_bit(dense_prefix_end); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1259 if (dead_space_crosses_boundary(region, dense_prefix_bit)) { |
| 0 | 1260 // Only enough dead space is filled so that any remaining dead space to the |
| 1261 // left is larger than the minimum filler object. (The remainder is filled | |
| 1262 // during the copy/update phase.) | |
| 1263 // | |
| 1264 // The size of the dead space to the right of the boundary is not a | |
| 1265 // concern, since compaction will be able to use whatever space is | |
| 1266 // available. | |
| 1267 // | |
| 1268 // Here '||' is the boundary, 'x' represents a don't care bit and a box | |
| 1269 // surrounds the space to be filled with an object. | |
| 1270 // | |
| 1271 // In the 32-bit VM, each bit represents two 32-bit words: | |
| 1272 // +---+ | |
| 1273 // a) beg_bits: ... x x x | 0 | || 0 x x ... | |
| 1274 // end_bits: ... x x x | 0 | || 0 x x ... | |
| 1275 // +---+ | |
| 1276 // | |
| 1277 // In the 64-bit VM, each bit represents one 64-bit word: | |
| 1278 // +------------+ | |
| 1279 // b) beg_bits: ... x x x | 0 || 0 | x x ... | |
| 1280 // end_bits: ... x x 1 | 0 || 0 | x x ... | |
| 1281 // +------------+ | |
| 1282 // +-------+ | |
| 1283 // c) beg_bits: ... x x | 0 0 | || 0 x x ... | |
| 1284 // end_bits: ... x 1 | 0 0 | || 0 x x ... | |
| 1285 // +-------+ | |
| 1286 // +-----------+ | |
| 1287 // d) beg_bits: ... x | 0 0 0 | || 0 x x ... | |
| 1288 // end_bits: ... 1 | 0 0 0 | || 0 x x ... | |
| 1289 // +-----------+ | |
| 1290 // +-------+ | |
| 1291 // e) beg_bits: ... 0 0 | 0 0 | || 0 x x ... | |
| 1292 // end_bits: ... 0 0 | 0 0 | || 0 x x ... | |
| 1293 // +-------+ | |
| 1294 | |
| 1295 // Initially assume case a, c or e will apply. | |
| 1296 size_t obj_len = (size_t)oopDesc::header_size(); | |
| 1297 HeapWord* obj_beg = dense_prefix_end - obj_len; | |
| 1298 | |
| 1299 #ifdef _LP64 | |
| 1300 if (_mark_bitmap.is_obj_end(dense_prefix_bit - 2)) { | |
| 1301 // Case b above. | |
| 1302 obj_beg = dense_prefix_end - 1; | |
| 1303 } else if (!_mark_bitmap.is_obj_end(dense_prefix_bit - 3) && | |
| 1304 _mark_bitmap.is_obj_end(dense_prefix_bit - 4)) { | |
| 1305 // Case d above. | |
| 1306 obj_beg = dense_prefix_end - 3; | |
| 1307 obj_len = 3; | |
| 1308 } | |
| 1309 #endif // #ifdef _LP64 | |
| 1310 | |
|
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1311 gc_heap()->fill_with_object(obj_beg, obj_len); |
| 0 | 1312 _mark_bitmap.mark_obj(obj_beg, obj_len); |
| 1313 _summary_data.add_obj(obj_beg, obj_len); | |
| 1314 assert(start_array(id) != NULL, "sanity"); | |
| 1315 start_array(id)->allocate_block(obj_beg); | |
| 1316 } | |
| 1317 } | |
| 1318 | |
| 1319 void | |
| 1320 PSParallelCompact::summarize_space(SpaceId id, bool maximum_compaction) | |
| 1321 { | |
| 1322 assert(id < last_space_id, "id out of range"); | |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1323 assert(_space_info[id].dense_prefix() == _space_info[id].space()->bottom(), |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1324 "should have been set in summarize_spaces_quick()"); |
| 0 | 1325 |
| 1326 const MutableSpace* space = _space_info[id].space(); | |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1327 if (_space_info[id].new_top() != space->bottom()) { |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1328 HeapWord* dense_prefix_end = compute_dense_prefix(id, maximum_compaction); |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1329 _space_info[id].set_dense_prefix(dense_prefix_end); |
| 0 | 1330 |
| 1331 #ifndef PRODUCT | |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1332 if (TraceParallelOldGCDensePrefix) { |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1333 print_dense_prefix_stats("ratio", id, maximum_compaction, |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1334 dense_prefix_end); |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1335 HeapWord* addr = compute_dense_prefix_via_density(id, maximum_compaction); |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1336 print_dense_prefix_stats("density", id, maximum_compaction, addr); |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1337 } |
| 0 | 1338 #endif // #ifndef PRODUCT |
| 1339 | |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1340 // If dead space crosses the dense prefix boundary, it is (at least |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1341 // partially) filled with a dummy object, marked live and added to the |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1342 // summary data. This simplifies the copy/update phase and must be done |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1343 // before the final locations of objects are determined, to prevent leaving |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1344 // a fragment of dead space that is too small to fill with an object. |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1345 if (!maximum_compaction && dense_prefix_end != space->bottom()) { |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1346 fill_dense_prefix_end(id); |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1347 } |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1348 |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1349 // Compute the destination of each Region, and thus each object. |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1350 _summary_data.summarize_dense_prefix(space->bottom(), dense_prefix_end); |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1351 _summary_data.summarize(dense_prefix_end, space->end(), |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1352 dense_prefix_end, space->top(), |
|
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1353 _space_info[id].new_top_addr()); |
| 0 | 1354 } |
| 1355 | |
| 1356 if (TraceParallelOldGCSummaryPhase) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1357 const size_t region_size = ParallelCompactData::RegionSize; |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1358 HeapWord* const dense_prefix_end = _space_info[id].dense_prefix(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1359 const size_t dp_region = _summary_data.addr_to_region_idx(dense_prefix_end); |
| 0 | 1360 const size_t dp_words = pointer_delta(dense_prefix_end, space->bottom()); |
|
265
f88815ca1af1
6483129: par compact assertion failure (new_top > bottom)
jcoomes
parents:
264
diff
changeset
|
1361 HeapWord* const new_top = _space_info[id].new_top(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1362 const HeapWord* nt_aligned_up = _summary_data.region_align_up(new_top); |
| 0 | 1363 const size_t cr_words = pointer_delta(nt_aligned_up, dense_prefix_end); |
| 1364 tty->print_cr("id=%d cap=" SIZE_FORMAT " dp=" PTR_FORMAT " " | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1365 "dp_region=" SIZE_FORMAT " " "dp_count=" SIZE_FORMAT " " |
| 0 | 1366 "cr_count=" SIZE_FORMAT " " "nt=" PTR_FORMAT, |
| 1367 id, space->capacity_in_words(), dense_prefix_end, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1368 dp_region, dp_words / region_size, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1369 cr_words / region_size, new_top); |
| 0 | 1370 } |
| 1371 } | |
| 1372 | |
| 1373 void PSParallelCompact::summary_phase(ParCompactionManager* cm, | |
| 1374 bool maximum_compaction) | |
| 1375 { | |
| 1376 EventMark m("2 summarize"); | |
| 1377 TraceTime tm("summary phase", print_phases(), true, gclog_or_tty); | |
| 1378 // trace("2"); | |
| 1379 | |
| 1380 #ifdef ASSERT | |
| 1381 if (TraceParallelOldGCMarkingPhase) { | |
| 1382 tty->print_cr("add_obj_count=" SIZE_FORMAT " " | |
| 1383 "add_obj_bytes=" SIZE_FORMAT, | |
| 1384 add_obj_count, add_obj_size * HeapWordSize); | |
| 1385 tty->print_cr("mark_bitmap_count=" SIZE_FORMAT " " | |
| 1386 "mark_bitmap_bytes=" SIZE_FORMAT, | |
| 1387 mark_bitmap_count, mark_bitmap_size * HeapWordSize); | |
| 1388 } | |
| 1389 #endif // #ifdef ASSERT | |
| 1390 | |
| 1391 // Quick summarization of each space into itself, to see how much is live. | |
| 1392 summarize_spaces_quick(); | |
| 1393 | |
| 1394 if (TraceParallelOldGCSummaryPhase) { | |
| 1395 tty->print_cr("summary_phase: after summarizing each space to self"); | |
| 1396 Universe::print(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1397 NOT_PRODUCT(print_region_ranges()); |
| 0 | 1398 if (Verbose) { |
| 1399 NOT_PRODUCT(print_initial_summary_data(_summary_data, _space_info)); | |
| 1400 } | |
| 1401 } | |
| 1402 | |
| 1403 // The amount of live data that will end up in old space (assuming it fits). | |
| 1404 size_t old_space_total_live = 0; | |
| 1405 unsigned int id; | |
| 1406 for (id = old_space_id; id < last_space_id; ++id) { | |
| 1407 old_space_total_live += pointer_delta(_space_info[id].new_top(), | |
| 1408 _space_info[id].space()->bottom()); | |
| 1409 } | |
| 1410 | |
| 1411 const MutableSpace* old_space = _space_info[old_space_id].space(); | |
| 1412 if (old_space_total_live > old_space->capacity_in_words()) { | |
| 1413 // XXX - should also try to expand | |
| 1414 maximum_compaction = true; | |
| 1415 } else if (!UseParallelOldGCDensePrefix) { | |
| 1416 maximum_compaction = true; | |
| 1417 } | |
| 1418 | |
| 1419 // Permanent and Old generations. | |
| 1420 summarize_space(perm_space_id, maximum_compaction); | |
| 1421 summarize_space(old_space_id, maximum_compaction); | |
| 1422 | |
| 1423 // Summarize the remaining spaces (those in the young gen) into old space. If | |
| 1424 // the live data from a space doesn't fit, the existing summarization is left | |
| 1425 // intact, so the data is compacted down within the space itself. | |
| 1426 HeapWord** new_top_addr = _space_info[old_space_id].new_top_addr(); | |
| 1427 HeapWord* const target_space_end = old_space->end(); | |
| 1428 for (id = eden_space_id; id < last_space_id; ++id) { | |
| 1429 const MutableSpace* space = _space_info[id].space(); | |
| 1430 const size_t live = pointer_delta(_space_info[id].new_top(), | |
| 1431 space->bottom()); | |
| 1432 const size_t available = pointer_delta(target_space_end, *new_top_addr); | |
|
266
2214b226b7f0
6724367: par compact could clear less young gen summary data
jcoomes
parents:
265
diff
changeset
|
1433 if (live > 0 && live <= available) { |
| 0 | 1434 // All the live data will fit. |
| 1435 if (TraceParallelOldGCSummaryPhase) { | |
| 1436 tty->print_cr("summarizing %d into old_space @ " PTR_FORMAT, | |
| 1437 id, *new_top_addr); | |
| 1438 } | |
| 1439 _summary_data.summarize(*new_top_addr, target_space_end, | |
| 1440 space->bottom(), space->top(), | |
| 1441 new_top_addr); | |
| 1442 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1443 // Clear the source_region field for each region in the space. |
|
266
2214b226b7f0
6724367: par compact could clear less young gen summary data
jcoomes
parents:
265
diff
changeset
|
1444 HeapWord* const new_top = _space_info[id].new_top(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1445 HeapWord* const clear_end = _summary_data.region_align_up(new_top); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1446 RegionData* beg_region = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1447 _summary_data.addr_to_region_ptr(space->bottom()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1448 RegionData* end_region = _summary_data.addr_to_region_ptr(clear_end); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1449 while (beg_region < end_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1450 beg_region->set_source_region(0); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1451 ++beg_region; |
| 0 | 1452 } |
|
266
2214b226b7f0
6724367: par compact could clear less young gen summary data
jcoomes
parents:
265
diff
changeset
|
1453 |
|
2214b226b7f0
6724367: par compact could clear less young gen summary data
jcoomes
parents:
265
diff
changeset
|
1454 // Reset the new_top value for the space. |
|
2214b226b7f0
6724367: par compact could clear less young gen summary data
jcoomes
parents:
265
diff
changeset
|
1455 _space_info[id].set_new_top(space->bottom()); |
| 0 | 1456 } |
| 1457 } | |
| 1458 | |
| 1459 if (TraceParallelOldGCSummaryPhase) { | |
| 1460 tty->print_cr("summary_phase: after final summarization"); | |
| 1461 Universe::print(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1462 NOT_PRODUCT(print_region_ranges()); |
| 0 | 1463 if (Verbose) { |
| 1464 NOT_PRODUCT(print_generic_summary_data(_summary_data, _space_info)); | |
| 1465 } | |
| 1466 } | |
| 1467 } | |
| 1468 | |
| 1469 // This method should contain all heap-specific policy for invoking a full | |
| 1470 // collection. invoke_no_policy() will only attempt to compact the heap; it | |
| 1471 // will do nothing further. If we need to bail out for policy reasons, scavenge | |
| 1472 // before full gc, or any other specialized behavior, it needs to be added here. | |
| 1473 // | |
| 1474 // Note that this method should only be called from the vm_thread while at a | |
| 1475 // safepoint. | |
| 1476 void PSParallelCompact::invoke(bool maximum_heap_compaction) { | |
| 1477 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); | |
| 1478 assert(Thread::current() == (Thread*)VMThread::vm_thread(), | |
| 1479 "should be in vm thread"); | |
| 1480 ParallelScavengeHeap* heap = gc_heap(); | |
| 1481 GCCause::Cause gc_cause = heap->gc_cause(); | |
| 1482 assert(!heap->is_gc_active(), "not reentrant"); | |
| 1483 | |
| 1484 PSAdaptiveSizePolicy* policy = heap->size_policy(); | |
| 1485 | |
| 1486 // Before each allocation/collection attempt, find out from the | |
| 1487 // policy object if GCs are, on the whole, taking too long. If so, | |
| 1488 // bail out without attempting a collection. The exceptions are | |
| 1489 // for explicitly requested GC's. | |
| 1490 if (!policy->gc_time_limit_exceeded() || | |
| 1491 GCCause::is_user_requested_gc(gc_cause) || | |
| 1492 GCCause::is_serviceability_requested_gc(gc_cause)) { | |
| 1493 IsGCActiveMark mark; | |
| 1494 | |
| 1495 if (ScavengeBeforeFullGC) { | |
| 1496 PSScavenge::invoke_no_policy(); | |
| 1497 } | |
| 1498 | |
| 1499 PSParallelCompact::invoke_no_policy(maximum_heap_compaction); | |
| 1500 } | |
| 1501 } | |
| 1502 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1503 bool ParallelCompactData::region_contains(size_t region_index, HeapWord* addr) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1504 size_t addr_region_index = addr_to_region_idx(addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1505 return region_index == addr_region_index; |
| 0 | 1506 } |
| 1507 | |
| 1508 // This method contains no policy. You should probably | |
| 1509 // be calling invoke() instead. | |
| 1510 void PSParallelCompact::invoke_no_policy(bool maximum_heap_compaction) { | |
| 1511 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); | |
| 1512 assert(ref_processor() != NULL, "Sanity"); | |
| 1513 | |
|
139
c0492d52d55b
6539517: CR 6186200 should be extended to perm gen allocation to prevent spurious OOM's from perm gen
apetrusenko
parents:
0
diff
changeset
|
1514 if (GC_locker::check_active_before_gc()) { |
| 0 | 1515 return; |
| 1516 } | |
| 1517 | |
| 1518 TimeStamp marking_start; | |
| 1519 TimeStamp compaction_start; | |
| 1520 TimeStamp collection_exit; | |
| 1521 | |
| 1522 ParallelScavengeHeap* heap = gc_heap(); | |
| 1523 GCCause::Cause gc_cause = heap->gc_cause(); | |
| 1524 PSYoungGen* young_gen = heap->young_gen(); | |
| 1525 PSOldGen* old_gen = heap->old_gen(); | |
| 1526 PSPermGen* perm_gen = heap->perm_gen(); | |
| 1527 PSAdaptiveSizePolicy* size_policy = heap->size_policy(); | |
| 1528 | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1529 if (ZapUnusedHeapArea) { |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1530 // Save information needed to minimize mangling |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1531 heap->record_gen_tops_before_GC(); |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1532 } |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1533 |
| 0 | 1534 _print_phases = PrintGCDetails && PrintParallelOldGCPhaseTimes; |
| 1535 | |
| 1536 // Make sure data structures are sane, make the heap parsable, and do other | |
| 1537 // miscellaneous bookkeeping. | |
| 1538 PreGCValues pre_gc_values; | |
| 1539 pre_compact(&pre_gc_values); | |
| 1540 | |
| 210 | 1541 // Get the compaction manager reserved for the VM thread. |
| 1542 ParCompactionManager* const vmthread_cm = | |
| 1543 ParCompactionManager::manager_array(gc_task_manager()->workers()); | |
| 1544 | |
| 0 | 1545 // Place after pre_compact() where the number of invocations is incremented. |
| 1546 AdaptiveSizePolicyOutput(size_policy, heap->total_collections()); | |
| 1547 | |
| 1548 { | |
| 1549 ResourceMark rm; | |
| 1550 HandleMark hm; | |
| 1551 | |
| 1552 const bool is_system_gc = gc_cause == GCCause::_java_lang_system_gc; | |
| 1553 | |
| 1554 // This is useful for debugging but don't change the output the | |
| 1555 // the customer sees. | |
| 1556 const char* gc_cause_str = "Full GC"; | |
| 1557 if (is_system_gc && PrintGCDetails) { | |
| 1558 gc_cause_str = "Full GC (System)"; | |
| 1559 } | |
| 1560 gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); | |
| 1561 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 1562 TraceTime t1(gc_cause_str, PrintGC, !PrintGCDetails, gclog_or_tty); | |
| 1563 TraceCollectorStats tcs(counters()); | |
| 1564 TraceMemoryManagerStats tms(true /* Full GC */); | |
| 1565 | |
| 1566 if (TraceGen1Time) accumulated_time()->start(); | |
| 1567 | |
| 1568 // Let the size policy know we're starting | |
| 1569 size_policy->major_collection_begin(); | |
| 1570 | |
| 1571 // When collecting the permanent generation methodOops may be moving, | |
| 1572 // so we either have to flush all bcp data or convert it into bci. | |
| 1573 CodeCache::gc_prologue(); | |
| 1574 Threads::gc_prologue(); | |
| 1575 | |
| 1576 NOT_PRODUCT(ref_processor()->verify_no_references_recorded()); | |
| 1577 COMPILER2_PRESENT(DerivedPointerTable::clear()); | |
| 1578 | |
| 1579 ref_processor()->enable_discovery(); | |
|
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
1580 ref_processor()->setup_policy(maximum_heap_compaction); |
| 0 | 1581 |
| 1582 bool marked_for_unloading = false; | |
| 1583 | |
| 1584 marking_start.update(); | |
| 210 | 1585 marking_phase(vmthread_cm, maximum_heap_compaction); |
| 0 | 1586 |
| 1587 #ifndef PRODUCT | |
| 1588 if (TraceParallelOldGCMarkingPhase) { | |
| 1589 gclog_or_tty->print_cr("marking_phase: cas_tries %d cas_retries %d " | |
| 1590 "cas_by_another %d", | |
| 1591 mark_bitmap()->cas_tries(), mark_bitmap()->cas_retries(), | |
| 1592 mark_bitmap()->cas_by_another()); | |
| 1593 } | |
| 1594 #endif // #ifndef PRODUCT | |
| 1595 | |
| 1596 bool max_on_system_gc = UseMaximumCompactionOnSystemGC && is_system_gc; | |
| 210 | 1597 summary_phase(vmthread_cm, maximum_heap_compaction || max_on_system_gc); |
| 0 | 1598 |
| 1599 COMPILER2_PRESENT(assert(DerivedPointerTable::is_active(), "Sanity")); | |
| 1600 COMPILER2_PRESENT(DerivedPointerTable::set_active(false)); | |
| 1601 | |
| 1602 // adjust_roots() updates Universe::_intArrayKlassObj which is | |
| 1603 // needed by the compaction for filling holes in the dense prefix. | |
| 1604 adjust_roots(); | |
| 1605 | |
| 1606 compaction_start.update(); | |
| 1607 // Does the perm gen always have to be done serially because | |
| 1608 // klasses are used in the update of an object? | |
| 210 | 1609 compact_perm(vmthread_cm); |
| 0 | 1610 |
| 1611 if (UseParallelOldGCCompacting) { | |
| 1612 compact(); | |
| 1613 } else { | |
| 210 | 1614 compact_serial(vmthread_cm); |
| 0 | 1615 } |
| 1616 | |
| 1617 // Reset the mark bitmap, summary data, and do other bookkeeping. Must be | |
| 1618 // done before resizing. | |
| 1619 post_compact(); | |
| 1620 | |
| 1621 // Let the size policy know we're done | |
| 1622 size_policy->major_collection_end(old_gen->used_in_bytes(), gc_cause); | |
| 1623 | |
| 1624 if (UseAdaptiveSizePolicy) { | |
| 1625 if (PrintAdaptiveSizePolicy) { | |
| 1626 gclog_or_tty->print("AdaptiveSizeStart: "); | |
| 1627 gclog_or_tty->stamp(); | |
| 1628 gclog_or_tty->print_cr(" collection: %d ", | |
| 1629 heap->total_collections()); | |
| 1630 if (Verbose) { | |
| 1631 gclog_or_tty->print("old_gen_capacity: %d young_gen_capacity: %d" | |
| 1632 " perm_gen_capacity: %d ", | |
| 1633 old_gen->capacity_in_bytes(), young_gen->capacity_in_bytes(), | |
| 1634 perm_gen->capacity_in_bytes()); | |
| 1635 } | |
| 1636 } | |
| 1637 | |
| 1638 // Don't check if the size_policy is ready here. Let | |
| 1639 // the size_policy check that internally. | |
| 1640 if (UseAdaptiveGenerationSizePolicyAtMajorCollection && | |
| 1641 ((gc_cause != GCCause::_java_lang_system_gc) || | |
| 1642 UseAdaptiveSizePolicyWithSystemGC)) { | |
| 1643 // Calculate optimal free space amounts | |
| 1644 assert(young_gen->max_size() > | |
| 1645 young_gen->from_space()->capacity_in_bytes() + | |
| 1646 young_gen->to_space()->capacity_in_bytes(), | |
| 1647 "Sizes of space in young gen are out-of-bounds"); | |
| 1648 size_t max_eden_size = young_gen->max_size() - | |
| 1649 young_gen->from_space()->capacity_in_bytes() - | |
| 1650 young_gen->to_space()->capacity_in_bytes(); | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1651 size_policy->compute_generation_free_space( |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1652 young_gen->used_in_bytes(), |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1653 young_gen->eden_space()->used_in_bytes(), |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1654 old_gen->used_in_bytes(), |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1655 perm_gen->used_in_bytes(), |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1656 young_gen->eden_space()->capacity_in_bytes(), |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1657 old_gen->max_gen_size(), |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1658 max_eden_size, |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1659 true /* full gc*/, |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1660 gc_cause); |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1661 |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1662 heap->resize_old_gen( |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1663 size_policy->calculated_old_free_size_in_bytes()); |
| 0 | 1664 |
| 1665 // Don't resize the young generation at an major collection. A | |
| 1666 // desired young generation size may have been calculated but | |
| 1667 // resizing the young generation complicates the code because the | |
| 1668 // resizing of the old generation may have moved the boundary | |
| 1669 // between the young generation and the old generation. Let the | |
| 1670 // young generation resizing happen at the minor collections. | |
| 1671 } | |
| 1672 if (PrintAdaptiveSizePolicy) { | |
| 1673 gclog_or_tty->print_cr("AdaptiveSizeStop: collection: %d ", | |
| 1674 heap->total_collections()); | |
| 1675 } | |
| 1676 } | |
| 1677 | |
| 1678 if (UsePerfData) { | |
| 1679 PSGCAdaptivePolicyCounters* const counters = heap->gc_policy_counters(); | |
| 1680 counters->update_counters(); | |
| 1681 counters->update_old_capacity(old_gen->capacity_in_bytes()); | |
| 1682 counters->update_young_capacity(young_gen->capacity_in_bytes()); | |
| 1683 } | |
| 1684 | |
| 1685 heap->resize_all_tlabs(); | |
| 1686 | |
| 1687 // We collected the perm gen, so we'll resize it here. | |
| 1688 perm_gen->compute_new_size(pre_gc_values.perm_gen_used()); | |
| 1689 | |
| 1690 if (TraceGen1Time) accumulated_time()->stop(); | |
| 1691 | |
| 1692 if (PrintGC) { | |
| 1693 if (PrintGCDetails) { | |
| 1694 // No GC timestamp here. This is after GC so it would be confusing. | |
| 1695 young_gen->print_used_change(pre_gc_values.young_gen_used()); | |
| 1696 old_gen->print_used_change(pre_gc_values.old_gen_used()); | |
| 1697 heap->print_heap_change(pre_gc_values.heap_used()); | |
| 1698 // Print perm gen last (print_heap_change() excludes the perm gen). | |
| 1699 perm_gen->print_used_change(pre_gc_values.perm_gen_used()); | |
| 1700 } else { | |
| 1701 heap->print_heap_change(pre_gc_values.heap_used()); | |
| 1702 } | |
| 1703 } | |
| 1704 | |
| 1705 // Track memory usage and detect low memory | |
| 1706 MemoryService::track_memory_usage(); | |
| 1707 heap->update_counters(); | |
| 1708 | |
| 1709 if (PrintGCDetails) { | |
| 1710 if (size_policy->print_gc_time_limit_would_be_exceeded()) { | |
| 1711 if (size_policy->gc_time_limit_exceeded()) { | |
| 1712 gclog_or_tty->print_cr(" GC time is exceeding GCTimeLimit " | |
| 1713 "of %d%%", GCTimeLimit); | |
| 1714 } else { | |
| 1715 gclog_or_tty->print_cr(" GC time would exceed GCTimeLimit " | |
| 1716 "of %d%%", GCTimeLimit); | |
| 1717 } | |
| 1718 } | |
| 1719 size_policy->set_print_gc_time_limit_would_be_exceeded(false); | |
| 1720 } | |
| 1721 } | |
| 1722 | |
| 1723 if (VerifyAfterGC && heap->total_collections() >= VerifyGCStartAt) { | |
| 1724 HandleMark hm; // Discard invalid handles created during verification | |
| 1725 gclog_or_tty->print(" VerifyAfterGC:"); | |
| 1726 Universe::verify(false); | |
| 1727 } | |
| 1728 | |
| 1729 // Re-verify object start arrays | |
| 1730 if (VerifyObjectStartArray && | |
| 1731 VerifyAfterGC) { | |
| 1732 old_gen->verify_object_start_array(); | |
| 1733 perm_gen->verify_object_start_array(); | |
| 1734 } | |
| 1735 | |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1736 if (ZapUnusedHeapArea) { |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1737 old_gen->object_space()->check_mangled_unused_area_complete(); |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1738 perm_gen->object_space()->check_mangled_unused_area_complete(); |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1739 } |
|
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
210
diff
changeset
|
1740 |
| 0 | 1741 NOT_PRODUCT(ref_processor()->verify_no_references_recorded()); |
| 1742 | |
| 1743 collection_exit.update(); | |
| 1744 | |
| 1745 if (PrintHeapAtGC) { | |
| 1746 Universe::print_heap_after_gc(); | |
| 1747 } | |
| 1748 if (PrintGCTaskTimeStamps) { | |
| 1749 gclog_or_tty->print_cr("VM-Thread " INT64_FORMAT " " INT64_FORMAT " " | |
| 1750 INT64_FORMAT, | |
| 1751 marking_start.ticks(), compaction_start.ticks(), | |
| 1752 collection_exit.ticks()); | |
| 1753 gc_task_manager()->print_task_time_stamps(); | |
| 1754 } | |
| 1755 } | |
| 1756 | |
| 1757 bool PSParallelCompact::absorb_live_data_from_eden(PSAdaptiveSizePolicy* size_policy, | |
| 1758 PSYoungGen* young_gen, | |
| 1759 PSOldGen* old_gen) { | |
| 1760 MutableSpace* const eden_space = young_gen->eden_space(); | |
| 1761 assert(!eden_space->is_empty(), "eden must be non-empty"); | |
| 1762 assert(young_gen->virtual_space()->alignment() == | |
| 1763 old_gen->virtual_space()->alignment(), "alignments do not match"); | |
| 1764 | |
| 1765 if (!(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary)) { | |
| 1766 return false; | |
| 1767 } | |
| 1768 | |
| 1769 // Both generations must be completely committed. | |
| 1770 if (young_gen->virtual_space()->uncommitted_size() != 0) { | |
| 1771 return false; | |
| 1772 } | |
| 1773 if (old_gen->virtual_space()->uncommitted_size() != 0) { | |
| 1774 return false; | |
| 1775 } | |
| 1776 | |
| 1777 // Figure out how much to take from eden. Include the average amount promoted | |
| 1778 // in the total; otherwise the next young gen GC will simply bail out to a | |
| 1779 // full GC. | |
| 1780 const size_t alignment = old_gen->virtual_space()->alignment(); | |
| 1781 const size_t eden_used = eden_space->used_in_bytes(); | |
| 1782 const size_t promoted = (size_t)size_policy->avg_promoted()->padded_average(); | |
| 1783 const size_t absorb_size = align_size_up(eden_used + promoted, alignment); | |
| 1784 const size_t eden_capacity = eden_space->capacity_in_bytes(); | |
| 1785 | |
| 1786 if (absorb_size >= eden_capacity) { | |
| 1787 return false; // Must leave some space in eden. | |
| 1788 } | |
| 1789 | |
| 1790 const size_t new_young_size = young_gen->capacity_in_bytes() - absorb_size; | |
| 1791 if (new_young_size < young_gen->min_gen_size()) { | |
| 1792 return false; // Respect young gen minimum size. | |
| 1793 } | |
| 1794 | |
| 1795 if (TraceAdaptiveGCBoundary && Verbose) { | |
| 1796 gclog_or_tty->print(" absorbing " SIZE_FORMAT "K: " | |
| 1797 "eden " SIZE_FORMAT "K->" SIZE_FORMAT "K " | |
| 1798 "from " SIZE_FORMAT "K, to " SIZE_FORMAT "K " | |
| 1799 "young_gen " SIZE_FORMAT "K->" SIZE_FORMAT "K ", | |
| 1800 absorb_size / K, | |
| 1801 eden_capacity / K, (eden_capacity - absorb_size) / K, | |
| 1802 young_gen->from_space()->used_in_bytes() / K, | |
| 1803 young_gen->to_space()->used_in_bytes() / K, | |
| 1804 young_gen->capacity_in_bytes() / K, new_young_size / K); | |
| 1805 } | |
| 1806 | |
| 1807 // Fill the unused part of the old gen. | |
| 1808 MutableSpace* const old_space = old_gen->object_space(); | |
|
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1809 HeapWord* const unused_start = old_space->top(); |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1810 size_t const unused_words = pointer_delta(old_space->end(), unused_start); |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1811 |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1812 if (unused_words > 0) { |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1813 if (unused_words < CollectedHeap::min_fill_size()) { |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1814 return false; // If the old gen cannot be filled, must give up. |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1815 } |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1816 CollectedHeap::fill_with_objects(unused_start, unused_words); |
| 0 | 1817 } |
| 1818 | |
| 1819 // Take the live data from eden and set both top and end in the old gen to | |
| 1820 // eden top. (Need to set end because reset_after_change() mangles the region | |
| 1821 // from end to virtual_space->high() in debug builds). | |
| 1822 HeapWord* const new_top = eden_space->top(); | |
| 1823 old_gen->virtual_space()->expand_into(young_gen->virtual_space(), | |
| 1824 absorb_size); | |
| 1825 young_gen->reset_after_change(); | |
| 1826 old_space->set_top(new_top); | |
| 1827 old_space->set_end(new_top); | |
| 1828 old_gen->reset_after_change(); | |
| 1829 | |
| 1830 // Update the object start array for the filler object and the data from eden. | |
| 1831 ObjectStartArray* const start_array = old_gen->start_array(); | |
|
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1832 for (HeapWord* p = unused_start; p < new_top; p += oop(p)->size()) { |
|
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
457
diff
changeset
|
1833 start_array->allocate_block(p); |
| 0 | 1834 } |
| 1835 | |
| 1836 // Could update the promoted average here, but it is not typically updated at | |
| 1837 // full GCs and the value to use is unclear. Something like | |
| 1838 // | |
| 1839 // cur_promoted_avg + absorb_size / number_of_scavenges_since_last_full_gc. | |
| 1840 | |
| 1841 size_policy->set_bytes_absorbed_from_eden(absorb_size); | |
| 1842 return true; | |
| 1843 } | |
| 1844 | |
| 1845 GCTaskManager* const PSParallelCompact::gc_task_manager() { | |
| 1846 assert(ParallelScavengeHeap::gc_task_manager() != NULL, | |
| 1847 "shouldn't return NULL"); | |
| 1848 return ParallelScavengeHeap::gc_task_manager(); | |
| 1849 } | |
| 1850 | |
| 1851 void PSParallelCompact::marking_phase(ParCompactionManager* cm, | |
| 1852 bool maximum_heap_compaction) { | |
| 1853 // Recursively traverse all live objects and mark them | |
| 1854 EventMark m("1 mark object"); | |
| 1855 TraceTime tm("marking phase", print_phases(), true, gclog_or_tty); | |
| 1856 | |
| 1857 ParallelScavengeHeap* heap = gc_heap(); | |
| 1858 uint parallel_gc_threads = heap->gc_task_manager()->workers(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1859 TaskQueueSetSuper* qset = ParCompactionManager::region_array(); |
| 0 | 1860 ParallelTaskTerminator terminator(parallel_gc_threads, qset); |
| 1861 | |
| 1862 PSParallelCompact::MarkAndPushClosure mark_and_push_closure(cm); | |
| 1863 PSParallelCompact::FollowStackClosure follow_stack_closure(cm); | |
| 1864 | |
| 1865 { | |
| 1866 TraceTime tm_m("par mark", print_phases(), true, gclog_or_tty); | |
| 1867 | |
| 1868 GCTaskQueue* q = GCTaskQueue::create(); | |
| 1869 | |
| 1870 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::universe)); | |
| 1871 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::jni_handles)); | |
| 1872 // We scan the thread roots in parallel | |
| 1873 Threads::create_thread_roots_marking_tasks(q); | |
| 1874 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::object_synchronizer)); | |
| 1875 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::flat_profiler)); | |
| 1876 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::management)); | |
| 1877 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::system_dictionary)); | |
| 1878 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::jvmti)); | |
| 1879 q->enqueue(new MarkFromRootsTask(MarkFromRootsTask::vm_symbols)); | |
| 1880 | |
| 1881 if (parallel_gc_threads > 1) { | |
| 1882 for (uint j = 0; j < parallel_gc_threads; j++) { | |
| 1883 q->enqueue(new StealMarkingTask(&terminator)); | |
| 1884 } | |
| 1885 } | |
| 1886 | |
| 1887 WaitForBarrierGCTask* fin = WaitForBarrierGCTask::create(); | |
| 1888 q->enqueue(fin); | |
| 1889 | |
| 1890 gc_task_manager()->add_list(q); | |
| 1891 | |
| 1892 fin->wait_for(); | |
| 1893 | |
| 1894 // We have to release the barrier tasks! | |
| 1895 WaitForBarrierGCTask::destroy(fin); | |
| 1896 } | |
| 1897 | |
| 1898 // Process reference objects found during marking | |
| 1899 { | |
| 1900 TraceTime tm_r("reference processing", print_phases(), true, gclog_or_tty); | |
| 1901 if (ref_processor()->processing_is_mt()) { | |
| 1902 RefProcTaskExecutor task_executor; | |
| 1903 ref_processor()->process_discovered_references( | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
376
diff
changeset
|
1904 is_alive_closure(), &mark_and_push_closure, &follow_stack_closure, |
|
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
376
diff
changeset
|
1905 &task_executor); |
| 0 | 1906 } else { |
| 1907 ref_processor()->process_discovered_references( | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
376
diff
changeset
|
1908 is_alive_closure(), &mark_and_push_closure, &follow_stack_closure, NULL); |
| 0 | 1909 } |
| 1910 } | |
| 1911 | |
| 1912 TraceTime tm_c("class unloading", print_phases(), true, gclog_or_tty); | |
| 1913 // Follow system dictionary roots and unload classes. | |
| 1914 bool purged_class = SystemDictionary::do_unloading(is_alive_closure()); | |
| 1915 | |
| 1916 // Follow code cache roots. | |
| 1917 CodeCache::do_unloading(is_alive_closure(), &mark_and_push_closure, | |
| 1918 purged_class); | |
| 1919 follow_stack(cm); // Flush marking stack. | |
| 1920 | |
| 1921 // Update subklass/sibling/implementor links of live klasses | |
| 1922 // revisit_klass_stack is used in follow_weak_klass_links(). | |
| 1923 follow_weak_klass_links(cm); | |
| 1924 | |
| 1925 // Visit symbol and interned string tables and delete unmarked oops | |
| 1926 SymbolTable::unlink(is_alive_closure()); | |
| 1927 StringTable::unlink(is_alive_closure()); | |
| 1928 | |
| 1929 assert(cm->marking_stack()->size() == 0, "stack should be empty by now"); | |
| 1930 assert(cm->overflow_stack()->is_empty(), "stack should be empty by now"); | |
| 1931 } | |
| 1932 | |
| 1933 // This should be moved to the shared markSweep code! | |
| 1934 class PSAlwaysTrueClosure: public BoolObjectClosure { | |
| 1935 public: | |
| 1936 void do_object(oop p) { ShouldNotReachHere(); } | |
| 1937 bool do_object_b(oop p) { return true; } | |
| 1938 }; | |
| 1939 static PSAlwaysTrueClosure always_true; | |
| 1940 | |
| 1941 void PSParallelCompact::adjust_roots() { | |
| 1942 // Adjust the pointers to reflect the new locations | |
| 1943 EventMark m("3 adjust roots"); | |
| 1944 TraceTime tm("adjust roots", print_phases(), true, gclog_or_tty); | |
| 1945 | |
| 1946 // General strong roots. | |
| 1947 Universe::oops_do(adjust_root_pointer_closure()); | |
| 1948 ReferenceProcessor::oops_do(adjust_root_pointer_closure()); | |
| 1949 JNIHandles::oops_do(adjust_root_pointer_closure()); // Global (strong) JNI handles | |
| 1950 Threads::oops_do(adjust_root_pointer_closure()); | |
| 1951 ObjectSynchronizer::oops_do(adjust_root_pointer_closure()); | |
| 1952 FlatProfiler::oops_do(adjust_root_pointer_closure()); | |
| 1953 Management::oops_do(adjust_root_pointer_closure()); | |
| 1954 JvmtiExport::oops_do(adjust_root_pointer_closure()); | |
| 1955 // SO_AllClasses | |
| 1956 SystemDictionary::oops_do(adjust_root_pointer_closure()); | |
| 1957 vmSymbols::oops_do(adjust_root_pointer_closure()); | |
| 1958 | |
| 1959 // Now adjust pointers in remaining weak roots. (All of which should | |
| 1960 // have been cleared if they pointed to non-surviving objects.) | |
| 1961 // Global (weak) JNI handles | |
| 1962 JNIHandles::weak_oops_do(&always_true, adjust_root_pointer_closure()); | |
| 1963 | |
| 1964 CodeCache::oops_do(adjust_pointer_closure()); | |
| 1965 SymbolTable::oops_do(adjust_root_pointer_closure()); | |
| 1966 StringTable::oops_do(adjust_root_pointer_closure()); | |
| 1967 ref_processor()->weak_oops_do(adjust_root_pointer_closure()); | |
| 1968 // Roots were visited so references into the young gen in roots | |
| 1969 // may have been scanned. Process them also. | |
| 1970 // Should the reference processor have a span that excludes | |
| 1971 // young gen objects? | |
| 1972 PSScavenge::reference_processor()->weak_oops_do( | |
| 1973 adjust_root_pointer_closure()); | |
| 1974 } | |
| 1975 | |
| 1976 void PSParallelCompact::compact_perm(ParCompactionManager* cm) { | |
| 1977 EventMark m("4 compact perm"); | |
| 1978 TraceTime tm("compact perm gen", print_phases(), true, gclog_or_tty); | |
| 1979 // trace("4"); | |
| 1980 | |
| 1981 gc_heap()->perm_gen()->start_array()->reset(); | |
| 1982 move_and_update(cm, perm_space_id); | |
| 1983 } | |
| 1984 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1985 void PSParallelCompact::enqueue_region_draining_tasks(GCTaskQueue* q, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1986 uint parallel_gc_threads) |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1987 { |
| 0 | 1988 TraceTime tm("drain task setup", print_phases(), true, gclog_or_tty); |
| 1989 | |
| 1990 const unsigned int task_count = MAX2(parallel_gc_threads, 1U); | |
| 1991 for (unsigned int j = 0; j < task_count; j++) { | |
| 1992 q->enqueue(new DrainStacksCompactionTask()); | |
| 1993 } | |
| 1994 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1995 // Find all regions that are available (can be filled immediately) and |
| 0 | 1996 // distribute them to the thread stacks. The iteration is done in reverse |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
1997 // order (high to low) so the regions will be removed in ascending order. |
| 0 | 1998 |
| 1999 const ParallelCompactData& sd = PSParallelCompact::summary_data(); | |
| 2000 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2001 size_t fillable_regions = 0; // A count for diagnostic purposes. |
| 0 | 2002 unsigned int which = 0; // The worker thread number. |
| 2003 | |
| 2004 for (unsigned int id = to_space_id; id > perm_space_id; --id) { | |
| 2005 SpaceInfo* const space_info = _space_info + id; | |
| 2006 MutableSpace* const space = space_info->space(); | |
| 2007 HeapWord* const new_top = space_info->new_top(); | |
| 2008 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2009 const size_t beg_region = sd.addr_to_region_idx(space_info->dense_prefix()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2010 const size_t end_region = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2011 sd.addr_to_region_idx(sd.region_align_up(new_top)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2012 assert(end_region > 0, "perm gen cannot be empty"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2013 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2014 for (size_t cur = end_region - 1; cur >= beg_region; --cur) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2015 if (sd.region(cur)->claim_unsafe()) { |
| 0 | 2016 ParCompactionManager* cm = ParCompactionManager::manager_array(which); |
| 2017 cm->save_for_processing(cur); | |
| 2018 | |
| 2019 if (TraceParallelOldGCCompactionPhase && Verbose) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2020 const size_t count_mod_8 = fillable_regions & 7; |
| 0 | 2021 if (count_mod_8 == 0) gclog_or_tty->print("fillable: "); |
|
264
15dd2594d08e
6718283: existing uses of *_FORMAT_W() were broken by 6521491
jcoomes
parents:
263
diff
changeset
|
2022 gclog_or_tty->print(" " SIZE_FORMAT_W(7), cur); |
| 0 | 2023 if (count_mod_8 == 7) gclog_or_tty->cr(); |
| 2024 } | |
| 2025 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2026 NOT_PRODUCT(++fillable_regions;) |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2027 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2028 // Assign regions to threads in round-robin fashion. |
| 0 | 2029 if (++which == task_count) { |
| 2030 which = 0; | |
| 2031 } | |
| 2032 } | |
| 2033 } | |
| 2034 } | |
| 2035 | |
| 2036 if (TraceParallelOldGCCompactionPhase) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2037 if (Verbose && (fillable_regions & 7) != 0) gclog_or_tty->cr(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2038 gclog_or_tty->print_cr("%u initially fillable regions", fillable_regions); |
| 0 | 2039 } |
| 2040 } | |
| 2041 | |
| 2042 #define PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING 4 | |
| 2043 | |
| 2044 void PSParallelCompact::enqueue_dense_prefix_tasks(GCTaskQueue* q, | |
| 2045 uint parallel_gc_threads) { | |
| 2046 TraceTime tm("dense prefix task setup", print_phases(), true, gclog_or_tty); | |
| 2047 | |
| 2048 ParallelCompactData& sd = PSParallelCompact::summary_data(); | |
| 2049 | |
| 2050 // Iterate over all the spaces adding tasks for updating | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2051 // regions in the dense prefix. Assume that 1 gc thread |
| 0 | 2052 // will work on opening the gaps and the remaining gc threads |
| 2053 // will work on the dense prefix. | |
| 2054 SpaceId space_id = old_space_id; | |
| 2055 while (space_id != last_space_id) { | |
| 2056 HeapWord* const dense_prefix_end = _space_info[space_id].dense_prefix(); | |
| 2057 const MutableSpace* const space = _space_info[space_id].space(); | |
| 2058 | |
| 2059 if (dense_prefix_end == space->bottom()) { | |
| 2060 // There is no dense prefix for this space. | |
| 2061 space_id = next_compaction_space_id(space_id); | |
| 2062 continue; | |
| 2063 } | |
| 2064 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2065 // The dense prefix is before this region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2066 size_t region_index_end_dense_prefix = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2067 sd.addr_to_region_idx(dense_prefix_end); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2068 RegionData* const dense_prefix_cp = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2069 sd.region(region_index_end_dense_prefix); |
| 0 | 2070 assert(dense_prefix_end == space->end() || |
| 2071 dense_prefix_cp->available() || | |
| 2072 dense_prefix_cp->claimed(), | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2073 "The region after the dense prefix should always be ready to fill"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2074 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2075 size_t region_index_start = sd.addr_to_region_idx(space->bottom()); |
| 0 | 2076 |
| 2077 // Is there dense prefix work? | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2078 size_t total_dense_prefix_regions = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2079 region_index_end_dense_prefix - region_index_start; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2080 // How many regions of the dense prefix should be given to |
| 0 | 2081 // each thread? |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2082 if (total_dense_prefix_regions > 0) { |
| 0 | 2083 uint tasks_for_dense_prefix = 1; |
| 2084 if (UseParallelDensePrefixUpdate) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2085 if (total_dense_prefix_regions <= |
| 0 | 2086 (parallel_gc_threads * PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING)) { |
| 2087 // Don't over partition. This assumes that | |
| 2088 // PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING is a small integer value | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2089 // so there are not many regions to process. |
| 0 | 2090 tasks_for_dense_prefix = parallel_gc_threads; |
| 2091 } else { | |
| 2092 // Over partition | |
| 2093 tasks_for_dense_prefix = parallel_gc_threads * | |
| 2094 PAR_OLD_DENSE_PREFIX_OVER_PARTITIONING; | |
| 2095 } | |
| 2096 } | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2097 size_t regions_per_thread = total_dense_prefix_regions / |
| 0 | 2098 tasks_for_dense_prefix; |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2099 // Give each thread at least 1 region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2100 if (regions_per_thread == 0) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2101 regions_per_thread = 1; |
| 0 | 2102 } |
| 2103 | |
| 2104 for (uint k = 0; k < tasks_for_dense_prefix; k++) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2105 if (region_index_start >= region_index_end_dense_prefix) { |
| 0 | 2106 break; |
| 2107 } | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2108 // region_index_end is not processed |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2109 size_t region_index_end = MIN2(region_index_start + regions_per_thread, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2110 region_index_end_dense_prefix); |
| 0 | 2111 q->enqueue(new UpdateDensePrefixTask( |
| 2112 space_id, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2113 region_index_start, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2114 region_index_end)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2115 region_index_start = region_index_end; |
| 0 | 2116 } |
| 2117 } | |
| 2118 // This gets any part of the dense prefix that did not | |
| 2119 // fit evenly. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2120 if (region_index_start < region_index_end_dense_prefix) { |
| 0 | 2121 q->enqueue(new UpdateDensePrefixTask( |
| 2122 space_id, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2123 region_index_start, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2124 region_index_end_dense_prefix)); |
| 0 | 2125 } |
| 2126 space_id = next_compaction_space_id(space_id); | |
| 2127 } // End tasks for dense prefix | |
| 2128 } | |
| 2129 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2130 void PSParallelCompact::enqueue_region_stealing_tasks( |
| 0 | 2131 GCTaskQueue* q, |
| 2132 ParallelTaskTerminator* terminator_ptr, | |
| 2133 uint parallel_gc_threads) { | |
| 2134 TraceTime tm("steal task setup", print_phases(), true, gclog_or_tty); | |
| 2135 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2136 // Once a thread has drained it's stack, it should try to steal regions from |
| 0 | 2137 // other threads. |
| 2138 if (parallel_gc_threads > 1) { | |
| 2139 for (uint j = 0; j < parallel_gc_threads; j++) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2140 q->enqueue(new StealRegionCompactionTask(terminator_ptr)); |
| 0 | 2141 } |
| 2142 } | |
| 2143 } | |
| 2144 | |
| 2145 void PSParallelCompact::compact() { | |
| 2146 EventMark m("5 compact"); | |
| 2147 // trace("5"); | |
| 2148 TraceTime tm("compaction phase", print_phases(), true, gclog_or_tty); | |
| 2149 | |
| 2150 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); | |
| 2151 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); | |
| 2152 PSOldGen* old_gen = heap->old_gen(); | |
| 2153 old_gen->start_array()->reset(); | |
| 2154 uint parallel_gc_threads = heap->gc_task_manager()->workers(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2155 TaskQueueSetSuper* qset = ParCompactionManager::region_array(); |
| 0 | 2156 ParallelTaskTerminator terminator(parallel_gc_threads, qset); |
| 2157 | |
| 2158 GCTaskQueue* q = GCTaskQueue::create(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2159 enqueue_region_draining_tasks(q, parallel_gc_threads); |
| 0 | 2160 enqueue_dense_prefix_tasks(q, parallel_gc_threads); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2161 enqueue_region_stealing_tasks(q, &terminator, parallel_gc_threads); |
| 0 | 2162 |
| 2163 { | |
| 2164 TraceTime tm_pc("par compact", print_phases(), true, gclog_or_tty); | |
| 2165 | |
| 2166 WaitForBarrierGCTask* fin = WaitForBarrierGCTask::create(); | |
| 2167 q->enqueue(fin); | |
| 2168 | |
| 2169 gc_task_manager()->add_list(q); | |
| 2170 | |
| 2171 fin->wait_for(); | |
| 2172 | |
| 2173 // We have to release the barrier tasks! | |
| 2174 WaitForBarrierGCTask::destroy(fin); | |
| 2175 | |
| 2176 #ifdef ASSERT | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2177 // Verify that all regions have been processed before the deferred updates. |
| 0 | 2178 // Note that perm_space_id is skipped; this type of verification is not |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2179 // valid until the perm gen is compacted by regions. |
| 0 | 2180 for (unsigned int id = old_space_id; id < last_space_id; ++id) { |
| 2181 verify_complete(SpaceId(id)); | |
| 2182 } | |
| 2183 #endif | |
| 2184 } | |
| 2185 | |
| 2186 { | |
| 2187 // Update the deferred objects, if any. Any compaction manager can be used. | |
| 2188 TraceTime tm_du("deferred updates", print_phases(), true, gclog_or_tty); | |
| 2189 ParCompactionManager* cm = ParCompactionManager::manager_array(0); | |
| 2190 for (unsigned int id = old_space_id; id < last_space_id; ++id) { | |
| 2191 update_deferred_objects(cm, SpaceId(id)); | |
| 2192 } | |
| 2193 } | |
| 2194 } | |
| 2195 | |
| 2196 #ifdef ASSERT | |
| 2197 void PSParallelCompact::verify_complete(SpaceId space_id) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2198 // All Regions between space bottom() to new_top() should be marked as filled |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2199 // and all Regions between new_top() and top() should be available (i.e., |
| 0 | 2200 // should have been emptied). |
| 2201 ParallelCompactData& sd = summary_data(); | |
| 2202 SpaceInfo si = _space_info[space_id]; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2203 HeapWord* new_top_addr = sd.region_align_up(si.new_top()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2204 HeapWord* old_top_addr = sd.region_align_up(si.space()->top()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2205 const size_t beg_region = sd.addr_to_region_idx(si.space()->bottom()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2206 const size_t new_top_region = sd.addr_to_region_idx(new_top_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2207 const size_t old_top_region = sd.addr_to_region_idx(old_top_addr); |
| 0 | 2208 |
| 2209 bool issued_a_warning = false; | |
| 2210 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2211 size_t cur_region; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2212 for (cur_region = beg_region; cur_region < new_top_region; ++cur_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2213 const RegionData* const c = sd.region(cur_region); |
| 0 | 2214 if (!c->completed()) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2215 warning("region " SIZE_FORMAT " not filled: " |
| 0 | 2216 "destination_count=" SIZE_FORMAT, |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2217 cur_region, c->destination_count()); |
| 0 | 2218 issued_a_warning = true; |
| 2219 } | |
| 2220 } | |
| 2221 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2222 for (cur_region = new_top_region; cur_region < old_top_region; ++cur_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2223 const RegionData* const c = sd.region(cur_region); |
| 0 | 2224 if (!c->available()) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2225 warning("region " SIZE_FORMAT " not empty: " |
| 0 | 2226 "destination_count=" SIZE_FORMAT, |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2227 cur_region, c->destination_count()); |
| 0 | 2228 issued_a_warning = true; |
| 2229 } | |
| 2230 } | |
| 2231 | |
| 2232 if (issued_a_warning) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2233 print_region_ranges(); |
| 0 | 2234 } |
| 2235 } | |
| 2236 #endif // #ifdef ASSERT | |
| 2237 | |
| 2238 void PSParallelCompact::compact_serial(ParCompactionManager* cm) { | |
| 2239 EventMark m("5 compact serial"); | |
| 2240 TraceTime tm("compact serial", print_phases(), true, gclog_or_tty); | |
| 2241 | |
| 2242 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); | |
| 2243 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); | |
| 2244 | |
| 2245 PSYoungGen* young_gen = heap->young_gen(); | |
| 2246 PSOldGen* old_gen = heap->old_gen(); | |
| 2247 | |
| 2248 old_gen->start_array()->reset(); | |
| 2249 old_gen->move_and_update(cm); | |
| 2250 young_gen->move_and_update(cm); | |
| 2251 } | |
| 2252 | |
| 2253 | |
| 2254 void PSParallelCompact::follow_stack(ParCompactionManager* cm) { | |
| 2255 while(!cm->overflow_stack()->is_empty()) { | |
| 2256 oop obj = cm->overflow_stack()->pop(); | |
| 2257 obj->follow_contents(cm); | |
| 2258 } | |
| 2259 | |
| 2260 oop obj; | |
| 2261 // obj is a reference!!! | |
| 2262 while (cm->marking_stack()->pop_local(obj)) { | |
| 2263 // It would be nice to assert about the type of objects we might | |
| 2264 // pop, but they can come from anywhere, unfortunately. | |
| 2265 obj->follow_contents(cm); | |
| 2266 } | |
| 2267 } | |
| 2268 | |
| 2269 void | |
| 2270 PSParallelCompact::follow_weak_klass_links(ParCompactionManager* serial_cm) { | |
| 2271 // All klasses on the revisit stack are marked at this point. | |
| 2272 // Update and follow all subklass, sibling and implementor links. | |
| 2273 for (uint i = 0; i < ParallelGCThreads+1; i++) { | |
| 2274 ParCompactionManager* cm = ParCompactionManager::manager_array(i); | |
| 2275 KeepAliveClosure keep_alive_closure(cm); | |
| 2276 for (int i = 0; i < cm->revisit_klass_stack()->length(); i++) { | |
| 2277 cm->revisit_klass_stack()->at(i)->follow_weak_klass_links( | |
| 2278 is_alive_closure(), | |
| 2279 &keep_alive_closure); | |
| 2280 } | |
| 2281 follow_stack(cm); | |
| 2282 } | |
| 2283 } | |
| 2284 | |
| 2285 void | |
| 2286 PSParallelCompact::revisit_weak_klass_link(ParCompactionManager* cm, Klass* k) { | |
| 2287 cm->revisit_klass_stack()->push(k); | |
| 2288 } | |
| 2289 | |
| 2290 #ifdef VALIDATE_MARK_SWEEP | |
| 2291 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
2292 void PSParallelCompact::track_adjusted_pointer(void* p, bool isroot) { |
| 0 | 2293 if (!ValidateMarkSweep) |
| 2294 return; | |
| 2295 | |
| 2296 if (!isroot) { | |
| 2297 if (_pointer_tracking) { | |
| 2298 guarantee(_adjusted_pointers->contains(p), "should have seen this pointer"); | |
| 2299 _adjusted_pointers->remove(p); | |
| 2300 } | |
| 2301 } else { | |
| 2302 ptrdiff_t index = _root_refs_stack->find(p); | |
| 2303 if (index != -1) { | |
| 2304 int l = _root_refs_stack->length(); | |
| 2305 if (l > 0 && l - 1 != index) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
2306 void* last = _root_refs_stack->pop(); |
| 0 | 2307 assert(last != p, "should be different"); |
| 2308 _root_refs_stack->at_put(index, last); | |
| 2309 } else { | |
| 2310 _root_refs_stack->remove(p); | |
| 2311 } | |
| 2312 } | |
| 2313 } | |
| 2314 } | |
| 2315 | |
| 2316 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
2317 void PSParallelCompact::check_adjust_pointer(void* p) { |
| 0 | 2318 _adjusted_pointers->push(p); |
| 2319 } | |
| 2320 | |
| 2321 | |
| 2322 class AdjusterTracker: public OopClosure { | |
| 2323 public: | |
| 2324 AdjusterTracker() {}; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
2325 void do_oop(oop* o) { PSParallelCompact::check_adjust_pointer(o); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
79
diff
changeset
|
2326 void do_oop(narrowOop* o) { PSParallelCompact::check_adjust_pointer(o); } |
| 0 | 2327 }; |
| 2328 | |
| 2329 | |
| 2330 void PSParallelCompact::track_interior_pointers(oop obj) { | |
| 2331 if (ValidateMarkSweep) { | |
| 2332 _adjusted_pointers->clear(); | |
| 2333 _pointer_tracking = true; | |
| 2334 | |
| 2335 AdjusterTracker checker; | |
| 2336 obj->oop_iterate(&checker); | |
| 2337 } | |
| 2338 } | |
| 2339 | |
| 2340 | |
| 2341 void PSParallelCompact::check_interior_pointers() { | |
| 2342 if (ValidateMarkSweep) { | |
| 2343 _pointer_tracking = false; | |
| 2344 guarantee(_adjusted_pointers->length() == 0, "should have processed the same pointers"); | |
| 2345 } | |
| 2346 } | |
| 2347 | |
| 2348 | |
| 2349 void PSParallelCompact::reset_live_oop_tracking(bool at_perm) { | |
| 2350 if (ValidateMarkSweep) { | |
| 2351 guarantee((size_t)_live_oops->length() == _live_oops_index, "should be at end of live oops"); | |
| 2352 _live_oops_index = at_perm ? _live_oops_index_at_perm : 0; | |
| 2353 } | |
| 2354 } | |
| 2355 | |
| 2356 | |
| 2357 void PSParallelCompact::register_live_oop(oop p, size_t size) { | |
| 2358 if (ValidateMarkSweep) { | |
| 2359 _live_oops->push(p); | |
| 2360 _live_oops_size->push(size); | |
| 2361 _live_oops_index++; | |
| 2362 } | |
| 2363 } | |
| 2364 | |
| 2365 void PSParallelCompact::validate_live_oop(oop p, size_t size) { | |
| 2366 if (ValidateMarkSweep) { | |
| 2367 oop obj = _live_oops->at((int)_live_oops_index); | |
| 2368 guarantee(obj == p, "should be the same object"); | |
| 2369 guarantee(_live_oops_size->at((int)_live_oops_index) == size, "should be the same size"); | |
| 2370 _live_oops_index++; | |
| 2371 } | |
| 2372 } | |
| 2373 | |
| 2374 void PSParallelCompact::live_oop_moved_to(HeapWord* q, size_t size, | |
| 2375 HeapWord* compaction_top) { | |
| 2376 assert(oop(q)->forwardee() == NULL || oop(q)->forwardee() == oop(compaction_top), | |
| 2377 "should be moved to forwarded location"); | |
| 2378 if (ValidateMarkSweep) { | |
| 2379 PSParallelCompact::validate_live_oop(oop(q), size); | |
| 2380 _live_oops_moved_to->push(oop(compaction_top)); | |
| 2381 } | |
| 2382 if (RecordMarkSweepCompaction) { | |
| 2383 _cur_gc_live_oops->push(q); | |
| 2384 _cur_gc_live_oops_moved_to->push(compaction_top); | |
| 2385 _cur_gc_live_oops_size->push(size); | |
| 2386 } | |
| 2387 } | |
| 2388 | |
| 2389 | |
| 2390 void PSParallelCompact::compaction_complete() { | |
| 2391 if (RecordMarkSweepCompaction) { | |
| 2392 GrowableArray<HeapWord*>* _tmp_live_oops = _cur_gc_live_oops; | |
| 2393 GrowableArray<HeapWord*>* _tmp_live_oops_moved_to = _cur_gc_live_oops_moved_to; | |
| 2394 GrowableArray<size_t> * _tmp_live_oops_size = _cur_gc_live_oops_size; | |
| 2395 | |
| 2396 _cur_gc_live_oops = _last_gc_live_oops; | |
| 2397 _cur_gc_live_oops_moved_to = _last_gc_live_oops_moved_to; | |
| 2398 _cur_gc_live_oops_size = _last_gc_live_oops_size; | |
| 2399 _last_gc_live_oops = _tmp_live_oops; | |
| 2400 _last_gc_live_oops_moved_to = _tmp_live_oops_moved_to; | |
| 2401 _last_gc_live_oops_size = _tmp_live_oops_size; | |
| 2402 } | |
| 2403 } | |
| 2404 | |
| 2405 | |
| 2406 void PSParallelCompact::print_new_location_of_heap_address(HeapWord* q) { | |
| 2407 if (!RecordMarkSweepCompaction) { | |
| 2408 tty->print_cr("Requires RecordMarkSweepCompaction to be enabled"); | |
| 2409 return; | |
| 2410 } | |
| 2411 | |
| 2412 if (_last_gc_live_oops == NULL) { | |
| 2413 tty->print_cr("No compaction information gathered yet"); | |
| 2414 return; | |
| 2415 } | |
| 2416 | |
| 2417 for (int i = 0; i < _last_gc_live_oops->length(); i++) { | |
| 2418 HeapWord* old_oop = _last_gc_live_oops->at(i); | |
| 2419 size_t sz = _last_gc_live_oops_size->at(i); | |
| 2420 if (old_oop <= q && q < (old_oop + sz)) { | |
| 2421 HeapWord* new_oop = _last_gc_live_oops_moved_to->at(i); | |
| 2422 size_t offset = (q - old_oop); | |
| 2423 tty->print_cr("Address " PTR_FORMAT, q); | |
| 2424 tty->print_cr(" Was in oop " PTR_FORMAT ", size %d, at offset %d", old_oop, sz, offset); | |
| 2425 tty->print_cr(" Now in oop " PTR_FORMAT ", actual address " PTR_FORMAT, new_oop, new_oop + offset); | |
| 2426 return; | |
| 2427 } | |
| 2428 } | |
| 2429 | |
| 2430 tty->print_cr("Address " PTR_FORMAT " not found in live oop information from last GC", q); | |
| 2431 } | |
| 2432 #endif //VALIDATE_MARK_SWEEP | |
| 2433 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2434 // Update interior oops in the ranges of regions [beg_region, end_region). |
| 0 | 2435 void |
| 2436 PSParallelCompact::update_and_deadwood_in_dense_prefix(ParCompactionManager* cm, | |
| 2437 SpaceId space_id, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2438 size_t beg_region, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2439 size_t end_region) { |
| 0 | 2440 ParallelCompactData& sd = summary_data(); |
| 2441 ParMarkBitMap* const mbm = mark_bitmap(); | |
| 2442 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2443 HeapWord* beg_addr = sd.region_to_addr(beg_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2444 HeapWord* const end_addr = sd.region_to_addr(end_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2445 assert(beg_region <= end_region, "bad region range"); |
| 0 | 2446 assert(end_addr <= dense_prefix(space_id), "not in the dense prefix"); |
| 2447 | |
| 2448 #ifdef ASSERT | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2449 // Claim the regions to avoid triggering an assert when they are marked as |
| 0 | 2450 // filled. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2451 for (size_t claim_region = beg_region; claim_region < end_region; ++claim_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2452 assert(sd.region(claim_region)->claim_unsafe(), "claim() failed"); |
| 0 | 2453 } |
| 2454 #endif // #ifdef ASSERT | |
| 2455 | |
| 2456 if (beg_addr != space(space_id)->bottom()) { | |
| 2457 // Find the first live object or block of dead space that *starts* in this | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2458 // range of regions. If a partial object crosses onto the region, skip it; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2459 // it will be marked for 'deferred update' when the object head is |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2460 // processed. If dead space crosses onto the region, it is also skipped; it |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2461 // will be filled when the prior region is processed. If neither of those |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2462 // apply, the first word in the region is the start of a live object or dead |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2463 // space. |
| 0 | 2464 assert(beg_addr > space(space_id)->bottom(), "sanity"); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2465 const RegionData* const cp = sd.region(beg_region); |
| 0 | 2466 if (cp->partial_obj_size() != 0) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2467 beg_addr = sd.partial_obj_end(beg_region); |
| 0 | 2468 } else if (dead_space_crosses_boundary(cp, mbm->addr_to_bit(beg_addr))) { |
| 2469 beg_addr = mbm->find_obj_beg(beg_addr, end_addr); | |
| 2470 } | |
| 2471 } | |
| 2472 | |
| 2473 if (beg_addr < end_addr) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2474 // A live object or block of dead space starts in this range of Regions. |
| 0 | 2475 HeapWord* const dense_prefix_end = dense_prefix(space_id); |
| 2476 | |
| 2477 // Create closures and iterate. | |
| 2478 UpdateOnlyClosure update_closure(mbm, cm, space_id); | |
| 2479 FillClosure fill_closure(cm, space_id); | |
| 2480 ParMarkBitMap::IterationStatus status; | |
| 2481 status = mbm->iterate(&update_closure, &fill_closure, beg_addr, end_addr, | |
| 2482 dense_prefix_end); | |
| 2483 if (status == ParMarkBitMap::incomplete) { | |
| 2484 update_closure.do_addr(update_closure.source()); | |
| 2485 } | |
| 2486 } | |
| 2487 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2488 // Mark the regions as filled. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2489 RegionData* const beg_cp = sd.region(beg_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2490 RegionData* const end_cp = sd.region(end_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2491 for (RegionData* cp = beg_cp; cp < end_cp; ++cp) { |
| 0 | 2492 cp->set_completed(); |
| 2493 } | |
| 2494 } | |
| 2495 | |
| 2496 // Return the SpaceId for the space containing addr. If addr is not in the | |
| 2497 // heap, last_space_id is returned. In debug mode it expects the address to be | |
| 2498 // in the heap and asserts such. | |
| 2499 PSParallelCompact::SpaceId PSParallelCompact::space_id(HeapWord* addr) { | |
| 2500 assert(Universe::heap()->is_in_reserved(addr), "addr not in the heap"); | |
| 2501 | |
| 2502 for (unsigned int id = perm_space_id; id < last_space_id; ++id) { | |
| 2503 if (_space_info[id].space()->contains(addr)) { | |
| 2504 return SpaceId(id); | |
| 2505 } | |
| 2506 } | |
| 2507 | |
| 2508 assert(false, "no space contains the addr"); | |
| 2509 return last_space_id; | |
| 2510 } | |
| 2511 | |
| 2512 void PSParallelCompact::update_deferred_objects(ParCompactionManager* cm, | |
| 2513 SpaceId id) { | |
| 2514 assert(id < last_space_id, "bad space id"); | |
| 2515 | |
| 2516 ParallelCompactData& sd = summary_data(); | |
| 2517 const SpaceInfo* const space_info = _space_info + id; | |
| 2518 ObjectStartArray* const start_array = space_info->start_array(); | |
| 2519 | |
| 2520 const MutableSpace* const space = space_info->space(); | |
| 2521 assert(space_info->dense_prefix() >= space->bottom(), "dense_prefix not set"); | |
| 2522 HeapWord* const beg_addr = space_info->dense_prefix(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2523 HeapWord* const end_addr = sd.region_align_up(space_info->new_top()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2524 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2525 const RegionData* const beg_region = sd.addr_to_region_ptr(beg_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2526 const RegionData* const end_region = sd.addr_to_region_ptr(end_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2527 const RegionData* cur_region; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2528 for (cur_region = beg_region; cur_region < end_region; ++cur_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2529 HeapWord* const addr = cur_region->deferred_obj_addr(); |
| 0 | 2530 if (addr != NULL) { |
| 2531 if (start_array != NULL) { | |
| 2532 start_array->allocate_block(addr); | |
| 2533 } | |
| 2534 oop(addr)->update_contents(cm); | |
| 2535 assert(oop(addr)->is_oop_or_null(), "should be an oop now"); | |
| 2536 } | |
| 2537 } | |
| 2538 } | |
| 2539 | |
| 2540 // Skip over count live words starting from beg, and return the address of the | |
| 2541 // next live word. Unless marked, the word corresponding to beg is assumed to | |
| 2542 // be dead. Callers must either ensure beg does not correspond to the middle of | |
| 2543 // an object, or account for those live words in some other way. Callers must | |
| 2544 // also ensure that there are enough live words in the range [beg, end) to skip. | |
| 2545 HeapWord* | |
| 2546 PSParallelCompact::skip_live_words(HeapWord* beg, HeapWord* end, size_t count) | |
| 2547 { | |
| 2548 assert(count > 0, "sanity"); | |
| 2549 | |
| 2550 ParMarkBitMap* m = mark_bitmap(); | |
| 2551 idx_t bits_to_skip = m->words_to_bits(count); | |
| 2552 idx_t cur_beg = m->addr_to_bit(beg); | |
| 2553 const idx_t search_end = BitMap::word_align_up(m->addr_to_bit(end)); | |
| 2554 | |
| 2555 do { | |
| 2556 cur_beg = m->find_obj_beg(cur_beg, search_end); | |
| 2557 idx_t cur_end = m->find_obj_end(cur_beg, search_end); | |
| 2558 const size_t obj_bits = cur_end - cur_beg + 1; | |
| 2559 if (obj_bits > bits_to_skip) { | |
| 2560 return m->bit_to_addr(cur_beg + bits_to_skip); | |
| 2561 } | |
| 2562 bits_to_skip -= obj_bits; | |
| 2563 cur_beg = cur_end + 1; | |
| 2564 } while (bits_to_skip > 0); | |
| 2565 | |
| 2566 // Skipping the desired number of words landed just past the end of an object. | |
| 2567 // Find the start of the next object. | |
| 2568 cur_beg = m->find_obj_beg(cur_beg, search_end); | |
| 2569 assert(cur_beg < m->addr_to_bit(end), "not enough live words to skip"); | |
| 2570 return m->bit_to_addr(cur_beg); | |
| 2571 } | |
| 2572 | |
| 2573 HeapWord* | |
| 2574 PSParallelCompact::first_src_addr(HeapWord* const dest_addr, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2575 size_t src_region_idx) |
| 0 | 2576 { |
| 2577 ParMarkBitMap* const bitmap = mark_bitmap(); | |
| 2578 const ParallelCompactData& sd = summary_data(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2579 const size_t RegionSize = ParallelCompactData::RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2580 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2581 assert(sd.is_region_aligned(dest_addr), "not aligned"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2582 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2583 const RegionData* const src_region_ptr = sd.region(src_region_idx); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2584 const size_t partial_obj_size = src_region_ptr->partial_obj_size(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2585 HeapWord* const src_region_destination = src_region_ptr->destination(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2586 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2587 assert(dest_addr >= src_region_destination, "wrong src region"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2588 assert(src_region_ptr->data_size() > 0, "src region cannot be empty"); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2589 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2590 HeapWord* const src_region_beg = sd.region_to_addr(src_region_idx); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2591 HeapWord* const src_region_end = src_region_beg + RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2592 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2593 HeapWord* addr = src_region_beg; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2594 if (dest_addr == src_region_destination) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2595 // Return the first live word in the source region. |
| 0 | 2596 if (partial_obj_size == 0) { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2597 addr = bitmap->find_obj_beg(addr, src_region_end); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2598 assert(addr < src_region_end, "no objects start in src region"); |
| 0 | 2599 } |
| 2600 return addr; | |
| 2601 } | |
| 2602 | |
| 2603 // Must skip some live data. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2604 size_t words_to_skip = dest_addr - src_region_destination; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2605 assert(src_region_ptr->data_size() > words_to_skip, "wrong src region"); |
| 0 | 2606 |
| 2607 if (partial_obj_size >= words_to_skip) { | |
| 2608 // All the live words to skip are part of the partial object. | |
| 2609 addr += words_to_skip; | |
| 2610 if (partial_obj_size == words_to_skip) { | |
| 2611 // Find the first live word past the partial object. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2612 addr = bitmap->find_obj_beg(addr, src_region_end); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2613 assert(addr < src_region_end, "wrong src region"); |
| 0 | 2614 } |
| 2615 return addr; | |
| 2616 } | |
| 2617 | |
| 2618 // Skip over the partial object (if any). | |
| 2619 if (partial_obj_size != 0) { | |
| 2620 words_to_skip -= partial_obj_size; | |
| 2621 addr += partial_obj_size; | |
| 2622 } | |
| 2623 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2624 // Skip over live words due to objects that start in the region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2625 addr = skip_live_words(addr, src_region_end, words_to_skip); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2626 assert(addr < src_region_end, "wrong src region"); |
| 0 | 2627 return addr; |
| 2628 } | |
| 2629 | |
| 2630 void PSParallelCompact::decrement_destination_counts(ParCompactionManager* cm, | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2631 size_t beg_region, |
| 0 | 2632 HeapWord* end_addr) |
| 2633 { | |
| 2634 ParallelCompactData& sd = summary_data(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2635 RegionData* const beg = sd.region(beg_region); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2636 HeapWord* const end_addr_aligned_up = sd.region_align_up(end_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2637 RegionData* const end = sd.addr_to_region_ptr(end_addr_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2638 size_t cur_idx = beg_region; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2639 for (RegionData* cur = beg; cur < end; ++cur, ++cur_idx) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2640 assert(cur->data_size() > 0, "region must have live data"); |
| 0 | 2641 cur->decrement_destination_count(); |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2642 if (cur_idx <= cur->source_region() && cur->available() && cur->claim()) { |
| 0 | 2643 cm->save_for_processing(cur_idx); |
| 2644 } | |
| 2645 } | |
| 2646 } | |
| 2647 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2648 size_t PSParallelCompact::next_src_region(MoveAndUpdateClosure& closure, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2649 SpaceId& src_space_id, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2650 HeapWord*& src_space_top, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2651 HeapWord* end_addr) |
| 0 | 2652 { |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2653 typedef ParallelCompactData::RegionData RegionData; |
| 0 | 2654 |
| 2655 ParallelCompactData& sd = PSParallelCompact::summary_data(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2656 const size_t region_size = ParallelCompactData::RegionSize; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2657 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2658 size_t src_region_idx = 0; |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2659 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2660 // Skip empty regions (if any) up to the top of the space. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2661 HeapWord* const src_aligned_up = sd.region_align_up(end_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2662 RegionData* src_region_ptr = sd.addr_to_region_ptr(src_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2663 HeapWord* const top_aligned_up = sd.region_align_up(src_space_top); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2664 const RegionData* const top_region_ptr = |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2665 sd.addr_to_region_ptr(top_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2666 while (src_region_ptr < top_region_ptr && src_region_ptr->data_size() == 0) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2667 ++src_region_ptr; |
| 0 | 2668 } |
| 2669 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2670 if (src_region_ptr < top_region_ptr) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2671 // The next source region is in the current space. Update src_region_idx |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2672 // and the source address to match src_region_ptr. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2673 src_region_idx = sd.region(src_region_ptr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2674 HeapWord* const src_region_addr = sd.region_to_addr(src_region_idx); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2675 if (src_region_addr > closure.source()) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2676 closure.set_source(src_region_addr); |
| 0 | 2677 } |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2678 return src_region_idx; |
| 0 | 2679 } |
| 2680 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2681 // Switch to a new source space and find the first non-empty region. |
| 0 | 2682 unsigned int space_id = src_space_id + 1; |
| 2683 assert(space_id < last_space_id, "not enough spaces"); | |
| 2684 | |
| 2685 HeapWord* const destination = closure.destination(); | |
| 2686 | |
| 2687 do { | |
| 2688 MutableSpace* space = _space_info[space_id].space(); | |
| 2689 HeapWord* const bottom = space->bottom(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2690 const RegionData* const bottom_cp = sd.addr_to_region_ptr(bottom); |
| 0 | 2691 |
| 2692 // Iterate over the spaces that do not compact into themselves. | |
| 2693 if (bottom_cp->destination() != bottom) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2694 HeapWord* const top_aligned_up = sd.region_align_up(space->top()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2695 const RegionData* const top_cp = sd.addr_to_region_ptr(top_aligned_up); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2696 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2697 for (const RegionData* src_cp = bottom_cp; src_cp < top_cp; ++src_cp) { |
| 0 | 2698 if (src_cp->live_obj_size() > 0) { |
| 2699 // Found it. | |
| 2700 assert(src_cp->destination() == destination, | |
| 2701 "first live obj in the space must match the destination"); | |
| 2702 assert(src_cp->partial_obj_size() == 0, | |
| 2703 "a space cannot begin with a partial obj"); | |
| 2704 | |
| 2705 src_space_id = SpaceId(space_id); | |
| 2706 src_space_top = space->top(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2707 const size_t src_region_idx = sd.region(src_cp); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2708 closure.set_source(sd.region_to_addr(src_region_idx)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2709 return src_region_idx; |
| 0 | 2710 } else { |
| 2711 assert(src_cp->data_size() == 0, "sanity"); | |
| 2712 } | |
| 2713 } | |
| 2714 } | |
| 2715 } while (++space_id < last_space_id); | |
| 2716 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2717 assert(false, "no source region was found"); |
| 0 | 2718 return 0; |
| 2719 } | |
| 2720 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2721 void PSParallelCompact::fill_region(ParCompactionManager* cm, size_t region_idx) |
| 0 | 2722 { |
| 2723 typedef ParMarkBitMap::IterationStatus IterationStatus; | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2724 const size_t RegionSize = ParallelCompactData::RegionSize; |
| 0 | 2725 ParMarkBitMap* const bitmap = mark_bitmap(); |
| 2726 ParallelCompactData& sd = summary_data(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2727 RegionData* const region_ptr = sd.region(region_idx); |
| 0 | 2728 |
| 2729 // Get the items needed to construct the closure. | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2730 HeapWord* dest_addr = sd.region_to_addr(region_idx); |
| 0 | 2731 SpaceId dest_space_id = space_id(dest_addr); |
| 2732 ObjectStartArray* start_array = _space_info[dest_space_id].start_array(); | |
| 2733 HeapWord* new_top = _space_info[dest_space_id].new_top(); | |
| 2734 assert(dest_addr < new_top, "sanity"); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2735 const size_t words = MIN2(pointer_delta(new_top, dest_addr), RegionSize); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2736 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2737 // Get the source region and related info. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2738 size_t src_region_idx = region_ptr->source_region(); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2739 SpaceId src_space_id = space_id(sd.region_to_addr(src_region_idx)); |
| 0 | 2740 HeapWord* src_space_top = _space_info[src_space_id].space()->top(); |
| 2741 | |
| 2742 MoveAndUpdateClosure closure(bitmap, cm, start_array, dest_addr, words); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2743 closure.set_source(first_src_addr(dest_addr, src_region_idx)); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2744 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2745 // Adjust src_region_idx to prepare for decrementing destination counts (the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2746 // destination count is not decremented when a region is copied to itself). |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2747 if (src_region_idx == region_idx) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2748 src_region_idx += 1; |
| 0 | 2749 } |
| 2750 | |
| 2751 if (bitmap->is_unmarked(closure.source())) { | |
| 2752 // The first source word is in the middle of an object; copy the remainder | |
| 2753 // of the object or as much as will fit. The fact that pointer updates were | |
| 2754 // deferred will be noted when the object header is processed. | |
| 2755 HeapWord* const old_src_addr = closure.source(); | |
| 2756 closure.copy_partial_obj(); | |
| 2757 if (closure.is_full()) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2758 decrement_destination_counts(cm, src_region_idx, closure.source()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2759 region_ptr->set_deferred_obj_addr(NULL); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2760 region_ptr->set_completed(); |
| 0 | 2761 return; |
| 2762 } | |
| 2763 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2764 HeapWord* const end_addr = sd.region_align_down(closure.source()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2765 if (sd.region_align_down(old_src_addr) != end_addr) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2766 // The partial object was copied from more than one source region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2767 decrement_destination_counts(cm, src_region_idx, end_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2768 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2769 // Move to the next source region, possibly switching spaces as well. All |
| 0 | 2770 // args except end_addr may be modified. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2771 src_region_idx = next_src_region(closure, src_space_id, src_space_top, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2772 end_addr); |
| 0 | 2773 } |
| 2774 } | |
| 2775 | |
| 2776 do { | |
| 2777 HeapWord* const cur_addr = closure.source(); | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2778 HeapWord* const end_addr = MIN2(sd.region_align_up(cur_addr + 1), |
| 0 | 2779 src_space_top); |
| 2780 IterationStatus status = bitmap->iterate(&closure, cur_addr, end_addr); | |
| 2781 | |
| 2782 if (status == ParMarkBitMap::incomplete) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2783 // The last obj that starts in the source region does not end in the |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2784 // region. |
| 0 | 2785 assert(closure.source() < end_addr, "sanity") |
| 2786 HeapWord* const obj_beg = closure.source(); | |
| 2787 HeapWord* const range_end = MIN2(obj_beg + closure.words_remaining(), | |
| 2788 src_space_top); | |
| 2789 HeapWord* const obj_end = bitmap->find_obj_end(obj_beg, range_end); | |
| 2790 if (obj_end < range_end) { | |
| 2791 // The end was found; the entire object will fit. | |
| 2792 status = closure.do_addr(obj_beg, bitmap->obj_size(obj_beg, obj_end)); | |
| 2793 assert(status != ParMarkBitMap::would_overflow, "sanity"); | |
| 2794 } else { | |
| 2795 // The end was not found; the object will not fit. | |
| 2796 assert(range_end < src_space_top, "obj cannot cross space boundary"); | |
| 2797 status = ParMarkBitMap::would_overflow; | |
| 2798 } | |
| 2799 } | |
| 2800 | |
| 2801 if (status == ParMarkBitMap::would_overflow) { | |
| 2802 // The last object did not fit. Note that interior oop updates were | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2803 // deferred, then copy enough of the object to fill the region. |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2804 region_ptr->set_deferred_obj_addr(closure.destination()); |
| 0 | 2805 status = closure.copy_until_full(); // copies from closure.source() |
| 2806 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2807 decrement_destination_counts(cm, src_region_idx, closure.source()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2808 region_ptr->set_completed(); |
| 0 | 2809 return; |
| 2810 } | |
| 2811 | |
| 2812 if (status == ParMarkBitMap::full) { | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2813 decrement_destination_counts(cm, src_region_idx, closure.source()); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2814 region_ptr->set_deferred_obj_addr(NULL); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2815 region_ptr->set_completed(); |
| 0 | 2816 return; |
| 2817 } | |
| 2818 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2819 decrement_destination_counts(cm, src_region_idx, end_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2820 |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2821 // Move to the next source region, possibly switching spaces as well. All |
| 0 | 2822 // args except end_addr may be modified. |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2823 src_region_idx = next_src_region(closure, src_space_id, src_space_top, |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2824 end_addr); |
| 0 | 2825 } while (true); |
| 2826 } | |
| 2827 | |
| 2828 void | |
| 2829 PSParallelCompact::move_and_update(ParCompactionManager* cm, SpaceId space_id) { | |
| 2830 const MutableSpace* sp = space(space_id); | |
| 2831 if (sp->is_empty()) { | |
| 2832 return; | |
| 2833 } | |
| 2834 | |
| 2835 ParallelCompactData& sd = PSParallelCompact::summary_data(); | |
| 2836 ParMarkBitMap* const bitmap = mark_bitmap(); | |
| 2837 HeapWord* const dp_addr = dense_prefix(space_id); | |
| 2838 HeapWord* beg_addr = sp->bottom(); | |
| 2839 HeapWord* end_addr = sp->top(); | |
| 2840 | |
| 2841 #ifdef ASSERT | |
| 2842 assert(beg_addr <= dp_addr && dp_addr <= end_addr, "bad dense prefix"); | |
| 2843 if (cm->should_verify_only()) { | |
| 2844 VerifyUpdateClosure verify_update(cm, sp); | |
| 2845 bitmap->iterate(&verify_update, beg_addr, end_addr); | |
| 2846 return; | |
| 2847 } | |
| 2848 | |
| 2849 if (cm->should_reset_only()) { | |
| 2850 ResetObjectsClosure reset_objects(cm); | |
| 2851 bitmap->iterate(&reset_objects, beg_addr, end_addr); | |
| 2852 return; | |
| 2853 } | |
| 2854 #endif | |
| 2855 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2856 const size_t beg_region = sd.addr_to_region_idx(beg_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2857 const size_t dp_region = sd.addr_to_region_idx(dp_addr); |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2858 if (beg_region < dp_region) { |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2859 update_and_deadwood_in_dense_prefix(cm, space_id, beg_region, dp_region); |
| 0 | 2860 } |
| 2861 | |
|
375
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2862 // The destination of the first live object that starts in the region is one |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2863 // past the end of the partial object entering the region (if any). |
|
81cd571500b0
6725697: par compact - rename class ChunkData to RegionData
jcoomes
parents:
374
diff
changeset
|
2864 HeapWord* const dest_addr = sd.partial_obj_end(dp_region); |
| 0 | 2865 HeapWord* const new_top = _space_info[space_id].new_top(); |
| 2866 assert(new_top >= dest_addr, "bad new_top value"); | |
| 2867 const size_t words = pointer_delta(new_top, dest_addr); | |
| 2868 | |
| 2869 if (words > 0) { | |
| 2870 ObjectStartArray* start_array = _space_info[space_id].start_array(); | |
| 2871 MoveAndUpdateClosure closure(bitmap, cm, start_array, dest_addr, words); | |
| 2872 | |
| 2873 ParMarkBitMap::IterationStatus status; | |
| 2874 status = bitmap->iterate(&closure, dest_addr, end_addr); | |
| 2875 assert(status == ParMarkBitMap::full, "iteration not complete"); | |
| 2876 assert(bitmap->find_obj_beg(closure.source(), end_addr) == end_addr, | |
| 2877 "live objects skipped because closure is full"); | |
| 2878 } | |
| 2879 } | |
| 2880 | |
| 2881 jlong PSParallelCompact::millis_since_last_gc() { | |
| 2882 jlong ret_val = os::javaTimeMillis() - _time_of_last_gc; | |
| 2883 // XXX See note in genCollectedHeap::millis_since_last_gc(). | |
| 2884 if (ret_val < 0) { | |
| 2885 NOT_PRODUCT(warning("time warp: %d", ret_val);) | |
| 2886 return 0; | |
| 2887 } | |
| 2888 return ret_val; | |
| 2889 } | |
| 2890 | |
| 2891 void PSParallelCompact::reset_millis_since_last_gc() { | |
| 2892 _time_of_last_gc = os::javaTimeMillis(); | |
| 2893 } | |
| 2894 | |
| 2895 ParMarkBitMap::IterationStatus MoveAndUpdateClosure::copy_until_full() | |
| 2896 { | |
| 2897 if (source() != destination()) { | |
| 2898 assert(source() > destination(), "must copy to the left"); | |
| 2899 Copy::aligned_conjoint_words(source(), destination(), words_remaining()); | |
| 2900 } | |
| 2901 update_state(words_remaining()); | |
| 2902 assert(is_full(), "sanity"); | |
| 2903 return ParMarkBitMap::full; | |
| 2904 } | |
| 2905 | |
| 2906 void MoveAndUpdateClosure::copy_partial_obj() | |
| 2907 { | |
| 2908 size_t words = words_remaining(); | |
| 2909 | |
| 2910 HeapWord* const range_end = MIN2(source() + words, bitmap()->region_end()); | |
| 2911 HeapWord* const end_addr = bitmap()->find_obj_end(source(), range_end); | |
| 2912 if (end_addr < range_end) { | |
| 2913 words = bitmap()->obj_size(source(), end_addr); | |
| 2914 } | |
| 2915 | |
| 2916 // This test is necessary; if omitted, the pointer updates to a partial object | |
| 2917 // that crosses the dense prefix boundary could be overwritten. | |
| 2918 if (source() != destination()) { | |
| 2919 assert(source() > destination(), "must copy to the left"); | |
| 2920 Copy::aligned_conjoint_words(source(), destination(), words); | |
| 2921 } | |
| 2922 update_state(words); | |
| 2923 } | |
| 2924 | |
| 2925 ParMarkBitMapClosure::IterationStatus | |
| 2926 MoveAndUpdateClosure::do_addr(HeapWord* addr, size_t words) { | |
| 2927 assert(destination() != NULL, "sanity"); | |
| 2928 assert(bitmap()->obj_size(addr) == words, "bad size"); | |
| 2929 | |
| 2930 _source = addr; | |
| 2931 assert(PSParallelCompact::summary_data().calc_new_pointer(source()) == | |
| 2932 destination(), "wrong destination"); | |
| 2933 | |
| 2934 if (words > words_remaining()) { | |
| 2935 return ParMarkBitMap::would_overflow; | |
| 2936 } | |
| 2937 | |
| 2938 // The start_array must be updated even if the object is not moving. | |
| 2939 if (_start_array != NULL) { | |
| 2940 _start_array->allocate_block(destination()); | |
| 2941 } | |
| 2942 | |
| 2943 if (destination() != source()) { | |
| 2944 assert(destination() < source(), "must copy to the left"); | |
| 2945 Copy::aligned_conjoint_words(source(), destination(), words); | |
| 2946 } | |
| 2947 | |
| 2948 oop moved_oop = (oop) destination(); | |
| 2949 moved_oop->update_contents(compaction_manager()); | |
| 2950 assert(moved_oop->is_oop_or_null(), "Object should be whole at this point"); | |
| 2951 | |
| 2952 update_state(words); | |
| 2953 assert(destination() == (HeapWord*)moved_oop + moved_oop->size(), "sanity"); | |
| 2954 return is_full() ? ParMarkBitMap::full : ParMarkBitMap::incomplete; | |
| 2955 } | |
| 2956 | |
| 2957 UpdateOnlyClosure::UpdateOnlyClosure(ParMarkBitMap* mbm, | |
| 2958 ParCompactionManager* cm, | |
| 2959 PSParallelCompact::SpaceId space_id) : | |
| 2960 ParMarkBitMapClosure(mbm, cm), | |
| 2961 _space_id(space_id), | |
| 2962 _start_array(PSParallelCompact::start_array(space_id)) | |
| 2963 { | |
| 2964 } | |
| 2965 | |
| 2966 // Updates the references in the object to their new values. | |
| 2967 ParMarkBitMapClosure::IterationStatus | |
| 2968 UpdateOnlyClosure::do_addr(HeapWord* addr, size_t words) { | |
| 2969 do_addr(addr); | |
| 2970 return ParMarkBitMap::incomplete; | |
| 2971 } | |
| 2972 | |
| 2973 // Verify the new location using the forwarding pointer | |
| 2974 // from MarkSweep::mark_sweep_phase2(). Set the mark_word | |
| 2975 // to the initial value. | |
| 2976 ParMarkBitMapClosure::IterationStatus | |
| 2977 PSParallelCompact::VerifyUpdateClosure::do_addr(HeapWord* addr, size_t words) { | |
| 2978 // The second arg (words) is not used. | |
| 2979 oop obj = (oop) addr; | |
| 2980 HeapWord* forwarding_ptr = (HeapWord*) obj->mark()->decode_pointer(); | |
| 2981 HeapWord* new_pointer = summary_data().calc_new_pointer(obj); | |
| 2982 if (forwarding_ptr == NULL) { | |
| 2983 // The object is dead or not moving. | |
| 2984 assert(bitmap()->is_unmarked(obj) || (new_pointer == (HeapWord*) obj), | |
| 2985 "Object liveness is wrong."); | |
| 2986 return ParMarkBitMap::incomplete; | |
| 2987 } | |
| 2988 assert(UseParallelOldGCDensePrefix || | |
| 2989 (HeapMaximumCompactionInterval > 1) || | |
| 2990 (MarkSweepAlwaysCompactCount > 1) || | |
| 2991 (forwarding_ptr == new_pointer), | |
| 2992 "Calculation of new location is incorrect"); | |
| 2993 return ParMarkBitMap::incomplete; | |
| 2994 } | |
| 2995 | |
| 2996 // Reset objects modified for debug checking. | |
| 2997 ParMarkBitMapClosure::IterationStatus | |
| 2998 PSParallelCompact::ResetObjectsClosure::do_addr(HeapWord* addr, size_t words) { | |
| 2999 // The second arg (words) is not used. | |
| 3000 oop obj = (oop) addr; | |
| 3001 obj->init_mark(); | |
| 3002 return ParMarkBitMap::incomplete; | |
| 3003 } | |
| 3004 | |
| 3005 // Prepare for compaction. This method is executed once | |
| 3006 // (i.e., by a single thread) before compaction. | |
| 3007 // Save the updated location of the intArrayKlassObj for | |
| 3008 // filling holes in the dense prefix. | |
| 3009 void PSParallelCompact::compact_prologue() { | |
| 3010 _updated_int_array_klass_obj = (klassOop) | |
| 3011 summary_data().calc_new_pointer(Universe::intArrayKlassObj()); | |
| 3012 } | |
| 3013 | |
| 3014 // The initial implementation of this method created a field | |
| 3015 // _next_compaction_space_id in SpaceInfo and initialized | |
| 3016 // that field in SpaceInfo::initialize_space_info(). That | |
| 3017 // required that _next_compaction_space_id be declared a | |
| 3018 // SpaceId in SpaceInfo and that would have required that | |
| 3019 // either SpaceId be declared in a separate class or that | |
| 3020 // it be declared in SpaceInfo. It didn't seem consistent | |
| 3021 // to declare it in SpaceInfo (didn't really fit logically). | |
| 3022 // Alternatively, defining a separate class to define SpaceId | |
| 3023 // seem excessive. This implementation is simple and localizes | |
| 3024 // the knowledge. | |
| 3025 | |
| 3026 PSParallelCompact::SpaceId | |
| 3027 PSParallelCompact::next_compaction_space_id(SpaceId id) { | |
| 3028 assert(id < last_space_id, "id out of range"); | |
| 3029 switch (id) { | |
| 3030 case perm_space_id : | |
| 3031 return last_space_id; | |
| 3032 case old_space_id : | |
| 3033 return eden_space_id; | |
| 3034 case eden_space_id : | |
| 3035 return from_space_id; | |
| 3036 case from_space_id : | |
| 3037 return to_space_id; | |
| 3038 case to_space_id : | |
| 3039 return last_space_id; | |
| 3040 default: | |
| 3041 assert(false, "Bad space id"); | |
| 3042 return last_space_id; | |
| 3043 } | |
| 3044 } |