Repository navigation
Expand file tree
/
Copy pathArrayConstructor.cpp
More file actions
499 lines (416 loc) · 20.3 KB
/
Copy pathArrayConstructor.cpp
File metadata and controls
499 lines (416 loc) · 20.3 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
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
/*
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
* Copyright (C) 2003-2022 Apple Inc. All rights reserved.
* Copyright (C) 2003 Peter Kelly (pmk@post.com)
* Copyright (C) 2006 Alexey Proskuryakov (ap@nypop.com)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
* USA
*
*/
#include "config.h"
#include "ArrayConstructor.h"
#include "ArrayPrototype.h"
#include "ArrayPrototypeInlines.h"
#include "BuiltinNames.h"
#include "ClonedArguments.h"
#include "ExecutableBaseInlines.h"
#include "JSCInlines.h"
#include "JSSet.h"
#include "JSSetInlines.h"
#include "ProxyObject.h"
#include <wtf/text/MakeString.h>
#include "VMInlines.h"
#include "ArrayConstructor.lut.h"
namespace JSC {
const ASCIILiteral ArrayInvalidLengthError { "Array length must be a positive integer of safe magnitude."_s };
STATIC_ASSERT_IS_TRIVIALLY_DESTRUCTIBLE(ArrayConstructor);
const ClassInfo ArrayConstructor::s_info = { "Function"_s, &InternalFunction::s_info, &arrayConstructorTable, nullptr, CREATE_METHOD_TABLE(ArrayConstructor) };
/* Source for ArrayConstructor.lut.h
@begin arrayConstructorTable
from JSBuiltin DontEnum|Function 1
@end
*/
static JSC_DECLARE_HOST_FUNCTION(callArrayConstructor);
static JSC_DECLARE_HOST_FUNCTION(constructWithArrayConstructor);
static JSC_DECLARE_HOST_FUNCTION(arrayConstructorOf);
ArrayConstructor::ArrayConstructor(VM& vm, Structure* structure)
: InternalFunction(vm, structure, callArrayConstructor, constructWithArrayConstructor)
{
}
void ArrayConstructor::finishCreation(VM& vm, JSGlobalObject* globalObject, ArrayPrototype* arrayPrototype)
{
Base::finishCreation(vm, 1, vm.propertyNames->Array.string(), PropertyAdditionMode::WithoutStructureTransition);
putDirectWithoutTransition(vm, vm.propertyNames->prototype, arrayPrototype, PropertyAttribute::DontEnum | PropertyAttribute::DontDelete | PropertyAttribute::ReadOnly);
putDirectNonIndexAccessorWithoutTransition(vm, vm.propertyNames->speciesSymbol, globalObject->arraySpeciesGetterSetter(), PropertyAttribute::Accessor | PropertyAttribute::ReadOnly | PropertyAttribute::DontEnum);
JSC_NATIVE_INTRINSIC_FUNCTION_WITHOUT_TRANSITION(vm.propertyNames->of, arrayConstructorOf, static_cast<unsigned>(PropertyAttribute::DontEnum), 0, ImplementationVisibility::Public, ArrayConstructorOfIntrinsic);
JSC_BUILTIN_FUNCTION_WITHOUT_TRANSITION(vm.propertyNames->isArray, arrayConstructorIsArrayCodeGenerator, static_cast<unsigned>(PropertyAttribute::DontEnum));
JSC_BUILTIN_FUNCTION_WITHOUT_TRANSITION(vm.propertyNames->builtinNames().fromPrivateName(), arrayConstructorFromCodeGenerator, static_cast<unsigned>(PropertyAttribute::DontEnum));
JSC_BUILTIN_FUNCTION_WITHOUT_TRANSITION(vm.propertyNames->builtinNames().fromAsyncPublicName(), arrayConstructorFromAsyncCodeGenerator, static_cast<unsigned>(PropertyAttribute::DontEnum));
}
// ------------------------------ Functions ---------------------------
JSArray* constructArrayWithSizeQuirk(JSGlobalObject* globalObject, ArrayAllocationProfile* profile, JSValue length, JSValue newTarget)
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
if (!length.isNumber())
RELEASE_AND_RETURN(scope, constructArrayNegativeIndexed(globalObject, profile, &length, 1, newTarget));
uint32_t n = length.toUInt32(globalObject);
if (n != length.toNumber(globalObject)) {
throwException(globalObject, scope, createRangeError(globalObject, ArrayInvalidLengthError));
return nullptr;
}
RELEASE_AND_RETURN(scope, constructEmptyArray(globalObject, profile, n, newTarget));
}
static inline JSArray* constructArrayWithSizeQuirk(JSGlobalObject* globalObject, const ArgList& args, JSValue newTarget)
{
// a single numeric argument denotes the array size (!)
if (args.size() == 1)
return constructArrayWithSizeQuirk(globalObject, nullptr, args.at(0), newTarget);
// otherwise the array is constructed with the arguments in it
return constructArray(globalObject, static_cast<ArrayAllocationProfile*>(nullptr), args, newTarget);
}
JSC_DEFINE_HOST_FUNCTION(constructWithArrayConstructor, (JSGlobalObject* globalObject, CallFrame* callFrame))
{
ArgList args(callFrame);
return JSValue::encode(constructArrayWithSizeQuirk(globalObject, args, callFrame->newTarget()));
}
JSC_DEFINE_HOST_FUNCTION(callArrayConstructor, (JSGlobalObject* globalObject, CallFrame* callFrame))
{
ArgList args(callFrame);
return JSValue::encode(constructArrayWithSizeQuirk(globalObject, args, JSValue()));
}
static ALWAYS_INLINE bool isArraySlowInline(JSGlobalObject* globalObject, ProxyObject* proxy)
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
while (true) {
if (proxy->isRevoked()) [[unlikely]] {
auto* callFrame = vm.topJSCallFrame();
auto* callee = callFrame && !callFrame->isNativeCalleeFrame() ? callFrame->jsCallee() : nullptr;
ASCIILiteral calleeName = "Array.isArray"_s;
auto* function = callee ? jsDynamicCast<JSFunction*>(callee) : nullptr;
// If this function is from a different globalObject than the one passed in above,
// then this test will fail even if function is Object.prototype.toString. The only
// way this test will be work everytime is if we check against the
// Object.prototype.toString of the function's own globalObject.
if (function && function == function->globalObject()->objectProtoToStringFunctionConcurrently())
calleeName = "Object.prototype.toString"_s;
throwTypeError(globalObject, scope, makeString(calleeName, " cannot be called on a Proxy that has been revoked"_s));
return false;
}
JSObject* argument = proxy->target();
if (argument->type() == ArrayType || argument->type() == DerivedArrayType)
return true;
if (argument->type() != ProxyObjectType)
return false;
proxy = jsCast<ProxyObject*>(argument);
}
ASSERT_NOT_REACHED();
}
bool isArraySlow(JSGlobalObject* globalObject, ProxyObject* argument)
{
return isArraySlowInline(globalObject, argument);
}
// ES6 7.2.2
// https://tc39.github.io/ecma262/#sec-isarray
JSC_DEFINE_HOST_FUNCTION(arrayConstructorPrivateFuncIsArraySlow, (JSGlobalObject* globalObject, CallFrame* callFrame))
{
ASSERT_UNUSED(globalObject, jsDynamicCast<ProxyObject*>(callFrame->argument(0)));
return JSValue::encode(jsBoolean(isArraySlowInline(globalObject, jsCast<ProxyObject*>(callFrame->uncheckedArgument(0)))));
}
ALWAYS_INLINE JSArray* fastArrayOf(JSGlobalObject* globalObject, CallFrame* callFrame, size_t length)
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
if (!length)
RELEASE_AND_RETURN(scope, constructEmptyArray(globalObject, nullptr));
IndexingType indexingType = IsArray;
for (unsigned i = 0; i < length; ++i)
indexingType = leastUpperBoundOfIndexingTypeAndValue(indexingType, callFrame->uncheckedArgument(i));
Structure* resultStructure = globalObject->arrayStructureForIndexingTypeDuringAllocation(indexingType);
IndexingType resultIndexingType = resultStructure->indexingType();
if (hasAnyArrayStorage(resultIndexingType)) [[unlikely]]
return nullptr;
ASSERT(!globalObject->isHavingABadTime());
auto vectorLength = Butterfly::optimalContiguousVectorLength(resultStructure, length);
void* memory = vm.auxiliarySpace().allocate(
vm,
Butterfly::totalSize(0, 0, true, vectorLength * sizeof(EncodedJSValue)),
nullptr, AllocationFailureMode::ReturnNull);
if (!memory) [[unlikely]]
return nullptr;
auto* resultButterfly = Butterfly::fromBase(memory, 0, 0);
resultButterfly->setVectorLength(vectorLength);
resultButterfly->setPublicLength(length);
if (hasDouble(resultIndexingType)) {
for (uint64_t i = 0; i < length; ++i) {
JSValue value = callFrame->uncheckedArgument(i);
ASSERT(value.isNumber());
resultButterfly->contiguousDouble().atUnsafe(i) = value.asNumber();
}
} else if (hasInt32(resultIndexingType) || hasContiguous(resultIndexingType)) {
for (size_t i = 0; i < length; ++i) {
JSValue value = callFrame->uncheckedArgument(i);
resultButterfly->contiguous().atUnsafe(i).setWithoutWriteBarrier(value);
}
} else
RELEASE_ASSERT_NOT_REACHED();
Butterfly::clearRange(resultIndexingType, resultButterfly, length, vectorLength);
return JSArray::createWithButterfly(vm, nullptr, resultStructure, resultButterfly);
}
JSC_DEFINE_HOST_FUNCTION(arrayConstructorOf, (JSGlobalObject* globalObject, CallFrame* callFrame))
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
JSValue thisValue = callFrame->thisValue().toThis(globalObject, ECMAMode::strict());
size_t length = callFrame->argumentCount();
if (thisValue == globalObject->arrayConstructor() || !thisValue.isConstructor()) [[likely]] {
JSArray* result = fastArrayOf(globalObject, callFrame, length);
RETURN_IF_EXCEPTION(scope, { });
if (result) [[likely]]
return JSValue::encode(result);
}
JSObject* result = nullptr;
if (thisValue.isConstructor()) {
MarkedArgumentBuffer args;
args.append(jsNumber(length));
result = construct(globalObject, thisValue, args, "Array.of did not get a valid constructor");
RETURN_IF_EXCEPTION(scope, { });
} else {
result = JSArray::tryCreate(vm, globalObject->arrayStructureForIndexingTypeDuringAllocation(ArrayWithUndecided), length);
if (!result) [[unlikely]] {
throwOutOfMemoryError(globalObject, scope);
return { };
}
}
for (unsigned i = 0; i < length; ++i) {
JSValue value = callFrame->uncheckedArgument(i);
result->putDirectIndex(globalObject, i, value, 0, PutDirectIndexShouldThrow);
RETURN_IF_EXCEPTION(scope, { });
}
scope.release();
setLength(globalObject, vm, result, length);
return JSValue::encode(result);
}
static ALWAYS_INLINE unsigned getArgumentsLength(ScopedArguments* arguments)
{
return arguments->internalLength();
}
static ALWAYS_INLINE unsigned getArgumentsLength(DirectArguments* arguments)
{
return arguments->internalLength();
}
static ALWAYS_INLINE unsigned getArgumentsLength(ClonedArguments* arguments)
{
ASSERT(arguments->isIteratorProtocolFastAndNonObservable());
JSValue lengthValue = arguments->getDirect(clonedArgumentsLengthPropertyOffset);
ASSERT(lengthValue.isInt32() && lengthValue.asInt32() >= 0);
return lengthValue.asInt32();
}
template<typename Arguments>
static ALWAYS_INLINE JSArray* tryCreateArrayFromArguments(JSGlobalObject* globalObject, Arguments* arguments)
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
unsigned length = getArgumentsLength(arguments);
if (!length)
RELEASE_AND_RETURN(scope, constructEmptyArray(globalObject, nullptr));
IndexingType indexingType = IsArray;
for (unsigned i = 0; i < length; ++i) {
JSValue value = arguments->getIndexQuickly(i);
if (!value)
value = jsUndefined();
indexingType = leastUpperBoundOfIndexingTypeAndValue(indexingType, value);
}
Structure* resultStructure = globalObject->arrayStructureForIndexingTypeDuringAllocation(indexingType);
IndexingType resultIndexingType = resultStructure->indexingType();
if (hasAnyArrayStorage(resultIndexingType)) [[unlikely]]
return nullptr;
ASSERT(!globalObject->isHavingABadTime());
auto vectorLength = Butterfly::optimalContiguousVectorLength(resultStructure, length);
void* memory = vm.auxiliarySpace().allocate(
vm,
Butterfly::totalSize(0, 0, true, vectorLength * sizeof(EncodedJSValue)),
nullptr, AllocationFailureMode::ReturnNull);
if (!memory) [[unlikely]]
return nullptr;
auto* resultButterfly = Butterfly::fromBase(memory, 0, 0);
resultButterfly->setVectorLength(vectorLength);
resultButterfly->setPublicLength(length);
if (hasDouble(resultIndexingType)) {
for (uint64_t i = 0; i < length; ++i) {
JSValue value = arguments->getIndexQuickly(i);
ASSERT(value.isNumber());
resultButterfly->contiguousDouble().atUnsafe(i) = value.asNumber();
}
} else if (hasInt32(resultIndexingType) || hasContiguous(resultIndexingType)) {
for (size_t i = 0; i < length; ++i) {
JSValue value = arguments->getIndexQuickly(i);
if (!value)
value = jsUndefined();
resultButterfly->contiguous().atUnsafe(i).setWithoutWriteBarrier(value);
}
} else
RELEASE_ASSERT_NOT_REACHED();
Butterfly::clearRange(resultIndexingType, resultButterfly, length, vectorLength);
return JSArray::createWithButterfly(vm, nullptr, resultStructure, resultButterfly);
}
static JSArray* tryCreateArrayFromScopedArguments(JSGlobalObject* globalObject, ScopedArguments* arguments)
{
return tryCreateArrayFromArguments(globalObject, arguments);
}
static JSArray* tryCreateArrayFromDirectArguments(JSGlobalObject* globalObject, DirectArguments* arguments)
{
return tryCreateArrayFromArguments(globalObject, arguments);
}
static JSArray* tryCreateArrayFromClonedArguments(JSGlobalObject* globalObject, ClonedArguments* arguments)
{
return tryCreateArrayFromArguments(globalObject, arguments);
}
static JSArray* tryCreateArrayFromSet(JSGlobalObject* globalObject, JSSet* set)
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
unsigned length = set->size();
if (!length)
RELEASE_AND_RETURN(scope, constructEmptyArray(globalObject, nullptr));
JSCell* storageCell = set->storageOrSentinel(vm);
if (storageCell == vm.orderedHashTableSentinel())
RELEASE_AND_RETURN(scope, constructEmptyArray(globalObject, nullptr));
auto* storage = jsCast<JSSet::Storage*>(storageCell);
// First pass: determine indexing type
IndexingType indexingType = IsArray;
JSSet::Helper::Entry entry = 0;
while (true) {
storageCell = JSSet::Helper::nextAndUpdateIterationEntry(vm, *storage, entry);
if (storageCell == vm.orderedHashTableSentinel())
break;
auto* currentStorage = jsCast<JSSet::Storage*>(storageCell);
entry = JSSet::Helper::iterationEntry(*currentStorage) + 1;
JSValue entryKey = JSSet::Helper::getIterationEntryKey(*currentStorage);
indexingType = leastUpperBoundOfIndexingTypeAndValue(indexingType, entryKey);
storage = currentStorage;
}
Structure* resultStructure = globalObject->arrayStructureForIndexingTypeDuringAllocation(indexingType);
IndexingType resultIndexingType = resultStructure->indexingType();
if (hasAnyArrayStorage(resultIndexingType)) [[unlikely]]
return nullptr;
ASSERT(!globalObject->isHavingABadTime());
auto vectorLength = Butterfly::optimalContiguousVectorLength(resultStructure, length);
void* memory = vm.auxiliarySpace().allocate(
vm,
Butterfly::totalSize(0, 0, true, vectorLength * sizeof(EncodedJSValue)),
nullptr, AllocationFailureMode::ReturnNull);
if (!memory) [[unlikely]]
return nullptr;
auto* resultButterfly = Butterfly::fromBase(memory, 0, 0);
resultButterfly->setVectorLength(vectorLength);
resultButterfly->setPublicLength(length);
// Second pass: copy elements
storageCell = set->storageOrSentinel(vm);
if (storageCell == vm.orderedHashTableSentinel()) [[unlikely]]
return nullptr;
storage = jsCast<JSSet::Storage*>(storageCell);
entry = 0;
size_t i = 0;
if (hasDouble(resultIndexingType)) {
while (true) {
storageCell = JSSet::Helper::nextAndUpdateIterationEntry(vm, *storage, entry);
if (storageCell == vm.orderedHashTableSentinel())
break;
auto* currentStorage = jsCast<JSSet::Storage*>(storageCell);
entry = JSSet::Helper::iterationEntry(*currentStorage) + 1;
JSValue value = JSSet::Helper::getIterationEntryKey(*currentStorage);
ASSERT(value.isNumber());
resultButterfly->contiguousDouble().atUnsafe(i) = value.asNumber();
++i;
storage = currentStorage;
}
} else if (hasInt32(resultIndexingType) || hasContiguous(resultIndexingType)) {
while (true) {
storageCell = JSSet::Helper::nextAndUpdateIterationEntry(vm, *storage, entry);
if (storageCell == vm.orderedHashTableSentinel())
break;
auto* currentStorage = jsCast<JSSet::Storage*>(storageCell);
entry = JSSet::Helper::iterationEntry(*currentStorage) + 1;
JSValue value = JSSet::Helper::getIterationEntryKey(*currentStorage);
resultButterfly->contiguous().atUnsafe(i).setWithoutWriteBarrier(value);
++i;
storage = currentStorage;
}
} else
RELEASE_ASSERT_NOT_REACHED();
Butterfly::clearRange(resultIndexingType, resultButterfly, length, vectorLength);
return JSArray::createWithButterfly(vm, nullptr, resultStructure, resultButterfly);
}
JSC_DEFINE_HOST_FUNCTION(arrayConstructorPrivateFromFastWithoutMapFn, (JSGlobalObject* globalObject, CallFrame* callFrame))
{
VM& vm = globalObject->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
ASSERT(callFrame->argumentCount() == 2);
JSValue constructor = callFrame->uncheckedArgument(0);
if (constructor != globalObject->arrayConstructor() && constructor.isObject()) [[unlikely]]
return JSValue::encode(jsUndefined());
JSValue items = callFrame->uncheckedArgument(1);
JSArray* result = nullptr;
if (isJSArray(items)) [[likely]] {
// For `Array.from(array)`
result = tryCloneArrayFromFast<ArrayFillMode::Undefined>(globalObject, items);
RETURN_IF_EXCEPTION(scope, { });
} else if (items && items.isCell() && TypeInfo::isArgumentsType(items.asCell()->type())) {
// For `Array.from(arguments)`
switch (items.asCell()->type()) {
case DirectArgumentsType: {
auto* arguments = jsCast<DirectArguments*>(items.asCell());
if (arguments->isIteratorProtocolFastAndNonObservable()) [[likely]] {
result = tryCreateArrayFromDirectArguments(globalObject, arguments);
RETURN_IF_EXCEPTION(scope, { });
}
break;
}
case ScopedArgumentsType: {
auto* arguments = jsCast<ScopedArguments*>(items.asCell());
if (arguments->isIteratorProtocolFastAndNonObservable()) [[likely]] {
result = tryCreateArrayFromScopedArguments(globalObject, arguments);
RETURN_IF_EXCEPTION(scope, { });
}
break;
}
case ClonedArgumentsType: {
auto* arguments = jsCast<ClonedArguments*>(items.asCell());
if (arguments->isIteratorProtocolFastAndNonObservable()) [[likely]] {
result = tryCreateArrayFromClonedArguments(globalObject, arguments);
RETURN_IF_EXCEPTION(scope, { });
}
break;
}
default:
RELEASE_ASSERT_NOT_REACHED();
break;
}
} else if (items && items.isCell() && items.asCell()->type() == JSSetType) {
// For `Array.from(set)`
auto* set = jsCast<JSSet*>(items.asCell());
if (set->isIteratorProtocolFastAndNonObservable()) [[likely]] {
result = tryCreateArrayFromSet(globalObject, set);
RETURN_IF_EXCEPTION(scope, { });
}
}
if (result)
return JSValue::encode(result);
return JSValue::encode(jsUndefined());
}
} // namespace JSC