JSArray.cpp 47.5 KB
Newer Older
darin's avatar
darin committed
1 2
/*
 *  Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
3
 *  Copyright (C) 2003, 2007, 2008, 2009 Apple Inc. All rights reserved.
darin's avatar
darin committed
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
 *  Copyright (C) 2003 Peter Kelly (pmk@post.com)
 *  Copyright (C) 2006 Alexey Proskuryakov (ap@nypop.com)
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 2 of the License, or (at your option) any later version.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 *
 */

#include "config.h"
darin@apple.com's avatar
darin@apple.com committed
24
#include "JSArray.h"
darin's avatar
darin committed
25

darin@apple.com's avatar
darin@apple.com committed
26
#include "ArrayPrototype.h"
27
#include "CachedCall.h"
28
#include "Error.h"
29
#include "Executable.h"
darin's avatar
darin committed
30
#include "PropertyNameArray.h"
ap@webkit.org's avatar
ap@webkit.org committed
31
#include <wtf/AVLTree.h>
32
#include <wtf/Assertions.h>
33
#include <wtf/OwnPtr.h>
34
#include <Operations.h>
darin's avatar
darin committed
35

36
using namespace std;
ap@webkit.org's avatar
ap@webkit.org committed
37
using namespace WTF;
bdash's avatar
bdash committed
38

39
namespace JSC {
darin's avatar
darin committed
40

ggaren@apple.com's avatar
ggaren@apple.com committed
41 42
ASSERT_CLASS_FITS_IN_CELL(JSArray);

barraclough@apple.com's avatar
barraclough@apple.com committed
43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
// Overview of JSArray
//
// Properties of JSArray objects may be stored in one of three locations:
//   * The regular JSObject property map.
//   * A storage vector.
//   * A sparse map of array entries.
//
// Properties with non-numeric identifiers, with identifiers that are not representable
// as an unsigned integer, or where the value is greater than  MAX_ARRAY_INDEX
// (specifically, this is only one property - the value 0xFFFFFFFFU as an unsigned 32-bit
// integer) are not considered array indices and will be stored in the JSObject property map.
//
// All properties with a numeric identifer, representable as an unsigned integer i,
// where (i <= MAX_ARRAY_INDEX), are an array index and will be stored in either the
// storage vector or the sparse map.  An array index i will be handled in the following
// fashion:
//
//   * Where (i < MIN_SPARSE_ARRAY_INDEX) the value will be stored in the storage vector.
//   * Where (MIN_SPARSE_ARRAY_INDEX <= i <= MAX_STORAGE_VECTOR_INDEX) the value will either
//     be stored in the storage vector or in the sparse array, depending on the density of
//     data that would be stored in the vector (a vector being used where at least
//     (1 / minDensityMultiplier) of the entries would be populated).
//   * Where (MAX_STORAGE_VECTOR_INDEX < i <= MAX_ARRAY_INDEX) the value will always be stored
//     in the sparse array.

// The definition of MAX_STORAGE_VECTOR_LENGTH is dependant on the definition storageSize
// function below - the MAX_STORAGE_VECTOR_LENGTH limit is defined such that the storage
ggaren@apple.com's avatar
ggaren@apple.com committed
70 71 72
// size calculation cannot overflow.  (sizeof(ArrayStorage) - sizeof(JSValue)) +
// (vectorLength * sizeof(JSValue)) must be <= 0xFFFFFFFFU (which is maximum value of size_t).
#define MAX_STORAGE_VECTOR_LENGTH static_cast<unsigned>((0xFFFFFFFFU - (sizeof(ArrayStorage) - sizeof(JSValue))) / sizeof(JSValue))
barraclough@apple.com's avatar
barraclough@apple.com committed
73 74 75 76 77

// These values have to be macros to be used in max() and min() without introducing
// a PIC branch in Mach-O binaries, see <rdar://problem/5971391>.
#define MIN_SPARSE_ARRAY_INDEX 10000U
#define MAX_STORAGE_VECTOR_INDEX (MAX_STORAGE_VECTOR_LENGTH - 1)
78
// 0xFFFFFFFF is a bit weird -- is not an array index even though it's an integer.
barraclough@apple.com's avatar
barraclough@apple.com committed
79
#define MAX_ARRAY_INDEX 0xFFFFFFFEU
darin's avatar
darin committed
80

81 82 83 84 85 86 87 88
// The value BASE_VECTOR_LEN is the maximum number of vector elements we'll allocate
// for an array that was created with a sepcified length (e.g. a = new Array(123))
#define BASE_VECTOR_LEN 4U
    
// The upper bound to the size we'll grow a zero length array when the first element
// is added.
#define FIRST_VECTOR_GROW 4U

darin's avatar
darin committed
89
// Our policy for when to use a vector and when to use a sparse map.
barraclough@apple.com's avatar
barraclough@apple.com committed
90 91
// For all array indices under MIN_SPARSE_ARRAY_INDEX, we always use a vector.
// When indices greater than MIN_SPARSE_ARRAY_INDEX are involved, we use a vector
darin's avatar
darin committed
92 93 94
// as long as it is 1/8 full. If more sparse than that, we use a map.
static const unsigned minDensityMultiplier = 8;

95
const ClassInfo JSArray::s_info = {"Array", &JSNonFinalObject::s_info, 0, 0, CREATE_METHOD_TABLE(JSArray)};
darin's avatar
darin committed
96

97 98 99 100 101
// We keep track of the size of the last array after it was grown.  We use this
// as a simple heuristic for as the value to grow the next array from size 0.
// This value is capped by the constant FIRST_VECTOR_GROW defined above.
static unsigned lastArraySize = 0;

darin's avatar
darin committed
102 103
static inline size_t storageSize(unsigned vectorLength)
{
barraclough@apple.com's avatar
barraclough@apple.com committed
104 105 106 107
    ASSERT(vectorLength <= MAX_STORAGE_VECTOR_LENGTH);

    // MAX_STORAGE_VECTOR_LENGTH is defined such that provided (vectorLength <= MAX_STORAGE_VECTOR_LENGTH)
    // - as asserted above - the following calculation cannot overflow.
ggaren@apple.com's avatar
ggaren@apple.com committed
108
    size_t size = (sizeof(ArrayStorage) - sizeof(JSValue)) + (vectorLength * sizeof(JSValue));
barraclough@apple.com's avatar
barraclough@apple.com committed
109 110
    // Assertion to detect integer overflow in previous calculation (should not be possible, provided that
    // MAX_STORAGE_VECTOR_LENGTH is correctly defined).
ggaren@apple.com's avatar
ggaren@apple.com committed
111
    ASSERT(((size - (sizeof(ArrayStorage) - sizeof(JSValue))) / sizeof(JSValue) == vectorLength) && (size >= (sizeof(ArrayStorage) - sizeof(JSValue))));
barraclough@apple.com's avatar
barraclough@apple.com committed
112 113

    return size;
darin's avatar
darin committed
114 115 116 117 118 119 120
}

static inline bool isDenseEnoughForVector(unsigned length, unsigned numValues)
{
    return length / minDensityMultiplier <= numValues;
}

121 122
#if !CHECK_ARRAY_CONSISTENCY

darin@apple.com's avatar
darin@apple.com committed
123
inline void JSArray::checkConsistency(ConsistencyCheckType)
124 125 126 127 128
{
}

#endif

129
JSArray::JSArray(VPtrStealingHackType)
130
    : JSNonFinalObject(VPtrStealingHack)
131 132 133
{
}

134 135
JSArray::JSArray(JSGlobalData& globalData, Structure* structure)
    : JSNonFinalObject(globalData, structure)
weinig@apple.com's avatar
weinig@apple.com committed
136
{
137 138 139 140 141
}

void JSArray::finishCreation(JSGlobalData& globalData)
{
    Base::finishCreation(globalData);
142 143
    ASSERT(inherits(&s_info));

weinig@apple.com's avatar
weinig@apple.com committed
144 145
    unsigned initialCapacity = 0;

146 147
    m_storage = static_cast<ArrayStorage*>(fastZeroedMalloc(storageSize(initialCapacity)));
    m_storage->m_allocBase = m_storage;
148
    m_indexBias = 0;
149
    m_vectorLength = initialCapacity;
weinig@apple.com's avatar
weinig@apple.com committed
150 151

    checkConsistency();
152 153

    Heap::heap(this)->reportExtraMemoryCost(storageSize(0));
weinig@apple.com's avatar
weinig@apple.com committed
154 155
}

156
void JSArray::finishCreation(JSGlobalData& globalData, unsigned initialLength, ArrayCreationMode creationMode)
darin's avatar
darin committed
157
{
158
    Base::finishCreation(globalData);
159 160
    ASSERT(inherits(&s_info));

161 162 163 164
    unsigned initialCapacity;
    if (creationMode == CreateCompact)
        initialCapacity = initialLength;
    else
165 166
        initialCapacity = min(BASE_VECTOR_LEN, MIN_SPARSE_ARRAY_INDEX);
    
167 168 169
    m_storage = static_cast<ArrayStorage*>(fastMalloc(storageSize(initialCapacity)));
    m_storage->m_allocBase = m_storage;
    m_storage->m_length = initialLength;
170
    m_indexBias = 0;
171
    m_vectorLength = initialCapacity;
172 173 174
    m_storage->m_sparseValueMap = 0;
    m_storage->subclassData = 0;
    m_storage->reportedMapCapacity = 0;
darin's avatar
darin committed
175

176 177
    if (creationMode == CreateCompact) {
#if CHECK_ARRAY_CONSISTENCY
178
        m_storage->m_inCompactInitialization = !!initialCapacity;
179
#endif
180 181
        m_storage->m_length = 0;
        m_storage->m_numValuesInVector = initialCapacity;
182 183
    } else {
#if CHECK_ARRAY_CONSISTENCY
184
        storage->m_inCompactInitialization = false;
185
#endif
186 187
        m_storage->m_length = initialLength;
        m_storage->m_numValuesInVector = 0;
188
        WriteBarrier<Unknown>* vector = m_storage->m_vector;
189
        for (size_t i = 0; i < initialCapacity; ++i)
190
            vector[i].clear();
191
    }
192

193
    checkConsistency();
194
    
195
    Heap::heap(this)->reportExtraMemoryCost(storageSize(initialCapacity));
darin's avatar
darin committed
196 197
}

198
void JSArray::finishCreation(JSGlobalData& globalData, const ArgList& list)
darin's avatar
darin committed
199
{
200
    Base::finishCreation(globalData);
201 202
    ASSERT(inherits(&s_info));

203
    unsigned initialCapacity = list.size();
204 205 206 207 208 209 210 211 212 213
    unsigned initialStorage;
    
    // If the ArgList is empty, allocate space for 3 entries.  This value empirically
    // works well for benchmarks.
    if (!initialCapacity)
        initialStorage = 3;
    else
        initialStorage = initialCapacity;
    
    m_storage = static_cast<ArrayStorage*>(fastMalloc(storageSize(initialStorage)));
214
    m_storage->m_allocBase = m_storage;
215
    m_indexBias = 0;
216
    m_storage->m_length = initialCapacity;
217
    m_vectorLength = initialStorage;
218 219 220 221
    m_storage->m_numValuesInVector = initialCapacity;
    m_storage->m_sparseValueMap = 0;
    m_storage->subclassData = 0;
    m_storage->reportedMapCapacity = 0;
222
#if CHECK_ARRAY_CONSISTENCY
223
    m_storage->m_inCompactInitialization = false;
224
#endif
darin's avatar
darin committed
225

ggaren's avatar
ggaren committed
226
    size_t i = 0;
227
    WriteBarrier<Unknown>* vector = m_storage->m_vector;
darin@apple.com's avatar
darin@apple.com committed
228 229
    ArgList::const_iterator end = list.end();
    for (ArgList::const_iterator it = list.begin(); it != end; ++it, ++i)
230
        vector[i].set(globalData, this, *it);
231
    for (; i < initialStorage; i++)
232
        vector[i].clear();
darin's avatar
darin committed
233

234
    checkConsistency();
235

236
    Heap::heap(this)->reportExtraMemoryCost(storageSize(initialStorage));
darin's avatar
darin committed
237 238
}

darin@apple.com's avatar
darin@apple.com committed
239
JSArray::~JSArray()
darin's avatar
darin committed
240
{
ap@apple.com's avatar
ap@apple.com committed
241
    ASSERT(vptr() == JSGlobalData::jsArrayVPtr);
242 243
    checkConsistency(DestructorConsistencyCheck);

244 245
    delete m_storage->m_sparseValueMap;
    fastFree(m_storage->m_allocBase);
darin's avatar
darin committed
246 247
}

248
bool JSArray::getOwnPropertySlotByIndex(JSCell* cell, ExecState* exec, unsigned i, PropertySlot& slot)
249 250 251
{
    JSArray* thisObject = static_cast<JSArray*>(cell);
    ArrayStorage* storage = thisObject->m_storage;
252
    
ggaren@apple.com's avatar
ggaren@apple.com committed
253
    if (i >= storage->m_length) {
barraclough@apple.com's avatar
barraclough@apple.com committed
254
        if (i > MAX_ARRAY_INDEX)
255
            return thisObject->methodTable()->getOwnPropertySlot(thisObject, exec, Identifier::from(exec, i), slot);
darin's avatar
darin committed
256 257 258
        return false;
    }

259
    if (i < thisObject->m_vectorLength) {
260 261 262
        JSValue value = storage->m_vector[i].get();
        if (value) {
            slot.setValue(value);
darin's avatar
darin committed
263 264 265
            return true;
        }
    } else if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
barraclough@apple.com's avatar
barraclough@apple.com committed
266
        if (i >= MIN_SPARSE_ARRAY_INDEX) {
darin@apple.com's avatar
darin@apple.com committed
267 268
            SparseArrayValueMap::iterator it = map->find(i);
            if (it != map->end()) {
269
                slot.setValue(it->second.get());
darin@apple.com's avatar
darin@apple.com committed
270 271
                return true;
            }
darin's avatar
darin committed
272 273 274
        }
    }

275
    return JSObject::getOwnPropertySlot(thisObject, exec, Identifier::from(exec, i), slot);
darin's avatar
darin committed
276 277
}

278 279 280
bool JSArray::getOwnPropertySlot(JSCell* cell, ExecState* exec, const Identifier& propertyName, PropertySlot& slot)
{
    JSArray* thisObject = static_cast<JSArray*>(cell);
darin's avatar
darin committed
281
    if (propertyName == exec->propertyNames().length) {
282
        slot.setValue(jsNumber(thisObject->length()));
darin's avatar
darin committed
283 284 285 286
        return true;
    }

    bool isArrayIndex;
287
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
darin's avatar
darin committed
288
    if (isArrayIndex)
289
        return JSArray::getOwnPropertySlotByIndex(thisObject, exec, i, slot);
darin's avatar
darin committed
290

291
    return JSObject::getOwnPropertySlot(thisObject, exec, propertyName, slot);
darin's avatar
darin committed
292 293
}

294
bool JSArray::getOwnPropertyDescriptor(JSObject* object, ExecState* exec, const Identifier& propertyName, PropertyDescriptor& descriptor)
295
{
296
    JSArray* thisObject = static_cast<JSArray*>(object);
297
    if (propertyName == exec->propertyNames().length) {
298
        descriptor.setDescriptor(jsNumber(thisObject->length()), DontDelete | DontEnum);
299 300
        return true;
    }
301

302
    ArrayStorage* storage = thisObject->m_storage;
303 304
    
    bool isArrayIndex;
305
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
306
    if (isArrayIndex) {
307
        if (i >= storage->m_length)
308
            return false;
309
        if (i < thisObject->m_vectorLength) {
310
            WriteBarrier<Unknown>& value = storage->m_vector[i];
311
            if (value) {
312
                descriptor.setDescriptor(value.get(), 0);
313 314
                return true;
            }
315
        } else if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
316 317 318
            if (i >= MIN_SPARSE_ARRAY_INDEX) {
                SparseArrayValueMap::iterator it = map->find(i);
                if (it != map->end()) {
319
                    descriptor.setDescriptor(it->second.get(), 0);
320 321 322 323 324
                    return true;
                }
            }
        }
    }
325
    return JSObject::getOwnPropertyDescriptor(thisObject, exec, propertyName, descriptor);
326 327
}

328 329 330 331
// ECMA 15.4.5.1
void JSArray::put(JSCell* cell, ExecState* exec, const Identifier& propertyName, JSValue value, PutPropertySlot& slot)
{
    JSArray* thisObject = static_cast<JSArray*>(cell);
darin's avatar
darin committed
332
    bool isArrayIndex;
333
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
darin's avatar
darin committed
334
    if (isArrayIndex) {
335
        putByIndex(thisObject, exec, i, value);
darin's avatar
darin committed
336 337 338 339
        return;
    }

    if (propertyName == exec->propertyNames().length) {
weinig@apple.com's avatar
weinig@apple.com committed
340 341
        unsigned newLength = value.toUInt32(exec);
        if (value.toNumber(exec) != static_cast<double>(newLength)) {
342
            throwError(exec, createRangeError(exec, "Invalid array length"));
darin's avatar
darin committed
343 344
            return;
        }
345
        thisObject->setLength(newLength);
darin's avatar
darin committed
346 347 348
        return;
    }

349
    JSObject::put(thisObject, exec, propertyName, value, slot);
darin's avatar
darin committed
350 351
}

352
void JSArray::putByIndex(JSCell* cell, ExecState* exec, unsigned i, JSValue value)
353 354 355 356 357
{
    JSArray* thisObject = static_cast<JSArray*>(cell);
    thisObject->checkConsistency();

    ArrayStorage* storage = thisObject->m_storage;
358 359

    unsigned length = storage->m_length;
barraclough@apple.com's avatar
barraclough@apple.com committed
360
    if (i >= length && i <= MAX_ARRAY_INDEX) {
darin's avatar
darin committed
361
        length = i + 1;
362
        storage->m_length = length;
darin's avatar
darin committed
363 364
    }

365
    if (i < thisObject->m_vectorLength) {
366
        WriteBarrier<Unknown>& valueSlot = storage->m_vector[i];
367
        if (valueSlot) {
368 369
            valueSlot.set(exec->globalData(), thisObject, value);
            thisObject->checkConsistency();
370 371
            return;
        }
372
        valueSlot.set(exec->globalData(), thisObject, value);
373
        ++storage->m_numValuesInVector;
374
        thisObject->checkConsistency();
darin's avatar
darin committed
375 376 377
        return;
    }

378
    thisObject->putSlowCase(exec, i, value);
379 380
}

