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
|
/* -*- 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/Barrier.h"
#include "gc/Marking.h"
#include "jit/JitContext.h"
#include "js/HashTable.h"
#include "js/shadow/Zone.h" // JS::shadow::Zone
#include "js/Value.h"
#include "vm/BigIntType.h" // JS::BigInt
#include "vm/EnvironmentObject.h"
#include "vm/GeneratorObject.h"
#include "vm/JSObject.h"
#include "vm/PropMap.h"
#include "wasm/WasmJS.h"
#include "gc/Zone-inl.h"
namespace js {
bool RuntimeFromMainThreadIsHeapMajorCollecting(JS::shadow::Zone* shadowZone) {
MOZ_ASSERT(
CurrentThreadCanAccessRuntime(shadowZone->runtimeFromMainThread()));
return JS::RuntimeHeapIsMajorCollecting();
}
#ifdef DEBUG
bool IsMarkedBlack(JSObject* obj) { return obj->isMarkedBlack(); }
bool HeapSlot::preconditionForSet(NativeObject* owner, Kind kind,
uint32_t slot) const {
if (kind == Slot) {
return &owner->getSlotRef(slot) == this;
}
uint32_t numShifted = owner->getElementsHeader()->numShiftedElements();
MOZ_ASSERT(slot >= numShifted);
return &owner->getDenseElement(slot - numShifted) == (const Value*)this;
}
void HeapSlot::assertPreconditionForPostWriteBarrier(
NativeObject* obj, Kind kind, uint32_t slot, const Value& target) const {
if (kind == Slot) {
MOZ_ASSERT(obj->getSlotAddressUnchecked(slot)->get() == target);
} else {
uint32_t numShifted = obj->getElementsHeader()->numShiftedElements();
MOZ_ASSERT(slot >= numShifted);
MOZ_ASSERT(
static_cast<HeapSlot*>(obj->getDenseElements() + (slot - numShifted))
->get() == target);
}
if (!obj->zone()->isGCPreparing()) {
AssertTargetIsNotGray(obj);
}
}
bool CurrentThreadIsIonCompiling() {
jit::JitContext* jcx = jit::MaybeGetJitContext();
return jcx && jcx->inIonBackend();
}
#endif // DEBUG
template <typename T>
/* static */ bool MovableCellHasher<T>::hasHash(const Lookup& l) {
if (!l) {
return true;
}
return l->zoneFromAnyThread()->hasUniqueId(l);
}
template <typename T>
/* static */ bool MovableCellHasher<T>::ensureHash(const Lookup& l) {
if (!l) {
return true;
}
uint64_t unusedId;
return l->zoneFromAnyThread()->getOrCreateUniqueId(l, &unusedId);
}
template <typename T>
/* static */ HashNumber MovableCellHasher<T>::hash(const Lookup& l) {
if (!l) {
return 0;
}
// We have to access the zone from-any-thread here: a worker thread may be
// cloning a self-hosted object from the main runtime's self- hosting zone
// into another runtime. The zone's uid lock will protect against multiple
// workers doing this simultaneously.
MOZ_ASSERT(CurrentThreadCanAccessZone(l->zoneFromAnyThread()) ||
CurrentThreadIsPerformingGC());
return l->zoneFromAnyThread()->getHashCodeInfallible(l);
}
template <typename T>
/* static */ bool MovableCellHasher<T>::match(const Key& k, const Lookup& l) {
// Return true if both are null or false if only one is null.
if (!k) {
return !l;
}
if (!l) {
return false;
}
MOZ_ASSERT(k);
MOZ_ASSERT(l);
MOZ_ASSERT(CurrentThreadCanAccessZone(l->zoneFromAnyThread()) ||
CurrentThreadIsPerformingGC());
Zone* zone = k->zoneFromAnyThread();
if (zone != l->zoneFromAnyThread()) {
return false;
}
#ifdef DEBUG
// Incremental table sweeping means that existing table entries may no
// longer have unique IDs. We fail the match in that case and the entry is
// removed from the table later on.
if (!zone->hasUniqueId(k)) {
Key key = k;
MOZ_ASSERT(IsAboutToBeFinalizedUnbarriered(key));
}
MOZ_ASSERT(zone->hasUniqueId(l));
#endif
uint64_t keyId;
if (!zone->maybeGetUniqueId(k, &keyId)) {
// Key is dead and cannot match lookup which must be live.
return false;
}
return keyId == zone->getUniqueIdInfallible(l);
}
#if !MOZ_IS_GCC
template struct JS_PUBLIC_API MovableCellHasher<JSObject*>;
#endif
template struct JS_PUBLIC_API MovableCellHasher<AbstractGeneratorObject*>;
template struct JS_PUBLIC_API MovableCellHasher<EnvironmentObject*>;
template struct JS_PUBLIC_API MovableCellHasher<GlobalObject*>;
template struct JS_PUBLIC_API MovableCellHasher<JSScript*>;
template struct JS_PUBLIC_API MovableCellHasher<BaseScript*>;
template struct JS_PUBLIC_API MovableCellHasher<PropMap*>;
template struct JS_PUBLIC_API MovableCellHasher<ScriptSourceObject*>;
template struct JS_PUBLIC_API MovableCellHasher<SavedFrame*>;
template struct JS_PUBLIC_API MovableCellHasher<WasmInstanceObject*>;
} // namespace js
// Post-write barrier, used by the C++ Heap<T> implementation.
JS_PUBLIC_API void JS::HeapObjectPostWriteBarrier(JSObject** objp,
JSObject* prev,
JSObject* next) {
MOZ_ASSERT(objp);
js::InternalBarrierMethods<JSObject*>::postBarrier(objp, prev, next);
}
JS_PUBLIC_API void JS::HeapStringPostWriteBarrier(JSString** strp,
JSString* prev,
JSString* next) {
MOZ_ASSERT(strp);
js::InternalBarrierMethods<JSString*>::postBarrier(strp, prev, next);
}
JS_PUBLIC_API void JS::HeapBigIntPostWriteBarrier(JS::BigInt** bip,
JS::BigInt* prev,
JS::BigInt* next) {
MOZ_ASSERT(bip);
js::InternalBarrierMethods<JS::BigInt*>::postBarrier(bip, prev, next);
}
JS_PUBLIC_API void JS::HeapValuePostWriteBarrier(JS::Value* valuep,
const Value& prev,
const Value& next) {
MOZ_ASSERT(valuep);
js::InternalBarrierMethods<JS::Value>::postBarrier(valuep, prev, next);
}
// Combined pre- and post-write barriers, used by the rust Heap<T>
// implementation.
JS_PUBLIC_API void JS::HeapObjectWriteBarriers(JSObject** objp, JSObject* prev,
JSObject* next) {
MOZ_ASSERT(objp);
js::InternalBarrierMethods<JSObject*>::preBarrier(prev);
js::InternalBarrierMethods<JSObject*>::postBarrier(objp, prev, next);
}
JS_PUBLIC_API void JS::HeapStringWriteBarriers(JSString** strp, JSString* prev,
JSString* next) {
MOZ_ASSERT(strp);
js::InternalBarrierMethods<JSString*>::preBarrier(prev);
js::InternalBarrierMethods<JSString*>::postBarrier(strp, prev, next);
}
JS_PUBLIC_API void JS::HeapBigIntWriteBarriers(JS::BigInt** bip,
JS::BigInt* prev,
JS::BigInt* next) {
MOZ_ASSERT(bip);
js::InternalBarrierMethods<JS::BigInt*>::preBarrier(prev);
js::InternalBarrierMethods<JS::BigInt*>::postBarrier(bip, prev, next);
}
JS_PUBLIC_API void JS::HeapScriptWriteBarriers(JSScript** scriptp,
JSScript* prev, JSScript* next) {
MOZ_ASSERT(scriptp);
js::InternalBarrierMethods<JSScript*>::preBarrier(prev);
js::InternalBarrierMethods<JSScript*>::postBarrier(scriptp, prev, next);
}
JS_PUBLIC_API void JS::HeapValueWriteBarriers(JS::Value* valuep,
const Value& prev,
const Value& next) {
MOZ_ASSERT(valuep);
js::InternalBarrierMethods<JS::Value>::preBarrier(prev);
js::InternalBarrierMethods<JS::Value>::postBarrier(valuep, prev, next);
}
|
