| 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 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 47 class StaticVisitorBase : public AllStatic { | 47 class StaticVisitorBase : public AllStatic { |
| 48 public: | 48 public: |
| 49 #define VISITOR_ID_LIST(V) \ | 49 #define VISITOR_ID_LIST(V) \ |
| 50 V(SeqOneByteString) \ | 50 V(SeqOneByteString) \ |
| 51 V(SeqTwoByteString) \ | 51 V(SeqTwoByteString) \ |
| 52 V(ShortcutCandidate) \ | 52 V(ShortcutCandidate) \ |
| 53 V(ByteArray) \ | 53 V(ByteArray) \ |
| 54 V(FreeSpace) \ | 54 V(FreeSpace) \ |
| 55 V(FixedArray) \ | 55 V(FixedArray) \ |
| 56 V(FixedDoubleArray) \ | 56 V(FixedDoubleArray) \ |
| 57 V(ConstantPoolArray) \ |
| 57 V(NativeContext) \ | 58 V(NativeContext) \ |
| 58 V(AllocationSite) \ | 59 V(AllocationSite) \ |
| 59 V(DataObject2) \ | 60 V(DataObject2) \ |
| 60 V(DataObject3) \ | 61 V(DataObject3) \ |
| 61 V(DataObject4) \ | 62 V(DataObject4) \ |
| 62 V(DataObject5) \ | 63 V(DataObject5) \ |
| 63 V(DataObject6) \ | 64 V(DataObject6) \ |
| 64 V(DataObject7) \ | 65 V(DataObject7) \ |
| 65 V(DataObject8) \ | 66 V(DataObject8) \ |
| 66 V(DataObject9) \ | 67 V(DataObject9) \ |
| (...skipping 342 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 409 | 410 |
| 410 // TODO(mstarzinger): This should be made protected once refactoring is done. | 411 // TODO(mstarzinger): This should be made protected once refactoring is done. |
| 411 // Mark non-optimize code for functions inlined into the given optimized | 412 // Mark non-optimize code for functions inlined into the given optimized |
| 412 // code. This will prevent it from being flushed. | 413 // code. This will prevent it from being flushed. |
| 413 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); | 414 static void MarkInlinedFunctionsCode(Heap* heap, Code* code); |
| 414 | 415 |
| 415 protected: | 416 protected: |
| 416 INLINE(static void VisitMap(Map* map, HeapObject* object)); | 417 INLINE(static void VisitMap(Map* map, HeapObject* object)); |
| 417 INLINE(static void VisitCode(Map* map, HeapObject* object)); | 418 INLINE(static void VisitCode(Map* map, HeapObject* object)); |
| 418 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); | 419 INLINE(static void VisitSharedFunctionInfo(Map* map, HeapObject* object)); |
| 420 INLINE(static void VisitConstantPoolArray(Map* map, HeapObject* object)); |
| 419 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); | 421 INLINE(static void VisitJSFunction(Map* map, HeapObject* object)); |
| 420 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); | 422 INLINE(static void VisitJSRegExp(Map* map, HeapObject* object)); |
| 421 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object)); | 423 INLINE(static void VisitJSArrayBuffer(Map* map, HeapObject* object)); |
| 422 INLINE(static void VisitJSTypedArray(Map* map, HeapObject* object)); | 424 INLINE(static void VisitJSTypedArray(Map* map, HeapObject* object)); |
| 423 INLINE(static void VisitJSDataView(Map* map, HeapObject* object)); | 425 INLINE(static void VisitJSDataView(Map* map, HeapObject* object)); |
| 424 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); | 426 INLINE(static void VisitNativeContext(Map* map, HeapObject* object)); |
| 425 | 427 |
| 426 // Mark pointers in a Map and its TransitionArray together, possibly | 428 // Mark pointers in a Map and its TransitionArray together, possibly |
| 427 // treating transitions or back pointers weak. | 429 // treating transitions or back pointers weak. |
| 428 static void MarkMapContents(Heap* heap, Map* map); | 430 static void MarkMapContents(Heap* heap, Map* map); |
| (...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 468 | 470 |
| 469 | 471 |
| 470 template<typename StaticVisitor> | 472 template<typename StaticVisitor> |
| 471 VisitorDispatchTable<typename StaticMarkingVisitor<StaticVisitor>::Callback> | 473 VisitorDispatchTable<typename StaticMarkingVisitor<StaticVisitor>::Callback> |
| 472 StaticMarkingVisitor<StaticVisitor>::table_; | 474 StaticMarkingVisitor<StaticVisitor>::table_; |
| 473 | 475 |
| 474 | 476 |
| 475 } } // namespace v8::internal | 477 } } // namespace v8::internal |
| 476 | 478 |
| 477 #endif // V8_OBJECTS_VISITING_H_ | 479 #endif // V8_OBJECTS_VISITING_H_ |
| OLD | NEW |