Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_HEAP_SCAVENGER_INL_H_ | 5 #ifndef V8_HEAP_SCAVENGER_INL_H_ |
| 6 #define V8_HEAP_SCAVENGER_INL_H_ | 6 #define V8_HEAP_SCAVENGER_INL_H_ |
| 7 | 7 |
| 8 #include "src/heap/scavenger.h" | 8 #include "src/heap/scavenger.h" |
| 9 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| 11 namespace internal { | 11 namespace internal { |
| 12 | 12 |
| 13 void Scavenger::ScavengeObject(HeapObject** p, HeapObject* object, | 13 template <PromotionMode promotion_mode> |
| 14 PromotionMode promotion_mode) { | 14 void Scavenger::ScavengeObject(HeapObject** p, HeapObject* object) { |
| 15 DCHECK(object->GetIsolate()->heap()->InFromSpace(object)); | 15 DCHECK(object->GetIsolate()->heap()->InFromSpace(object)); |
| 16 | 16 |
| 17 // We use the first word (where the map pointer usually is) of a heap | 17 // We use the first word (where the map pointer usually is) of a heap |
| 18 // object to record the forwarding pointer. A forwarding pointer can | 18 // object to record the forwarding pointer. A forwarding pointer can |
| 19 // point to an old space, the code space, or the to space of the new | 19 // point to an old space, the code space, or the to space of the new |
| 20 // generation. | 20 // generation. |
| 21 MapWord first_word = object->map_word(); | 21 MapWord first_word = object->map_word(); |
| 22 | 22 |
| 23 // If the first word is a forwarding address, the object has already been | 23 // If the first word is a forwarding address, the object has already been |
| 24 // copied. | 24 // copied. |
| 25 if (first_word.IsForwardingAddress()) { | 25 if (first_word.IsForwardingAddress()) { |
| 26 HeapObject* dest = first_word.ToForwardingAddress(); | 26 HeapObject* dest = first_word.ToForwardingAddress(); |
| 27 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p)); | 27 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p)); |
| 28 *p = dest; | 28 *p = dest; |
| 29 return; | 29 return; |
| 30 } | 30 } |
| 31 | 31 |
| 32 object->GetHeap()->UpdateAllocationSite<Heap::kGlobal>( | 32 object->GetHeap()->UpdateAllocationSite<Heap::kGlobal>( |
| 33 object, object->GetHeap()->global_pretenuring_feedback_); | 33 object, object->GetHeap()->global_pretenuring_feedback_); |
| 34 | 34 |
| 35 // AllocationMementos are unrooted and shouldn't survive a scavenge | 35 // AllocationMementos are unrooted and shouldn't survive a scavenge |
| 36 DCHECK(object->map() != object->GetHeap()->allocation_memento_map()); | 36 DCHECK(object->map() != object->GetHeap()->allocation_memento_map()); |
| 37 // Call the slow part of scavenge object. | 37 // Call the slow part of scavenge object. |
| 38 return ScavengeObjectSlow(p, object, promotion_mode); | 38 return ScavengeObjectSlow<promotion_mode>(p, object); |
| 39 } | |
| 40 | |
| 41 // static | |
| 42 template <PromotionMode promotion_mode> | |
|
ulan
2016/06/01 09:09:40
promotion_mode is not used in this function, so yo
Marcel Hlopko
2016/06/01 09:19:50
Aah sorry for not noticing this. Done.
| |
| 43 void Scavenger::ScavengeObjectSlow(HeapObject** p, HeapObject* object) { | |
| 44 SLOW_DCHECK(object->GetIsolate()->heap()->InFromSpace(object)); | |
| 45 MapWord first_word = object->map_word(); | |
| 46 SLOW_DCHECK(!first_word.IsForwardingAddress()); | |
| 47 Map* map = first_word.ToMap(); | |
| 48 Scavenger* scavenger = map->GetHeap()->scavenge_collector_; | |
| 49 scavenger->scavenging_visitors_table_.GetVisitor(map)(map, p, object); | |
| 39 } | 50 } |
| 40 | 51 |
| 41 SlotCallbackResult Scavenger::CheckAndScavengeObject( | 52 SlotCallbackResult Scavenger::CheckAndScavengeObject( |
| 42 Heap* heap, Address slot_address, PromotionMode promotion_mode) { | 53 Heap* heap, Address slot_address, PromotionMode promotion_mode) { |
| 43 Object** slot = reinterpret_cast<Object**>(slot_address); | 54 Object** slot = reinterpret_cast<Object**>(slot_address); |
| 44 Object* object = *slot; | 55 Object* object = *slot; |
| 45 if (heap->InFromSpace(object)) { | 56 if (heap->InFromSpace(object)) { |
| 46 HeapObject* heap_object = reinterpret_cast<HeapObject*>(object); | 57 HeapObject* heap_object = reinterpret_cast<HeapObject*>(object); |
| 47 DCHECK(heap_object->IsHeapObject()); | 58 DCHECK(heap_object->IsHeapObject()); |
| 48 | 59 |
| 49 ScavengeObject(reinterpret_cast<HeapObject**>(slot), heap_object, | 60 if (promotion_mode == PROMOTE_MARKED) { |
| 50 promotion_mode); | 61 ScavengeObject<PROMOTE_MARKED>(reinterpret_cast<HeapObject**>(slot), |
| 62 heap_object); | |
| 63 } else { | |
| 64 ScavengeObject<DEFAULT_PROMOTION>(reinterpret_cast<HeapObject**>(slot), | |
| 65 heap_object); | |
| 66 } | |
| 51 | 67 |
| 52 object = *slot; | 68 object = *slot; |
| 53 // If the object was in from space before and is after executing the | 69 // If the object was in from space before and is after executing the |
| 54 // callback in to space, the object is still live. | 70 // callback in to space, the object is still live. |
| 55 // Unfortunately, we do not know about the slot. It could be in a | 71 // Unfortunately, we do not know about the slot. It could be in a |
| 56 // just freed free space object. | 72 // just freed free space object. |
| 57 if (heap->InToSpace(object)) { | 73 if (heap->InToSpace(object)) { |
| 58 return KEEP_SLOT; | 74 return KEEP_SLOT; |
| 59 } | 75 } |
| 60 } else { | 76 } else { |
| 61 DCHECK(!heap->InNewSpace(object)); | 77 DCHECK(!heap->InNewSpace(object)); |
| 62 } | 78 } |
| 63 return REMOVE_SLOT; | 79 return REMOVE_SLOT; |
| 64 } | 80 } |
| 65 | 81 |
| 66 // static | 82 // static |
| 67 void StaticScavengeVisitor::VisitPointer(Heap* heap, HeapObject* obj, | 83 template <PromotionMode promotion_mode> |
| 68 Object** p) { | 84 void StaticScavengeVisitor<promotion_mode>::VisitPointer(Heap* heap, |
| 85 HeapObject* obj, | |
| 86 Object** p) { | |
| 69 Object* object = *p; | 87 Object* object = *p; |
| 70 if (!heap->InNewSpace(object)) return; | 88 if (!heap->InNewSpace(object)) return; |
| 71 Scavenger::ScavengeObject(reinterpret_cast<HeapObject**>(p), | 89 Scavenger::ScavengeObject<promotion_mode>( |
| 72 reinterpret_cast<HeapObject*>(object), | 90 reinterpret_cast<HeapObject**>(p), reinterpret_cast<HeapObject*>(object)); |
| 73 DEFAULT_PROMOTION); | |
| 74 } | 91 } |
| 75 | 92 |
| 76 } // namespace internal | 93 } // namespace internal |
| 77 } // namespace v8 | 94 } // namespace v8 |
| 78 | 95 |
| 79 #endif // V8_HEAP_SCAVENGER_INL_H_ | 96 #endif // V8_HEAP_SCAVENGER_INL_H_ |
| OLD | NEW |