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 575 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
586 inline void set_encountered_weak_maps(Object* weak_map) { | 586 inline void set_encountered_weak_maps(Object* weak_map) { |
587 encountered_weak_maps_ = weak_map; | 587 encountered_weak_maps_ = weak_map; |
588 } | 588 } |
589 | 589 |
590 void InvalidateCode(Code* code); | 590 void InvalidateCode(Code* code); |
591 | 591 |
592 void ClearMarkbits(); | 592 void ClearMarkbits(); |
593 | 593 |
594 bool is_compacting() const { return compacting_; } | 594 bool is_compacting() const { return compacting_; } |
595 | 595 |
| 596 MarkingParity marking_parity() { return marking_parity_; } |
| 597 |
596 private: | 598 private: |
597 MarkCompactCollector(); | 599 MarkCompactCollector(); |
598 ~MarkCompactCollector(); | 600 ~MarkCompactCollector(); |
599 | 601 |
600 bool MarkInvalidatedCode(); | 602 bool MarkInvalidatedCode(); |
601 void RemoveDeadInvalidatedCode(); | 603 void RemoveDeadInvalidatedCode(); |
602 void ProcessInvalidatedCode(ObjectVisitor* visitor); | 604 void ProcessInvalidatedCode(ObjectVisitor* visitor); |
603 | 605 |
604 | 606 |
605 #ifdef DEBUG | 607 #ifdef DEBUG |
(...skipping 12 matching lines...) Expand all Loading... |
618 #endif | 620 #endif |
619 | 621 |
620 // Global flag that forces sweeping to be precise, so we can traverse the | 622 // Global flag that forces sweeping to be precise, so we can traverse the |
621 // heap. | 623 // heap. |
622 bool sweep_precisely_; | 624 bool sweep_precisely_; |
623 | 625 |
624 bool reduce_memory_footprint_; | 626 bool reduce_memory_footprint_; |
625 | 627 |
626 bool abort_incremental_marking_; | 628 bool abort_incremental_marking_; |
627 | 629 |
| 630 MarkingParity marking_parity_; |
| 631 |
628 // True if we are collecting slots to perform evacuation from evacuation | 632 // True if we are collecting slots to perform evacuation from evacuation |
629 // candidates. | 633 // candidates. |
630 bool compacting_; | 634 bool compacting_; |
631 | 635 |
632 bool was_marked_incrementally_; | 636 bool was_marked_incrementally_; |
633 | 637 |
634 // A pointer to the current stack-allocated GC tracer object during a full | 638 // A pointer to the current stack-allocated GC tracer object during a full |
635 // collection (NULL before and after). | 639 // collection (NULL before and after). |
636 GCTracer* tracer_; | 640 GCTracer* tracer_; |
637 | 641 |
(...skipping 165 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
803 | 807 |
804 friend class Heap; | 808 friend class Heap; |
805 }; | 809 }; |
806 | 810 |
807 | 811 |
808 const char* AllocationSpaceName(AllocationSpace space); | 812 const char* AllocationSpaceName(AllocationSpace space); |
809 | 813 |
810 } } // namespace v8::internal | 814 } } // namespace v8::internal |
811 | 815 |
812 #endif // V8_MARK_COMPACT_H_ | 816 #endif // V8_MARK_COMPACT_H_ |
OLD | NEW |