/* * Copyright (C) 2012, 2013 Apple Inc. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef CopyWorkList_h #define CopyWorkList_h #include "CopyToken.h" #include namespace JSC { class JSCell; class CopyWorklistItem { public: CopyWorklistItem() : m_value(0) { } CopyWorklistItem(JSCell* cell, CopyToken token) : m_value(bitwise_cast(cell) | static_cast(token)) { ASSERT(!(bitwise_cast(cell) & static_cast(mask))); ASSERT(static_cast(token) <= mask); } JSCell* cell() const { return bitwise_cast(m_value & ~static_cast(mask)); } CopyToken token() const { return static_cast(m_value & mask); } private: static const unsigned requiredAlignment = 8; static const unsigned mask = requiredAlignment - 1; uintptr_t m_value; }; class CopyWorkListSegment : public DoublyLinkedListNode { friend class WTF::DoublyLinkedListNode; public: static CopyWorkListSegment* create() { return new (NotNull, fastMalloc(blockSize)) CopyWorkListSegment(); } static void destroy(CopyWorkListSegment* segment) { segment->~CopyWorkListSegment(); fastFree(segment); } size_t size() { return m_size; } bool isFull() { return reinterpret_cast(&data()[size()]) >= endOfBlock(); } CopyWorklistItem get(size_t index) { return data()[index]; } void append(CopyWorklistItem item) { ASSERT(!isFull()); data()[m_size] = item; m_size += 1; } static const size_t blockSize = 512; private: CopyWorkListSegment() : DoublyLinkedListNode() , m_size(0) { } CopyWorklistItem* data() { return reinterpret_cast(this + 1); } char* endOfBlock() { return reinterpret_cast(this) + blockSize; } CopyWorkListSegment* m_prev; CopyWorkListSegment* m_next; size_t m_size; }; class CopyWorkListIterator { friend class CopyWorkList; public: CopyWorklistItem get() { return m_currentSegment->get(m_currentIndex); } CopyWorklistItem operator*() { return get(); } CopyWorklistItem operator->() { return get(); } CopyWorkListIterator& operator++() { m_currentIndex++; if (m_currentIndex >= m_currentSegment->size()) { m_currentIndex = 0; m_currentSegment = m_currentSegment->next(); ASSERT(!m_currentSegment || m_currentSegment->size()); } return *this; } bool operator==(const CopyWorkListIterator& other) const { return m_currentSegment == other.m_currentSegment && m_currentIndex == other.m_currentIndex; } bool operator!=(const CopyWorkListIterator& other) const { return !(*this == other); } CopyWorkListIterator() : m_currentSegment(0) , m_currentIndex(0) { } private: CopyWorkListIterator(CopyWorkListSegment* startSegment, size_t startIndex) : m_currentSegment(startSegment) , m_currentIndex(startIndex) { } CopyWorkListSegment* m_currentSegment; size_t m_currentIndex; }; class CopyWorkList { WTF_MAKE_FAST_ALLOCATED; public: typedef CopyWorkListIterator iterator; CopyWorkList(); ~CopyWorkList(); void append(CopyWorklistItem); iterator begin(); iterator end(); private: DoublyLinkedList m_segments; }; inline CopyWorkList::CopyWorkList() { } inline CopyWorkList::~CopyWorkList() { while (!m_segments.isEmpty()) CopyWorkListSegment::destroy(m_segments.removeHead()); } inline void CopyWorkList::append(CopyWorklistItem item) { if (m_segments.isEmpty() || m_segments.tail()->isFull()) m_segments.append(CopyWorkListSegment::create()); ASSERT(!m_segments.tail()->isFull()); m_segments.tail()->append(item); } inline CopyWorkList::iterator CopyWorkList::begin() { return CopyWorkListIterator(m_segments.head(), 0); } inline CopyWorkList::iterator CopyWorkList::end() { return CopyWorkListIterator(); } } // namespace JSC #endif // CopyWorkList_h