ggaren@apple.com's avatar
ggaren@apple.com committed
381
NEVER_INLINE void JSArray::putSlowCase(ExecState* exec, unsigned i, JSValue value)
382
{
383
    ArrayStorage* storage = m_storage;
384
    
darin's avatar
darin committed
385
    SparseArrayValueMap* map = storage->m_sparseValueMap;
ap@webkit.org's avatar
ap@webkit.org committed
386

barraclough@apple.com's avatar
barraclough@apple.com committed
387 388
    if (i >= MIN_SPARSE_ARRAY_INDEX) {
        if (i > MAX_ARRAY_INDEX) {
weinig@apple.com's avatar
weinig@apple.com committed
389
            PutPropertySlot slot;
mhahnenberg@apple.com's avatar
mhahnenberg@apple.com committed
390
            methodTable()->put(this, exec, Identifier::from(exec, i), value, slot);
391 392 393
            return;
        }

ap@webkit.org's avatar
ap@webkit.org committed
394
        // We miss some cases where we could compact the storage, such as a large array that is being filled from the end
395
        // (which will only be compacted as we reach indices that are less than MIN_SPARSE_ARRAY_INDEX) - but this makes the check much faster.
barraclough@apple.com's avatar
barraclough@apple.com committed
396
        if ((i > MAX_STORAGE_VECTOR_INDEX) || !isDenseEnoughForVector(i + 1, storage->m_numValuesInVector + 1)) {
ap@webkit.org's avatar
ap@webkit.org committed
397 398 399 400
            if (!map) {
                map = new SparseArrayValueMap;
                storage->m_sparseValueMap = map;
            }
401

402 403 404 405
            WriteBarrier<Unknown> temp;
            pair<SparseArrayValueMap::iterator, bool> result = map->add(i, temp);
            result.first->second.set(exec->globalData(), this, value);
            if (!result.second) // pre-existing entry
406 407 408 409 410 411 412
                return;

            size_t capacity = map->capacity();
            if (capacity != storage->reportedMapCapacity) {
                Heap::heap(this)->reportExtraMemoryCost((capacity - storage->reportedMapCapacity) * (sizeof(unsigned) + sizeof(JSValue)));
                storage->reportedMapCapacity = capacity;
            }
darin's avatar
darin committed
413 414 415 416
            return;
        }
    }

ap@webkit.org's avatar
ap@webkit.org committed
417 418 419
    // We have decided that we'll put the new item into the vector.
    // Fast case is when there is no sparse map, so we can increase the vector size without moving values from it.
    if (!map || map->isEmpty()) {
barraclough@apple.com's avatar
barraclough@apple.com committed
420
        if (increaseVectorLength(i + 1)) {
421
            storage = m_storage;
422
            storage->m_vector[i].set(exec->globalData(), this, value);
423
            ++storage->m_numValuesInVector;
barraclough@apple.com's avatar
barraclough@apple.com committed
424 425 426
            checkConsistency();
        } else
            throwOutOfMemoryError(exec);
darin's avatar
darin committed
427 428 429
        return;
    }

ap@webkit.org's avatar
ap@webkit.org committed
430 431
    // Decide how many values it would be best to move from the map.
    unsigned newNumValuesInVector = storage->m_numValuesInVector + 1;
432
    unsigned newVectorLength = getNewVectorLength(i + 1);
433
    for (unsigned j = max(m_vectorLength, MIN_SPARSE_ARRAY_INDEX); j < newVectorLength; ++j)
darin's avatar
darin committed
434
        newNumValuesInVector += map->contains(j);
barraclough@apple.com's avatar
barraclough@apple.com committed
435
    if (i >= MIN_SPARSE_ARRAY_INDEX)
ap@webkit.org's avatar
ap@webkit.org committed
436
        newNumValuesInVector -= map->contains(i);
darin's avatar
darin committed
437
    if (isDenseEnoughForVector(newVectorLength, newNumValuesInVector)) {
438
        unsigned needLength = max(i + 1, storage->m_length);
darin's avatar
darin committed
439
        unsigned proposedNewNumValuesInVector = newNumValuesInVector;
barraclough@apple.com's avatar
barraclough@apple.com committed
440
        // If newVectorLength is already the maximum - MAX_STORAGE_VECTOR_LENGTH - then do not attempt to grow any further.
441
        while ((newVectorLength < needLength) && (newVectorLength < MAX_STORAGE_VECTOR_LENGTH)) {
442
            unsigned proposedNewVectorLength = getNewVectorLength(newVectorLength + 1);
barraclough@apple.com's avatar
barraclough@apple.com committed
443
            for (unsigned j = max(newVectorLength, MIN_SPARSE_ARRAY_INDEX); j < proposedNewVectorLength; ++j)
darin's avatar
darin committed
444 445 446 447 448 449 450 451
                proposedNewNumValuesInVector += map->contains(j);
            if (!isDenseEnoughForVector(proposedNewVectorLength, proposedNewNumValuesInVector))
                break;
            newVectorLength = proposedNewVectorLength;
            newNumValuesInVector = proposedNewNumValuesInVector;
        }
    }

452
    void* baseStorage = storage->m_allocBase;
453 454
    
    if (!tryFastRealloc(baseStorage, storageSize(newVectorLength + m_indexBias)).getValue(baseStorage)) {
barraclough@apple.com's avatar
barraclough@apple.com committed
455 456 457
        throwOutOfMemoryError(exec);
        return;
    }
darin's avatar
darin committed
458

459
    m_storage = reinterpret_cast_ptr<ArrayStorage*>(static_cast<char*>(baseStorage) + m_indexBias * sizeof(JSValue));
460 461
    m_storage->m_allocBase = baseStorage;
    storage = m_storage;
462
    
463
    unsigned vectorLength = m_vectorLength;
464
    WriteBarrier<Unknown>* vector = storage->m_vector;
465

darin's avatar
darin committed
466 467
    if (newNumValuesInVector == storage->m_numValuesInVector + 1) {
        for (unsigned j = vectorLength; j < newVectorLength; ++j)
468
            vector[j].clear();
barraclough@apple.com's avatar
barraclough@apple.com committed
469
        if (i > MIN_SPARSE_ARRAY_INDEX)
ap@webkit.org's avatar
ap@webkit.org committed
470
            map->remove(i);
darin's avatar
darin committed
471
    } else {
barraclough@apple.com's avatar
barraclough@apple.com committed
472
        for (unsigned j = vectorLength; j < max(vectorLength, MIN_SPARSE_ARRAY_INDEX); ++j)
473 474
            vector[j].clear();
        JSGlobalData& globalData = exec->globalData();
barraclough@apple.com's avatar
barraclough@apple.com committed
475
        for (unsigned j = max(vectorLength, MIN_SPARSE_ARRAY_INDEX); j < newVectorLength; ++j)
476
            vector[j].set(globalData, this, map->take(j).get());
darin's avatar
darin committed
477 478
    }

479
    ASSERT(i < newVectorLength);
darin's avatar
darin committed
480

481
    m_vectorLength = newVectorLength;
darin's avatar
darin committed
482
    storage->m_numValuesInVector = newNumValuesInVector;
ap@webkit.org's avatar
ap@webkit.org committed
483

484
    storage->m_vector[i].set(exec->globalData(), this, value);
485 486

    checkConsistency();
487 488

    Heap::heap(this)->reportExtraMemoryCost(storageSize(newVectorLength) - storageSize(vectorLength));
darin's avatar
darin committed
489 490
}

491 492 493
bool JSArray::deleteProperty(JSCell* cell, ExecState* exec, const Identifier& propertyName)
{
    JSArray* thisObject = static_cast<JSArray*>(cell);
darin's avatar
darin committed
494
    bool isArrayIndex;
495
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
darin's avatar
darin committed
496
    if (isArrayIndex)
497
        return thisObject->methodTable()->deletePropertyByIndex(thisObject, exec, i);
darin's avatar
darin committed
498 499 500 501

    if (propertyName == exec->propertyNames().length)
        return false;

502
    return JSObject::deleteProperty(thisObject, exec, propertyName);
darin's avatar
darin committed
503 504
}

