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 1613 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1624 | 1624 |
1625 Marking* marking() { | 1625 Marking* marking() { |
1626 return &marking_; | 1626 return &marking_; |
1627 } | 1627 } |
1628 | 1628 |
1629 IncrementalMarking* incremental_marking() { | 1629 IncrementalMarking* incremental_marking() { |
1630 return &incremental_marking_; | 1630 return &incremental_marking_; |
1631 } | 1631 } |
1632 | 1632 |
1633 bool IsSweepingComplete() { | 1633 bool IsSweepingComplete() { |
1634 return old_data_space()->IsSweepingComplete() && | 1634 return !mark_compact_collector()->IsConcurrentSweepingInProgress() && |
1635 old_pointer_space()->IsSweepingComplete(); | 1635 old_data_space()->IsLazySweepingComplete() && |
| 1636 old_pointer_space()->IsLazySweepingComplete(); |
1636 } | 1637 } |
1637 | 1638 |
1638 bool AdvanceSweepers(int step_size) { | 1639 bool AdvanceSweepers(int step_size) { |
1639 ASSERT(!FLAG_parallel_sweeping && !FLAG_concurrent_sweeping); | 1640 ASSERT(!FLAG_parallel_sweeping && !FLAG_concurrent_sweeping); |
1640 bool sweeping_complete = old_data_space()->AdvanceSweeper(step_size); | 1641 bool sweeping_complete = old_data_space()->AdvanceSweeper(step_size); |
1641 sweeping_complete &= old_pointer_space()->AdvanceSweeper(step_size); | 1642 sweeping_complete &= old_pointer_space()->AdvanceSweeper(step_size); |
1642 return sweeping_complete; | 1643 return sweeping_complete; |
1643 } | 1644 } |
1644 | 1645 |
1645 ExternalStringTable* external_string_table() { | 1646 ExternalStringTable* external_string_table() { |
(...skipping 1270 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2916 AssertNoAllocation no_alloc; // i.e. no gc allowed. | 2917 AssertNoAllocation no_alloc; // i.e. no gc allowed. |
2917 | 2918 |
2918 private: | 2919 private: |
2919 DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer); | 2920 DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer); |
2920 }; | 2921 }; |
2921 #endif // DEBUG | 2922 #endif // DEBUG |
2922 | 2923 |
2923 } } // namespace v8::internal | 2924 } } // namespace v8::internal |
2924 | 2925 |
2925 #endif // V8_HEAP_H_ | 2926 #endif // V8_HEAP_H_ |
OLD | NEW |