X-Git-Url: https://git.saurik.com/apple/javascriptcore.git/blobdiff_plain/f9bf01c6616d5ddcf65b13b33cedf9e387ff7a63..14957cd040308e3eeec43d26bae5d76da13fcd85:/runtime/JSString.cpp diff --git a/runtime/JSString.cpp b/runtime/JSString.cpp index 1e23a15..da15997 100644 --- a/runtime/JSString.cpp +++ b/runtime/JSString.cpp @@ -24,46 +24,60 @@ #include "JSString.h" #include "JSGlobalObject.h" +#include "JSGlobalObjectFunctions.h" #include "JSObject.h" #include "Operations.h" #include "StringObject.h" #include "StringPrototype.h" namespace JSC { + +static const unsigned substringFromRopeCutoff = 4; + +const ClassInfo JSString::s_info = { "string", 0, 0, 0 }; -void JSString::Rope::destructNonRecursive() +void JSString::resolveRope(ExecState* exec) const { - Vector workQueue; - Rope* rope = this; + ASSERT(isRope()); - while (true) { - unsigned length = rope->ropeLength(); - for (unsigned i = 0; i < length; ++i) { - Fiber& fiber = rope->fibers(i); - if (fiber.isString()) - fiber.string()->deref(); - else { - Rope* nextRope = fiber.rope(); - if (nextRope->hasOneRef()) - workQueue.append(nextRope); - else - nextRope->deref(); - } - } - if (rope != this) - fastFree(rope); + UChar* buffer; + if (PassRefPtr newImpl = StringImpl::tryCreateUninitialized(m_length, buffer)) + m_value = newImpl; + else { + outOfMemory(exec); + return; + } - if (workQueue.isEmpty()) - return; + RopeImpl::Fiber currentFiber = m_fibers[0]; - rope = workQueue.last(); - workQueue.removeLast(); + if ((m_fiberCount > 2) || (RopeImpl::isRope(currentFiber)) + || ((m_fiberCount == 2) && (RopeImpl::isRope(m_fibers[1])))) { + resolveRopeSlowCase(exec, buffer); + return; } -} -JSString::Rope::~Rope() -{ - destructNonRecursive(); + UChar* position = buffer; + StringImpl* string = static_cast(currentFiber); + unsigned length = string->length(); + StringImpl::copyChars(position, string->characters(), length); + + if (m_fiberCount > 1) { + position += length; + currentFiber = m_fibers[1]; + string = static_cast(currentFiber); + length = string->length(); + StringImpl::copyChars(position, string->characters(), length); + position += length; + } + + ASSERT((buffer + m_length) == position); + for (unsigned i = 0; i < m_fiberCount; ++i) { + RopeImpl::deref(m_fibers[i]); + m_fibers[i] = 0; + } + m_fiberCount = 0; + + ASSERT(!isRope()); } // Overview: this methods converts a JSString from holding a string in rope form @@ -72,62 +86,47 @@ JSString::Rope::~Rope() // representing the rope is likely imbalanced with more nodes down the left side // (since appending to the string is likely more common) - and as such resolving // in this fashion should minimize work queue size. (If we built the queue forwards -// we would likely have to place all of the constituent UString::Reps into the +// we would likely have to place all of the constituent StringImpls into the // Vector before performing any concatenation, but by working backwards we likely // only fill the queue with the number of substrings at any given level in a -// rope-of-ropes.) -void JSString::resolveRope(ExecState* exec) const +// rope-of-ropes.) +void JSString::resolveRopeSlowCase(ExecState* exec, UChar* buffer) const { - ASSERT(isRope()); + UNUSED_PARAM(exec); - // Allocate the buffer to hold the final string, position initially points to the end. - UChar* buffer; - if (PassRefPtr newImpl = UStringImpl::tryCreateUninitialized(m_stringLength, buffer)) - m_value = newImpl; - else { - for (unsigned i = 0; i < m_ropeLength; ++i) { - m_fibers[i].deref(); - m_fibers[i] = static_cast(0); - } - m_ropeLength = 0; - ASSERT(!isRope()); - ASSERT(m_value == UString()); - throwOutOfMemoryError(exec); - return; - } - UChar* position = buffer + m_stringLength; + UChar* position = buffer + m_length; - // Start with the current Rope. - Vector workQueue; - Rope::Fiber currentFiber; - for (unsigned i = 0; i < (m_ropeLength - 1); ++i) + // Start with the current RopeImpl. + Vector workQueue; + RopeImpl::Fiber currentFiber; + for (unsigned i = 0; i < (m_fiberCount - 1); ++i) workQueue.append(m_fibers[i]); - currentFiber = m_fibers[m_ropeLength - 1]; + currentFiber = m_fibers[m_fiberCount - 1]; while (true) { - if (currentFiber.isRope()) { - Rope* rope = currentFiber.rope(); + if (RopeImpl::isRope(currentFiber)) { + RopeImpl* rope = static_cast(currentFiber); // Copy the contents of the current rope into the workQueue, with the last item in 'currentFiber' // (we will be working backwards over the rope). - unsigned ropeLengthMinusOne = rope->ropeLength() - 1; - for (unsigned i = 0; i < ropeLengthMinusOne; ++i) - workQueue.append(rope->fibers(i)); - currentFiber = rope->fibers(ropeLengthMinusOne); + unsigned fiberCountMinusOne = rope->fiberCount() - 1; + for (unsigned i = 0; i < fiberCountMinusOne; ++i) + workQueue.append(rope->fibers()[i]); + currentFiber = rope->fibers()[fiberCountMinusOne]; } else { - UString::Rep* string = currentFiber.string(); - unsigned length = string->size(); + StringImpl* string = static_cast(currentFiber); + unsigned length = string->length(); position -= length; - UStringImpl::copyChars(position, string->data(), length); + StringImpl::copyChars(position, string->characters(), length); // Was this the last item in the work queue? if (workQueue.isEmpty()) { // Create a string from the UChar buffer, clear the rope RefPtr. ASSERT(buffer == position); - for (unsigned i = 0; i < m_ropeLength; ++i) { - m_fibers[i].deref(); - m_fibers[i] = static_cast(0); + for (unsigned i = 0; i < m_fiberCount; ++i) { + RopeImpl::deref(m_fibers[i]); + m_fibers[i] = 0; } - m_ropeLength = 0; - + m_fiberCount = 0; + ASSERT(!isRope()); return; } @@ -139,6 +138,137 @@ void JSString::resolveRope(ExecState* exec) const } } +void JSString::outOfMemory(ExecState* exec) const +{ + for (unsigned i = 0; i < m_fiberCount; ++i) { + RopeImpl::deref(m_fibers[i]); + m_fibers[i] = 0; + } + m_fiberCount = 0; + ASSERT(!isRope()); + ASSERT(m_value == UString()); + if (exec) + throwOutOfMemoryError(exec); +} + +// This function construsts a substring out of a rope without flattening by reusing the existing fibers. +// This can reduce memory usage substantially. Since traversing ropes is slow the function will revert +// back to flattening if the rope turns out to be long. +JSString* JSString::substringFromRope(ExecState* exec, unsigned substringStart, unsigned substringLength) +{ + ASSERT(isRope()); + ASSERT(substringLength); + + JSGlobalData* globalData = &exec->globalData(); + + UString substringFibers[3]; + + unsigned fiberCount = 0; + unsigned substringFiberCount = 0; + unsigned substringEnd = substringStart + substringLength; + unsigned fiberEnd = 0; + + RopeIterator end; + for (RopeIterator it(m_fibers.data(), m_fiberCount); it != end; ++it) { + ++fiberCount; + StringImpl* fiberString = *it; + unsigned fiberStart = fiberEnd; + fiberEnd = fiberStart + fiberString->length(); + if (fiberEnd <= substringStart) + continue; + unsigned copyStart = std::max(substringStart, fiberStart); + unsigned copyEnd = std::min(substringEnd, fiberEnd); + if (copyStart == fiberStart && copyEnd == fiberEnd) + substringFibers[substringFiberCount++] = UString(fiberString); + else + substringFibers[substringFiberCount++] = UString(StringImpl::create(fiberString, copyStart - fiberStart, copyEnd - copyStart)); + if (fiberEnd >= substringEnd) + break; + if (fiberCount > substringFromRopeCutoff || substringFiberCount >= 3) { + // This turned out to be a really inefficient rope. Just flatten it. + resolveRope(exec); + return jsSubstring(&exec->globalData(), m_value, substringStart, substringLength); + } + } + ASSERT(substringFiberCount && substringFiberCount <= 3); + + if (substringLength == 1) { + ASSERT(substringFiberCount == 1); + UChar c = substringFibers[0].characters()[0]; + if (c <= maxSingleCharacterString) + return globalData->smallStrings.singleCharacterString(globalData, c); + } + if (substringFiberCount == 1) + return new (globalData) JSString(globalData, substringFibers[0]); + if (substringFiberCount == 2) + return new (globalData) JSString(globalData, substringFibers[0], substringFibers[1]); + return new (globalData) JSString(globalData, substringFibers[0], substringFibers[1], substringFibers[2]); +} + +JSValue JSString::replaceCharacter(ExecState* exec, UChar character, const UString& replacement) +{ + if (!isRope()) { + size_t matchPosition = m_value.find(character); + if (matchPosition == notFound) + return JSValue(this); + return jsString(exec, m_value.substringSharingImpl(0, matchPosition), replacement, m_value.substringSharingImpl(matchPosition + 1)); + } + + RopeIterator end; + + // Count total fibers and find matching string. + size_t fiberCount = 0; + StringImpl* matchString = 0; + size_t matchPosition = notFound; + for (RopeIterator it(m_fibers.data(), m_fiberCount); it != end; ++it) { + ++fiberCount; + if (matchString) + continue; + + StringImpl* string = *it; + matchPosition = string->find(character); + if (matchPosition == notFound) + continue; + matchString = string; + } + + if (!matchString) + return this; + + RopeBuilder builder(replacement.length() ? fiberCount + 2 : fiberCount + 1); + if (UNLIKELY(builder.isOutOfMemory())) + return throwOutOfMemoryError(exec); + + for (RopeIterator it(m_fibers.data(), m_fiberCount); it != end; ++it) { + StringImpl* string = *it; + if (string != matchString) { + builder.append(UString(string)); + continue; + } + + builder.append(UString(string).substringSharingImpl(0, matchPosition)); + if (replacement.length()) + builder.append(replacement); + builder.append(UString(string).substringSharingImpl(matchPosition + 1)); + matchString = 0; + } + + JSGlobalData* globalData = &exec->globalData(); + return JSValue(new (globalData) JSString(globalData, builder.release())); +} + +JSString* JSString::getIndexSlowCase(ExecState* exec, unsigned i) +{ + ASSERT(isRope()); + resolveRope(exec); + // Return a safe no-value result, this should never be used, since the excetion will be thrown. + if (exec->exception()) + return jsString(exec, ""); + ASSERT(!isRope()); + ASSERT(i < m_value.length()); + return jsSingleCharacterSubstring(exec, m_value, i); +} + JSValue JSString::toPrimitive(ExecState*, PreferredPrimitiveType) const { return const_cast(this); @@ -147,18 +277,18 @@ JSValue JSString::toPrimitive(ExecState*, PreferredPrimitiveType) const bool JSString::getPrimitiveNumber(ExecState* exec, double& number, JSValue& result) { result = this; - number = value(exec).toDouble(); + number = jsToNumber(value(exec)); return false; } bool JSString::toBoolean(ExecState*) const { - return m_stringLength; + return m_length; } double JSString::toNumber(ExecState* exec) const { - return value(exec).toDouble(); + return jsToNumber(value(exec)); } UString JSString::toString(ExecState* exec) const @@ -166,29 +296,19 @@ UString JSString::toString(ExecState* exec) const return value(exec); } -UString JSString::toThisString(ExecState* exec) const -{ - return value(exec); -} - -JSString* JSString::toThisJSString(ExecState*) -{ - return this; -} - -inline StringObject* StringObject::create(ExecState* exec, JSString* string) +inline StringObject* StringObject::create(ExecState* exec, JSGlobalObject* globalObject, JSString* string) { - return new (exec) StringObject(exec->lexicalGlobalObject()->stringObjectStructure(), string); + return new (exec) StringObject(exec->globalData(), globalObject->stringObjectStructure(), string); } -JSObject* JSString::toObject(ExecState* exec) const +JSObject* JSString::toObject(ExecState* exec, JSGlobalObject* globalObject) const { - return StringObject::create(exec, const_cast(this)); + return StringObject::create(exec, globalObject, const_cast(this)); } JSObject* JSString::toThisObject(ExecState* exec) const { - return StringObject::create(exec, const_cast(this)); + return StringObject::create(exec, exec->lexicalGlobalObject(), const_cast(this)); } bool JSString::getOwnPropertySlot(ExecState* exec, const Identifier& propertyName, PropertySlot& slot) @@ -215,14 +335,14 @@ bool JSString::getOwnPropertySlot(ExecState* exec, const Identifier& propertyNam bool JSString::getStringPropertyDescriptor(ExecState* exec, const Identifier& propertyName, PropertyDescriptor& descriptor) { if (propertyName == exec->propertyNames().length) { - descriptor.setDescriptor(jsNumber(exec, m_stringLength), DontEnum | DontDelete | ReadOnly); + descriptor.setDescriptor(jsNumber(m_length), DontEnum | DontDelete | ReadOnly); return true; } bool isStrictUInt32; - unsigned i = propertyName.toStrictUInt32(&isStrictUInt32); - if (isStrictUInt32 && i < m_stringLength) { - descriptor.setDescriptor(jsSingleCharacterSubstring(exec, value(exec), i), DontDelete | ReadOnly); + unsigned i = propertyName.toUInt32(isStrictUInt32); + if (isStrictUInt32 && i < m_length) { + descriptor.setDescriptor(getIndex(exec, i), DontDelete | ReadOnly); return true; }