mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-26 17:40:27 +00:00
d2b500fbcb
If these methods get inlined, the compiler is able to statically eliminate most of the assertions. Alas, it doesn't realize this, and believes inlining them to be too expensive. So give it a strong hint that it's not the case. This *decreases* the kernel binary size.
300 lines
7.3 KiB
C++
300 lines
7.3 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* 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 THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT HOLDER 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.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/LogStream.h>
|
|
#include <AK/NonnullRefPtr.h>
|
|
#include <AK/StdLibExtras.h>
|
|
#include <AK/Traits.h>
|
|
#include <AK/Types.h>
|
|
|
|
namespace AK {
|
|
|
|
template<typename T>
|
|
class OwnPtr;
|
|
|
|
template<typename T>
|
|
class RefPtr {
|
|
public:
|
|
enum AdoptTag {
|
|
Adopt
|
|
};
|
|
|
|
RefPtr() {}
|
|
RefPtr(const T* ptr)
|
|
: m_ptr(const_cast<T*>(ptr))
|
|
{
|
|
ref_if_not_null(m_ptr);
|
|
}
|
|
RefPtr(const T& object)
|
|
: m_ptr(const_cast<T*>(&object))
|
|
{
|
|
m_ptr->ref();
|
|
}
|
|
RefPtr(AdoptTag, T& object)
|
|
: m_ptr(&object)
|
|
{
|
|
}
|
|
RefPtr(RefPtr&& other)
|
|
: m_ptr(other.leak_ref())
|
|
{
|
|
}
|
|
ALWAYS_INLINE RefPtr(const NonnullRefPtr<T>& other)
|
|
: m_ptr(const_cast<T*>(other.ptr()))
|
|
{
|
|
ASSERT(m_ptr);
|
|
m_ptr->ref();
|
|
}
|
|
template<typename U>
|
|
ALWAYS_INLINE RefPtr(const NonnullRefPtr<U>& other)
|
|
: m_ptr(const_cast<U*>(other.ptr()))
|
|
{
|
|
ASSERT(m_ptr);
|
|
m_ptr->ref();
|
|
}
|
|
template<typename U>
|
|
ALWAYS_INLINE RefPtr(NonnullRefPtr<U>&& other)
|
|
: m_ptr(&other.leak_ref())
|
|
{
|
|
ASSERT(m_ptr);
|
|
}
|
|
template<typename U>
|
|
RefPtr(RefPtr<U>&& other)
|
|
: m_ptr(other.leak_ref())
|
|
{
|
|
}
|
|
RefPtr(const RefPtr& other)
|
|
: m_ptr(const_cast<T*>(other.ptr()))
|
|
{
|
|
ref_if_not_null(m_ptr);
|
|
}
|
|
template<typename U>
|
|
RefPtr(const RefPtr<U>& other)
|
|
: m_ptr(const_cast<U*>(other.ptr()))
|
|
{
|
|
ref_if_not_null(m_ptr);
|
|
}
|
|
ALWAYS_INLINE ~RefPtr()
|
|
{
|
|
clear();
|
|
#ifdef SANITIZE_PTRS
|
|
if constexpr (sizeof(T*) == 8)
|
|
m_ptr = (T*)(0xe0e0e0e0e0e0e0e0);
|
|
else
|
|
m_ptr = (T*)(0xe0e0e0e0);
|
|
#endif
|
|
}
|
|
RefPtr(std::nullptr_t) {}
|
|
|
|
template<typename U>
|
|
RefPtr(const OwnPtr<U>&) = delete;
|
|
template<typename U>
|
|
RefPtr& operator=(const OwnPtr<U>&) = delete;
|
|
|
|
template<typename U>
|
|
void swap(RefPtr<U>& other)
|
|
{
|
|
::swap(m_ptr, other.m_ptr);
|
|
}
|
|
|
|
ALWAYS_INLINE RefPtr& operator=(RefPtr&& other)
|
|
{
|
|
RefPtr tmp = move(other);
|
|
swap(tmp);
|
|
return *this;
|
|
}
|
|
|
|
template<typename U>
|
|
ALWAYS_INLINE RefPtr& operator=(RefPtr<U>&& other)
|
|
{
|
|
RefPtr tmp = move(other);
|
|
swap(tmp);
|
|
return *this;
|
|
}
|
|
|
|
template<typename U>
|
|
ALWAYS_INLINE RefPtr& operator=(NonnullRefPtr<U>&& other)
|
|
{
|
|
RefPtr tmp = move(other);
|
|
swap(tmp);
|
|
ASSERT(m_ptr);
|
|
return *this;
|
|
}
|
|
|
|
ALWAYS_INLINE RefPtr& operator=(const NonnullRefPtr<T>& other)
|
|
{
|
|
RefPtr tmp = other;
|
|
swap(tmp);
|
|
ASSERT(m_ptr);
|
|
return *this;
|
|
}
|
|
|
|
template<typename U>
|
|
ALWAYS_INLINE RefPtr& operator=(const NonnullRefPtr<U>& other)
|
|
{
|
|
RefPtr tmp = other;
|
|
swap(tmp);
|
|
ASSERT(m_ptr);
|
|
return *this;
|
|
}
|
|
|
|
ALWAYS_INLINE RefPtr& operator=(const RefPtr& other)
|
|
{
|
|
RefPtr tmp = other;
|
|
swap(tmp);
|
|
return *this;
|
|
}
|
|
|
|
template<typename U>
|
|
ALWAYS_INLINE RefPtr& operator=(const RefPtr<U>& other)
|
|
{
|
|
RefPtr tmp = other;
|
|
swap(tmp);
|
|
return *this;
|
|
}
|
|
|
|
ALWAYS_INLINE RefPtr& operator=(const T* ptr)
|
|
{
|
|
RefPtr tmp = ptr;
|
|
swap(tmp);
|
|
return *this;
|
|
}
|
|
|
|
ALWAYS_INLINE RefPtr& operator=(const T& object)
|
|
{
|
|
RefPtr tmp = object;
|
|
swap(tmp);
|
|
return *this;
|
|
}
|
|
|
|
RefPtr& operator=(std::nullptr_t)
|
|
{
|
|
clear();
|
|
return *this;
|
|
}
|
|
|
|
ALWAYS_INLINE void clear()
|
|
{
|
|
unref_if_not_null(m_ptr);
|
|
m_ptr = nullptr;
|
|
}
|
|
|
|
bool operator!() const { return !m_ptr; }
|
|
|
|
[[nodiscard]] T* leak_ref()
|
|
{
|
|
return exchange(m_ptr, nullptr);
|
|
}
|
|
|
|
NonnullRefPtr<T> release_nonnull()
|
|
{
|
|
ASSERT(m_ptr);
|
|
return NonnullRefPtr<T>(NonnullRefPtr<T>::Adopt, *leak_ref());
|
|
}
|
|
|
|
ALWAYS_INLINE T* ptr() { return m_ptr; }
|
|
ALWAYS_INLINE const T* ptr() const { return m_ptr; }
|
|
|
|
ALWAYS_INLINE T* operator->()
|
|
{
|
|
ASSERT(m_ptr);
|
|
return m_ptr;
|
|
}
|
|
|
|
ALWAYS_INLINE const T* operator->() const
|
|
{
|
|
ASSERT(m_ptr);
|
|
return m_ptr;
|
|
}
|
|
|
|
ALWAYS_INLINE T& operator*()
|
|
{
|
|
ASSERT(m_ptr);
|
|
return *m_ptr;
|
|
}
|
|
|
|
ALWAYS_INLINE const T& operator*() const
|
|
{
|
|
ASSERT(m_ptr);
|
|
return *m_ptr;
|
|
}
|
|
|
|
ALWAYS_INLINE operator const T*() const { return m_ptr; }
|
|
ALWAYS_INLINE operator T*() { return m_ptr; }
|
|
|
|
operator bool() { return !!m_ptr; }
|
|
|
|
bool operator==(std::nullptr_t) const { return !m_ptr; }
|
|
bool operator!=(std::nullptr_t) const { return m_ptr; }
|
|
|
|
bool operator==(const RefPtr& other) const { return m_ptr == other.m_ptr; }
|
|
bool operator!=(const RefPtr& other) const { return m_ptr != other.m_ptr; }
|
|
|
|
bool operator==(RefPtr& other) { return m_ptr == other.m_ptr; }
|
|
bool operator!=(RefPtr& other) { return m_ptr != other.m_ptr; }
|
|
|
|
bool operator==(const T* other) const { return m_ptr == other; }
|
|
bool operator!=(const T* other) const { return m_ptr != other; }
|
|
|
|
bool operator==(T* other) { return m_ptr == other; }
|
|
bool operator!=(T* other) { return m_ptr != other; }
|
|
|
|
bool is_null() const { return !m_ptr; }
|
|
|
|
private:
|
|
T* m_ptr = nullptr;
|
|
};
|
|
|
|
template<typename T>
|
|
inline const LogStream& operator<<(const LogStream& stream, const RefPtr<T>& value)
|
|
{
|
|
return stream << value.ptr();
|
|
}
|
|
|
|
template<typename T>
|
|
struct Traits<RefPtr<T>> : public GenericTraits<RefPtr<T>> {
|
|
using PeekType = const T*;
|
|
static unsigned hash(const RefPtr<T>& p) { return ptr_hash(p.ptr()); }
|
|
static bool equals(const RefPtr<T>& a, const RefPtr<T>& b) { return a.ptr() == b.ptr(); }
|
|
};
|
|
|
|
template<typename T, typename U>
|
|
inline NonnullRefPtr<T> static_ptr_cast(const NonnullRefPtr<U>& ptr)
|
|
{
|
|
return NonnullRefPtr<T>(static_cast<const T&>(*ptr));
|
|
}
|
|
|
|
template<typename T, typename U>
|
|
inline RefPtr<T> static_ptr_cast(const RefPtr<U>& ptr)
|
|
{
|
|
return RefPtr<T>(static_cast<const T*>(ptr.ptr()));
|
|
}
|
|
|
|
}
|
|
|
|
using AK::RefPtr;
|
|
using AK::static_ptr_cast;
|