| 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 { |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 | 21 |
| 22 // If the first word is a forwarding address, the object has already been | 22 // If the first word is a forwarding address, the object has already been |
| 23 // copied. | 23 // copied. |
| 24 if (first_word.IsForwardingAddress()) { | 24 if (first_word.IsForwardingAddress()) { |
| 25 HeapObject* dest = first_word.ToForwardingAddress(); | 25 HeapObject* dest = first_word.ToForwardingAddress(); |
| 26 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p)); | 26 DCHECK(object->GetIsolate()->heap()->InFromSpace(*p)); |
| 27 *p = dest; | 27 *p = dest; |
| 28 return; | 28 return; |
| 29 } | 29 } |
| 30 | 30 |
| 31 object->GetHeap()->UpdateAllocationSite( | 31 object->GetHeap()->UpdateAllocationSite<Heap::kGlobal>( |
| 32 object, object->GetHeap()->global_pretenuring_feedback_); | 32 object, object->GetHeap()->global_pretenuring_feedback_); |
| 33 | 33 |
| 34 // AllocationMementos are unrooted and shouldn't survive a scavenge | 34 // AllocationMementos are unrooted and shouldn't survive a scavenge |
| 35 DCHECK(object->map() != object->GetHeap()->allocation_memento_map()); | 35 DCHECK(object->map() != object->GetHeap()->allocation_memento_map()); |
| 36 // Call the slow part of scavenge object. | 36 // Call the slow part of scavenge object. |
| 37 return ScavengeObjectSlow(p, object); | 37 return ScavengeObjectSlow(p, object); |
| 38 } | 38 } |
| 39 | 39 |
| 40 | 40 |
| 41 // static | 41 // static |
| 42 void StaticScavengeVisitor::VisitPointer(Heap* heap, HeapObject* obj, | 42 void StaticScavengeVisitor::VisitPointer(Heap* heap, HeapObject* obj, |
| 43 Object** p) { | 43 Object** p) { |
| 44 Object* object = *p; | 44 Object* object = *p; |
| 45 if (!heap->InNewSpace(object)) return; | 45 if (!heap->InNewSpace(object)) return; |
| 46 Scavenger::ScavengeObject(reinterpret_cast<HeapObject**>(p), | 46 Scavenger::ScavengeObject(reinterpret_cast<HeapObject**>(p), |
| 47 reinterpret_cast<HeapObject*>(object)); | 47 reinterpret_cast<HeapObject*>(object)); |
| 48 } | 48 } |
| 49 | 49 |
| 50 } // namespace internal | 50 } // namespace internal |
| 51 } // namespace v8 | 51 } // namespace v8 |
| 52 | 52 |
| 53 #endif // V8_HEAP_SCAVENGER_INL_H_ | 53 #endif // V8_HEAP_SCAVENGER_INL_H_ |
| OLD | NEW |