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 1528 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1539 | 1539 |
1540 IncrementalMarking* incremental_marking() { | 1540 IncrementalMarking* incremental_marking() { |
1541 return &incremental_marking_; | 1541 return &incremental_marking_; |
1542 } | 1542 } |
1543 | 1543 |
1544 bool IsSweepingComplete() { | 1544 bool IsSweepingComplete() { |
1545 return old_data_space()->IsSweepingComplete() && | 1545 return old_data_space()->IsSweepingComplete() && |
1546 old_pointer_space()->IsSweepingComplete(); | 1546 old_pointer_space()->IsSweepingComplete(); |
1547 } | 1547 } |
1548 | 1548 |
1549 MarkingParity marking_parity() { | |
Michael Starzinger
2012/09/21 09:43:19
We shouldn't expose the current parity through the
danno
2012/10/25 10:07:23
Done.
| |
1550 return mark_compact_collector_.marking_parity(); | |
1551 } | |
1552 | |
1549 bool AdvanceSweepers(int step_size) { | 1553 bool AdvanceSweepers(int step_size) { |
1550 bool sweeping_complete = old_data_space()->AdvanceSweeper(step_size); | 1554 bool sweeping_complete = old_data_space()->AdvanceSweeper(step_size); |
1551 sweeping_complete &= old_pointer_space()->AdvanceSweeper(step_size); | 1555 sweeping_complete &= old_pointer_space()->AdvanceSweeper(step_size); |
1552 return sweeping_complete; | 1556 return sweeping_complete; |
1553 } | 1557 } |
1554 | 1558 |
1555 ExternalStringTable* external_string_table() { | 1559 ExternalStringTable* external_string_table() { |
1556 return &external_string_table_; | 1560 return &external_string_table_; |
1557 } | 1561 } |
1558 | 1562 |
(...skipping 1241 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
2800 AssertNoAllocation no_alloc; // i.e. no gc allowed. | 2804 AssertNoAllocation no_alloc; // i.e. no gc allowed. |
2801 | 2805 |
2802 private: | 2806 private: |
2803 DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer); | 2807 DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer); |
2804 }; | 2808 }; |
2805 #endif // DEBUG || LIVE_OBJECT_LIST | 2809 #endif // DEBUG || LIVE_OBJECT_LIST |
2806 | 2810 |
2807 } } // namespace v8::internal | 2811 } } // namespace v8::internal |
2808 | 2812 |
2809 #endif // V8_HEAP_H_ | 2813 #endif // V8_HEAP_H_ |
OLD | NEW |