Tue, 08 Aug 2017 15:57:29 +0800
merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | #include "precompiled.hpp" |
aoqi@0 | 26 | #include "utilities/macros.hpp" |
aoqi@0 | 27 | #if INCLUDE_ALL_GCS |
aoqi@0 | 28 | #include "gc_implementation/shared/mutableSpace.hpp" |
aoqi@0 | 29 | #include "gc_implementation/shared/spaceDecorator.hpp" |
aoqi@0 | 30 | #include "oops/oop.inline.hpp" |
aoqi@0 | 31 | #include "runtime/safepoint.hpp" |
aoqi@0 | 32 | #include "runtime/thread.hpp" |
aoqi@0 | 33 | #endif // INCLUDE_ALL_GCS |
aoqi@0 | 34 | |
aoqi@0 | 35 | PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC |
aoqi@0 | 36 | |
aoqi@0 | 37 | MutableSpace::MutableSpace(size_t alignment): ImmutableSpace(), _top(NULL), _alignment(alignment) { |
aoqi@0 | 38 | assert(MutableSpace::alignment() >= 0 && |
aoqi@0 | 39 | MutableSpace::alignment() % os::vm_page_size() == 0, |
aoqi@0 | 40 | "Space should be aligned"); |
aoqi@0 | 41 | _mangler = new MutableSpaceMangler(this); |
aoqi@0 | 42 | } |
aoqi@0 | 43 | |
aoqi@0 | 44 | MutableSpace::~MutableSpace() { |
aoqi@0 | 45 | delete _mangler; |
aoqi@0 | 46 | } |
aoqi@0 | 47 | |
aoqi@0 | 48 | void MutableSpace::numa_setup_pages(MemRegion mr, bool clear_space) { |
aoqi@0 | 49 | if (!mr.is_empty()) { |
aoqi@0 | 50 | size_t page_size = UseLargePages ? alignment() : os::vm_page_size(); |
aoqi@0 | 51 | HeapWord *start = (HeapWord*)round_to((intptr_t) mr.start(), page_size); |
aoqi@0 | 52 | HeapWord *end = (HeapWord*)round_down((intptr_t) mr.end(), page_size); |
aoqi@0 | 53 | if (end > start) { |
aoqi@0 | 54 | size_t size = pointer_delta(end, start, sizeof(char)); |
aoqi@0 | 55 | if (clear_space) { |
aoqi@0 | 56 | // Prefer page reallocation to migration. |
aoqi@0 | 57 | os::free_memory((char*)start, size, page_size); |
aoqi@0 | 58 | } |
aoqi@0 | 59 | os::numa_make_global((char*)start, size); |
aoqi@0 | 60 | } |
aoqi@0 | 61 | } |
aoqi@0 | 62 | } |
aoqi@0 | 63 | |
aoqi@0 | 64 | void MutableSpace::pretouch_pages(MemRegion mr) { |
aoqi@0 | 65 | for (volatile char *p = (char*)mr.start(); p < (char*)mr.end(); p += os::vm_page_size()) { |
aoqi@0 | 66 | char t = *p; *p = t; |
aoqi@0 | 67 | } |
aoqi@0 | 68 | } |
aoqi@0 | 69 | |
aoqi@0 | 70 | void MutableSpace::initialize(MemRegion mr, |
aoqi@0 | 71 | bool clear_space, |
aoqi@0 | 72 | bool mangle_space, |
aoqi@0 | 73 | bool setup_pages) { |
aoqi@0 | 74 | |
aoqi@0 | 75 | assert(Universe::on_page_boundary(mr.start()) && Universe::on_page_boundary(mr.end()), |
aoqi@0 | 76 | "invalid space boundaries"); |
aoqi@0 | 77 | |
aoqi@0 | 78 | if (setup_pages && (UseNUMA || AlwaysPreTouch)) { |
aoqi@0 | 79 | // The space may move left and right or expand/shrink. |
aoqi@0 | 80 | // We'd like to enforce the desired page placement. |
aoqi@0 | 81 | MemRegion head, tail; |
aoqi@0 | 82 | if (last_setup_region().is_empty()) { |
aoqi@0 | 83 | // If it's the first initialization don't limit the amount of work. |
aoqi@0 | 84 | head = mr; |
aoqi@0 | 85 | tail = MemRegion(mr.end(), mr.end()); |
aoqi@0 | 86 | } else { |
aoqi@0 | 87 | // Is there an intersection with the address space? |
aoqi@0 | 88 | MemRegion intersection = last_setup_region().intersection(mr); |
aoqi@0 | 89 | if (intersection.is_empty()) { |
aoqi@0 | 90 | intersection = MemRegion(mr.end(), mr.end()); |
aoqi@0 | 91 | } |
aoqi@0 | 92 | // All the sizes below are in words. |
aoqi@0 | 93 | size_t head_size = 0, tail_size = 0; |
aoqi@0 | 94 | if (mr.start() <= intersection.start()) { |
aoqi@0 | 95 | head_size = pointer_delta(intersection.start(), mr.start()); |
aoqi@0 | 96 | } |
aoqi@0 | 97 | if(intersection.end() <= mr.end()) { |
aoqi@0 | 98 | tail_size = pointer_delta(mr.end(), intersection.end()); |
aoqi@0 | 99 | } |
aoqi@0 | 100 | // Limit the amount of page manipulation if necessary. |
aoqi@0 | 101 | if (NUMASpaceResizeRate > 0 && !AlwaysPreTouch) { |
aoqi@0 | 102 | const size_t change_size = head_size + tail_size; |
aoqi@0 | 103 | const float setup_rate_words = NUMASpaceResizeRate >> LogBytesPerWord; |
aoqi@0 | 104 | head_size = MIN2((size_t)(setup_rate_words * head_size / change_size), |
aoqi@0 | 105 | head_size); |
aoqi@0 | 106 | tail_size = MIN2((size_t)(setup_rate_words * tail_size / change_size), |
aoqi@0 | 107 | tail_size); |
aoqi@0 | 108 | } |
aoqi@0 | 109 | head = MemRegion(intersection.start() - head_size, intersection.start()); |
aoqi@0 | 110 | tail = MemRegion(intersection.end(), intersection.end() + tail_size); |
aoqi@0 | 111 | } |
aoqi@0 | 112 | assert(mr.contains(head) && mr.contains(tail), "Sanity"); |
aoqi@0 | 113 | |
aoqi@0 | 114 | if (UseNUMA) { |
aoqi@0 | 115 | numa_setup_pages(head, clear_space); |
aoqi@0 | 116 | numa_setup_pages(tail, clear_space); |
aoqi@0 | 117 | } |
aoqi@0 | 118 | |
aoqi@0 | 119 | if (AlwaysPreTouch) { |
aoqi@0 | 120 | pretouch_pages(head); |
aoqi@0 | 121 | pretouch_pages(tail); |
aoqi@0 | 122 | } |
aoqi@0 | 123 | |
aoqi@0 | 124 | // Remember where we stopped so that we can continue later. |
aoqi@0 | 125 | set_last_setup_region(MemRegion(head.start(), tail.end())); |
aoqi@0 | 126 | } |
aoqi@0 | 127 | |
aoqi@0 | 128 | set_bottom(mr.start()); |
aoqi@0 | 129 | set_end(mr.end()); |
aoqi@0 | 130 | |
aoqi@0 | 131 | if (clear_space) { |
aoqi@0 | 132 | clear(mangle_space); |
aoqi@0 | 133 | } |
aoqi@0 | 134 | } |
aoqi@0 | 135 | |
aoqi@0 | 136 | void MutableSpace::clear(bool mangle_space) { |
aoqi@0 | 137 | set_top(bottom()); |
aoqi@0 | 138 | if (ZapUnusedHeapArea && mangle_space) { |
aoqi@0 | 139 | mangle_unused_area(); |
aoqi@0 | 140 | } |
aoqi@0 | 141 | } |
aoqi@0 | 142 | |
aoqi@0 | 143 | #ifndef PRODUCT |
aoqi@0 | 144 | void MutableSpace::check_mangled_unused_area(HeapWord* limit) { |
aoqi@0 | 145 | mangler()->check_mangled_unused_area(limit); |
aoqi@0 | 146 | } |
aoqi@0 | 147 | |
aoqi@0 | 148 | void MutableSpace::check_mangled_unused_area_complete() { |
aoqi@0 | 149 | mangler()->check_mangled_unused_area_complete(); |
aoqi@0 | 150 | } |
aoqi@0 | 151 | |
aoqi@0 | 152 | // Mangle only the unused space that has not previously |
aoqi@0 | 153 | // been mangled and that has not been allocated since being |
aoqi@0 | 154 | // mangled. |
aoqi@0 | 155 | void MutableSpace::mangle_unused_area() { |
aoqi@0 | 156 | mangler()->mangle_unused_area(); |
aoqi@0 | 157 | } |
aoqi@0 | 158 | |
aoqi@0 | 159 | void MutableSpace::mangle_unused_area_complete() { |
aoqi@0 | 160 | mangler()->mangle_unused_area_complete(); |
aoqi@0 | 161 | } |
aoqi@0 | 162 | |
aoqi@0 | 163 | void MutableSpace::mangle_region(MemRegion mr) { |
aoqi@0 | 164 | SpaceMangler::mangle_region(mr); |
aoqi@0 | 165 | } |
aoqi@0 | 166 | |
aoqi@0 | 167 | void MutableSpace::set_top_for_allocations(HeapWord* v) { |
aoqi@0 | 168 | mangler()->set_top_for_allocations(v); |
aoqi@0 | 169 | } |
aoqi@0 | 170 | |
aoqi@0 | 171 | void MutableSpace::set_top_for_allocations() { |
aoqi@0 | 172 | mangler()->set_top_for_allocations(top()); |
aoqi@0 | 173 | } |
aoqi@0 | 174 | #endif |
aoqi@0 | 175 | |
aoqi@0 | 176 | // This version requires locking. */ |
aoqi@0 | 177 | HeapWord* MutableSpace::allocate(size_t size) { |
aoqi@0 | 178 | assert(Heap_lock->owned_by_self() || |
aoqi@0 | 179 | (SafepointSynchronize::is_at_safepoint() && |
aoqi@0 | 180 | Thread::current()->is_VM_thread()), |
aoqi@0 | 181 | "not locked"); |
aoqi@0 | 182 | HeapWord* obj = top(); |
aoqi@0 | 183 | if (pointer_delta(end(), obj) >= size) { |
aoqi@0 | 184 | HeapWord* new_top = obj + size; |
aoqi@0 | 185 | set_top(new_top); |
aoqi@0 | 186 | assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top), |
aoqi@0 | 187 | "checking alignment"); |
aoqi@0 | 188 | return obj; |
aoqi@0 | 189 | } else { |
aoqi@0 | 190 | return NULL; |
aoqi@0 | 191 | } |
aoqi@0 | 192 | } |
aoqi@0 | 193 | |
aoqi@0 | 194 | // This version is lock-free. |
aoqi@0 | 195 | HeapWord* MutableSpace::cas_allocate(size_t size) { |
aoqi@0 | 196 | do { |
aoqi@0 | 197 | HeapWord* obj = top(); |
aoqi@0 | 198 | if (pointer_delta(end(), obj) >= size) { |
aoqi@0 | 199 | HeapWord* new_top = obj + size; |
aoqi@0 | 200 | HeapWord* result = (HeapWord*)Atomic::cmpxchg_ptr(new_top, top_addr(), obj); |
aoqi@0 | 201 | // result can be one of two: |
aoqi@0 | 202 | // the old top value: the exchange succeeded |
aoqi@0 | 203 | // otherwise: the new value of the top is returned. |
aoqi@0 | 204 | if (result != obj) { |
aoqi@0 | 205 | continue; // another thread beat us to the allocation, try again |
aoqi@0 | 206 | } |
aoqi@0 | 207 | assert(is_object_aligned((intptr_t)obj) && is_object_aligned((intptr_t)new_top), |
aoqi@0 | 208 | "checking alignment"); |
aoqi@0 | 209 | return obj; |
aoqi@0 | 210 | } else { |
aoqi@0 | 211 | return NULL; |
aoqi@0 | 212 | } |
aoqi@0 | 213 | } while (true); |
aoqi@0 | 214 | } |
aoqi@0 | 215 | |
aoqi@0 | 216 | // Try to deallocate previous allocation. Returns true upon success. |
aoqi@0 | 217 | bool MutableSpace::cas_deallocate(HeapWord *obj, size_t size) { |
aoqi@0 | 218 | HeapWord* expected_top = obj + size; |
aoqi@0 | 219 | return (HeapWord*)Atomic::cmpxchg_ptr(obj, top_addr(), expected_top) == expected_top; |
aoqi@0 | 220 | } |
aoqi@0 | 221 | |
aoqi@0 | 222 | void MutableSpace::oop_iterate(ExtendedOopClosure* cl) { |
aoqi@0 | 223 | HeapWord* obj_addr = bottom(); |
aoqi@0 | 224 | HeapWord* t = top(); |
aoqi@0 | 225 | // Could call objects iterate, but this is easier. |
aoqi@0 | 226 | while (obj_addr < t) { |
aoqi@0 | 227 | obj_addr += oop(obj_addr)->oop_iterate(cl); |
aoqi@0 | 228 | } |
aoqi@0 | 229 | } |
aoqi@0 | 230 | |
aoqi@0 | 231 | void MutableSpace::oop_iterate_no_header(OopClosure* cl) { |
aoqi@0 | 232 | HeapWord* obj_addr = bottom(); |
aoqi@0 | 233 | HeapWord* t = top(); |
aoqi@0 | 234 | // Could call objects iterate, but this is easier. |
aoqi@0 | 235 | while (obj_addr < t) { |
aoqi@0 | 236 | obj_addr += oop(obj_addr)->oop_iterate_no_header(cl); |
aoqi@0 | 237 | } |
aoqi@0 | 238 | } |
aoqi@0 | 239 | |
aoqi@0 | 240 | void MutableSpace::object_iterate(ObjectClosure* cl) { |
aoqi@0 | 241 | HeapWord* p = bottom(); |
aoqi@0 | 242 | while (p < top()) { |
aoqi@0 | 243 | cl->do_object(oop(p)); |
aoqi@0 | 244 | p += oop(p)->size(); |
aoqi@0 | 245 | } |
aoqi@0 | 246 | } |
aoqi@0 | 247 | |
aoqi@0 | 248 | void MutableSpace::print_short() const { print_short_on(tty); } |
aoqi@0 | 249 | void MutableSpace::print_short_on( outputStream* st) const { |
aoqi@0 | 250 | st->print(" space " SIZE_FORMAT "K, %d%% used", capacity_in_bytes() / K, |
aoqi@0 | 251 | (int) ((double) used_in_bytes() * 100 / capacity_in_bytes())); |
aoqi@0 | 252 | } |
aoqi@0 | 253 | |
aoqi@0 | 254 | void MutableSpace::print() const { print_on(tty); } |
aoqi@0 | 255 | void MutableSpace::print_on(outputStream* st) const { |
aoqi@0 | 256 | MutableSpace::print_short_on(st); |
aoqi@0 | 257 | st->print_cr(" [" INTPTR_FORMAT "," INTPTR_FORMAT "," INTPTR_FORMAT ")", |
aoqi@0 | 258 | bottom(), top(), end()); |
aoqi@0 | 259 | } |
aoqi@0 | 260 | |
aoqi@0 | 261 | void MutableSpace::verify() { |
aoqi@0 | 262 | HeapWord* p = bottom(); |
aoqi@0 | 263 | HeapWord* t = top(); |
aoqi@0 | 264 | HeapWord* prev_p = NULL; |
aoqi@0 | 265 | while (p < t) { |
aoqi@0 | 266 | oop(p)->verify(); |
aoqi@0 | 267 | prev_p = p; |
aoqi@0 | 268 | p += oop(p)->size(); |
aoqi@0 | 269 | } |
aoqi@0 | 270 | guarantee(p == top(), "end of last object must match end of space"); |
aoqi@0 | 271 | } |