ALWAYS_INLINE bool JSString::shouldTryHashCons() { return ((length() > 1) && !isRope() && !isHashConsSingleton()); }
void JSRopeString::resolveRope(ExecState* exec) const { ASSERT(isRope()); if (is8Bit()) { LChar* buffer; if (RefPtr<StringImpl> newImpl = StringImpl::tryCreateUninitialized(m_length, buffer)) { Heap::heap(this)->reportExtraMemoryCost(newImpl->cost()); m_value = newImpl.release(); } else { outOfMemory(exec); return; } for (size_t i = 0; i < s_maxInternalRopeLength && m_fibers[i]; ++i) { if (m_fibers[i]->isRope()) return resolveRopeSlowCase8(buffer); } LChar* position = buffer; for (size_t i = 0; i < s_maxInternalRopeLength && m_fibers[i]; ++i) { StringImpl* string = m_fibers[i]->m_value.impl(); unsigned length = string->length(); StringImpl::copyChars(position, string->characters8(), length); position += length; m_fibers[i].clear(); } ASSERT((buffer + m_length) == position); ASSERT(!isRope()); return; } UChar* buffer; if (RefPtr<StringImpl> newImpl = StringImpl::tryCreateUninitialized(m_length, buffer)) { Heap::heap(this)->reportExtraMemoryCost(newImpl->cost()); m_value = newImpl.release(); } else { outOfMemory(exec); return; } for (size_t i = 0; i < s_maxInternalRopeLength && m_fibers[i]; ++i) { if (m_fibers[i]->isRope()) return resolveRopeSlowCase(buffer); } UChar* position = buffer; for (size_t i = 0; i < s_maxInternalRopeLength && m_fibers[i]; ++i) { StringImpl* string = m_fibers[i]->m_value.impl(); unsigned length = string->length(); if (string->is8Bit()) StringImpl::copyChars(position, string->characters8(), length); else StringImpl::copyChars(position, string->characters16(), length); position += length; m_fibers[i].clear(); } ASSERT((buffer + m_length) == position); ASSERT(!isRope()); }
// Overview: this methods converts a JSString from holding a string in rope form // down to a simple UString representation. It does so by building up the string // backwards, since we want to avoid recursion, we expect that the tree structure // 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 // 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 { ASSERT(isRope()); // Allocate the buffer to hold the final string, position initially points to the end. UChar* buffer; if (PassRefPtr<UStringImpl> 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<void*>(0); } m_ropeLength = 0; ASSERT(!isRope()); ASSERT(m_value == UString()); throwOutOfMemoryError(exec); return; } UChar* position = buffer + m_stringLength; // Start with the current Rope. Vector<Rope::Fiber, 32> workQueue; Rope::Fiber currentFiber; for (unsigned i = 0; i < (m_ropeLength - 1); ++i) workQueue.append(m_fibers[i]); currentFiber = m_fibers[m_ropeLength - 1]; while (true) { if (currentFiber.isRope()) { Rope* rope = currentFiber.rope(); // 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); } else { UString::Rep* string = currentFiber.string(); unsigned length = string->size(); position -= length; UStringImpl::copyChars(position, string->data(), 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<void*>(0); } m_ropeLength = 0; ASSERT(!isRope()); return; } // No! - set the next item up to process. currentFiber = workQueue.last(); workQueue.removeLast(); } } }