OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
81 V(Struct7) \ | 81 V(Struct7) \ |
82 V(Struct8) \ | 82 V(Struct8) \ |
83 V(Struct9) \ | 83 V(Struct9) \ |
84 V(StructGeneric) \ | 84 V(StructGeneric) \ |
85 V(ConsString) \ | 85 V(ConsString) \ |
86 V(SlicedString) \ | 86 V(SlicedString) \ |
87 V(Symbol) \ | 87 V(Symbol) \ |
88 V(Oddball) \ | 88 V(Oddball) \ |
89 V(Code) \ | 89 V(Code) \ |
90 V(Map) \ | 90 V(Map) \ |
| 91 V(Cell) \ |
91 V(PropertyCell) \ | 92 V(PropertyCell) \ |
92 V(SharedFunctionInfo) \ | 93 V(SharedFunctionInfo) \ |
93 V(JSFunction) \ | 94 V(JSFunction) \ |
94 V(JSWeakMap) \ | 95 V(JSWeakMap) \ |
95 V(JSArrayBuffer) \ | 96 V(JSArrayBuffer) \ |
96 V(JSTypedArray) \ | 97 V(JSTypedArray) \ |
97 V(JSRegExp) | 98 V(JSRegExp) |
98 | 99 |
99 // For data objects, JS objects and structs along with generic visitor which | 100 // For data objects, JS objects and structs along with generic visitor which |
100 // can visit object of any size we provide visitors specialized by | 101 // can visit object of any size we provide visitors specialized by |
(...skipping 286 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
387 class StaticMarkingVisitor : public StaticVisitorBase { | 388 class StaticMarkingVisitor : public StaticVisitorBase { |
388 public: | 389 public: |
389 static void Initialize(); | 390 static void Initialize(); |
390 | 391 |
391 INLINE(static void IterateBody(Map* map, HeapObject* obj)) { | 392 INLINE(static void IterateBody(Map* map, HeapObject* obj)) { |
392 table_.GetVisitor(map)(map, obj); | 393 table_.GetVisitor(map)(map, obj); |
393 } | 394 } |
394 | 395 |
395 INLINE(static void VisitCodeEntry(Heap* heap, Address entry_address)); | 396 INLINE(static void VisitCodeEntry(Heap* heap, Address entry_address)); |
396 INLINE(static void VisitEmbeddedPointer(Heap* heap, RelocInfo* rinfo)); | 397 INLINE(static void VisitEmbeddedPointer(Heap* heap, RelocInfo* rinfo)); |
397 INLINE(static void VisitGlobalPropertyCell(Heap* heap, RelocInfo* rinfo)); | 398 INLINE(static void VisitCell(Heap* heap, RelocInfo* rinfo)); |
398 INLINE(static void VisitDebugTarget(Heap* heap, RelocInfo* rinfo)); | 399 INLINE(static void VisitDebugTarget(Heap* heap, RelocInfo* rinfo)); |
399 INLINE(static void VisitCodeTarget(Heap* heap, RelocInfo* rinfo)); | 400 INLINE(static void VisitCodeTarget(Heap* heap, RelocInfo* rinfo)); |
400 INLINE(static void VisitCodeAgeSequence(Heap* heap, RelocInfo* rinfo)); | 401 INLINE(static void VisitCodeAgeSequence(Heap* heap, RelocInfo* rinfo)); |
401 INLINE(static void VisitExternalReference(RelocInfo* rinfo)) { } | 402 INLINE(static void VisitExternalReference(RelocInfo* rinfo)) { } |
402 INLINE(static void VisitRuntimeEntry(RelocInfo* rinfo)) { } | 403 INLINE(static void VisitRuntimeEntry(RelocInfo* rinfo)) { } |
403 | 404 |
404 // TODO(mstarzinger): This should be made protected once refactoring is done. | 405 // TODO(mstarzinger): This should be made protected once refactoring is done. |
405 // Mark non-optimize code for functions inlined into the given optimized | 406 // Mark non-optimize code for functions inlined into the given optimized |
406 // code. This will prevent it from being flushed. | 407 // code. This will prevent it from being flushed. |
407 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); | 408 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
461 | 462 |
462 | 463 |
463 template<typename StaticVisitor> | 464 template<typename StaticVisitor> |
464 VisitorDispatchTable<typename StaticMarkingVisitor<StaticVisitor>::Callback> | 465 VisitorDispatchTable<typename StaticMarkingVisitor<StaticVisitor>::Callback> |
465 StaticMarkingVisitor<StaticVisitor>::table_; | 466 StaticMarkingVisitor<StaticVisitor>::table_; |
466 | 467 |
467 | 468 |
468 } } // namespace v8::internal | 469 } } // namespace v8::internal |
469 | 470 |
470 #endif // V8_OBJECTS_VISITING_H_ | 471 #endif // V8_OBJECTS_VISITING_H_ |
OLD | NEW |