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 620 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
631 enum SweepingParallelism { | 631 enum SweepingParallelism { |
632 SWEEP_SEQUENTIALLY, | 632 SWEEP_SEQUENTIALLY, |
633 SWEEP_IN_PARALLEL | 633 SWEEP_IN_PARALLEL |
634 }; | 634 }; |
635 | 635 |
636 #ifdef VERIFY_HEAP | 636 #ifdef VERIFY_HEAP |
637 void VerifyMarkbitsAreClean(); | 637 void VerifyMarkbitsAreClean(); |
638 static void VerifyMarkbitsAreClean(PagedSpace* space); | 638 static void VerifyMarkbitsAreClean(PagedSpace* space); |
639 static void VerifyMarkbitsAreClean(NewSpace* space); | 639 static void VerifyMarkbitsAreClean(NewSpace* space); |
640 void VerifyWeakEmbeddedMapsInOptimizedCode(); | 640 void VerifyWeakEmbeddedMapsInOptimizedCode(); |
641 void VerifyOmittedPrototypeChecks(); | 641 void VerifyOmittedMapChecks(); |
642 #endif | 642 #endif |
643 | 643 |
644 // Sweep a single page from the given space conservatively. | 644 // Sweep a single page from the given space conservatively. |
645 // Return a number of reclaimed bytes. | 645 // Return a number of reclaimed bytes. |
646 template<SweepingParallelism type> | 646 template<SweepingParallelism type> |
647 static intptr_t SweepConservatively(PagedSpace* space, | 647 static intptr_t SweepConservatively(PagedSpace* space, |
648 FreeList* free_list, | 648 FreeList* free_list, |
649 Page* p); | 649 Page* p); |
650 | 650 |
651 INLINE(static bool ShouldSkipEvacuationSlotRecording(Object** anchor)) { | 651 INLINE(static bool ShouldSkipEvacuationSlotRecording(Object** anchor)) { |
(...skipping 364 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1016 private: | 1016 private: |
1017 MarkCompactCollector* collector_; | 1017 MarkCompactCollector* collector_; |
1018 }; | 1018 }; |
1019 | 1019 |
1020 | 1020 |
1021 const char* AllocationSpaceName(AllocationSpace space); | 1021 const char* AllocationSpaceName(AllocationSpace space); |
1022 | 1022 |
1023 } } // namespace v8::internal | 1023 } } // namespace v8::internal |
1024 | 1024 |
1025 #endif // V8_MARK_COMPACT_H_ | 1025 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |