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/heap.h" | 7 #include "src/heap/heap.h" |
7 #include "src/isolate.h" | 8 #include "src/isolate.h" |
| 9 #include "src/objects-inl.h" |
8 #include "src/objects.h" | 10 #include "src/objects.h" |
9 #include "src/objects-inl.h" | |
10 #include "src/v8.h" | 11 #include "src/v8.h" |
11 | 12 |
12 namespace v8 { | 13 namespace v8 { |
13 namespace internal { | 14 namespace internal { |
14 | 15 |
15 ArrayBufferTracker::~ArrayBufferTracker() { | 16 LocalArrayBufferTracker::~LocalArrayBufferTracker() { |
16 Isolate* isolate = heap()->isolate(); | |
17 size_t freed_memory = 0; | 17 size_t freed_memory = 0; |
18 for (auto& buffer : live_array_buffers_) { | 18 for (auto& buffer : live_) { |
19 isolate->array_buffer_allocator()->Free(buffer.first, buffer.second); | 19 heap_->isolate()->array_buffer_allocator()->Free(buffer.second.first, |
20 freed_memory += buffer.second; | 20 buffer.second.second); |
| 21 freed_memory += buffer.second.second; |
21 } | 22 } |
22 for (auto& buffer : live_array_buffers_for_scavenge_) { | 23 if (freed_memory > 0) { |
23 isolate->array_buffer_allocator()->Free(buffer.first, buffer.second); | 24 heap_->update_amount_of_external_allocated_freed_memory( |
24 freed_memory += buffer.second; | 25 static_cast<intptr_t>(freed_memory)); |
25 } | 26 } |
26 live_array_buffers_.clear(); | 27 live_.clear(); |
27 live_array_buffers_for_scavenge_.clear(); | 28 not_yet_discovered_.clear(); |
28 not_yet_discovered_array_buffers_.clear(); | 29 } |
29 not_yet_discovered_array_buffers_for_scavenge_.clear(); | |
30 | 30 |
| 31 void LocalArrayBufferTracker::Add(Key key, const Value& value) { |
| 32 live_[key] = value; |
| 33 not_yet_discovered_[key] = value; |
| 34 } |
| 35 |
| 36 void LocalArrayBufferTracker::AddLive(Key key, const Value& value) { |
| 37 DCHECK_EQ(not_yet_discovered_.count(key), 0); |
| 38 live_[key] = value; |
| 39 } |
| 40 |
| 41 void LocalArrayBufferTracker::MarkLive(Key key) { |
| 42 DCHECK_EQ(live_.count(key), 1); |
| 43 not_yet_discovered_.erase(key); |
| 44 } |
| 45 |
| 46 LocalArrayBufferTracker::Value LocalArrayBufferTracker::Remove(Key key) { |
| 47 DCHECK_EQ(live_.count(key), 1); |
| 48 Value value = live_[key]; |
| 49 live_.erase(key); |
| 50 not_yet_discovered_.erase(key); |
| 51 return value; |
| 52 } |
| 53 |
| 54 void LocalArrayBufferTracker::FreeDead() { |
| 55 size_t freed_memory = 0; |
| 56 for (TrackingMap::iterator it = not_yet_discovered_.begin(); |
| 57 it != not_yet_discovered_.end();) { |
| 58 heap_->isolate()->array_buffer_allocator()->Free(it->second.first, |
| 59 it->second.second); |
| 60 freed_memory += it->second.second; |
| 61 live_.erase(it->first); |
| 62 not_yet_discovered_.erase(it++); |
| 63 } |
31 if (freed_memory > 0) { | 64 if (freed_memory > 0) { |
32 heap()->update_amount_of_external_allocated_memory( | 65 heap_->update_amount_of_external_allocated_freed_memory( |
33 -static_cast<int64_t>(freed_memory)); | 66 static_cast<intptr_t>(freed_memory)); |
| 67 } |
| 68 started_ = false; |
| 69 } |
| 70 |
| 71 void LocalArrayBufferTracker::Reset() { |
| 72 if (!started_) { |
| 73 not_yet_discovered_ = live_; |
| 74 started_ = true; |
34 } | 75 } |
35 } | 76 } |
36 | 77 |
| 78 bool LocalArrayBufferTracker::IsEmpty() { |
| 79 return live_.empty() && not_yet_discovered_.empty(); |
| 80 } |
37 | 81 |
38 void ArrayBufferTracker::RegisterNew(JSArrayBuffer* buffer) { | 82 ArrayBufferTracker::~ArrayBufferTracker() {} |
| 83 |
| 84 void ArrayBufferTracker::RegisterNew(JSArrayBuffer* buffer, bool track_live) { |
39 void* data = buffer->backing_store(); | 85 void* data = buffer->backing_store(); |
40 if (!data) return; | 86 if (!data) return; |
41 | 87 |
42 bool in_new_space = heap()->InNewSpace(buffer); | 88 size_t length = NumberToSize(heap_->isolate(), buffer->byte_length()); |
43 size_t length = NumberToSize(heap()->isolate(), buffer->byte_length()); | 89 Page* page = Page::FromAddress(buffer->address()); |
44 if (in_new_space) { | 90 if (track_live) { |
45 live_array_buffers_for_scavenge_[data] = length; | 91 page->local_tracker()->AddLive(buffer, std::make_pair(data, length)); |
46 } else { | 92 } else { |
47 live_array_buffers_[data] = length; | 93 page->local_tracker()->Add(buffer, std::make_pair(data, length)); |
48 } | 94 } |
49 | |
50 // We may go over the limit of externally allocated memory here. We call the | 95 // We may go over the limit of externally allocated memory here. We call the |
51 // api function to trigger a GC in this case. | 96 // api function to trigger a GC in this case. |
52 reinterpret_cast<v8::Isolate*>(heap()->isolate()) | 97 reinterpret_cast<v8::Isolate*>(heap_->isolate()) |
53 ->AdjustAmountOfExternalAllocatedMemory(length); | 98 ->AdjustAmountOfExternalAllocatedMemory(length); |
54 } | 99 } |
55 | 100 |
56 | 101 |
57 void ArrayBufferTracker::Unregister(JSArrayBuffer* buffer) { | 102 void ArrayBufferTracker::Unregister(JSArrayBuffer* buffer) { |
58 void* data = buffer->backing_store(); | 103 void* data = buffer->backing_store(); |
59 if (!data) return; | 104 if (!data) return; |
60 | 105 |
61 bool in_new_space = heap()->InNewSpace(buffer); | 106 size_t length = Page::FromAddress(buffer->address()) |
62 std::map<void*, size_t>* live_buffers = | 107 ->local_tracker() |
63 in_new_space ? &live_array_buffers_for_scavenge_ : &live_array_buffers_; | 108 ->Remove(buffer) |
64 std::map<void*, size_t>* not_yet_discovered_buffers = | 109 .second; |
65 in_new_space ? ¬_yet_discovered_array_buffers_for_scavenge_ | 110 heap_->update_amount_of_external_allocated_memory( |
66 : ¬_yet_discovered_array_buffers_; | 111 -static_cast<intptr_t>(length)); |
67 | |
68 DCHECK(live_buffers->count(data) > 0); | |
69 | |
70 size_t length = (*live_buffers)[data]; | |
71 live_buffers->erase(data); | |
72 not_yet_discovered_buffers->erase(data); | |
73 | |
74 heap()->update_amount_of_external_allocated_memory( | |
75 -static_cast<int64_t>(length)); | |
76 } | 112 } |
77 | 113 |
| 114 void ArrayBufferTracker::FreeDeadInNewSpace() { |
| 115 NewSpacePageIterator from_it(heap_->new_space()->FromSpaceStart(), |
| 116 heap_->new_space()->FromSpaceEnd()); |
| 117 while (from_it.has_next()) { |
| 118 Page* p = from_it.next(); |
| 119 p->ScanAndFreeDeadArrayBuffers< |
| 120 LocalArrayBufferTracker::kForwardingPointer>(); |
| 121 } |
| 122 heap_->account_amount_of_external_allocated_freed_memory(); |
| 123 } |
| 124 |
| 125 void ArrayBufferTracker::ResetTrackersInOldSpace() { |
| 126 heap_->old_space()->ForAllPages([](Page* p) { p->ResetTracker(); }); |
| 127 } |
| 128 |
| 129 #define UPDATE_GUARD(buffer, data) \ |
| 130 if (buffer->is_external()) return; \ |
| 131 data = buffer->backing_store(); \ |
| 132 if (data == nullptr) return; \ |
| 133 if (data == heap_->undefined_value()) return; |
78 | 134 |
79 void ArrayBufferTracker::MarkLive(JSArrayBuffer* buffer) { | 135 void ArrayBufferTracker::MarkLive(JSArrayBuffer* buffer) { |
80 base::LockGuard<base::Mutex> guard(&mutex_); | 136 void* data = nullptr; |
81 void* data = buffer->backing_store(); | 137 UPDATE_GUARD(buffer, data); |
82 | 138 |
83 // ArrayBuffer might be in the middle of being constructed. | 139 LocalArrayBufferTracker* tracker = |
84 if (data == heap()->undefined_value()) return; | 140 Page::FromAddress(buffer->address())->local_tracker(); |
85 if (heap()->InNewSpace(buffer)) { | 141 if (tracker->IsTracked(buffer)) { |
86 not_yet_discovered_array_buffers_for_scavenge_.erase(data); | 142 tracker->MarkLive((buffer)); |
87 } else { | 143 } else { |
88 not_yet_discovered_array_buffers_.erase(data); | 144 heap_->RegisterNewArrayBuffer(buffer); |
89 } | 145 } |
90 } | 146 } |
91 | 147 |
92 | 148 #undef UPDATE_GUARD |
93 void ArrayBufferTracker::FreeDead(bool from_scavenge) { | |
94 size_t freed_memory = 0; | |
95 Isolate* isolate = heap()->isolate(); | |
96 for (auto& buffer : not_yet_discovered_array_buffers_for_scavenge_) { | |
97 isolate->array_buffer_allocator()->Free(buffer.first, buffer.second); | |
98 freed_memory += buffer.second; | |
99 live_array_buffers_for_scavenge_.erase(buffer.first); | |
100 } | |
101 | |
102 if (!from_scavenge) { | |
103 for (auto& buffer : not_yet_discovered_array_buffers_) { | |
104 isolate->array_buffer_allocator()->Free(buffer.first, buffer.second); | |
105 freed_memory += buffer.second; | |
106 live_array_buffers_.erase(buffer.first); | |
107 } | |
108 } | |
109 | |
110 not_yet_discovered_array_buffers_for_scavenge_ = | |
111 live_array_buffers_for_scavenge_; | |
112 if (!from_scavenge) not_yet_discovered_array_buffers_ = live_array_buffers_; | |
113 | |
114 // Do not call through the api as this code is triggered while doing a GC. | |
115 heap()->update_amount_of_external_allocated_memory( | |
116 -static_cast<int64_t>(freed_memory)); | |
117 } | |
118 | |
119 | |
120 void ArrayBufferTracker::PrepareDiscoveryInNewSpace() { | |
121 not_yet_discovered_array_buffers_for_scavenge_ = | |
122 live_array_buffers_for_scavenge_; | |
123 } | |
124 | |
125 | |
126 void ArrayBufferTracker::Promote(JSArrayBuffer* buffer) { | |
127 base::LockGuard<base::Mutex> guard(&mutex_); | |
128 | |
129 if (buffer->is_external()) return; | |
130 void* data = buffer->backing_store(); | |
131 if (!data) return; | |
132 // ArrayBuffer might be in the middle of being constructed. | |
133 if (data == heap()->undefined_value()) return; | |
134 DCHECK(live_array_buffers_for_scavenge_.count(data) > 0); | |
135 live_array_buffers_[data] = live_array_buffers_for_scavenge_[data]; | |
136 live_array_buffers_for_scavenge_.erase(data); | |
137 not_yet_discovered_array_buffers_for_scavenge_.erase(data); | |
138 } | |
139 | 149 |
140 } // namespace internal | 150 } // namespace internal |
141 } // namespace v8 | 151 } // namespace v8 |
OLD | NEW |