Page MenuHomeWildfire Games
Differential D3095 Diff 13993 libraries/source/spidermonkey/include-win32-debug/js/GCVector.h

Changeset View

Standalone View

View Options

libraries/source/spidermonkey/include-win32-debug/js/GCVector.h

  • This file was moved from libraries/source/spidermonkey/include-win32-release/js/TraceableVector.h.
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99: * vim: set ts=8 sts=4 et sw=4 tw=99:
* This Source Code Form is subject to the terms of the Mozilla Public * This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this * License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */ * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef js_TraceableVector_h #ifndef js_GCVector_h
#define js_TraceableVector_h #define js_GCVector_h
#include "mozilla/Vector.h" #include "mozilla/Vector.h"
#include "js/GCPolicyAPI.h"
#include "js/RootingAPI.h" #include "js/RootingAPI.h"
#include "js/TracingAPI.h" #include "js/TracingAPI.h"
#include "js/Vector.h" #include "js/Vector.h"
namespace js { namespace JS {
// A TraceableVector is a Vector with an additional trace method that knows how // A GCVector is a Vector with an additional trace method that knows how
// to visit all of the items stored in the Vector. For vectors that contain GC // to visit all of the items stored in the Vector. For vectors that contain GC
// things, this is usually more convenient than manually iterating and marking // things, this is usually more convenient than manually iterating and marking
// the contents. // the contents.
// //
// Most types of GC pointers as keys and values can be traced with no extra // Most types of GC pointers as keys and values can be traced with no extra
// infrastructure. For structs and non-gc-pointer members, ensure that there // infrastructure. For structs and non-gc-pointer members, ensure that there is
// is a specialization of DefaultGCPolicy<T> with an appropriate trace method // a specialization of GCPolicy<T> with an appropriate trace method available
// available to handle the custom type. Generic helpers can be found in // to handle the custom type. Generic helpers can be found in
// js/public/TracingAPI.h. // js/public/TracingAPI.h.
// //
// Note that although this Vector's trace will deal correctly with moved items, // Note that although this Vector's trace will deal correctly with moved items,
// it does not itself know when to barrier or trace items. To function properly // it does not itself know when to barrier or trace items. To function properly
// it must either be used with Rooted, or barriered and traced manually. // it must either be used with Rooted, or barriered and traced manually.
template <typename T, template <typename T,
size_t MinInlineCapacity = 0, size_t MinInlineCapacity = 0,
typename AllocPolicy = TempAllocPolicy, typename AllocPolicy = js::TempAllocPolicy>
typename GCPolicy = DefaultGCPolicy<T>> class GCVector
class TraceableVector : public JS::Traceable
{ {
mozilla::Vector<T, MinInlineCapacity, AllocPolicy> vector; mozilla::Vector<T, MinInlineCapacity, AllocPolicy> vector;
public: public:
explicit TraceableVector(AllocPolicy alloc = AllocPolicy()) explicit GCVector(AllocPolicy alloc = AllocPolicy())
: vector(alloc) : vector(alloc)
{} {}
TraceableVector(TraceableVector&& vec) GCVector(GCVector&& vec)
: vector(mozilla::Move(vec.vector)) : vector(mozilla::Move(vec.vector))
{} {}
TraceableVector& operator=(TraceableVector&& vec) { GCVector& operator=(GCVector&& vec) {
vector = mozilla::Move(vec.vector); vector = mozilla::Move(vec.vector);
return *this; return *this;
} }
size_t length() const { return vector.length(); } size_t length() const { return vector.length(); }
bool empty() const { return vector.empty(); } bool empty() const { return vector.empty(); }
size_t capacity() const { return vector.capacity(); } size_t capacity() const { return vector.capacity(); }
Show All 35 Lines public:
template<typename U> void template<typename U> void
infallibleAppend(const U* aBegin, const U* aEnd) { infallibleAppend(const U* aBegin, const U* aEnd) {
return vector.infallibleAppend(aBegin, aEnd); return vector.infallibleAppend(aBegin, aEnd);
} }
template<typename U> void infallibleAppend(const U* aBegin, size_t aLength) { template<typename U> void infallibleAppend(const U* aBegin, size_t aLength) {
return vector.infallibleAppend(aBegin, aLength); return vector.infallibleAppend(aBegin, aLength);
} }
template<typename U, size_t O, class BP>
bool appendAll(const mozilla::Vector<U, O, BP>& aU) { return vector.appendAll(aU); }
template<typename U, size_t O, class BP>
bool appendAll(const GCVector<U, O, BP>& aU) { return vector.append(aU.begin(), aU.length()); }
bool appendN(const T& val, size_t count) { return vector.appendN(val, count); } bool appendN(const T& val, size_t count) { return vector.appendN(val, count); }
template<typename U> bool append(const U* aBegin, const U* aEnd) { template<typename U> bool append(const U* aBegin, const U* aEnd) {
return vector.append(aBegin, aEnd); return vector.append(aBegin, aEnd);
} }
template<typename U> bool append(const U* aBegin, size_t aLength) { template<typename U> bool append(const U* aBegin, size_t aLength) {
return vector.append(aBegin, aLength); return vector.append(aBegin, aLength);
} }
void popBack() { return vector.popBack(); } void popBack() { return vector.popBack(); }
T popCopy() { return vector.popCopy(); } T popCopy() { return vector.popCopy(); }
size_t sizeOfExcludingThis(mozilla::MallocSizeOf mallocSizeOf) const { size_t sizeOfExcludingThis(mozilla::MallocSizeOf mallocSizeOf) const {
return vector.sizeOfExcludingThis(mallocSizeOf); return vector.sizeOfExcludingThis(mallocSizeOf);
} }
size_t sizeOfIncludingThis(mozilla::MallocSizeOf mallocSizeOf) const { size_t sizeOfIncludingThis(mozilla::MallocSizeOf mallocSizeOf) const {
return vector.sizeOfIncludingThis(mallocSizeOf); return vector.sizeOfIncludingThis(mallocSizeOf);
} }
static void trace(TraceableVector* vec, JSTracer* trc) { vec->trace(trc); } static void trace(GCVector* vec, JSTracer* trc) { vec->trace(trc); }
void trace(JSTracer* trc) { void trace(JSTracer* trc) {
for (auto& elem : vector) for (auto& elem : vector)
GCPolicy::trace(trc, &elem, "vector element"); GCPolicy<T>::trace(trc, &elem, "vector element");
} }
}; };
template <typename Outer, typename T, size_t Capacity, typename AllocPolicy, typename GCPolicy> } // namespace JS
class TraceableVectorOperations
namespace js {
template <typename Outer, typename T, size_t Capacity, typename AllocPolicy>
class GCVectorOperations
{ {
using Vec = TraceableVector<T, Capacity, AllocPolicy, GCPolicy>; using Vec = JS::GCVector<T, Capacity, AllocPolicy>;
const Vec& vec() const { return static_cast<const Outer*>(this)->get(); } const Vec& vec() const { return static_cast<const Outer*>(this)->get(); }
public: public:
const AllocPolicy& allocPolicy() const { return vec().allocPolicy(); } const AllocPolicy& allocPolicy() const { return vec().allocPolicy(); }
size_t length() const { return vec().length(); } size_t length() const { return vec().length(); }
bool empty() const { return vec().empty(); } bool empty() const { return vec().empty(); }
size_t capacity() const { return vec().capacity(); } size_t capacity() const { return vec().capacity(); }
const T* begin() const { return vec().begin(); } const T* begin() const { return vec().begin(); }
const T* end() const { return vec().end(); } const T* end() const { return vec().end(); }
const T& back() const { return vec().back(); } const T& back() const { return vec().back(); }
bool canAppendWithoutRealloc(size_t aNeeded) const { return vec().canAppendWithoutRealloc(); }
JS::Handle<T> operator[](size_t aIndex) const { JS::Handle<T> operator[](size_t aIndex) const {
return JS::Handle<T>::fromMarkedLocation(&vec().operator[](aIndex)); return JS::Handle<T>::fromMarkedLocation(&vec().operator[](aIndex));
} }
}; };
template <typename Outer, typename T, size_t Capacity, typename AllocPolicy, typename GCPolicy> template <typename Outer, typename T, size_t Capacity, typename AllocPolicy>
class MutableTraceableVectorOperations class MutableGCVectorOperations
: public TraceableVectorOperations<Outer, T, Capacity, AllocPolicy, GCPolicy> : public GCVectorOperations<Outer, T, Capacity, AllocPolicy>
{ {
using Vec = TraceableVector<T, Capacity, AllocPolicy, GCPolicy>; using Vec = JS::GCVector<T, Capacity, AllocPolicy>;
const Vec& vec() const { return static_cast<const Outer*>(this)->get(); } const Vec& vec() const { return static_cast<const Outer*>(this)->get(); }
Vec& vec() { return static_cast<Outer*>(this)->get(); } Vec& vec() { return static_cast<Outer*>(this)->get(); }
public: public:
const AllocPolicy& allocPolicy() const { return vec().allocPolicy(); } const AllocPolicy& allocPolicy() const { return vec().allocPolicy(); }
AllocPolicy& allocPolicy() { return vec().allocPolicy(); } AllocPolicy& allocPolicy() { return vec().allocPolicy(); }
const T* begin() const { return vec().begin(); } const T* begin() const { return vec().begin(); }
T* begin() { return vec().begin(); } T* begin() { return vec().begin(); }
const T* end() const { return vec().end(); } const T* end() const { return vec().end(); }
T* end() { return vec().end(); } T* end() { return vec().end(); }
const T& operator[](size_t aIndex) const { return vec().operator[](aIndex); }
const T& back() const { return vec().back(); } const T& back() const { return vec().back(); }
T& back() { return vec().back(); } T& back() { return vec().back(); }
JS::Handle<T> operator[](size_t aIndex) const {
return JS::Handle<T>::fromMarkedLocation(&vec().operator[](aIndex));
}
JS::MutableHandle<T> operator[](size_t aIndex) { JS::MutableHandle<T> operator[](size_t aIndex) {
return JS::MutableHandle<T>::fromMarkedLocation(&vec().operator[](aIndex)); return JS::MutableHandle<T>::fromMarkedLocation(&vec().operator[](aIndex));
} }
bool initCapacity(size_t aRequest) { return vec().initCapacity(aRequest); } bool initCapacity(size_t aRequest) { return vec().initCapacity(aRequest); }
bool reserve(size_t aRequest) { return vec().reserve(aRequest); } bool reserve(size_t aRequest) { return vec().reserve(aRequest); }
void shrinkBy(size_t aIncr) { vec().shrinkBy(aIncr); } void shrinkBy(size_t aIncr) { vec().shrinkBy(aIncr); }
bool growBy(size_t aIncr) { return vec().growBy(aIncr); } bool growBy(size_t aIncr) { return vec().growBy(aIncr); }
bool resize(size_t aNewLength) { return vec().resize(aNewLength); } bool resize(size_t aNewLength) { return vec().resize(aNewLength); }
bool growByUninitialized(size_t aIncr) { return vec().growByUninitialized(aIncr); } bool growByUninitialized(size_t aIncr) { return vec().growByUninitialized(aIncr); }
void infallibleGrowByUninitialized(size_t aIncr) { vec().infallibleGrowByUninitialized(aIncr); } void infallibleGrowByUninitialized(size_t aIncr) { vec().infallibleGrowByUninitialized(aIncr); }
bool resizeUninitialized(size_t aNewLength) { return vec().resizeUninitialized(aNewLength); } bool resizeUninitialized(size_t aNewLength) { return vec().resizeUninitialized(aNewLength); }
void clear() { vec().clear(); } void clear() { vec().clear(); }
void clearAndFree() { vec().clearAndFree(); } void clearAndFree() { vec().clearAndFree(); }
template<typename U> bool append(U&& aU) { return vec().append(mozilla::Forward<U>(aU)); } template<typename U> bool append(U&& aU) { return vec().append(mozilla::Forward<U>(aU)); }
template<typename... Args> bool emplaceBack(Args&&... aArgs) { template<typename... Args> bool emplaceBack(Args&&... aArgs) {
return vec().emplaceBack(mozilla::Forward<Args...>(aArgs...)); return vec().emplaceBack(mozilla::Forward<Args...>(aArgs...));
} }
template<typename U, size_t O, class BP> template<typename U, size_t O, class BP>
bool appendAll(const mozilla::Vector<U, O, BP>& aU) { return vec().appendAll(aU); } bool appendAll(const mozilla::Vector<U, O, BP>& aU) { return vec().appendAll(aU); }
template<typename U, size_t O, class BP>
bool appendAll(const JS::GCVector<U, O, BP>& aU) { return vec().appendAll(aU); }
bool appendN(const T& aT, size_t aN) { return vec().appendN(aT, aN); } bool appendN(const T& aT, size_t aN) { return vec().appendN(aT, aN); }
template<typename U> bool append(const U* aBegin, const U* aEnd) { template<typename U> bool append(const U* aBegin, const U* aEnd) {
return vec().append(aBegin, aEnd); return vec().append(aBegin, aEnd);
} }
template<typename U> bool append(const U* aBegin, size_t aLength) { template<typename U> bool append(const U* aBegin, size_t aLength) {
return vec().append(aBegin, aLength); return vec().append(aBegin, aLength);
} }
template<typename U> void infallibleAppend(U&& aU) { template<typename U> void infallibleAppend(U&& aU) {
Show All 10 Lines public:
T popCopy() { return vec().popCopy(); } T popCopy() { return vec().popCopy(); }
template<typename U> T* insert(T* aP, U&& aVal) { template<typename U> T* insert(T* aP, U&& aVal) {
return vec().insert(aP, mozilla::Forward<U>(aVal)); return vec().insert(aP, mozilla::Forward<U>(aVal));
} }
void erase(T* aT) { vec().erase(aT); } void erase(T* aT) { vec().erase(aT); }
void erase(T* aBegin, T* aEnd) { vec().erase(aBegin, aEnd); } void erase(T* aBegin, T* aEnd) { vec().erase(aBegin, aEnd); }
}; };
template <typename T, size_t N, typename AP, typename GP> template <typename T, size_t N, typename AP>
class RootedBase<TraceableVector<T,N,AP,GP>> class RootedBase<JS::GCVector<T,N,AP>>
: public MutableTraceableVectorOperations<JS::Rooted<TraceableVector<T,N,AP,GP>>, T,N,AP,GP> : public MutableGCVectorOperations<JS::Rooted<JS::GCVector<T,N,AP>>, T,N,AP>
{}; {};
template <typename T, size_t N, typename AP, typename GP> template <typename T, size_t N, typename AP>
class MutableHandleBase<TraceableVector<T,N,AP,GP>> class MutableHandleBase<JS::GCVector<T,N,AP>>
: public MutableTraceableVectorOperations<JS::MutableHandle<TraceableVector<T,N,AP,GP>>, : public MutableGCVectorOperations<JS::MutableHandle<JS::GCVector<T,N,AP>>, T,N,AP>
T,N,AP,GP>
{}; {};
template <typename T, size_t N, typename AP, typename GP> template <typename T, size_t N, typename AP>
class HandleBase<TraceableVector<T,N,AP,GP>> class HandleBase<JS::GCVector<T,N,AP>>
: public TraceableVectorOperations<JS::Handle<TraceableVector<T,N,AP,GP>>, T,N,AP,GP> : public GCVectorOperations<JS::Handle<JS::GCVector<T,N,AP>>, T,N,AP>
{}; {};
template <typename T, size_t N, typename AP, typename GP> template <typename T, size_t N, typename AP>
class PersistentRootedBase<TraceableVector<T,N,AP,GP>> class PersistentRootedBase<JS::GCVector<T,N,AP>>
: public MutableTraceableVectorOperations<JS::PersistentRooted<TraceableVector<T,N,AP,GP>>, : public MutableGCVectorOperations<JS::PersistentRooted<JS::GCVector<T,N,AP>>, T,N,AP>
T,N,AP,GP>
{}; {};
} // namespace js } // namespace js
#endif // js_TraceableVector_h #endif // js_GCVector_h
Wildfire Games · Phabricator