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 676 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
687 | 687 |
688 bool is_compacting() const { return compacting_; } | 688 bool is_compacting() const { return compacting_; } |
689 | 689 |
690 MarkingParity marking_parity() { return marking_parity_; } | 690 MarkingParity marking_parity() { return marking_parity_; } |
691 | 691 |
692 // Concurrent and parallel sweeping support. | 692 // Concurrent and parallel sweeping support. |
693 void SweepInParallel(PagedSpace* space); | 693 void SweepInParallel(PagedSpace* space); |
694 | 694 |
695 void WaitUntilSweepingCompleted(); | 695 void WaitUntilSweepingCompleted(); |
696 | 696 |
697 intptr_t RefillFreeLists(PagedSpace* space); | 697 void RefillFreeList(PagedSpace* space); |
698 | 698 |
699 bool AreSweeperThreadsActivated(); | 699 bool AreSweeperThreadsActivated(); |
700 | 700 |
701 bool IsConcurrentSweepingInProgress(); | 701 bool IsConcurrentSweepingInProgress(); |
702 | 702 |
703 void set_sequential_sweeping(bool sequential_sweeping) { | 703 void set_sequential_sweeping(bool sequential_sweeping) { |
704 sequential_sweeping_ = sequential_sweeping; | 704 sequential_sweeping_ = sequential_sweeping; |
705 } | 705 } |
706 | 706 |
707 bool sequential_sweeping() const { | 707 bool sequential_sweeping() const { |
708 return sequential_sweeping_; | 708 return sequential_sweeping_; |
709 } | 709 } |
710 | 710 |
711 // Mark the global table which maps weak objects to dependent code without | 711 // Mark the global table which maps weak objects to dependent code without |
712 // marking its contents. | 712 // marking its contents. |
713 void MarkWeakObjectToCodeTable(); | 713 void MarkWeakObjectToCodeTable(); |
714 | 714 |
715 // Special case for processing weak references in a full collection. We need | 715 // Special case for processing weak references in a full collection. We need |
716 // to artifically keep AllocationSites alive for a time. | 716 // to artificially keep AllocationSites alive for a time. |
717 void MarkAllocationSite(AllocationSite* site); | 717 void MarkAllocationSite(AllocationSite* site); |
718 | 718 |
719 private: | 719 private: |
720 class SweeperTask; | 720 class SweeperTask; |
721 | 721 |
722 explicit MarkCompactCollector(Heap* heap); | 722 explicit MarkCompactCollector(Heap* heap); |
723 ~MarkCompactCollector(); | 723 ~MarkCompactCollector(); |
724 | 724 |
725 bool MarkInvalidatedCode(); | 725 bool MarkInvalidatedCode(); |
726 bool WillBeDeoptimized(Code* code); | 726 bool WillBeDeoptimized(Code* code); |
(...skipping 281 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1008 private: | 1008 private: |
1009 MarkCompactCollector* collector_; | 1009 MarkCompactCollector* collector_; |
1010 }; | 1010 }; |
1011 | 1011 |
1012 | 1012 |
1013 const char* AllocationSpaceName(AllocationSpace space); | 1013 const char* AllocationSpaceName(AllocationSpace space); |
1014 | 1014 |
1015 } } // namespace v8::internal | 1015 } } // namespace v8::internal |
1016 | 1016 |
1017 #endif // V8_MARK_COMPACT_H_ | 1017 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |