summaryrefslogtreecommitdiff
path: root/Source/JavaScriptCore/b3/B3SparseCollection.h
diff options
context:
space:
mode:
authorLorry Tar Creator <lorry-tar-importer@lorry>2016-04-10 09:28:39 +0000
committerLorry Tar Creator <lorry-tar-importer@lorry>2016-04-10 09:28:39 +0000
commit32761a6cee1d0dee366b885b7b9c777e67885688 (patch)
treed6bec92bebfb216f4126356e55518842c2f476a1 /Source/JavaScriptCore/b3/B3SparseCollection.h
parenta4e969f4965059196ca948db781e52f7cfebf19e (diff)
downloadWebKitGtk-tarball-32761a6cee1d0dee366b885b7b9c777e67885688.tar.gz
webkitgtk-2.4.11webkitgtk-2.4.11
Diffstat (limited to 'Source/JavaScriptCore/b3/B3SparseCollection.h')
-rw-r--r--Source/JavaScriptCore/b3/B3SparseCollection.h146
1 files changed, 0 insertions, 146 deletions
diff --git a/Source/JavaScriptCore/b3/B3SparseCollection.h b/Source/JavaScriptCore/b3/B3SparseCollection.h
deleted file mode 100644
index d027a48a3..000000000
--- a/Source/JavaScriptCore/b3/B3SparseCollection.h
+++ /dev/null
@@ -1,146 +0,0 @@
-/*
- * Copyright (C) 2016 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. ``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
- * 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 B3SparseCollection_h
-#define B3SparseCollection_h
-
-#if ENABLE(B3_JIT)
-
-#include <wtf/StdLibExtras.h>
-#include <wtf/Vector.h>
-
-namespace JSC { namespace B3 {
-
-// B3::Procedure and Air::Code have a lot of collections of indexed things. This has all of the
-// logic.
-
-template<typename T>
-class SparseCollection {
- typedef Vector<std::unique_ptr<T>> VectorType;
-
-public:
- SparseCollection()
- {
- }
-
- T* add(std::unique_ptr<T> value)
- {
- T* result = value.get();
-
- size_t index;
- if (m_indexFreeList.isEmpty()) {
- index = m_vector.size();
- m_vector.append(nullptr);
- } else
- index = m_indexFreeList.takeLast();
-
- value->m_index = index;
-
- m_vector[index] = WTFMove(value);
-
- return result;
- }
-
- template<typename... Arguments>
- T* addNew(Arguments&&... arguments)
- {
- return add(std::unique_ptr<T>(new T(std::forward<Arguments>(arguments)...)));
- }
-
- void remove(T* value)
- {
- RELEASE_ASSERT(m_vector[value->m_index].get() == value);
- m_indexFreeList.append(value->m_index);
- m_vector[value->m_index] = nullptr;
- }
-
- unsigned size() const { return m_vector.size(); }
- bool isEmpty() const { return m_vector.isEmpty(); }
-
- T* at(unsigned index) const { return m_vector[index].get(); }
- T* operator[](unsigned index) const { return at(index); }
-
- class iterator {
- public:
- iterator()
- : m_collection(nullptr)
- , m_index(0)
- {
- }
-
- iterator(const SparseCollection& collection, unsigned index)
- : m_collection(&collection)
- , m_index(findNext(index))
- {
- }
-
- T* operator*()
- {
- return m_collection->at(m_index);
- }
-
- iterator& operator++()
- {
- m_index = findNext(m_index + 1);
- return *this;
- }
-
- bool operator==(const iterator& other) const
- {
- ASSERT(m_collection == other.m_collection);
- return m_index == other.m_index;
- }
-
- bool operator!=(const iterator& other) const
- {
- return !(*this == other);
- }
-
- private:
- unsigned findNext(unsigned index)
- {
- while (index < m_collection->size() && !m_collection->at(index))
- index++;
- return index;
- }
-
- const SparseCollection* m_collection;
- unsigned m_index;
- };
-
- iterator begin() const { return iterator(*this, 0); }
- iterator end() const { return iterator(*this, size()); }
-
-private:
- Vector<std::unique_ptr<T>> m_vector;
- Vector<size_t> m_indexFreeList;
-};
-
-} } // namespace JSC::B3
-
-#endif // ENABLE(B3_JIT)
-
-#endif // B3SparseCollection_h
-