Searched refs:usedVectorLength (Results 1 - 2 of 2) sorted by relevance

/macosx-10.9.5/JavaScriptCore-7537.78.1/runtime/
H A DJSArray.cpp259 // * usedVectorLength - how many entries are currently in the vector (conservative estimate - fewer may be in use in sparse vectors).
265 unsigned usedVectorLength = min(storage->vectorLength(), length); local
266 ASSERT(usedVectorLength <= MAX_STORAGE_VECTOR_LENGTH);
268 if (count > MAX_STORAGE_VECTOR_LENGTH - usedVectorLength)
270 unsigned requiredVectorLength = usedVectorLength + count;
318 ASSERT(count + usedVectorLength <= newVectorLength);
319 memmove(newButterfly->arrayStorage()->m_vector + count, storage->m_vector, sizeof(JSValue) * usedVectorLength);
323 memmove(newButterfly->arrayStorage()->m_vector, storage->m_vector, sizeof(JSValue) * usedVectorLength);
388 unsigned usedVectorLength = min(length, storage->vectorLength()); local
389 for (unsigned i = newLength; i < usedVectorLength;
709 unsigned usedVectorLength = min(vectorLength, oldLength); local
1340 unsigned usedVectorLength = relevantLength<indexingType>(); local
[all...]
H A DJSObject.cpp552 unsigned usedVectorLength = std::min(storage->length(), storage->vectorLength()); local
553 for (unsigned i = 0; i < usedVectorLength; ++i) {
1506 unsigned usedVectorLength = std::min(storage->length(), storage->vectorLength()); local
1507 for (unsigned i = 0; i < usedVectorLength; ++i) {

Completed in 260 milliseconds