/*
* Copyright (C) 2009, 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 WeakInlines_h
#define WeakInlines_h
#include "PassWeak.h"
#include "WeakSetInlines.h"
#include
#include
namespace JSC {
template inline Weak::Weak(T* cell, WeakHandleOwner* weakOwner, void* context)
: m_impl(cell ? WeakSet::allocate(cell, weakOwner, context) : 0)
{
}
template inline bool Weak::isHashTableDeletedValue() const
{
return m_impl == hashTableDeletedValue();
}
template inline Weak::Weak(typename Weak::HashTableDeletedValueTag)
: m_impl(hashTableDeletedValue())
{
}
template template inline Weak::Weak(const PassWeak& other)
: m_impl(other.leakImpl())
{
}
template inline void swap(Weak& a, Weak& b)
{
a.swap(b);
}
template inline void Weak::swap(Weak& other)
{
std::swap(m_impl, other.m_impl);
}
template inline Weak& Weak::operator=(const PassWeak& o)
{
clear();
m_impl = o.leakImpl();
return *this;
}
template inline T* Weak::operator->() const
{
ASSERT(m_impl && m_impl->state() == WeakImpl::Live);
return jsCast(m_impl->jsValue().asCell());
}
template inline T& Weak::operator*() const
{
ASSERT(m_impl && m_impl->state() == WeakImpl::Live);
return *jsCast(m_impl->jsValue().asCell());
}
template inline T* Weak::get() const
{
if (!m_impl || m_impl->state() != WeakImpl::Live)
return 0;
return jsCast(m_impl->jsValue().asCell());
}
template inline bool Weak::was(T* other) const
{
return static_cast(m_impl->jsValue().asCell()) == other;
}
template inline bool Weak::operator!() const
{
return !m_impl || !m_impl->jsValue() || m_impl->state() != WeakImpl::Live;
}
template inline Weak::operator UnspecifiedBoolType*() const
{
return reinterpret_cast(!!*this);
}
template inline PassWeak Weak::release()
{
PassWeak tmp = adoptWeak(m_impl);
m_impl = 0;
return tmp;
}
template inline WeakImpl* Weak::hashTableDeletedValue()
{
return reinterpret_cast(-1);
}
template inline bool operator==(const Weak& lhs, const Weak& rhs)
{
return lhs.get() == rhs.get();
}
// This function helps avoid modifying a weak table while holding an iterator into it. (Object allocation
// can run a finalizer that modifies the table. We avoid that by requiring a pre-constructed object as our value.)
template inline void weakAdd(Map& map, const Key& key, Value value)
{
ASSERT(!map.get(key));
map.set(key, value); // The table may still have a zombie for value.
}
template inline void weakRemove(Map& map, const Key& key, Value value)
{
typename Map::iterator it = map.find(key);
ASSERT_UNUSED(value, value);
ASSERT(it != map.end());
ASSERT(it->value.was(value));
ASSERT(!it->value);
map.remove(it);
}
template inline void weakClear(Weak& weak, T* cell)
{
ASSERT_UNUSED(cell, cell);
ASSERT(weak.was(cell));
ASSERT(!weak);
weak.clear();
}
} // namespace JSC
namespace WTF {
template struct VectorTraits<:weak> > : SimpleClassVectorTraits {
static const bool canCompareWithMemcmp = false;
};
template struct HashTraits<:weak> > : SimpleClassHashTraits<:weak> > {
typedef JSC::Weak StorageType;
typedef std::nullptr_t EmptyValueType;
static EmptyValueType emptyValue() { return nullptr; }
typedef JSC::PassWeak PassInType;
static void store(PassInType value, StorageType& storage) { storage = value; }
typedef JSC::PassWeak PassOutType;
static PassOutType passOut(StorageType& value) { return value.release(); }
static PassOutType passOut(EmptyValueType) { return PassOutType(); }
typedef T* PeekType;
static PeekType peek(const StorageType& value) { return value.get(); }
static PeekType peek(EmptyValueType) { return PeekType(); }
};
} // namespace WTF
#endif // WeakInlines_h