| 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 583 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 594 enum SweeperType { | 594 enum SweeperType { |
| 595 CONSERVATIVE, | 595 CONSERVATIVE, |
| 596 LAZY_CONSERVATIVE, | 596 LAZY_CONSERVATIVE, |
| 597 PRECISE | 597 PRECISE |
| 598 }; | 598 }; |
| 599 | 599 |
| 600 #ifdef VERIFY_HEAP | 600 #ifdef VERIFY_HEAP |
| 601 void VerifyMarkbitsAreClean(); | 601 void VerifyMarkbitsAreClean(); |
| 602 static void VerifyMarkbitsAreClean(PagedSpace* space); | 602 static void VerifyMarkbitsAreClean(PagedSpace* space); |
| 603 static void VerifyMarkbitsAreClean(NewSpace* space); | 603 static void VerifyMarkbitsAreClean(NewSpace* space); |
| 604 void VerifyWeakEmbeddedMapsInOptimizedCode(); |
| 604 #endif | 605 #endif |
| 605 | 606 |
| 606 // Sweep a single page from the given space conservatively. | 607 // Sweep a single page from the given space conservatively. |
| 607 // Return a number of reclaimed bytes. | 608 // Return a number of reclaimed bytes. |
| 608 static intptr_t SweepConservatively(PagedSpace* space, Page* p); | 609 static intptr_t SweepConservatively(PagedSpace* space, Page* p); |
| 609 | 610 |
| 610 INLINE(static bool ShouldSkipEvacuationSlotRecording(Object** anchor)) { | 611 INLINE(static bool ShouldSkipEvacuationSlotRecording(Object** anchor)) { |
| 611 return Page::FromAddress(reinterpret_cast<Address>(anchor))-> | 612 return Page::FromAddress(reinterpret_cast<Address>(anchor))-> |
| 612 ShouldSkipEvacuationSlotRecording(); | 613 ShouldSkipEvacuationSlotRecording(); |
| 613 } | 614 } |
| (...skipping 250 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 864 | 865 |
| 865 friend class Heap; | 866 friend class Heap; |
| 866 }; | 867 }; |
| 867 | 868 |
| 868 | 869 |
| 869 const char* AllocationSpaceName(AllocationSpace space); | 870 const char* AllocationSpaceName(AllocationSpace space); |
| 870 | 871 |
| 871 } } // namespace v8::internal | 872 } } // namespace v8::internal |
| 872 | 873 |
| 873 #endif // V8_MARK_COMPACT_H_ | 874 #endif // V8_MARK_COMPACT_H_ |
| OLD | NEW |