1 /*
2 * Copyright (c) 2001, 2013, 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 "classfile/systemDictionary.hpp"
27 #include "gc_implementation/shared/gcHeapSummary.hpp"
28 #include "gc_implementation/shared/gcTrace.hpp"
29 #include "gc_implementation/shared/gcTraceTime.hpp"
30 #include "gc_implementation/shared/gcWhen.hpp"
31 #include "gc_implementation/shared/vmGCOperations.hpp"
32 #include "gc_interface/allocTracer.hpp"
33 #include "gc_interface/collectedHeap.hpp"
34 #include "gc_interface/collectedHeap.inline.hpp"
35 #include "memory/metaspace.hpp"
36 #include "oops/oop.inline.hpp"
37 #include "oops/instanceMirrorKlass.hpp"
38 #include "runtime/init.hpp"
39 #include "runtime/thread.inline.hpp"
40 #include "services/heapDumper.hpp"
41
42
43 #ifdef ASSERT
44 int CollectedHeap::_fire_out_of_memory_count = 0;
45 #endif
46
47 size_t CollectedHeap::_filler_array_max_size = 0;
48
49 template <>
50 void EventLogBase<GCMessage>::print(outputStream* st, GCMessage& m) {
51 st->print_cr("GC heap %s", m.is_before ? "before" : "after");
52 st->print_raw(m);
53 }
54
55 void GCHeapLog::log_heap(bool before) {
56 if (!should_log()) {
57 return;
58 }
59
60 double timestamp = fetch_timestamp();
61 MutexLockerEx ml(&_mutex, Mutex::_no_safepoint_check_flag);
62 int index = compute_log_index();
63 _records[index].thread = NULL; // Its the GC thread so it's not that interesting.
64 _records[index].timestamp = timestamp;
65 _records[index].data.is_before = before;
66 stringStream st(_records[index].data.buffer(), _records[index].data.size());
67 if (before) {
68 Universe::print_heap_before_gc(&st, true);
69 } else {
70 Universe::print_heap_after_gc(&st, true);
71 }
72 }
73
74 VirtualSpaceSummary CollectedHeap::create_heap_space_summary() {
75 size_t capacity_in_words = capacity() / HeapWordSize;
76
77 return VirtualSpaceSummary(
78 reserved_region().start(), reserved_region().start() + capacity_in_words, reserved_region().end());
79 }
80
81 GCHeapSummary CollectedHeap::create_heap_summary() {
82 VirtualSpaceSummary heap_space = create_heap_space_summary();
83 return GCHeapSummary(heap_space, used());
84 }
85
86 MetaspaceSummary CollectedHeap::create_metaspace_summary() {
87 const MetaspaceSizes meta_space(
88 MetaspaceAux::allocated_capacity_bytes(),
89 MetaspaceAux::allocated_used_bytes(),
90 MetaspaceAux::reserved_bytes());
91 const MetaspaceSizes data_space(
92 MetaspaceAux::allocated_capacity_bytes(Metaspace::NonClassType),
93 MetaspaceAux::allocated_used_bytes(Metaspace::NonClassType),
94 MetaspaceAux::reserved_bytes(Metaspace::NonClassType));
95 const MetaspaceSizes class_space(
96 MetaspaceAux::allocated_capacity_bytes(Metaspace::ClassType),
97 MetaspaceAux::allocated_used_bytes(Metaspace::ClassType),
98 MetaspaceAux::reserved_bytes(Metaspace::ClassType));
99
100 return MetaspaceSummary(meta_space, data_space, class_space);
101 }
102
103 void CollectedHeap::print_heap_before_gc() {
104 if (PrintHeapAtGC) {
105 Universe::print_heap_before_gc();
106 }
107 if (_gc_heap_log != NULL) {
108 _gc_heap_log->log_heap_before();
109 }
110 }
111
112 void CollectedHeap::print_heap_after_gc() {
113 if (PrintHeapAtGC) {
114 Universe::print_heap_after_gc();
115 }
116 if (_gc_heap_log != NULL) {
117 _gc_heap_log->log_heap_after();
118 }
119 }
120
121 void CollectedHeap::register_nmethod(nmethod* nm) {
122 assert_locked_or_safepoint(CodeCache_lock);
123 }
124
125 void CollectedHeap::unregister_nmethod(nmethod* nm) {
126 assert_locked_or_safepoint(CodeCache_lock);
127 }
128
129 void CollectedHeap::trace_heap(GCWhen::Type when, GCTracer* gc_tracer) {
130 const GCHeapSummary& heap_summary = create_heap_summary();
131 const MetaspaceSummary& metaspace_summary = create_metaspace_summary();
132 gc_tracer->report_gc_heap_summary(when, heap_summary, metaspace_summary);
133 }
134
135 void CollectedHeap::trace_heap_before_gc(GCTracer* gc_tracer) {
136 trace_heap(GCWhen::BeforeGC, gc_tracer);
137 }
138
139 void CollectedHeap::trace_heap_after_gc(GCTracer* gc_tracer) {
140 trace_heap(GCWhen::AfterGC, gc_tracer);
141 }
142
143 // Memory state functions.
144
145
146 CollectedHeap::CollectedHeap() : _n_par_threads(0)
147 {
148 const size_t max_len = size_t(arrayOopDesc::max_array_length(T_INT));
149 const size_t elements_per_word = HeapWordSize / sizeof(jint);
150 _filler_array_max_size = align_object_size(filler_array_hdr_size() +
151 max_len / elements_per_word);
152
153 _barrier_set = NULL;
154 _is_gc_active = false;
155 _total_collections = _total_full_collections = 0;
156 _gc_cause = _gc_lastcause = GCCause::_no_gc;
157 NOT_PRODUCT(_promotion_failure_alot_count = 0;)
158 NOT_PRODUCT(_promotion_failure_alot_gc_number = 0;)
159
160 if (UsePerfData) {
161 EXCEPTION_MARK;
162
163 // create the gc cause jvmstat counters
164 _perf_gc_cause = PerfDataManager::create_string_variable(SUN_GC, "cause",
165 80, GCCause::to_string(_gc_cause), CHECK);
166
167 _perf_gc_lastcause =
168 PerfDataManager::create_string_variable(SUN_GC, "lastCause",
169 80, GCCause::to_string(_gc_lastcause), CHECK);
170 }
171 _defer_initial_card_mark = false; // strengthened by subclass in pre_initialize() below.
172 // Create the ring log
173 if (LogEvents) {
174 _gc_heap_log = new GCHeapLog();
175 } else {
176 _gc_heap_log = NULL;
177 }
178 }
179
180 // This interface assumes that it's being called by the
181 // vm thread. It collects the heap assuming that the
182 // heap lock is already held and that we are executing in
183 // the context of the vm thread.
184 void CollectedHeap::collect_as_vm_thread(GCCause::Cause cause) {
185 assert(Thread::current()->is_VM_thread(), "Precondition#1");
186 assert(Heap_lock->is_locked(), "Precondition#2");
187 GCCauseSetter gcs(this, cause);
188 switch (cause) {
189 case GCCause::_heap_inspection:
190 case GCCause::_heap_dump:
191 case GCCause::_metadata_GC_threshold : {
192 HandleMark hm;
193 do_full_collection(false); // don't clear all soft refs
194 break;
195 }
196 case GCCause::_last_ditch_collection: {
197 HandleMark hm;
198 do_full_collection(true); // do clear all soft refs
199 break;
200 }
201 default:
202 ShouldNotReachHere(); // Unexpected use of this function
203 }
204 }
205
206 void CollectedHeap::pre_initialize() {
207 // Used for ReduceInitialCardMarks (when COMPILER2 is used);
208 // otherwise remains unused.
209 #ifdef COMPILER2
210 _defer_initial_card_mark = ReduceInitialCardMarks && can_elide_tlab_store_barriers()
211 && (DeferInitialCardMark || card_mark_must_follow_store());
212 #elif defined GRAAL
213 _defer_initial_card_mark = GraalDeferredInitBarriers && can_elide_tlab_store_barriers()
214 && (DeferInitialCardMark || card_mark_must_follow_store());
215 #else
216 assert(_defer_initial_card_mark == false, "Who would set it?");
217 #endif
218 }
219
220 #ifndef PRODUCT
221 void CollectedHeap::check_for_bad_heap_word_value(HeapWord* addr, size_t size) {
222 if (CheckMemoryInitialization && ZapUnusedHeapArea) {
223 for (size_t slot = 0; slot < size; slot += 1) {
224 assert((*(intptr_t*) (addr + slot)) != ((intptr_t) badHeapWordVal),
225 "Found badHeapWordValue in post-allocation check");
226 }
227 }
228 }
229
230 void CollectedHeap::check_for_non_bad_heap_word_value(HeapWord* addr, size_t size) {
231 if (CheckMemoryInitialization && ZapUnusedHeapArea) {
232 for (size_t slot = 0; slot < size; slot += 1) {
233 assert((*(intptr_t*) (addr + slot)) == ((intptr_t) badHeapWordVal),
234 "Found non badHeapWordValue in pre-allocation check");
235 }
236 }
237 }
238 #endif // PRODUCT
239
240 #ifdef ASSERT
241 void CollectedHeap::check_for_valid_allocation_state() {
242 Thread *thread = Thread::current();
243 // How to choose between a pending exception and a potential
244 // OutOfMemoryError? Don't allow pending exceptions.
245 // This is a VM policy failure, so how do we exhaustively test it?
246 assert(!thread->has_pending_exception(),
247 "shouldn't be allocating with pending exception");
248 if (StrictSafepointChecks) {
249 assert(thread->allow_allocation(),
250 "Allocation done by thread for which allocation is blocked "
251 "by No_Allocation_Verifier!");
252 // Allocation of an oop can always invoke a safepoint,
253 // hence, the true argument
254 thread->check_for_valid_safepoint_state(true);
255 }
256 }
257 #endif
258
259 HeapWord* CollectedHeap::allocate_from_tlab_slow(KlassHandle klass, Thread* thread, size_t size) {
260
261 // Retain tlab and allocate object in shared space if
262 // the amount free in the tlab is too large to discard.
263 if (thread->tlab().free() > thread->tlab().refill_waste_limit()) {
264 thread->tlab().record_slow_allocation(size);
265 return NULL;
266 }
267
268 // Discard tlab and allocate a new one.
269 // To minimize fragmentation, the last TLAB may be smaller than the rest.
270 size_t new_tlab_size = thread->tlab().compute_size(size);
271
272 thread->tlab().clear_before_allocation();
273
274 if (new_tlab_size == 0) {
275 return NULL;
276 }
277
278 // Allocate a new TLAB...
279 HeapWord* obj = Universe::heap()->allocate_new_tlab(new_tlab_size);
280 if (obj == NULL) {
281 return NULL;
282 }
283
284 AllocTracer::send_allocation_in_new_tlab_event(klass, new_tlab_size * HeapWordSize, size * HeapWordSize);
285
286 if (ZeroTLAB) {
287 // ..and clear it.
288 Copy::zero_to_words(obj, new_tlab_size);
289 } else {
290 // ...and zap just allocated object.
291 #ifdef ASSERT
292 // Skip mangling the space corresponding to the object header to
293 // ensure that the returned space is not considered parsable by
294 // any concurrent GC thread.
295 size_t hdr_size = oopDesc::header_size();
296 Copy::fill_to_words(obj + hdr_size, new_tlab_size - hdr_size, badHeapWordVal);
297 #endif // ASSERT
298 }
299 thread->tlab().fill(obj, obj + size, new_tlab_size);
300 return obj;
301 }
302
303 void CollectedHeap::flush_deferred_store_barrier(JavaThread* thread) {
304 MemRegion deferred = thread->deferred_card_mark();
305 if (!deferred.is_empty()) {
306 assert(_defer_initial_card_mark, "Otherwise should be empty");
307 {
308 // Verify that the storage points to a parsable object in heap
309 DEBUG_ONLY(oop old_obj = oop(deferred.start());)
310 assert(is_in(old_obj), "Not in allocated heap");
311 assert(!can_elide_initializing_store_barrier(old_obj),
312 "Else should have been filtered in new_store_pre_barrier()");
313 assert(old_obj->is_oop(true), "Not an oop");
314 assert(deferred.word_size() == (size_t)(old_obj->size()),
315 "Mismatch: multiple objects?");
316 }
317 BarrierSet* bs = barrier_set();
318 assert(bs->has_write_region_opt(), "No write_region() on BarrierSet");
319 bs->write_region(deferred);
320 // "Clear" the deferred_card_mark field
321 thread->set_deferred_card_mark(MemRegion());
322 }
323 assert(thread->deferred_card_mark().is_empty(), "invariant");
324 }
325
326 // Helper for ReduceInitialCardMarks. For performance,
327 // compiled code may elide card-marks for initializing stores
328 // to a newly allocated object along the fast-path. We
329 // compensate for such elided card-marks as follows:
330 // (a) Generational, non-concurrent collectors, such as
331 // GenCollectedHeap(ParNew,DefNew,Tenured) and
332 // ParallelScavengeHeap(ParallelGC, ParallelOldGC)
333 // need the card-mark if and only if the region is
334 // in the old gen, and do not care if the card-mark
335 // succeeds or precedes the initializing stores themselves,
336 // so long as the card-mark is completed before the next
337 // scavenge. For all these cases, we can do a card mark
338 // at the point at which we do a slow path allocation
339 // in the old gen, i.e. in this call.
340 // (b) GenCollectedHeap(ConcurrentMarkSweepGeneration) requires
341 // in addition that the card-mark for an old gen allocated
342 // object strictly follow any associated initializing stores.
343 // In these cases, the memRegion remembered below is
344 // used to card-mark the entire region either just before the next
345 // slow-path allocation by this thread or just before the next scavenge or
346 // CMS-associated safepoint, whichever of these events happens first.
347 // (The implicit assumption is that the object has been fully
348 // initialized by this point, a fact that we assert when doing the
349 // card-mark.)
350 // (c) G1CollectedHeap(G1) uses two kinds of write barriers. When a
351 // G1 concurrent marking is in progress an SATB (pre-write-)barrier is
352 // is used to remember the pre-value of any store. Initializing
353 // stores will not need this barrier, so we need not worry about
354 // compensating for the missing pre-barrier here. Turning now
355 // to the post-barrier, we note that G1 needs a RS update barrier
356 // which simply enqueues a (sequence of) dirty cards which may
357 // optionally be refined by the concurrent update threads. Note
358 // that this barrier need only be applied to a non-young write,
359 // but, like in CMS, because of the presence of concurrent refinement
360 // (much like CMS' precleaning), must strictly follow the oop-store.
361 // Thus, using the same protocol for maintaining the intended
362 // invariants turns out, serendepitously, to be the same for both
363 // G1 and CMS.
364 //
365 // For any future collector, this code should be reexamined with
366 // that specific collector in mind, and the documentation above suitably
367 // extended and updated.
368 oop CollectedHeap::new_store_pre_barrier(JavaThread* thread, oop new_obj) {
369 // If a previous card-mark was deferred, flush it now.
370 flush_deferred_store_barrier(thread);
371 if (can_elide_initializing_store_barrier(new_obj)) {
372 // The deferred_card_mark region should be empty
373 // following the flush above.
374 assert(thread->deferred_card_mark().is_empty(), "Error");
375 } else {
376 MemRegion mr((HeapWord*)new_obj, new_obj->size());
377 assert(!mr.is_empty(), "Error");
378 if (_defer_initial_card_mark) {
379 // Defer the card mark
380 thread->set_deferred_card_mark(mr);
381 } else {
382 // Do the card mark
383 BarrierSet* bs = barrier_set();
384 assert(bs->has_write_region_opt(), "No write_region() on BarrierSet");
385 bs->write_region(mr);
386 }
387 }
388 return new_obj;
389 }
390
391 size_t CollectedHeap::filler_array_hdr_size() {
392 return size_t(align_object_offset(arrayOopDesc::header_size(T_INT))); // align to Long
393 }
394
395 size_t CollectedHeap::filler_array_min_size() {
396 return align_object_size(filler_array_hdr_size()); // align to MinObjAlignment
397 }
398
399 #ifdef ASSERT
400 void CollectedHeap::fill_args_check(HeapWord* start, size_t words)
401 {
402 assert(words >= min_fill_size(), "too small to fill");
403 assert(words % MinObjAlignment == 0, "unaligned size");
404 assert(Universe::heap()->is_in_reserved(start), "not in heap");
405 assert(Universe::heap()->is_in_reserved(start + words - 1), "not in heap");
406 }
407
408 void CollectedHeap::zap_filler_array(HeapWord* start, size_t words, bool zap)
409 {
410 if (ZapFillerObjects && zap) {
411 Copy::fill_to_words(start + filler_array_hdr_size(),
412 words - filler_array_hdr_size(), 0XDEAFBABE);
413 }
414 }
415 #endif // ASSERT
416
417 void
418 CollectedHeap::fill_with_array(HeapWord* start, size_t words, bool zap)
419 {
420 assert(words >= filler_array_min_size(), "too small for an array");
421 assert(words <= filler_array_max_size(), "too big for a single object");
422
423 const size_t payload_size = words - filler_array_hdr_size();
424 const size_t len = payload_size * HeapWordSize / sizeof(jint);
425 assert((int)len >= 0, err_msg("size too large " SIZE_FORMAT " becomes %d", words, (int)len));
426
427 // Set the length first for concurrent GC.
428 ((arrayOop)start)->set_length((int)len);
429 post_allocation_setup_common(Universe::intArrayKlassObj(), start);
430 DEBUG_ONLY(zap_filler_array(start, words, zap);)
431 }
432
433 void
434 CollectedHeap::fill_with_object_impl(HeapWord* start, size_t words, bool zap)
435 {
436 assert(words <= filler_array_max_size(), "too big for a single object");
437
438 if (words >= filler_array_min_size()) {
439 fill_with_array(start, words, zap);
440 } else if (words > 0) {
441 assert(words == min_fill_size(), "unaligned size");
442 post_allocation_setup_common(SystemDictionary::Object_klass(), start);
443 }
444 }
445
446 void CollectedHeap::fill_with_object(HeapWord* start, size_t words, bool zap)
447 {
448 DEBUG_ONLY(fill_args_check(start, words);)
449 HandleMark hm; // Free handles before leaving.
450 fill_with_object_impl(start, words, zap);
451 }
452
453 void CollectedHeap::fill_with_objects(HeapWord* start, size_t words, bool zap)
454 {
455 DEBUG_ONLY(fill_args_check(start, words);)
456 HandleMark hm; // Free handles before leaving.
457
458 #ifdef _LP64
459 // A single array can fill ~8G, so multiple objects are needed only in 64-bit.
460 // First fill with arrays, ensuring that any remaining space is big enough to
461 // fill. The remainder is filled with a single object.
462 const size_t min = min_fill_size();
463 const size_t max = filler_array_max_size();
464 while (words > max) {
465 const size_t cur = words - max >= min ? max : max - min;
466 fill_with_array(start, cur, zap);
467 start += cur;
468 words -= cur;
469 }
470 #endif
471
472 fill_with_object_impl(start, words, zap);
473 }
474
475 void CollectedHeap::post_initialize() {
476 collector_policy()->post_heap_initialize();
477 }
478
479 HeapWord* CollectedHeap::allocate_new_tlab(size_t size) {
480 guarantee(false, "thread-local allocation buffers not supported");
481 return NULL;
482 }
483
484 void CollectedHeap::ensure_parsability(bool retire_tlabs) {
485 // The second disjunct in the assertion below makes a concession
486 // for the start-up verification done while the VM is being
487 // created. Callers be careful that you know that mutators
488 // aren't going to interfere -- for instance, this is permissible
489 // if we are still single-threaded and have either not yet
490 // started allocating (nothing much to verify) or we have
491 // started allocating but are now a full-fledged JavaThread
492 // (and have thus made our TLAB's) available for filling.
493 assert(SafepointSynchronize::is_at_safepoint() ||
494 !is_init_completed(),
495 "Should only be called at a safepoint or at start-up"
496 " otherwise concurrent mutator activity may make heap "
497 " unparsable again");
498 const bool use_tlab = UseTLAB;
499 const bool deferred = _defer_initial_card_mark;
500 // The main thread starts allocating via a TLAB even before it
501 // has added itself to the threads list at vm boot-up.
502 assert(!use_tlab || Threads::first() != NULL,
503 "Attempt to fill tlabs before main thread has been added"
504 " to threads list is doomed to failure!");
505 for (JavaThread *thread = Threads::first(); thread; thread = thread->next()) {
506 if (use_tlab) {
507 thread->tlab().make_parsable(retire_tlabs);
508 #ifdef GRAAL
509 thread->gpu_hsail_tlabs_make_parsable(retire_tlabs);
510 #endif
511 }
512 #if defined(COMPILER2) || defined(GRAAL)
513 // The deferred store barriers must all have been flushed to the
514 // card-table (or other remembered set structure) before GC starts
515 // processing the card-table (or other remembered set).
516 if (deferred) flush_deferred_store_barrier(thread);
517 #else
518 assert(!deferred, "Should be false");
519 assert(thread->deferred_card_mark().is_empty(), "Should be empty");
520 #endif
521 }
522 }
523
524 void CollectedHeap::accumulate_statistics_all_tlabs() {
525 if (UseTLAB) {
526 assert(SafepointSynchronize::is_at_safepoint() ||
527 !is_init_completed(),
528 "should only accumulate statistics on tlabs at safepoint");
529
530 ThreadLocalAllocBuffer::accumulate_statistics_before_gc();
531 }
532 }
533
534 void CollectedHeap::resize_all_tlabs() {
535 if (UseTLAB) {
536 assert(SafepointSynchronize::is_at_safepoint() ||
537 !is_init_completed(),
538 "should only resize tlabs at safepoint");
539
540 ThreadLocalAllocBuffer::resize_all_tlabs();
541 }
542 }
543
544 void CollectedHeap::pre_full_gc_dump(GCTimer* timer) {
545 if (HeapDumpBeforeFullGC) {
546 GCTraceTime tt("Heap Dump (before full gc): ", PrintGCDetails, false, timer);
547 // We are doing a "major" collection and a heap dump before
548 // major collection has been requested.
549 HeapDumper::dump_heap();
550 }
551 if (PrintClassHistogramBeforeFullGC) {
552 GCTraceTime tt("Class Histogram (before full gc): ", PrintGCDetails, true, timer);
553 VM_GC_HeapInspection inspector(gclog_or_tty, false /* ! full gc */);
554 inspector.doit();
555 }
556 }
557
558 void CollectedHeap::post_full_gc_dump(GCTimer* timer) {
559 if (HeapDumpAfterFullGC) {
560 GCTraceTime tt("Heap Dump (after full gc): ", PrintGCDetails, false, timer);
561 HeapDumper::dump_heap();
562 }
563 if (PrintClassHistogramAfterFullGC) {
564 GCTraceTime tt("Class Histogram (after full gc): ", PrintGCDetails, true, timer);
565 VM_GC_HeapInspection inspector(gclog_or_tty, false /* ! full gc */);
566 inspector.doit();
567 }
568 }
569
570 oop CollectedHeap::Class_obj_allocate(KlassHandle klass, int size, KlassHandle real_klass, TRAPS) {
571 debug_only(check_for_valid_allocation_state());
572 assert(!Universe::heap()->is_gc_active(), "Allocation during gc not allowed");
573 assert(size >= 0, "int won't convert to size_t");
574 HeapWord* obj;
575 assert(ScavengeRootsInCode > 0, "must be");
576 obj = common_mem_allocate_init(real_klass, size, CHECK_NULL);
577 post_allocation_setup_common(klass, obj);
578 assert(Universe::is_bootstrapping() ||
579 !((oop)obj)->is_array(), "must not be an array");
580 NOT_PRODUCT(Universe::heap()->check_for_bad_heap_word_value(obj, size));
581 oop mirror = (oop)obj;
582
583 java_lang_Class::set_oop_size(mirror, size);
584
585 // Setup indirections
586 if (!real_klass.is_null()) {
587 java_lang_Class::set_klass(mirror, real_klass());
588 real_klass->set_java_mirror(mirror);
589 }
590
591 InstanceMirrorKlass* mk = InstanceMirrorKlass::cast(mirror->klass());
592 assert(size == mk->instance_size(real_klass), "should have been set");
593
594 // notify jvmti and dtrace
595 post_allocation_notify(klass, (oop)obj);
596
597 return mirror;
598 }
599
600 /////////////// Unit tests ///////////////
601
602 #ifndef PRODUCT
603 void CollectedHeap::test_is_in() {
604 CollectedHeap* heap = Universe::heap();
605
606 uintptr_t epsilon = (uintptr_t) MinObjAlignment;
607 uintptr_t heap_start = (uintptr_t) heap->_reserved.start();
608 uintptr_t heap_end = (uintptr_t) heap->_reserved.end();
609
610 // Test that NULL is not in the heap.
611 assert(!heap->is_in(NULL), "NULL is unexpectedly in the heap");
612
613 // Test that a pointer to before the heap start is reported as outside the heap.
614 assert(heap_start >= ((uintptr_t)NULL + epsilon), "sanity");
615 void* before_heap = (void*)(heap_start - epsilon);
616 assert(!heap->is_in(before_heap),
617 err_msg("before_heap: " PTR_FORMAT " is unexpectedly in the heap", before_heap));
618
619 // Test that a pointer to after the heap end is reported as outside the heap.
620 assert(heap_end <= ((uintptr_t)-1 - epsilon), "sanity");
621 void* after_heap = (void*)(heap_end + epsilon);
622 assert(!heap->is_in(after_heap),
623 err_msg("after_heap: " PTR_FORMAT " is unexpectedly in the heap", after_heap));
624 }
625 #endif