src/share/vm/gc_implementation/parallelScavenge/psPromotionManager.inline.hpp
Print this page
@@ -62,10 +62,31 @@
assert(Universe::heap()->is_in(p), "pointer outside heap");
claim_or_forward_internal_depth(p);
}
+inline void PSPromotionManager::promotion_trace_event(oop new_obj, oop old_obj, size_t obj_size,
+ uint age, bool tenured,
+ const PSPromotionLAB* lab) {
+ // Skip if memory allocation failed
+ if (new_obj != NULL) {
+ const ParallelScavengeTracer* gc_tracer = PSScavenge::gc_tracer();
+
+ if (lab != NULL && gc_tracer->should_report_promotion_in_new_plab_event()) {
+ // Promotion of small object in new PLAB
+ size_t obj_bytes = obj_size * HeapWordSize;
+ size_t lab_size = lab->capacity();
+ gc_tracer->report_promotion_in_new_plab_event(old_obj->klass(), obj_bytes, age, tenured, lab_size);
+
+ } else if (gc_tracer->should_report_promotion_outside_plab_event()) {
+ // Promotion of object directly to heap without PLAB
+ size_t obj_bytes = obj_size * HeapWordSize;
+ gc_tracer->report_promotion_outside_plab_event(old_obj->klass(), obj_bytes, age, tenured);
+ }
+ }
+}
+
//
// This method is pretty bulky. It would be nice to split it up
// into smaller submethods, but we need to be careful not to hurt
// performance.
//
@@ -83,32 +104,34 @@
// The same test as "o->is_forwarded()"
if (!test_mark->is_marked()) {
bool new_obj_is_tenured = false;
size_t new_obj_size = o->size();
- if (!promote_immediately) {
// Find the objects age, MT safe.
uint age = (test_mark->has_displaced_mark_helper() /* o->has_displaced_mark() */) ?
test_mark->displaced_mark_helper()->age() : test_mark->age();
+ if (!promote_immediately) {
// Try allocating obj in to-space (unless too old)
if (age < PSScavenge::tenuring_threshold()) {
new_obj = (oop) _young_lab.allocate(new_obj_size);
if (new_obj == NULL && !_young_gen_is_full) {
// Do we allocate directly, or flush and refill?
if (new_obj_size > (YoungPLABSize / 2)) {
// Allocate this object directly
new_obj = (oop)young_space()->cas_allocate(new_obj_size);
+ promotion_trace_event(new_obj, o, new_obj_size, age, false, NULL);
} else {
// Flush and fill
_young_lab.flush();
HeapWord* lab_base = young_space()->cas_allocate(YoungPLABSize);
if (lab_base != NULL) {
_young_lab.initialize(MemRegion(lab_base, YoungPLABSize));
// Try the young lab allocation again.
new_obj = (oop) _young_lab.allocate(new_obj_size);
+ promotion_trace_event(new_obj, o, new_obj_size, age, false, &_young_lab);
} else {
_young_gen_is_full = true;
}
}
}
@@ -130,10 +153,11 @@
if (!_old_gen_is_full) {
// Do we allocate directly, or flush and refill?
if (new_obj_size > (OldPLABSize / 2)) {
// Allocate this object directly
new_obj = (oop)old_gen()->cas_allocate(new_obj_size);
+ promotion_trace_event(new_obj, o, new_obj_size, age, true, NULL);
} else {
// Flush and fill
_old_lab.flush();
HeapWord* lab_base = old_gen()->cas_allocate(OldPLABSize);
@@ -146,10 +170,11 @@
}
#endif
_old_lab.initialize(MemRegion(lab_base, OldPLABSize));
// Try the old lab allocation again.
new_obj = (oop) _old_lab.allocate(new_obj_size);
+ promotion_trace_event(new_obj, o, new_obj_size, age, true, &_old_lab);
}
}
}
// This is the promotion failed test, and code handling.