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
|
// Copyright 2011 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/heap/objects-visiting.h"
#include "src/heap/heap-inl.h"
#include "src/heap/mark-compact-inl.h"
#include "src/heap/objects-visiting-inl.h"
namespace v8 {
namespace internal {
// We don't record weak slots during marking or scavenges. Instead we do it
// once when we complete mark-compact cycle. Note that write barrier has no
// effect if we are already in the middle of compacting mark-sweep cycle and we
// have to record slots manually.
static bool MustRecordSlots(Heap* heap) {
return heap->gc_state() == Heap::MARK_COMPACT &&
heap->mark_compact_collector()->is_compacting();
}
template <class T>
struct WeakListVisitor;
template <class T>
Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) {
HeapObject undefined = ReadOnlyRoots(heap).undefined_value();
Object head = undefined;
T tail;
bool record_slots = MustRecordSlots(heap);
while (list != undefined) {
// Check whether to keep the candidate in the list.
T candidate = T::cast(list);
Object retained = retainer->RetainAs(list);
// Move to the next element before the WeakNext is cleared.
list = WeakListVisitor<T>::WeakNext(candidate);
if (retained != Object()) {
if (head == undefined) {
// First element in the list.
head = retained;
} else {
// Subsequent elements in the list.
DCHECK(!tail.is_null());
WeakListVisitor<T>::SetWeakNext(tail, HeapObject::cast(retained));
if (record_slots) {
HeapObject slot_holder = WeakListVisitor<T>::WeakNextHolder(tail);
int slot_offset = WeakListVisitor<T>::WeakNextOffset();
ObjectSlot slot = slot_holder.RawField(slot_offset);
MarkCompactCollector::RecordSlot(slot_holder, slot,
HeapObject::cast(retained));
}
}
// Retained object is new tail.
DCHECK(!retained.IsUndefined(heap->isolate()));
candidate = T::cast(retained);
tail = candidate;
// tail is a live object, visit it.
WeakListVisitor<T>::VisitLiveObject(heap, tail, retainer);
} else {
WeakListVisitor<T>::VisitPhantomObject(heap, candidate);
}
}
// Terminate the list if there is one or more elements.
if (!tail.is_null()) WeakListVisitor<T>::SetWeakNext(tail, undefined);
return head;
}
template <class T>
static void ClearWeakList(Heap* heap, Object list) {
Object undefined = ReadOnlyRoots(heap).undefined_value();
while (list != undefined) {
T candidate = T::cast(list);
list = WeakListVisitor<T>::WeakNext(candidate);
WeakListVisitor<T>::SetWeakNext(candidate, undefined);
}
}
template <>
struct WeakListVisitor<Context> {
static void SetWeakNext(Context context, Object next) {
context.set(Context::NEXT_CONTEXT_LINK, next, UPDATE_WRITE_BARRIER);
}
static Object WeakNext(Context context) {
return context.next_context_link();
}
static HeapObject WeakNextHolder(Context context) { return context; }
static int WeakNextOffset() {
return FixedArray::SizeFor(Context::NEXT_CONTEXT_LINK);
}
static void VisitLiveObject(Heap* heap, Context context,
WeakObjectRetainer* retainer) {
if (heap->gc_state() == Heap::MARK_COMPACT) {
// Record the slots of the weak entries in the native context.
for (int idx = Context::FIRST_WEAK_SLOT;
idx < Context::NATIVE_CONTEXT_SLOTS; ++idx) {
ObjectSlot slot = context.RawField(Context::OffsetOfElementAt(idx));
MarkCompactCollector::RecordSlot(context, slot,
HeapObject::cast(*slot));
}
}
}
template <class T>
static void DoWeakList(Heap* heap, Context context,
WeakObjectRetainer* retainer, int index) {
// Visit the weak list, removing dead intermediate elements.
Object list_head = VisitWeakList<T>(heap, context.get(index), retainer);
// Update the list head.
context.set(index, list_head, UPDATE_WRITE_BARRIER);
if (MustRecordSlots(heap)) {
// Record the updated slot if necessary.
ObjectSlot head_slot = context.RawField(FixedArray::SizeFor(index));
heap->mark_compact_collector()->RecordSlot(context, head_slot,
HeapObject::cast(list_head));
}
}
static void VisitPhantomObject(Heap* heap, Context context) {}
};
template <>
struct WeakListVisitor<AllocationSite> {
static void SetWeakNext(AllocationSite obj, Object next) {
obj.set_weak_next(next, UPDATE_WRITE_BARRIER);
}
static Object WeakNext(AllocationSite obj) { return obj.weak_next(); }
static HeapObject WeakNextHolder(AllocationSite obj) { return obj; }
static int WeakNextOffset() { return AllocationSite::kWeakNextOffset; }
static void VisitLiveObject(Heap*, AllocationSite, WeakObjectRetainer*) {}
static void VisitPhantomObject(Heap*, AllocationSite) {}
};
template <>
struct WeakListVisitor<JSFinalizationRegistry> {
static void SetWeakNext(JSFinalizationRegistry obj, HeapObject next) {
obj.set_next_dirty(next, UPDATE_WRITE_BARRIER);
}
static Object WeakNext(JSFinalizationRegistry obj) {
return obj.next_dirty();
}
static HeapObject WeakNextHolder(JSFinalizationRegistry obj) { return obj; }
static int WeakNextOffset() {
return JSFinalizationRegistry::kNextDirtyOffset;
}
static void VisitLiveObject(Heap* heap, JSFinalizationRegistry obj,
WeakObjectRetainer*) {
heap->set_dirty_js_finalization_registries_list_tail(obj);
}
static void VisitPhantomObject(Heap*, JSFinalizationRegistry) {}
};
template Object VisitWeakList<Context>(Heap* heap, Object list,
WeakObjectRetainer* retainer);
template Object VisitWeakList<AllocationSite>(Heap* heap, Object list,
WeakObjectRetainer* retainer);
template Object VisitWeakList<JSFinalizationRegistry>(
Heap* heap, Object list, WeakObjectRetainer* retainer);
} // namespace internal
} // namespace v8
|
