Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1 | // Copyright 2012 the V8 project authors. All rights reserved. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 4 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 5 | #include "src/v8.h" |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 6 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 7 | #include "src/arguments.h" |
| 8 | #include "src/conversions.h" |
| 9 | #include "src/elements.h" |
| 10 | #include "src/objects.h" |
| 11 | #include "src/utils.h" |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 12 | |
| 13 | // Each concrete ElementsAccessor can handle exactly one ElementsKind, |
| 14 | // several abstract ElementsAccessor classes are used to allow sharing |
| 15 | // common code. |
| 16 | // |
| 17 | // Inheritance hierarchy: |
| 18 | // - ElementsAccessorBase (abstract) |
| 19 | // - FastElementsAccessor (abstract) |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 20 | // - FastSmiOrObjectElementsAccessor |
| 21 | // - FastPackedSmiElementsAccessor |
| 22 | // - FastHoleySmiElementsAccessor |
| 23 | // - FastPackedObjectElementsAccessor |
| 24 | // - FastHoleyObjectElementsAccessor |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 25 | // - FastDoubleElementsAccessor |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 26 | // - FastPackedDoubleElementsAccessor |
| 27 | // - FastHoleyDoubleElementsAccessor |
| 28 | // - TypedElementsAccessor: template, with instantiations: |
| 29 | // - ExternalInt8ElementsAccessor |
| 30 | // - ExternalUint8ElementsAccessor |
| 31 | // - ExternalInt16ElementsAccessor |
| 32 | // - ExternalUint16ElementsAccessor |
| 33 | // - ExternalInt32ElementsAccessor |
| 34 | // - ExternalUint32ElementsAccessor |
| 35 | // - ExternalFloat32ElementsAccessor |
| 36 | // - ExternalFloat64ElementsAccessor |
| 37 | // - ExternalUint8ClampedElementsAccessor |
| 38 | // - FixedUint8ElementsAccessor |
| 39 | // - FixedInt8ElementsAccessor |
| 40 | // - FixedUint16ElementsAccessor |
| 41 | // - FixedInt16ElementsAccessor |
| 42 | // - FixedUint32ElementsAccessor |
| 43 | // - FixedInt32ElementsAccessor |
| 44 | // - FixedFloat32ElementsAccessor |
| 45 | // - FixedFloat64ElementsAccessor |
| 46 | // - FixedUint8ClampedElementsAccessor |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 47 | // - DictionaryElementsAccessor |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 48 | // - SloppyArgumentsElementsAccessor |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 49 | |
| 50 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 51 | namespace v8 { |
| 52 | namespace internal { |
| 53 | |
| 54 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 55 | static const int kPackedSizeNotKnown = -1; |
| 56 | |
| 57 | |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 58 | // First argument in list is the accessor class, the second argument is the |
| 59 | // accessor ElementsKind, and the third is the backing store class. Use the |
| 60 | // fast element handler for smi-only arrays. The implementation is currently |
| 61 | // identical. Note that the order must match that of the ElementsKind enum for |
| 62 | // the |accessor_array[]| below to work. |
| 63 | #define ELEMENTS_LIST(V) \ |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 64 | V(FastPackedSmiElementsAccessor, FAST_SMI_ELEMENTS, FixedArray) \ |
| 65 | V(FastHoleySmiElementsAccessor, FAST_HOLEY_SMI_ELEMENTS, \ |
| 66 | FixedArray) \ |
| 67 | V(FastPackedObjectElementsAccessor, FAST_ELEMENTS, FixedArray) \ |
| 68 | V(FastHoleyObjectElementsAccessor, FAST_HOLEY_ELEMENTS, FixedArray) \ |
| 69 | V(FastPackedDoubleElementsAccessor, FAST_DOUBLE_ELEMENTS, \ |
| 70 | FixedDoubleArray) \ |
| 71 | V(FastHoleyDoubleElementsAccessor, FAST_HOLEY_DOUBLE_ELEMENTS, \ |
| 72 | FixedDoubleArray) \ |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 73 | V(DictionaryElementsAccessor, DICTIONARY_ELEMENTS, \ |
| 74 | SeededNumberDictionary) \ |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 75 | V(SloppyArgumentsElementsAccessor, SLOPPY_ARGUMENTS_ELEMENTS, \ |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 76 | FixedArray) \ |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 77 | V(ExternalInt8ElementsAccessor, EXTERNAL_INT8_ELEMENTS, \ |
| 78 | ExternalInt8Array) \ |
| 79 | V(ExternalUint8ElementsAccessor, \ |
| 80 | EXTERNAL_UINT8_ELEMENTS, ExternalUint8Array) \ |
| 81 | V(ExternalInt16ElementsAccessor, EXTERNAL_INT16_ELEMENTS, \ |
| 82 | ExternalInt16Array) \ |
| 83 | V(ExternalUint16ElementsAccessor, \ |
| 84 | EXTERNAL_UINT16_ELEMENTS, ExternalUint16Array) \ |
| 85 | V(ExternalInt32ElementsAccessor, EXTERNAL_INT32_ELEMENTS, \ |
| 86 | ExternalInt32Array) \ |
| 87 | V(ExternalUint32ElementsAccessor, \ |
| 88 | EXTERNAL_UINT32_ELEMENTS, ExternalUint32Array) \ |
| 89 | V(ExternalFloat32ElementsAccessor, \ |
| 90 | EXTERNAL_FLOAT32_ELEMENTS, ExternalFloat32Array) \ |
| 91 | V(ExternalFloat64ElementsAccessor, \ |
| 92 | EXTERNAL_FLOAT64_ELEMENTS, ExternalFloat64Array) \ |
| 93 | V(ExternalUint8ClampedElementsAccessor, \ |
| 94 | EXTERNAL_UINT8_CLAMPED_ELEMENTS, \ |
| 95 | ExternalUint8ClampedArray) \ |
| 96 | V(FixedUint8ElementsAccessor, UINT8_ELEMENTS, FixedUint8Array) \ |
| 97 | V(FixedInt8ElementsAccessor, INT8_ELEMENTS, FixedInt8Array) \ |
| 98 | V(FixedUint16ElementsAccessor, UINT16_ELEMENTS, FixedUint16Array) \ |
| 99 | V(FixedInt16ElementsAccessor, INT16_ELEMENTS, FixedInt16Array) \ |
| 100 | V(FixedUint32ElementsAccessor, UINT32_ELEMENTS, FixedUint32Array) \ |
| 101 | V(FixedInt32ElementsAccessor, INT32_ELEMENTS, FixedInt32Array) \ |
| 102 | V(FixedFloat32ElementsAccessor, FLOAT32_ELEMENTS, FixedFloat32Array) \ |
| 103 | V(FixedFloat64ElementsAccessor, FLOAT64_ELEMENTS, FixedFloat64Array) \ |
| 104 | V(FixedUint8ClampedElementsAccessor, UINT8_CLAMPED_ELEMENTS, \ |
| 105 | FixedUint8ClampedArray) |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 106 | |
| 107 | |
| 108 | template<ElementsKind Kind> class ElementsKindTraits { |
| 109 | public: |
| 110 | typedef FixedArrayBase BackingStore; |
| 111 | }; |
| 112 | |
| 113 | #define ELEMENTS_TRAITS(Class, KindParam, Store) \ |
| 114 | template<> class ElementsKindTraits<KindParam> { \ |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 115 | public: /* NOLINT */ \ |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 116 | static const ElementsKind Kind = KindParam; \ |
| 117 | typedef Store BackingStore; \ |
| 118 | }; |
| 119 | ELEMENTS_LIST(ELEMENTS_TRAITS) |
| 120 | #undef ELEMENTS_TRAITS |
| 121 | |
| 122 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 123 | ElementsAccessor** ElementsAccessor::elements_accessors_ = NULL; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 124 | |
| 125 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 126 | static bool HasKey(Handle<FixedArray> array, Handle<Object> key_handle) { |
| 127 | DisallowHeapAllocation no_gc; |
| 128 | Object* key = *key_handle; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 129 | int len0 = array->length(); |
| 130 | for (int i = 0; i < len0; i++) { |
| 131 | Object* element = array->get(i); |
| 132 | if (element->IsSmi() && element == key) return true; |
| 133 | if (element->IsString() && |
| 134 | key->IsString() && String::cast(element)->Equals(String::cast(key))) { |
| 135 | return true; |
| 136 | } |
| 137 | } |
| 138 | return false; |
| 139 | } |
| 140 | |
| 141 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 142 | MUST_USE_RESULT |
| 143 | static MaybeHandle<Object> ThrowArrayLengthRangeError(Isolate* isolate) { |
| 144 | THROW_NEW_ERROR(isolate, NewRangeError("invalid_array_length", |
| 145 | HandleVector<Object>(NULL, 0)), |
| 146 | Object); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 147 | } |
| 148 | |
| 149 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 150 | static void CopyObjectToObjectElements(FixedArrayBase* from_base, |
| 151 | ElementsKind from_kind, |
| 152 | uint32_t from_start, |
| 153 | FixedArrayBase* to_base, |
| 154 | ElementsKind to_kind, uint32_t to_start, |
| 155 | int raw_copy_size) { |
| 156 | DCHECK(to_base->map() != |
| 157 | from_base->GetIsolate()->heap()->fixed_cow_array_map()); |
| 158 | DisallowHeapAllocation no_allocation; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 159 | int copy_size = raw_copy_size; |
| 160 | if (raw_copy_size < 0) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 161 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 162 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 163 | copy_size = Min(from_base->length() - from_start, |
| 164 | to_base->length() - to_start); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 165 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 166 | int start = to_start + copy_size; |
| 167 | int length = to_base->length() - start; |
| 168 | if (length > 0) { |
| 169 | Heap* heap = from_base->GetHeap(); |
| 170 | MemsetPointer(FixedArray::cast(to_base)->data_start() + start, |
| 171 | heap->the_hole_value(), length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 172 | } |
| 173 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 174 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 175 | DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() && |
| 176 | (copy_size + static_cast<int>(from_start)) <= from_base->length()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 177 | if (copy_size == 0) return; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 178 | FixedArray* from = FixedArray::cast(from_base); |
| 179 | FixedArray* to = FixedArray::cast(to_base); |
| 180 | DCHECK(IsFastSmiOrObjectElementsKind(from_kind)); |
| 181 | DCHECK(IsFastSmiOrObjectElementsKind(to_kind)); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 182 | Address to_address = to->address() + FixedArray::kHeaderSize; |
| 183 | Address from_address = from->address() + FixedArray::kHeaderSize; |
| 184 | CopyWords(reinterpret_cast<Object**>(to_address) + to_start, |
| 185 | reinterpret_cast<Object**>(from_address) + from_start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 186 | static_cast<size_t>(copy_size)); |
| 187 | if (IsFastObjectElementsKind(from_kind) && |
| 188 | IsFastObjectElementsKind(to_kind)) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 189 | Heap* heap = from->GetHeap(); |
| 190 | if (!heap->InNewSpace(to)) { |
| 191 | heap->RecordWrites(to->address(), |
| 192 | to->OffsetOfElementAt(to_start), |
| 193 | copy_size); |
| 194 | } |
| 195 | heap->incremental_marking()->RecordWrites(to); |
| 196 | } |
| 197 | } |
| 198 | |
| 199 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 200 | static void CopyDictionaryToObjectElements( |
| 201 | FixedArrayBase* from_base, uint32_t from_start, FixedArrayBase* to_base, |
| 202 | ElementsKind to_kind, uint32_t to_start, int raw_copy_size) { |
| 203 | DisallowHeapAllocation no_allocation; |
| 204 | SeededNumberDictionary* from = SeededNumberDictionary::cast(from_base); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 205 | int copy_size = raw_copy_size; |
| 206 | Heap* heap = from->GetHeap(); |
| 207 | if (raw_copy_size < 0) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 208 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 209 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
| 210 | copy_size = from->max_number_key() + 1 - from_start; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 211 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 212 | int start = to_start + copy_size; |
| 213 | int length = to_base->length() - start; |
| 214 | if (length > 0) { |
| 215 | Heap* heap = from->GetHeap(); |
| 216 | MemsetPointer(FixedArray::cast(to_base)->data_start() + start, |
| 217 | heap->the_hole_value(), length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 218 | } |
| 219 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 220 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 221 | DCHECK(to_base != from_base); |
| 222 | DCHECK(IsFastSmiOrObjectElementsKind(to_kind)); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 223 | if (copy_size == 0) return; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 224 | FixedArray* to = FixedArray::cast(to_base); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 225 | uint32_t to_length = to->length(); |
| 226 | if (to_start + copy_size > to_length) { |
| 227 | copy_size = to_length - to_start; |
| 228 | } |
| 229 | for (int i = 0; i < copy_size; i++) { |
| 230 | int entry = from->FindEntry(i + from_start); |
| 231 | if (entry != SeededNumberDictionary::kNotFound) { |
| 232 | Object* value = from->ValueAt(entry); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 233 | DCHECK(!value->IsTheHole()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 234 | to->set(i + to_start, value, SKIP_WRITE_BARRIER); |
| 235 | } else { |
| 236 | to->set_the_hole(i + to_start); |
| 237 | } |
| 238 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 239 | if (IsFastObjectElementsKind(to_kind)) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 240 | if (!heap->InNewSpace(to)) { |
| 241 | heap->RecordWrites(to->address(), |
| 242 | to->OffsetOfElementAt(to_start), |
| 243 | copy_size); |
| 244 | } |
| 245 | heap->incremental_marking()->RecordWrites(to); |
| 246 | } |
| 247 | } |
| 248 | |
| 249 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 250 | // NOTE: this method violates the handlified function signature convention: |
| 251 | // raw pointer parameters in the function that allocates. |
| 252 | // See ElementsAccessorBase::CopyElements() for details. |
| 253 | static void CopyDoubleToObjectElements(FixedArrayBase* from_base, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 254 | uint32_t from_start, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 255 | FixedArrayBase* to_base, |
| 256 | ElementsKind to_kind, uint32_t to_start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 257 | int raw_copy_size) { |
| 258 | DCHECK(IsFastSmiOrObjectElementsKind(to_kind)); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 259 | int copy_size = raw_copy_size; |
| 260 | if (raw_copy_size < 0) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 261 | DisallowHeapAllocation no_allocation; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 262 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 263 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 264 | copy_size = Min(from_base->length() - from_start, |
| 265 | to_base->length() - to_start); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 266 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 267 | // Also initialize the area that will be copied over since HeapNumber |
| 268 | // allocation below can cause an incremental marking step, requiring all |
| 269 | // existing heap objects to be propertly initialized. |
| 270 | int start = to_start; |
| 271 | int length = to_base->length() - start; |
| 272 | if (length > 0) { |
| 273 | Heap* heap = from_base->GetHeap(); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 274 | MemsetPointer(FixedArray::cast(to_base)->data_start() + start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 275 | heap->the_hole_value(), length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 276 | } |
| 277 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 278 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 279 | DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() && |
| 280 | (copy_size + static_cast<int>(from_start)) <= from_base->length()); |
| 281 | if (copy_size == 0) return; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 282 | |
| 283 | // From here on, the code below could actually allocate. Therefore the raw |
| 284 | // values are wrapped into handles. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 285 | Isolate* isolate = from_base->GetIsolate(); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 286 | Handle<FixedDoubleArray> from(FixedDoubleArray::cast(from_base), isolate); |
| 287 | Handle<FixedArray> to(FixedArray::cast(to_base), isolate); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 288 | for (int i = 0; i < copy_size; ++i) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 289 | HandleScope scope(isolate); |
| 290 | if (IsFastSmiElementsKind(to_kind)) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 291 | UNIMPLEMENTED(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 292 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 293 | DCHECK(IsFastObjectElementsKind(to_kind)); |
| 294 | Handle<Object> value = FixedDoubleArray::get(from, i + from_start); |
| 295 | to->set(i + to_start, *value, UPDATE_WRITE_BARRIER); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 296 | } |
| 297 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 298 | } |
| 299 | |
| 300 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 301 | static void CopyDoubleToDoubleElements(FixedArrayBase* from_base, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 302 | uint32_t from_start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 303 | FixedArrayBase* to_base, |
| 304 | uint32_t to_start, int raw_copy_size) { |
| 305 | DisallowHeapAllocation no_allocation; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 306 | int copy_size = raw_copy_size; |
| 307 | if (raw_copy_size < 0) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 308 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 309 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 310 | copy_size = Min(from_base->length() - from_start, |
| 311 | to_base->length() - to_start); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 312 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 313 | for (int i = to_start + copy_size; i < to_base->length(); ++i) { |
| 314 | FixedDoubleArray::cast(to_base)->set_the_hole(i); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 315 | } |
| 316 | } |
| 317 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 318 | DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() && |
| 319 | (copy_size + static_cast<int>(from_start)) <= from_base->length()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 320 | if (copy_size == 0) return; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 321 | FixedDoubleArray* from = FixedDoubleArray::cast(from_base); |
| 322 | FixedDoubleArray* to = FixedDoubleArray::cast(to_base); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 323 | Address to_address = to->address() + FixedDoubleArray::kHeaderSize; |
| 324 | Address from_address = from->address() + FixedDoubleArray::kHeaderSize; |
| 325 | to_address += kDoubleSize * to_start; |
| 326 | from_address += kDoubleSize * from_start; |
| 327 | int words_per_double = (kDoubleSize / kPointerSize); |
| 328 | CopyWords(reinterpret_cast<Object**>(to_address), |
| 329 | reinterpret_cast<Object**>(from_address), |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 330 | static_cast<size_t>(words_per_double * copy_size)); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 331 | } |
| 332 | |
| 333 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 334 | static void CopySmiToDoubleElements(FixedArrayBase* from_base, |
| 335 | uint32_t from_start, |
| 336 | FixedArrayBase* to_base, uint32_t to_start, |
| 337 | int raw_copy_size) { |
| 338 | DisallowHeapAllocation no_allocation; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 339 | int copy_size = raw_copy_size; |
| 340 | if (raw_copy_size < 0) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 341 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 342 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 343 | copy_size = from_base->length() - from_start; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 344 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 345 | for (int i = to_start + copy_size; i < to_base->length(); ++i) { |
| 346 | FixedDoubleArray::cast(to_base)->set_the_hole(i); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 347 | } |
| 348 | } |
| 349 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 350 | DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() && |
| 351 | (copy_size + static_cast<int>(from_start)) <= from_base->length()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 352 | if (copy_size == 0) return; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 353 | FixedArray* from = FixedArray::cast(from_base); |
| 354 | FixedDoubleArray* to = FixedDoubleArray::cast(to_base); |
| 355 | Object* the_hole = from->GetHeap()->the_hole_value(); |
| 356 | for (uint32_t from_end = from_start + static_cast<uint32_t>(copy_size); |
| 357 | from_start < from_end; from_start++, to_start++) { |
| 358 | Object* hole_or_smi = from->get(from_start); |
| 359 | if (hole_or_smi == the_hole) { |
| 360 | to->set_the_hole(to_start); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 361 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 362 | to->set(to_start, Smi::cast(hole_or_smi)->value()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 363 | } |
| 364 | } |
| 365 | } |
| 366 | |
| 367 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 368 | static void CopyPackedSmiToDoubleElements(FixedArrayBase* from_base, |
| 369 | uint32_t from_start, |
| 370 | FixedArrayBase* to_base, |
| 371 | uint32_t to_start, int packed_size, |
| 372 | int raw_copy_size) { |
| 373 | DisallowHeapAllocation no_allocation; |
| 374 | int copy_size = raw_copy_size; |
| 375 | uint32_t to_end; |
| 376 | if (raw_copy_size < 0) { |
| 377 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
| 378 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
| 379 | copy_size = packed_size - from_start; |
| 380 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
| 381 | to_end = to_base->length(); |
| 382 | for (uint32_t i = to_start + copy_size; i < to_end; ++i) { |
| 383 | FixedDoubleArray::cast(to_base)->set_the_hole(i); |
| 384 | } |
| 385 | } else { |
| 386 | to_end = to_start + static_cast<uint32_t>(copy_size); |
| 387 | } |
| 388 | } else { |
| 389 | to_end = to_start + static_cast<uint32_t>(copy_size); |
| 390 | } |
| 391 | DCHECK(static_cast<int>(to_end) <= to_base->length()); |
| 392 | DCHECK(packed_size >= 0 && packed_size <= copy_size); |
| 393 | DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() && |
| 394 | (copy_size + static_cast<int>(from_start)) <= from_base->length()); |
| 395 | if (copy_size == 0) return; |
| 396 | FixedArray* from = FixedArray::cast(from_base); |
| 397 | FixedDoubleArray* to = FixedDoubleArray::cast(to_base); |
| 398 | for (uint32_t from_end = from_start + static_cast<uint32_t>(packed_size); |
| 399 | from_start < from_end; from_start++, to_start++) { |
| 400 | Object* smi = from->get(from_start); |
| 401 | DCHECK(!smi->IsTheHole()); |
| 402 | to->set(to_start, Smi::cast(smi)->value()); |
| 403 | } |
| 404 | } |
| 405 | |
| 406 | |
| 407 | static void CopyObjectToDoubleElements(FixedArrayBase* from_base, |
| 408 | uint32_t from_start, |
| 409 | FixedArrayBase* to_base, |
| 410 | uint32_t to_start, int raw_copy_size) { |
| 411 | DisallowHeapAllocation no_allocation; |
| 412 | int copy_size = raw_copy_size; |
| 413 | if (raw_copy_size < 0) { |
| 414 | DCHECK(raw_copy_size == ElementsAccessor::kCopyToEnd || |
| 415 | raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
| 416 | copy_size = from_base->length() - from_start; |
| 417 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
| 418 | for (int i = to_start + copy_size; i < to_base->length(); ++i) { |
| 419 | FixedDoubleArray::cast(to_base)->set_the_hole(i); |
| 420 | } |
| 421 | } |
| 422 | } |
| 423 | DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() && |
| 424 | (copy_size + static_cast<int>(from_start)) <= from_base->length()); |
| 425 | if (copy_size == 0) return; |
| 426 | FixedArray* from = FixedArray::cast(from_base); |
| 427 | FixedDoubleArray* to = FixedDoubleArray::cast(to_base); |
| 428 | Object* the_hole = from->GetHeap()->the_hole_value(); |
| 429 | for (uint32_t from_end = from_start + copy_size; |
| 430 | from_start < from_end; from_start++, to_start++) { |
| 431 | Object* hole_or_object = from->get(from_start); |
| 432 | if (hole_or_object == the_hole) { |
| 433 | to->set_the_hole(to_start); |
| 434 | } else { |
| 435 | to->set(to_start, hole_or_object->Number()); |
| 436 | } |
| 437 | } |
| 438 | } |
| 439 | |
| 440 | |
| 441 | static void CopyDictionaryToDoubleElements(FixedArrayBase* from_base, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 442 | uint32_t from_start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 443 | FixedArrayBase* to_base, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 444 | uint32_t to_start, |
| 445 | int raw_copy_size) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 446 | DisallowHeapAllocation no_allocation; |
| 447 | SeededNumberDictionary* from = SeededNumberDictionary::cast(from_base); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 448 | int copy_size = raw_copy_size; |
| 449 | if (copy_size < 0) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 450 | DCHECK(copy_size == ElementsAccessor::kCopyToEnd || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 451 | copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole); |
| 452 | copy_size = from->max_number_key() + 1 - from_start; |
| 453 | if (raw_copy_size == ElementsAccessor::kCopyToEndAndInitializeToHole) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 454 | for (int i = to_start + copy_size; i < to_base->length(); ++i) { |
| 455 | FixedDoubleArray::cast(to_base)->set_the_hole(i); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 456 | } |
| 457 | } |
| 458 | } |
| 459 | if (copy_size == 0) return; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 460 | FixedDoubleArray* to = FixedDoubleArray::cast(to_base); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 461 | uint32_t to_length = to->length(); |
| 462 | if (to_start + copy_size > to_length) { |
| 463 | copy_size = to_length - to_start; |
| 464 | } |
| 465 | for (int i = 0; i < copy_size; i++) { |
| 466 | int entry = from->FindEntry(i + from_start); |
| 467 | if (entry != SeededNumberDictionary::kNotFound) { |
| 468 | to->set(i + to_start, from->ValueAt(entry)->Number()); |
| 469 | } else { |
| 470 | to->set_the_hole(i + to_start); |
| 471 | } |
| 472 | } |
| 473 | } |
| 474 | |
| 475 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 476 | static void TraceTopFrame(Isolate* isolate) { |
| 477 | StackFrameIterator it(isolate); |
| 478 | if (it.done()) { |
| 479 | PrintF("unknown location (no JavaScript frames present)"); |
| 480 | return; |
| 481 | } |
| 482 | StackFrame* raw_frame = it.frame(); |
| 483 | if (raw_frame->is_internal()) { |
| 484 | Code* apply_builtin = isolate->builtins()->builtin( |
| 485 | Builtins::kFunctionApply); |
| 486 | if (raw_frame->unchecked_code() == apply_builtin) { |
| 487 | PrintF("apply from "); |
| 488 | it.Advance(); |
| 489 | raw_frame = it.frame(); |
| 490 | } |
| 491 | } |
| 492 | JavaScriptFrame::PrintTop(isolate, stdout, false, true); |
| 493 | } |
| 494 | |
| 495 | |
| 496 | void CheckArrayAbuse(Handle<JSObject> obj, const char* op, uint32_t key, |
| 497 | bool allow_appending) { |
| 498 | DisallowHeapAllocation no_allocation; |
| 499 | Object* raw_length = NULL; |
| 500 | const char* elements_type = "array"; |
| 501 | if (obj->IsJSArray()) { |
| 502 | JSArray* array = JSArray::cast(*obj); |
| 503 | raw_length = array->length(); |
| 504 | } else { |
| 505 | raw_length = Smi::FromInt(obj->elements()->length()); |
| 506 | elements_type = "object"; |
| 507 | } |
| 508 | |
| 509 | if (raw_length->IsNumber()) { |
| 510 | double n = raw_length->Number(); |
| 511 | if (FastI2D(FastD2UI(n)) == n) { |
| 512 | int32_t int32_length = DoubleToInt32(n); |
| 513 | uint32_t compare_length = static_cast<uint32_t>(int32_length); |
| 514 | if (allow_appending) compare_length++; |
| 515 | if (key >= compare_length) { |
| 516 | PrintF("[OOB %s %s (%s length = %d, element accessed = %d) in ", |
| 517 | elements_type, op, elements_type, |
| 518 | static_cast<int>(int32_length), |
| 519 | static_cast<int>(key)); |
| 520 | TraceTopFrame(obj->GetIsolate()); |
| 521 | PrintF("]\n"); |
| 522 | } |
| 523 | } else { |
| 524 | PrintF("[%s elements length not integer value in ", elements_type); |
| 525 | TraceTopFrame(obj->GetIsolate()); |
| 526 | PrintF("]\n"); |
| 527 | } |
| 528 | } else { |
| 529 | PrintF("[%s elements length not a number in ", elements_type); |
| 530 | TraceTopFrame(obj->GetIsolate()); |
| 531 | PrintF("]\n"); |
| 532 | } |
| 533 | } |
| 534 | |
| 535 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 536 | // Base class for element handler implementations. Contains the |
| 537 | // the common logic for objects with different ElementsKinds. |
| 538 | // Subclasses must specialize method for which the element |
| 539 | // implementation differs from the base class implementation. |
| 540 | // |
| 541 | // This class is intended to be used in the following way: |
| 542 | // |
| 543 | // class SomeElementsAccessor : |
| 544 | // public ElementsAccessorBase<SomeElementsAccessor, |
| 545 | // BackingStoreClass> { |
| 546 | // ... |
| 547 | // } |
| 548 | // |
| 549 | // This is an example of the Curiously Recurring Template Pattern (see |
| 550 | // http://en.wikipedia.org/wiki/Curiously_recurring_template_pattern). We use |
| 551 | // CRTP to guarantee aggressive compile time optimizations (i.e. inlining and |
| 552 | // specialization of SomeElementsAccessor methods). |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 553 | template <typename ElementsAccessorSubclass, |
| 554 | typename ElementsTraitsParam> |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 555 | class ElementsAccessorBase : public ElementsAccessor { |
| 556 | protected: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 557 | explicit ElementsAccessorBase(const char* name) |
| 558 | : ElementsAccessor(name) { } |
| 559 | |
| 560 | typedef ElementsTraitsParam ElementsTraits; |
| 561 | typedef typename ElementsTraitsParam::BackingStore BackingStore; |
| 562 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 563 | ElementsKind kind() const FINAL { return ElementsTraits::Kind; } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 564 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 565 | static void ValidateContents(Handle<JSObject> holder, int length) { |
| 566 | } |
| 567 | |
| 568 | static void ValidateImpl(Handle<JSObject> holder) { |
| 569 | Handle<FixedArrayBase> fixed_array_base(holder->elements()); |
| 570 | if (!fixed_array_base->IsHeapObject()) return; |
| 571 | // Arrays that have been shifted in place can't be verified. |
| 572 | if (fixed_array_base->IsFiller()) return; |
| 573 | int length = 0; |
| 574 | if (holder->IsJSArray()) { |
| 575 | Object* length_obj = Handle<JSArray>::cast(holder)->length(); |
| 576 | if (length_obj->IsSmi()) { |
| 577 | length = Smi::cast(length_obj)->value(); |
| 578 | } |
| 579 | } else { |
| 580 | length = fixed_array_base->length(); |
| 581 | } |
| 582 | ElementsAccessorSubclass::ValidateContents(holder, length); |
| 583 | } |
| 584 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 585 | void Validate(Handle<JSObject> holder) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 586 | DisallowHeapAllocation no_gc; |
| 587 | ElementsAccessorSubclass::ValidateImpl(holder); |
| 588 | } |
| 589 | |
| 590 | static bool HasElementImpl(Handle<Object> receiver, |
| 591 | Handle<JSObject> holder, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 592 | uint32_t key, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 593 | Handle<FixedArrayBase> backing_store) { |
| 594 | return ElementsAccessorSubclass::GetAttributesImpl( |
| 595 | receiver, holder, key, backing_store) != ABSENT; |
Ben Murdoch | 85b7179 | 2012-04-11 18:30:58 +0100 | [diff] [blame] | 596 | } |
| 597 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 598 | virtual bool HasElement(Handle<Object> receiver, Handle<JSObject> holder, |
| 599 | uint32_t key, |
| 600 | Handle<FixedArrayBase> backing_store) FINAL { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 601 | return ElementsAccessorSubclass::HasElementImpl( |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 602 | receiver, holder, key, backing_store); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 603 | } |
| 604 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 605 | MUST_USE_RESULT virtual MaybeHandle<Object> Get( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 606 | Handle<Object> receiver, Handle<JSObject> holder, uint32_t key, |
| 607 | Handle<FixedArrayBase> backing_store) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 608 | if (!IsExternalArrayElementsKind(ElementsTraits::Kind) && |
| 609 | FLAG_trace_js_array_abuse) { |
| 610 | CheckArrayAbuse(holder, "elements read", key); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 611 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 612 | |
| 613 | if (IsExternalArrayElementsKind(ElementsTraits::Kind) && |
| 614 | FLAG_trace_external_array_abuse) { |
| 615 | CheckArrayAbuse(holder, "external elements read", key); |
| 616 | } |
| 617 | |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 618 | return ElementsAccessorSubclass::GetImpl( |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 619 | receiver, holder, key, backing_store); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 620 | } |
| 621 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 622 | MUST_USE_RESULT static MaybeHandle<Object> GetImpl( |
| 623 | Handle<Object> receiver, |
| 624 | Handle<JSObject> obj, |
| 625 | uint32_t key, |
| 626 | Handle<FixedArrayBase> backing_store) { |
| 627 | if (key < ElementsAccessorSubclass::GetCapacityImpl(backing_store)) { |
| 628 | return BackingStore::get(Handle<BackingStore>::cast(backing_store), key); |
| 629 | } else { |
| 630 | return backing_store->GetIsolate()->factory()->the_hole_value(); |
| 631 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 632 | } |
| 633 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 634 | MUST_USE_RESULT virtual PropertyAttributes GetAttributes( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 635 | Handle<Object> receiver, Handle<JSObject> holder, uint32_t key, |
| 636 | Handle<FixedArrayBase> backing_store) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 637 | return ElementsAccessorSubclass::GetAttributesImpl( |
| 638 | receiver, holder, key, backing_store); |
| 639 | } |
| 640 | |
| 641 | MUST_USE_RESULT static PropertyAttributes GetAttributesImpl( |
| 642 | Handle<Object> receiver, |
| 643 | Handle<JSObject> obj, |
| 644 | uint32_t key, |
| 645 | Handle<FixedArrayBase> backing_store) { |
| 646 | if (key >= ElementsAccessorSubclass::GetCapacityImpl(backing_store)) { |
| 647 | return ABSENT; |
| 648 | } |
| 649 | return |
| 650 | Handle<BackingStore>::cast(backing_store)->is_the_hole(key) |
| 651 | ? ABSENT : NONE; |
| 652 | } |
| 653 | |
| 654 | MUST_USE_RESULT virtual MaybeHandle<AccessorPair> GetAccessorPair( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 655 | Handle<Object> receiver, Handle<JSObject> holder, uint32_t key, |
| 656 | Handle<FixedArrayBase> backing_store) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 657 | return ElementsAccessorSubclass::GetAccessorPairImpl( |
| 658 | receiver, holder, key, backing_store); |
| 659 | } |
| 660 | |
| 661 | MUST_USE_RESULT static MaybeHandle<AccessorPair> GetAccessorPairImpl( |
| 662 | Handle<Object> receiver, |
| 663 | Handle<JSObject> obj, |
| 664 | uint32_t key, |
| 665 | Handle<FixedArrayBase> backing_store) { |
| 666 | return MaybeHandle<AccessorPair>(); |
| 667 | } |
| 668 | |
| 669 | MUST_USE_RESULT virtual MaybeHandle<Object> SetLength( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 670 | Handle<JSArray> array, Handle<Object> length) FINAL { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 671 | return ElementsAccessorSubclass::SetLengthImpl( |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 672 | array, length, handle(array->elements())); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 673 | } |
| 674 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 675 | MUST_USE_RESULT static MaybeHandle<Object> SetLengthImpl( |
| 676 | Handle<JSObject> obj, |
| 677 | Handle<Object> length, |
| 678 | Handle<FixedArrayBase> backing_store); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 679 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 680 | virtual void SetCapacityAndLength(Handle<JSArray> array, int capacity, |
| 681 | int length) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 682 | ElementsAccessorSubclass:: |
| 683 | SetFastElementsCapacityAndLength(array, capacity, length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 684 | } |
| 685 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 686 | static void SetFastElementsCapacityAndLength( |
| 687 | Handle<JSObject> obj, |
| 688 | int capacity, |
| 689 | int length) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 690 | UNIMPLEMENTED(); |
Ben Murdoch | c7cc028 | 2012-03-05 14:35:55 +0000 | [diff] [blame] | 691 | } |
| 692 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 693 | MUST_USE_RESULT virtual MaybeHandle<Object> Delete( |
| 694 | Handle<JSObject> obj, |
| 695 | uint32_t key, |
| 696 | JSReceiver::DeleteMode mode) OVERRIDE = 0; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 697 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 698 | static void CopyElementsImpl(FixedArrayBase* from, uint32_t from_start, |
| 699 | FixedArrayBase* to, ElementsKind from_kind, |
| 700 | uint32_t to_start, int packed_size, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 701 | int copy_size) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 702 | UNREACHABLE(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 703 | } |
| 704 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 705 | virtual void CopyElements(Handle<FixedArrayBase> from, uint32_t from_start, |
| 706 | ElementsKind from_kind, Handle<FixedArrayBase> to, |
| 707 | uint32_t to_start, int copy_size) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 708 | DCHECK(!from.is_null()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 709 | // NOTE: the ElementsAccessorSubclass::CopyElementsImpl() methods |
| 710 | // violate the handlified function signature convention: |
| 711 | // raw pointer parameters in the function that allocates. This is done |
| 712 | // intentionally to avoid ArrayConcat() builtin performance degradation. |
| 713 | // See the comment in another ElementsAccessorBase::CopyElements() for |
| 714 | // details. |
| 715 | ElementsAccessorSubclass::CopyElementsImpl(*from, from_start, *to, |
| 716 | from_kind, to_start, |
| 717 | kPackedSizeNotKnown, copy_size); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 718 | } |
| 719 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 720 | virtual void CopyElements(JSObject* from_holder, uint32_t from_start, |
| 721 | ElementsKind from_kind, Handle<FixedArrayBase> to, |
| 722 | uint32_t to_start, int copy_size) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 723 | int packed_size = kPackedSizeNotKnown; |
| 724 | bool is_packed = IsFastPackedElementsKind(from_kind) && |
| 725 | from_holder->IsJSArray(); |
| 726 | if (is_packed) { |
| 727 | packed_size = |
| 728 | Smi::cast(JSArray::cast(from_holder)->length())->value(); |
| 729 | if (copy_size >= 0 && packed_size > copy_size) { |
| 730 | packed_size = copy_size; |
| 731 | } |
| 732 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 733 | FixedArrayBase* from = from_holder->elements(); |
| 734 | // NOTE: the ElementsAccessorSubclass::CopyElementsImpl() methods |
| 735 | // violate the handlified function signature convention: |
| 736 | // raw pointer parameters in the function that allocates. This is done |
| 737 | // intentionally to avoid ArrayConcat() builtin performance degradation. |
| 738 | // |
| 739 | // Details: The idea is that allocations actually happen only in case of |
| 740 | // copying from object with fast double elements to object with object |
| 741 | // elements. In all the other cases there are no allocations performed and |
| 742 | // handle creation causes noticeable performance degradation of the builtin. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 743 | ElementsAccessorSubclass::CopyElementsImpl( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 744 | from, from_start, *to, from_kind, to_start, packed_size, copy_size); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 745 | } |
| 746 | |
| 747 | virtual MaybeHandle<FixedArray> AddElementsToFixedArray( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 748 | Handle<Object> receiver, Handle<JSObject> holder, Handle<FixedArray> to, |
| 749 | Handle<FixedArrayBase> from, FixedArray::KeyFilter filter) FINAL { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 750 | int len0 = to->length(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 751 | #ifdef ENABLE_SLOW_DCHECKS |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 752 | if (FLAG_enable_slow_asserts) { |
| 753 | for (int i = 0; i < len0; i++) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 754 | DCHECK(!to->get(i)->IsTheHole()); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 755 | } |
| 756 | } |
| 757 | #endif |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 758 | |
| 759 | // Optimize if 'other' is empty. |
| 760 | // We cannot optimize if 'this' is empty, as other may have holes. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 761 | uint32_t len1 = ElementsAccessorSubclass::GetCapacityImpl(from); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 762 | if (len1 == 0) return to; |
| 763 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 764 | Isolate* isolate = from->GetIsolate(); |
| 765 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 766 | // Compute how many elements are not in other. |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 767 | uint32_t extra = 0; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 768 | for (uint32_t y = 0; y < len1; y++) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 769 | uint32_t key = ElementsAccessorSubclass::GetKeyForIndexImpl(from, y); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 770 | if (ElementsAccessorSubclass::HasElementImpl( |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 771 | receiver, holder, key, from)) { |
| 772 | Handle<Object> value; |
| 773 | ASSIGN_RETURN_ON_EXCEPTION( |
| 774 | isolate, value, |
| 775 | ElementsAccessorSubclass::GetImpl(receiver, holder, key, from), |
| 776 | FixedArray); |
| 777 | |
| 778 | DCHECK(!value->IsTheHole()); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 779 | if (filter == FixedArray::NON_SYMBOL_KEYS && value->IsSymbol()) { |
| 780 | continue; |
| 781 | } |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 782 | if (!HasKey(to, value)) { |
| 783 | extra++; |
| 784 | } |
| 785 | } |
| 786 | } |
| 787 | |
| 788 | if (extra == 0) return to; |
| 789 | |
| 790 | // Allocate the result |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 791 | Handle<FixedArray> result = isolate->factory()->NewFixedArray(len0 + extra); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 792 | |
| 793 | // Fill in the content |
| 794 | { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 795 | DisallowHeapAllocation no_gc; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 796 | WriteBarrierMode mode = result->GetWriteBarrierMode(no_gc); |
| 797 | for (int i = 0; i < len0; i++) { |
| 798 | Object* e = to->get(i); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 799 | DCHECK(e->IsString() || e->IsNumber()); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 800 | result->set(i, e, mode); |
| 801 | } |
| 802 | } |
| 803 | // Fill in the extra values. |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 804 | uint32_t index = 0; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 805 | for (uint32_t y = 0; y < len1; y++) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 806 | uint32_t key = |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 807 | ElementsAccessorSubclass::GetKeyForIndexImpl(from, y); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 808 | if (ElementsAccessorSubclass::HasElementImpl( |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 809 | receiver, holder, key, from)) { |
| 810 | Handle<Object> value; |
| 811 | ASSIGN_RETURN_ON_EXCEPTION( |
| 812 | isolate, value, |
| 813 | ElementsAccessorSubclass::GetImpl(receiver, holder, key, from), |
| 814 | FixedArray); |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 815 | if (filter == FixedArray::NON_SYMBOL_KEYS && value->IsSymbol()) { |
| 816 | continue; |
| 817 | } |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 818 | if (!value->IsTheHole() && !HasKey(to, value)) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 819 | result->set(len0 + index, *value); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 820 | index++; |
| 821 | } |
| 822 | } |
| 823 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 824 | DCHECK(extra == index); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 825 | return result; |
| 826 | } |
| 827 | |
| 828 | protected: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 829 | static uint32_t GetCapacityImpl(Handle<FixedArrayBase> backing_store) { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 830 | return backing_store->length(); |
| 831 | } |
| 832 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 833 | uint32_t GetCapacity(Handle<FixedArrayBase> backing_store) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 834 | return ElementsAccessorSubclass::GetCapacityImpl(backing_store); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 835 | } |
| 836 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 837 | static uint32_t GetKeyForIndexImpl(Handle<FixedArrayBase> backing_store, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 838 | uint32_t index) { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 839 | return index; |
| 840 | } |
| 841 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 842 | virtual uint32_t GetKeyForIndex(Handle<FixedArrayBase> backing_store, |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 843 | uint32_t index) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 844 | return ElementsAccessorSubclass::GetKeyForIndexImpl(backing_store, index); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 845 | } |
| 846 | |
| 847 | private: |
| 848 | DISALLOW_COPY_AND_ASSIGN(ElementsAccessorBase); |
| 849 | }; |
| 850 | |
| 851 | |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 852 | // Super class for all fast element arrays. |
| 853 | template<typename FastElementsAccessorSubclass, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 854 | typename KindTraits> |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 855 | class FastElementsAccessor |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 856 | : public ElementsAccessorBase<FastElementsAccessorSubclass, KindTraits> { |
Ben Murdoch | 5d4cdbf | 2012-04-11 10:23:59 +0100 | [diff] [blame] | 857 | public: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 858 | explicit FastElementsAccessor(const char* name) |
| 859 | : ElementsAccessorBase<FastElementsAccessorSubclass, |
| 860 | KindTraits>(name) {} |
| 861 | protected: |
| 862 | friend class ElementsAccessorBase<FastElementsAccessorSubclass, KindTraits>; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 863 | friend class SloppyArgumentsElementsAccessor; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 864 | |
| 865 | typedef typename KindTraits::BackingStore BackingStore; |
| 866 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 867 | // Adjusts the length of the fast backing store. |
| 868 | static Handle<Object> SetLengthWithoutNormalize( |
| 869 | Handle<FixedArrayBase> backing_store, |
| 870 | Handle<JSArray> array, |
| 871 | Handle<Object> length_object, |
| 872 | uint32_t length) { |
| 873 | Isolate* isolate = array->GetIsolate(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 874 | uint32_t old_capacity = backing_store->length(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 875 | Handle<Object> old_length(array->length(), isolate); |
| 876 | bool same_or_smaller_size = old_length->IsSmi() && |
| 877 | static_cast<uint32_t>(Handle<Smi>::cast(old_length)->value()) >= length; |
| 878 | ElementsKind kind = array->GetElementsKind(); |
| 879 | |
| 880 | if (!same_or_smaller_size && IsFastElementsKind(kind) && |
| 881 | !IsFastHoleyElementsKind(kind)) { |
| 882 | kind = GetHoleyElementsKind(kind); |
| 883 | JSObject::TransitionElementsKind(array, kind); |
| 884 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 885 | |
| 886 | // Check whether the backing store should be shrunk. |
| 887 | if (length <= old_capacity) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 888 | if (array->HasFastSmiOrObjectElements()) { |
| 889 | backing_store = JSObject::EnsureWritableFastElements(array); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 890 | } |
| 891 | if (2 * length <= old_capacity) { |
| 892 | // If more than half the elements won't be used, trim the array. |
| 893 | if (length == 0) { |
| 894 | array->initialize_elements(); |
| 895 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 896 | isolate->heap()->RightTrimFixedArray<Heap::FROM_MUTATOR>( |
| 897 | *backing_store, old_capacity - length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 898 | } |
| 899 | } else { |
| 900 | // Otherwise, fill the unused tail with holes. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 901 | int old_length = FastD2IChecked(array->length()->Number()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 902 | for (int i = length; i < old_length; i++) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 903 | Handle<BackingStore>::cast(backing_store)->set_the_hole(i); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 904 | } |
| 905 | } |
| 906 | return length_object; |
| 907 | } |
| 908 | |
| 909 | // Check whether the backing store should be expanded. |
| 910 | uint32_t min = JSObject::NewElementsCapacity(old_capacity); |
| 911 | uint32_t new_capacity = length > min ? length : min; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 912 | FastElementsAccessorSubclass::SetFastElementsCapacityAndLength( |
| 913 | array, new_capacity, length); |
| 914 | JSObject::ValidateElements(array); |
| 915 | return length_object; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 916 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 917 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 918 | static Handle<Object> DeleteCommon(Handle<JSObject> obj, |
| 919 | uint32_t key, |
| 920 | JSReceiver::DeleteMode mode) { |
| 921 | DCHECK(obj->HasFastSmiOrObjectElements() || |
| 922 | obj->HasFastDoubleElements() || |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 923 | obj->HasFastArgumentsElements()); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 924 | Isolate* isolate = obj->GetIsolate(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 925 | Heap* heap = obj->GetHeap(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 926 | Handle<FixedArrayBase> elements(obj->elements()); |
| 927 | if (*elements == heap->empty_fixed_array()) { |
| 928 | return isolate->factory()->true_value(); |
| 929 | } |
| 930 | Handle<BackingStore> backing_store = Handle<BackingStore>::cast(elements); |
| 931 | bool is_sloppy_arguments_elements_map = |
| 932 | backing_store->map() == heap->sloppy_arguments_elements_map(); |
| 933 | if (is_sloppy_arguments_elements_map) { |
| 934 | backing_store = handle( |
| 935 | BackingStore::cast(Handle<FixedArray>::cast(backing_store)->get(1)), |
| 936 | isolate); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 937 | } |
| 938 | uint32_t length = static_cast<uint32_t>( |
| 939 | obj->IsJSArray() |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 940 | ? Smi::cast(Handle<JSArray>::cast(obj)->length())->value() |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 941 | : backing_store->length()); |
| 942 | if (key < length) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 943 | if (!is_sloppy_arguments_elements_map) { |
| 944 | ElementsKind kind = KindTraits::Kind; |
| 945 | if (IsFastPackedElementsKind(kind)) { |
| 946 | JSObject::TransitionElementsKind(obj, GetHoleyElementsKind(kind)); |
| 947 | } |
| 948 | if (IsFastSmiOrObjectElementsKind(KindTraits::Kind)) { |
| 949 | Handle<Object> writable = JSObject::EnsureWritableFastElements(obj); |
| 950 | backing_store = Handle<BackingStore>::cast(writable); |
| 951 | } |
| 952 | } |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 953 | backing_store->set_the_hole(key); |
| 954 | // If an old space backing store is larger than a certain size and |
| 955 | // has too few used values, normalize it. |
| 956 | // To avoid doing the check on every delete we require at least |
| 957 | // one adjacent hole to the value being deleted. |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 958 | const int kMinLengthForSparsenessCheck = 64; |
| 959 | if (backing_store->length() >= kMinLengthForSparsenessCheck && |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 960 | !heap->InNewSpace(*backing_store) && |
| 961 | ((key > 0 && backing_store->is_the_hole(key - 1)) || |
| 962 | (key + 1 < length && backing_store->is_the_hole(key + 1)))) { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 963 | int num_used = 0; |
| 964 | for (int i = 0; i < backing_store->length(); ++i) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 965 | if (!backing_store->is_the_hole(i)) ++num_used; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 966 | // Bail out early if more than 1/4 is used. |
| 967 | if (4 * num_used > backing_store->length()) break; |
| 968 | } |
| 969 | if (4 * num_used <= backing_store->length()) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 970 | JSObject::NormalizeElements(obj); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 971 | } |
| 972 | } |
| 973 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 974 | return isolate->factory()->true_value(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 975 | } |
| 976 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 977 | virtual MaybeHandle<Object> Delete(Handle<JSObject> obj, uint32_t key, |
| 978 | JSReceiver::DeleteMode mode) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 979 | return DeleteCommon(obj, key, mode); |
| 980 | } |
| 981 | |
| 982 | static bool HasElementImpl( |
| 983 | Handle<Object> receiver, |
| 984 | Handle<JSObject> holder, |
| 985 | uint32_t key, |
| 986 | Handle<FixedArrayBase> backing_store) { |
| 987 | if (key >= static_cast<uint32_t>(backing_store->length())) { |
| 988 | return false; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 989 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 990 | return !Handle<BackingStore>::cast(backing_store)->is_the_hole(key); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 991 | } |
| 992 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 993 | static void ValidateContents(Handle<JSObject> holder, int length) { |
| 994 | #if DEBUG |
| 995 | Isolate* isolate = holder->GetIsolate(); |
| 996 | HandleScope scope(isolate); |
| 997 | Handle<FixedArrayBase> elements(holder->elements(), isolate); |
| 998 | Map* map = elements->map(); |
| 999 | DCHECK((IsFastSmiOrObjectElementsKind(KindTraits::Kind) && |
| 1000 | (map == isolate->heap()->fixed_array_map() || |
| 1001 | map == isolate->heap()->fixed_cow_array_map())) || |
| 1002 | (IsFastDoubleElementsKind(KindTraits::Kind) == |
| 1003 | ((map == isolate->heap()->fixed_array_map() && length == 0) || |
| 1004 | map == isolate->heap()->fixed_double_array_map()))); |
| 1005 | DisallowHeapAllocation no_gc; |
| 1006 | for (int i = 0; i < length; i++) { |
| 1007 | HandleScope scope(isolate); |
| 1008 | Handle<BackingStore> backing_store = Handle<BackingStore>::cast(elements); |
| 1009 | DCHECK((!IsFastSmiElementsKind(KindTraits::Kind) || |
| 1010 | BackingStore::get(backing_store, i)->IsSmi()) || |
| 1011 | (IsFastHoleyElementsKind(KindTraits::Kind) == |
| 1012 | backing_store->is_the_hole(i))); |
| 1013 | } |
| 1014 | #endif |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1015 | } |
| 1016 | }; |
| 1017 | |
| 1018 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1019 | static inline ElementsKind ElementsKindForArray(FixedArrayBase* array) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1020 | switch (array->map()->instance_type()) { |
| 1021 | case FIXED_ARRAY_TYPE: |
| 1022 | if (array->IsDictionary()) { |
| 1023 | return DICTIONARY_ELEMENTS; |
| 1024 | } else { |
| 1025 | return FAST_HOLEY_ELEMENTS; |
| 1026 | } |
| 1027 | case FIXED_DOUBLE_ARRAY_TYPE: |
| 1028 | return FAST_HOLEY_DOUBLE_ELEMENTS; |
| 1029 | |
| 1030 | #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, size) \ |
| 1031 | case EXTERNAL_##TYPE##_ARRAY_TYPE: \ |
| 1032 | return EXTERNAL_##TYPE##_ELEMENTS; \ |
| 1033 | case FIXED_##TYPE##_ARRAY_TYPE: \ |
| 1034 | return TYPE##_ELEMENTS; |
| 1035 | |
| 1036 | TYPED_ARRAYS(TYPED_ARRAY_CASE) |
| 1037 | #undef TYPED_ARRAY_CASE |
| 1038 | |
| 1039 | default: |
| 1040 | UNREACHABLE(); |
| 1041 | } |
| 1042 | return FAST_HOLEY_ELEMENTS; |
| 1043 | } |
| 1044 | |
| 1045 | |
| 1046 | template<typename FastElementsAccessorSubclass, |
| 1047 | typename KindTraits> |
| 1048 | class FastSmiOrObjectElementsAccessor |
| 1049 | : public FastElementsAccessor<FastElementsAccessorSubclass, KindTraits> { |
| 1050 | public: |
| 1051 | explicit FastSmiOrObjectElementsAccessor(const char* name) |
| 1052 | : FastElementsAccessor<FastElementsAccessorSubclass, |
| 1053 | KindTraits>(name) {} |
| 1054 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1055 | // NOTE: this method violates the handlified function signature convention: |
| 1056 | // raw pointer parameters in the function that allocates. |
| 1057 | // See ElementsAccessor::CopyElements() for details. |
| 1058 | // This method could actually allocate if copying from double elements to |
| 1059 | // object elements. |
| 1060 | static void CopyElementsImpl(FixedArrayBase* from, uint32_t from_start, |
| 1061 | FixedArrayBase* to, ElementsKind from_kind, |
| 1062 | uint32_t to_start, int packed_size, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1063 | int copy_size) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1064 | DisallowHeapAllocation no_gc; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1065 | ElementsKind to_kind = KindTraits::Kind; |
| 1066 | switch (from_kind) { |
| 1067 | case FAST_SMI_ELEMENTS: |
| 1068 | case FAST_HOLEY_SMI_ELEMENTS: |
| 1069 | case FAST_ELEMENTS: |
| 1070 | case FAST_HOLEY_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1071 | CopyObjectToObjectElements(from, from_kind, from_start, to, to_kind, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1072 | to_start, copy_size); |
| 1073 | break; |
| 1074 | case FAST_DOUBLE_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1075 | case FAST_HOLEY_DOUBLE_ELEMENTS: { |
| 1076 | AllowHeapAllocation allow_allocation; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1077 | CopyDoubleToObjectElements( |
| 1078 | from, from_start, to, to_kind, to_start, copy_size); |
| 1079 | break; |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1080 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1081 | case DICTIONARY_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1082 | CopyDictionaryToObjectElements(from, from_start, to, to_kind, to_start, |
| 1083 | copy_size); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1084 | break; |
| 1085 | case SLOPPY_ARGUMENTS_ELEMENTS: { |
| 1086 | // TODO(verwaest): This is a temporary hack to support extending |
| 1087 | // SLOPPY_ARGUMENTS_ELEMENTS in SetFastElementsCapacityAndLength. |
| 1088 | // This case should be UNREACHABLE(). |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1089 | FixedArray* parameter_map = FixedArray::cast(from); |
| 1090 | FixedArrayBase* arguments = FixedArrayBase::cast(parameter_map->get(1)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1091 | ElementsKind from_kind = ElementsKindForArray(arguments); |
| 1092 | CopyElementsImpl(arguments, from_start, to, from_kind, |
| 1093 | to_start, packed_size, copy_size); |
| 1094 | break; |
| 1095 | } |
| 1096 | #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, size) \ |
| 1097 | case EXTERNAL_##TYPE##_ELEMENTS: \ |
| 1098 | case TYPE##_ELEMENTS: \ |
| 1099 | UNREACHABLE(); |
| 1100 | TYPED_ARRAYS(TYPED_ARRAY_CASE) |
| 1101 | #undef TYPED_ARRAY_CASE |
| 1102 | } |
| 1103 | } |
| 1104 | |
| 1105 | |
| 1106 | static void SetFastElementsCapacityAndLength( |
| 1107 | Handle<JSObject> obj, |
| 1108 | uint32_t capacity, |
| 1109 | uint32_t length) { |
| 1110 | JSObject::SetFastElementsCapacitySmiMode set_capacity_mode = |
| 1111 | obj->HasFastSmiElements() |
| 1112 | ? JSObject::kAllowSmiElements |
| 1113 | : JSObject::kDontAllowSmiElements; |
| 1114 | JSObject::SetFastElementsCapacityAndLength( |
| 1115 | obj, capacity, length, set_capacity_mode); |
| 1116 | } |
| 1117 | }; |
| 1118 | |
| 1119 | |
| 1120 | class FastPackedSmiElementsAccessor |
| 1121 | : public FastSmiOrObjectElementsAccessor< |
| 1122 | FastPackedSmiElementsAccessor, |
| 1123 | ElementsKindTraits<FAST_SMI_ELEMENTS> > { |
| 1124 | public: |
| 1125 | explicit FastPackedSmiElementsAccessor(const char* name) |
| 1126 | : FastSmiOrObjectElementsAccessor< |
| 1127 | FastPackedSmiElementsAccessor, |
| 1128 | ElementsKindTraits<FAST_SMI_ELEMENTS> >(name) {} |
| 1129 | }; |
| 1130 | |
| 1131 | |
| 1132 | class FastHoleySmiElementsAccessor |
| 1133 | : public FastSmiOrObjectElementsAccessor< |
| 1134 | FastHoleySmiElementsAccessor, |
| 1135 | ElementsKindTraits<FAST_HOLEY_SMI_ELEMENTS> > { |
| 1136 | public: |
| 1137 | explicit FastHoleySmiElementsAccessor(const char* name) |
| 1138 | : FastSmiOrObjectElementsAccessor< |
| 1139 | FastHoleySmiElementsAccessor, |
| 1140 | ElementsKindTraits<FAST_HOLEY_SMI_ELEMENTS> >(name) {} |
| 1141 | }; |
| 1142 | |
| 1143 | |
| 1144 | class FastPackedObjectElementsAccessor |
| 1145 | : public FastSmiOrObjectElementsAccessor< |
| 1146 | FastPackedObjectElementsAccessor, |
| 1147 | ElementsKindTraits<FAST_ELEMENTS> > { |
| 1148 | public: |
| 1149 | explicit FastPackedObjectElementsAccessor(const char* name) |
| 1150 | : FastSmiOrObjectElementsAccessor< |
| 1151 | FastPackedObjectElementsAccessor, |
| 1152 | ElementsKindTraits<FAST_ELEMENTS> >(name) {} |
| 1153 | }; |
| 1154 | |
| 1155 | |
| 1156 | class FastHoleyObjectElementsAccessor |
| 1157 | : public FastSmiOrObjectElementsAccessor< |
| 1158 | FastHoleyObjectElementsAccessor, |
| 1159 | ElementsKindTraits<FAST_HOLEY_ELEMENTS> > { |
| 1160 | public: |
| 1161 | explicit FastHoleyObjectElementsAccessor(const char* name) |
| 1162 | : FastSmiOrObjectElementsAccessor< |
| 1163 | FastHoleyObjectElementsAccessor, |
| 1164 | ElementsKindTraits<FAST_HOLEY_ELEMENTS> >(name) {} |
| 1165 | }; |
| 1166 | |
| 1167 | |
| 1168 | template<typename FastElementsAccessorSubclass, |
| 1169 | typename KindTraits> |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1170 | class FastDoubleElementsAccessor |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1171 | : public FastElementsAccessor<FastElementsAccessorSubclass, KindTraits> { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1172 | public: |
| 1173 | explicit FastDoubleElementsAccessor(const char* name) |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1174 | : FastElementsAccessor<FastElementsAccessorSubclass, |
| 1175 | KindTraits>(name) {} |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1176 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1177 | static void SetFastElementsCapacityAndLength(Handle<JSObject> obj, |
| 1178 | uint32_t capacity, |
| 1179 | uint32_t length) { |
| 1180 | JSObject::SetFastDoubleElementsCapacityAndLength(obj, capacity, length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1181 | } |
| 1182 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1183 | protected: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1184 | static void CopyElementsImpl(FixedArrayBase* from, uint32_t from_start, |
| 1185 | FixedArrayBase* to, ElementsKind from_kind, |
| 1186 | uint32_t to_start, int packed_size, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1187 | int copy_size) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1188 | DisallowHeapAllocation no_allocation; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1189 | switch (from_kind) { |
| 1190 | case FAST_SMI_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1191 | CopyPackedSmiToDoubleElements(from, from_start, to, to_start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1192 | packed_size, copy_size); |
| 1193 | break; |
| 1194 | case FAST_HOLEY_SMI_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1195 | CopySmiToDoubleElements(from, from_start, to, to_start, copy_size); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1196 | break; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1197 | case FAST_DOUBLE_ELEMENTS: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1198 | case FAST_HOLEY_DOUBLE_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1199 | CopyDoubleToDoubleElements(from, from_start, to, to_start, copy_size); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1200 | break; |
| 1201 | case FAST_ELEMENTS: |
| 1202 | case FAST_HOLEY_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1203 | CopyObjectToDoubleElements(from, from_start, to, to_start, copy_size); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1204 | break; |
| 1205 | case DICTIONARY_ELEMENTS: |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1206 | CopyDictionaryToDoubleElements(from, from_start, to, to_start, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1207 | copy_size); |
| 1208 | break; |
| 1209 | case SLOPPY_ARGUMENTS_ELEMENTS: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1210 | UNREACHABLE(); |
Ben Murdoch | 5d4cdbf | 2012-04-11 10:23:59 +0100 | [diff] [blame] | 1211 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1212 | #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, size) \ |
| 1213 | case EXTERNAL_##TYPE##_ELEMENTS: \ |
| 1214 | case TYPE##_ELEMENTS: \ |
| 1215 | UNREACHABLE(); |
| 1216 | TYPED_ARRAYS(TYPED_ARRAY_CASE) |
| 1217 | #undef TYPED_ARRAY_CASE |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1218 | } |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1219 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1220 | }; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1221 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1222 | |
| 1223 | class FastPackedDoubleElementsAccessor |
| 1224 | : public FastDoubleElementsAccessor< |
| 1225 | FastPackedDoubleElementsAccessor, |
| 1226 | ElementsKindTraits<FAST_DOUBLE_ELEMENTS> > { |
| 1227 | public: |
| 1228 | friend class ElementsAccessorBase<FastPackedDoubleElementsAccessor, |
| 1229 | ElementsKindTraits<FAST_DOUBLE_ELEMENTS> >; |
| 1230 | explicit FastPackedDoubleElementsAccessor(const char* name) |
| 1231 | : FastDoubleElementsAccessor< |
| 1232 | FastPackedDoubleElementsAccessor, |
| 1233 | ElementsKindTraits<FAST_DOUBLE_ELEMENTS> >(name) {} |
| 1234 | }; |
| 1235 | |
| 1236 | |
| 1237 | class FastHoleyDoubleElementsAccessor |
| 1238 | : public FastDoubleElementsAccessor< |
| 1239 | FastHoleyDoubleElementsAccessor, |
| 1240 | ElementsKindTraits<FAST_HOLEY_DOUBLE_ELEMENTS> > { |
| 1241 | public: |
| 1242 | friend class ElementsAccessorBase< |
| 1243 | FastHoleyDoubleElementsAccessor, |
| 1244 | ElementsKindTraits<FAST_HOLEY_DOUBLE_ELEMENTS> >; |
| 1245 | explicit FastHoleyDoubleElementsAccessor(const char* name) |
| 1246 | : FastDoubleElementsAccessor< |
| 1247 | FastHoleyDoubleElementsAccessor, |
| 1248 | ElementsKindTraits<FAST_HOLEY_DOUBLE_ELEMENTS> >(name) {} |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1249 | }; |
| 1250 | |
| 1251 | |
| 1252 | // Super class for all external element arrays. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1253 | template<ElementsKind Kind> |
| 1254 | class TypedElementsAccessor |
| 1255 | : public ElementsAccessorBase<TypedElementsAccessor<Kind>, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1256 | ElementsKindTraits<Kind> > { |
| 1257 | public: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1258 | explicit TypedElementsAccessor(const char* name) |
| 1259 | : ElementsAccessorBase<AccessorClass, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1260 | ElementsKindTraits<Kind> >(name) {} |
Ben Murdoch | 5d4cdbf | 2012-04-11 10:23:59 +0100 | [diff] [blame] | 1261 | |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1262 | protected: |
| 1263 | typedef typename ElementsKindTraits<Kind>::BackingStore BackingStore; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1264 | typedef TypedElementsAccessor<Kind> AccessorClass; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1265 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1266 | friend class ElementsAccessorBase<AccessorClass, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1267 | ElementsKindTraits<Kind> >; |
| 1268 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1269 | MUST_USE_RESULT static MaybeHandle<Object> GetImpl( |
| 1270 | Handle<Object> receiver, |
| 1271 | Handle<JSObject> obj, |
| 1272 | uint32_t key, |
| 1273 | Handle<FixedArrayBase> backing_store) { |
| 1274 | if (key < AccessorClass::GetCapacityImpl(backing_store)) { |
| 1275 | return BackingStore::get(Handle<BackingStore>::cast(backing_store), key); |
| 1276 | } else { |
| 1277 | return backing_store->GetIsolate()->factory()->undefined_value(); |
| 1278 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1279 | } |
| 1280 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1281 | MUST_USE_RESULT static PropertyAttributes GetAttributesImpl( |
| 1282 | Handle<Object> receiver, |
| 1283 | Handle<JSObject> obj, |
| 1284 | uint32_t key, |
| 1285 | Handle<FixedArrayBase> backing_store) { |
| 1286 | return |
| 1287 | key < AccessorClass::GetCapacityImpl(backing_store) |
| 1288 | ? NONE : ABSENT; |
| 1289 | } |
| 1290 | |
| 1291 | MUST_USE_RESULT static MaybeHandle<Object> SetLengthImpl( |
| 1292 | Handle<JSObject> obj, |
| 1293 | Handle<Object> length, |
| 1294 | Handle<FixedArrayBase> backing_store) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1295 | // External arrays do not support changing their length. |
| 1296 | UNREACHABLE(); |
| 1297 | return obj; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1298 | } |
| 1299 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1300 | MUST_USE_RESULT virtual MaybeHandle<Object> Delete( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1301 | Handle<JSObject> obj, uint32_t key, JSReceiver::DeleteMode mode) FINAL { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1302 | // External arrays always ignore deletes. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1303 | return obj->GetIsolate()->factory()->true_value(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1304 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1305 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1306 | static bool HasElementImpl(Handle<Object> receiver, |
| 1307 | Handle<JSObject> holder, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1308 | uint32_t key, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1309 | Handle<FixedArrayBase> backing_store) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1310 | uint32_t capacity = |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1311 | AccessorClass::GetCapacityImpl(backing_store); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1312 | return key < capacity; |
| 1313 | } |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1314 | }; |
| 1315 | |
| 1316 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1317 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1318 | #define EXTERNAL_ELEMENTS_ACCESSOR(Type, type, TYPE, ctype, size) \ |
| 1319 | typedef TypedElementsAccessor<EXTERNAL_##TYPE##_ELEMENTS> \ |
| 1320 | External##Type##ElementsAccessor; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1321 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1322 | TYPED_ARRAYS(EXTERNAL_ELEMENTS_ACCESSOR) |
| 1323 | #undef EXTERNAL_ELEMENTS_ACCESSOR |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1324 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1325 | #define FIXED_ELEMENTS_ACCESSOR(Type, type, TYPE, ctype, size) \ |
| 1326 | typedef TypedElementsAccessor<TYPE##_ELEMENTS > \ |
| 1327 | Fixed##Type##ElementsAccessor; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1328 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1329 | TYPED_ARRAYS(FIXED_ELEMENTS_ACCESSOR) |
| 1330 | #undef FIXED_ELEMENTS_ACCESSOR |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1331 | |
| 1332 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1333 | |
| 1334 | class DictionaryElementsAccessor |
| 1335 | : public ElementsAccessorBase<DictionaryElementsAccessor, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1336 | ElementsKindTraits<DICTIONARY_ELEMENTS> > { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1337 | public: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1338 | explicit DictionaryElementsAccessor(const char* name) |
| 1339 | : ElementsAccessorBase<DictionaryElementsAccessor, |
| 1340 | ElementsKindTraits<DICTIONARY_ELEMENTS> >(name) {} |
| 1341 | |
| 1342 | // Adjusts the length of the dictionary backing store and returns the new |
| 1343 | // length according to ES5 section 15.4.5.2 behavior. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1344 | static Handle<Object> SetLengthWithoutNormalize( |
| 1345 | Handle<FixedArrayBase> store, |
| 1346 | Handle<JSArray> array, |
| 1347 | Handle<Object> length_object, |
| 1348 | uint32_t length) { |
| 1349 | Handle<SeededNumberDictionary> dict = |
| 1350 | Handle<SeededNumberDictionary>::cast(store); |
| 1351 | Isolate* isolate = array->GetIsolate(); |
| 1352 | int capacity = dict->Capacity(); |
| 1353 | uint32_t new_length = length; |
| 1354 | uint32_t old_length = static_cast<uint32_t>(array->length()->Number()); |
| 1355 | if (new_length < old_length) { |
| 1356 | // Find last non-deletable element in range of elements to be |
| 1357 | // deleted and adjust range accordingly. |
| 1358 | for (int i = 0; i < capacity; i++) { |
| 1359 | DisallowHeapAllocation no_gc; |
| 1360 | Object* key = dict->KeyAt(i); |
| 1361 | if (key->IsNumber()) { |
| 1362 | uint32_t number = static_cast<uint32_t>(key->Number()); |
| 1363 | if (new_length <= number && number < old_length) { |
| 1364 | PropertyDetails details = dict->DetailsAt(i); |
| 1365 | if (!details.IsConfigurable()) new_length = number + 1; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1366 | } |
| 1367 | } |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1368 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1369 | if (new_length != length) { |
| 1370 | length_object = isolate->factory()->NewNumberFromUint(new_length); |
| 1371 | } |
| 1372 | } |
| 1373 | |
| 1374 | if (new_length == 0) { |
| 1375 | // Flush the backing store. |
| 1376 | JSObject::ResetElements(array); |
| 1377 | } else { |
| 1378 | DisallowHeapAllocation no_gc; |
| 1379 | // Remove elements that should be deleted. |
| 1380 | int removed_entries = 0; |
| 1381 | Handle<Object> the_hole_value = isolate->factory()->the_hole_value(); |
| 1382 | for (int i = 0; i < capacity; i++) { |
| 1383 | Object* key = dict->KeyAt(i); |
| 1384 | if (key->IsNumber()) { |
| 1385 | uint32_t number = static_cast<uint32_t>(key->Number()); |
| 1386 | if (new_length <= number && number < old_length) { |
| 1387 | dict->SetEntry(i, the_hole_value, the_hole_value); |
| 1388 | removed_entries++; |
| 1389 | } |
| 1390 | } |
| 1391 | } |
| 1392 | |
| 1393 | // Update the number of elements. |
| 1394 | dict->ElementsRemoved(removed_entries); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1395 | } |
| 1396 | return length_object; |
| 1397 | } |
| 1398 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1399 | MUST_USE_RESULT static MaybeHandle<Object> DeleteCommon( |
| 1400 | Handle<JSObject> obj, |
| 1401 | uint32_t key, |
| 1402 | JSReceiver::DeleteMode mode) { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1403 | Isolate* isolate = obj->GetIsolate(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1404 | Handle<FixedArray> backing_store(FixedArray::cast(obj->elements()), |
| 1405 | isolate); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1406 | bool is_arguments = |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1407 | (obj->GetElementsKind() == SLOPPY_ARGUMENTS_ELEMENTS); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1408 | if (is_arguments) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1409 | backing_store = handle(FixedArray::cast(backing_store->get(1)), isolate); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1410 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1411 | Handle<SeededNumberDictionary> dictionary = |
| 1412 | Handle<SeededNumberDictionary>::cast(backing_store); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1413 | int entry = dictionary->FindEntry(key); |
Ben Murdoch | c7cc028 | 2012-03-05 14:35:55 +0000 | [diff] [blame] | 1414 | if (entry != SeededNumberDictionary::kNotFound) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1415 | Handle<Object> result = |
| 1416 | SeededNumberDictionary::DeleteProperty(dictionary, entry, mode); |
| 1417 | if (*result == *isolate->factory()->false_value()) { |
| 1418 | if (mode == JSObject::STRICT_DELETION) { |
| 1419 | // Deleting a non-configurable property in strict mode. |
| 1420 | Handle<Object> name = isolate->factory()->NewNumberFromUint(key); |
| 1421 | Handle<Object> args[2] = { name, obj }; |
| 1422 | THROW_NEW_ERROR(isolate, NewTypeError("strict_delete_property", |
| 1423 | HandleVector(args, 2)), |
| 1424 | Object); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1425 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1426 | return isolate->factory()->false_value(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1427 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1428 | Handle<FixedArray> new_elements = |
| 1429 | SeededNumberDictionary::Shrink(dictionary, key); |
| 1430 | |
| 1431 | if (is_arguments) { |
| 1432 | FixedArray::cast(obj->elements())->set(1, *new_elements); |
| 1433 | } else { |
| 1434 | obj->set_elements(*new_elements); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1435 | } |
| 1436 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1437 | return isolate->factory()->true_value(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1438 | } |
| 1439 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1440 | static void CopyElementsImpl(FixedArrayBase* from, uint32_t from_start, |
| 1441 | FixedArrayBase* to, ElementsKind from_kind, |
| 1442 | uint32_t to_start, int packed_size, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1443 | int copy_size) { |
| 1444 | UNREACHABLE(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1445 | } |
| 1446 | |
| 1447 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1448 | protected: |
| 1449 | friend class ElementsAccessorBase<DictionaryElementsAccessor, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1450 | ElementsKindTraits<DICTIONARY_ELEMENTS> >; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1451 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1452 | MUST_USE_RESULT virtual MaybeHandle<Object> Delete( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1453 | Handle<JSObject> obj, uint32_t key, JSReceiver::DeleteMode mode) FINAL { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1454 | return DeleteCommon(obj, key, mode); |
| 1455 | } |
| 1456 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1457 | MUST_USE_RESULT static MaybeHandle<Object> GetImpl( |
| 1458 | Handle<Object> receiver, |
| 1459 | Handle<JSObject> obj, |
| 1460 | uint32_t key, |
| 1461 | Handle<FixedArrayBase> store) { |
| 1462 | Handle<SeededNumberDictionary> backing_store = |
| 1463 | Handle<SeededNumberDictionary>::cast(store); |
| 1464 | Isolate* isolate = backing_store->GetIsolate(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1465 | int entry = backing_store->FindEntry(key); |
Ben Murdoch | c7cc028 | 2012-03-05 14:35:55 +0000 | [diff] [blame] | 1466 | if (entry != SeededNumberDictionary::kNotFound) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1467 | Handle<Object> element(backing_store->ValueAt(entry), isolate); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1468 | PropertyDetails details = backing_store->DetailsAt(entry); |
| 1469 | if (details.type() == CALLBACKS) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1470 | return JSObject::GetElementWithCallback( |
| 1471 | obj, receiver, element, key, obj); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1472 | } else { |
| 1473 | return element; |
| 1474 | } |
| 1475 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1476 | return isolate->factory()->the_hole_value(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1477 | } |
| 1478 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1479 | MUST_USE_RESULT static PropertyAttributes GetAttributesImpl( |
| 1480 | Handle<Object> receiver, |
| 1481 | Handle<JSObject> obj, |
| 1482 | uint32_t key, |
| 1483 | Handle<FixedArrayBase> backing_store) { |
| 1484 | Handle<SeededNumberDictionary> dictionary = |
| 1485 | Handle<SeededNumberDictionary>::cast(backing_store); |
| 1486 | int entry = dictionary->FindEntry(key); |
| 1487 | if (entry != SeededNumberDictionary::kNotFound) { |
| 1488 | return dictionary->DetailsAt(entry).attributes(); |
| 1489 | } |
| 1490 | return ABSENT; |
| 1491 | } |
| 1492 | |
| 1493 | MUST_USE_RESULT static MaybeHandle<AccessorPair> GetAccessorPairImpl( |
| 1494 | Handle<Object> receiver, |
| 1495 | Handle<JSObject> obj, |
| 1496 | uint32_t key, |
| 1497 | Handle<FixedArrayBase> store) { |
| 1498 | Handle<SeededNumberDictionary> backing_store = |
| 1499 | Handle<SeededNumberDictionary>::cast(store); |
| 1500 | int entry = backing_store->FindEntry(key); |
| 1501 | if (entry != SeededNumberDictionary::kNotFound && |
| 1502 | backing_store->DetailsAt(entry).type() == CALLBACKS && |
| 1503 | backing_store->ValueAt(entry)->IsAccessorPair()) { |
| 1504 | return handle(AccessorPair::cast(backing_store->ValueAt(entry))); |
| 1505 | } |
| 1506 | return MaybeHandle<AccessorPair>(); |
| 1507 | } |
| 1508 | |
| 1509 | static bool HasElementImpl(Handle<Object> receiver, |
| 1510 | Handle<JSObject> holder, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1511 | uint32_t key, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1512 | Handle<FixedArrayBase> store) { |
| 1513 | Handle<SeededNumberDictionary> backing_store = |
| 1514 | Handle<SeededNumberDictionary>::cast(store); |
| 1515 | return backing_store->FindEntry(key) != SeededNumberDictionary::kNotFound; |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1516 | } |
| 1517 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1518 | static uint32_t GetKeyForIndexImpl(Handle<FixedArrayBase> store, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1519 | uint32_t index) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1520 | DisallowHeapAllocation no_gc; |
| 1521 | Handle<SeededNumberDictionary> dict = |
| 1522 | Handle<SeededNumberDictionary>::cast(store); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1523 | Object* key = dict->KeyAt(index); |
| 1524 | return Smi::cast(key)->value(); |
| 1525 | } |
| 1526 | }; |
| 1527 | |
| 1528 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1529 | class SloppyArgumentsElementsAccessor : public ElementsAccessorBase< |
| 1530 | SloppyArgumentsElementsAccessor, |
| 1531 | ElementsKindTraits<SLOPPY_ARGUMENTS_ELEMENTS> > { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1532 | public: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1533 | explicit SloppyArgumentsElementsAccessor(const char* name) |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1534 | : ElementsAccessorBase< |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1535 | SloppyArgumentsElementsAccessor, |
| 1536 | ElementsKindTraits<SLOPPY_ARGUMENTS_ELEMENTS> >(name) {} |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1537 | protected: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1538 | friend class ElementsAccessorBase< |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1539 | SloppyArgumentsElementsAccessor, |
| 1540 | ElementsKindTraits<SLOPPY_ARGUMENTS_ELEMENTS> >; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1541 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1542 | MUST_USE_RESULT static MaybeHandle<Object> GetImpl( |
| 1543 | Handle<Object> receiver, |
| 1544 | Handle<JSObject> obj, |
| 1545 | uint32_t key, |
| 1546 | Handle<FixedArrayBase> parameters) { |
| 1547 | Isolate* isolate = obj->GetIsolate(); |
| 1548 | Handle<FixedArray> parameter_map = Handle<FixedArray>::cast(parameters); |
| 1549 | Handle<Object> probe = GetParameterMapArg(obj, parameter_map, key); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1550 | if (!probe->IsTheHole()) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1551 | DisallowHeapAllocation no_gc; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1552 | Context* context = Context::cast(parameter_map->get(0)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1553 | int context_index = Handle<Smi>::cast(probe)->value(); |
| 1554 | DCHECK(!context->get(context_index)->IsTheHole()); |
| 1555 | return handle(context->get(context_index), isolate); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1556 | } else { |
| 1557 | // Object is not mapped, defer to the arguments. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1558 | Handle<FixedArray> arguments(FixedArray::cast(parameter_map->get(1)), |
| 1559 | isolate); |
| 1560 | Handle<Object> result; |
| 1561 | ASSIGN_RETURN_ON_EXCEPTION( |
| 1562 | isolate, result, |
| 1563 | ElementsAccessor::ForArray(arguments)->Get( |
| 1564 | receiver, obj, key, arguments), |
| 1565 | Object); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1566 | // Elements of the arguments object in slow mode might be slow aliases. |
| 1567 | if (result->IsAliasedArgumentsEntry()) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1568 | DisallowHeapAllocation no_gc; |
| 1569 | AliasedArgumentsEntry* entry = AliasedArgumentsEntry::cast(*result); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1570 | Context* context = Context::cast(parameter_map->get(0)); |
| 1571 | int context_index = entry->aliased_context_slot(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1572 | DCHECK(!context->get(context_index)->IsTheHole()); |
| 1573 | return handle(context->get(context_index), isolate); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1574 | } else { |
| 1575 | return result; |
| 1576 | } |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1577 | } |
| 1578 | } |
| 1579 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1580 | MUST_USE_RESULT static PropertyAttributes GetAttributesImpl( |
| 1581 | Handle<Object> receiver, |
| 1582 | Handle<JSObject> obj, |
| 1583 | uint32_t key, |
| 1584 | Handle<FixedArrayBase> backing_store) { |
| 1585 | Handle<FixedArray> parameter_map = Handle<FixedArray>::cast(backing_store); |
| 1586 | Handle<Object> probe = GetParameterMapArg(obj, parameter_map, key); |
| 1587 | if (!probe->IsTheHole()) { |
| 1588 | return NONE; |
| 1589 | } else { |
| 1590 | // If not aliased, check the arguments. |
| 1591 | Handle<FixedArray> arguments(FixedArray::cast(parameter_map->get(1))); |
| 1592 | return ElementsAccessor::ForArray(arguments)->GetAttributes( |
| 1593 | receiver, obj, key, arguments); |
| 1594 | } |
| 1595 | } |
| 1596 | |
| 1597 | MUST_USE_RESULT static MaybeHandle<AccessorPair> GetAccessorPairImpl( |
| 1598 | Handle<Object> receiver, |
| 1599 | Handle<JSObject> obj, |
| 1600 | uint32_t key, |
| 1601 | Handle<FixedArrayBase> parameters) { |
| 1602 | Handle<FixedArray> parameter_map = Handle<FixedArray>::cast(parameters); |
| 1603 | Handle<Object> probe = GetParameterMapArg(obj, parameter_map, key); |
| 1604 | if (!probe->IsTheHole()) { |
| 1605 | return MaybeHandle<AccessorPair>(); |
| 1606 | } else { |
| 1607 | // If not aliased, check the arguments. |
| 1608 | Handle<FixedArray> arguments(FixedArray::cast(parameter_map->get(1))); |
| 1609 | return ElementsAccessor::ForArray(arguments)->GetAccessorPair( |
| 1610 | receiver, obj, key, arguments); |
| 1611 | } |
| 1612 | } |
| 1613 | |
| 1614 | MUST_USE_RESULT static MaybeHandle<Object> SetLengthImpl( |
| 1615 | Handle<JSObject> obj, |
| 1616 | Handle<Object> length, |
| 1617 | Handle<FixedArrayBase> parameter_map) { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1618 | // TODO(mstarzinger): This was never implemented but will be used once we |
| 1619 | // correctly implement [[DefineOwnProperty]] on arrays. |
| 1620 | UNIMPLEMENTED(); |
| 1621 | return obj; |
| 1622 | } |
| 1623 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1624 | MUST_USE_RESULT virtual MaybeHandle<Object> Delete( |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1625 | Handle<JSObject> obj, uint32_t key, JSReceiver::DeleteMode mode) FINAL { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1626 | Isolate* isolate = obj->GetIsolate(); |
| 1627 | Handle<FixedArray> parameter_map(FixedArray::cast(obj->elements())); |
| 1628 | Handle<Object> probe = GetParameterMapArg(obj, parameter_map, key); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1629 | if (!probe->IsTheHole()) { |
| 1630 | // TODO(kmillikin): We could check if this was the last aliased |
| 1631 | // parameter, and revert to normal elements in that case. That |
| 1632 | // would enable GC of the context. |
| 1633 | parameter_map->set_the_hole(key + 2); |
| 1634 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1635 | Handle<FixedArray> arguments(FixedArray::cast(parameter_map->get(1))); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1636 | if (arguments->IsDictionary()) { |
| 1637 | return DictionaryElementsAccessor::DeleteCommon(obj, key, mode); |
| 1638 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1639 | // It's difficult to access the version of DeleteCommon that is declared |
| 1640 | // in the templatized super class, call the concrete implementation in |
| 1641 | // the class for the most generalized ElementsKind subclass. |
| 1642 | return FastHoleyObjectElementsAccessor::DeleteCommon(obj, key, mode); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1643 | } |
| 1644 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1645 | return isolate->factory()->true_value(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1646 | } |
| 1647 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1648 | static void CopyElementsImpl(FixedArrayBase* from, uint32_t from_start, |
| 1649 | FixedArrayBase* to, ElementsKind from_kind, |
| 1650 | uint32_t to_start, int packed_size, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1651 | int copy_size) { |
| 1652 | UNREACHABLE(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1653 | } |
| 1654 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1655 | static uint32_t GetCapacityImpl(Handle<FixedArrayBase> backing_store) { |
| 1656 | Handle<FixedArray> parameter_map = Handle<FixedArray>::cast(backing_store); |
| 1657 | Handle<FixedArrayBase> arguments( |
| 1658 | FixedArrayBase::cast(parameter_map->get(1))); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1659 | return Max(static_cast<uint32_t>(parameter_map->length() - 2), |
| 1660 | ForArray(arguments)->GetCapacity(arguments)); |
| 1661 | } |
| 1662 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1663 | static uint32_t GetKeyForIndexImpl(Handle<FixedArrayBase> dict, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1664 | uint32_t index) { |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1665 | return index; |
| 1666 | } |
| 1667 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1668 | static bool HasElementImpl(Handle<Object> receiver, |
| 1669 | Handle<JSObject> holder, |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1670 | uint32_t key, |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1671 | Handle<FixedArrayBase> parameters) { |
| 1672 | Handle<FixedArray> parameter_map = Handle<FixedArray>::cast(parameters); |
| 1673 | Handle<Object> probe = GetParameterMapArg(holder, parameter_map, key); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1674 | if (!probe->IsTheHole()) { |
| 1675 | return true; |
| 1676 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1677 | Isolate* isolate = holder->GetIsolate(); |
| 1678 | Handle<FixedArrayBase> arguments(FixedArrayBase::cast( |
| 1679 | Handle<FixedArray>::cast(parameter_map)->get(1)), isolate); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1680 | ElementsAccessor* accessor = ElementsAccessor::ForArray(arguments); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1681 | Handle<Object> value; |
| 1682 | ASSIGN_RETURN_ON_EXCEPTION_VALUE( |
| 1683 | isolate, value, |
| 1684 | accessor->Get(receiver, holder, key, arguments), |
| 1685 | false); |
| 1686 | return !value->IsTheHole(); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1687 | } |
| 1688 | } |
| 1689 | |
| 1690 | private: |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1691 | static Handle<Object> GetParameterMapArg(Handle<JSObject> holder, |
| 1692 | Handle<FixedArray> parameter_map, |
| 1693 | uint32_t key) { |
| 1694 | Isolate* isolate = holder->GetIsolate(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1695 | uint32_t length = holder->IsJSArray() |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1696 | ? Smi::cast(Handle<JSArray>::cast(holder)->length())->value() |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1697 | : parameter_map->length(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1698 | return key < (length - 2) |
| 1699 | ? handle(parameter_map->get(key + 2), isolate) |
| 1700 | : Handle<Object>::cast(isolate->factory()->the_hole_value()); |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1701 | } |
| 1702 | }; |
| 1703 | |
| 1704 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1705 | ElementsAccessor* ElementsAccessor::ForArray(Handle<FixedArrayBase> array) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame^] | 1706 | return elements_accessors_[ElementsKindForArray(*array)]; |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1707 | } |
| 1708 | |
| 1709 | |
| 1710 | void ElementsAccessor::InitializeOncePerProcess() { |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1711 | static ElementsAccessor* accessor_array[] = { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1712 | #define ACCESSOR_ARRAY(Class, Kind, Store) new Class(#Kind), |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1713 | ELEMENTS_LIST(ACCESSOR_ARRAY) |
| 1714 | #undef ACCESSOR_ARRAY |
| 1715 | }; |
| 1716 | |
| 1717 | STATIC_ASSERT((sizeof(accessor_array) / sizeof(*accessor_array)) == |
| 1718 | kElementsKindCount); |
| 1719 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1720 | elements_accessors_ = accessor_array; |
| 1721 | } |
| 1722 | |
| 1723 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1724 | void ElementsAccessor::TearDown() { |
| 1725 | if (elements_accessors_ == NULL) return; |
| 1726 | #define ACCESSOR_DELETE(Class, Kind, Store) delete elements_accessors_[Kind]; |
| 1727 | ELEMENTS_LIST(ACCESSOR_DELETE) |
| 1728 | #undef ACCESSOR_DELETE |
| 1729 | elements_accessors_ = NULL; |
| 1730 | } |
| 1731 | |
| 1732 | |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1733 | template <typename ElementsAccessorSubclass, typename ElementsKindTraits> |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1734 | MUST_USE_RESULT |
| 1735 | MaybeHandle<Object> ElementsAccessorBase<ElementsAccessorSubclass, |
| 1736 | ElementsKindTraits>:: |
| 1737 | SetLengthImpl(Handle<JSObject> obj, |
| 1738 | Handle<Object> length, |
| 1739 | Handle<FixedArrayBase> backing_store) { |
| 1740 | Isolate* isolate = obj->GetIsolate(); |
| 1741 | Handle<JSArray> array = Handle<JSArray>::cast(obj); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1742 | |
| 1743 | // Fast case: The new length fits into a Smi. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1744 | Handle<Object> smi_length; |
| 1745 | |
| 1746 | if (Object::ToSmi(isolate, length).ToHandle(&smi_length) && |
| 1747 | smi_length->IsSmi()) { |
| 1748 | const int value = Handle<Smi>::cast(smi_length)->value(); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1749 | if (value >= 0) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1750 | Handle<Object> new_length = ElementsAccessorSubclass:: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1751 | SetLengthWithoutNormalize(backing_store, array, smi_length, value); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1752 | DCHECK(!new_length.is_null()); |
| 1753 | |
| 1754 | // even though the proposed length was a smi, new_length could |
| 1755 | // still be a heap number because SetLengthWithoutNormalize doesn't |
| 1756 | // allow the array length property to drop below the index of |
| 1757 | // non-deletable elements. |
| 1758 | DCHECK(new_length->IsSmi() || new_length->IsHeapNumber() || |
| 1759 | new_length->IsUndefined()); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1760 | if (new_length->IsSmi()) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1761 | array->set_length(*Handle<Smi>::cast(new_length)); |
| 1762 | return array; |
| 1763 | } else if (new_length->IsHeapNumber()) { |
| 1764 | array->set_length(*new_length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1765 | return array; |
| 1766 | } |
| 1767 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1768 | return ThrowArrayLengthRangeError(isolate); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1769 | } |
| 1770 | } |
| 1771 | |
| 1772 | // Slow case: The new length does not fit into a Smi or conversion |
| 1773 | // to slow elements is needed for other reasons. |
| 1774 | if (length->IsNumber()) { |
| 1775 | uint32_t value; |
| 1776 | if (length->ToArrayIndex(&value)) { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1777 | Handle<SeededNumberDictionary> dictionary = |
| 1778 | JSObject::NormalizeElements(array); |
| 1779 | DCHECK(!dictionary.is_null()); |
| 1780 | |
| 1781 | Handle<Object> new_length = DictionaryElementsAccessor:: |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1782 | SetLengthWithoutNormalize(dictionary, array, length, value); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1783 | DCHECK(!new_length.is_null()); |
| 1784 | |
| 1785 | DCHECK(new_length->IsNumber()); |
| 1786 | array->set_length(*new_length); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1787 | return array; |
| 1788 | } else { |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1789 | return ThrowArrayLengthRangeError(isolate); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1790 | } |
| 1791 | } |
| 1792 | |
| 1793 | // Fall-back case: The new length is not a number so make the array |
| 1794 | // size one and set only element to length. |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1795 | Handle<FixedArray> new_backing_store = isolate->factory()->NewFixedArray(1); |
| 1796 | new_backing_store->set(0, *length); |
| 1797 | JSArray::SetContent(array, new_backing_store); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1798 | return array; |
| 1799 | } |
| 1800 | |
| 1801 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1802 | MaybeHandle<Object> ArrayConstructInitializeElements(Handle<JSArray> array, |
| 1803 | Arguments* args) { |
| 1804 | // Optimize the case where there is one argument and the argument is a |
| 1805 | // small smi. |
| 1806 | if (args->length() == 1) { |
| 1807 | Handle<Object> obj = args->at<Object>(0); |
| 1808 | if (obj->IsSmi()) { |
| 1809 | int len = Handle<Smi>::cast(obj)->value(); |
| 1810 | if (len > 0 && len < JSObject::kInitialMaxFastElementArray) { |
| 1811 | ElementsKind elements_kind = array->GetElementsKind(); |
| 1812 | JSArray::Initialize(array, len, len); |
| 1813 | |
| 1814 | if (!IsFastHoleyElementsKind(elements_kind)) { |
| 1815 | elements_kind = GetHoleyElementsKind(elements_kind); |
| 1816 | JSObject::TransitionElementsKind(array, elements_kind); |
| 1817 | } |
| 1818 | return array; |
| 1819 | } else if (len == 0) { |
| 1820 | JSArray::Initialize(array, JSArray::kPreallocatedArrayElements); |
| 1821 | return array; |
| 1822 | } |
| 1823 | } |
| 1824 | |
| 1825 | // Take the argument as the length. |
| 1826 | JSArray::Initialize(array, 0); |
| 1827 | |
| 1828 | return JSArray::SetElementsLength(array, obj); |
| 1829 | } |
| 1830 | |
| 1831 | // Optimize the case where there are no parameters passed. |
| 1832 | if (args->length() == 0) { |
| 1833 | JSArray::Initialize(array, JSArray::kPreallocatedArrayElements); |
| 1834 | return array; |
| 1835 | } |
| 1836 | |
| 1837 | Factory* factory = array->GetIsolate()->factory(); |
| 1838 | |
| 1839 | // Set length and elements on the array. |
| 1840 | int number_of_elements = args->length(); |
| 1841 | JSObject::EnsureCanContainElements( |
| 1842 | array, args, 0, number_of_elements, ALLOW_CONVERTED_DOUBLE_ELEMENTS); |
| 1843 | |
| 1844 | // Allocate an appropriately typed elements array. |
| 1845 | ElementsKind elements_kind = array->GetElementsKind(); |
| 1846 | Handle<FixedArrayBase> elms; |
| 1847 | if (IsFastDoubleElementsKind(elements_kind)) { |
| 1848 | elms = Handle<FixedArrayBase>::cast( |
| 1849 | factory->NewFixedDoubleArray(number_of_elements)); |
| 1850 | } else { |
| 1851 | elms = Handle<FixedArrayBase>::cast( |
| 1852 | factory->NewFixedArrayWithHoles(number_of_elements)); |
| 1853 | } |
| 1854 | |
| 1855 | // Fill in the content |
| 1856 | switch (array->GetElementsKind()) { |
| 1857 | case FAST_HOLEY_SMI_ELEMENTS: |
| 1858 | case FAST_SMI_ELEMENTS: { |
| 1859 | Handle<FixedArray> smi_elms = Handle<FixedArray>::cast(elms); |
| 1860 | for (int index = 0; index < number_of_elements; index++) { |
| 1861 | smi_elms->set(index, (*args)[index], SKIP_WRITE_BARRIER); |
| 1862 | } |
| 1863 | break; |
| 1864 | } |
| 1865 | case FAST_HOLEY_ELEMENTS: |
| 1866 | case FAST_ELEMENTS: { |
| 1867 | DisallowHeapAllocation no_gc; |
| 1868 | WriteBarrierMode mode = elms->GetWriteBarrierMode(no_gc); |
| 1869 | Handle<FixedArray> object_elms = Handle<FixedArray>::cast(elms); |
| 1870 | for (int index = 0; index < number_of_elements; index++) { |
| 1871 | object_elms->set(index, (*args)[index], mode); |
| 1872 | } |
| 1873 | break; |
| 1874 | } |
| 1875 | case FAST_HOLEY_DOUBLE_ELEMENTS: |
| 1876 | case FAST_DOUBLE_ELEMENTS: { |
| 1877 | Handle<FixedDoubleArray> double_elms = |
| 1878 | Handle<FixedDoubleArray>::cast(elms); |
| 1879 | for (int index = 0; index < number_of_elements; index++) { |
| 1880 | double_elms->set(index, (*args)[index]->Number()); |
| 1881 | } |
| 1882 | break; |
| 1883 | } |
| 1884 | default: |
| 1885 | UNREACHABLE(); |
| 1886 | break; |
| 1887 | } |
| 1888 | |
| 1889 | array->set_elements(*elms); |
| 1890 | array->set_length(Smi::FromInt(number_of_elements)); |
| 1891 | return array; |
| 1892 | } |
| 1893 | |
Ben Murdoch | 69a99ed | 2011-11-30 16:03:39 +0000 | [diff] [blame] | 1894 | } } // namespace v8::internal |