OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/heap/array-buffer-tracker.h" | 5 #include "src/heap/array-buffer-tracker.h" |
6 #include "src/heap/array-buffer-tracker-inl.h" | 6 #include "src/heap/array-buffer-tracker-inl.h" |
7 #include "src/heap/heap.h" | 7 #include "src/heap/heap.h" |
8 | 8 |
9 namespace v8 { | 9 namespace v8 { |
10 namespace internal { | 10 namespace internal { |
11 | 11 |
12 LocalArrayBufferTracker::~LocalArrayBufferTracker() { | 12 LocalArrayBufferTracker::~LocalArrayBufferTracker() { |
13 CHECK(array_buffers_.empty()); | 13 CHECK(array_buffers_.empty()); |
14 } | 14 } |
15 | 15 |
16 template <LocalArrayBufferTracker::FreeMode free_mode> | 16 template <LocalArrayBufferTracker::FreeMode free_mode> |
17 void LocalArrayBufferTracker::Free() { | 17 void LocalArrayBufferTracker::Free() { |
18 size_t freed_memory = 0; | 18 size_t freed_memory = 0; |
19 for (TrackingData::iterator it = array_buffers_.begin(); | 19 for (TrackingData::iterator it = array_buffers_.begin(); |
20 it != array_buffers_.end();) { | 20 it != array_buffers_.end();) { |
21 JSArrayBuffer* buffer = reinterpret_cast<JSArrayBuffer*>(*it); | 21 JSArrayBuffer* buffer = reinterpret_cast<JSArrayBuffer*>(it->first); |
22 if ((free_mode == kFreeAll) || | 22 if ((free_mode == kFreeAll) || |
23 Marking::IsWhite(Marking::MarkBitFrom(buffer))) { | 23 Marking::IsWhite(Marking::MarkBitFrom(buffer))) { |
24 const size_t len = NumberToSize(heap_->isolate(), buffer->byte_length()); | 24 const size_t len = it->second; |
25 heap_->isolate()->array_buffer_allocator()->Free(buffer->backing_store(), | 25 heap_->isolate()->array_buffer_allocator()->Free(buffer->backing_store(), |
26 len); | 26 len); |
27 freed_memory += len; | 27 freed_memory += len; |
28 it = array_buffers_.erase(it); | 28 it = array_buffers_.erase(it); |
29 } else { | 29 } else { |
30 ++it; | 30 ++it; |
31 } | 31 } |
32 } | 32 } |
33 if (freed_memory > 0) { | 33 if (freed_memory > 0) { |
34 heap_->update_external_memory_concurrently_freed( | 34 heap_->update_external_memory_concurrently_freed( |
35 static_cast<intptr_t>(freed_memory)); | 35 static_cast<intptr_t>(freed_memory)); |
36 } | 36 } |
37 } | 37 } |
38 | 38 |
39 template <typename Callback> | 39 template <typename Callback> |
40 void LocalArrayBufferTracker::Process(Callback callback) { | 40 void LocalArrayBufferTracker::Process(Callback callback) { |
41 JSArrayBuffer* new_buffer = nullptr; | 41 JSArrayBuffer* new_buffer = nullptr; |
42 size_t freed_memory = 0; | 42 size_t freed_memory = 0; |
43 for (TrackingData::iterator it = array_buffers_.begin(); | 43 for (TrackingData::iterator it = array_buffers_.begin(); |
44 it != array_buffers_.end();) { | 44 it != array_buffers_.end();) { |
45 const CallbackResult result = callback(*it, &new_buffer); | 45 const CallbackResult result = callback(it->first, &new_buffer); |
46 if (result == kKeepEntry) { | 46 if (result == kKeepEntry) { |
47 ++it; | 47 ++it; |
48 } else if (result == kUpdateEntry) { | 48 } else if (result == kUpdateEntry) { |
49 DCHECK_NOT_NULL(new_buffer); | 49 DCHECK_NOT_NULL(new_buffer); |
50 Page* target_page = Page::FromAddress(new_buffer->address()); | 50 Page* target_page = Page::FromAddress(new_buffer->address()); |
51 // We need to lock the target page because we cannot guarantee | 51 // We need to lock the target page because we cannot guarantee |
52 // exclusive access to new space pages. | 52 // exclusive access to new space pages. |
53 if (target_page->InNewSpace()) target_page->mutex()->Lock(); | 53 if (target_page->InNewSpace()) target_page->mutex()->Lock(); |
54 LocalArrayBufferTracker* tracker = target_page->local_tracker(); | 54 LocalArrayBufferTracker* tracker = target_page->local_tracker(); |
55 if (tracker == nullptr) { | 55 if (tracker == nullptr) { |
56 target_page->AllocateLocalTracker(); | 56 target_page->AllocateLocalTracker(); |
57 tracker = target_page->local_tracker(); | 57 tracker = target_page->local_tracker(); |
58 } | 58 } |
59 DCHECK_NOT_NULL(tracker); | 59 DCHECK_NOT_NULL(tracker); |
60 tracker->Add(new_buffer); | 60 tracker->Add(new_buffer, it->second); |
61 if (target_page->InNewSpace()) target_page->mutex()->Unlock(); | 61 if (target_page->InNewSpace()) target_page->mutex()->Unlock(); |
62 it = array_buffers_.erase(it); | 62 it = array_buffers_.erase(it); |
63 } else if (result == kRemoveEntry) { | 63 } else if (result == kRemoveEntry) { |
64 const size_t len = NumberToSize(heap_->isolate(), (*it)->byte_length()); | 64 const size_t len = it->second; |
65 heap_->isolate()->array_buffer_allocator()->Free((*it)->backing_store(), | 65 heap_->isolate()->array_buffer_allocator()->Free( |
66 len); | 66 it->first->backing_store(), len); |
67 freed_memory += len; | 67 freed_memory += len; |
68 it = array_buffers_.erase(it); | 68 it = array_buffers_.erase(it); |
69 } else { | 69 } else { |
70 UNREACHABLE(); | 70 UNREACHABLE(); |
71 } | 71 } |
72 } | 72 } |
73 if (freed_memory > 0) { | 73 if (freed_memory > 0) { |
74 heap_->update_external_memory_concurrently_freed( | 74 heap_->update_external_memory_concurrently_freed( |
75 static_cast<intptr_t>(freed_memory)); | 75 static_cast<intptr_t>(freed_memory)); |
76 } | 76 } |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
130 { | 130 { |
131 base::LockGuard<base::Mutex> guard(page->mutex()); | 131 base::LockGuard<base::Mutex> guard(page->mutex()); |
132 LocalArrayBufferTracker* tracker = page->local_tracker(); | 132 LocalArrayBufferTracker* tracker = page->local_tracker(); |
133 if (tracker == nullptr) return false; | 133 if (tracker == nullptr) return false; |
134 return tracker->IsTracked(buffer); | 134 return tracker->IsTracked(buffer); |
135 } | 135 } |
136 } | 136 } |
137 | 137 |
138 } // namespace internal | 138 } // namespace internal |
139 } // namespace v8 | 139 } // namespace v8 |
OLD | NEW |