1 /* 2 * Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "gc/parallel/adjoiningGenerations.hpp" 27 #include "gc/parallel/adjoiningVirtualSpaces.hpp" 28 #include "gc/parallel/generationSizer.hpp" 29 #include "gc/parallel/parallelScavengeHeap.hpp" 30 #include "logging/log.hpp" 31 #include "logging/logStream.hpp" 32 #include "memory/resourceArea.hpp" 33 #include "utilities/ostream.hpp" 34 35 // If boundary moving is being used, create the young gen and old 36 // gen with ASPSYoungGen and ASPSOldGen, respectively. Revert to 37 // the old behavior otherwise (with PSYoungGen and PSOldGen). 38 39 AdjoiningGenerations::AdjoiningGenerations(ReservedSpace old_young_rs, 40 GenerationSizer* policy, 41 size_t alignment) : 42 _virtual_spaces(old_young_rs, policy->min_old_size(), 43 policy->min_young_size(), alignment) { 44 size_t init_low_byte_size = policy->initial_old_size(); 45 size_t min_low_byte_size = policy->min_old_size(); 46 size_t max_low_byte_size = policy->max_old_size(); 47 size_t init_high_byte_size = policy->initial_young_size(); 48 size_t min_high_byte_size = policy->min_young_size(); 49 size_t max_high_byte_size = policy->max_young_size(); 50 51 assert(min_low_byte_size <= init_low_byte_size && 52 init_low_byte_size <= max_low_byte_size, "Parameter check"); 53 assert(min_high_byte_size <= init_high_byte_size && 54 init_high_byte_size <= max_high_byte_size, "Parameter check"); 55 // Create the generations differently based on the option to 56 // move the boundary. 57 if (UseAdaptiveGCBoundary) { 58 // Initialize the adjoining virtual spaces. Then pass the 59 // a virtual to each generation for initialization of the 60 // generation. 61 62 // Does the actual creation of the virtual spaces 63 _virtual_spaces.initialize(max_low_byte_size, 64 init_low_byte_size, 65 init_high_byte_size); 66 67 // Place the young gen at the high end. Passes in the virtual space. 68 _young_gen = new ASPSYoungGen(_virtual_spaces.high(), 69 _virtual_spaces.high()->committed_size(), 70 min_high_byte_size, 71 _virtual_spaces.high_byte_size_limit()); 72 73 // Place the old gen at the low end. Passes in the virtual space. 74 _old_gen = new ASPSOldGen(_virtual_spaces.low(), 75 _virtual_spaces.low()->committed_size(), 76 min_low_byte_size, 77 _virtual_spaces.low_byte_size_limit(), 78 "old", 1); 79 80 young_gen()->initialize_work(); 81 assert(young_gen()->reserved().byte_size() <= young_gen()->gen_size_limit(), 82 "Consistency check"); 83 assert(old_young_rs.size() >= young_gen()->gen_size_limit(), 84 "Consistency check"); 85 86 old_gen()->initialize_work("old", 1); 87 assert(old_gen()->reserved().byte_size() <= old_gen()->gen_size_limit(), 88 "Consistency check"); 89 assert(old_young_rs.size() >= old_gen()->gen_size_limit(), 90 "Consistency check"); 91 } else { 92 93 // Layout the reserved space for the generations. 94 ReservedSpace old_rs = 95 virtual_spaces()->reserved_space().first_part(max_low_byte_size); 96 ReservedSpace heap_rs = 97 virtual_spaces()->reserved_space().last_part(max_low_byte_size); 98 ReservedSpace young_rs = heap_rs.first_part(max_high_byte_size); 99 assert(young_rs.size() == heap_rs.size(), "Didn't reserve all of the heap"); 100 101 // Create the generations. Virtual spaces are not passed in. 102 _young_gen = new PSYoungGen(init_high_byte_size, 103 min_high_byte_size, 104 max_high_byte_size); 105 _old_gen = new PSOldGen(init_low_byte_size, 106 min_low_byte_size, 107 max_low_byte_size, 108 "old", 1); 109 110 // The virtual spaces are created by the initialization of the gens. 111 _young_gen->initialize(young_rs, alignment); 112 assert(young_gen()->gen_size_limit() == young_rs.size(), 113 "Consistency check"); 114 _old_gen->initialize(old_rs, alignment, "old", 1); 115 assert(old_gen()->gen_size_limit() == old_rs.size(), "Consistency check"); 116 } 117 } 118 119 size_t AdjoiningGenerations::reserved_byte_size() { 120 return virtual_spaces()->reserved_space().size(); 121 } 122 123 void log_before_expansion(bool old, size_t expand_in_bytes, size_t change_in_bytes, size_t max_size) { 124 Log(heap, ergo) log; 125 if (!log.is_debug()) { 126 return; 127 } 128 log.debug("Before expansion of %s gen with boundary move", old ? "old" : "young"); 129 log.debug(" Requested change: " SIZE_FORMAT_HEX " Attempted change: " SIZE_FORMAT_HEX, 130 expand_in_bytes, change_in_bytes); 131 ResourceMark rm; 132 LogStream ls(log.debug()); 133 ParallelScavengeHeap::heap()->print_on(&ls); 134 log.debug(" PS%sGen max size: " SIZE_FORMAT "K", old ? "Old" : "Young", max_size/K); 135 } 136 137 void log_after_expansion(bool old, size_t max_size) { 138 Log(heap, ergo) log; 139 if (!log.is_debug()) { 140 return; 141 } 142 log.debug("After expansion of %s gen with boundary move", old ? "old" : "young"); 143 ResourceMark rm; 144 LogStream ls(log.debug()); 145 ParallelScavengeHeap::heap()->print_on(&ls); 146 log.debug(" PS%sGen max size: " SIZE_FORMAT "K", old ? "Old" : "Young", max_size/K); 147 } 148 149 // Make checks on the current sizes of the generations and 150 // the constraints on the sizes of the generations. Push 151 // up the boundary within the constraints. A partial 152 // push can occur. 153 void AdjoiningGenerations::request_old_gen_expansion(size_t expand_in_bytes) { 154 assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check"); 155 156 assert_lock_strong(ExpandHeap_lock); 157 assert_locked_or_safepoint(Heap_lock); 158 159 // These sizes limit the amount the boundaries can move. Effectively, 160 // the generation says how much it is willing to yield to the other 161 // generation. 162 const size_t young_gen_available = young_gen()->available_for_contraction(); 163 const size_t old_gen_available = old_gen()->available_for_expansion(); 164 const size_t alignment = virtual_spaces()->alignment(); 165 size_t change_in_bytes = MIN3(young_gen_available, 166 old_gen_available, 167 align_size_up_(expand_in_bytes, alignment)); 168 169 if (change_in_bytes == 0) { 170 return; 171 } 172 173 log_before_expansion(true, expand_in_bytes, change_in_bytes, old_gen()->max_gen_size()); 174 175 // Move the boundary between the generations up (smaller young gen). 176 if (virtual_spaces()->adjust_boundary_up(change_in_bytes)) { 177 young_gen()->reset_after_change(); 178 old_gen()->reset_after_change(); 179 } 180 181 // The total reserved for the generations should match the sum 182 // of the two even if the boundary is moving. 183 assert(reserved_byte_size() == 184 old_gen()->max_gen_size() + young_gen()->max_size(), 185 "Space is missing"); 186 young_gen()->space_invariants(); 187 old_gen()->space_invariants(); 188 189 log_after_expansion(true, old_gen()->max_gen_size()); 190 } 191 192 // See comments on request_old_gen_expansion() 193 bool AdjoiningGenerations::request_young_gen_expansion(size_t expand_in_bytes) { 194 assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check"); 195 196 // If eden is not empty, the boundary can be moved but no advantage 197 // can be made of the move since eden cannot be moved. 198 if (!young_gen()->eden_space()->is_empty()) { 199 return false; 200 } 201 202 203 bool result = false; 204 const size_t young_gen_available = young_gen()->available_for_expansion(); 205 const size_t old_gen_available = old_gen()->available_for_contraction(); 206 const size_t alignment = virtual_spaces()->alignment(); 207 size_t change_in_bytes = MIN3(young_gen_available, 208 old_gen_available, 209 align_size_up_(expand_in_bytes, alignment)); 210 211 if (change_in_bytes == 0) { 212 return false; 213 } 214 215 log_before_expansion(false, expand_in_bytes, change_in_bytes, young_gen()->max_size()); 216 217 // Move the boundary between the generations down (smaller old gen). 218 MutexLocker x(ExpandHeap_lock); 219 if (virtual_spaces()->adjust_boundary_down(change_in_bytes)) { 220 young_gen()->reset_after_change(); 221 old_gen()->reset_after_change(); 222 result = true; 223 } 224 225 // The total reserved for the generations should match the sum 226 // of the two even if the boundary is moving. 227 assert(reserved_byte_size() == 228 old_gen()->max_gen_size() + young_gen()->max_size(), 229 "Space is missing"); 230 young_gen()->space_invariants(); 231 old_gen()->space_invariants(); 232 233 log_after_expansion(false, young_gen()->max_size()); 234 235 return result; 236 } 237 238 // Additional space is needed in the old generation. Try to move the boundary 239 // up to meet the need. Moves boundary up only 240 void AdjoiningGenerations::adjust_boundary_for_old_gen_needs( 241 size_t desired_free_space) { 242 assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check"); 243 244 // Stress testing. 245 if (PSAdaptiveSizePolicyResizeVirtualSpaceAlot == 1) { 246 MutexLocker x(ExpandHeap_lock); 247 request_old_gen_expansion(virtual_spaces()->alignment() * 3 / 2); 248 } 249 250 // Expand only if the entire generation is already committed. 251 if (old_gen()->virtual_space()->uncommitted_size() == 0) { 252 if (old_gen()->free_in_bytes() < desired_free_space) { 253 MutexLocker x(ExpandHeap_lock); 254 request_old_gen_expansion(desired_free_space); 255 } 256 } 257 } 258 259 // See comment on adjust_boundary_for_old_gen_needss(). 260 // Adjust boundary down only. 261 void AdjoiningGenerations::adjust_boundary_for_young_gen_needs(size_t eden_size, 262 size_t survivor_size) { 263 264 assert(UseAdaptiveSizePolicy && UseAdaptiveGCBoundary, "runtime check"); 265 266 // Stress testing. 267 if (PSAdaptiveSizePolicyResizeVirtualSpaceAlot == 0) { 268 request_young_gen_expansion(virtual_spaces()->alignment() * 3 / 2); 269 eden_size = young_gen()->eden_space()->capacity_in_bytes(); 270 } 271 272 // Expand only if the entire generation is already committed. 273 if (young_gen()->virtual_space()->uncommitted_size() == 0) { 274 size_t desired_size = eden_size + 2 * survivor_size; 275 const size_t committed = young_gen()->virtual_space()->committed_size(); 276 if (desired_size > committed) { 277 request_young_gen_expansion(desired_size - committed); 278 } 279 } 280 }