505
bool JSArray::deletePropertyByIndex(JSCell* cell, ExecState* exec, unsigned i)
506 507 508 509 510
{
    JSArray* thisObject = static_cast<JSArray*>(cell);
    thisObject->checkConsistency();

    ArrayStorage* storage = thisObject->m_storage;
511
    
512
    if (i < thisObject->m_vectorLength) {
513
        WriteBarrier<Unknown>& valueSlot = storage->m_vector[i];
514
        if (!valueSlot) {
515
            thisObject->checkConsistency();
516 517
            return false;
        }
518
        valueSlot.clear();
519
        --storage->m_numValuesInVector;
520
        thisObject->checkConsistency();
521
        return true;
darin's avatar
darin committed
522 523 524
    }

    if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
barraclough@apple.com's avatar
barraclough@apple.com committed
525
        if (i >= MIN_SPARSE_ARRAY_INDEX) {
darin@apple.com's avatar
darin@apple.com committed
526 527 528
            SparseArrayValueMap::iterator it = map->find(i);
            if (it != map->end()) {
                map->remove(it);
529
                thisObject->checkConsistency();
darin@apple.com's avatar
darin@apple.com committed
530 531
                return true;
            }
darin's avatar
darin committed
532 533 534
        }
    }

535
    thisObject->checkConsistency();
536

barraclough@apple.com's avatar
barraclough@apple.com committed
537
    if (i > MAX_ARRAY_INDEX)
538
        return thisObject->methodTable()->deleteProperty(thisObject, exec, Identifier::from(exec, i));
darin's avatar
darin committed
539 540 541 542

    return false;
}

543
void JSArray::getOwnPropertyNames(JSObject* object, ExecState* exec, PropertyNameArray& propertyNames, EnumerationMode mode)
darin's avatar
darin committed
544
{
545
    JSArray* thisObject = static_cast<JSArray*>(object);
darin's avatar
darin committed
546
    // FIXME: Filling PropertyNameArray with an identifier for every integer
547 548
    // is incredibly inefficient for large arrays. We need a different approach,
    // which almost certainly means a different structure for PropertyNameArray.
darin's avatar
darin committed
549

550
    ArrayStorage* storage = thisObject->m_storage;
551
    
552
    unsigned usedVectorLength = min(storage->m_length, thisObject->m_vectorLength);
darin's avatar
darin committed
553
    for (unsigned i = 0; i < usedVectorLength; ++i) {
554
        if (storage->m_vector[i])
ap@webkit.org's avatar
ap@webkit.org committed
555
            propertyNames.add(Identifier::from(exec, i));
darin's avatar
darin committed
556 557 558 559 560
    }

    if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
        SparseArrayValueMap::iterator end = map->end();
        for (SparseArrayValueMap::iterator it = map->begin(); it != end; ++it)
ap@webkit.org's avatar
ap@webkit.org committed
561
            propertyNames.add(Identifier::from(exec, it->first));
darin's avatar
darin committed
562
    }
563

564 565 566
    if (mode == IncludeDontEnumProperties)
        propertyNames.add(exec->propertyNames().length);

567
    JSObject::getOwnPropertyNames(thisObject, exec, propertyNames, mode);
darin's avatar
darin committed
568 569
}

570 571 572 573 574
ALWAYS_INLINE unsigned JSArray::getNewVectorLength(unsigned desiredLength)
{
    ASSERT(desiredLength <= MAX_STORAGE_VECTOR_LENGTH);

    unsigned increasedLength;
575
    unsigned maxInitLength = min(m_storage->m_length, 100000U);
576

577 578
    if (desiredLength < maxInitLength)
        increasedLength = maxInitLength;
579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596
    else if (!m_vectorLength)
        increasedLength = max(desiredLength, lastArraySize);
    else {
        // Mathematically equivalent to:
        //   increasedLength = (newLength * 3 + 1) / 2;
        // or:
        //   increasedLength = (unsigned)ceil(newLength * 1.5));
        // This form is not prone to internal overflow.
        increasedLength = desiredLength + (desiredLength >> 1) + (desiredLength & 1);
    }

    ASSERT(increasedLength >= desiredLength);

    lastArraySize = min(increasedLength, FIRST_VECTOR_GROW);

    return min(increasedLength, MAX_STORAGE_VECTOR_LENGTH);
}

darin@apple.com's avatar
darin@apple.com committed
597
bool JSArray::increaseVectorLength(unsigned newLength)
darin's avatar
darin committed
598
{
ap@webkit.org's avatar
ap@webkit.org committed
599 600 601
    // This function leaves the array in an internally inconsistent state, because it does not move any values from sparse value map
    // to the vector. Callers have to account for that, because they can do it more efficiently.

602
    ArrayStorage* storage = m_storage;
darin's avatar
darin committed
603

604
    unsigned vectorLength = m_vectorLength;
darin's avatar
darin committed
605
    ASSERT(newLength > vectorLength);
barraclough@apple.com's avatar
barraclough@apple.com committed
606
    ASSERT(newLength <= MAX_STORAGE_VECTOR_INDEX);
607
    unsigned newVectorLength = getNewVectorLength(newLength);
608
    void* baseStorage = storage->m_allocBase;
darin's avatar
darin committed
609

610
    if (!tryFastRealloc(baseStorage, storageSize(newVectorLength + m_indexBias)).getValue(baseStorage))
ap@webkit.org's avatar
ap@webkit.org committed
611
        return false;
612

613
    storage = m_storage = reinterpret_cast_ptr<ArrayStorage*>(static_cast<char*>(baseStorage) + m_indexBias * sizeof(JSValue));
614
    m_storage->m_allocBase = baseStorage;
615

616
    WriteBarrier<Unknown>* vector = storage->m_vector;
617
    for (unsigned i = vectorLength; i < newVectorLength; ++i)
618
        vector[i].clear();
ap@webkit.org's avatar
ap@webkit.org committed
619

620
    m_vectorLength = newVectorLength;
621 622
    
    Heap::heap(this)->reportExtraMemoryCost(storageSize(newVectorLength) - storageSize(vectorLength));
darin's avatar
darin committed
623

624 625
    return true;
}
darin's avatar
darin committed
626

627 628 629 630 631
bool JSArray::increaseVectorPrefixLength(unsigned newLength)
{
    // This function leaves the array in an internally inconsistent state, because it does not move any values from sparse value map
    // to the vector. Callers have to account for that, because they can do it more efficiently.
    
632
    ArrayStorage* storage = m_storage;
633 634 635 636 637
    
    unsigned vectorLength = m_vectorLength;
    ASSERT(newLength > vectorLength);
    ASSERT(newLength <= MAX_STORAGE_VECTOR_INDEX);
    unsigned newVectorLength = getNewVectorLength(newLength);
638 639

    void* newBaseStorage = fastMalloc(storageSize(newVectorLength + m_indexBias));
640 641 642 643 644
    if (!newBaseStorage)
        return false;
    
    m_indexBias += newVectorLength - newLength;
    
645
    m_storage = reinterpret_cast_ptr<ArrayStorage*>(static_cast<char*>(newBaseStorage) + m_indexBias * sizeof(JSValue));
646

647 648
    memcpy(m_storage, storage, storageSize(0));
    memcpy(&m_storage->m_vector[newLength - m_vectorLength], &storage->m_vector[0], vectorLength * sizeof(JSValue));
649
    
650
    m_storage->m_allocBase = newBaseStorage;
651 652
    m_vectorLength = newLength;
    
653
    fastFree(storage->m_allocBase);
654 655 656 657
    ASSERT(newLength > vectorLength);
    unsigned delta = newLength - vectorLength;
    for (unsigned i = 0; i < delta; i++)
        m_storage->m_vector[i].clear();
658
    Heap::heap(this)->reportExtraMemoryCost(storageSize(newVectorLength) - storageSize(vectorLength));
659
    
ap@webkit.org's avatar
ap@webkit.org committed
660
    return true;
darin's avatar
darin committed
661
}
662
    
darin's avatar
darin committed
663

darin@apple.com's avatar
darin@apple.com committed
664
void JSArray::setLength(unsigned newLength)
darin's avatar
darin committed
665
{
666 667
    ArrayStorage* storage = m_storage;
    
668
#if CHECK_ARRAY_CONSISTENCY
669
    if (!storage->m_inCompactInitialization)
670 671
        checkConsistency();
    else
672
        storage->m_inCompactInitialization = false;
673
#endif
674

675
    unsigned length = storage->m_length;
darin's avatar
darin committed
676 677

    if (newLength < length) {
678
        unsigned usedVectorLength = min(length, m_vectorLength);
darin's avatar
darin committed
679
        for (unsigned i = newLength; i < usedVectorLength; ++i) {
680
            WriteBarrier<Unknown>& valueSlot = storage->m_vector[i];
darin's avatar
darin committed
681
            bool hadValue = valueSlot;
682
            valueSlot.clear();
darin's avatar
darin committed
683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698
            storage->m_numValuesInVector -= hadValue;
        }

        if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
            SparseArrayValueMap copy = *map;
            SparseArrayValueMap::iterator end = copy.end();
            for (SparseArrayValueMap::iterator it = copy.begin(); it != end; ++it) {
                if (it->first >= newLength)
                    map->remove(it->first);
            }
            if (map->isEmpty()) {
                delete map;
                storage->m_sparseValueMap = 0;
            }
        }
    }
aroben@apple.com's avatar
aroben@apple.com committed
699

700
    storage->m_length = newLength;
701 702

    checkConsistency();
darin's avatar
darin committed
703 704
}

ggaren@apple.com's avatar
ggaren@apple.com committed
705
JSValue JSArray::pop()
706 707 708
{
    checkConsistency();

709
    ArrayStorage* storage = m_storage;
710 711
    
    unsigned length = storage->m_length;
712 713 714 715 716
    if (!length)
        return jsUndefined();

    --length;

ggaren@apple.com's avatar
ggaren@apple.com committed
717
    JSValue result;
718

719
    if (length < m_vectorLength) {
720
        WriteBarrier<Unknown>& valueSlot = storage->m_vector[length];
721
        if (valueSlot) {
722
            --storage->m_numValuesInVector;
723 724
            result = valueSlot.get();
            valueSlot.clear();
725
        } else
726 727 728
            result = jsUndefined();
    } else {
        result = jsUndefined();
729
        if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
730 731
            SparseArrayValueMap::iterator it = map->find(length);
            if (it != map->end()) {
732
                result = it->second.get();
733 734 735
                map->remove(it);
                if (map->isEmpty()) {
                    delete map;
736
                    storage->m_sparseValueMap = 0;
737 738 739 740 741
                }
            }
        }
    }

742
    storage->m_length = length;
743 744 745 746 747 748

    checkConsistency();

    return result;
}

