Commit adea021b authored by Hannes Payer's avatar Hannes Payer Committed by Commit Bot

[heap] Reuse object evacuation information for slot recording in Scavenger.

Bug: chromium:852420
Change-Id: If092b5c8b093b313807687a27bc29bebd1c4ee5f
Reviewed-on: https://chromium-review.googlesource.com/1187143
Commit-Queue: Hannes Payer <hpayer@chromium.org>
Reviewed-by: 's avatarUlan Degenbaev <ulan@chromium.org>
Cr-Commit-Position: refs/heads/master@{#55364}
parent ab6d5ed5
...@@ -125,29 +125,33 @@ bool Scavenger::PromoteObject(Map* map, HeapObjectReference** slot, ...@@ -125,29 +125,33 @@ bool Scavenger::PromoteObject(Map* map, HeapObjectReference** slot,
return false; return false;
} }
void Scavenger::EvacuateObjectDefault(Map* map, HeapObjectReference** slot, SlotCallbackResult Scavenger::EvacuateObjectDefault(Map* map,
HeapObject* object, int object_size) { HeapObjectReference** slot,
HeapObject* object,
int object_size) {
SLOW_DCHECK(object_size <= Page::kAllocatableMemory); SLOW_DCHECK(object_size <= Page::kAllocatableMemory);
SLOW_DCHECK(object->SizeFromMap(map) == object_size); SLOW_DCHECK(object->SizeFromMap(map) == object_size);
if (!heap()->ShouldBePromoted(object->address())) { if (!heap()->ShouldBePromoted(object->address())) {
// A semi-space copy may fail due to fragmentation. In that case, we // A semi-space copy may fail due to fragmentation. In that case, we
// try to promote the object. // try to promote the object.
if (SemiSpaceCopyObject(map, slot, object, object_size)) return; if (SemiSpaceCopyObject(map, slot, object, object_size)) return KEEP_SLOT;
} }
if (PromoteObject(map, slot, object, object_size)) return; if (PromoteObject(map, slot, object, object_size)) return REMOVE_SLOT;
// If promotion failed, we try to copy the object to the other semi-space // If promotion failed, we try to copy the object to the other semi-space
if (SemiSpaceCopyObject(map, slot, object, object_size)) return; if (SemiSpaceCopyObject(map, slot, object, object_size)) return KEEP_SLOT;
heap()->FatalProcessOutOfMemory("Scavenger: semi-space copy"); heap()->FatalProcessOutOfMemory("Scavenger: semi-space copy");
UNREACHABLE();
} }
void Scavenger::EvacuateThinString(Map* map, HeapObject** slot, SlotCallbackResult Scavenger::EvacuateThinString(Map* map, HeapObject** slot,
ThinString* object, int object_size) { ThinString* object,
int object_size) {
if (!is_incremental_marking_) { if (!is_incremental_marking_) {
// Loading actual is fine in a parallel setting is there is no write. // Loading actual is fine in a parallel setting since there is no write.
String* actual = object->actual(); String* actual = object->actual();
object->set_length(0); object->set_length(0);
*slot = actual; *slot = actual;
...@@ -157,15 +161,17 @@ void Scavenger::EvacuateThinString(Map* map, HeapObject** slot, ...@@ -157,15 +161,17 @@ void Scavenger::EvacuateThinString(Map* map, HeapObject** slot,
base::AsAtomicPointer::Relaxed_Store( base::AsAtomicPointer::Relaxed_Store(
reinterpret_cast<Map**>(object->address()), reinterpret_cast<Map**>(object->address()),
MapWord::FromForwardingAddress(actual).ToMap()); MapWord::FromForwardingAddress(actual).ToMap());
return; return REMOVE_SLOT;
} }
EvacuateObjectDefault(map, reinterpret_cast<HeapObjectReference**>(slot), return EvacuateObjectDefault(
object, object_size); map, reinterpret_cast<HeapObjectReference**>(slot), object, object_size);
} }
void Scavenger::EvacuateShortcutCandidate(Map* map, HeapObject** slot, SlotCallbackResult Scavenger::EvacuateShortcutCandidate(Map* map,
ConsString* object, int object_size) { HeapObject** slot,
ConsString* object,
int object_size) {
DCHECK(IsShortcutCandidate(map->instance_type())); DCHECK(IsShortcutCandidate(map->instance_type()));
if (!is_incremental_marking_ && if (!is_incremental_marking_ &&
object->unchecked_second() == ReadOnlyRoots(heap()).empty_string()) { object->unchecked_second() == ReadOnlyRoots(heap()).empty_string()) {
...@@ -177,10 +183,10 @@ void Scavenger::EvacuateShortcutCandidate(Map* map, HeapObject** slot, ...@@ -177,10 +183,10 @@ void Scavenger::EvacuateShortcutCandidate(Map* map, HeapObject** slot,
base::AsAtomicPointer::Relaxed_Store( base::AsAtomicPointer::Relaxed_Store(
reinterpret_cast<Map**>(object->address()), reinterpret_cast<Map**>(object->address()),
MapWord::FromForwardingAddress(first).ToMap()); MapWord::FromForwardingAddress(first).ToMap());
return; return REMOVE_SLOT;
} }
MapWord first_word = first->map_word(); MapWord first_word = first->synchronized_map_word();
if (first_word.IsForwardingAddress()) { if (first_word.IsForwardingAddress()) {
HeapObject* target = first_word.ToForwardingAddress(); HeapObject* target = first_word.ToForwardingAddress();
...@@ -188,23 +194,24 @@ void Scavenger::EvacuateShortcutCandidate(Map* map, HeapObject** slot, ...@@ -188,23 +194,24 @@ void Scavenger::EvacuateShortcutCandidate(Map* map, HeapObject** slot,
base::AsAtomicPointer::Relaxed_Store( base::AsAtomicPointer::Relaxed_Store(
reinterpret_cast<Map**>(object->address()), reinterpret_cast<Map**>(object->address()),
MapWord::FromForwardingAddress(target).ToMap()); MapWord::FromForwardingAddress(target).ToMap());
return; return Heap::InToSpace(target) ? KEEP_SLOT : REMOVE_SLOT;
} }
Map* map = first_word.ToMap(); Map* map = first_word.ToMap();
EvacuateObjectDefault(map, reinterpret_cast<HeapObjectReference**>(slot), SlotCallbackResult result = EvacuateObjectDefault(
first, first->SizeFromMap(map)); map, reinterpret_cast<HeapObjectReference**>(slot), first,
first->SizeFromMap(map));
base::AsAtomicPointer::Relaxed_Store( base::AsAtomicPointer::Relaxed_Store(
reinterpret_cast<Map**>(object->address()), reinterpret_cast<Map**>(object->address()),
MapWord::FromForwardingAddress(*slot).ToMap()); MapWord::FromForwardingAddress(*slot).ToMap());
return; return result;
} }
EvacuateObjectDefault(map, reinterpret_cast<HeapObjectReference**>(slot), return EvacuateObjectDefault(
object, object_size); map, reinterpret_cast<HeapObjectReference**>(slot), object, object_size);
} }
void Scavenger::EvacuateObject(HeapObjectReference** slot, Map* map, SlotCallbackResult Scavenger::EvacuateObject(HeapObjectReference** slot,
HeapObject* source) { Map* map, HeapObject* source) {
SLOW_DCHECK(Heap::InFromSpace(source)); SLOW_DCHECK(Heap::InFromSpace(source));
SLOW_DCHECK(!MapWord::FromMap(map).IsForwardingAddress()); SLOW_DCHECK(!MapWord::FromMap(map).IsForwardingAddress());
int size = source->SizeFromMap(map); int size = source->SizeFromMap(map);
...@@ -214,22 +221,21 @@ void Scavenger::EvacuateObject(HeapObjectReference** slot, Map* map, ...@@ -214,22 +221,21 @@ void Scavenger::EvacuateObject(HeapObjectReference** slot, Map* map,
case kVisitThinString: case kVisitThinString:
// At the moment we don't allow weak pointers to thin strings. // At the moment we don't allow weak pointers to thin strings.
DCHECK(!(*slot)->IsWeakHeapObject()); DCHECK(!(*slot)->IsWeakHeapObject());
EvacuateThinString(map, reinterpret_cast<HeapObject**>(slot), return EvacuateThinString(map, reinterpret_cast<HeapObject**>(slot),
reinterpret_cast<ThinString*>(source), size); reinterpret_cast<ThinString*>(source), size);
break;
case kVisitShortcutCandidate: case kVisitShortcutCandidate:
DCHECK(!(*slot)->IsWeakHeapObject()); DCHECK(!(*slot)->IsWeakHeapObject());
// At the moment we don't allow weak pointers to cons strings. // At the moment we don't allow weak pointers to cons strings.
EvacuateShortcutCandidate(map, reinterpret_cast<HeapObject**>(slot), return EvacuateShortcutCandidate(
map, reinterpret_cast<HeapObject**>(slot),
reinterpret_cast<ConsString*>(source), size); reinterpret_cast<ConsString*>(source), size);
break;
default: default:
EvacuateObjectDefault(map, slot, source, size); return EvacuateObjectDefault(map, slot, source, size);
break;
} }
} }
void Scavenger::ScavengeObject(HeapObjectReference** p, HeapObject* object) { SlotCallbackResult Scavenger::ScavengeObject(HeapObjectReference** p,
HeapObject* object) {
DCHECK(Heap::InFromSpace(object)); DCHECK(Heap::InFromSpace(object));
// Synchronized load that consumes the publishing CAS of MigrateObject. // Synchronized load that consumes the publishing CAS of MigrateObject.
...@@ -246,14 +252,14 @@ void Scavenger::ScavengeObject(HeapObjectReference** p, HeapObject* object) { ...@@ -246,14 +252,14 @@ void Scavenger::ScavengeObject(HeapObjectReference** p, HeapObject* object) {
DCHECK((*p)->IsStrongHeapObject()); DCHECK((*p)->IsStrongHeapObject());
*p = HeapObjectReference::Strong(dest); *p = HeapObjectReference::Strong(dest);
} }
return; return Heap::InToSpace(dest) ? KEEP_SLOT : REMOVE_SLOT;
} }
Map* map = first_word.ToMap(); Map* map = first_word.ToMap();
// AllocationMementos are unrooted and shouldn't survive a scavenge // AllocationMementos are unrooted and shouldn't survive a scavenge
DCHECK_NE(ReadOnlyRoots(heap()).allocation_memento_map(), map); DCHECK_NE(ReadOnlyRoots(heap()).allocation_memento_map(), map);
// Call the slow part of scavenge object. // Call the slow part of scavenge object.
EvacuateObject(p, map, object); return EvacuateObject(p, map, object);
} }
SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap, SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap,
...@@ -267,17 +273,8 @@ SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap, ...@@ -267,17 +273,8 @@ SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap,
DCHECK(success); DCHECK(success);
DCHECK(heap_object->IsHeapObject()); DCHECK(heap_object->IsHeapObject());
ScavengeObject(reinterpret_cast<HeapObjectReference**>(slot), heap_object); return ScavengeObject(reinterpret_cast<HeapObjectReference**>(slot),
heap_object);
object = *slot;
// If the object was in from space before and is after executing the
// callback in to space, the object is still live.
// Unfortunately, we do not know about the slot. It could be in a
// just freed free space object.
PageMemoryFence(object);
if (Heap::InToSpace(object)) {
return KEEP_SLOT;
}
} else if (Heap::InToSpace(object)) { } else if (Heap::InToSpace(object)) {
// Already updated slot. This can happen when processing of the work list // Already updated slot. This can happen when processing of the work list
// is interleaved with processing roots. // is interleaved with processing roots.
......
...@@ -53,15 +53,13 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor { ...@@ -53,15 +53,13 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor {
scavenger_->PageMemoryFence(reinterpret_cast<MaybeObject*>(target)); scavenger_->PageMemoryFence(reinterpret_cast<MaybeObject*>(target));
if (Heap::InFromSpace(target)) { if (Heap::InFromSpace(target)) {
scavenger_->ScavengeObject(slot, target); SlotCallbackResult result = scavenger_->ScavengeObject(slot, target);
bool success = (*slot)->ToStrongOrWeakHeapObject(&target); bool success = (*slot)->ToStrongOrWeakHeapObject(&target);
USE(success); USE(success);
DCHECK(success); DCHECK(success);
scavenger_->PageMemoryFence(reinterpret_cast<MaybeObject*>(target));
if (Heap::InNewSpace(target)) { if (result == KEEP_SLOT) {
SLOW_DCHECK(target->IsHeapObject()); SLOW_DCHECK(target->IsHeapObject());
SLOW_DCHECK(Heap::InToSpace(target));
RememberedSet<OLD_TO_NEW>::Insert(Page::FromAddress(slot_address), RememberedSet<OLD_TO_NEW>::Insert(Page::FromAddress(slot_address),
slot_address); slot_address);
} }
......
...@@ -61,7 +61,8 @@ class Scavenger { ...@@ -61,7 +61,8 @@ class Scavenger {
// Scavenges an object |object| referenced from slot |p|. |object| is required // Scavenges an object |object| referenced from slot |p|. |object| is required
// to be in from space. // to be in from space.
inline void ScavengeObject(HeapObjectReference** p, HeapObject* object); inline SlotCallbackResult ScavengeObject(HeapObjectReference** p,
HeapObject* object);
// Copies |source| to |target| and sets the forwarding pointer in |source|. // Copies |source| to |target| and sets the forwarding pointer in |source|.
V8_INLINE bool MigrateObject(Map* map, HeapObject* source, HeapObject* target, V8_INLINE bool MigrateObject(Map* map, HeapObject* source, HeapObject* target,
...@@ -73,22 +74,24 @@ class Scavenger { ...@@ -73,22 +74,24 @@ class Scavenger {
V8_INLINE bool PromoteObject(Map* map, HeapObjectReference** slot, V8_INLINE bool PromoteObject(Map* map, HeapObjectReference** slot,
HeapObject* object, int object_size); HeapObject* object, int object_size);
V8_INLINE void EvacuateObject(HeapObjectReference** slot, Map* map, V8_INLINE SlotCallbackResult EvacuateObject(HeapObjectReference** slot,
HeapObject* source); Map* map, HeapObject* source);
// Different cases for object evacuation. // Different cases for object evacuation.
V8_INLINE void EvacuateObjectDefault(Map* map, HeapObjectReference** slot, V8_INLINE SlotCallbackResult EvacuateObjectDefault(Map* map,
HeapObject* object, int object_size); HeapObjectReference** slot,
HeapObject* object,
V8_INLINE void EvacuateJSFunction(Map* map, HeapObject** slot, int object_size);
JSFunction* object, int object_size);
inline void EvacuateThinString(Map* map, HeapObject** slot, inline SlotCallbackResult EvacuateThinString(Map* map, HeapObject** slot,
ThinString* object, int object_size); ThinString* object,
int object_size);
inline void EvacuateShortcutCandidate(Map* map, HeapObject** slot, inline SlotCallbackResult EvacuateShortcutCandidate(Map* map,
ConsString* object, int object_size); HeapObject** slot,
ConsString* object,
int object_size);
void IterateAndScavengePromotedObject(HeapObject* target, int size); void IterateAndScavengePromotedObject(HeapObject* target, int size);
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment