1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: set ts=8 sts=2 et sw=2 tw=80:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "gc/StoreBuffer-inl.h"
#include "mozilla/Assertions.h"
#include "gc/Statistics.h"
#include "vm/ArgumentsObject.h"
#include "vm/JSContext.h"
#include "vm/MutexIDs.h"
#include "vm/Runtime.h"
#include "gc/GC-inl.h"
using namespace js;
using namespace js::gc;
JS_PUBLIC_API void js::gc::LockStoreBuffer(StoreBuffer* sb) {
MOZ_ASSERT(sb);
sb->lock();
}
JS_PUBLIC_API void js::gc::UnlockStoreBuffer(StoreBuffer* sb) {
MOZ_ASSERT(sb);
sb->unlock();
}
bool StoreBuffer::WholeCellBuffer::init() {
MOZ_ASSERT(!stringHead_);
MOZ_ASSERT(!nonStringHead_);
if (!storage_) {
storage_ = MakeUnique<LifoAlloc>(LifoAllocBlockSize);
// This prevents LifoAlloc::Enum from crashing with a release
// assertion if we ever allocate one entry larger than
// LifoAllocBlockSize.
if (storage_) {
storage_->disableOversize();
}
}
clear();
return bool(storage_);
}
bool StoreBuffer::GenericBuffer::init() {
if (!storage_) {
storage_ = MakeUnique<LifoAlloc>(LifoAllocBlockSize);
}
clear();
return bool(storage_);
}
void StoreBuffer::GenericBuffer::trace(JSTracer* trc) {
mozilla::ReentrancyGuard g(*owner_);
MOZ_ASSERT(owner_->isEnabled());
if (!storage_) {
return;
}
for (LifoAlloc::Enum e(*storage_); !e.empty();) {
unsigned size = *e.read<unsigned>();
BufferableRef* edge = e.read<BufferableRef>(size);
edge->trace(trc);
}
}
StoreBuffer::StoreBuffer(JSRuntime* rt, const Nursery& nursery)
: lock_(mutexid::StoreBuffer),
bufferVal(this, JS::GCReason::FULL_VALUE_BUFFER),
bufStrCell(this, JS::GCReason::FULL_CELL_PTR_STR_BUFFER),
bufBigIntCell(this, JS::GCReason::FULL_CELL_PTR_BIGINT_BUFFER),
bufObjCell(this, JS::GCReason::FULL_CELL_PTR_OBJ_BUFFER),
bufferSlot(this, JS::GCReason::FULL_SLOT_BUFFER),
bufferWholeCell(this),
bufferGeneric(this),
runtime_(rt),
nursery_(nursery),
aboutToOverflow_(false),
enabled_(false),
mayHavePointersToDeadCells_(false)
#ifdef DEBUG
,
mEntered(false),
markingNondeduplicatable(false)
#endif
{
}
void StoreBuffer::checkEmpty() const { MOZ_ASSERT(isEmpty()); }
bool StoreBuffer::isEmpty() const {
return bufferVal.isEmpty() && bufStrCell.isEmpty() &&
bufBigIntCell.isEmpty() && bufObjCell.isEmpty() &&
bufferSlot.isEmpty() && bufferWholeCell.isEmpty() &&
bufferGeneric.isEmpty();
}
bool StoreBuffer::enable() {
if (enabled_) {
return true;
}
checkEmpty();
if (!bufferWholeCell.init() || !bufferGeneric.init()) {
return false;
}
enabled_ = true;
return true;
}
void StoreBuffer::disable() {
checkEmpty();
if (!enabled_) {
return;
}
aboutToOverflow_ = false;
enabled_ = false;
}
void StoreBuffer::clear() {
if (!enabled_) {
return;
}
aboutToOverflow_ = false;
mayHavePointersToDeadCells_ = false;
bufferVal.clear();
bufStrCell.clear();
bufBigIntCell.clear();
bufObjCell.clear();
bufferSlot.clear();
bufferWholeCell.clear();
bufferGeneric.clear();
}
void StoreBuffer::setAboutToOverflow(JS::GCReason reason) {
if (!aboutToOverflow_) {
aboutToOverflow_ = true;
runtime_->gc.stats().count(gcstats::COUNT_STOREBUFFER_OVERFLOW);
}
nursery_.requestMinorGC(reason);
}
void StoreBuffer::addSizeOfExcludingThis(mozilla::MallocSizeOf mallocSizeOf,
JS::GCSizes* sizes) {
sizes->storeBufferVals += bufferVal.sizeOfExcludingThis(mallocSizeOf);
sizes->storeBufferCells += bufStrCell.sizeOfExcludingThis(mallocSizeOf) +
bufBigIntCell.sizeOfExcludingThis(mallocSizeOf) +
bufObjCell.sizeOfExcludingThis(mallocSizeOf);
sizes->storeBufferSlots += bufferSlot.sizeOfExcludingThis(mallocSizeOf);
sizes->storeBufferWholeCells +=
bufferWholeCell.sizeOfExcludingThis(mallocSizeOf);
sizes->storeBufferGenerics += bufferGeneric.sizeOfExcludingThis(mallocSizeOf);
}
ArenaCellSet ArenaCellSet::Empty;
ArenaCellSet::ArenaCellSet(Arena* arena, ArenaCellSet* next)
: arena(arena),
next(next)
#ifdef DEBUG
,
minorGCNumberAtCreation(
arena->zone->runtimeFromMainThread()->gc.minorGCCount())
#endif
{
MOZ_ASSERT(arena);
MOZ_ASSERT(bits.isAllClear());
}
ArenaCellSet* StoreBuffer::WholeCellBuffer::allocateCellSet(Arena* arena) {
Zone* zone = arena->zone;
JSRuntime* rt = zone->runtimeFromMainThread();
if (!rt->gc.nursery().isEnabled()) {
return nullptr;
}
// Maintain separate lists for strings and non-strings, so that all buffered
// string whole cells will be processed before anything else (to prevent them
// from being deduplicated when their chars are used by a tenured string.)
bool isString =
MapAllocToTraceKind(arena->getAllocKind()) == JS::TraceKind::String;
AutoEnterOOMUnsafeRegion oomUnsafe;
ArenaCellSet*& head = isString ? stringHead_ : nonStringHead_;
auto cells = storage_->new_<ArenaCellSet>(arena, head);
if (!cells) {
oomUnsafe.crash("Failed to allocate ArenaCellSet");
}
arena->bufferedCells() = cells;
head = cells;
if (isAboutToOverflow()) {
rt->gc.storeBuffer().setAboutToOverflow(
JS::GCReason::FULL_WHOLE_CELL_BUFFER);
}
return cells;
}
void StoreBuffer::WholeCellBuffer::clear() {
for (auto** headPtr : {&stringHead_, &nonStringHead_}) {
for (auto* set = *headPtr; set; set = set->next) {
set->arena->bufferedCells() = &ArenaCellSet::Empty;
}
*headPtr = nullptr;
}
if (storage_) {
storage_->used() ? storage_->releaseAll() : storage_->freeAll();
}
}
template struct StoreBuffer::MonoTypeBuffer<StoreBuffer::ValueEdge>;
template struct StoreBuffer::MonoTypeBuffer<StoreBuffer::SlotsEdge>;
void js::gc::PostWriteBarrierCell(Cell* cell, Cell* prev, Cell* next) {
if (!next || !cell->isTenured()) {
return;
}
StoreBuffer* buffer = next->storeBuffer();
if (!buffer || (prev && prev->storeBuffer())) {
return;
}
buffer->putWholeCell(cell);
}
|
