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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
|
// Copyright 2020 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.
#ifndef V8_HEAP_MEMORY_CHUNK_H_
#define V8_HEAP_MEMORY_CHUNK_H_
#include <atomic>
#include "src/base/macros.h"
#include "src/base/platform/mutex.h"
#include "src/common/globals.h"
#include "src/heap/base/active-system-pages.h"
#include "src/heap/basic-memory-chunk.h"
#include "src/heap/list.h"
#include "src/heap/marking.h"
#include "src/heap/memory-chunk-layout.h"
#include "src/heap/slot-set.h"
namespace v8 {
namespace internal {
class FreeListCategory;
class Space;
enum class MarkingMode { kNoMarking, kMinorMarking, kMajorMarking };
// MemoryChunk represents a memory region owned by a specific space.
// It is divided into the header and the body. Chunk start is always
// 1MB aligned. Start of the body is aligned so it can accommodate
// any heap object.
class MemoryChunk : public BasicMemoryChunk {
public:
// |kDone|: The page state when sweeping is complete or sweeping must not be
// performed on that page. Sweeper threads that are done with their work
// will set this value and not touch the page anymore.
// |kPending|: This page is ready for parallel sweeping.
// |kInProgress|: This page is currently swept by a sweeper thread.
enum class ConcurrentSweepingState : intptr_t {
kDone,
kPending,
kInProgress,
};
static const size_t kHeaderSize = MemoryChunkLayout::kMemoryChunkHeaderSize;
static const intptr_t kOldToNewSlotSetOffset =
MemoryChunkLayout::kSlotSetOffset;
// Page size in bytes. This must be a multiple of the OS page size.
static const int kPageSize = 1 << kPageSizeBits;
MemoryChunk(Heap* heap, BaseSpace* space, size_t size, Address area_start,
Address area_end, VirtualMemory reservation,
Executability executable, PageSize page_size);
// Only works if the pointer is in the first kPageSize of the MemoryChunk.
static MemoryChunk* FromAddress(Address a) {
return cast(BasicMemoryChunk::FromAddress(a));
}
// Only works if the object is in the first kPageSize of the MemoryChunk.
static MemoryChunk* FromHeapObject(Tagged<HeapObject> o) {
return cast(BasicMemoryChunk::FromHeapObject(o));
}
static MemoryChunk* cast(BasicMemoryChunk* chunk) {
SLOW_DCHECK(!chunk || !chunk->InReadOnlySpace());
return static_cast<MemoryChunk*>(chunk);
}
static const MemoryChunk* cast(const BasicMemoryChunk* chunk) {
SLOW_DCHECK(!chunk->InReadOnlySpace());
return static_cast<const MemoryChunk*>(chunk);
}
size_t buckets() const { return SlotSet::BucketsForSize(size()); }
void SetOldGenerationPageFlags(MarkingMode marking_mode);
void SetYoungGenerationPageFlags(MarkingMode marking_mode);
static inline void MoveExternalBackingStoreBytes(
ExternalBackingStoreType type, MemoryChunk* from, MemoryChunk* to,
size_t amount);
void DiscardUnusedMemory(Address addr, size_t size);
base::Mutex* mutex() const { return mutex_; }
base::SharedMutex* shared_mutex() const { return shared_mutex_; }
void set_concurrent_sweeping_state(ConcurrentSweepingState state) {
concurrent_sweeping_ = state;
}
ConcurrentSweepingState concurrent_sweeping_state() {
return static_cast<ConcurrentSweepingState>(concurrent_sweeping_.load());
}
bool SweepingDone() const {
return concurrent_sweeping_ == ConcurrentSweepingState::kDone;
}
template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
SlotSet* slot_set() {
if constexpr (access_mode == AccessMode::ATOMIC)
return base::AsAtomicPointer::Acquire_Load(&slot_set_[type]);
return slot_set_[type];
}
template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
const SlotSet* slot_set() const {
return const_cast<MemoryChunk*>(this)->slot_set<type, access_mode>();
}
template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
TypedSlotSet* typed_slot_set() {
if constexpr (access_mode == AccessMode::ATOMIC)
return base::AsAtomicPointer::Acquire_Load(&typed_slot_set_[type]);
return typed_slot_set_[type];
}
template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
const TypedSlotSet* typed_slot_set() const {
return const_cast<MemoryChunk*>(this)->typed_slot_set<type, access_mode>();
}
template <RememberedSetType type>
bool ContainsSlots() const {
return slot_set<type>() != nullptr || typed_slot_set<type>() != nullptr;
}
bool ContainsAnySlots() const;
V8_EXPORT_PRIVATE SlotSet* AllocateSlotSet(RememberedSetType type);
// Not safe to be called concurrently.
void ReleaseSlotSet(RememberedSetType type);
TypedSlotSet* AllocateTypedSlotSet(RememberedSetType type);
// Not safe to be called concurrently.
void ReleaseTypedSlotSet(RememberedSetType type);
template <RememberedSetType type>
SlotSet* ExtractSlotSet() {
SlotSet* slot_set = slot_set_[type];
// Conditionally reset to nullptr (instead of e.g. using std::exchange) to
// avoid data races when transitioning from nullptr to nullptr.
if (slot_set) {
slot_set_[type] = nullptr;
}
return slot_set;
}
template <RememberedSetType type>
TypedSlotSet* ExtractTypedSlotSet() {
TypedSlotSet* typed_slot_set = typed_slot_set_[type];
// Conditionally reset to nullptr (instead of e.g. using std::exchange) to
// avoid data races when transitioning from nullptr to nullptr.
if (typed_slot_set) {
typed_slot_set_[type] = nullptr;
}
return typed_slot_set;
}
int FreeListsLength();
// Approximate amount of physical memory committed for this chunk.
V8_EXPORT_PRIVATE size_t CommittedPhysicalMemory() const;
class ProgressBar& ProgressBar() {
return progress_bar_;
}
const class ProgressBar& ProgressBar() const { return progress_bar_; }
inline void IncrementExternalBackingStoreBytes(ExternalBackingStoreType type,
size_t amount);
inline void DecrementExternalBackingStoreBytes(ExternalBackingStoreType type,
size_t amount);
size_t ExternalBackingStoreBytes(ExternalBackingStoreType type) const {
return external_backing_store_bytes_[static_cast<int>(type)];
}
Space* owner() const {
return reinterpret_cast<Space*>(BasicMemoryChunk::owner());
}
// Gets the chunk's allocation space, potentially dealing with a null owner_
// (like read-only chunks have).
inline AllocationSpace owner_identity() const;
// Emits a memory barrier. For TSAN builds the other thread needs to perform
// MemoryChunk::synchronized_heap() to simulate the barrier.
void InitializationMemoryFence();
static PageAllocator::Permission GetCodeModificationPermission() {
DCHECK(!V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT);
// On MacOS on ARM64 RWX permissions are allowed to be set only when
// fast W^X is enabled (see V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT).
return !V8_HAS_PTHREAD_JIT_WRITE_PROTECT && v8_flags.write_code_using_rwx
? PageAllocator::kReadWriteExecute
: PageAllocator::kReadWrite;
}
V8_EXPORT_PRIVATE void SetReadable();
V8_EXPORT_PRIVATE void SetReadAndExecutable();
// Used by the mprotect version of CodePageMemoryModificationScope to toggle
// the writable permission bit of the MemoryChunk.
// The returned MutexGuard protects the page from concurrent access. The
// caller needs to call SetDefaultCodePermissions before releasing the
// MutexGuard.
V8_EXPORT_PRIVATE base::MutexGuard SetCodeModificationPermissions();
V8_EXPORT_PRIVATE void SetDefaultCodePermissions();
heap::ListNode<MemoryChunk>& list_node() { return list_node_; }
const heap::ListNode<MemoryChunk>& list_node() const { return list_node_; }
PossiblyEmptyBuckets* possibly_empty_buckets() {
return &possibly_empty_buckets_;
}
// Release memory allocated by the chunk, except that which is needed by
// read-only space chunks.
void ReleaseAllocatedMemoryNeededForWritableChunk();
void IncreaseAllocatedLabSize(size_t bytes) { allocated_lab_size_ += bytes; }
void DecreaseAllocatedLabSize(size_t bytes) {
DCHECK_GE(allocated_lab_size_, bytes);
allocated_lab_size_ -= bytes;
}
size_t AllocatedLabSize() const { return allocated_lab_size_; }
void IncrementAgeInNewSpace() { age_in_new_space_++; }
void ResetAgeInNewSpace() { age_in_new_space_ = 0; }
size_t AgeInNewSpace() const { return age_in_new_space_; }
void ResetAllocationStatistics() {
BasicMemoryChunk::ResetAllocationStatistics();
allocated_lab_size_ = 0;
}
MarkingBitmap* marking_bitmap() {
DCHECK(!InReadOnlySpace());
return &marking_bitmap_;
}
const MarkingBitmap* marking_bitmap() const {
DCHECK(!InReadOnlySpace());
return &marking_bitmap_;
}
size_t live_bytes() const {
return live_byte_count_.load(std::memory_order_relaxed);
}
void SetLiveBytes(size_t value) {
DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
IsAligned(value, kObjectAlignment8GbHeap));
live_byte_count_.store(value, std::memory_order_relaxed);
}
void IncrementLiveBytesAtomically(intptr_t diff) {
DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
IsAligned(diff, kObjectAlignment8GbHeap));
live_byte_count_.fetch_add(diff, std::memory_order_relaxed);
}
void ClearLiveness();
protected:
// Release all memory allocated by the chunk. Should be called when memory
// chunk is about to be freed.
void ReleaseAllAllocatedMemory();
// Sets the requested page permissions only if the write unprotect counter
// has reached 0.
void DecrementWriteUnprotectCounterAndMaybeSetPermissions(
PageAllocator::Permission permission);
#ifdef DEBUG
static void ValidateOffsets(MemoryChunk* chunk);
#endif
template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
void set_slot_set(SlotSet* slot_set) {
if (access_mode == AccessMode::ATOMIC) {
base::AsAtomicPointer::Release_Store(&slot_set_[type], slot_set);
return;
}
slot_set_[type] = slot_set;
}
template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
void set_typed_slot_set(TypedSlotSet* typed_slot_set) {
if (access_mode == AccessMode::ATOMIC) {
base::AsAtomicPointer::Release_Store(&typed_slot_set_[type],
typed_slot_set);
return;
}
typed_slot_set_[type] = typed_slot_set;
}
// A single slot set for small pages (of size kPageSize) or an array of slot
// set for large pages. In the latter case the number of entries in the array
// is ceil(size() / kPageSize).
SlotSet* slot_set_[NUMBER_OF_REMEMBERED_SET_TYPES] = {nullptr};
// A single slot set for small pages (of size kPageSize) or an array of slot
// set for large pages. In the latter case the number of entries in the array
// is ceil(size() / kPageSize).
TypedSlotSet* typed_slot_set_[NUMBER_OF_REMEMBERED_SET_TYPES] = {nullptr};
// Used by the marker to keep track of the scanning progress in large objects
// that have a progress bar and are scanned in increments.
class ProgressBar progress_bar_;
// Count of bytes marked black on page.
std::atomic<intptr_t> live_byte_count_{0};
base::Mutex* mutex_;
base::SharedMutex* shared_mutex_;
base::Mutex* page_protection_change_mutex_;
std::atomic<ConcurrentSweepingState> concurrent_sweeping_{
ConcurrentSweepingState::kDone};
// Tracks off-heap memory used by this memory chunk.
std::atomic<size_t> external_backing_store_bytes_[static_cast<int>(
ExternalBackingStoreType::kNumValues)] = {0};
heap::ListNode<MemoryChunk> list_node_;
FreeListCategory** categories_ = nullptr;
PossiblyEmptyBuckets possibly_empty_buckets_;
ActiveSystemPages* active_system_pages_;
// Counts overall allocated LAB size on the page since the last GC. Used
// only for new space pages.
size_t allocated_lab_size_ = 0;
// Counts the number of young gen GCs that a page survived in new space. This
// counter is reset to 0 whenever the page is empty.
size_t age_in_new_space_ = 0;
MarkingBitmap marking_bitmap_;
private:
friend class ConcurrentMarkingState;
friend class MarkingState;
friend class AtomicMarkingState;
friend class NonAtomicMarkingState;
friend class MemoryAllocator;
friend class MemoryChunkValidator;
friend class PagedSpace;
template <RememberedSetType>
friend class RememberedSet;
friend class YoungGenerationMarkingState;
};
} // namespace internal
namespace base {
// Define special hash function for chunk pointers, to be used with std data
// structures, e.g. std::unordered_set<MemoryChunk*, base::hash<MemoryChunk*>
template <>
struct hash<i::MemoryChunk*> : hash<i::BasicMemoryChunk*> {};
template <>
struct hash<const i::MemoryChunk*> : hash<const i::BasicMemoryChunk*> {};
} // namespace base
} // namespace v8
#endif // V8_HEAP_MEMORY_CHUNK_H_
|