| 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 620 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 631 | 631 | 
| 632   enum SweepingParallelism { | 632   enum SweepingParallelism { | 
| 633     SWEEP_SEQUENTIALLY, | 633     SWEEP_SEQUENTIALLY, | 
| 634     SWEEP_IN_PARALLEL | 634     SWEEP_IN_PARALLEL | 
| 635   }; | 635   }; | 
| 636 | 636 | 
| 637 #ifdef VERIFY_HEAP | 637 #ifdef VERIFY_HEAP | 
| 638   void VerifyMarkbitsAreClean(); | 638   void VerifyMarkbitsAreClean(); | 
| 639   static void VerifyMarkbitsAreClean(PagedSpace* space); | 639   static void VerifyMarkbitsAreClean(PagedSpace* space); | 
| 640   static void VerifyMarkbitsAreClean(NewSpace* space); | 640   static void VerifyMarkbitsAreClean(NewSpace* space); | 
| 641   void VerifyWeakEmbeddedObjectsInOptimizedCode(); | 641   void VerifyWeakEmbeddedObjectsInCode(); | 
| 642   void VerifyOmittedMapChecks(); | 642   void VerifyOmittedMapChecks(); | 
| 643 #endif | 643 #endif | 
| 644 | 644 | 
| 645   // Sweep a single page from the given space conservatively. | 645   // Sweep a single page from the given space conservatively. | 
| 646   // Return a number of reclaimed bytes. | 646   // Return a number of reclaimed bytes. | 
| 647   template<SweepingParallelism type> | 647   template<SweepingParallelism type> | 
| 648   static intptr_t SweepConservatively(PagedSpace* space, | 648   static intptr_t SweepConservatively(PagedSpace* space, | 
| 649                                       FreeList* free_list, | 649                                       FreeList* free_list, | 
| 650                                       Page* p); | 650                                       Page* p); | 
| 651 | 651 | 
| (...skipping 383 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 1035  private: | 1035  private: | 
| 1036   MarkCompactCollector* collector_; | 1036   MarkCompactCollector* collector_; | 
| 1037 }; | 1037 }; | 
| 1038 | 1038 | 
| 1039 | 1039 | 
| 1040 const char* AllocationSpaceName(AllocationSpace space); | 1040 const char* AllocationSpaceName(AllocationSpace space); | 
| 1041 | 1041 | 
| 1042 } }  // namespace v8::internal | 1042 } }  // namespace v8::internal | 
| 1043 | 1043 | 
| 1044 #endif  // V8_MARK_COMPACT_H_ | 1044 #endif  // V8_MARK_COMPACT_H_ | 
| OLD | NEW | 
|---|