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 642 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
653 inline void set_encountered_weak_maps(Object* weak_map) { | 653 inline void set_encountered_weak_maps(Object* weak_map) { |
654 encountered_weak_maps_ = weak_map; | 654 encountered_weak_maps_ = weak_map; |
655 } | 655 } |
656 | 656 |
657 void InvalidateCode(Code* code); | 657 void InvalidateCode(Code* code); |
658 | 658 |
659 void ClearMarkbits(); | 659 void ClearMarkbits(); |
660 | 660 |
661 bool is_compacting() const { return compacting_; } | 661 bool is_compacting() const { return compacting_; } |
662 | 662 |
| 663 MarkingParity marking_parity() { return marking_parity_; } |
| 664 |
663 private: | 665 private: |
664 MarkCompactCollector(); | 666 MarkCompactCollector(); |
665 ~MarkCompactCollector(); | 667 ~MarkCompactCollector(); |
666 | 668 |
667 bool MarkInvalidatedCode(); | 669 bool MarkInvalidatedCode(); |
668 void RemoveDeadInvalidatedCode(); | 670 void RemoveDeadInvalidatedCode(); |
669 void ProcessInvalidatedCode(ObjectVisitor* visitor); | 671 void ProcessInvalidatedCode(ObjectVisitor* visitor); |
670 | 672 |
671 | 673 |
672 #ifdef DEBUG | 674 #ifdef DEBUG |
(...skipping 12 matching lines...) Expand all Loading... |
685 #endif | 687 #endif |
686 | 688 |
687 // Global flag that forces sweeping to be precise, so we can traverse the | 689 // Global flag that forces sweeping to be precise, so we can traverse the |
688 // heap. | 690 // heap. |
689 bool sweep_precisely_; | 691 bool sweep_precisely_; |
690 | 692 |
691 bool reduce_memory_footprint_; | 693 bool reduce_memory_footprint_; |
692 | 694 |
693 bool abort_incremental_marking_; | 695 bool abort_incremental_marking_; |
694 | 696 |
| 697 MarkingParity marking_parity_; |
| 698 |
695 // True if we are collecting slots to perform evacuation from evacuation | 699 // True if we are collecting slots to perform evacuation from evacuation |
696 // candidates. | 700 // candidates. |
697 bool compacting_; | 701 bool compacting_; |
698 | 702 |
699 bool was_marked_incrementally_; | 703 bool was_marked_incrementally_; |
700 | 704 |
701 // A pointer to the current stack-allocated GC tracer object during a full | 705 // A pointer to the current stack-allocated GC tracer object during a full |
702 // collection (NULL before and after). | 706 // collection (NULL before and after). |
703 GCTracer* tracer_; | 707 GCTracer* tracer_; |
704 | 708 |
(...skipping 146 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
851 | 855 |
852 friend class Heap; | 856 friend class Heap; |
853 }; | 857 }; |
854 | 858 |
855 | 859 |
856 const char* AllocationSpaceName(AllocationSpace space); | 860 const char* AllocationSpaceName(AllocationSpace space); |
857 | 861 |
858 } } // namespace v8::internal | 862 } } // namespace v8::internal |
859 | 863 |
860 #endif // V8_MARK_COMPACT_H_ | 864 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |