JSArray.cpp 45.7 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};
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(Structure::create(Structure::VPtrStealingHack, &s_info))
131
{
132 133 134 135 136 137 138 139 140 141 142 143 144 145
    ASSERT(inherits(&s_info));

    unsigned initialCapacity = 0;

    m_storage = static_cast<ArrayStorage*>(fastZeroedMalloc(storageSize(initialCapacity)));
    m_storage->m_allocBase = m_storage;
    m_indexBias = 0;
    m_vectorLength = initialCapacity;

    checkConsistency();
    
    // It's not safe to call Heap::heap(this) in order to report extra memory
    // cost here, because the VPtrStealingHackType JSArray is not allocated on
    // the heap. For the same reason, it's OK not to report extra cost.
146 147
}

148 149
JSArray::JSArray(NonNullPassRefPtr<Structure> structure)
    : JSNonFinalObject(structure)
weinig@apple.com's avatar
weinig@apple.com committed
150
{
151 152
    ASSERT(inherits(&s_info));

weinig@apple.com's avatar
weinig@apple.com committed
153 154
    unsigned initialCapacity = 0;

155 156
    m_storage = static_cast<ArrayStorage*>(fastZeroedMalloc(storageSize(initialCapacity)));
    m_storage->m_allocBase = m_storage;
157
    m_indexBias = 0;
158
    m_vectorLength = initialCapacity;
weinig@apple.com's avatar
weinig@apple.com committed
159 160

    checkConsistency();
161 162

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

165 166
JSArray::JSArray(NonNullPassRefPtr<Structure> structure, unsigned initialLength, ArrayCreationMode creationMode)
    : JSNonFinalObject(structure)
darin's avatar
darin committed
167
{
168 169
    ASSERT(inherits(&s_info));

170 171 172 173
    unsigned initialCapacity;
    if (creationMode == CreateCompact)
        initialCapacity = initialLength;
    else
174 175
        initialCapacity = min(BASE_VECTOR_LEN, MIN_SPARSE_ARRAY_INDEX);
    
176 177 178
    m_storage = static_cast<ArrayStorage*>(fastMalloc(storageSize(initialCapacity)));
    m_storage->m_allocBase = m_storage;
    m_storage->m_length = initialLength;
179
    m_indexBias = 0;
180
    m_vectorLength = initialCapacity;
181 182 183
    m_storage->m_sparseValueMap = 0;
    m_storage->subclassData = 0;
    m_storage->reportedMapCapacity = 0;
darin's avatar
darin committed
184

185 186
    if (creationMode == CreateCompact) {
#if CHECK_ARRAY_CONSISTENCY
187
        m_storage->m_inCompactInitialization = !!initialCapacity;
188
#endif
189 190
        m_storage->m_length = 0;
        m_storage->m_numValuesInVector = initialCapacity;
191 192
    } else {
#if CHECK_ARRAY_CONSISTENCY
193
        storage->m_inCompactInitialization = false;
194
#endif
195 196
        m_storage->m_length = initialLength;
        m_storage->m_numValuesInVector = 0;
197
        WriteBarrier<Unknown>* vector = m_storage->m_vector;
198
        for (size_t i = 0; i < initialCapacity; ++i)
199
            vector[i].clear();
200
    }
201

202
    checkConsistency();
203
    
204
    Heap::heap(this)->reportExtraMemoryCost(storageSize(initialCapacity));
darin's avatar
darin committed
205 206
}

207 208
JSArray::JSArray(JSGlobalData& globalData, NonNullPassRefPtr<Structure> structure, const ArgList& list)
    : JSNonFinalObject(structure)
darin's avatar
darin committed
209
{
210 211
    ASSERT(inherits(&s_info));

212
    unsigned initialCapacity = list.size();
213 214 215 216 217 218 219 220 221 222
    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)));
223
    m_storage->m_allocBase = m_storage;
224
    m_indexBias = 0;
225
    m_storage->m_length = initialCapacity;
226
    m_vectorLength = initialStorage;
227 228 229 230
    m_storage->m_numValuesInVector = initialCapacity;
    m_storage->m_sparseValueMap = 0;
    m_storage->subclassData = 0;
    m_storage->reportedMapCapacity = 0;
231
#if CHECK_ARRAY_CONSISTENCY
232
    m_storage->m_inCompactInitialization = false;
233
#endif
darin's avatar
darin committed
234

ggaren's avatar
ggaren committed
235
    size_t i = 0;
236
    WriteBarrier<Unknown>* vector = m_storage->m_vector;
darin@apple.com's avatar
darin@apple.com committed
237 238
    ArgList::const_iterator end = list.end();
    for (ArgList::const_iterator it = list.begin(); it != end; ++it, ++i)
239
        vector[i].set(globalData, this, *it);
240
    for (; i < initialStorage; i++)
241
        vector[i].clear();
darin's avatar
darin committed
242

243
    checkConsistency();
244

245
    Heap::heap(this)->reportExtraMemoryCost(storageSize(initialStorage));
darin's avatar
darin committed
246 247
}

darin@apple.com's avatar
darin@apple.com committed
248
JSArray::~JSArray()
darin's avatar
darin committed
249
{
ap@apple.com's avatar
ap@apple.com committed
250
    ASSERT(vptr() == JSGlobalData::jsArrayVPtr);
251 252
    checkConsistency(DestructorConsistencyCheck);

253 254
    delete m_storage->m_sparseValueMap;
    fastFree(m_storage->m_allocBase);
darin's avatar
darin committed
255 256
}

257
bool JSArray::getOwnPropertySlot(ExecState* exec, unsigned i, PropertySlot& slot)
darin's avatar
darin committed
258
{
259
    ArrayStorage* storage = m_storage;
260
    
ggaren@apple.com's avatar
ggaren@apple.com committed
261
    if (i >= storage->m_length) {
barraclough@apple.com's avatar
barraclough@apple.com committed
262
        if (i > MAX_ARRAY_INDEX)
ap@webkit.org's avatar
ap@webkit.org committed
263
            return getOwnPropertySlot(exec, Identifier::from(exec, i), slot);
darin's avatar
darin committed
264 265 266
        return false;
    }

267
    if (i < m_vectorLength) {
268 269 270
        JSValue value = storage->m_vector[i].get();
        if (value) {
            slot.setValue(value);
darin's avatar
darin committed
271 272 273
            return true;
        }
    } else if (SparseArrayValueMap* map = storage->m_sparseValueMap) {
barraclough@apple.com's avatar
barraclough@apple.com committed
274
        if (i >= MIN_SPARSE_ARRAY_INDEX) {
darin@apple.com's avatar
darin@apple.com committed
275 276
            SparseArrayValueMap::iterator it = map->find(i);
            if (it != map->end()) {
277
                slot.setValue(it->second.get());
darin@apple.com's avatar
darin@apple.com committed
278 279
                return true;
            }
darin's avatar
darin committed
280 281 282
        }
    }

283
    return JSObject::getOwnPropertySlot(exec, Identifier::from(exec, i), slot);
darin's avatar
darin committed
284 285
}

darin@apple.com's avatar
darin@apple.com committed
286
bool JSArray::getOwnPropertySlot(ExecState* exec, const Identifier& propertyName, PropertySlot& slot)
darin's avatar
darin committed
287 288
{
    if (propertyName == exec->propertyNames().length) {
289
        slot.setValue(jsNumber(length()));
darin's avatar
darin committed
290 291 292 293
        return true;
    }

    bool isArrayIndex;
294
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
darin's avatar
darin committed
295
    if (isArrayIndex)
296
        return JSArray::getOwnPropertySlot(exec, i, slot);
darin's avatar
darin committed
297 298 299 300

    return JSObject::getOwnPropertySlot(exec, propertyName, slot);
}

301 302 303
bool JSArray::getOwnPropertyDescriptor(ExecState* exec, const Identifier& propertyName, PropertyDescriptor& descriptor)
{
    if (propertyName == exec->propertyNames().length) {
304
        descriptor.setDescriptor(jsNumber(length()), DontDelete | DontEnum);
305 306
        return true;
    }
307

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

darin's avatar
darin committed
334
// ECMA 15.4.5.1
ggaren@apple.com's avatar
ggaren@apple.com committed
335
void JSArray::put(ExecState* exec, const Identifier& propertyName, JSValue value, PutPropertySlot& slot)
darin's avatar
darin committed
336 337
{
    bool isArrayIndex;
338
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
darin's avatar
darin committed
339
    if (isArrayIndex) {
darin@apple.com's avatar
darin@apple.com committed
340
        put(exec, i, value);
darin's avatar
darin committed
341 342 343 344
        return;
    }

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

weinig@apple.com's avatar
weinig@apple.com committed
354
    JSObject::put(exec, propertyName, value, slot);
darin's avatar
darin committed
355 356
}

ggaren@apple.com's avatar
ggaren@apple.com committed
357
void JSArray::put(ExecState* exec, unsigned i, JSValue value)
darin's avatar
darin committed
358
{
359 360
    checkConsistency();

361
    ArrayStorage* storage = m_storage;
362 363

    unsigned length = storage->m_length;
barraclough@apple.com's avatar
barraclough@apple.com committed
364
    if (i >= length && i <= MAX_ARRAY_INDEX) {
darin's avatar
darin committed
365
        length = i + 1;
366
        storage->m_length = length;
darin's avatar
darin committed
367 368
    }

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

382 383 384
    putSlowCase(exec, i, value);
}

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

barraclough@apple.com's avatar
barraclough@apple.com committed
391 392
    if (i >= MIN_SPARSE_ARRAY_INDEX) {
        if (i > MAX_ARRAY_INDEX) {
weinig@apple.com's avatar
weinig@apple.com committed
393 394
            PutPropertySlot slot;
            put(exec, Identifier::from(exec, i), value, slot);
395 396 397
            return;
        }

ap@webkit.org's avatar
ap@webkit.org committed
398
        // We miss some cases where we could compact the storage, such as a large array that is being filled from the end
399
        // (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
400
        if ((i > MAX_STORAGE_VECTOR_INDEX) || !isDenseEnoughForVector(i + 1, storage->m_numValuesInVector + 1)) {
ap@webkit.org's avatar
ap@webkit.org committed
401 402 403 404
            if (!map) {
                map = new SparseArrayValueMap;
                storage->m_sparseValueMap = map;
            }
405

406 407 408 409
            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
410 411 412 413 414 415 416
                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
417 418 419 420
            return;
        }
    }

ap@webkit.org's avatar
ap@webkit.org committed
421 422 423
    // 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
424
        if (increaseVectorLength(i + 1)) {
425
            storage = m_storage;
426
            storage->m_vector[i].set(exec->globalData(), this, value);
427
            ++storage->m_numValuesInVector;
barraclough@apple.com's avatar
barraclough@apple.com committed
428 429 430
            checkConsistency();
        } else
            throwOutOfMemoryError(exec);
darin's avatar
darin committed
431 432 433
        return;
    }

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

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

463
    m_storage = reinterpret_cast_ptr<ArrayStorage*>(static_cast<char*>(baseStorage) + m_indexBias * sizeof(JSValue));
464 465
    m_storage->m_allocBase = baseStorage;
    storage = m_storage;
466
    
467
    unsigned vectorLength = m_vectorLength;
468
    WriteBarrier<Unknown>* vector = storage->m_vector;
469

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

483
    ASSERT(i < newVectorLength);
darin's avatar
darin committed
484

485
    m_vectorLength = newVectorLength;
darin's avatar
darin committed
486
    storage->m_numValuesInVector = newNumValuesInVector;
ap@webkit.org's avatar
ap@webkit.org committed
487

488
    storage->m_vector[i].set(exec->globalData(), this, value);
489 490

    checkConsistency();
491 492

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

darin@apple.com's avatar
darin@apple.com committed
495
bool JSArray::deleteProperty(ExecState* exec, const Identifier& propertyName)
darin's avatar
darin committed
496 497
{
    bool isArrayIndex;
498
    unsigned i = propertyName.toArrayIndex(isArrayIndex);
darin's avatar
darin committed
499 500 501 502 503 504 505 506 507
    if (isArrayIndex)
        return deleteProperty(exec, i);

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

    return JSObject::deleteProperty(exec, propertyName);
}

darin@apple.com's avatar
darin@apple.com committed
508
bool JSArray::deleteProperty(ExecState* exec, unsigned i)
darin's avatar
darin committed
509
{
510 511
    checkConsistency();

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

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

537 538
    checkConsistency();

barraclough@apple.com's avatar
barraclough@apple.com committed
539
    if (i > MAX_ARRAY_INDEX)
ap@webkit.org's avatar
ap@webkit.org committed
540
        return deleteProperty(exec, Identifier::from(exec, i));
darin's avatar
darin committed
541 542 543 544

    return false;
}

