Chromium Code Reviews| Index: src/heap/heap.h |
| diff --git a/src/heap/heap.h b/src/heap/heap.h |
| index dfbcc701e6939f5a7215d19c9118f09440fe9121..f86f3346cac15a54c006fe4d31f0acb62e0fe366 100644 |
| --- a/src/heap/heap.h |
| +++ b/src/heap/heap.h |
| @@ -1511,10 +1511,12 @@ class Heap { |
| bool deserialization_complete() const { return deserialization_complete_; } |
|
Hannes Payer (out of office)
2015/05/12 06:33:28
Please add a bunch of comments about what these fu
|
| - void RegisterNewArrayBuffer(void* data, size_t length); |
| - void UnregisterArrayBuffer(void* data); |
| - void RegisterLiveArrayBuffer(void* data); |
| - void FreeDeadArrayBuffers(); |
| + void RegisterNewArrayBuffer(bool in_new_space, void* data, size_t length); |
| + void UnregisterArrayBuffer(bool in_new_space, void* data); |
| + void RegisterLiveArrayBuffer(bool in_new_space, void* data); |
| + void FreeDeadArrayBuffers(bool in_new_space); |
| + void PrepareArrayBufferDiscoveryInNewSpace(); |
| + void PromoteArrayBuffer(JSArrayBuffer* buffer); |
| protected: |
| // Methods made available to tests. |
| @@ -2180,7 +2182,9 @@ class Heap { |
| bool concurrent_sweeping_enabled_; |
| std::map<void*, size_t> live_array_buffers_; |
| + std::map<void*, size_t> live_new_array_buffers_; |
| std::map<void*, size_t> not_yet_discovered_array_buffers_; |
| + std::map<void*, size_t> not_yet_discovered_new_array_buffers_; |
| struct StrongRootsList; |
| StrongRootsList* strong_roots_list_; |