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 74 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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(PropertyCell) \ | 91 V(PropertyCell) \ |
92 V(SharedFunctionInfo) \ | 92 V(SharedFunctionInfo) \ |
93 V(JSFunction) \ | 93 V(JSFunction) \ |
94 V(JSWeakMap) \ | 94 V(JSWeakMap) \ |
| 95 V(JSArrayBuffer) \ |
| 96 V(JSTypedArray) \ |
95 V(JSRegExp) | 97 V(JSRegExp) |
96 | 98 |
97 // For data objects, JS objects and structs along with generic visitor which | 99 // For data objects, JS objects and structs along with generic visitor which |
98 // can visit object of any size we provide visitors specialized by | 100 // can visit object of any size we provide visitors specialized by |
99 // object size in words. | 101 // object size in words. |
100 // Ids of specialized visitors are declared in a linear order (without | 102 // Ids of specialized visitors are declared in a linear order (without |
101 // holes) starting from the id of visitor specialized for 2 words objects | 103 // holes) starting from the id of visitor specialized for 2 words objects |
102 // (base visitor id) and ending with the id of generic visitor. | 104 // (base visitor id) and ending with the id of generic visitor. |
103 // Method GetVisitorIdForSize depends on this ordering to calculate visitor | 105 // Method GetVisitorIdForSize depends on this ordering to calculate visitor |
104 // id of specialized visitor from given instance size, base visitor id and | 106 // id of specialized visitor from given instance size, base visitor id and |
(...skipping 295 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
400 // Mark non-optimize code for functions inlined into the given optimized | 402 // Mark non-optimize code for functions inlined into the given optimized |
401 // code. This will prevent it from being flushed. | 403 // code. This will prevent it from being flushed. |
402 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); | 404 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); |
403 | 405 |
404 protected: | 406 protected: |
405 INLINE(static void VisitMap(Map* map, HeapObject* object)); | 407 INLINE(static void VisitMap(Map* map, HeapObject* object)); |
406 INLINE(static void VisitCode(Map* map, HeapObject* object)); | 408 INLINE(static void VisitCode(Map* map, HeapObject* object)); |
407 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); | 409 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); |
408 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); | 410 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); |
409 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); | 411 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); |
| 412 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object)); |
| 413 INLINE(static void VisitJSTypedArray(Map* map, HeapObject* object)); |
410 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); | 414 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); |
411 | 415 |
412 // Mark pointers in a Map and its TransitionArray together, possibly | 416 // Mark pointers in a Map and its TransitionArray together, possibly |
413 // treating transitions or back pointers weak. | 417 // treating transitions or back pointers weak. |
414 static void MarkMapContents(Heap* heap, Map* map); | 418 static void MarkMapContents(Heap* heap, Map* map); |
415 static void MarkTransitionArray(Heap* heap, TransitionArray* transitions); | 419 static void MarkTransitionArray(Heap* heap, TransitionArray* transitions); |
416 | 420 |
417 // Code flushing support. | 421 // Code flushing support. |
418 INLINE(static bool IsFlushable(Heap* heap, JSFunction* function)); | 422 INLINE(static bool IsFlushable(Heap* heap, JSFunction* function)); |
419 INLINE(static bool IsFlushable(Heap* heap, SharedFunctionInfo* shared_info)); | 423 INLINE(static bool IsFlushable(Heap* heap, SharedFunctionInfo* shared_info)); |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
454 | 458 |
455 | 459 |
456 template<typename StaticVisitor> | 460 template<typename StaticVisitor> |
457 VisitorDispatchTable<typename StaticMarkingVisitor<StaticVisitor>::Callback> | 461 VisitorDispatchTable<typename StaticMarkingVisitor<StaticVisitor>::Callback> |
458 StaticMarkingVisitor<StaticVisitor>::table_; | 462 StaticMarkingVisitor<StaticVisitor>::table_; |
459 | 463 |
460 | 464 |
461 } } // namespace v8::internal | 465 } } // namespace v8::internal |
462 | 466 |
463 #endif // V8_OBJECTS_VISITING_H_ | 467 #endif // V8_OBJECTS_VISITING_H_ |
OLD | NEW |