545
void JSArray::getOwnPropertyNames(ExecState* exec, PropertyNameArray& propertyNames, EnumerationMode mode)
darin's avatar
darin committed
546 547
{
    // FIXME: Filling PropertyNameArray with an identifier for every integer
548 549
    // 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
550

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

    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
562
            propertyNames.add(Identifier::from(exec, it->first));
darin's avatar
darin committed
563
    }
564

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

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

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

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

578 579
    if (desiredLength < maxInitLength)
        increasedLength = maxInitLength;
580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597
    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
598
bool JSArray::increaseVectorLength(unsigned newLength)
darin's avatar
darin committed
599
{
ap@webkit.org's avatar
ap@webkit.org committed
600 601 602
    // 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.

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

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

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

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

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

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

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

628 629 630 631 632
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.
    
633
    ArrayStorage* storage = m_storage;
634 635 636 637 638
    
    unsigned vectorLength = m_vectorLength;
    ASSERT(newLength > vectorLength);
    ASSERT(newLength <= MAX_STORAGE_VECTOR_INDEX);
    unsigned newVectorLength = getNewVectorLength(newLength);
639 640

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

648 649
    memcpy(m_storage, storage, storageSize(0));
    memcpy(&m_storage->m_vector[newLength - m_vectorLength], &storage->m_vector[0], vectorLength * sizeof(JSValue));
650
    
651
    m_storage->m_allocBase = newBaseStorage;
652 653
    m_vectorLength = newLength;
    
654
    fastFree(storage->m_allocBase);
655 656

    Heap::heap(this)->reportExtraMemoryCost(storageSize(newVectorLength) - storageSize(vectorLength));
657
    
ap@webkit.org's avatar
ap@webkit.org committed
658
    return true;
darin's avatar
darin committed
659
}
660
    
darin's avatar
darin committed
661

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

673
    unsigned length = storage->m_length;
darin's avatar
darin committed
674 675

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

698
    storage->m_length = newLength;
699 700

    checkConsistency();
darin's avatar
darin committed
701 702
}

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

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

    --length;

ggaren@apple.com's avatar
ggaren@apple.com committed
715
    JSValue result;
716

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

740
    storage->m_length = length;
741 742 743 744 745 746

    checkConsistency();

    return result;
}

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

753
    if (storage->m_length < m_vectorLength) {
754
        storage->m_vector[storage->m_length].set(exec->globalData(), this, value);
755 756
        ++storage->m_numValuesInVector;
        ++storage->m_length;
757 758 759 760
        checkConsistency();
        return;
    }

761 762
    if (storage->m_length < MIN_SPARSE_ARRAY_INDEX) {
        SparseArrayValueMap* map = storage->m_sparseValueMap;
763
        if (!map || map->isEmpty()) {
764
            if (increaseVectorLength(storage->m_length + 1)) {
765
                storage = m_storage;
766
                storage->m_vector[storage->m_length].set(exec->globalData(), this, value);
767 768
                ++storage->m_numValuesInVector;
                ++storage->m_length;
769 770 771 772 773 774 775 776 777
                checkConsistency();
                return;
            }
            checkConsistency();
            throwOutOfMemoryError(exec);
            return;
        }
    }

778 779 780 781 782 783 784
    putSlowCase(exec, storage->m_length++, value);
}

void JSArray::shiftCount(ExecState* exec, int count)
{
    ASSERT(count > 0);
    
785
    ArrayStorage* storage = m_storage;
786 787 788 789 790 791 792 793 794 795 796 797
    
    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) {
798
            if ((i >= m_vectorLength) || (!m_storage->m_vector[i])) {
799 800 801 802 803 804 805
                PropertySlot slot(this);
                JSValue p = prototype();
                if ((!p.isNull()) && (asObject(p)->getPropertySlot(exec, i, slot)))
                    put(exec, i, slot.getValue(exec, i));
            }
        }

806
        storage = m_storage; // The put() above could have grown the vector and realloc'ed storage.
807 808 809

        // Need to decrement numValuesInvector based on number of real entries
        for (unsigned i = 0; i < (unsigned)count; ++i)
<