Wed, 15 Feb 2012 16:29:40 -0800
7142680: default GC affected by jvm path
Summary: Removed old tiered code
Reviewed-by: never, kvn
duke@435 | 1 | /* |
johnc@3022 | 2 | * Copyright (c) 1997, 2011, 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 "oops/markOop.hpp" |
stefank@2314 | 27 | #include "oops/oop.inline.hpp" |
stefank@2314 | 28 | #include "runtime/virtualspace.hpp" |
stefank@2314 | 29 | #ifdef TARGET_OS_FAMILY_linux |
stefank@2314 | 30 | # include "os_linux.inline.hpp" |
stefank@2314 | 31 | #endif |
stefank@2314 | 32 | #ifdef TARGET_OS_FAMILY_solaris |
stefank@2314 | 33 | # include "os_solaris.inline.hpp" |
stefank@2314 | 34 | #endif |
stefank@2314 | 35 | #ifdef TARGET_OS_FAMILY_windows |
stefank@2314 | 36 | # include "os_windows.inline.hpp" |
stefank@2314 | 37 | #endif |
never@3156 | 38 | #ifdef TARGET_OS_FAMILY_bsd |
never@3156 | 39 | # include "os_bsd.inline.hpp" |
never@3156 | 40 | #endif |
duke@435 | 41 | |
duke@435 | 42 | |
duke@435 | 43 | // ReservedSpace |
duke@435 | 44 | ReservedSpace::ReservedSpace(size_t size) { |
coleenp@1091 | 45 | initialize(size, 0, false, NULL, 0, false); |
duke@435 | 46 | } |
duke@435 | 47 | |
duke@435 | 48 | ReservedSpace::ReservedSpace(size_t size, size_t alignment, |
coleenp@672 | 49 | bool large, |
coleenp@672 | 50 | char* requested_address, |
coleenp@672 | 51 | const size_t noaccess_prefix) { |
coleenp@672 | 52 | initialize(size+noaccess_prefix, alignment, large, requested_address, |
coleenp@1091 | 53 | noaccess_prefix, false); |
coleenp@1091 | 54 | } |
coleenp@1091 | 55 | |
coleenp@1091 | 56 | ReservedSpace::ReservedSpace(size_t size, size_t alignment, |
coleenp@1091 | 57 | bool large, |
coleenp@1091 | 58 | bool executable) { |
coleenp@1091 | 59 | initialize(size, alignment, large, NULL, 0, executable); |
duke@435 | 60 | } |
duke@435 | 61 | |
duke@435 | 62 | char * |
duke@435 | 63 | ReservedSpace::align_reserved_region(char* addr, const size_t len, |
duke@435 | 64 | const size_t prefix_size, |
duke@435 | 65 | const size_t prefix_align, |
duke@435 | 66 | const size_t suffix_size, |
duke@435 | 67 | const size_t suffix_align) |
duke@435 | 68 | { |
duke@435 | 69 | assert(addr != NULL, "sanity"); |
duke@435 | 70 | const size_t required_size = prefix_size + suffix_size; |
duke@435 | 71 | assert(len >= required_size, "len too small"); |
duke@435 | 72 | |
duke@435 | 73 | const size_t s = size_t(addr); |
johnc@3022 | 74 | const size_t beg_ofs = (s + prefix_size) & (suffix_align - 1); |
duke@435 | 75 | const size_t beg_delta = beg_ofs == 0 ? 0 : suffix_align - beg_ofs; |
duke@435 | 76 | |
duke@435 | 77 | if (len < beg_delta + required_size) { |
duke@435 | 78 | return NULL; // Cannot do proper alignment. |
duke@435 | 79 | } |
duke@435 | 80 | const size_t end_delta = len - (beg_delta + required_size); |
duke@435 | 81 | |
duke@435 | 82 | if (beg_delta != 0) { |
duke@435 | 83 | os::release_memory(addr, beg_delta); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | if (end_delta != 0) { |
duke@435 | 87 | char* release_addr = (char*) (s + beg_delta + required_size); |
duke@435 | 88 | os::release_memory(release_addr, end_delta); |
duke@435 | 89 | } |
duke@435 | 90 | |
duke@435 | 91 | return (char*) (s + beg_delta); |
duke@435 | 92 | } |
duke@435 | 93 | |
duke@435 | 94 | char* ReservedSpace::reserve_and_align(const size_t reserve_size, |
duke@435 | 95 | const size_t prefix_size, |
duke@435 | 96 | const size_t prefix_align, |
duke@435 | 97 | const size_t suffix_size, |
duke@435 | 98 | const size_t suffix_align) |
duke@435 | 99 | { |
duke@435 | 100 | assert(reserve_size > prefix_size + suffix_size, "should not be here"); |
duke@435 | 101 | |
duke@435 | 102 | char* raw_addr = os::reserve_memory(reserve_size, NULL, prefix_align); |
duke@435 | 103 | if (raw_addr == NULL) return NULL; |
duke@435 | 104 | |
duke@435 | 105 | char* result = align_reserved_region(raw_addr, reserve_size, prefix_size, |
duke@435 | 106 | prefix_align, suffix_size, |
duke@435 | 107 | suffix_align); |
duke@435 | 108 | if (result == NULL && !os::release_memory(raw_addr, reserve_size)) { |
duke@435 | 109 | fatal("os::release_memory failed"); |
duke@435 | 110 | } |
duke@435 | 111 | |
duke@435 | 112 | #ifdef ASSERT |
duke@435 | 113 | if (result != NULL) { |
duke@435 | 114 | const size_t raw = size_t(raw_addr); |
duke@435 | 115 | const size_t res = size_t(result); |
duke@435 | 116 | assert(res >= raw, "alignment decreased start addr"); |
duke@435 | 117 | assert(res + prefix_size + suffix_size <= raw + reserve_size, |
duke@435 | 118 | "alignment increased end addr"); |
johnc@3022 | 119 | assert((res & (prefix_align - 1)) == 0, "bad alignment of prefix"); |
johnc@3022 | 120 | assert(((res + prefix_size) & (suffix_align - 1)) == 0, |
duke@435 | 121 | "bad alignment of suffix"); |
duke@435 | 122 | } |
duke@435 | 123 | #endif |
duke@435 | 124 | |
duke@435 | 125 | return result; |
duke@435 | 126 | } |
duke@435 | 127 | |
kvn@1973 | 128 | // Helper method. |
kvn@1973 | 129 | static bool failed_to_reserve_as_requested(char* base, char* requested_address, |
kvn@1973 | 130 | const size_t size, bool special) |
kvn@1973 | 131 | { |
kvn@1973 | 132 | if (base == requested_address || requested_address == NULL) |
kvn@1973 | 133 | return false; // did not fail |
kvn@1973 | 134 | |
kvn@1973 | 135 | if (base != NULL) { |
kvn@1973 | 136 | // Different reserve address may be acceptable in other cases |
kvn@1973 | 137 | // but for compressed oops heap should be at requested address. |
kvn@1973 | 138 | assert(UseCompressedOops, "currently requested address used only for compressed oops"); |
kvn@1973 | 139 | if (PrintCompressedOopsMode) { |
kvn@1973 | 140 | tty->cr(); |
johnc@3022 | 141 | tty->print_cr("Reserved memory not at requested address: " PTR_FORMAT " vs " PTR_FORMAT, base, requested_address); |
kvn@1973 | 142 | } |
kvn@1973 | 143 | // OS ignored requested address. Try different address. |
kvn@1973 | 144 | if (special) { |
kvn@1973 | 145 | if (!os::release_memory_special(base, size)) { |
kvn@1973 | 146 | fatal("os::release_memory_special failed"); |
kvn@1973 | 147 | } |
kvn@1973 | 148 | } else { |
kvn@1973 | 149 | if (!os::release_memory(base, size)) { |
kvn@1973 | 150 | fatal("os::release_memory failed"); |
kvn@1973 | 151 | } |
kvn@1973 | 152 | } |
kvn@1973 | 153 | } |
kvn@1973 | 154 | return true; |
kvn@1973 | 155 | } |
kvn@1973 | 156 | |
duke@435 | 157 | ReservedSpace::ReservedSpace(const size_t prefix_size, |
duke@435 | 158 | const size_t prefix_align, |
duke@435 | 159 | const size_t suffix_size, |
coleenp@672 | 160 | const size_t suffix_align, |
kvn@1077 | 161 | char* requested_address, |
coleenp@672 | 162 | const size_t noaccess_prefix) |
duke@435 | 163 | { |
duke@435 | 164 | assert(prefix_size != 0, "sanity"); |
duke@435 | 165 | assert(prefix_align != 0, "sanity"); |
duke@435 | 166 | assert(suffix_size != 0, "sanity"); |
duke@435 | 167 | assert(suffix_align != 0, "sanity"); |
johnc@3022 | 168 | assert((prefix_size & (prefix_align - 1)) == 0, |
duke@435 | 169 | "prefix_size not divisible by prefix_align"); |
johnc@3022 | 170 | assert((suffix_size & (suffix_align - 1)) == 0, |
duke@435 | 171 | "suffix_size not divisible by suffix_align"); |
johnc@3022 | 172 | assert((suffix_align & (prefix_align - 1)) == 0, |
duke@435 | 173 | "suffix_align not divisible by prefix_align"); |
duke@435 | 174 | |
kvn@1973 | 175 | // Assert that if noaccess_prefix is used, it is the same as prefix_align. |
kvn@1973 | 176 | assert(noaccess_prefix == 0 || |
kvn@1973 | 177 | noaccess_prefix == prefix_align, "noaccess prefix wrong"); |
kvn@1973 | 178 | |
coleenp@672 | 179 | // Add in noaccess_prefix to prefix_size; |
coleenp@672 | 180 | const size_t adjusted_prefix_size = prefix_size + noaccess_prefix; |
coleenp@672 | 181 | const size_t size = adjusted_prefix_size + suffix_size; |
coleenp@672 | 182 | |
duke@435 | 183 | // On systems where the entire region has to be reserved and committed up |
duke@435 | 184 | // front, the compound alignment normally done by this method is unnecessary. |
duke@435 | 185 | const bool try_reserve_special = UseLargePages && |
duke@435 | 186 | prefix_align == os::large_page_size(); |
duke@435 | 187 | if (!os::can_commit_large_page_memory() && try_reserve_special) { |
coleenp@1091 | 188 | initialize(size, prefix_align, true, requested_address, noaccess_prefix, |
coleenp@1091 | 189 | false); |
duke@435 | 190 | return; |
duke@435 | 191 | } |
duke@435 | 192 | |
duke@435 | 193 | _base = NULL; |
duke@435 | 194 | _size = 0; |
duke@435 | 195 | _alignment = 0; |
duke@435 | 196 | _special = false; |
coleenp@672 | 197 | _noaccess_prefix = 0; |
coleenp@1091 | 198 | _executable = false; |
coleenp@672 | 199 | |
duke@435 | 200 | // Optimistically try to reserve the exact size needed. |
kvn@1077 | 201 | char* addr; |
kvn@1077 | 202 | if (requested_address != 0) { |
kvn@1973 | 203 | requested_address -= noaccess_prefix; // adjust address |
kvn@1973 | 204 | assert(requested_address != NULL, "huge noaccess prefix?"); |
kvn@1973 | 205 | addr = os::attempt_reserve_memory_at(size, requested_address); |
kvn@1973 | 206 | if (failed_to_reserve_as_requested(addr, requested_address, size, false)) { |
kvn@1973 | 207 | // OS ignored requested address. Try different address. |
kvn@1973 | 208 | addr = NULL; |
kvn@1973 | 209 | } |
kvn@1077 | 210 | } else { |
kvn@1077 | 211 | addr = os::reserve_memory(size, NULL, prefix_align); |
kvn@1077 | 212 | } |
duke@435 | 213 | if (addr == NULL) return; |
duke@435 | 214 | |
duke@435 | 215 | // Check whether the result has the needed alignment (unlikely unless |
johnc@3022 | 216 | // prefix_align < suffix_align). |
johnc@3022 | 217 | const size_t ofs = (size_t(addr) + adjusted_prefix_size) & (suffix_align - 1); |
duke@435 | 218 | if (ofs != 0) { |
duke@435 | 219 | // Wrong alignment. Release, allocate more space and do manual alignment. |
duke@435 | 220 | // |
duke@435 | 221 | // On most operating systems, another allocation with a somewhat larger size |
duke@435 | 222 | // will return an address "close to" that of the previous allocation. The |
duke@435 | 223 | // result is often the same address (if the kernel hands out virtual |
duke@435 | 224 | // addresses from low to high), or an address that is offset by the increase |
duke@435 | 225 | // in size. Exploit that to minimize the amount of extra space requested. |
duke@435 | 226 | if (!os::release_memory(addr, size)) { |
duke@435 | 227 | fatal("os::release_memory failed"); |
duke@435 | 228 | } |
duke@435 | 229 | |
duke@435 | 230 | const size_t extra = MAX2(ofs, suffix_align - ofs); |
coleenp@672 | 231 | addr = reserve_and_align(size + extra, adjusted_prefix_size, prefix_align, |
duke@435 | 232 | suffix_size, suffix_align); |
duke@435 | 233 | if (addr == NULL) { |
duke@435 | 234 | // Try an even larger region. If this fails, address space is exhausted. |
coleenp@672 | 235 | addr = reserve_and_align(size + suffix_align, adjusted_prefix_size, |
duke@435 | 236 | prefix_align, suffix_size, suffix_align); |
duke@435 | 237 | } |
johnc@3022 | 238 | |
johnc@3022 | 239 | if (requested_address != 0 && |
johnc@3022 | 240 | failed_to_reserve_as_requested(addr, requested_address, size, false)) { |
johnc@3022 | 241 | // As a result of the alignment constraints, the allocated addr differs |
johnc@3022 | 242 | // from the requested address. Return back to the caller who can |
johnc@3022 | 243 | // take remedial action (like try again without a requested address). |
johnc@3022 | 244 | assert(_base == NULL, "should be"); |
johnc@3022 | 245 | return; |
johnc@3022 | 246 | } |
duke@435 | 247 | } |
duke@435 | 248 | |
duke@435 | 249 | _base = addr; |
duke@435 | 250 | _size = size; |
duke@435 | 251 | _alignment = prefix_align; |
coleenp@672 | 252 | _noaccess_prefix = noaccess_prefix; |
duke@435 | 253 | } |
duke@435 | 254 | |
duke@435 | 255 | void ReservedSpace::initialize(size_t size, size_t alignment, bool large, |
coleenp@672 | 256 | char* requested_address, |
coleenp@1091 | 257 | const size_t noaccess_prefix, |
coleenp@1091 | 258 | bool executable) { |
duke@435 | 259 | const size_t granularity = os::vm_allocation_granularity(); |
johnc@3022 | 260 | assert((size & (granularity - 1)) == 0, |
duke@435 | 261 | "size not aligned to os::vm_allocation_granularity()"); |
johnc@3022 | 262 | assert((alignment & (granularity - 1)) == 0, |
duke@435 | 263 | "alignment not aligned to os::vm_allocation_granularity()"); |
duke@435 | 264 | assert(alignment == 0 || is_power_of_2((intptr_t)alignment), |
duke@435 | 265 | "not a power of 2"); |
duke@435 | 266 | |
johnc@3022 | 267 | alignment = MAX2(alignment, (size_t)os::vm_page_size()); |
johnc@3022 | 268 | |
johnc@3022 | 269 | // Assert that if noaccess_prefix is used, it is the same as alignment. |
johnc@3022 | 270 | assert(noaccess_prefix == 0 || |
johnc@3022 | 271 | noaccess_prefix == alignment, "noaccess prefix wrong"); |
johnc@3022 | 272 | |
duke@435 | 273 | _base = NULL; |
duke@435 | 274 | _size = 0; |
duke@435 | 275 | _special = false; |
coleenp@1091 | 276 | _executable = executable; |
duke@435 | 277 | _alignment = 0; |
coleenp@672 | 278 | _noaccess_prefix = 0; |
duke@435 | 279 | if (size == 0) { |
duke@435 | 280 | return; |
duke@435 | 281 | } |
duke@435 | 282 | |
duke@435 | 283 | // If OS doesn't support demand paging for large page memory, we need |
duke@435 | 284 | // to use reserve_memory_special() to reserve and pin the entire region. |
duke@435 | 285 | bool special = large && !os::can_commit_large_page_memory(); |
duke@435 | 286 | char* base = NULL; |
duke@435 | 287 | |
kvn@1973 | 288 | if (requested_address != 0) { |
kvn@1973 | 289 | requested_address -= noaccess_prefix; // adjust requested address |
kvn@1973 | 290 | assert(requested_address != NULL, "huge noaccess prefix?"); |
kvn@1973 | 291 | } |
kvn@1973 | 292 | |
duke@435 | 293 | if (special) { |
duke@435 | 294 | |
coleenp@1091 | 295 | base = os::reserve_memory_special(size, requested_address, executable); |
duke@435 | 296 | |
duke@435 | 297 | if (base != NULL) { |
kvn@1973 | 298 | if (failed_to_reserve_as_requested(base, requested_address, size, true)) { |
kvn@1973 | 299 | // OS ignored requested address. Try different address. |
kvn@1973 | 300 | return; |
kvn@1973 | 301 | } |
duke@435 | 302 | // Check alignment constraints |
johnc@3022 | 303 | assert((uintptr_t) base % alignment == 0, |
johnc@3022 | 304 | "Large pages returned a non-aligned address"); |
duke@435 | 305 | _special = true; |
duke@435 | 306 | } else { |
duke@435 | 307 | // failed; try to reserve regular memory below |
kvn@1973 | 308 | if (UseLargePages && (!FLAG_IS_DEFAULT(UseLargePages) || |
kvn@1973 | 309 | !FLAG_IS_DEFAULT(LargePageSizeInBytes))) { |
kvn@1973 | 310 | if (PrintCompressedOopsMode) { |
kvn@1973 | 311 | tty->cr(); |
kvn@1973 | 312 | tty->print_cr("Reserve regular memory without large pages."); |
kvn@1973 | 313 | } |
kvn@1973 | 314 | } |
duke@435 | 315 | } |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | if (base == NULL) { |
duke@435 | 319 | // Optimistically assume that the OSes returns an aligned base pointer. |
duke@435 | 320 | // When reserving a large address range, most OSes seem to align to at |
duke@435 | 321 | // least 64K. |
duke@435 | 322 | |
duke@435 | 323 | // If the memory was requested at a particular address, use |
duke@435 | 324 | // os::attempt_reserve_memory_at() to avoid over mapping something |
duke@435 | 325 | // important. If available space is not detected, return NULL. |
duke@435 | 326 | |
duke@435 | 327 | if (requested_address != 0) { |
kvn@1973 | 328 | base = os::attempt_reserve_memory_at(size, requested_address); |
kvn@1973 | 329 | if (failed_to_reserve_as_requested(base, requested_address, size, false)) { |
kvn@1973 | 330 | // OS ignored requested address. Try different address. |
kvn@1973 | 331 | base = NULL; |
kvn@1973 | 332 | } |
duke@435 | 333 | } else { |
duke@435 | 334 | base = os::reserve_memory(size, NULL, alignment); |
duke@435 | 335 | } |
duke@435 | 336 | |
duke@435 | 337 | if (base == NULL) return; |
duke@435 | 338 | |
duke@435 | 339 | // Check alignment constraints |
johnc@3022 | 340 | if ((((size_t)base + noaccess_prefix) & (alignment - 1)) != 0) { |
duke@435 | 341 | // Base not aligned, retry |
duke@435 | 342 | if (!os::release_memory(base, size)) fatal("os::release_memory failed"); |
duke@435 | 343 | // Reserve size large enough to do manual alignment and |
duke@435 | 344 | // increase size to a multiple of the desired alignment |
duke@435 | 345 | size = align_size_up(size, alignment); |
duke@435 | 346 | size_t extra_size = size + alignment; |
ysr@777 | 347 | do { |
ysr@777 | 348 | char* extra_base = os::reserve_memory(extra_size, NULL, alignment); |
ysr@777 | 349 | if (extra_base == NULL) return; |
ysr@777 | 350 | // Do manual alignement |
ysr@777 | 351 | base = (char*) align_size_up((uintptr_t) extra_base, alignment); |
ysr@777 | 352 | assert(base >= extra_base, "just checking"); |
ysr@777 | 353 | // Re-reserve the region at the aligned base address. |
ysr@777 | 354 | os::release_memory(extra_base, extra_size); |
ysr@777 | 355 | base = os::reserve_memory(size, base); |
ysr@777 | 356 | } while (base == NULL); |
johnc@3022 | 357 | |
johnc@3022 | 358 | if (requested_address != 0 && |
johnc@3022 | 359 | failed_to_reserve_as_requested(base, requested_address, size, false)) { |
johnc@3022 | 360 | // As a result of the alignment constraints, the allocated base differs |
johnc@3022 | 361 | // from the requested address. Return back to the caller who can |
johnc@3022 | 362 | // take remedial action (like try again without a requested address). |
johnc@3022 | 363 | assert(_base == NULL, "should be"); |
johnc@3022 | 364 | return; |
johnc@3022 | 365 | } |
duke@435 | 366 | } |
duke@435 | 367 | } |
duke@435 | 368 | // Done |
duke@435 | 369 | _base = base; |
duke@435 | 370 | _size = size; |
johnc@3022 | 371 | _alignment = alignment; |
coleenp@672 | 372 | _noaccess_prefix = noaccess_prefix; |
coleenp@672 | 373 | |
coleenp@672 | 374 | // Assert that if noaccess_prefix is used, it is the same as alignment. |
coleenp@672 | 375 | assert(noaccess_prefix == 0 || |
coleenp@672 | 376 | noaccess_prefix == _alignment, "noaccess prefix wrong"); |
duke@435 | 377 | |
duke@435 | 378 | assert(markOopDesc::encode_pointer_as_mark(_base)->decode_pointer() == _base, |
duke@435 | 379 | "area must be distinguisable from marks for mark-sweep"); |
duke@435 | 380 | assert(markOopDesc::encode_pointer_as_mark(&_base[size])->decode_pointer() == &_base[size], |
duke@435 | 381 | "area must be distinguisable from marks for mark-sweep"); |
duke@435 | 382 | } |
duke@435 | 383 | |
duke@435 | 384 | |
duke@435 | 385 | ReservedSpace::ReservedSpace(char* base, size_t size, size_t alignment, |
coleenp@1091 | 386 | bool special, bool executable) { |
duke@435 | 387 | assert((size % os::vm_allocation_granularity()) == 0, |
duke@435 | 388 | "size not allocation aligned"); |
duke@435 | 389 | _base = base; |
duke@435 | 390 | _size = size; |
duke@435 | 391 | _alignment = alignment; |
coleenp@672 | 392 | _noaccess_prefix = 0; |
duke@435 | 393 | _special = special; |
coleenp@1091 | 394 | _executable = executable; |
duke@435 | 395 | } |
duke@435 | 396 | |
duke@435 | 397 | |
duke@435 | 398 | ReservedSpace ReservedSpace::first_part(size_t partition_size, size_t alignment, |
duke@435 | 399 | bool split, bool realloc) { |
duke@435 | 400 | assert(partition_size <= size(), "partition failed"); |
duke@435 | 401 | if (split) { |
coleenp@1091 | 402 | os::split_reserved_memory(base(), size(), partition_size, realloc); |
duke@435 | 403 | } |
coleenp@1091 | 404 | ReservedSpace result(base(), partition_size, alignment, special(), |
coleenp@1091 | 405 | executable()); |
duke@435 | 406 | return result; |
duke@435 | 407 | } |
duke@435 | 408 | |
duke@435 | 409 | |
duke@435 | 410 | ReservedSpace |
duke@435 | 411 | ReservedSpace::last_part(size_t partition_size, size_t alignment) { |
duke@435 | 412 | assert(partition_size <= size(), "partition failed"); |
duke@435 | 413 | ReservedSpace result(base() + partition_size, size() - partition_size, |
coleenp@1091 | 414 | alignment, special(), executable()); |
duke@435 | 415 | return result; |
duke@435 | 416 | } |
duke@435 | 417 | |
duke@435 | 418 | |
duke@435 | 419 | size_t ReservedSpace::page_align_size_up(size_t size) { |
duke@435 | 420 | return align_size_up(size, os::vm_page_size()); |
duke@435 | 421 | } |
duke@435 | 422 | |
duke@435 | 423 | |
duke@435 | 424 | size_t ReservedSpace::page_align_size_down(size_t size) { |
duke@435 | 425 | return align_size_down(size, os::vm_page_size()); |
duke@435 | 426 | } |
duke@435 | 427 | |
duke@435 | 428 | |
duke@435 | 429 | size_t ReservedSpace::allocation_align_size_up(size_t size) { |
duke@435 | 430 | return align_size_up(size, os::vm_allocation_granularity()); |
duke@435 | 431 | } |
duke@435 | 432 | |
duke@435 | 433 | |
duke@435 | 434 | size_t ReservedSpace::allocation_align_size_down(size_t size) { |
duke@435 | 435 | return align_size_down(size, os::vm_allocation_granularity()); |
duke@435 | 436 | } |
duke@435 | 437 | |
duke@435 | 438 | |
duke@435 | 439 | void ReservedSpace::release() { |
duke@435 | 440 | if (is_reserved()) { |
coleenp@672 | 441 | char *real_base = _base - _noaccess_prefix; |
coleenp@672 | 442 | const size_t real_size = _size + _noaccess_prefix; |
duke@435 | 443 | if (special()) { |
coleenp@672 | 444 | os::release_memory_special(real_base, real_size); |
duke@435 | 445 | } else{ |
coleenp@672 | 446 | os::release_memory(real_base, real_size); |
duke@435 | 447 | } |
duke@435 | 448 | _base = NULL; |
duke@435 | 449 | _size = 0; |
coleenp@672 | 450 | _noaccess_prefix = 0; |
duke@435 | 451 | _special = false; |
coleenp@1091 | 452 | _executable = false; |
duke@435 | 453 | } |
duke@435 | 454 | } |
duke@435 | 455 | |
coleenp@672 | 456 | void ReservedSpace::protect_noaccess_prefix(const size_t size) { |
kvn@1973 | 457 | assert( (_noaccess_prefix != 0) == (UseCompressedOops && _base != NULL && |
kvn@1973 | 458 | (size_t(_base + _size) > OopEncodingHeapMax) && |
kvn@1973 | 459 | Universe::narrow_oop_use_implicit_null_checks()), |
kvn@1973 | 460 | "noaccess_prefix should be used only with non zero based compressed oops"); |
kvn@1973 | 461 | |
kvn@1973 | 462 | // If there is no noaccess prefix, return. |
coleenp@672 | 463 | if (_noaccess_prefix == 0) return; |
coleenp@672 | 464 | |
coleenp@672 | 465 | assert(_noaccess_prefix >= (size_t)os::vm_page_size(), |
coleenp@672 | 466 | "must be at least page size big"); |
coleenp@672 | 467 | |
coleenp@672 | 468 | // Protect memory at the base of the allocated region. |
coleenp@672 | 469 | // If special, the page was committed (only matters on windows) |
coleenp@672 | 470 | if (!os::protect_memory(_base, _noaccess_prefix, os::MEM_PROT_NONE, |
coleenp@672 | 471 | _special)) { |
coleenp@672 | 472 | fatal("cannot protect protection page"); |
coleenp@672 | 473 | } |
kvn@1973 | 474 | if (PrintCompressedOopsMode) { |
kvn@1973 | 475 | tty->cr(); |
kvn@1973 | 476 | tty->print_cr("Protected page at the reserved heap base: " PTR_FORMAT " / " INTX_FORMAT " bytes", _base, _noaccess_prefix); |
kvn@1973 | 477 | } |
coleenp@672 | 478 | |
coleenp@672 | 479 | _base += _noaccess_prefix; |
coleenp@672 | 480 | _size -= _noaccess_prefix; |
coleenp@672 | 481 | assert((size == _size) && ((uintptr_t)_base % _alignment == 0), |
coleenp@672 | 482 | "must be exactly of required size and alignment"); |
coleenp@672 | 483 | } |
coleenp@672 | 484 | |
coleenp@672 | 485 | ReservedHeapSpace::ReservedHeapSpace(size_t size, size_t alignment, |
coleenp@672 | 486 | bool large, char* requested_address) : |
coleenp@672 | 487 | ReservedSpace(size, alignment, large, |
coleenp@672 | 488 | requested_address, |
kvn@1077 | 489 | (UseCompressedOops && (Universe::narrow_oop_base() != NULL) && |
kvn@1077 | 490 | Universe::narrow_oop_use_implicit_null_checks()) ? |
coleenp@760 | 491 | lcm(os::vm_page_size(), alignment) : 0) { |
coleenp@672 | 492 | // Only reserved space for the java heap should have a noaccess_prefix |
coleenp@672 | 493 | // if using compressed oops. |
coleenp@672 | 494 | protect_noaccess_prefix(size); |
coleenp@672 | 495 | } |
coleenp@672 | 496 | |
coleenp@672 | 497 | ReservedHeapSpace::ReservedHeapSpace(const size_t prefix_size, |
coleenp@672 | 498 | const size_t prefix_align, |
coleenp@672 | 499 | const size_t suffix_size, |
kvn@1077 | 500 | const size_t suffix_align, |
kvn@1077 | 501 | char* requested_address) : |
coleenp@672 | 502 | ReservedSpace(prefix_size, prefix_align, suffix_size, suffix_align, |
kvn@1077 | 503 | requested_address, |
kvn@1077 | 504 | (UseCompressedOops && (Universe::narrow_oop_base() != NULL) && |
kvn@1077 | 505 | Universe::narrow_oop_use_implicit_null_checks()) ? |
coleenp@760 | 506 | lcm(os::vm_page_size(), prefix_align) : 0) { |
coleenp@672 | 507 | protect_noaccess_prefix(prefix_size+suffix_size); |
coleenp@672 | 508 | } |
duke@435 | 509 | |
coleenp@1091 | 510 | // Reserve space for code segment. Same as Java heap only we mark this as |
coleenp@1091 | 511 | // executable. |
coleenp@1091 | 512 | ReservedCodeSpace::ReservedCodeSpace(size_t r_size, |
coleenp@1091 | 513 | size_t rs_align, |
coleenp@1091 | 514 | bool large) : |
coleenp@1091 | 515 | ReservedSpace(r_size, rs_align, large, /*executable*/ true) { |
coleenp@1091 | 516 | } |
coleenp@1091 | 517 | |
duke@435 | 518 | // VirtualSpace |
duke@435 | 519 | |
duke@435 | 520 | VirtualSpace::VirtualSpace() { |
duke@435 | 521 | _low_boundary = NULL; |
duke@435 | 522 | _high_boundary = NULL; |
duke@435 | 523 | _low = NULL; |
duke@435 | 524 | _high = NULL; |
duke@435 | 525 | _lower_high = NULL; |
duke@435 | 526 | _middle_high = NULL; |
duke@435 | 527 | _upper_high = NULL; |
duke@435 | 528 | _lower_high_boundary = NULL; |
duke@435 | 529 | _middle_high_boundary = NULL; |
duke@435 | 530 | _upper_high_boundary = NULL; |
duke@435 | 531 | _lower_alignment = 0; |
duke@435 | 532 | _middle_alignment = 0; |
duke@435 | 533 | _upper_alignment = 0; |
coleenp@672 | 534 | _special = false; |
coleenp@1091 | 535 | _executable = false; |
duke@435 | 536 | } |
duke@435 | 537 | |
duke@435 | 538 | |
duke@435 | 539 | bool VirtualSpace::initialize(ReservedSpace rs, size_t committed_size) { |
duke@435 | 540 | if(!rs.is_reserved()) return false; // allocation failed. |
duke@435 | 541 | assert(_low_boundary == NULL, "VirtualSpace already initialized"); |
duke@435 | 542 | _low_boundary = rs.base(); |
duke@435 | 543 | _high_boundary = low_boundary() + rs.size(); |
duke@435 | 544 | |
duke@435 | 545 | _low = low_boundary(); |
duke@435 | 546 | _high = low(); |
duke@435 | 547 | |
duke@435 | 548 | _special = rs.special(); |
coleenp@1091 | 549 | _executable = rs.executable(); |
duke@435 | 550 | |
duke@435 | 551 | // When a VirtualSpace begins life at a large size, make all future expansion |
duke@435 | 552 | // and shrinking occur aligned to a granularity of large pages. This avoids |
duke@435 | 553 | // fragmentation of physical addresses that inhibits the use of large pages |
duke@435 | 554 | // by the OS virtual memory system. Empirically, we see that with a 4MB |
duke@435 | 555 | // page size, the only spaces that get handled this way are codecache and |
duke@435 | 556 | // the heap itself, both of which provide a substantial performance |
duke@435 | 557 | // boost in many benchmarks when covered by large pages. |
duke@435 | 558 | // |
duke@435 | 559 | // No attempt is made to force large page alignment at the very top and |
duke@435 | 560 | // bottom of the space if they are not aligned so already. |
duke@435 | 561 | _lower_alignment = os::vm_page_size(); |
duke@435 | 562 | _middle_alignment = os::page_size_for_region(rs.size(), rs.size(), 1); |
duke@435 | 563 | _upper_alignment = os::vm_page_size(); |
duke@435 | 564 | |
duke@435 | 565 | // End of each region |
duke@435 | 566 | _lower_high_boundary = (char*) round_to((intptr_t) low_boundary(), middle_alignment()); |
duke@435 | 567 | _middle_high_boundary = (char*) round_down((intptr_t) high_boundary(), middle_alignment()); |
duke@435 | 568 | _upper_high_boundary = high_boundary(); |
duke@435 | 569 | |
duke@435 | 570 | // High address of each region |
duke@435 | 571 | _lower_high = low_boundary(); |
duke@435 | 572 | _middle_high = lower_high_boundary(); |
duke@435 | 573 | _upper_high = middle_high_boundary(); |
duke@435 | 574 | |
duke@435 | 575 | // commit to initial size |
duke@435 | 576 | if (committed_size > 0) { |
duke@435 | 577 | if (!expand_by(committed_size)) { |
duke@435 | 578 | return false; |
duke@435 | 579 | } |
duke@435 | 580 | } |
duke@435 | 581 | return true; |
duke@435 | 582 | } |
duke@435 | 583 | |
duke@435 | 584 | |
duke@435 | 585 | VirtualSpace::~VirtualSpace() { |
duke@435 | 586 | release(); |
duke@435 | 587 | } |
duke@435 | 588 | |
duke@435 | 589 | |
duke@435 | 590 | void VirtualSpace::release() { |
coleenp@672 | 591 | // This does not release memory it never reserved. |
coleenp@672 | 592 | // Caller must release via rs.release(); |
duke@435 | 593 | _low_boundary = NULL; |
duke@435 | 594 | _high_boundary = NULL; |
duke@435 | 595 | _low = NULL; |
duke@435 | 596 | _high = NULL; |
duke@435 | 597 | _lower_high = NULL; |
duke@435 | 598 | _middle_high = NULL; |
duke@435 | 599 | _upper_high = NULL; |
duke@435 | 600 | _lower_high_boundary = NULL; |
duke@435 | 601 | _middle_high_boundary = NULL; |
duke@435 | 602 | _upper_high_boundary = NULL; |
duke@435 | 603 | _lower_alignment = 0; |
duke@435 | 604 | _middle_alignment = 0; |
duke@435 | 605 | _upper_alignment = 0; |
duke@435 | 606 | _special = false; |
coleenp@1091 | 607 | _executable = false; |
duke@435 | 608 | } |
duke@435 | 609 | |
duke@435 | 610 | |
duke@435 | 611 | size_t VirtualSpace::committed_size() const { |
duke@435 | 612 | return pointer_delta(high(), low(), sizeof(char)); |
duke@435 | 613 | } |
duke@435 | 614 | |
duke@435 | 615 | |
duke@435 | 616 | size_t VirtualSpace::reserved_size() const { |
duke@435 | 617 | return pointer_delta(high_boundary(), low_boundary(), sizeof(char)); |
duke@435 | 618 | } |
duke@435 | 619 | |
duke@435 | 620 | |
duke@435 | 621 | size_t VirtualSpace::uncommitted_size() const { |
duke@435 | 622 | return reserved_size() - committed_size(); |
duke@435 | 623 | } |
duke@435 | 624 | |
duke@435 | 625 | |
duke@435 | 626 | bool VirtualSpace::contains(const void* p) const { |
duke@435 | 627 | return low() <= (const char*) p && (const char*) p < high(); |
duke@435 | 628 | } |
duke@435 | 629 | |
duke@435 | 630 | /* |
duke@435 | 631 | First we need to determine if a particular virtual space is using large |
duke@435 | 632 | pages. This is done at the initialize function and only virtual spaces |
duke@435 | 633 | that are larger than LargePageSizeInBytes use large pages. Once we |
duke@435 | 634 | have determined this, all expand_by and shrink_by calls must grow and |
duke@435 | 635 | shrink by large page size chunks. If a particular request |
duke@435 | 636 | is within the current large page, the call to commit and uncommit memory |
duke@435 | 637 | can be ignored. In the case that the low and high boundaries of this |
duke@435 | 638 | space is not large page aligned, the pages leading to the first large |
duke@435 | 639 | page address and the pages after the last large page address must be |
duke@435 | 640 | allocated with default pages. |
duke@435 | 641 | */ |
duke@435 | 642 | bool VirtualSpace::expand_by(size_t bytes, bool pre_touch) { |
duke@435 | 643 | if (uncommitted_size() < bytes) return false; |
duke@435 | 644 | |
duke@435 | 645 | if (special()) { |
duke@435 | 646 | // don't commit memory if the entire space is pinned in memory |
duke@435 | 647 | _high += bytes; |
duke@435 | 648 | return true; |
duke@435 | 649 | } |
duke@435 | 650 | |
duke@435 | 651 | char* previous_high = high(); |
duke@435 | 652 | char* unaligned_new_high = high() + bytes; |
duke@435 | 653 | assert(unaligned_new_high <= high_boundary(), |
duke@435 | 654 | "cannot expand by more than upper boundary"); |
duke@435 | 655 | |
duke@435 | 656 | // Calculate where the new high for each of the regions should be. If |
duke@435 | 657 | // the low_boundary() and high_boundary() are LargePageSizeInBytes aligned |
duke@435 | 658 | // then the unaligned lower and upper new highs would be the |
duke@435 | 659 | // lower_high() and upper_high() respectively. |
duke@435 | 660 | char* unaligned_lower_new_high = |
duke@435 | 661 | MIN2(unaligned_new_high, lower_high_boundary()); |
duke@435 | 662 | char* unaligned_middle_new_high = |
duke@435 | 663 | MIN2(unaligned_new_high, middle_high_boundary()); |
duke@435 | 664 | char* unaligned_upper_new_high = |
duke@435 | 665 | MIN2(unaligned_new_high, upper_high_boundary()); |
duke@435 | 666 | |
duke@435 | 667 | // Align the new highs based on the regions alignment. lower and upper |
duke@435 | 668 | // alignment will always be default page size. middle alignment will be |
duke@435 | 669 | // LargePageSizeInBytes if the actual size of the virtual space is in |
duke@435 | 670 | // fact larger than LargePageSizeInBytes. |
duke@435 | 671 | char* aligned_lower_new_high = |
duke@435 | 672 | (char*) round_to((intptr_t) unaligned_lower_new_high, lower_alignment()); |
duke@435 | 673 | char* aligned_middle_new_high = |
duke@435 | 674 | (char*) round_to((intptr_t) unaligned_middle_new_high, middle_alignment()); |
duke@435 | 675 | char* aligned_upper_new_high = |
duke@435 | 676 | (char*) round_to((intptr_t) unaligned_upper_new_high, upper_alignment()); |
duke@435 | 677 | |
duke@435 | 678 | // Determine which regions need to grow in this expand_by call. |
duke@435 | 679 | // If you are growing in the lower region, high() must be in that |
duke@435 | 680 | // region so calcuate the size based on high(). For the middle and |
duke@435 | 681 | // upper regions, determine the starting point of growth based on the |
duke@435 | 682 | // location of high(). By getting the MAX of the region's low address |
duke@435 | 683 | // (or the prevoius region's high address) and high(), we can tell if it |
duke@435 | 684 | // is an intra or inter region growth. |
duke@435 | 685 | size_t lower_needs = 0; |
duke@435 | 686 | if (aligned_lower_new_high > lower_high()) { |
duke@435 | 687 | lower_needs = |
duke@435 | 688 | pointer_delta(aligned_lower_new_high, lower_high(), sizeof(char)); |
duke@435 | 689 | } |
duke@435 | 690 | size_t middle_needs = 0; |
duke@435 | 691 | if (aligned_middle_new_high > middle_high()) { |
duke@435 | 692 | middle_needs = |
duke@435 | 693 | pointer_delta(aligned_middle_new_high, middle_high(), sizeof(char)); |
duke@435 | 694 | } |
duke@435 | 695 | size_t upper_needs = 0; |
duke@435 | 696 | if (aligned_upper_new_high > upper_high()) { |
duke@435 | 697 | upper_needs = |
duke@435 | 698 | pointer_delta(aligned_upper_new_high, upper_high(), sizeof(char)); |
duke@435 | 699 | } |
duke@435 | 700 | |
duke@435 | 701 | // Check contiguity. |
duke@435 | 702 | assert(low_boundary() <= lower_high() && |
duke@435 | 703 | lower_high() <= lower_high_boundary(), |
duke@435 | 704 | "high address must be contained within the region"); |
duke@435 | 705 | assert(lower_high_boundary() <= middle_high() && |
duke@435 | 706 | middle_high() <= middle_high_boundary(), |
duke@435 | 707 | "high address must be contained within the region"); |
duke@435 | 708 | assert(middle_high_boundary() <= upper_high() && |
duke@435 | 709 | upper_high() <= upper_high_boundary(), |
duke@435 | 710 | "high address must be contained within the region"); |
duke@435 | 711 | |
duke@435 | 712 | // Commit regions |
duke@435 | 713 | if (lower_needs > 0) { |
duke@435 | 714 | assert(low_boundary() <= lower_high() && |
duke@435 | 715 | lower_high() + lower_needs <= lower_high_boundary(), |
duke@435 | 716 | "must not expand beyond region"); |
coleenp@1091 | 717 | if (!os::commit_memory(lower_high(), lower_needs, _executable)) { |
duke@435 | 718 | debug_only(warning("os::commit_memory failed")); |
duke@435 | 719 | return false; |
duke@435 | 720 | } else { |
duke@435 | 721 | _lower_high += lower_needs; |
duke@435 | 722 | } |
duke@435 | 723 | } |
duke@435 | 724 | if (middle_needs > 0) { |
duke@435 | 725 | assert(lower_high_boundary() <= middle_high() && |
duke@435 | 726 | middle_high() + middle_needs <= middle_high_boundary(), |
duke@435 | 727 | "must not expand beyond region"); |
coleenp@1091 | 728 | if (!os::commit_memory(middle_high(), middle_needs, middle_alignment(), |
coleenp@1091 | 729 | _executable)) { |
duke@435 | 730 | debug_only(warning("os::commit_memory failed")); |
duke@435 | 731 | return false; |
duke@435 | 732 | } |
duke@435 | 733 | _middle_high += middle_needs; |
duke@435 | 734 | } |
duke@435 | 735 | if (upper_needs > 0) { |
duke@435 | 736 | assert(middle_high_boundary() <= upper_high() && |
duke@435 | 737 | upper_high() + upper_needs <= upper_high_boundary(), |
duke@435 | 738 | "must not expand beyond region"); |
coleenp@1091 | 739 | if (!os::commit_memory(upper_high(), upper_needs, _executable)) { |
duke@435 | 740 | debug_only(warning("os::commit_memory failed")); |
duke@435 | 741 | return false; |
duke@435 | 742 | } else { |
duke@435 | 743 | _upper_high += upper_needs; |
duke@435 | 744 | } |
duke@435 | 745 | } |
duke@435 | 746 | |
duke@435 | 747 | if (pre_touch || AlwaysPreTouch) { |
duke@435 | 748 | int vm_ps = os::vm_page_size(); |
duke@435 | 749 | for (char* curr = previous_high; |
duke@435 | 750 | curr < unaligned_new_high; |
duke@435 | 751 | curr += vm_ps) { |
duke@435 | 752 | // Note the use of a write here; originally we tried just a read, but |
duke@435 | 753 | // since the value read was unused, the optimizer removed the read. |
duke@435 | 754 | // If we ever have a concurrent touchahead thread, we'll want to use |
duke@435 | 755 | // a read, to avoid the potential of overwriting data (if a mutator |
duke@435 | 756 | // thread beats the touchahead thread to a page). There are various |
duke@435 | 757 | // ways of making sure this read is not optimized away: for example, |
duke@435 | 758 | // generating the code for a read procedure at runtime. |
duke@435 | 759 | *curr = 0; |
duke@435 | 760 | } |
duke@435 | 761 | } |
duke@435 | 762 | |
duke@435 | 763 | _high += bytes; |
duke@435 | 764 | return true; |
duke@435 | 765 | } |
duke@435 | 766 | |
duke@435 | 767 | // A page is uncommitted if the contents of the entire page is deemed unusable. |
duke@435 | 768 | // Continue to decrement the high() pointer until it reaches a page boundary |
duke@435 | 769 | // in which case that particular page can now be uncommitted. |
duke@435 | 770 | void VirtualSpace::shrink_by(size_t size) { |
duke@435 | 771 | if (committed_size() < size) |
duke@435 | 772 | fatal("Cannot shrink virtual space to negative size"); |
duke@435 | 773 | |
duke@435 | 774 | if (special()) { |
duke@435 | 775 | // don't uncommit if the entire space is pinned in memory |
duke@435 | 776 | _high -= size; |
duke@435 | 777 | return; |
duke@435 | 778 | } |
duke@435 | 779 | |
duke@435 | 780 | char* unaligned_new_high = high() - size; |
duke@435 | 781 | assert(unaligned_new_high >= low_boundary(), "cannot shrink past lower boundary"); |
duke@435 | 782 | |
duke@435 | 783 | // Calculate new unaligned address |
duke@435 | 784 | char* unaligned_upper_new_high = |
duke@435 | 785 | MAX2(unaligned_new_high, middle_high_boundary()); |
duke@435 | 786 | char* unaligned_middle_new_high = |
duke@435 | 787 | MAX2(unaligned_new_high, lower_high_boundary()); |
duke@435 | 788 | char* unaligned_lower_new_high = |
duke@435 | 789 | MAX2(unaligned_new_high, low_boundary()); |
duke@435 | 790 | |
duke@435 | 791 | // Align address to region's alignment |
duke@435 | 792 | char* aligned_upper_new_high = |
duke@435 | 793 | (char*) round_to((intptr_t) unaligned_upper_new_high, upper_alignment()); |
duke@435 | 794 | char* aligned_middle_new_high = |
duke@435 | 795 | (char*) round_to((intptr_t) unaligned_middle_new_high, middle_alignment()); |
duke@435 | 796 | char* aligned_lower_new_high = |
duke@435 | 797 | (char*) round_to((intptr_t) unaligned_lower_new_high, lower_alignment()); |
duke@435 | 798 | |
duke@435 | 799 | // Determine which regions need to shrink |
duke@435 | 800 | size_t upper_needs = 0; |
duke@435 | 801 | if (aligned_upper_new_high < upper_high()) { |
duke@435 | 802 | upper_needs = |
duke@435 | 803 | pointer_delta(upper_high(), aligned_upper_new_high, sizeof(char)); |
duke@435 | 804 | } |
duke@435 | 805 | size_t middle_needs = 0; |
duke@435 | 806 | if (aligned_middle_new_high < middle_high()) { |
duke@435 | 807 | middle_needs = |
duke@435 | 808 | pointer_delta(middle_high(), aligned_middle_new_high, sizeof(char)); |
duke@435 | 809 | } |
duke@435 | 810 | size_t lower_needs = 0; |
duke@435 | 811 | if (aligned_lower_new_high < lower_high()) { |
duke@435 | 812 | lower_needs = |
duke@435 | 813 | pointer_delta(lower_high(), aligned_lower_new_high, sizeof(char)); |
duke@435 | 814 | } |
duke@435 | 815 | |
duke@435 | 816 | // Check contiguity. |
duke@435 | 817 | assert(middle_high_boundary() <= upper_high() && |
duke@435 | 818 | upper_high() <= upper_high_boundary(), |
duke@435 | 819 | "high address must be contained within the region"); |
duke@435 | 820 | assert(lower_high_boundary() <= middle_high() && |
duke@435 | 821 | middle_high() <= middle_high_boundary(), |
duke@435 | 822 | "high address must be contained within the region"); |
duke@435 | 823 | assert(low_boundary() <= lower_high() && |
duke@435 | 824 | lower_high() <= lower_high_boundary(), |
duke@435 | 825 | "high address must be contained within the region"); |
duke@435 | 826 | |
duke@435 | 827 | // Uncommit |
duke@435 | 828 | if (upper_needs > 0) { |
duke@435 | 829 | assert(middle_high_boundary() <= aligned_upper_new_high && |
duke@435 | 830 | aligned_upper_new_high + upper_needs <= upper_high_boundary(), |
duke@435 | 831 | "must not shrink beyond region"); |
duke@435 | 832 | if (!os::uncommit_memory(aligned_upper_new_high, upper_needs)) { |
duke@435 | 833 | debug_only(warning("os::uncommit_memory failed")); |
duke@435 | 834 | return; |
duke@435 | 835 | } else { |
duke@435 | 836 | _upper_high -= upper_needs; |
duke@435 | 837 | } |
duke@435 | 838 | } |
duke@435 | 839 | if (middle_needs > 0) { |
duke@435 | 840 | assert(lower_high_boundary() <= aligned_middle_new_high && |
duke@435 | 841 | aligned_middle_new_high + middle_needs <= middle_high_boundary(), |
duke@435 | 842 | "must not shrink beyond region"); |
duke@435 | 843 | if (!os::uncommit_memory(aligned_middle_new_high, middle_needs)) { |
duke@435 | 844 | debug_only(warning("os::uncommit_memory failed")); |
duke@435 | 845 | return; |
duke@435 | 846 | } else { |
duke@435 | 847 | _middle_high -= middle_needs; |
duke@435 | 848 | } |
duke@435 | 849 | } |
duke@435 | 850 | if (lower_needs > 0) { |
duke@435 | 851 | assert(low_boundary() <= aligned_lower_new_high && |
duke@435 | 852 | aligned_lower_new_high + lower_needs <= lower_high_boundary(), |
duke@435 | 853 | "must not shrink beyond region"); |
duke@435 | 854 | if (!os::uncommit_memory(aligned_lower_new_high, lower_needs)) { |
duke@435 | 855 | debug_only(warning("os::uncommit_memory failed")); |
duke@435 | 856 | return; |
duke@435 | 857 | } else { |
duke@435 | 858 | _lower_high -= lower_needs; |
duke@435 | 859 | } |
duke@435 | 860 | } |
duke@435 | 861 | |
duke@435 | 862 | _high -= size; |
duke@435 | 863 | } |
duke@435 | 864 | |
duke@435 | 865 | #ifndef PRODUCT |
duke@435 | 866 | void VirtualSpace::check_for_contiguity() { |
duke@435 | 867 | // Check contiguity. |
duke@435 | 868 | assert(low_boundary() <= lower_high() && |
duke@435 | 869 | lower_high() <= lower_high_boundary(), |
duke@435 | 870 | "high address must be contained within the region"); |
duke@435 | 871 | assert(lower_high_boundary() <= middle_high() && |
duke@435 | 872 | middle_high() <= middle_high_boundary(), |
duke@435 | 873 | "high address must be contained within the region"); |
duke@435 | 874 | assert(middle_high_boundary() <= upper_high() && |
duke@435 | 875 | upper_high() <= upper_high_boundary(), |
duke@435 | 876 | "high address must be contained within the region"); |
duke@435 | 877 | assert(low() >= low_boundary(), "low"); |
duke@435 | 878 | assert(low_boundary() <= lower_high_boundary(), "lower high boundary"); |
duke@435 | 879 | assert(upper_high_boundary() <= high_boundary(), "upper high boundary"); |
duke@435 | 880 | assert(high() <= upper_high(), "upper high"); |
duke@435 | 881 | } |
duke@435 | 882 | |
duke@435 | 883 | void VirtualSpace::print() { |
duke@435 | 884 | tty->print ("Virtual space:"); |
duke@435 | 885 | if (special()) tty->print(" (pinned in memory)"); |
duke@435 | 886 | tty->cr(); |
duke@435 | 887 | tty->print_cr(" - committed: %ld", committed_size()); |
duke@435 | 888 | tty->print_cr(" - reserved: %ld", reserved_size()); |
duke@435 | 889 | tty->print_cr(" - [low, high]: [" INTPTR_FORMAT ", " INTPTR_FORMAT "]", low(), high()); |
duke@435 | 890 | tty->print_cr(" - [low_b, high_b]: [" INTPTR_FORMAT ", " INTPTR_FORMAT "]", low_boundary(), high_boundary()); |
duke@435 | 891 | } |
duke@435 | 892 | |
duke@435 | 893 | #endif |