forked from mrsone40/node
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfixed-array.cc
More file actions
393 lines (346 loc) · 12.7 KB
/
fixed-array.cc
File metadata and controls
393 lines (346 loc) · 12.7 KB
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
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
// Copyright 2023 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/objects/fixed-array.h"
#include "src/objects/map-inl.h"
namespace v8 {
namespace internal {
int FixedArrayBase::GetMaxLengthForNewSpaceAllocation(ElementsKind kind) {
return ((kMaxRegularHeapObjectSize - FixedArrayBase::kHeaderSize) >>
ElementsKindToShiftSize(kind));
}
bool FixedArrayBase::IsCowArray() const {
return map() == GetReadOnlyRoots().fixed_cow_array_map();
}
// static
Handle<TemplateList> TemplateList::New(Isolate* isolate, int size) {
Handle<FixedArray> list = isolate->factory()->NewFixedArray(
kLengthIndex + size, AllocationType::kOld);
list->set(kLengthIndex, Smi::zero());
return Handle<TemplateList>::cast(list);
}
// static
Handle<TemplateList> TemplateList::Add(Isolate* isolate,
Handle<TemplateList> list,
Handle<i::Object> value) {
static_assert(kFirstElementIndex == 1);
int index = list->length() + 1;
Handle<i::FixedArray> fixed_array = Handle<FixedArray>::cast(list);
fixed_array = FixedArray::SetAndGrow(isolate, fixed_array, index, value);
fixed_array->set(kLengthIndex, Smi::FromInt(index));
return Handle<TemplateList>::cast(fixed_array);
}
Handle<FixedArray> FixedArray::SetAndGrow(Isolate* isolate,
Handle<FixedArray> array, int index,
Handle<Object> value) {
int src_length = array->length();
if (index < src_length) {
array->set(index, *value);
return array;
}
int capacity = src_length;
do {
capacity = JSObject::NewElementsCapacity(capacity);
} while (capacity <= index);
Handle<FixedArray> new_array = isolate->factory()->NewFixedArray(capacity);
DisallowGarbageCollection no_gc;
Tagged<FixedArray> raw_src = *array;
Tagged<FixedArray> raw_dst = *new_array;
raw_src->CopyTo(0, raw_dst, 0, src_length);
DCHECK_EQ(raw_dst->length(), capacity);
raw_dst->FillWithHoles(src_length, capacity);
raw_dst->set(index, *value);
return new_array;
}
Handle<FixedArray> FixedArray::ShrinkOrEmpty(Isolate* isolate,
Handle<FixedArray> array,
int new_length) {
if (new_length == 0) {
return array->GetReadOnlyRoots().empty_fixed_array_handle();
} else {
array->Shrink(isolate, new_length);
return array;
}
}
void FixedArray::Shrink(Isolate* isolate, int new_length) {
DCHECK(0 < new_length && new_length <= length());
if (new_length < length()) {
isolate->heap()->RightTrimFixedArray(*this, length() - new_length);
}
}
void FixedArray::CopyTo(int pos, Tagged<FixedArray> dest, int dest_pos,
int len) const {
DisallowGarbageCollection no_gc;
// Return early if len == 0 so that we don't try to read the write barrier off
// a canonical read-only empty fixed array.
if (len == 0) return;
WriteBarrierMode mode = dest->GetWriteBarrierMode(no_gc);
for (int index = 0; index < len; index++) {
dest->set(dest_pos + index, get(pos + index), mode);
}
}
// static
Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
Handle<Object> obj,
AllocationType allocation) {
int length = array->Length();
array = EnsureSpace(isolate, array, length + 1, allocation);
// Check that GC didn't remove elements from the array.
DCHECK_EQ(array->Length(), length);
{
DisallowGarbageCollection no_gc;
Tagged<ArrayList> raw_array = *array;
raw_array->Set(length, *obj);
raw_array->SetLength(length + 1);
}
return array;
}
Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
Tagged<Smi> obj1) {
int length = array->Length();
array = EnsureSpace(isolate, array, length + 1);
// Check that GC didn't remove elements from the array.
DCHECK_EQ(array->Length(), length);
{
DisallowGarbageCollection no_gc;
Tagged<ArrayList> raw_array = *array;
raw_array->Set(length, obj1);
raw_array->SetLength(length + 1);
}
return array;
}
// static
Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
Handle<Object> obj1, Handle<Object> obj2) {
int length = array->Length();
array = EnsureSpace(isolate, array, length + 2);
// Check that GC didn't remove elements from the array.
DCHECK_EQ(array->Length(), length);
{
DisallowGarbageCollection no_gc;
Tagged<ArrayList> raw_array = *array;
raw_array->Set(length, *obj1);
raw_array->Set(length + 1, *obj2);
raw_array->SetLength(length + 2);
}
return array;
}
Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
Handle<Object> obj1, Tagged<Smi> obj2,
Tagged<Smi> obj3, Tagged<Smi> obj4) {
int length = array->Length();
array = EnsureSpace(isolate, array, length + 4);
// Check that GC didn't remove elements from the array.
DCHECK_EQ(array->Length(), length);
{
DisallowGarbageCollection no_gc;
Tagged<ArrayList> raw_array = *array;
raw_array->Set(length, *obj1);
raw_array->Set(length + 1, obj2);
raw_array->Set(length + 2, obj3);
raw_array->Set(length + 3, obj4);
raw_array->SetLength(length + 4);
}
return array;
}
// static
Handle<ArrayList> ArrayList::New(Isolate* isolate, int size,
AllocationType allocation) {
return isolate->factory()->NewArrayList(size, allocation);
}
Handle<FixedArray> ArrayList::Elements(Isolate* isolate,
Handle<ArrayList> array) {
int length = array->Length();
Handle<FixedArray> result = isolate->factory()->NewFixedArray(length);
// Do not copy the first entry, i.e., the length.
array->CopyTo(kFirstIndex, *result, 0, length);
return result;
}
namespace {
Handle<FixedArray> EnsureSpaceInFixedArray(Isolate* isolate,
Handle<FixedArray> array, int length,
AllocationType allocation) {
// Ensure calculation matches CodeStubAssembler::ArrayListEnsureSpace.
int capacity = array->length();
if (capacity < length) {
int new_capacity = length;
new_capacity = new_capacity + std::max(new_capacity / 2, 2);
int grow_by = new_capacity - capacity;
array =
isolate->factory()->CopyFixedArrayAndGrow(array, grow_by, allocation);
}
return array;
}
} // namespace
// static
Handle<ArrayList> ArrayList::EnsureSpace(Isolate* isolate,
Handle<ArrayList> array, int length,
AllocationType allocation) {
DCHECK_LT(0, length);
Handle<ArrayList> new_array = Handle<ArrayList>::cast(EnsureSpaceInFixedArray(
isolate, array, kFirstIndex + length, allocation));
DCHECK_EQ(array->Length(), new_array->Length());
return new_array;
}
// static
Handle<WeakArrayList> WeakArrayList::AddToEnd(Isolate* isolate,
Handle<WeakArrayList> array,
MaybeObjectHandle value) {
int length = array->length();
array = EnsureSpace(isolate, array, length + 1);
{
DisallowGarbageCollection no_gc;
Tagged<WeakArrayList> raw = *array;
// Reload length; GC might have removed elements from the array.
length = raw->length();
raw->Set(length, *value);
raw->set_length(length + 1);
}
return array;
}
Handle<WeakArrayList> WeakArrayList::AddToEnd(Isolate* isolate,
Handle<WeakArrayList> array,
MaybeObjectHandle value1,
Tagged<Smi> value2) {
int length = array->length();
array = EnsureSpace(isolate, array, length + 2);
{
DisallowGarbageCollection no_gc;
Tagged<WeakArrayList> raw = *array;
// Reload length; GC might have removed elements from the array.
length = array->length();
raw->Set(length, *value1);
raw->Set(length + 1, value2);
raw->set_length(length + 2);
}
return array;
}
// static
Handle<WeakArrayList> WeakArrayList::Append(Isolate* isolate,
Handle<WeakArrayList> array,
MaybeObjectHandle value,
AllocationType allocation) {
int length = 0;
int new_length = 0;
{
DisallowGarbageCollection no_gc;
Tagged<WeakArrayList> raw = *array;
length = raw->length();
if (length < raw->capacity()) {
raw->Set(length, *value);
raw->set_length(length + 1);
return array;
}
// Not enough space in the array left, either grow, shrink or
// compact the array.
new_length = raw->CountLiveElements() + 1;
}
bool shrink = new_length < length / 4;
bool grow = 3 * (length / 4) < new_length;
if (shrink || grow) {
// Grow or shrink array and compact out-of-place.
int new_capacity = CapacityForLength(new_length);
array = isolate->factory()->CompactWeakArrayList(array, new_capacity,
allocation);
} else {
// Perform compaction in the current array.
array->Compact(isolate);
}
// Now append value to the array, there should always be enough space now.
DCHECK_LT(array->length(), array->capacity());
{
DisallowGarbageCollection no_gc;
Tagged<WeakArrayList> raw = *array;
// Reload length, allocation might have killed some weak refs.
int index = raw->length();
raw->Set(index, *value);
raw->set_length(index + 1);
}
return array;
}
void WeakArrayList::Compact(Isolate* isolate) {
DisallowGarbageCollection no_gc;
int length = this->length();
int new_length = 0;
for (int i = 0; i < length; i++) {
MaybeObject value = Get(isolate, i);
if (!value->IsCleared()) {
if (new_length != i) {
Set(new_length, value);
}
++new_length;
}
}
set_length(new_length);
}
bool WeakArrayList::IsFull() const { return length() == capacity(); }
// static
Handle<WeakArrayList> WeakArrayList::EnsureSpace(Isolate* isolate,
Handle<WeakArrayList> array,
int length,
AllocationType allocation) {
int capacity = array->capacity();
if (capacity < length) {
int grow_by = CapacityForLength(length) - capacity;
array = isolate->factory()->CopyWeakArrayListAndGrow(array, grow_by,
allocation);
}
return array;
}
int WeakArrayList::CountLiveWeakReferences() const {
int live_weak_references = 0;
for (int i = 0; i < length(); i++) {
if (Get(i)->IsWeak()) {
++live_weak_references;
}
}
return live_weak_references;
}
int WeakArrayList::CountLiveElements() const {
int non_cleared_objects = 0;
for (int i = 0; i < length(); i++) {
if (!Get(i)->IsCleared()) {
++non_cleared_objects;
}
}
return non_cleared_objects;
}
bool WeakArrayList::RemoveOne(MaybeObjectHandle value) {
int last_index = length() - 1;
// Optimize for the most recently added element to be removed again.
for (int i = last_index; i >= 0; --i) {
if (Get(i) != *value) continue;
// Move the last element into this slot (or no-op, if this is the last
// slot).
Set(i, Get(last_index));
Set(last_index, HeapObjectReference::ClearedValue(GetIsolate()));
set_length(last_index);
return true;
}
return false;
}
bool WeakArrayList::Contains(MaybeObject value) {
for (int i = 0; i < length(); ++i) {
if (Get(i) == value) return true;
}
return false;
}
Handle<RegExpMatchInfo> RegExpMatchInfo::New(Isolate* isolate,
int capture_count) {
Handle<RegExpMatchInfo> match_info = isolate->factory()->NewRegExpMatchInfo();
return ReserveCaptures(isolate, match_info, capture_count);
}
Handle<RegExpMatchInfo> RegExpMatchInfo::ReserveCaptures(
Isolate* isolate, Handle<RegExpMatchInfo> match_info, int capture_count) {
DCHECK_GE(match_info->length(), kLastMatchOverhead);
int capture_register_count =
JSRegExp::RegistersForCaptureCount(capture_count);
const int required_length = kFirstCaptureIndex + capture_register_count;
Handle<RegExpMatchInfo> result =
Handle<RegExpMatchInfo>::cast(EnsureSpaceInFixedArray(
isolate, match_info, required_length, AllocationType::kYoung));
result->SetNumberOfCaptureRegisters(capture_register_count);
return result;
}
} // namespace internal
} // namespace v8