1 /* 2 * Copyright (c) 2001, 2016, 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 #ifndef SHARE_VM_GC_SHARED_COLLECTEDHEAP_INLINE_HPP 26 #define SHARE_VM_GC_SHARED_COLLECTEDHEAP_INLINE_HPP 27 28 #include "gc/shared/allocTracer.hpp" 29 #include "gc/shared/collectedHeap.hpp" 30 #include "gc/shared/threadLocalAllocBuffer.inline.hpp" 31 #include "memory/universe.hpp" 32 #include "oops/arrayOop.hpp" 33 #include "oops/oop.inline.hpp" 34 #include "prims/jvmtiExport.hpp" 35 #include "runtime/sharedRuntime.hpp" 36 #include "runtime/thread.inline.hpp" 37 #include "services/lowMemoryDetector.hpp" 38 #include "utilities/copy.hpp" 39 40 // Inline allocation implementations. 41 42 void CollectedHeap::post_allocation_setup_common(KlassHandle klass, 43 HeapWord* obj) { 44 post_allocation_setup_no_klass_install(klass, obj); 45 post_allocation_install_obj_klass(klass, oop(obj)); 46 } 47 48 void CollectedHeap::post_allocation_setup_no_klass_install(KlassHandle klass, 49 HeapWord* objPtr) { 50 oop obj = (oop)objPtr; 51 52 assert(obj != NULL, "NULL object pointer"); 53 if (UseBiasedLocking && (klass() != NULL)) { 54 obj->set_mark(klass->prototype_header()); 55 } else { 56 // May be bootstrapping 57 obj->set_mark(markOopDesc::prototype()); 58 } 59 } 60 61 void CollectedHeap::post_allocation_install_obj_klass(KlassHandle klass, 62 oop obj) { 63 // These asserts are kind of complicated because of klassKlass 64 // and the beginning of the world. 65 assert(klass() != NULL || !Universe::is_fully_initialized(), "NULL klass"); 66 assert(klass() == NULL || klass()->is_klass(), "not a klass"); 67 assert(obj != NULL, "NULL object pointer"); 68 obj->set_klass(klass()); 69 assert(!Universe::is_fully_initialized() || obj->klass() != NULL, 70 "missing klass"); 71 } 72 73 // Support for jvmti and dtrace 74 inline void post_allocation_notify(KlassHandle klass, oop obj, int size) { 75 // support low memory notifications (no-op if not enabled) 76 LowMemoryDetector::detect_low_memory_for_collected_pools(); 77 78 // support for JVMTI VMObjectAlloc event (no-op if not enabled) 79 JvmtiExport::vm_object_alloc_event_collector(obj); 80 81 if (DTraceAllocProbes) { 82 // support for Dtrace object alloc event (no-op most of the time) 83 if (klass() != NULL && klass()->name() != NULL) { 84 SharedRuntime::dtrace_object_alloc(obj, size); 85 } 86 } 87 } 88 89 void CollectedHeap::post_allocation_setup_obj(KlassHandle klass, 90 HeapWord* obj, 91 int size) { 92 post_allocation_setup_common(klass, obj); 93 assert(Universe::is_bootstrapping() || 94 !((oop)obj)->is_array(), "must not be an array"); 95 // notify jvmti and dtrace 96 post_allocation_notify(klass, (oop)obj, size); 97 } 98 99 void CollectedHeap::post_allocation_setup_array(KlassHandle klass, 100 HeapWord* obj, 101 int length) { 102 // Set array length before setting the _klass field 103 // in post_allocation_setup_common() because the klass field 104 // indicates that the object is parsable by concurrent GC. 105 assert(length >= 0, "length should be non-negative"); 106 ((arrayOop)obj)->set_length(length); 107 post_allocation_setup_common(klass, obj); 108 oop new_obj = (oop)obj; 109 assert(new_obj->is_array(), "must be an array"); 110 // notify jvmti and dtrace (must be after length is set for dtrace) 111 post_allocation_notify(klass, new_obj, new_obj->size()); 112 } 113 114 HeapWord* CollectedHeap::common_mem_allocate_noinit(KlassHandle klass, size_t size, TRAPS) { 115 116 // Clear unhandled oops for memory allocation. Memory allocation might 117 // not take out a lock if from tlab, so clear here. 118 CHECK_UNHANDLED_OOPS_ONLY(THREAD->clear_unhandled_oops();) 119 120 if (HAS_PENDING_EXCEPTION) { 121 NOT_PRODUCT(guarantee(false, "Should not allocate with exception pending")); 122 return NULL; // caller does a CHECK_0 too 123 } 124 125 HeapWord* result = NULL; 126 if (UseTLAB) { 127 result = allocate_from_tlab(klass, THREAD, size); 128 if (result != NULL) { 129 assert(!HAS_PENDING_EXCEPTION, 130 "Unexpected exception, will result in uninitialized storage"); 131 return result; 132 } 133 } 134 bool gc_overhead_limit_was_exceeded = false; 135 result = Universe::heap()->mem_allocate(size, 136 &gc_overhead_limit_was_exceeded); 137 if (result != NULL) { 138 NOT_PRODUCT(Universe::heap()-> 139 check_for_non_bad_heap_word_value(result, size)); 140 assert(!HAS_PENDING_EXCEPTION, 141 "Unexpected exception, will result in uninitialized storage"); 142 THREAD->incr_allocated_bytes(size * HeapWordSize); 143 144 AllocTracer::send_allocation_outside_tlab_event(klass, size * HeapWordSize); 145 146 return result; 147 } 148 149 150 if (!gc_overhead_limit_was_exceeded) { 151 // -XX:+HeapDumpOnOutOfMemoryError and -XX:OnOutOfMemoryError support 152 report_java_out_of_memory("Java heap space"); 153 154 if (JvmtiExport::should_post_resource_exhausted()) { 155 JvmtiExport::post_resource_exhausted( 156 JVMTI_RESOURCE_EXHAUSTED_OOM_ERROR | JVMTI_RESOURCE_EXHAUSTED_JAVA_HEAP, 157 "Java heap space"); 158 } 159 160 THROW_OOP_0(Universe::out_of_memory_error_java_heap()); 161 } else { 162 // -XX:+HeapDumpOnOutOfMemoryError and -XX:OnOutOfMemoryError support 163 report_java_out_of_memory("GC overhead limit exceeded"); 164 165 if (JvmtiExport::should_post_resource_exhausted()) { 166 JvmtiExport::post_resource_exhausted( 167 JVMTI_RESOURCE_EXHAUSTED_OOM_ERROR | JVMTI_RESOURCE_EXHAUSTED_JAVA_HEAP, 168 "GC overhead limit exceeded"); 169 } 170 171 THROW_OOP_0(Universe::out_of_memory_error_gc_overhead_limit()); 172 } 173 } 174 175 HeapWord* CollectedHeap::common_mem_allocate_init(KlassHandle klass, size_t size, TRAPS) { 176 HeapWord* obj = common_mem_allocate_noinit(klass, size, CHECK_NULL); 177 init_obj(obj, size); 178 return obj; 179 } 180 181 HeapWord* CollectedHeap::allocate_from_tlab(KlassHandle klass, Thread* thread, size_t size) { 182 assert(UseTLAB, "should use UseTLAB"); 183 184 HeapWord* obj = thread->tlab().allocate(size); 185 if (obj != NULL) { 186 return obj; 187 } 188 // Otherwise... 189 return allocate_from_tlab_slow(klass, thread, size); 190 } 191 192 void CollectedHeap::init_obj(HeapWord* obj, size_t size) { 193 assert(obj != NULL, "cannot initialize NULL object"); 194 const size_t hs = oopDesc::header_size(); 195 assert(size >= hs, "unexpected object size"); 196 ((oop)obj)->set_klass_gap(0); 197 Copy::fill_to_aligned_words(obj + hs, size - hs); 198 } 199 200 oop CollectedHeap::obj_allocate(KlassHandle klass, int size, TRAPS) { 201 debug_only(check_for_valid_allocation_state()); 202 assert(!Universe::heap()->is_gc_active(), "Allocation during gc not allowed"); 203 assert(size >= 0, "int won't convert to size_t"); 204 HeapWord* obj = common_mem_allocate_init(klass, size, CHECK_NULL); 205 post_allocation_setup_obj(klass, obj, size); 206 NOT_PRODUCT(Universe::heap()->check_for_bad_heap_word_value(obj, size)); 207 return (oop)obj; 208 } 209 210 oop CollectedHeap::array_allocate(KlassHandle klass, 211 int size, 212 int length, 213 TRAPS) { 214 debug_only(check_for_valid_allocation_state()); 215 assert(!Universe::heap()->is_gc_active(), "Allocation during gc not allowed"); 216 assert(size >= 0, "int won't convert to size_t"); 217 HeapWord* obj = common_mem_allocate_init(klass, size, CHECK_NULL); 218 post_allocation_setup_array(klass, obj, length); 219 NOT_PRODUCT(Universe::heap()->check_for_bad_heap_word_value(obj, size)); 220 return (oop)obj; 221 } 222 223 oop CollectedHeap::array_allocate_nozero(KlassHandle klass, 224 int size, 225 int length, 226 TRAPS) { 227 debug_only(check_for_valid_allocation_state()); 228 assert(!Universe::heap()->is_gc_active(), "Allocation during gc not allowed"); 229 assert(size >= 0, "int won't convert to size_t"); 230 HeapWord* obj = common_mem_allocate_noinit(klass, size, CHECK_NULL); 231 ((oop)obj)->set_klass_gap(0); 232 post_allocation_setup_array(klass, obj, length); 233 #ifndef PRODUCT 234 const size_t hs = oopDesc::header_size()+1; 235 Universe::heap()->check_for_non_bad_heap_word_value(obj+hs, size-hs); 236 #endif 237 return (oop)obj; 238 } 239 240 inline HeapWord* CollectedHeap::align_allocation_or_fail(HeapWord* addr, 241 HeapWord* end, 242 unsigned short alignment_in_bytes) { 243 if (alignment_in_bytes <= ObjectAlignmentInBytes) { 244 return addr; 245 } 246 247 assert(is_ptr_aligned(addr, HeapWordSize), 248 "Address " PTR_FORMAT " is not properly aligned.", p2i(addr)); 249 assert(is_size_aligned(alignment_in_bytes, HeapWordSize), 250 "Alignment size %u is incorrect.", alignment_in_bytes); 251 252 HeapWord* new_addr = (HeapWord*) align_ptr_up(addr, alignment_in_bytes); 253 size_t padding = pointer_delta(new_addr, addr); 254 255 if (padding == 0) { 256 return addr; 257 } 258 259 if (padding < CollectedHeap::min_fill_size()) { 260 padding += alignment_in_bytes / HeapWordSize; 261 assert(padding >= CollectedHeap::min_fill_size(), 262 "alignment_in_bytes %u is expect to be larger " 263 "than the minimum object size", alignment_in_bytes); 264 new_addr = addr + padding; 265 } 266 267 assert(new_addr > addr, "Unexpected arithmetic overflow " 268 PTR_FORMAT " not greater than " PTR_FORMAT, p2i(new_addr), p2i(addr)); 269 if(new_addr < end) { 270 CollectedHeap::fill_with_object(addr, padding); 271 return new_addr; 272 } else { 273 return NULL; 274 } 275 } 276 277 #ifndef PRODUCT 278 279 inline bool 280 CollectedHeap::promotion_should_fail(volatile size_t* count) { 281 // Access to count is not atomic; the value does not have to be exact. 282 if (PromotionFailureALot) { 283 const size_t gc_num = total_collections(); 284 const size_t elapsed_gcs = gc_num - _promotion_failure_alot_gc_number; 285 if (elapsed_gcs >= PromotionFailureALotInterval) { 286 // Test for unsigned arithmetic wrap-around. 287 if (++*count >= PromotionFailureALotCount) { 288 *count = 0; 289 return true; 290 } 291 } 292 } 293 return false; 294 } 295 296 inline bool CollectedHeap::promotion_should_fail() { 297 return promotion_should_fail(&_promotion_failure_alot_count); 298 } 299 300 inline void CollectedHeap::reset_promotion_should_fail(volatile size_t* count) { 301 if (PromotionFailureALot) { 302 _promotion_failure_alot_gc_number = total_collections(); 303 *count = 0; 304 } 305 } 306 307 inline void CollectedHeap::reset_promotion_should_fail() { 308 reset_promotion_should_fail(&_promotion_failure_alot_count); 309 } 310 #endif // #ifndef PRODUCT 311 312 #endif // SHARE_VM_GC_SHARED_COLLECTEDHEAP_INLINE_HPP