| 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 489 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 500 inline bool is_code_flushing_enabled() const { return code_flusher_ != NULL; } | 500 inline bool is_code_flushing_enabled() const { return code_flusher_ != NULL; } |
| 501 void EnableCodeFlushing(bool enable); | 501 void EnableCodeFlushing(bool enable); |
| 502 | 502 |
| 503 enum SweeperType { | 503 enum SweeperType { |
| 504 CONSERVATIVE, | 504 CONSERVATIVE, |
| 505 LAZY_CONSERVATIVE, | 505 LAZY_CONSERVATIVE, |
| 506 PRECISE | 506 PRECISE |
| 507 }; | 507 }; |
| 508 | 508 |
| 509 #ifdef DEBUG | 509 #ifdef DEBUG |
| 510 void VerifyContextSeparation(); |
| 510 void VerifyMarkbitsAreClean(); | 511 void VerifyMarkbitsAreClean(); |
| 511 static void VerifyMarkbitsAreClean(PagedSpace* space); | 512 static void VerifyMarkbitsAreClean(PagedSpace* space); |
| 512 static void VerifyMarkbitsAreClean(NewSpace* space); | 513 static void VerifyMarkbitsAreClean(NewSpace* space); |
| 513 #endif | 514 #endif |
| 514 | 515 |
| 515 // Sweep a single page from the given space conservatively. | 516 // Sweep a single page from the given space conservatively. |
| 516 // Return a number of reclaimed bytes. | 517 // Return a number of reclaimed bytes. |
| 517 static intptr_t SweepConservatively(PagedSpace* space, Page* p); | 518 static intptr_t SweepConservatively(PagedSpace* space, Page* p); |
| 518 | 519 |
| 519 INLINE(static bool ShouldSkipEvacuationSlotRecording(Object** anchor)) { | 520 INLINE(static bool ShouldSkipEvacuationSlotRecording(Object** anchor)) { |
| (...skipping 267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 787 | 788 |
| 788 friend class Heap; | 789 friend class Heap; |
| 789 }; | 790 }; |
| 790 | 791 |
| 791 | 792 |
| 792 const char* AllocationSpaceName(AllocationSpace space); | 793 const char* AllocationSpaceName(AllocationSpace space); |
| 793 | 794 |
| 794 } } // namespace v8::internal | 795 } } // namespace v8::internal |
| 795 | 796 |
| 796 #endif // V8_MARK_COMPACT_H_ | 797 #endif // V8_MARK_COMPACT_H_ |
| OLD | NEW |