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 703 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
714 | 714 |
715 bool is_compacting() const { return compacting_; } | 715 bool is_compacting() const { return compacting_; } |
716 | 716 |
717 MarkingParity marking_parity() { return marking_parity_; } | 717 MarkingParity marking_parity() { return marking_parity_; } |
718 | 718 |
719 // Concurrent and parallel sweeping support. | 719 // Concurrent and parallel sweeping support. |
720 void SweepInParallel(PagedSpace* space); | 720 void SweepInParallel(PagedSpace* space); |
721 | 721 |
722 void WaitUntilSweepingCompleted(); | 722 void WaitUntilSweepingCompleted(); |
723 | 723 |
724 intptr_t StealMemoryFromSweeperThreads(PagedSpace* space); | 724 intptr_t RefillFreeLists(PagedSpace* space); |
725 | 725 |
726 bool AreSweeperThreadsActivated(); | 726 bool AreSweeperThreadsActivated(); |
727 | 727 |
728 bool IsConcurrentSweepingInProgress(); | 728 bool IsConcurrentSweepingInProgress(); |
729 | 729 |
730 void set_sequential_sweeping(bool sequential_sweeping) { | 730 void set_sequential_sweeping(bool sequential_sweeping) { |
731 sequential_sweeping_ = sequential_sweeping; | 731 sequential_sweeping_ = sequential_sweeping; |
732 } | 732 } |
733 | 733 |
734 bool sequential_sweeping() const { | 734 bool sequential_sweeping() const { |
(...skipping 287 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1022 private: | 1022 private: |
1023 MarkCompactCollector* collector_; | 1023 MarkCompactCollector* collector_; |
1024 }; | 1024 }; |
1025 | 1025 |
1026 | 1026 |
1027 const char* AllocationSpaceName(AllocationSpace space); | 1027 const char* AllocationSpaceName(AllocationSpace space); |
1028 | 1028 |
1029 } } // namespace v8::internal | 1029 } } // namespace v8::internal |
1030 | 1030 |
1031 #endif // V8_MARK_COMPACT_H_ | 1031 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |