Tue, 14 Jan 2014 16:40:33 +0100
8032379: Remove the is_scavenging flag to process_strong_roots
Summary: Refactor the strong root processing to avoid using a boolean in addition to the ScanOption enum.
Reviewed-by: stefank, tschatzl, ehelin, jmasa
duke@435 | 1 | /* |
drchase@6680 | 2 | * Copyright (c) 2005, 2014, Oracle and/or its affiliates. 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 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp" |
stefank@2314 | 27 | #include "gc_implementation/concurrentMarkSweep/cmsGCAdaptivePolicyCounters.hpp" |
stefank@2314 | 28 | #include "gc_implementation/parNew/asParNewGeneration.hpp" |
stefank@2314 | 29 | #include "gc_implementation/parNew/parNewGeneration.hpp" |
stefank@2314 | 30 | #include "gc_implementation/shared/markSweep.inline.hpp" |
stefank@2314 | 31 | #include "gc_implementation/shared/spaceDecorator.hpp" |
stefank@2314 | 32 | #include "memory/defNewGeneration.inline.hpp" |
stefank@2314 | 33 | #include "memory/referencePolicy.hpp" |
stefank@2314 | 34 | #include "oops/markOop.inline.hpp" |
stefank@2314 | 35 | #include "oops/oop.pcgc.inline.hpp" |
duke@435 | 36 | |
duke@435 | 37 | ASParNewGeneration::ASParNewGeneration(ReservedSpace rs, |
duke@435 | 38 | size_t initial_byte_size, |
duke@435 | 39 | size_t min_byte_size, |
duke@435 | 40 | int level) : |
duke@435 | 41 | ParNewGeneration(rs, initial_byte_size, level), |
duke@435 | 42 | _min_gen_size(min_byte_size) {} |
duke@435 | 43 | |
duke@435 | 44 | const char* ASParNewGeneration::name() const { |
duke@435 | 45 | return "adaptive size par new generation"; |
duke@435 | 46 | } |
duke@435 | 47 | |
duke@435 | 48 | void ASParNewGeneration::adjust_desired_tenuring_threshold() { |
duke@435 | 49 | assert(UseAdaptiveSizePolicy, |
duke@435 | 50 | "Should only be used with UseAdaptiveSizePolicy"); |
duke@435 | 51 | } |
duke@435 | 52 | |
duke@435 | 53 | void ASParNewGeneration::resize(size_t eden_size, size_t survivor_size) { |
duke@435 | 54 | // Resize the generation if needed. If the generation resize |
duke@435 | 55 | // reports false, do not attempt to resize the spaces. |
duke@435 | 56 | if (resize_generation(eden_size, survivor_size)) { |
duke@435 | 57 | // Then we lay out the spaces inside the generation |
duke@435 | 58 | resize_spaces(eden_size, survivor_size); |
duke@435 | 59 | |
duke@435 | 60 | space_invariants(); |
duke@435 | 61 | |
duke@435 | 62 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 63 | gclog_or_tty->print_cr("Young generation size: " |
duke@435 | 64 | "desired eden: " SIZE_FORMAT " survivor: " SIZE_FORMAT |
duke@435 | 65 | " used: " SIZE_FORMAT " capacity: " SIZE_FORMAT |
duke@435 | 66 | " gen limits: " SIZE_FORMAT " / " SIZE_FORMAT, |
duke@435 | 67 | eden_size, survivor_size, used(), capacity(), |
duke@435 | 68 | max_gen_size(), min_gen_size()); |
duke@435 | 69 | } |
duke@435 | 70 | } |
duke@435 | 71 | } |
duke@435 | 72 | |
duke@435 | 73 | size_t ASParNewGeneration::available_to_min_gen() { |
duke@435 | 74 | assert(virtual_space()->committed_size() >= min_gen_size(), "Invariant"); |
duke@435 | 75 | return virtual_space()->committed_size() - min_gen_size(); |
duke@435 | 76 | } |
duke@435 | 77 | |
duke@435 | 78 | // This method assumes that from-space has live data and that |
duke@435 | 79 | // any shrinkage of the young gen is limited by location of |
duke@435 | 80 | // from-space. |
duke@435 | 81 | size_t ASParNewGeneration::available_to_live() const { |
duke@435 | 82 | #undef SHRINKS_AT_END_OF_EDEN |
duke@435 | 83 | #ifdef SHRINKS_AT_END_OF_EDEN |
duke@435 | 84 | size_t delta_in_survivor = 0; |
duke@435 | 85 | ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); |
jmasa@448 | 86 | const size_t space_alignment = heap->intra_heap_alignment(); |
jmasa@448 | 87 | const size_t gen_alignment = heap->object_heap_alignment(); |
duke@435 | 88 | |
duke@435 | 89 | MutableSpace* space_shrinking = NULL; |
duke@435 | 90 | if (from_space()->end() > to_space()->end()) { |
duke@435 | 91 | space_shrinking = from_space(); |
duke@435 | 92 | } else { |
duke@435 | 93 | space_shrinking = to_space(); |
duke@435 | 94 | } |
duke@435 | 95 | |
duke@435 | 96 | // Include any space that is committed but not included in |
duke@435 | 97 | // the survivor spaces. |
duke@435 | 98 | assert(((HeapWord*)virtual_space()->high()) >= space_shrinking->end(), |
duke@435 | 99 | "Survivor space beyond high end"); |
duke@435 | 100 | size_t unused_committed = pointer_delta(virtual_space()->high(), |
duke@435 | 101 | space_shrinking->end(), sizeof(char)); |
duke@435 | 102 | |
duke@435 | 103 | if (space_shrinking->is_empty()) { |
duke@435 | 104 | // Don't let the space shrink to 0 |
duke@435 | 105 | assert(space_shrinking->capacity_in_bytes() >= space_alignment, |
duke@435 | 106 | "Space is too small"); |
duke@435 | 107 | delta_in_survivor = space_shrinking->capacity_in_bytes() - space_alignment; |
duke@435 | 108 | } else { |
duke@435 | 109 | delta_in_survivor = pointer_delta(space_shrinking->end(), |
duke@435 | 110 | space_shrinking->top(), |
duke@435 | 111 | sizeof(char)); |
duke@435 | 112 | } |
duke@435 | 113 | |
duke@435 | 114 | size_t delta_in_bytes = unused_committed + delta_in_survivor; |
duke@435 | 115 | delta_in_bytes = align_size_down(delta_in_bytes, gen_alignment); |
duke@435 | 116 | return delta_in_bytes; |
duke@435 | 117 | #else |
duke@435 | 118 | // The only space available for shrinking is in to-space if it |
duke@435 | 119 | // is above from-space. |
duke@435 | 120 | if (to()->bottom() > from()->bottom()) { |
duke@435 | 121 | const size_t alignment = os::vm_page_size(); |
duke@435 | 122 | if (to()->capacity() < alignment) { |
duke@435 | 123 | return 0; |
duke@435 | 124 | } else { |
duke@435 | 125 | return to()->capacity() - alignment; |
duke@435 | 126 | } |
duke@435 | 127 | } else { |
duke@435 | 128 | return 0; |
duke@435 | 129 | } |
duke@435 | 130 | #endif |
duke@435 | 131 | } |
duke@435 | 132 | |
duke@435 | 133 | // Return the number of bytes available for resizing down the young |
duke@435 | 134 | // generation. This is the minimum of |
duke@435 | 135 | // input "bytes" |
duke@435 | 136 | // bytes to the minimum young gen size |
duke@435 | 137 | // bytes to the size currently being used + some small extra |
duke@435 | 138 | size_t ASParNewGeneration::limit_gen_shrink (size_t bytes) { |
duke@435 | 139 | // Allow shrinkage into the current eden but keep eden large enough |
duke@435 | 140 | // to maintain the minimum young gen size |
duke@435 | 141 | bytes = MIN3(bytes, available_to_min_gen(), available_to_live()); |
duke@435 | 142 | return align_size_down(bytes, os::vm_page_size()); |
duke@435 | 143 | } |
duke@435 | 144 | |
duke@435 | 145 | // Note that the the alignment used is the OS page size as |
duke@435 | 146 | // opposed to an alignment associated with the virtual space |
duke@435 | 147 | // (as is done in the ASPSYoungGen/ASPSOldGen) |
duke@435 | 148 | bool ASParNewGeneration::resize_generation(size_t eden_size, |
duke@435 | 149 | size_t survivor_size) { |
duke@435 | 150 | const size_t alignment = os::vm_page_size(); |
duke@435 | 151 | size_t orig_size = virtual_space()->committed_size(); |
duke@435 | 152 | bool size_changed = false; |
duke@435 | 153 | |
duke@435 | 154 | // There used to be this guarantee there. |
duke@435 | 155 | // guarantee ((eden_size + 2*survivor_size) <= _max_gen_size, "incorrect input arguments"); |
duke@435 | 156 | // Code below forces this requirement. In addition the desired eden |
duke@435 | 157 | // size and disired survivor sizes are desired goals and may |
duke@435 | 158 | // exceed the total generation size. |
duke@435 | 159 | |
duke@435 | 160 | assert(min_gen_size() <= orig_size && orig_size <= max_gen_size(), |
duke@435 | 161 | "just checking"); |
duke@435 | 162 | |
duke@435 | 163 | // Adjust new generation size |
duke@435 | 164 | const size_t eden_plus_survivors = |
duke@435 | 165 | align_size_up(eden_size + 2 * survivor_size, alignment); |
duke@435 | 166 | size_t desired_size = MAX2(MIN2(eden_plus_survivors, max_gen_size()), |
duke@435 | 167 | min_gen_size()); |
duke@435 | 168 | assert(desired_size <= max_gen_size(), "just checking"); |
duke@435 | 169 | |
duke@435 | 170 | if (desired_size > orig_size) { |
duke@435 | 171 | // Grow the generation |
duke@435 | 172 | size_t change = desired_size - orig_size; |
duke@435 | 173 | assert(change % alignment == 0, "just checking"); |
jmasa@698 | 174 | if (expand(change)) { |
duke@435 | 175 | return false; // Error if we fail to resize! |
duke@435 | 176 | } |
duke@435 | 177 | size_changed = true; |
duke@435 | 178 | } else if (desired_size < orig_size) { |
duke@435 | 179 | size_t desired_change = orig_size - desired_size; |
duke@435 | 180 | assert(desired_change % alignment == 0, "just checking"); |
duke@435 | 181 | |
duke@435 | 182 | desired_change = limit_gen_shrink(desired_change); |
duke@435 | 183 | |
duke@435 | 184 | if (desired_change > 0) { |
duke@435 | 185 | virtual_space()->shrink_by(desired_change); |
duke@435 | 186 | reset_survivors_after_shrink(); |
duke@435 | 187 | |
duke@435 | 188 | size_changed = true; |
duke@435 | 189 | } |
duke@435 | 190 | } else { |
duke@435 | 191 | if (Verbose && PrintGC) { |
duke@435 | 192 | if (orig_size == max_gen_size()) { |
duke@435 | 193 | gclog_or_tty->print_cr("ASParNew generation size at maximum: " |
duke@435 | 194 | SIZE_FORMAT "K", orig_size/K); |
duke@435 | 195 | } else if (orig_size == min_gen_size()) { |
duke@435 | 196 | gclog_or_tty->print_cr("ASParNew generation size at minium: " |
duke@435 | 197 | SIZE_FORMAT "K", orig_size/K); |
duke@435 | 198 | } |
duke@435 | 199 | } |
duke@435 | 200 | } |
duke@435 | 201 | |
duke@435 | 202 | if (size_changed) { |
duke@435 | 203 | MemRegion cmr((HeapWord*)virtual_space()->low(), |
duke@435 | 204 | (HeapWord*)virtual_space()->high()); |
duke@435 | 205 | GenCollectedHeap::heap()->barrier_set()->resize_covered_region(cmr); |
duke@435 | 206 | |
duke@435 | 207 | if (Verbose && PrintGC) { |
duke@435 | 208 | size_t current_size = virtual_space()->committed_size(); |
duke@435 | 209 | gclog_or_tty->print_cr("ASParNew generation size changed: " |
duke@435 | 210 | SIZE_FORMAT "K->" SIZE_FORMAT "K", |
duke@435 | 211 | orig_size/K, current_size/K); |
duke@435 | 212 | } |
duke@435 | 213 | } |
duke@435 | 214 | |
duke@435 | 215 | guarantee(eden_plus_survivors <= virtual_space()->committed_size() || |
duke@435 | 216 | virtual_space()->committed_size() == max_gen_size(), "Sanity"); |
duke@435 | 217 | |
duke@435 | 218 | return true; |
duke@435 | 219 | } |
duke@435 | 220 | |
duke@435 | 221 | void ASParNewGeneration::reset_survivors_after_shrink() { |
duke@435 | 222 | |
duke@435 | 223 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 224 | HeapWord* new_end = (HeapWord*)virtual_space()->high(); |
duke@435 | 225 | |
duke@435 | 226 | if (from()->end() > to()->end()) { |
duke@435 | 227 | assert(new_end >= from()->end(), "Shrinking past from-space"); |
duke@435 | 228 | } else { |
duke@435 | 229 | assert(new_end >= to()->bottom(), "Shrink was too large"); |
duke@435 | 230 | // Was there a shrink of the survivor space? |
duke@435 | 231 | if (new_end < to()->end()) { |
duke@435 | 232 | MemRegion mr(to()->bottom(), new_end); |
jmasa@698 | 233 | to()->initialize(mr, |
jmasa@698 | 234 | SpaceDecorator::DontClear, |
jmasa@698 | 235 | SpaceDecorator::DontMangle); |
duke@435 | 236 | } |
duke@435 | 237 | } |
duke@435 | 238 | } |
duke@435 | 239 | void ASParNewGeneration::resize_spaces(size_t requested_eden_size, |
duke@435 | 240 | size_t requested_survivor_size) { |
duke@435 | 241 | assert(UseAdaptiveSizePolicy, "sanity check"); |
duke@435 | 242 | assert(requested_eden_size > 0 && requested_survivor_size > 0, |
duke@435 | 243 | "just checking"); |
duke@435 | 244 | CollectedHeap* heap = Universe::heap(); |
duke@435 | 245 | assert(heap->kind() == CollectedHeap::GenCollectedHeap, "Sanity"); |
duke@435 | 246 | |
duke@435 | 247 | |
duke@435 | 248 | // We require eden and to space to be empty |
duke@435 | 249 | if ((!eden()->is_empty()) || (!to()->is_empty())) { |
duke@435 | 250 | return; |
duke@435 | 251 | } |
duke@435 | 252 | |
duke@435 | 253 | size_t cur_eden_size = eden()->capacity(); |
duke@435 | 254 | |
duke@435 | 255 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 256 | gclog_or_tty->print_cr("ASParNew::resize_spaces(requested_eden_size: " |
duke@435 | 257 | SIZE_FORMAT |
duke@435 | 258 | ", requested_survivor_size: " SIZE_FORMAT ")", |
duke@435 | 259 | requested_eden_size, requested_survivor_size); |
duke@435 | 260 | gclog_or_tty->print_cr(" eden: [" PTR_FORMAT ".." PTR_FORMAT ") " |
duke@435 | 261 | SIZE_FORMAT, |
drchase@6680 | 262 | p2i(eden()->bottom()), |
drchase@6680 | 263 | p2i(eden()->end()), |
duke@435 | 264 | pointer_delta(eden()->end(), |
duke@435 | 265 | eden()->bottom(), |
duke@435 | 266 | sizeof(char))); |
duke@435 | 267 | gclog_or_tty->print_cr(" from: [" PTR_FORMAT ".." PTR_FORMAT ") " |
duke@435 | 268 | SIZE_FORMAT, |
drchase@6680 | 269 | p2i(from()->bottom()), |
drchase@6680 | 270 | p2i(from()->end()), |
duke@435 | 271 | pointer_delta(from()->end(), |
duke@435 | 272 | from()->bottom(), |
duke@435 | 273 | sizeof(char))); |
duke@435 | 274 | gclog_or_tty->print_cr(" to: [" PTR_FORMAT ".." PTR_FORMAT ") " |
duke@435 | 275 | SIZE_FORMAT, |
drchase@6680 | 276 | p2i(to()->bottom()), |
drchase@6680 | 277 | p2i(to()->end()), |
duke@435 | 278 | pointer_delta( to()->end(), |
duke@435 | 279 | to()->bottom(), |
duke@435 | 280 | sizeof(char))); |
duke@435 | 281 | } |
duke@435 | 282 | |
duke@435 | 283 | // There's nothing to do if the new sizes are the same as the current |
duke@435 | 284 | if (requested_survivor_size == to()->capacity() && |
duke@435 | 285 | requested_survivor_size == from()->capacity() && |
duke@435 | 286 | requested_eden_size == eden()->capacity()) { |
duke@435 | 287 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 288 | gclog_or_tty->print_cr(" capacities are the right sizes, returning"); |
duke@435 | 289 | } |
duke@435 | 290 | return; |
duke@435 | 291 | } |
duke@435 | 292 | |
duke@435 | 293 | char* eden_start = (char*)eden()->bottom(); |
duke@435 | 294 | char* eden_end = (char*)eden()->end(); |
duke@435 | 295 | char* from_start = (char*)from()->bottom(); |
duke@435 | 296 | char* from_end = (char*)from()->end(); |
duke@435 | 297 | char* to_start = (char*)to()->bottom(); |
duke@435 | 298 | char* to_end = (char*)to()->end(); |
duke@435 | 299 | |
duke@435 | 300 | const size_t alignment = os::vm_page_size(); |
duke@435 | 301 | const bool maintain_minimum = |
duke@435 | 302 | (requested_eden_size + 2 * requested_survivor_size) <= min_gen_size(); |
duke@435 | 303 | |
duke@435 | 304 | // Check whether from space is below to space |
duke@435 | 305 | if (from_start < to_start) { |
duke@435 | 306 | // Eden, from, to |
duke@435 | 307 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 308 | gclog_or_tty->print_cr(" Eden, from, to:"); |
duke@435 | 309 | } |
duke@435 | 310 | |
duke@435 | 311 | // Set eden |
duke@435 | 312 | // "requested_eden_size" is a goal for the size of eden |
duke@435 | 313 | // and may not be attainable. "eden_size" below is |
duke@435 | 314 | // calculated based on the location of from-space and |
duke@435 | 315 | // the goal for the size of eden. from-space is |
duke@435 | 316 | // fixed in place because it contains live data. |
duke@435 | 317 | // The calculation is done this way to avoid 32bit |
duke@435 | 318 | // overflow (i.e., eden_start + requested_eden_size |
duke@435 | 319 | // may too large for representation in 32bits). |
duke@435 | 320 | size_t eden_size; |
duke@435 | 321 | if (maintain_minimum) { |
duke@435 | 322 | // Only make eden larger than the requested size if |
duke@435 | 323 | // the minimum size of the generation has to be maintained. |
duke@435 | 324 | // This could be done in general but policy at a higher |
duke@435 | 325 | // level is determining a requested size for eden and that |
duke@435 | 326 | // should be honored unless there is a fundamental reason. |
duke@435 | 327 | eden_size = pointer_delta(from_start, |
duke@435 | 328 | eden_start, |
duke@435 | 329 | sizeof(char)); |
duke@435 | 330 | } else { |
duke@435 | 331 | eden_size = MIN2(requested_eden_size, |
duke@435 | 332 | pointer_delta(from_start, eden_start, sizeof(char))); |
duke@435 | 333 | } |
duke@435 | 334 | |
duke@435 | 335 | eden_size = align_size_down(eden_size, alignment); |
duke@435 | 336 | eden_end = eden_start + eden_size; |
jcoomes@1844 | 337 | assert(eden_end >= eden_start, "addition overflowed"); |
duke@435 | 338 | |
duke@435 | 339 | // To may resize into from space as long as it is clear of live data. |
duke@435 | 340 | // From space must remain page aligned, though, so we need to do some |
duke@435 | 341 | // extra calculations. |
duke@435 | 342 | |
duke@435 | 343 | // First calculate an optimal to-space |
duke@435 | 344 | to_end = (char*)virtual_space()->high(); |
duke@435 | 345 | to_start = (char*)pointer_delta(to_end, (char*)requested_survivor_size, |
duke@435 | 346 | sizeof(char)); |
duke@435 | 347 | |
duke@435 | 348 | // Does the optimal to-space overlap from-space? |
duke@435 | 349 | if (to_start < (char*)from()->end()) { |
duke@435 | 350 | // Calculate the minimum offset possible for from_end |
duke@435 | 351 | size_t from_size = pointer_delta(from()->top(), from_start, sizeof(char)); |
duke@435 | 352 | |
duke@435 | 353 | // Should we be in this method if from_space is empty? Why not the set_space method? FIX ME! |
duke@435 | 354 | if (from_size == 0) { |
duke@435 | 355 | from_size = alignment; |
duke@435 | 356 | } else { |
duke@435 | 357 | from_size = align_size_up(from_size, alignment); |
duke@435 | 358 | } |
duke@435 | 359 | |
duke@435 | 360 | from_end = from_start + from_size; |
duke@435 | 361 | assert(from_end > from_start, "addition overflow or from_size problem"); |
duke@435 | 362 | |
duke@435 | 363 | guarantee(from_end <= (char*)from()->end(), "from_end moved to the right"); |
duke@435 | 364 | |
duke@435 | 365 | // Now update to_start with the new from_end |
duke@435 | 366 | to_start = MAX2(from_end, to_start); |
duke@435 | 367 | } else { |
duke@435 | 368 | // If shrinking, move to-space down to abut the end of from-space |
duke@435 | 369 | // so that shrinking will move to-space down. If not shrinking |
duke@435 | 370 | // to-space is moving up to allow for growth on the next expansion. |
duke@435 | 371 | if (requested_eden_size <= cur_eden_size) { |
duke@435 | 372 | to_start = from_end; |
duke@435 | 373 | if (to_start + requested_survivor_size > to_start) { |
duke@435 | 374 | to_end = to_start + requested_survivor_size; |
duke@435 | 375 | } |
duke@435 | 376 | } |
duke@435 | 377 | // else leave to_end pointing to the high end of the virtual space. |
duke@435 | 378 | } |
duke@435 | 379 | |
duke@435 | 380 | guarantee(to_start != to_end, "to space is zero sized"); |
duke@435 | 381 | |
duke@435 | 382 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 383 | gclog_or_tty->print_cr(" [eden_start .. eden_end): " |
duke@435 | 384 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
drchase@6680 | 385 | p2i(eden_start), |
drchase@6680 | 386 | p2i(eden_end), |
duke@435 | 387 | pointer_delta(eden_end, eden_start, sizeof(char))); |
duke@435 | 388 | gclog_or_tty->print_cr(" [from_start .. from_end): " |
duke@435 | 389 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
drchase@6680 | 390 | p2i(from_start), |
drchase@6680 | 391 | p2i(from_end), |
duke@435 | 392 | pointer_delta(from_end, from_start, sizeof(char))); |
duke@435 | 393 | gclog_or_tty->print_cr(" [ to_start .. to_end): " |
duke@435 | 394 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
drchase@6680 | 395 | p2i(to_start), |
drchase@6680 | 396 | p2i(to_end), |
duke@435 | 397 | pointer_delta( to_end, to_start, sizeof(char))); |
duke@435 | 398 | } |
duke@435 | 399 | } else { |
duke@435 | 400 | // Eden, to, from |
duke@435 | 401 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 402 | gclog_or_tty->print_cr(" Eden, to, from:"); |
duke@435 | 403 | } |
duke@435 | 404 | |
duke@435 | 405 | // Calculate the to-space boundaries based on |
duke@435 | 406 | // the start of from-space. |
duke@435 | 407 | to_end = from_start; |
duke@435 | 408 | to_start = (char*)pointer_delta(from_start, |
duke@435 | 409 | (char*)requested_survivor_size, |
duke@435 | 410 | sizeof(char)); |
duke@435 | 411 | // Calculate the ideal eden boundaries. |
duke@435 | 412 | // eden_end is already at the bottom of the generation |
duke@435 | 413 | assert(eden_start == virtual_space()->low(), |
duke@435 | 414 | "Eden is not starting at the low end of the virtual space"); |
duke@435 | 415 | if (eden_start + requested_eden_size >= eden_start) { |
duke@435 | 416 | eden_end = eden_start + requested_eden_size; |
duke@435 | 417 | } else { |
duke@435 | 418 | eden_end = to_start; |
duke@435 | 419 | } |
duke@435 | 420 | |
duke@435 | 421 | // Does eden intrude into to-space? to-space |
duke@435 | 422 | // gets priority but eden is not allowed to shrink |
duke@435 | 423 | // to 0. |
duke@435 | 424 | if (eden_end > to_start) { |
duke@435 | 425 | eden_end = to_start; |
duke@435 | 426 | } |
duke@435 | 427 | |
duke@435 | 428 | // Don't let eden shrink down to 0 or less. |
duke@435 | 429 | eden_end = MAX2(eden_end, eden_start + alignment); |
duke@435 | 430 | assert(eden_start + alignment >= eden_start, "Overflow"); |
duke@435 | 431 | |
duke@435 | 432 | size_t eden_size; |
duke@435 | 433 | if (maintain_minimum) { |
duke@435 | 434 | // Use all the space available. |
duke@435 | 435 | eden_end = MAX2(eden_end, to_start); |
duke@435 | 436 | eden_size = pointer_delta(eden_end, eden_start, sizeof(char)); |
duke@435 | 437 | eden_size = MIN2(eden_size, cur_eden_size); |
duke@435 | 438 | } else { |
duke@435 | 439 | eden_size = pointer_delta(eden_end, eden_start, sizeof(char)); |
duke@435 | 440 | } |
duke@435 | 441 | eden_size = align_size_down(eden_size, alignment); |
duke@435 | 442 | assert(maintain_minimum || eden_size <= requested_eden_size, |
duke@435 | 443 | "Eden size is too large"); |
duke@435 | 444 | assert(eden_size >= alignment, "Eden size is too small"); |
duke@435 | 445 | eden_end = eden_start + eden_size; |
duke@435 | 446 | |
duke@435 | 447 | // Move to-space down to eden. |
duke@435 | 448 | if (requested_eden_size < cur_eden_size) { |
duke@435 | 449 | to_start = eden_end; |
duke@435 | 450 | if (to_start + requested_survivor_size > to_start) { |
duke@435 | 451 | to_end = MIN2(from_start, to_start + requested_survivor_size); |
duke@435 | 452 | } else { |
duke@435 | 453 | to_end = from_start; |
duke@435 | 454 | } |
duke@435 | 455 | } |
duke@435 | 456 | |
duke@435 | 457 | // eden_end may have moved so again make sure |
duke@435 | 458 | // the to-space and eden don't overlap. |
duke@435 | 459 | to_start = MAX2(eden_end, to_start); |
duke@435 | 460 | |
duke@435 | 461 | // from-space |
duke@435 | 462 | size_t from_used = from()->used(); |
duke@435 | 463 | if (requested_survivor_size > from_used) { |
duke@435 | 464 | if (from_start + requested_survivor_size >= from_start) { |
duke@435 | 465 | from_end = from_start + requested_survivor_size; |
duke@435 | 466 | } |
duke@435 | 467 | if (from_end > virtual_space()->high()) { |
duke@435 | 468 | from_end = virtual_space()->high(); |
duke@435 | 469 | } |
duke@435 | 470 | } |
duke@435 | 471 | |
duke@435 | 472 | assert(to_start >= eden_end, "to-space should be above eden"); |
duke@435 | 473 | if (PrintAdaptiveSizePolicy && Verbose) { |
duke@435 | 474 | gclog_or_tty->print_cr(" [eden_start .. eden_end): " |
duke@435 | 475 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
drchase@6680 | 476 | p2i(eden_start), |
drchase@6680 | 477 | p2i(eden_end), |
duke@435 | 478 | pointer_delta(eden_end, eden_start, sizeof(char))); |
duke@435 | 479 | gclog_or_tty->print_cr(" [ to_start .. to_end): " |
duke@435 | 480 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
drchase@6680 | 481 | p2i(to_start), |
drchase@6680 | 482 | p2i(to_end), |
duke@435 | 483 | pointer_delta( to_end, to_start, sizeof(char))); |
duke@435 | 484 | gclog_or_tty->print_cr(" [from_start .. from_end): " |
duke@435 | 485 | "[" PTR_FORMAT " .. " PTR_FORMAT ") " SIZE_FORMAT, |
drchase@6680 | 486 | p2i(from_start), |
drchase@6680 | 487 | p2i(from_end), |
duke@435 | 488 | pointer_delta(from_end, from_start, sizeof(char))); |
duke@435 | 489 | } |
duke@435 | 490 | } |
duke@435 | 491 | |
duke@435 | 492 | |
duke@435 | 493 | guarantee((HeapWord*)from_start <= from()->bottom(), |
duke@435 | 494 | "from start moved to the right"); |
duke@435 | 495 | guarantee((HeapWord*)from_end >= from()->top(), |
duke@435 | 496 | "from end moved into live data"); |
duke@435 | 497 | assert(is_object_aligned((intptr_t)eden_start), "checking alignment"); |
duke@435 | 498 | assert(is_object_aligned((intptr_t)from_start), "checking alignment"); |
duke@435 | 499 | assert(is_object_aligned((intptr_t)to_start), "checking alignment"); |
duke@435 | 500 | |
duke@435 | 501 | MemRegion edenMR((HeapWord*)eden_start, (HeapWord*)eden_end); |
duke@435 | 502 | MemRegion toMR ((HeapWord*)to_start, (HeapWord*)to_end); |
duke@435 | 503 | MemRegion fromMR((HeapWord*)from_start, (HeapWord*)from_end); |
duke@435 | 504 | |
duke@435 | 505 | // Let's make sure the call to initialize doesn't reset "top"! |
duke@435 | 506 | HeapWord* old_from_top = from()->top(); |
duke@435 | 507 | |
duke@435 | 508 | // For PrintAdaptiveSizePolicy block below |
duke@435 | 509 | size_t old_from = from()->capacity(); |
duke@435 | 510 | size_t old_to = to()->capacity(); |
duke@435 | 511 | |
jmasa@698 | 512 | // If not clearing the spaces, do some checking to verify that |
jmasa@698 | 513 | // the spaces are already mangled. |
jmasa@698 | 514 | |
jmasa@698 | 515 | // Must check mangling before the spaces are reshaped. Otherwise, |
jmasa@698 | 516 | // the bottom or end of one space may have moved into another |
jmasa@698 | 517 | // a failure of the check may not correctly indicate which space |
jmasa@698 | 518 | // is not properly mangled. |
jmasa@698 | 519 | if (ZapUnusedHeapArea) { |
jmasa@698 | 520 | HeapWord* limit = (HeapWord*) virtual_space()->high(); |
jmasa@698 | 521 | eden()->check_mangled_unused_area(limit); |
jmasa@698 | 522 | from()->check_mangled_unused_area(limit); |
jmasa@698 | 523 | to()->check_mangled_unused_area(limit); |
jmasa@698 | 524 | } |
jmasa@698 | 525 | |
duke@435 | 526 | // The call to initialize NULL's the next compaction space |
jmasa@698 | 527 | eden()->initialize(edenMR, |
jmasa@698 | 528 | SpaceDecorator::Clear, |
jmasa@698 | 529 | SpaceDecorator::DontMangle); |
duke@435 | 530 | eden()->set_next_compaction_space(from()); |
jmasa@698 | 531 | to()->initialize(toMR , |
jmasa@698 | 532 | SpaceDecorator::Clear, |
jmasa@698 | 533 | SpaceDecorator::DontMangle); |
jmasa@698 | 534 | from()->initialize(fromMR, |
jmasa@698 | 535 | SpaceDecorator::DontClear, |
jmasa@698 | 536 | SpaceDecorator::DontMangle); |
duke@435 | 537 | |
duke@435 | 538 | assert(from()->top() == old_from_top, "from top changed!"); |
duke@435 | 539 | |
duke@435 | 540 | if (PrintAdaptiveSizePolicy) { |
duke@435 | 541 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 542 | assert(gch->kind() == CollectedHeap::GenCollectedHeap, "Sanity"); |
duke@435 | 543 | |
duke@435 | 544 | gclog_or_tty->print("AdaptiveSizePolicy::survivor space sizes: " |
duke@435 | 545 | "collection: %d " |
duke@435 | 546 | "(" SIZE_FORMAT ", " SIZE_FORMAT ") -> " |
duke@435 | 547 | "(" SIZE_FORMAT ", " SIZE_FORMAT ") ", |
duke@435 | 548 | gch->total_collections(), |
duke@435 | 549 | old_from, old_to, |
duke@435 | 550 | from()->capacity(), |
duke@435 | 551 | to()->capacity()); |
duke@435 | 552 | gclog_or_tty->cr(); |
duke@435 | 553 | } |
duke@435 | 554 | } |
duke@435 | 555 | |
duke@435 | 556 | void ASParNewGeneration::compute_new_size() { |
duke@435 | 557 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 558 | assert(gch->kind() == CollectedHeap::GenCollectedHeap, |
duke@435 | 559 | "not a CMS generational heap"); |
duke@435 | 560 | |
duke@435 | 561 | |
duke@435 | 562 | CMSAdaptiveSizePolicy* size_policy = |
duke@435 | 563 | (CMSAdaptiveSizePolicy*)gch->gen_policy()->size_policy(); |
duke@435 | 564 | assert(size_policy->is_gc_cms_adaptive_size_policy(), |
duke@435 | 565 | "Wrong type of size policy"); |
duke@435 | 566 | |
duke@435 | 567 | size_t survived = from()->used(); |
duke@435 | 568 | if (!survivor_overflow()) { |
duke@435 | 569 | // Keep running averages on how much survived |
duke@435 | 570 | size_policy->avg_survived()->sample(survived); |
duke@435 | 571 | } else { |
duke@435 | 572 | size_t promoted = |
duke@435 | 573 | (size_t) next_gen()->gc_stats()->avg_promoted()->last_sample(); |
duke@435 | 574 | assert(promoted < gch->capacity(), "Conversion problem?"); |
duke@435 | 575 | size_t survived_guess = survived + promoted; |
duke@435 | 576 | size_policy->avg_survived()->sample(survived_guess); |
duke@435 | 577 | } |
duke@435 | 578 | |
duke@435 | 579 | size_t survivor_limit = max_survivor_size(); |
duke@435 | 580 | _tenuring_threshold = |
duke@435 | 581 | size_policy->compute_survivor_space_size_and_threshold( |
duke@435 | 582 | _survivor_overflow, |
duke@435 | 583 | _tenuring_threshold, |
duke@435 | 584 | survivor_limit); |
duke@435 | 585 | size_policy->avg_young_live()->sample(used()); |
duke@435 | 586 | size_policy->avg_eden_live()->sample(eden()->used()); |
duke@435 | 587 | |
tamao@5192 | 588 | size_policy->compute_eden_space_size(eden()->capacity(), max_gen_size()); |
duke@435 | 589 | |
duke@435 | 590 | resize(size_policy->calculated_eden_size_in_bytes(), |
duke@435 | 591 | size_policy->calculated_survivor_size_in_bytes()); |
duke@435 | 592 | |
duke@435 | 593 | if (UsePerfData) { |
duke@435 | 594 | CMSGCAdaptivePolicyCounters* counters = |
duke@435 | 595 | (CMSGCAdaptivePolicyCounters*) gch->collector_policy()->counters(); |
duke@435 | 596 | assert(counters->kind() == |
duke@435 | 597 | GCPolicyCounters::CMSGCAdaptivePolicyCountersKind, |
duke@435 | 598 | "Wrong kind of counters"); |
duke@435 | 599 | counters->update_tenuring_threshold(_tenuring_threshold); |
duke@435 | 600 | counters->update_survivor_overflowed(_survivor_overflow); |
duke@435 | 601 | counters->update_young_capacity(capacity()); |
duke@435 | 602 | } |
duke@435 | 603 | } |
duke@435 | 604 | |
duke@435 | 605 | |
duke@435 | 606 | #ifndef PRODUCT |
duke@435 | 607 | // Changes from PSYoungGen version |
duke@435 | 608 | // value of "alignment" |
duke@435 | 609 | void ASParNewGeneration::space_invariants() { |
duke@435 | 610 | const size_t alignment = os::vm_page_size(); |
duke@435 | 611 | |
duke@435 | 612 | // Currently, our eden size cannot shrink to zero |
duke@435 | 613 | guarantee(eden()->capacity() >= alignment, "eden too small"); |
duke@435 | 614 | guarantee(from()->capacity() >= alignment, "from too small"); |
duke@435 | 615 | guarantee(to()->capacity() >= alignment, "to too small"); |
duke@435 | 616 | |
duke@435 | 617 | // Relationship of spaces to each other |
duke@435 | 618 | char* eden_start = (char*)eden()->bottom(); |
duke@435 | 619 | char* eden_end = (char*)eden()->end(); |
duke@435 | 620 | char* from_start = (char*)from()->bottom(); |
duke@435 | 621 | char* from_end = (char*)from()->end(); |
duke@435 | 622 | char* to_start = (char*)to()->bottom(); |
duke@435 | 623 | char* to_end = (char*)to()->end(); |
duke@435 | 624 | |
duke@435 | 625 | guarantee(eden_start >= virtual_space()->low(), "eden bottom"); |
duke@435 | 626 | guarantee(eden_start < eden_end, "eden space consistency"); |
duke@435 | 627 | guarantee(from_start < from_end, "from space consistency"); |
duke@435 | 628 | guarantee(to_start < to_end, "to space consistency"); |
duke@435 | 629 | |
duke@435 | 630 | // Check whether from space is below to space |
duke@435 | 631 | if (from_start < to_start) { |
duke@435 | 632 | // Eden, from, to |
duke@435 | 633 | guarantee(eden_end <= from_start, "eden/from boundary"); |
duke@435 | 634 | guarantee(from_end <= to_start, "from/to boundary"); |
duke@435 | 635 | guarantee(to_end <= virtual_space()->high(), "to end"); |
duke@435 | 636 | } else { |
duke@435 | 637 | // Eden, to, from |
duke@435 | 638 | guarantee(eden_end <= to_start, "eden/to boundary"); |
duke@435 | 639 | guarantee(to_end <= from_start, "to/from boundary"); |
duke@435 | 640 | guarantee(from_end <= virtual_space()->high(), "from end"); |
duke@435 | 641 | } |
duke@435 | 642 | |
duke@435 | 643 | // More checks that the virtual space is consistent with the spaces |
duke@435 | 644 | assert(virtual_space()->committed_size() >= |
duke@435 | 645 | (eden()->capacity() + |
duke@435 | 646 | to()->capacity() + |
duke@435 | 647 | from()->capacity()), "Committed size is inconsistent"); |
duke@435 | 648 | assert(virtual_space()->committed_size() <= virtual_space()->reserved_size(), |
duke@435 | 649 | "Space invariant"); |
duke@435 | 650 | char* eden_top = (char*)eden()->top(); |
duke@435 | 651 | char* from_top = (char*)from()->top(); |
duke@435 | 652 | char* to_top = (char*)to()->top(); |
duke@435 | 653 | assert(eden_top <= virtual_space()->high(), "eden top"); |
duke@435 | 654 | assert(from_top <= virtual_space()->high(), "from top"); |
duke@435 | 655 | assert(to_top <= virtual_space()->high(), "to top"); |
duke@435 | 656 | } |
duke@435 | 657 | #endif |