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 662 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
673 void InvalidateCode(Code* code); | 673 void InvalidateCode(Code* code); |
674 | 674 |
675 void ClearMarkbits(); | 675 void ClearMarkbits(); |
676 | 676 |
677 bool abort_incremental_marking() const { return abort_incremental_marking_; } | 677 bool abort_incremental_marking() const { return abort_incremental_marking_; } |
678 | 678 |
679 bool is_compacting() const { return compacting_; } | 679 bool is_compacting() const { return compacting_; } |
680 | 680 |
681 MarkingParity marking_parity() { return marking_parity_; } | 681 MarkingParity marking_parity() { return marking_parity_; } |
682 | 682 |
| 683 // Concurrent and parallel sweeping support. |
683 void SweepInParallel(PagedSpace* space, | 684 void SweepInParallel(PagedSpace* space, |
684 FreeList* private_free_list, | 685 FreeList* private_free_list, |
685 FreeList* free_list); | 686 FreeList* free_list); |
686 | 687 |
687 void WaitUntilSweepingCompleted(); | 688 void WaitUntilSweepingCompleted(); |
688 | 689 |
689 intptr_t StealMemoryFromSweeperThreads(PagedSpace* space); | 690 intptr_t StealMemoryFromSweeperThreads(PagedSpace* space); |
690 | 691 |
691 bool AreSweeperThreadsActivated(); | 692 bool AreSweeperThreadsActivated(); |
692 | 693 |
| 694 // Parallel marking support. |
| 695 void MarkInParallel(); |
| 696 |
| 697 void WaitUntilMarkingCompleted(); |
| 698 |
693 private: | 699 private: |
694 MarkCompactCollector(); | 700 MarkCompactCollector(); |
695 ~MarkCompactCollector(); | 701 ~MarkCompactCollector(); |
696 | 702 |
697 bool MarkInvalidatedCode(); | 703 bool MarkInvalidatedCode(); |
698 void RemoveDeadInvalidatedCode(); | 704 void RemoveDeadInvalidatedCode(); |
699 void ProcessInvalidatedCode(ObjectVisitor* visitor); | 705 void ProcessInvalidatedCode(ObjectVisitor* visitor); |
700 | 706 |
701 void StartSweeperThreads(); | 707 void StartSweeperThreads(); |
702 | 708 |
(...skipping 181 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
884 | 890 |
885 friend class Heap; | 891 friend class Heap; |
886 }; | 892 }; |
887 | 893 |
888 | 894 |
889 const char* AllocationSpaceName(AllocationSpace space); | 895 const char* AllocationSpaceName(AllocationSpace space); |
890 | 896 |
891 } } // namespace v8::internal | 897 } } // namespace v8::internal |
892 | 898 |
893 #endif // V8_MARK_COMPACT_H_ | 899 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |