| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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_OBJECTS_VISITING_H_ | 5 #ifndef V8_OBJECTS_VISITING_H_ |
| 6 #define V8_OBJECTS_VISITING_H_ | 6 #define V8_OBJECTS_VISITING_H_ |
| 7 | 7 |
| 8 #include "src/allocation.h" | 8 #include "src/allocation.h" |
| 9 #include "src/layout-descriptor.h" | 9 #include "src/layout-descriptor.h" |
| 10 | 10 |
| (...skipping 16 matching lines...) Expand all Loading... |
| 27 #define VISITOR_ID_LIST(V) \ | 27 #define VISITOR_ID_LIST(V) \ |
| 28 V(SeqOneByteString) \ | 28 V(SeqOneByteString) \ |
| 29 V(SeqTwoByteString) \ | 29 V(SeqTwoByteString) \ |
| 30 V(ShortcutCandidate) \ | 30 V(ShortcutCandidate) \ |
| 31 V(ByteArray) \ | 31 V(ByteArray) \ |
| 32 V(FreeSpace) \ | 32 V(FreeSpace) \ |
| 33 V(FixedArray) \ | 33 V(FixedArray) \ |
| 34 V(FixedDoubleArray) \ | 34 V(FixedDoubleArray) \ |
| 35 V(FixedTypedArray) \ | 35 V(FixedTypedArray) \ |
| 36 V(FixedFloat64Array) \ | 36 V(FixedFloat64Array) \ |
| 37 V(ConstantPoolArray) \ |
| 37 V(NativeContext) \ | 38 V(NativeContext) \ |
| 38 V(AllocationSite) \ | 39 V(AllocationSite) \ |
| 39 V(DataObject2) \ | 40 V(DataObject2) \ |
| 40 V(DataObject3) \ | 41 V(DataObject3) \ |
| 41 V(DataObject4) \ | 42 V(DataObject4) \ |
| 42 V(DataObject5) \ | 43 V(DataObject5) \ |
| 43 V(DataObject6) \ | 44 V(DataObject6) \ |
| 44 V(DataObject7) \ | 45 V(DataObject7) \ |
| 45 V(DataObject8) \ | 46 V(DataObject8) \ |
| 46 V(DataObject9) \ | 47 V(DataObject9) \ |
| (...skipping 372 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 419 | 420 |
| 420 // TODO(mstarzinger): This should be made protected once refactoring is done. | 421 // TODO(mstarzinger): This should be made protected once refactoring is done. |
| 421 // Mark non-optimize code for functions inlined into the given optimized | 422 // Mark non-optimize code for functions inlined into the given optimized |
| 422 // code. This will prevent it from being flushed. | 423 // code. This will prevent it from being flushed. |
| 423 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); | 424 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); |
| 424 | 425 |
| 425 protected: | 426 protected: |
| 426 INLINE(static void VisitMap(Map* map, HeapObject* object)); | 427 INLINE(static void VisitMap(Map* map, HeapObject* object)); |
| 427 INLINE(static void VisitCode(Map* map, HeapObject* object)); | 428 INLINE(static void VisitCode(Map* map, HeapObject* object)); |
| 428 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); | 429 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); |
| 430 INLINE(static void VisitConstantPoolArray(Map* map, HeapObject* object)); |
| 429 INLINE(static void VisitAllocationSite(Map* map, HeapObject* object)); | 431 INLINE(static void VisitAllocationSite(Map* map, HeapObject* object)); |
| 430 INLINE(static void VisitWeakCollection(Map* map, HeapObject* object)); | 432 INLINE(static void VisitWeakCollection(Map* map, HeapObject* object)); |
| 431 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); | 433 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); |
| 432 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); | 434 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); |
| 433 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object)); | 435 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object)); |
| 434 INLINE(static void VisitJSTypedArray(Map* map, HeapObject* object)); | 436 INLINE(static void VisitJSTypedArray(Map* map, HeapObject* object)); |
| 435 INLINE(static void VisitJSDataView(Map* map, HeapObject* object)); | 437 INLINE(static void VisitJSDataView(Map* map, HeapObject* object)); |
| 436 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); | 438 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); |
| 437 | 439 |
| 438 // Mark pointers in a Map and its TransitionArray together, possibly | 440 // Mark pointers in a Map and its TransitionArray together, possibly |
| (...skipping 47 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 486 // the next element. Given the head of the list, this function removes dead | 488 // the next element. Given the head of the list, this function removes dead |
| 487 // elements from the list and if requested records slots for next-element | 489 // elements from the list and if requested records slots for next-element |
| 488 // pointers. The template parameter T is a WeakListVisitor that defines how to | 490 // pointers. The template parameter T is a WeakListVisitor that defines how to |
| 489 // access the next-element pointers. | 491 // access the next-element pointers. |
| 490 template <class T> | 492 template <class T> |
| 491 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer); | 493 Object* VisitWeakList(Heap* heap, Object* list, WeakObjectRetainer* retainer); |
| 492 } | 494 } |
| 493 } // namespace v8::internal | 495 } // namespace v8::internal |
| 494 | 496 |
| 495 #endif // V8_OBJECTS_VISITING_H_ | 497 #endif // V8_OBJECTS_VISITING_H_ |
| OLD | NEW |