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
|
/*
* Copyright (C) 2016 Apple Inc. All rights reserved.
*
* 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
*
*/
#pragma once
#include "JSArray.h"
#include "JSCellInlines.h"
#include "Structure.h"
namespace JSC {
inline IndexingType JSArray::mergeIndexingTypeForCopying(IndexingType other)
{
IndexingType type = indexingType();
if (!(type & IsArray && other & IsArray))
return NonArray;
if (hasAnyArrayStorage(type) || hasAnyArrayStorage(other))
return NonArray;
if (type == ArrayWithUndecided)
return other;
if (other == ArrayWithUndecided)
return type;
// We can memcpy an Int32 and a Contiguous into a Contiguous array since
// both share the same memory layout for Int32 numbers.
if ((type == ArrayWithInt32 || type == ArrayWithContiguous)
&& (other == ArrayWithInt32 || other == ArrayWithContiguous)) {
if (other == ArrayWithContiguous)
return other;
return type;
}
if (type != other)
return NonArray;
return type;
}
inline bool JSArray::canFastCopy(VM& vm, JSArray* otherArray)
{
if (hasAnyArrayStorage(indexingType()) || hasAnyArrayStorage(otherArray->indexingType()))
return false;
// FIXME: We should have a watchpoint for indexed properties on Array.prototype and Object.prototype
// instead of walking the prototype chain. https://bugs.webkit.org/show_bug.cgi?id=155592
if (structure(vm)->holesMustForwardToPrototype(vm)
|| otherArray->structure(vm)->holesMustForwardToPrototype(vm))
return false;
return true;
}
ALWAYS_INLINE unsigned getLength(ExecState* exec, JSObject* obj)
{
VM& vm = exec->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
if (isJSArray(obj))
return jsCast<JSArray*>(obj)->length();
JSValue lengthValue = obj->get(exec, vm.propertyNames->length);
RETURN_IF_EXCEPTION(scope, UINT_MAX);
scope.release();
return lengthValue.toUInt32(exec);
}
ALWAYS_INLINE double toLength(ExecState* exec, JSObject* obj)
{
VM& vm = exec->vm();
auto scope = DECLARE_THROW_SCOPE(vm);
if (isJSArray(obj))
return jsCast<JSArray*>(obj)->length();
JSValue lengthValue = obj->get(exec, vm.propertyNames->length);
RETURN_IF_EXCEPTION(scope, PNaN);
scope.release();
return lengthValue.toLength(exec);
}
ALWAYS_INLINE bool JSArray::isIteratorProtocolFastAndNonObservable()
{
return globalObject()->isArrayIteratorProtocolFastAndNonObservable();
}
} // namespace JSC
|
