OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_HEAP_MARK_COMPACT_H_ | 5 #ifndef V8_HEAP_MARK_COMPACT_H_ |
6 #define V8_HEAP_MARK_COMPACT_H_ | 6 #define V8_HEAP_MARK_COMPACT_H_ |
7 | 7 |
8 #include "src/base/bits.h" | 8 #include "src/base/bits.h" |
9 #include "src/heap/spaces.h" | 9 #include "src/heap/spaces.h" |
10 | 10 |
(...skipping 623 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
634 | 634 |
635 void EnsureSweepingCompleted(); | 635 void EnsureSweepingCompleted(); |
636 | 636 |
637 // If sweeper threads are not active this method will return true. If | 637 // If sweeper threads are not active this method will return true. If |
638 // this is a latency issue we should be smarter here. Otherwise, it will | 638 // this is a latency issue we should be smarter here. Otherwise, it will |
639 // return true if the sweeper threads are done processing the pages. | 639 // return true if the sweeper threads are done processing the pages. |
640 bool IsSweepingCompleted(); | 640 bool IsSweepingCompleted(); |
641 | 641 |
642 void RefillFreeList(PagedSpace* space); | 642 void RefillFreeList(PagedSpace* space); |
643 | 643 |
644 bool AreSweeperThreadsActivated(); | |
645 | |
646 // Checks if sweeping is in progress right now on any space. | 644 // Checks if sweeping is in progress right now on any space. |
647 bool sweeping_in_progress() { return sweeping_in_progress_; } | 645 bool sweeping_in_progress() { return sweeping_in_progress_; } |
648 | 646 |
649 void set_sequential_sweeping(bool sequential_sweeping) { | 647 void set_sequential_sweeping(bool sequential_sweeping) { |
650 sequential_sweeping_ = sequential_sweeping; | 648 sequential_sweeping_ = sequential_sweeping; |
651 } | 649 } |
652 | 650 |
653 bool sequential_sweeping() const { return sequential_sweeping_; } | 651 bool sequential_sweeping() const { return sequential_sweeping_; } |
654 | 652 |
655 // Mark the global table which maps weak objects to dependent code without | 653 // Mark the global table which maps weak objects to dependent code without |
(...skipping 291 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
947 private: | 945 private: |
948 MarkCompactCollector* collector_; | 946 MarkCompactCollector* collector_; |
949 }; | 947 }; |
950 | 948 |
951 | 949 |
952 const char* AllocationSpaceName(AllocationSpace space); | 950 const char* AllocationSpaceName(AllocationSpace space); |
953 } | 951 } |
954 } // namespace v8::internal | 952 } // namespace v8::internal |
955 | 953 |
956 #endif // V8_HEAP_MARK_COMPACT_H_ | 954 #endif // V8_HEAP_MARK_COMPACT_H_ |
OLD | NEW |