ggaren@apple.com's avatar
ggaren@apple.com committed
749
void JSArray::push(ExecState* exec, JSValue value)
750 751
{
    checkConsistency();
752
    
753
    ArrayStorage* storage = m_storage;
754

755
    if (UNLIKELY(storage->m_length == 0xFFFFFFFFu)) {
mhahnenberg@apple.com's avatar
mhahnenberg@apple.com committed
756
        methodTable()->putByIndex(this, exec, storage->m_length, value);
757 758 759 760
        throwError(exec, createRangeError(exec, "Invalid array length"));
        return;
    }

761
    if (storage->m_length < m_vectorLength) {
762
        storage->m_vector[storage->m_length].set(exec->globalData(), this, value);
763 764
        ++storage->m_numValuesInVector;
        ++storage->m_length;
765 766 767 768
        checkConsistency();
        return;
    }

769 770
    if (storage->m_length < MIN_SPARSE_ARRAY_INDEX) {
        SparseArrayValueMap* map = storage->m_sparseValueMap;
771
        if (!map || map->isEmpty()) {
772
            if (increaseVectorLength(storage->m_length + 1)) {
773
                storage = m_storage;
774
                storage->m_vector[storage->m_length].set(exec->globalData(), this, value);
775 776
                ++storage->m_numValuesInVector;
                ++storage->m_length;
777 778 779 780 781 782 783 784 785
                checkConsistency();
                return;
            }
            checkConsistency();
            throwOutOfMemoryError(exec);
            return;
        }
    }

786 787 788 789 790 791 792
    putSlowCase(exec, storage->m_length++, value);
}

void JSArray::shiftCount(ExecState* exec, int count)
{
    ASSERT(count > 0);
    
793
    ArrayStorage* storage = m_storage;
794 795 796 797 798 799 800 801 802 803 804 805
    
    unsigned oldLength = storage->m_length;
    
    if (!oldLength)
        return;
    
    if (oldLength != storage->m_numValuesInVector) {
        // If m_length and m_numValuesInVector aren't the same, we have a sparse vector
        // which means we need to go through each entry looking for the the "empty"
        // slots and then fill them with possible properties.  See ECMA spec.
        // 15.4.4.9 steps 11 through 13.
        for (unsigned i = count; i < oldLength; ++i) {
806
            if ((i >= m_vectorLength) || (!m_storage->m_vector[i])) {
807 808 809
                PropertySlot slot(this);
                JSValue p = prototype();
                if ((!p.isNull()) && (asObject(p)->getPropertySlot(exec, i, slot)))
mhahnenberg@apple.com's avatar
mhahnenberg@apple.com committed
810
                    methodTable()->putByIndex(this, exec, i, slot.getValue(exec, i));
811 812 813
            }
        }

814
        storage = m_storage; // The put() above could have grown the vector and realloc'ed storage.
815 816 817

        // Need to decrement numValuesInvector based on number of real entries
        for (unsigned i = 0; i < (unsigned)count; ++i)
818
            if ((i < m_vectorLength) && (storage->m_vector[i]))
819 820 821 822 823 824 825 826 827 828 829 830 831 832
                --storage->m_numValuesInVector;
    } else
        storage->m_numValuesInVector -= count;
    
    storage->m_length -= count;
    
    if (m_vectorLength) {
        count = min(m_vectorLength, (unsigned)count);
        
        m_vectorLength -= count;
        
        if (m_vectorLength) {
            char* newBaseStorage = reinterpret_cast<char*>(storage) + count * sizeof(JSValue);
            memmove(newBaseStorage, storage, storageSize(0));
833
            m_storage = reinterpret_cast_ptr<ArrayStorage*>(newBaseStorage);
834 835 836 837 838 839 840 841

            m_indexBias += count;
        }
    }
}
    
void JSArray::unshiftCount(ExecState* exec, int count)
{
842
    ArrayStorage* storage = m_storage;
843 844 845 846 847 848 849 850 851 852 853 854

    ASSERT(m_indexBias >= 0);
    ASSERT(count >= 0);
    
    unsigned length = storage->m_length;
    
    if (length != storage->m_numValuesInVector) {
        // If m_length and m_numValuesInVector aren't the same, we have a sparse vector
        // which means we need to go through each entry looking for the the "empty"
        // slots and then fill them with possible properties.  See ECMA spec.
        // 15.4.4.13 steps 8 through 10.
        for (unsigned i = 0; i < length; ++i) {
855
            if ((i >= m_vectorLength) || (!m_storage->m_vector[i])) {
856 857 858
                PropertySlot slot(this);
                JSValue p = prototype();
                if ((!p.isNull()) && (asObject(p)->getPropertySlot(exec, i, slot)))
mhahnenberg@apple.com's avatar
mhahnenberg@apple.com committed
859
                    methodTable()->putByIndex(this, exec, i, slot.getValue(exec, i));
860 861 862 863
            }
        }
    }
    
864
    storage = m_storage; // The put() above could have grown the vector and realloc'ed storage.
865 866 867 868 869
    
    if (m_indexBias >= count) {
        m_indexBias -= count;
        char* newBaseStorage = reinterpret_cast<char*>(storage) - count * sizeof(JSValue);
        memmove(newBaseStorage, storage, storageSize(0));
870
        m_storage = reinterpret_cast_ptr<ArrayStorage*>(newBaseStorage);
871
        m_vectorLength += count;
872
    } else if (!increaseVectorPrefixLength(m_vectorLength + count)) {
873 874 875
        throwOutOfMemoryError(exec);
        return;
    }