1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
|
/*
* Copyright (C) 2021 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.
*/
#pragma once
#include <wtf/CheckedRef.h>
namespace WTF {
// CheckedPtr is used to verify that the object being pointed to outlives the CheckedPtr.
// It does not affect the lifetime of the object being pointed to; it simply adds a runtime
// check (via RELEASE_ASSERT) that when the object being pointed to is destroyed, there are
// no outstanding CheckedPtrs that reference it.
//
// Use is similar to WeakPtr, but CheckedPtr is used in cases where the target is never
// expected to become null, and CheckedPtr has less overhead.
template<typename T, typename PtrTraits>
class CheckedPtr {
WTF_MAKE_FAST_ALLOCATED;
public:
constexpr CheckedPtr()
: m_ptr(nullptr)
{ }
constexpr CheckedPtr(std::nullptr_t)
: m_ptr(nullptr)
{ }
ALWAYS_INLINE CheckedPtr(T* ptr)
: m_ptr { ptr }
{
refIfNotNull();
}
ALWAYS_INLINE CheckedPtr(const CheckedPtr& other)
: m_ptr { other.m_ptr }
{
refIfNotNull();
}
ALWAYS_INLINE CheckedPtr(CheckedPtr&& other)
: m_ptr { PtrTraits::exchange(other.m_ptr, nullptr) }
{
}
ALWAYS_INLINE ~CheckedPtr()
{
derefIfNotNull();
}
template<typename OtherType, typename OtherPtrTraits> CheckedPtr(const CheckedPtr<OtherType, OtherPtrTraits>& other)
: CheckedPtr(OtherPtrTraits::unwrap(other.m_ptr))
{ }
template<typename OtherType, typename OtherPtrTraits> CheckedPtr(CheckedPtr<OtherType, OtherPtrTraits>&& other)
: m_ptr { OtherPtrTraits::exchange(other.m_ptr, nullptr) }
{
}
CheckedPtr(CheckedRef<T, PtrTraits>& other)
: CheckedPtr(PtrTraits::unwrap(other.m_ptr))
{ }
template<typename OtherType, typename OtherPtrTraits> CheckedPtr(const CheckedRef<OtherType, OtherPtrTraits>& other)
: CheckedPtr(OtherPtrTraits::unwrap(other.m_ptr))
{ }
CheckedPtr(CheckedRef<T, PtrTraits>&& other)
: m_ptr { other.releasePtr() }
{
ASSERT(get());
}
template<typename OtherType, typename OtherPtrTraits> CheckedPtr(CheckedRef<OtherType, OtherPtrTraits>&& other)
: m_ptr { other.releasePtr() }
{
ASSERT(get());
}
CheckedPtr(HashTableDeletedValueType)
: m_ptr(PtrTraits::hashTableDeletedValue())
{ }
bool isHashTableDeletedValue() const { return PtrTraits::isHashTableDeletedValue(m_ptr); }
ALWAYS_INLINE explicit operator bool() const { return PtrTraits::unwrap(m_ptr); }
ALWAYS_INLINE T* get() const { return PtrTraits::unwrap(m_ptr); }
ALWAYS_INLINE T& operator*() const { RELEASE_ASSERT(m_ptr); return *get(); }
ALWAYS_INLINE T* operator->() const { RELEASE_ASSERT(m_ptr); return get(); }
CheckedRef<T> releaseNonNull()
{
RELEASE_ASSERT(m_ptr);
auto& ptr = *PtrTraits::unwrap(std::exchange(m_ptr, nullptr));
return CheckedRef { ptr, CheckedRef<T>::Adopt };
}
bool operator==(const T* other) const { return m_ptr == other; }
template<typename U> bool operator==(U* other) const { return m_ptr == other; }
bool operator==(const CheckedPtr& other) const { return m_ptr == other.m_ptr; }
template<typename OtherType, typename OtherPtrTraits>
bool operator==(const CheckedPtr<OtherType, OtherPtrTraits>& other) const { return m_ptr == other.m_ptr; }
CheckedPtr& operator=(std::nullptr_t)
{
derefIfNotNull();
m_ptr = nullptr;
return *this;
}
CheckedPtr& operator=(T* ptr)
{
CheckedPtr copy { ptr };
PtrTraits::swap(m_ptr, copy.m_ptr);
return *this;
}
CheckedPtr& operator=(const CheckedPtr& other)
{
CheckedPtr copy { other };
PtrTraits::swap(m_ptr, copy.m_ptr);
return *this;
}
template<typename OtherType, typename OtherPtrTraits> CheckedPtr& operator=(const CheckedPtr<OtherType, OtherPtrTraits>& other)
{
CheckedPtr copy { other };
PtrTraits::swap(m_ptr, copy.m_ptr);
return *this;
}
CheckedPtr& operator=(CheckedPtr&& other)
{
CheckedPtr moved { WTFMove(other) };
PtrTraits::swap(m_ptr, moved.m_ptr);
return *this;
}
template<typename OtherType, typename OtherPtrTraits> CheckedPtr& operator=(CheckedPtr<OtherType, OtherPtrTraits>&& other)
{
CheckedPtr moved { WTFMove(other) };
PtrTraits::swap(m_ptr, moved.m_ptr);
return *this;
}
private:
template<typename OtherType, typename OtherPtrTraits> friend class CheckedPtr;
ALWAYS_INLINE void refIfNotNull()
{
if (T* ptr = PtrTraits::unwrap(m_ptr); LIKELY(ptr))
ptr->incrementCheckedPtrCount();
}
ALWAYS_INLINE void derefIfNotNull()
{
if (T* ptr = PtrTraits::unwrap(m_ptr); LIKELY(ptr))
ptr->decrementCheckedPtrCount();
}
typename PtrTraits::StorageType m_ptr;
};
template <typename T, typename PtrTraits>
struct GetPtrHelper<CheckedPtr<T, PtrTraits>> {
using PtrType = T*;
using UnderlyingType = T;
static T* getPtr(const CheckedPtr<T, PtrTraits>& p) { return const_cast<T*>(p.get()); }
};
template <typename T, typename U>
struct IsSmartPtr<CheckedPtr<T, U>> {
static constexpr bool value = true;
};
template<typename ExpectedType, typename ArgType, typename ArgPtrTraits>
inline bool is(CheckedPtr<ArgType, ArgPtrTraits>& source)
{
return is<ExpectedType>(source.get());
}
template<typename ExpectedType, typename ArgType, typename ArgPtrTraits>
inline bool is(const CheckedPtr<ArgType, ArgPtrTraits>& source)
{
return is<ExpectedType>(source.get());
}
template<typename P> struct HashTraits<CheckedPtr<P>> : SimpleClassHashTraits<CheckedPtr<P>> {
static P* emptyValue() { return nullptr; }
static bool isEmptyValue(const CheckedPtr<P>& value) { return !value; }
typedef P* PeekType;
static PeekType peek(const CheckedPtr<P>& value) { return value.get(); }
static PeekType peek(P* value) { return value; }
static void customDeleteBucket(CheckedPtr<P>& value)
{
// See unique_ptr's customDeleteBucket() for an explanation.
ASSERT(!SimpleClassHashTraits<CheckedPtr<P>>::isDeletedValue(value));
auto valueToBeDestroyed = WTFMove(value);
SimpleClassHashTraits<CheckedPtr<P>>::constructDeletedValue(value);
}
};
template<typename P> struct DefaultHash<CheckedPtr<P>> : PtrHash<CheckedPtr<P>> { };
template<typename> struct PackedPtrTraits;
template<typename T> using PackedCheckedPtr = CheckedPtr<T, PackedPtrTraits<T>>;
} // namespace WTF
using WTF::CheckedPtr;
using WTF::PackedCheckedPtr;
|