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 591 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
602 | 602 |
603 enum SweepingParallelism { | 603 enum SweepingParallelism { |
604 SWEEP_SEQUENTIALLY, | 604 SWEEP_SEQUENTIALLY, |
605 SWEEP_IN_PARALLEL | 605 SWEEP_IN_PARALLEL |
606 }; | 606 }; |
607 | 607 |
608 #ifdef VERIFY_HEAP | 608 #ifdef VERIFY_HEAP |
609 void VerifyMarkbitsAreClean(); | 609 void VerifyMarkbitsAreClean(); |
610 static void VerifyMarkbitsAreClean(PagedSpace* space); | 610 static void VerifyMarkbitsAreClean(PagedSpace* space); |
611 static void VerifyMarkbitsAreClean(NewSpace* space); | 611 static void VerifyMarkbitsAreClean(NewSpace* space); |
612 void VerifyWeakEmbeddedObjectsInOptimizedCode(); | 612 void VerifyWeakEmbeddedObjectsInCode(); |
613 void VerifyOmittedMapChecks(); | 613 void VerifyOmittedMapChecks(); |
614 #endif | 614 #endif |
615 | 615 |
616 // Sweep a single page from the given space conservatively. | 616 // Sweep a single page from the given space conservatively. |
617 // Return a number of reclaimed bytes. | 617 // Return a number of reclaimed bytes. |
618 template<SweepingParallelism type> | 618 template<SweepingParallelism type> |
619 static intptr_t SweepConservatively(PagedSpace* space, | 619 static intptr_t SweepConservatively(PagedSpace* space, |
620 FreeList* free_list, | 620 FreeList* free_list, |
621 Page* p); | 621 Page* p); |
622 | 622 |
(...skipping 240 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
863 // heap object. | 863 // heap object. |
864 static bool IsUnmarkedHeapObject(Object** p); | 864 static bool IsUnmarkedHeapObject(Object** p); |
865 static bool IsUnmarkedHeapObjectWithHeap(Heap* heap, Object** p); | 865 static bool IsUnmarkedHeapObjectWithHeap(Heap* heap, Object** p); |
866 | 866 |
867 // Map transitions from a live map to a dead map must be killed. | 867 // Map transitions from a live map to a dead map must be killed. |
868 // We replace them with a null descriptor, with the same key. | 868 // We replace them with a null descriptor, with the same key. |
869 void ClearNonLiveReferences(); | 869 void ClearNonLiveReferences(); |
870 void ClearNonLivePrototypeTransitions(Map* map); | 870 void ClearNonLivePrototypeTransitions(Map* map); |
871 void ClearNonLiveMapTransitions(Map* map, MarkBit map_mark); | 871 void ClearNonLiveMapTransitions(Map* map, MarkBit map_mark); |
872 | 872 |
873 void ClearAndDeoptimizeDependentCode(DependentCode* dependent_code); | 873 void ClearDependentCode(DependentCode* dependent_code); |
| 874 void ClearDependentICList(Object* head); |
874 void ClearNonLiveDependentCode(DependentCode* dependent_code); | 875 void ClearNonLiveDependentCode(DependentCode* dependent_code); |
| 876 int ClearNonLiveDependentCodeInGroup(DependentCode* dependent_code, int group, |
| 877 int start, int end, int new_start); |
875 | 878 |
876 // Marking detaches initial maps from SharedFunctionInfo objects | 879 // Marking detaches initial maps from SharedFunctionInfo objects |
877 // to make this reference weak. We need to reattach initial maps | 880 // to make this reference weak. We need to reattach initial maps |
878 // back after collection. This is either done during | 881 // back after collection. This is either done during |
879 // ClearNonLiveTransitions pass or by calling this function. | 882 // ClearNonLiveTransitions pass or by calling this function. |
880 void ReattachInitialMaps(); | 883 void ReattachInitialMaps(); |
881 | 884 |
882 // Mark all values associated with reachable keys in weak collections | 885 // Mark all values associated with reachable keys in weak collections |
883 // encountered so far. This might push new object or even new weak maps onto | 886 // encountered so far. This might push new object or even new weak maps onto |
884 // the marking stack. | 887 // the marking stack. |
(...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1006 private: | 1009 private: |
1007 MarkCompactCollector* collector_; | 1010 MarkCompactCollector* collector_; |
1008 }; | 1011 }; |
1009 | 1012 |
1010 | 1013 |
1011 const char* AllocationSpaceName(AllocationSpace space); | 1014 const char* AllocationSpaceName(AllocationSpace space); |
1012 | 1015 |
1013 } } // namespace v8::internal | 1016 } } // namespace v8::internal |
1014 | 1017 |
1015 #endif // V8_MARK_COMPACT_H_ | 1018 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |