Tue, 07 Oct 2008 11:01:35 -0700
Merge
duke@435 | 1 | /* |
xdono@631 | 2 | * Copyright 2001-2008 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_psYoungGen.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | PSYoungGen::PSYoungGen(size_t initial_size, |
duke@435 | 29 | size_t min_size, |
duke@435 | 30 | size_t max_size) : |
duke@435 | 31 | _init_gen_size(initial_size), |
duke@435 | 32 | _min_gen_size(min_size), |
duke@435 | 33 | _max_gen_size(max_size) |
duke@435 | 34 | {} |
duke@435 | 35 | |
duke@435 | 36 | void PSYoungGen::initialize_virtual_space(ReservedSpace rs, size_t alignment) { |
duke@435 | 37 | assert(_init_gen_size != 0, "Should have a finite size"); |
duke@435 | 38 | _virtual_space = new PSVirtualSpace(rs, alignment); |
jmasa@698 | 39 | if (!virtual_space()->expand_by(_init_gen_size)) { |
duke@435 | 40 | vm_exit_during_initialization("Could not reserve enough space for " |
duke@435 | 41 | "object heap"); |
duke@435 | 42 | } |
duke@435 | 43 | } |
duke@435 | 44 | |
duke@435 | 45 | void PSYoungGen::initialize(ReservedSpace rs, size_t alignment) { |
duke@435 | 46 | initialize_virtual_space(rs, alignment); |
duke@435 | 47 | initialize_work(); |
duke@435 | 48 | } |
duke@435 | 49 | |
duke@435 | 50 | void PSYoungGen::initialize_work() { |
duke@435 | 51 | |
jmasa@698 | 52 | _reserved = MemRegion((HeapWord*)virtual_space()->low_boundary(), |
jmasa@698 | 53 | (HeapWord*)virtual_space()->high_boundary()); |
duke@435 | 54 | |
jmasa@698 | 55 | MemRegion cmr((HeapWord*)virtual_space()->low(), |
jmasa@698 | 56 | (HeapWord*)virtual_space()->high()); |
duke@435 | 57 | Universe::heap()->barrier_set()->resize_covered_region(cmr); |
duke@435 | 58 | |
jmasa@698 | 59 | if (ZapUnusedHeapArea) { |
jmasa@698 | 60 | // Mangle newly committed space immediately because it |
jmasa@698 | 61 | // can be done here more simply that after the new |
jmasa@698 | 62 | // spaces have been computed. |
jmasa@698 | 63 | SpaceMangler::mangle_region(cmr); |
jmasa@698 | 64 | } |
jmasa@698 | 65 | |
duke@435 | 66 | if (UseNUMA) { |
duke@435 | 67 | _eden_space = new MutableNUMASpace(); |
duke@435 | 68 | } else { |
duke@435 | 69 | _eden_space = new MutableSpace(); |
duke@435 | 70 | } |
duke@435 | 71 | _from_space = new MutableSpace(); |
duke@435 | 72 | _to_space = new MutableSpace(); |
duke@435 | 73 | |
duke@435 | 74 | if (_eden_space == NULL || _from_space == NULL || _to_space == NULL) { |
duke@435 | 75 | vm_exit_during_initialization("Could not allocate a young gen space"); |
duke@435 | 76 | } |
duke@435 | 77 | |
duke@435 | 78 | // Allocate the mark sweep views of spaces |
duke@435 | 79 | _eden_mark_sweep = |
duke@435 | 80 | new PSMarkSweepDecorator(_eden_space, NULL, MarkSweepDeadRatio); |
duke@435 | 81 | _from_mark_sweep = |
duke@435 | 82 | new PSMarkSweepDecorator(_from_space, NULL, MarkSweepDeadRatio); |
duke@435 | 83 | _to_mark_sweep = |
duke@435 | 84 | new PSMarkSweepDecorator(_to_space, NULL, MarkSweepDeadRatio); |
duke@435 | 85 | |
duke@435 | 86 | if (_eden_mark_sweep == NULL || |
duke@435 | 87 | _from_mark_sweep == NULL || |
duke@435 | 88 | _to_mark_sweep == NULL) { |
duke@435 | 89 | vm_exit_during_initialization("Could not complete allocation" |
duke@435 | 90 | " of the young generation"); |
duke@435 | 91 | } |
duke@435 | 92 | |
duke@435 | 93 | // Generation Counters - generation 0, 3 subspaces |
duke@435 | 94 | _gen_counters = new PSGenerationCounters("new", 0, 3, _virtual_space); |
duke@435 | 95 | |
duke@435 | 96 | // Compute maximum space sizes for performance counters |
duke@435 | 97 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
jmasa@448 | 98 | size_t alignment = heap->intra_heap_alignment(); |
jmasa@698 | 99 | size_t size = virtual_space()->reserved_size(); |
duke@435 | 100 | |
duke@435 | 101 | size_t max_survivor_size; |
duke@435 | 102 | size_t max_eden_size; |
duke@435 | 103 | |
duke@435 | 104 | if (UseAdaptiveSizePolicy) { |
duke@435 | 105 | max_survivor_size = size / MinSurvivorRatio; |
duke@435 | 106 | |
duke@435 | 107 | // round the survivor space size down to the nearest alignment |
duke@435 | 108 | // and make sure its size is greater than 0. |
duke@435 | 109 | max_survivor_size = align_size_down(max_survivor_size, alignment); |
duke@435 | 110 | max_survivor_size = MAX2(max_survivor_size, alignment); |
duke@435 | 111 | |
duke@435 | 112 | // set the maximum size of eden to be the size of the young gen |
duke@435 | 113 | // less two times the minimum survivor size. The minimum survivor |
duke@435 | 114 | // size for UseAdaptiveSizePolicy is one alignment. |
duke@435 | 115 | max_eden_size = size - 2 * alignment; |
duke@435 | 116 | } else { |
duke@435 | 117 | max_survivor_size = size / InitialSurvivorRatio; |
duke@435 | 118 | |
duke@435 | 119 | // round the survivor space size down to the nearest alignment |
duke@435 | 120 | // and make sure its size is greater than 0. |
duke@435 | 121 | max_survivor_size = align_size_down(max_survivor_size, alignment); |
duke@435 | 122 | max_survivor_size = MAX2(max_survivor_size, alignment); |
duke@435 | 123 | |
duke@435 | 124 | // set the maximum size of eden to be the size of the young gen |
duke@435 | 125 | // less two times the survivor size when the generation is 100% |
duke@435 | 126 | // committed. The minimum survivor size for -UseAdaptiveSizePolicy |
duke@435 | 127 | // is dependent on the committed portion (current capacity) of the |
duke@435 | 128 | // generation - the less space committed, the smaller the survivor |
duke@435 | 129 | // space, possibly as small as an alignment. However, we are interested |
duke@435 | 130 | // in the case where the young generation is 100% committed, as this |
duke@435 | 131 | // is the point where eden reachs its maximum size. At this point, |
duke@435 | 132 | // the size of a survivor space is max_survivor_size. |
duke@435 | 133 | max_eden_size = size - 2 * max_survivor_size; |
duke@435 | 134 | } |
duke@435 | 135 | |
duke@435 | 136 | _eden_counters = new SpaceCounters("eden", 0, max_eden_size, _eden_space, |
duke@435 | 137 | _gen_counters); |
duke@435 | 138 | _from_counters = new SpaceCounters("s0", 1, max_survivor_size, _from_space, |
duke@435 | 139 | _gen_counters); |
duke@435 | 140 | _to_counters = new SpaceCounters("s1", 2, max_survivor_size, _to_space, |
duke@435 | 141 | _gen_counters); |
duke@435 | 142 | |
duke@435 | 143 | compute_initial_space_boundaries(); |
duke@435 | 144 | } |
duke@435 | 145 | |
duke@435 | 146 | void PSYoungGen::compute_initial_space_boundaries() { |
duke@435 | 147 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 148 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 149 | |
duke@435 | 150 | // Compute sizes |
jmasa@448 | 151 | size_t alignment = heap->intra_heap_alignment(); |
jmasa@698 | 152 | size_t size = virtual_space()->committed_size(); |
duke@435 | 153 | |
duke@435 | 154 | size_t survivor_size = size / InitialSurvivorRatio; |
duke@435 | 155 | survivor_size = align_size_down(survivor_size, alignment); |
duke@435 | 156 | // ... but never less than an alignment |
duke@435 | 157 | survivor_size = MAX2(survivor_size, alignment); |
duke@435 | 158 | |
duke@435 | 159 | // Young generation is eden + 2 survivor spaces |
duke@435 | 160 | size_t eden_size = size - (2 * survivor_size); |
duke@435 | 161 | |
duke@435 | 162 | // Now go ahead and set 'em. |
duke@435 | 163 | set_space_boundaries(eden_size, survivor_size); |
duke@435 | 164 | space_invariants(); |
duke@435 | 165 | |
duke@435 | 166 | if (UsePerfData) { |
duke@435 | 167 | _eden_counters->update_capacity(); |
duke@435 | 168 | _from_counters->update_capacity(); |
duke@435 | 169 | _to_counters->update_capacity(); |
duke@435 | 170 | } |
duke@435 | 171 | } |
duke@435 | 172 | |
duke@435 | 173 | void PSYoungGen::set_space_boundaries(size_t eden_size, size_t survivor_size) { |
jmasa@698 | 174 | assert(eden_size < virtual_space()->committed_size(), "just checking"); |
duke@435 | 175 | assert(eden_size > 0 && survivor_size > 0, "just checking"); |
duke@435 | 176 | |
duke@435 | 177 | // Initial layout is Eden, to, from. After swapping survivor spaces, |
duke@435 | 178 | // that leaves us with Eden, from, to, which is step one in our two |
duke@435 | 179 | // step resize-with-live-data procedure. |
jmasa@698 | 180 | char *eden_start = virtual_space()->low(); |
duke@435 | 181 | char *to_start = eden_start + eden_size; |
duke@435 | 182 | char *from_start = to_start + survivor_size; |
duke@435 | 183 | char *from_end = from_start + survivor_size; |
duke@435 | 184 | |
jmasa@698 | 185 | assert(from_end == virtual_space()->high(), "just checking"); |
duke@435 | 186 | assert(is_object_aligned((intptr_t)eden_start), "checking alignment"); |
duke@435 | 187 | assert(is_object_aligned((intptr_t)to_start), "checking alignment"); |
duke@435 | 188 | assert(is_object_aligned((intptr_t)from_start), "checking alignment"); |
duke@435 | 189 | |
duke@435 | 190 | MemRegion eden_mr((HeapWord*)eden_start, (HeapWord*)to_start); |
duke@435 | 191 | MemRegion to_mr ((HeapWord*)to_start, (HeapWord*)from_start); |
duke@435 | 192 | MemRegion from_mr((HeapWord*)from_start, (HeapWord*)from_end); |
duke@435 | 193 | |
jmasa@698 | 194 | eden_space()->initialize(eden_mr, true, ZapUnusedHeapArea); |
jmasa@698 | 195 | to_space()->initialize(to_mr , true, ZapUnusedHeapArea); |
jmasa@698 | 196 | from_space()->initialize(from_mr, true, ZapUnusedHeapArea); |
duke@435 | 197 | } |
duke@435 | 198 | |
duke@435 | 199 | #ifndef PRODUCT |
duke@435 | 200 | void PSYoungGen::space_invariants() { |
duke@435 | 201 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
jmasa@448 | 202 | const size_t alignment = heap->intra_heap_alignment(); |
duke@435 | 203 | |
duke@435 | 204 | // Currently, our eden size cannot shrink to zero |
duke@435 | 205 | guarantee(eden_space()->capacity_in_bytes() >= alignment, "eden too small"); |
duke@435 | 206 | guarantee(from_space()->capacity_in_bytes() >= alignment, "from too small"); |
duke@435 | 207 | guarantee(to_space()->capacity_in_bytes() >= alignment, "to too small"); |
duke@435 | 208 | |
duke@435 | 209 | // Relationship of spaces to each other |
duke@435 | 210 | char* eden_start = (char*)eden_space()->bottom(); |
duke@435 | 211 | char* eden_end = (char*)eden_space()->end(); |
duke@435 | 212 | char* from_start = (char*)from_space()->bottom(); |
duke@435 | 213 | char* from_end = (char*)from_space()->end(); |
duke@435 | 214 | char* to_start = (char*)to_space()->bottom(); |
duke@435 | 215 | char* to_end = (char*)to_space()->end(); |
duke@435 | 216 | |
jmasa@698 | 217 | guarantee(eden_start >= virtual_space()->low(), "eden bottom"); |
duke@435 | 218 | guarantee(eden_start < eden_end, "eden space consistency"); |
duke@435 | 219 | guarantee(from_start < from_end, "from space consistency"); |
duke@435 | 220 | guarantee(to_start < to_end, "to space consistency"); |
duke@435 | 221 | |
duke@435 | 222 | // Check whether from space is below to space |
duke@435 | 223 | if (from_start < to_start) { |
duke@435 | 224 | // Eden, from, to |
duke@435 | 225 | guarantee(eden_end <= from_start, "eden/from boundary"); |
duke@435 | 226 | guarantee(from_end <= to_start, "from/to boundary"); |
jmasa@698 | 227 | guarantee(to_end <= virtual_space()->high(), "to end"); |
duke@435 | 228 | } else { |
duke@435 | 229 | // Eden, to, from |
duke@435 | 230 | guarantee(eden_end <= to_start, "eden/to boundary"); |
duke@435 | 231 | guarantee(to_end <= from_start, "to/from boundary"); |
jmasa@698 | 232 | guarantee(from_end <= virtual_space()->high(), "from end"); |
duke@435 | 233 | } |
duke@435 | 234 | |
duke@435 | 235 | // More checks that the virtual space is consistent with the spaces |
jmasa@698 | 236 | assert(virtual_space()->committed_size() >= |
duke@435 | 237 | (eden_space()->capacity_in_bytes() + |
duke@435 | 238 | to_space()->capacity_in_bytes() + |
duke@435 | 239 | from_space()->capacity_in_bytes()), "Committed size is inconsistent"); |
jmasa@698 | 240 | assert(virtual_space()->committed_size() <= virtual_space()->reserved_size(), |
duke@435 | 241 | "Space invariant"); |
duke@435 | 242 | char* eden_top = (char*)eden_space()->top(); |
duke@435 | 243 | char* from_top = (char*)from_space()->top(); |
duke@435 | 244 | char* to_top = (char*)to_space()->top(); |
jmasa@698 | 245 | assert(eden_top <= virtual_space()->high(), "eden top"); |
jmasa@698 | 246 | assert(from_top <= virtual_space()->high(), "from top"); |
jmasa@698 | 247 | assert(to_top <= virtual_space()->high(), "to top"); |
duke@435 | 248 | |
jmasa@698 | 249 | virtual_space()->verify(); |
duke@435 | 250 | } |
duke@435 | 251 | #endif |
duke@435 | 252 | |
duke@435 | 253 | void PSYoungGen::resize(size_t eden_size, size_t survivor_size) { |
duke@435 | 254 | // Resize the generation if needed. If the generation resize |
duke@435 | 255 | // reports false, do not attempt to resize the spaces. |
duke@435 | 256 | if (resize_generation(eden_size, survivor_size)) { |
duke@435 | 257 | // Then we lay out the spaces inside the generation |
duke@435 | 258 | resize_spaces(eden_size, survivor_size); |
duke@435 | 259 | |
duke@435 | 260 | space_invariants(); |
duke@435 | 261 | |
duke@435 | 262 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 263 | gclog_or_tty->print_cr("Young generation size: " |
duke@435 | 264 | "desired eden: " SIZE_FORMAT " survivor: " SIZE_FORMAT |
duke@435 | 265 | " used: " SIZE_FORMAT " capacity: " SIZE_FORMAT |
duke@435 | 266 | " gen limits: " SIZE_FORMAT " / " SIZE_FORMAT, |
duke@435 | 267 | eden_size, survivor_size, used_in_bytes(), capacity_in_bytes(), |
duke@435 | 268 | _max_gen_size, min_gen_size()); |
duke@435 | 269 | } |
duke@435 | 270 | } |
duke@435 | 271 | } |
duke@435 | 272 | |
duke@435 | 273 | |
duke@435 | 274 | bool PSYoungGen::resize_generation(size_t eden_size, size_t survivor_size) { |
jmasa@698 | 275 | const size_t alignment = virtual_space()->alignment(); |
jmasa@698 | 276 | size_t orig_size = virtual_space()->committed_size(); |
duke@435 | 277 | bool size_changed = false; |
duke@435 | 278 | |
duke@435 | 279 | // There used to be this guarantee there. |
duke@435 | 280 | // guarantee ((eden_size + 2*survivor_size) <= _max_gen_size, "incorrect input arguments"); |
duke@435 | 281 | // Code below forces this requirement. In addition the desired eden |
duke@435 | 282 | // size and disired survivor sizes are desired goals and may |
duke@435 | 283 | // exceed the total generation size. |
duke@435 | 284 | |
duke@435 | 285 | assert(min_gen_size() <= orig_size && orig_size <= max_size(), "just checking"); |
duke@435 | 286 | |
duke@435 | 287 | // Adjust new generation size |
duke@435 | 288 | const size_t eden_plus_survivors = |
duke@435 | 289 | align_size_up(eden_size + 2 * survivor_size, alignment); |
duke@435 | 290 | size_t desired_size = MAX2(MIN2(eden_plus_survivors, max_size()), |
duke@435 | 291 | min_gen_size()); |
duke@435 | 292 | assert(desired_size <= max_size(), "just checking"); |
duke@435 | 293 | |
duke@435 | 294 | if (desired_size > orig_size) { |
duke@435 | 295 | // Grow the generation |
duke@435 | 296 | size_t change = desired_size - orig_size; |
duke@435 | 297 | assert(change % alignment == 0, "just checking"); |
jmasa@698 | 298 | HeapWord* prev_high = (HeapWord*) virtual_space()->high(); |
jmasa@698 | 299 | if (!virtual_space()->expand_by(change)) { |
duke@435 | 300 | return false; // Error if we fail to resize! |
duke@435 | 301 | } |
jmasa@698 | 302 | if (ZapUnusedHeapArea) { |
jmasa@698 | 303 | // Mangle newly committed space immediately because it |
jmasa@698 | 304 | // can be done here more simply that after the new |
jmasa@698 | 305 | // spaces have been computed. |
jmasa@698 | 306 | HeapWord* new_high = (HeapWord*) virtual_space()->high(); |
jmasa@698 | 307 | MemRegion mangle_region(prev_high, new_high); |
jmasa@698 | 308 | SpaceMangler::mangle_region(mangle_region); |
jmasa@698 | 309 | } |
duke@435 | 310 | size_changed = true; |
duke@435 | 311 | } else if (desired_size < orig_size) { |
duke@435 | 312 | size_t desired_change = orig_size - desired_size; |
duke@435 | 313 | assert(desired_change % alignment == 0, "just checking"); |
duke@435 | 314 | |
duke@435 | 315 | desired_change = limit_gen_shrink(desired_change); |
duke@435 | 316 | |
duke@435 | 317 | if (desired_change > 0) { |
duke@435 | 318 | virtual_space()->shrink_by(desired_change); |
duke@435 | 319 | reset_survivors_after_shrink(); |
duke@435 | 320 | |
duke@435 | 321 | size_changed = true; |
duke@435 | 322 | } |
duke@435 | 323 | } else { |
duke@435 | 324 | if (Verbose && PrintGC) { |
duke@435 | 325 | if (orig_size == gen_size_limit()) { |
duke@435 | 326 | gclog_or_tty->print_cr("PSYoung generation size at maximum: " |
duke@435 | 327 | SIZE_FORMAT "K", orig_size/K); |
duke@435 | 328 | } else if (orig_size == min_gen_size()) { |
duke@435 | 329 | gclog_or_tty->print_cr("PSYoung generation size at minium: " |
duke@435 | 330 | SIZE_FORMAT "K", orig_size/K); |
duke@435 | 331 | } |
duke@435 | 332 | } |
duke@435 | 333 | } |
duke@435 | 334 | |
duke@435 | 335 | if (size_changed) { |
duke@435 | 336 | post_resize(); |
duke@435 | 337 | |
duke@435 | 338 | if (Verbose && PrintGC) { |
jmasa@698 | 339 | size_t current_size = virtual_space()->committed_size(); |
duke@435 | 340 | gclog_or_tty->print_cr("PSYoung generation size changed: " |
duke@435 | 341 | SIZE_FORMAT "K->" SIZE_FORMAT "K", |
duke@435 | 342 | orig_size/K, current_size/K); |
duke@435 | 343 | } |
duke@435 | 344 | } |
duke@435 | 345 | |
jmasa@698 | 346 | guarantee(eden_plus_survivors <= virtual_space()->committed_size() || |
jmasa@698 | 347 | virtual_space()->committed_size() == max_size(), "Sanity"); |
duke@435 | 348 | |
duke@435 | 349 | return true; |
duke@435 | 350 | } |
duke@435 | 351 | |
jmasa@698 | 352 | #ifndef PRODUCT |
jmasa@698 | 353 | // In the numa case eden is not mangled so a survivor space |
jmasa@698 | 354 | // moving into a region previously occupied by a survivor |
jmasa@698 | 355 | // may find an unmangled region. Also in the PS case eden |
jmasa@698 | 356 | // to-space and from-space may not touch (i.e., there may be |
jmasa@698 | 357 | // gaps between them due to movement while resizing the |
jmasa@698 | 358 | // spaces). Those gaps must be mangled. |
jmasa@698 | 359 | void PSYoungGen::mangle_survivors(MutableSpace* s1, |
jmasa@698 | 360 | MemRegion s1MR, |
jmasa@698 | 361 | MutableSpace* s2, |
jmasa@698 | 362 | MemRegion s2MR) { |
jmasa@698 | 363 | // Check eden and gap between eden and from-space, in deciding |
jmasa@698 | 364 | // what to mangle in from-space. Check the gap between from-space |
jmasa@698 | 365 | // and to-space when deciding what to mangle. |
jmasa@698 | 366 | // |
jmasa@698 | 367 | // +--------+ +----+ +---+ |
jmasa@698 | 368 | // | eden | |s1 | |s2 | |
jmasa@698 | 369 | // +--------+ +----+ +---+ |
jmasa@698 | 370 | // +-------+ +-----+ |
jmasa@698 | 371 | // |s1MR | |s2MR | |
jmasa@698 | 372 | // +-------+ +-----+ |
jmasa@698 | 373 | // All of survivor-space is properly mangled so find the |
jmasa@698 | 374 | // upper bound on the mangling for any portion above current s1. |
jmasa@698 | 375 | HeapWord* delta_end = MIN2(s1->bottom(), s1MR.end()); |
jmasa@698 | 376 | MemRegion delta1_left; |
jmasa@698 | 377 | if (s1MR.start() < delta_end) { |
jmasa@698 | 378 | delta1_left = MemRegion(s1MR.start(), delta_end); |
jmasa@698 | 379 | s1->mangle_region(delta1_left); |
jmasa@698 | 380 | } |
jmasa@698 | 381 | // Find any portion to the right of the current s1. |
jmasa@698 | 382 | HeapWord* delta_start = MAX2(s1->end(), s1MR.start()); |
jmasa@698 | 383 | MemRegion delta1_right; |
jmasa@698 | 384 | if (delta_start < s1MR.end()) { |
jmasa@698 | 385 | delta1_right = MemRegion(delta_start, s1MR.end()); |
jmasa@698 | 386 | s1->mangle_region(delta1_right); |
jmasa@698 | 387 | } |
jmasa@698 | 388 | |
jmasa@698 | 389 | // Similarly for the second survivor space except that |
jmasa@698 | 390 | // any of the new region that overlaps with the current |
jmasa@698 | 391 | // region of the first survivor space has already been |
jmasa@698 | 392 | // mangled. |
jmasa@698 | 393 | delta_end = MIN2(s2->bottom(), s2MR.end()); |
jmasa@698 | 394 | delta_start = MAX2(s2MR.start(), s1->end()); |
jmasa@698 | 395 | MemRegion delta2_left; |
jmasa@698 | 396 | if (s2MR.start() < delta_end) { |
jmasa@698 | 397 | delta2_left = MemRegion(s2MR.start(), delta_end); |
jmasa@698 | 398 | s2->mangle_region(delta2_left); |
jmasa@698 | 399 | } |
jmasa@698 | 400 | delta_start = MAX2(s2->end(), s2MR.start()); |
jmasa@698 | 401 | MemRegion delta2_right; |
jmasa@698 | 402 | if (delta_start < s2MR.end()) { |
jmasa@698 | 403 | s2->mangle_region(delta2_right); |
jmasa@698 | 404 | } |
jmasa@698 | 405 | |
jmasa@698 | 406 | if (TraceZapUnusedHeapArea) { |
jmasa@698 | 407 | // s1 |
jmasa@698 | 408 | gclog_or_tty->print_cr("Current region: [" PTR_FORMAT ", " PTR_FORMAT ") " |
jmasa@698 | 409 | "New region: [" PTR_FORMAT ", " PTR_FORMAT ")", |
jmasa@698 | 410 | s1->bottom(), s1->end(), s1MR.start(), s1MR.end()); |
jmasa@698 | 411 | gclog_or_tty->print_cr(" Mangle before: [" PTR_FORMAT ", " |
jmasa@698 | 412 | PTR_FORMAT ") Mangle after: [" PTR_FORMAT ", " PTR_FORMAT ")", |
jmasa@698 | 413 | delta1_left.start(), delta1_left.end(), delta1_right.start(), |
jmasa@698 | 414 | delta1_right.end()); |
jmasa@698 | 415 | |
jmasa@698 | 416 | // s2 |
jmasa@698 | 417 | gclog_or_tty->print_cr("Current region: [" PTR_FORMAT ", " PTR_FORMAT ") " |
jmasa@698 | 418 | "New region: [" PTR_FORMAT ", " PTR_FORMAT ")", |
jmasa@698 | 419 | s2->bottom(), s2->end(), s2MR.start(), s2MR.end()); |
jmasa@698 | 420 | gclog_or_tty->print_cr(" Mangle before: [" PTR_FORMAT ", " |
jmasa@698 | 421 | PTR_FORMAT ") Mangle after: [" PTR_FORMAT ", " PTR_FORMAT ")", |
jmasa@698 | 422 | delta2_left.start(), delta2_left.end(), delta2_right.start(), |
jmasa@698 | 423 | delta2_right.end()); |
jmasa@698 | 424 | } |
jmasa@698 | 425 | |
jmasa@698 | 426 | } |
jmasa@698 | 427 | #endif // NOT PRODUCT |
duke@435 | 428 | |
duke@435 | 429 | void PSYoungGen::resize_spaces(size_t requested_eden_size, |
duke@435 | 430 | size_t requested_survivor_size) { |
duke@435 | 431 | assert(UseAdaptiveSizePolicy, "sanity check"); |
duke@435 | 432 | assert(requested_eden_size > 0 && requested_survivor_size > 0, |
duke@435 | 433 | "just checking"); |
duke@435 | 434 | |
duke@435 | 435 | // We require eden and to space to be empty |
duke@435 | 436 | if ((!eden_space()->is_empty()) || (!to_space()->is_empty())) { |
duke@435 | 437 | return; |
duke@435 | 438 | } |
duke@435 | 439 | |
duke@435 | 440 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 441 | gclog_or_tty->print_cr("PSYoungGen::resize_spaces(requested_eden_size: " |
duke@435 | 442 | SIZE_FORMAT |
duke@435 | 443 | ", requested_survivor_size: " SIZE_FORMAT ")", |
duke@435 | 444 | requested_eden_size, requested_survivor_size); |
duke@435 | 445 | gclog_or_tty->print_cr(" eden: [" PTR_FORMAT ".." PTR_FORMAT ") " |
duke@435 | 446 | SIZE_FORMAT, |
duke@435 | 447 | eden_space()->bottom(), |
duke@435 | 448 | eden_space()->end(), |
duke@435 | 449 | pointer_delta(eden_space()->end(), |
duke@435 | 450 | eden_space()->bottom(), |
duke@435 | 451 | sizeof(char))); |
duke@435 | 452 | gclog_or_tty->print_cr(" from: [" PTR_FORMAT ".." PTR_FORMAT ") " |
duke@435 | 453 | SIZE_FORMAT, |
duke@435 | 454 | from_space()->bottom(), |
duke@435 | 455 | from_space()->end(), |
duke@435 | 456 | pointer_delta(from_space()->end(), |
duke@435 | 457 | from_space()->bottom(), |
duke@435 | 458 | sizeof(char))); |
duke@435 | 459 | gclog_or_tty->print_cr(" to: [" PTR_FORMAT ".." PTR_FORMAT ") " |
duke@435 | 460 | SIZE_FORMAT, |
duke@435 | 461 | to_space()->bottom(), |
duke@435 | 462 | to_space()->end(), |
duke@435 | 463 | pointer_delta( to_space()->end(), |
duke@435 | 464 | to_space()->bottom(), |
duke@435 | 465 | sizeof(char))); |
duke@435 | 466 | } |
duke@435 | 467 | |
duke@435 | 468 | // There's nothing to do if the new sizes are the same as the current |
duke@435 | 469 | if (requested_survivor_size == to_space()->capacity_in_bytes() && |
duke@435 | 470 | requested_survivor_size == from_space()->capacity_in_bytes() && |
duke@435 | 471 | requested_eden_size == eden_space()->capacity_in_bytes()) { |
duke@435 | 472 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 473 | gclog_or_tty->print_cr(" capacities are the right sizes, returning"); |
duke@435 | 474 | } |
duke@435 | 475 | return; |
duke@435 | 476 | } |
duke@435 | 477 | |
duke@435 | 478 | char* eden_start = (char*)eden_space()->bottom(); |
duke@435 | 479 | char* eden_end = (char*)eden_space()->end(); |
duke@435 | 480 | char* from_start = (char*)from_space()->bottom(); |
duke@435 | 481 | char* from_end = (char*)from_space()->end(); |
duke@435 | 482 | char* to_start = (char*)to_space()->bottom(); |
duke@435 | 483 | char* to_end = (char*)to_space()->end(); |
duke@435 | 484 | |
duke@435 | 485 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
jmasa@448 | 486 | const size_t alignment = heap->intra_heap_alignment(); |
duke@435 | 487 | const bool maintain_minimum = |
duke@435 | 488 | (requested_eden_size + 2 * requested_survivor_size) <= min_gen_size(); |
duke@435 | 489 | |
jmasa@698 | 490 | bool eden_from_to_order = from_start < to_start; |
duke@435 | 491 | // Check whether from space is below to space |
jmasa@698 | 492 | if (eden_from_to_order) { |
duke@435 | 493 | // Eden, from, to |
jmasa@698 | 494 | eden_from_to_order = true; |
duke@435 | 495 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 496 | gclog_or_tty->print_cr(" Eden, from, to:"); |
duke@435 | 497 | } |
duke@435 | 498 | |
duke@435 | 499 | // Set eden |
duke@435 | 500 | // "requested_eden_size" is a goal for the size of eden |
duke@435 | 501 | // and may not be attainable. "eden_size" below is |
duke@435 | 502 | // calculated based on the location of from-space and |
duke@435 | 503 | // the goal for the size of eden. from-space is |
duke@435 | 504 | // fixed in place because it contains live data. |
duke@435 | 505 | // The calculation is done this way to avoid 32bit |
duke@435 | 506 | // overflow (i.e., eden_start + requested_eden_size |
duke@435 | 507 | // may too large for representation in 32bits). |
duke@435 | 508 | size_t eden_size; |
duke@435 | 509 | if (maintain_minimum) { |
duke@435 | 510 | // Only make eden larger than the requested size if |
duke@435 | 511 | // the minimum size of the generation has to be maintained. |
duke@435 | 512 | // This could be done in general but policy at a higher |
duke@435 | 513 | // level is determining a requested size for eden and that |
duke@435 | 514 | // should be honored unless there is a fundamental reason. |
duke@435 | 515 | eden_size = pointer_delta(from_start, |
duke@435 | 516 | eden_start, |
duke@435 | 517 | sizeof(char)); |
duke@435 | 518 | } else { |
duke@435 | 519 | eden_size = MIN2(requested_eden_size, |
duke@435 | 520 | pointer_delta(from_start, eden_start, sizeof(char))); |
duke@435 | 521 | } |
duke@435 | 522 | |
duke@435 | 523 | eden_end = eden_start + eden_size; |
duke@435 | 524 | assert(eden_end >= eden_start, "addition overflowed") |
duke@435 | 525 | |
duke@435 | 526 | // To may resize into from space as long as it is clear of live data. |
duke@435 | 527 | // From space must remain page aligned, though, so we need to do some |
duke@435 | 528 | // extra calculations. |
duke@435 | 529 | |
duke@435 | 530 | // First calculate an optimal to-space |
jmasa@698 | 531 | to_end = (char*)virtual_space()->high(); |
duke@435 | 532 | to_start = (char*)pointer_delta(to_end, (char*)requested_survivor_size, |
duke@435 | 533 | sizeof(char)); |
duke@435 | 534 | |
duke@435 | 535 | // Does the optimal to-space overlap from-space? |
duke@435 | 536 | if (to_start < (char*)from_space()->end()) { |
duke@435 | 537 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 538 | |
duke@435 | 539 | // Calculate the minimum offset possible for from_end |
duke@435 | 540 | size_t from_size = pointer_delta(from_space()->top(), from_start, sizeof(char)); |
duke@435 | 541 | |
duke@435 | 542 | // Should we be in this method if from_space is empty? Why not the set_space method? FIX ME! |
duke@435 | 543 | if (from_size == 0) { |
duke@435 | 544 | from_size = alignment; |
duke@435 | 545 | } else { |
duke@435 | 546 | from_size = align_size_up(from_size, alignment); |
duke@435 | 547 | } |
duke@435 | 548 | |
duke@435 | 549 | from_end = from_start + from_size; |
duke@435 | 550 | assert(from_end > from_start, "addition overflow or from_size problem"); |
duke@435 | 551 | |
duke@435 | 552 | guarantee(from_end <= (char*)from_space()->end(), "from_end moved to the right"); |
duke@435 | 553 | |
duke@435 | 554 | // Now update to_start with the new from_end |
duke@435 | 555 | to_start = MAX2(from_end, to_start); |
duke@435 | 556 | } |
duke@435 | 557 | |
duke@435 | 558 | guarantee(to_start != to_end, "to space is zero sized"); |
duke@435 | 559 | |
duke@435 | 560 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 561 | gclog_or_tty->print_cr(" [eden_start .. eden_end): " |
duke@435 | 562 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
duke@435 | 563 | eden_start, |
duke@435 | 564 | eden_end, |
duke@435 | 565 | pointer_delta(eden_end, eden_start, sizeof(char))); |
duke@435 | 566 | gclog_or_tty->print_cr(" [from_start .. from_end): " |
duke@435 | 567 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
duke@435 | 568 | from_start, |
duke@435 | 569 | from_end, |
duke@435 | 570 | pointer_delta(from_end, from_start, sizeof(char))); |
duke@435 | 571 | gclog_or_tty->print_cr(" [ to_start .. to_end): " |
duke@435 | 572 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
duke@435 | 573 | to_start, |
duke@435 | 574 | to_end, |
duke@435 | 575 | pointer_delta( to_end, to_start, sizeof(char))); |
duke@435 | 576 | } |
duke@435 | 577 | } else { |
duke@435 | 578 | // Eden, to, from |
duke@435 | 579 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 580 | gclog_or_tty->print_cr(" Eden, to, from:"); |
duke@435 | 581 | } |
duke@435 | 582 | |
duke@435 | 583 | // To space gets priority over eden resizing. Note that we position |
duke@435 | 584 | // to space as if we were able to resize from space, even though from |
duke@435 | 585 | // space is not modified. |
duke@435 | 586 | // Giving eden priority was tried and gave poorer performance. |
jmasa@698 | 587 | to_end = (char*)pointer_delta(virtual_space()->high(), |
duke@435 | 588 | (char*)requested_survivor_size, |
duke@435 | 589 | sizeof(char)); |
duke@435 | 590 | to_end = MIN2(to_end, from_start); |
duke@435 | 591 | to_start = (char*)pointer_delta(to_end, (char*)requested_survivor_size, |
duke@435 | 592 | sizeof(char)); |
duke@435 | 593 | // if the space sizes are to be increased by several times then |
duke@435 | 594 | // 'to_start' will point beyond the young generation. In this case |
duke@435 | 595 | // 'to_start' should be adjusted. |
duke@435 | 596 | to_start = MAX2(to_start, eden_start + alignment); |
duke@435 | 597 | |
duke@435 | 598 | // Compute how big eden can be, then adjust end. |
duke@435 | 599 | // See comments above on calculating eden_end. |
duke@435 | 600 | size_t eden_size; |
duke@435 | 601 | if (maintain_minimum) { |
duke@435 | 602 | eden_size = pointer_delta(to_start, eden_start, sizeof(char)); |
duke@435 | 603 | } else { |
duke@435 | 604 | eden_size = MIN2(requested_eden_size, |
duke@435 | 605 | pointer_delta(to_start, eden_start, sizeof(char))); |
duke@435 | 606 | } |
duke@435 | 607 | eden_end = eden_start + eden_size; |
duke@435 | 608 | assert(eden_end >= eden_start, "addition overflowed") |
duke@435 | 609 | |
duke@435 | 610 | // Could choose to not let eden shrink |
duke@435 | 611 | // to_start = MAX2(to_start, eden_end); |
duke@435 | 612 | |
duke@435 | 613 | // Don't let eden shrink down to 0 or less. |
duke@435 | 614 | eden_end = MAX2(eden_end, eden_start + alignment); |
duke@435 | 615 | to_start = MAX2(to_start, eden_end); |
duke@435 | 616 | |
duke@435 | 617 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 618 | gclog_or_tty->print_cr(" [eden_start .. eden_end): " |
duke@435 | 619 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
duke@435 | 620 | eden_start, |
duke@435 | 621 | eden_end, |
duke@435 | 622 | pointer_delta(eden_end, eden_start, sizeof(char))); |
duke@435 | 623 | gclog_or_tty->print_cr(" [ to_start .. to_end): " |
duke@435 | 624 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
duke@435 | 625 | to_start, |
duke@435 | 626 | to_end, |
duke@435 | 627 | pointer_delta( to_end, to_start, sizeof(char))); |
duke@435 | 628 | gclog_or_tty->print_cr(" [from_start .. from_end): " |
duke@435 | 629 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
duke@435 | 630 | from_start, |
duke@435 | 631 | from_end, |
duke@435 | 632 | pointer_delta(from_end, from_start, sizeof(char))); |
duke@435 | 633 | } |
duke@435 | 634 | } |
duke@435 | 635 | |
duke@435 | 636 | |
duke@435 | 637 | guarantee((HeapWord*)from_start <= from_space()->bottom(), |
duke@435 | 638 | "from start moved to the right"); |
duke@435 | 639 | guarantee((HeapWord*)from_end >= from_space()->top(), |
duke@435 | 640 | "from end moved into live data"); |
duke@435 | 641 | assert(is_object_aligned((intptr_t)eden_start), "checking alignment"); |
duke@435 | 642 | assert(is_object_aligned((intptr_t)from_start), "checking alignment"); |
duke@435 | 643 | assert(is_object_aligned((intptr_t)to_start), "checking alignment"); |
duke@435 | 644 | |
duke@435 | 645 | MemRegion edenMR((HeapWord*)eden_start, (HeapWord*)eden_end); |
duke@435 | 646 | MemRegion toMR ((HeapWord*)to_start, (HeapWord*)to_end); |
duke@435 | 647 | MemRegion fromMR((HeapWord*)from_start, (HeapWord*)from_end); |
duke@435 | 648 | |
duke@435 | 649 | // Let's make sure the call to initialize doesn't reset "top"! |
duke@435 | 650 | HeapWord* old_from_top = from_space()->top(); |
duke@435 | 651 | |
duke@435 | 652 | // For PrintAdaptiveSizePolicy block below |
duke@435 | 653 | size_t old_from = from_space()->capacity_in_bytes(); |
duke@435 | 654 | size_t old_to = to_space()->capacity_in_bytes(); |
duke@435 | 655 | |
jmasa@698 | 656 | if (ZapUnusedHeapArea) { |
jmasa@698 | 657 | // NUMA is a special case because a numa space is not mangled |
jmasa@698 | 658 | // in order to not prematurely bind its address to memory to |
jmasa@698 | 659 | // the wrong memory (i.e., don't want the GC thread to first |
jmasa@698 | 660 | // touch the memory). The survivor spaces are not numa |
jmasa@698 | 661 | // spaces and are mangled. |
jmasa@698 | 662 | if (UseNUMA) { |
jmasa@698 | 663 | if (eden_from_to_order) { |
jmasa@698 | 664 | mangle_survivors(from_space(), fromMR, to_space(), toMR); |
jmasa@698 | 665 | } else { |
jmasa@698 | 666 | mangle_survivors(to_space(), toMR, from_space(), fromMR); |
jmasa@698 | 667 | } |
jmasa@698 | 668 | } |
jmasa@698 | 669 | |
jmasa@698 | 670 | // If not mangling the spaces, do some checking to verify that |
jmasa@698 | 671 | // the spaces are already mangled. |
jmasa@698 | 672 | // The spaces should be correctly mangled at this point so |
jmasa@698 | 673 | // do some checking here. Note that they are not being mangled |
jmasa@698 | 674 | // in the calls to initialize(). |
jmasa@698 | 675 | // Must check mangling before the spaces are reshaped. Otherwise, |
jmasa@698 | 676 | // the bottom or end of one space may have moved into an area |
jmasa@698 | 677 | // covered by another space and a failure of the check may |
jmasa@698 | 678 | // not correctly indicate which space is not properly mangled. |
jmasa@698 | 679 | HeapWord* limit = (HeapWord*) virtual_space()->high(); |
jmasa@698 | 680 | eden_space()->check_mangled_unused_area(limit); |
jmasa@698 | 681 | from_space()->check_mangled_unused_area(limit); |
jmasa@698 | 682 | to_space()->check_mangled_unused_area(limit); |
jmasa@698 | 683 | } |
jmasa@698 | 684 | // When an existing space is being initialized, it is not |
jmasa@698 | 685 | // mangled because the space has been previously mangled. |
jmasa@698 | 686 | eden_space()->initialize(edenMR, |
jmasa@698 | 687 | SpaceDecorator::Clear, |
jmasa@698 | 688 | SpaceDecorator::DontMangle); |
jmasa@698 | 689 | to_space()->initialize(toMR, |
jmasa@698 | 690 | SpaceDecorator::Clear, |
jmasa@698 | 691 | SpaceDecorator::DontMangle); |
jmasa@698 | 692 | from_space()->initialize(fromMR, |
jmasa@698 | 693 | SpaceDecorator::DontClear, |
jmasa@698 | 694 | SpaceDecorator::DontMangle); |
duke@435 | 695 | |
duke@435 | 696 | assert(from_space()->top() == old_from_top, "from top changed!"); |
duke@435 | 697 | |
duke@435 | 698 | if (PrintAdaptiveSizePolicy) { |
duke@435 | 699 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
duke@435 | 700 | assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); |
duke@435 | 701 | |
duke@435 | 702 | gclog_or_tty->print("AdaptiveSizePolicy::survivor space sizes: " |
duke@435 | 703 | "collection: %d " |
duke@435 | 704 | "(" SIZE_FORMAT ", " SIZE_FORMAT ") -> " |
duke@435 | 705 | "(" SIZE_FORMAT ", " SIZE_FORMAT ") ", |
duke@435 | 706 | heap->total_collections(), |
duke@435 | 707 | old_from, old_to, |
duke@435 | 708 | from_space()->capacity_in_bytes(), |
duke@435 | 709 | to_space()->capacity_in_bytes()); |
duke@435 | 710 | gclog_or_tty->cr(); |
duke@435 | 711 | } |
duke@435 | 712 | } |
duke@435 | 713 | |
duke@435 | 714 | void PSYoungGen::swap_spaces() { |
duke@435 | 715 | MutableSpace* s = from_space(); |
duke@435 | 716 | _from_space = to_space(); |
duke@435 | 717 | _to_space = s; |
duke@435 | 718 | |
duke@435 | 719 | // Now update the decorators. |
duke@435 | 720 | PSMarkSweepDecorator* md = from_mark_sweep(); |
duke@435 | 721 | _from_mark_sweep = to_mark_sweep(); |
duke@435 | 722 | _to_mark_sweep = md; |
duke@435 | 723 | |
duke@435 | 724 | assert(from_mark_sweep()->space() == from_space(), "Sanity"); |
duke@435 | 725 | assert(to_mark_sweep()->space() == to_space(), "Sanity"); |
duke@435 | 726 | } |
duke@435 | 727 | |
duke@435 | 728 | size_t PSYoungGen::capacity_in_bytes() const { |
duke@435 | 729 | return eden_space()->capacity_in_bytes() |
duke@435 | 730 | + from_space()->capacity_in_bytes(); // to_space() is only used during scavenge |
duke@435 | 731 | } |
duke@435 | 732 | |
duke@435 | 733 | |
duke@435 | 734 | size_t PSYoungGen::used_in_bytes() const { |
duke@435 | 735 | return eden_space()->used_in_bytes() |
duke@435 | 736 | + from_space()->used_in_bytes(); // to_space() is only used during scavenge |
duke@435 | 737 | } |
duke@435 | 738 | |
duke@435 | 739 | |
duke@435 | 740 | size_t PSYoungGen::free_in_bytes() const { |
duke@435 | 741 | return eden_space()->free_in_bytes() |
duke@435 | 742 | + from_space()->free_in_bytes(); // to_space() is only used during scavenge |
duke@435 | 743 | } |
duke@435 | 744 | |
duke@435 | 745 | size_t PSYoungGen::capacity_in_words() const { |
duke@435 | 746 | return eden_space()->capacity_in_words() |
duke@435 | 747 | + from_space()->capacity_in_words(); // to_space() is only used during scavenge |
duke@435 | 748 | } |
duke@435 | 749 | |
duke@435 | 750 | |
duke@435 | 751 | size_t PSYoungGen::used_in_words() const { |
duke@435 | 752 | return eden_space()->used_in_words() |
duke@435 | 753 | + from_space()->used_in_words(); // to_space() is only used during scavenge |
duke@435 | 754 | } |
duke@435 | 755 | |
duke@435 | 756 | |
duke@435 | 757 | size_t PSYoungGen::free_in_words() const { |
duke@435 | 758 | return eden_space()->free_in_words() |
duke@435 | 759 | + from_space()->free_in_words(); // to_space() is only used during scavenge |
duke@435 | 760 | } |
duke@435 | 761 | |
duke@435 | 762 | void PSYoungGen::object_iterate(ObjectClosure* blk) { |
duke@435 | 763 | eden_space()->object_iterate(blk); |
duke@435 | 764 | from_space()->object_iterate(blk); |
duke@435 | 765 | to_space()->object_iterate(blk); |
duke@435 | 766 | } |
duke@435 | 767 | |
duke@435 | 768 | void PSYoungGen::precompact() { |
duke@435 | 769 | eden_mark_sweep()->precompact(); |
duke@435 | 770 | from_mark_sweep()->precompact(); |
duke@435 | 771 | to_mark_sweep()->precompact(); |
duke@435 | 772 | } |
duke@435 | 773 | |
duke@435 | 774 | void PSYoungGen::adjust_pointers() { |
duke@435 | 775 | eden_mark_sweep()->adjust_pointers(); |
duke@435 | 776 | from_mark_sweep()->adjust_pointers(); |
duke@435 | 777 | to_mark_sweep()->adjust_pointers(); |
duke@435 | 778 | } |
duke@435 | 779 | |
duke@435 | 780 | void PSYoungGen::compact() { |
duke@435 | 781 | eden_mark_sweep()->compact(ZapUnusedHeapArea); |
duke@435 | 782 | from_mark_sweep()->compact(ZapUnusedHeapArea); |
duke@435 | 783 | // Mark sweep stores preserved markOops in to space, don't disturb! |
duke@435 | 784 | to_mark_sweep()->compact(false); |
duke@435 | 785 | } |
duke@435 | 786 | |
duke@435 | 787 | void PSYoungGen::move_and_update(ParCompactionManager* cm) { |
duke@435 | 788 | PSParallelCompact::move_and_update(cm, PSParallelCompact::eden_space_id); |
duke@435 | 789 | PSParallelCompact::move_and_update(cm, PSParallelCompact::from_space_id); |
duke@435 | 790 | PSParallelCompact::move_and_update(cm, PSParallelCompact::to_space_id); |
duke@435 | 791 | } |
duke@435 | 792 | |
duke@435 | 793 | void PSYoungGen::print() const { print_on(tty); } |
duke@435 | 794 | void PSYoungGen::print_on(outputStream* st) const { |
duke@435 | 795 | st->print(" %-15s", "PSYoungGen"); |
duke@435 | 796 | if (PrintGCDetails && Verbose) { |
duke@435 | 797 | st->print(" total " SIZE_FORMAT ", used " SIZE_FORMAT, |
duke@435 | 798 | capacity_in_bytes(), used_in_bytes()); |
duke@435 | 799 | } else { |
duke@435 | 800 | st->print(" total " SIZE_FORMAT "K, used " SIZE_FORMAT "K", |
duke@435 | 801 | capacity_in_bytes()/K, used_in_bytes()/K); |
duke@435 | 802 | } |
jmasa@698 | 803 | virtual_space()->print_space_boundaries_on(st); |
duke@435 | 804 | st->print(" eden"); eden_space()->print_on(st); |
duke@435 | 805 | st->print(" from"); from_space()->print_on(st); |
duke@435 | 806 | st->print(" to "); to_space()->print_on(st); |
duke@435 | 807 | } |
duke@435 | 808 | |
duke@435 | 809 | void PSYoungGen::print_used_change(size_t prev_used) const { |
duke@435 | 810 | gclog_or_tty->print(" [%s:", name()); |
duke@435 | 811 | gclog_or_tty->print(" " SIZE_FORMAT "K" |
duke@435 | 812 | "->" SIZE_FORMAT "K" |
duke@435 | 813 | "(" SIZE_FORMAT "K)", |
duke@435 | 814 | prev_used / K, used_in_bytes() / K, |
duke@435 | 815 | capacity_in_bytes() / K); |
duke@435 | 816 | gclog_or_tty->print("]"); |
duke@435 | 817 | } |
duke@435 | 818 | |
duke@435 | 819 | size_t PSYoungGen::available_for_expansion() { |
duke@435 | 820 | ShouldNotReachHere(); |
duke@435 | 821 | return 0; |
duke@435 | 822 | } |
duke@435 | 823 | |
duke@435 | 824 | size_t PSYoungGen::available_for_contraction() { |
duke@435 | 825 | ShouldNotReachHere(); |
duke@435 | 826 | return 0; |
duke@435 | 827 | } |
duke@435 | 828 | |
duke@435 | 829 | size_t PSYoungGen::available_to_min_gen() { |
duke@435 | 830 | assert(virtual_space()->committed_size() >= min_gen_size(), "Invariant"); |
duke@435 | 831 | return virtual_space()->committed_size() - min_gen_size(); |
duke@435 | 832 | } |
duke@435 | 833 | |
duke@435 | 834 | // This method assumes that from-space has live data and that |
duke@435 | 835 | // any shrinkage of the young gen is limited by location of |
duke@435 | 836 | // from-space. |
duke@435 | 837 | size_t PSYoungGen::available_to_live() { |
duke@435 | 838 | size_t delta_in_survivor = 0; |
duke@435 | 839 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
jmasa@448 | 840 | const size_t space_alignment = heap->intra_heap_alignment(); |
duke@435 | 841 | const size_t gen_alignment = heap->young_gen_alignment(); |
duke@435 | 842 | |
duke@435 | 843 | MutableSpace* space_shrinking = NULL; |
duke@435 | 844 | if (from_space()->end() > to_space()->end()) { |
duke@435 | 845 | space_shrinking = from_space(); |
duke@435 | 846 | } else { |
duke@435 | 847 | space_shrinking = to_space(); |
duke@435 | 848 | } |
duke@435 | 849 | |
duke@435 | 850 | // Include any space that is committed but not included in |
duke@435 | 851 | // the survivor spaces. |
duke@435 | 852 | assert(((HeapWord*)virtual_space()->high()) >= space_shrinking->end(), |
duke@435 | 853 | "Survivor space beyond high end"); |
duke@435 | 854 | size_t unused_committed = pointer_delta(virtual_space()->high(), |
duke@435 | 855 | space_shrinking->end(), sizeof(char)); |
duke@435 | 856 | |
duke@435 | 857 | if (space_shrinking->is_empty()) { |
duke@435 | 858 | // Don't let the space shrink to 0 |
duke@435 | 859 | assert(space_shrinking->capacity_in_bytes() >= space_alignment, |
duke@435 | 860 | "Space is too small"); |
duke@435 | 861 | delta_in_survivor = space_shrinking->capacity_in_bytes() - space_alignment; |
duke@435 | 862 | } else { |
duke@435 | 863 | delta_in_survivor = pointer_delta(space_shrinking->end(), |
duke@435 | 864 | space_shrinking->top(), |
duke@435 | 865 | sizeof(char)); |
duke@435 | 866 | } |
duke@435 | 867 | |
duke@435 | 868 | size_t delta_in_bytes = unused_committed + delta_in_survivor; |
duke@435 | 869 | delta_in_bytes = align_size_down(delta_in_bytes, gen_alignment); |
duke@435 | 870 | return delta_in_bytes; |
duke@435 | 871 | } |
duke@435 | 872 | |
duke@435 | 873 | // Return the number of bytes available for resizing down the young |
duke@435 | 874 | // generation. This is the minimum of |
duke@435 | 875 | // input "bytes" |
duke@435 | 876 | // bytes to the minimum young gen size |
duke@435 | 877 | // bytes to the size currently being used + some small extra |
duke@435 | 878 | size_t PSYoungGen::limit_gen_shrink(size_t bytes) { |
duke@435 | 879 | // Allow shrinkage into the current eden but keep eden large enough |
duke@435 | 880 | // to maintain the minimum young gen size |
duke@435 | 881 | bytes = MIN3(bytes, available_to_min_gen(), available_to_live()); |
duke@435 | 882 | return align_size_down(bytes, virtual_space()->alignment()); |
duke@435 | 883 | } |
duke@435 | 884 | |
duke@435 | 885 | void PSYoungGen::reset_after_change() { |
duke@435 | 886 | ShouldNotReachHere(); |
duke@435 | 887 | } |
duke@435 | 888 | |
duke@435 | 889 | void PSYoungGen::reset_survivors_after_shrink() { |
duke@435 | 890 | _reserved = MemRegion((HeapWord*)virtual_space()->low_boundary(), |
duke@435 | 891 | (HeapWord*)virtual_space()->high_boundary()); |
duke@435 | 892 | PSScavenge::reference_processor()->set_span(_reserved); |
duke@435 | 893 | |
duke@435 | 894 | MutableSpace* space_shrinking = NULL; |
duke@435 | 895 | if (from_space()->end() > to_space()->end()) { |
duke@435 | 896 | space_shrinking = from_space(); |
duke@435 | 897 | } else { |
duke@435 | 898 | space_shrinking = to_space(); |
duke@435 | 899 | } |
duke@435 | 900 | |
duke@435 | 901 | HeapWord* new_end = (HeapWord*)virtual_space()->high(); |
duke@435 | 902 | assert(new_end >= space_shrinking->bottom(), "Shrink was too large"); |
duke@435 | 903 | // Was there a shrink of the survivor space? |
duke@435 | 904 | if (new_end < space_shrinking->end()) { |
duke@435 | 905 | MemRegion mr(space_shrinking->bottom(), new_end); |
jmasa@698 | 906 | space_shrinking->initialize(mr, |
jmasa@698 | 907 | SpaceDecorator::DontClear, |
jmasa@698 | 908 | SpaceDecorator::Mangle); |
duke@435 | 909 | } |
duke@435 | 910 | } |
duke@435 | 911 | |
duke@435 | 912 | // This method currently does not expect to expand into eden (i.e., |
duke@435 | 913 | // the virtual space boundaries is expected to be consistent |
duke@435 | 914 | // with the eden boundaries.. |
duke@435 | 915 | void PSYoungGen::post_resize() { |
duke@435 | 916 | assert_locked_or_safepoint(Heap_lock); |
duke@435 | 917 | assert((eden_space()->bottom() < to_space()->bottom()) && |
duke@435 | 918 | (eden_space()->bottom() < from_space()->bottom()), |
duke@435 | 919 | "Eden is assumed to be below the survivor spaces"); |
duke@435 | 920 | |
duke@435 | 921 | MemRegion cmr((HeapWord*)virtual_space()->low(), |
duke@435 | 922 | (HeapWord*)virtual_space()->high()); |
duke@435 | 923 | Universe::heap()->barrier_set()->resize_covered_region(cmr); |
duke@435 | 924 | space_invariants(); |
duke@435 | 925 | } |
duke@435 | 926 | |
duke@435 | 927 | |
duke@435 | 928 | |
duke@435 | 929 | void PSYoungGen::update_counters() { |
duke@435 | 930 | if (UsePerfData) { |
duke@435 | 931 | _eden_counters->update_all(); |
duke@435 | 932 | _from_counters->update_all(); |
duke@435 | 933 | _to_counters->update_all(); |
duke@435 | 934 | _gen_counters->update_all(); |
duke@435 | 935 | } |
duke@435 | 936 | } |
duke@435 | 937 | |
duke@435 | 938 | void PSYoungGen::verify(bool allow_dirty) { |
duke@435 | 939 | eden_space()->verify(allow_dirty); |
duke@435 | 940 | from_space()->verify(allow_dirty); |
duke@435 | 941 | to_space()->verify(allow_dirty); |
duke@435 | 942 | } |
jmasa@698 | 943 | |
jmasa@698 | 944 | #ifndef PRODUCT |
jmasa@698 | 945 | void PSYoungGen::record_spaces_top() { |
jmasa@698 | 946 | assert(ZapUnusedHeapArea, "Not mangling unused space"); |
jmasa@698 | 947 | eden_space()->set_top_for_allocations(); |
jmasa@698 | 948 | from_space()->set_top_for_allocations(); |
jmasa@698 | 949 | to_space()->set_top_for_allocations(); |
jmasa@698 | 950 | } |
jmasa@698 | 951 | #endif |