mirror of
https://github.com/SerenityOS/serenity
synced 2024-07-23 19:15:55 +00:00
75f61fe3d9
This makes most operations thread safe, especially so that they can safely be used in the Kernel. This includes obtaining a strong reference from a weak reference, which now requires an explicit call to WeakPtr::strong_ref(). Another major change is that Weakable::make_weak_ref() may require the explicit target type. Previously we used reinterpret_cast in WeakPtr, assuming that it can be properly converted. But WeakPtr does not necessarily have the knowledge to be able to do this. Instead, we now ask the class itself to deliver a WeakPtr to the type that we want. Also, WeakLink is no longer specific to a target type. The reason for this is that we want to be able to safely convert e.g. WeakPtr<T> to WeakPtr<U>, and before this we just reinterpret_cast the internal WeakLink<T> to WeakLink<U>, which is a bold assumption that it would actually produce the correct code. Instead, WeakLink now operates on just a raw pointer and we only make those constructors/operators available if we can verify that it can be safely cast. In order to guarantee thread safety, we now use the least significant bit in the pointer for locking purposes. This also means that only properly aligned pointers can be used.
127 lines
3.7 KiB
C++
127 lines
3.7 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/Assertions.h>
|
|
#include <AK/Atomic.h>
|
|
#include <AK/Checked.h>
|
|
#include <AK/Noncopyable.h>
|
|
#include <AK/Platform.h>
|
|
#include <AK/StdLibExtras.h>
|
|
|
|
namespace AK {
|
|
|
|
template<class T>
|
|
constexpr auto call_will_be_destroyed_if_present(const T* object) -> decltype(object->will_be_destroyed(), TrueType {})
|
|
{
|
|
const_cast<T*>(object)->will_be_destroyed();
|
|
return {};
|
|
}
|
|
|
|
constexpr auto call_will_be_destroyed_if_present(...) -> FalseType
|
|
{
|
|
return {};
|
|
}
|
|
|
|
template<class T>
|
|
constexpr auto call_one_ref_left_if_present(const T* object) -> decltype(object->one_ref_left(), TrueType {})
|
|
{
|
|
const_cast<T*>(object)->one_ref_left();
|
|
return {};
|
|
}
|
|
|
|
constexpr auto call_one_ref_left_if_present(...) -> FalseType
|
|
{
|
|
return {};
|
|
}
|
|
|
|
class RefCountedBase {
|
|
AK_MAKE_NONCOPYABLE(RefCountedBase);
|
|
AK_MAKE_NONMOVABLE(RefCountedBase);
|
|
|
|
public:
|
|
typedef unsigned int RefCountType;
|
|
using AllowOwnPtr = FalseType;
|
|
|
|
ALWAYS_INLINE void ref() const
|
|
{
|
|
auto old_ref_count = m_ref_count.fetch_add(1, AK::MemoryOrder::memory_order_relaxed);
|
|
ASSERT(old_ref_count > 0);
|
|
ASSERT(!Checked<RefCountType>::addition_would_overflow(old_ref_count, 1));
|
|
}
|
|
|
|
ALWAYS_INLINE RefCountType ref_count() const
|
|
{
|
|
return m_ref_count.load(AK::MemoryOrder::memory_order_relaxed);
|
|
}
|
|
|
|
protected:
|
|
RefCountedBase() { }
|
|
ALWAYS_INLINE ~RefCountedBase()
|
|
{
|
|
ASSERT(m_ref_count.load(AK::MemoryOrder::memory_order_relaxed) == 0);
|
|
}
|
|
|
|
ALWAYS_INLINE RefCountType deref_base() const
|
|
{
|
|
auto old_ref_count = m_ref_count.fetch_sub(1, AK::MemoryOrder::memory_order_acq_rel);
|
|
ASSERT(old_ref_count > 0);
|
|
return old_ref_count - 1;
|
|
}
|
|
|
|
mutable Atomic<RefCountType> m_ref_count { 1 };
|
|
};
|
|
|
|
template<typename T>
|
|
class RefCounted : public RefCountedBase {
|
|
public:
|
|
void unref() const
|
|
{
|
|
auto new_ref_count = deref_base();
|
|
if (new_ref_count == 0) {
|
|
call_will_be_destroyed_if_present(static_cast<const T*>(this));
|
|
delete static_cast<const T*>(this);
|
|
} else if (new_ref_count == 1) {
|
|
call_one_ref_left_if_present(static_cast<const T*>(this));
|
|
}
|
|
}
|
|
};
|
|
|
|
static constexpr bool is_ref_counted(const RefCountedBase*)
|
|
{
|
|
return true;
|
|
}
|
|
|
|
static constexpr bool is_ref_counted(...)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
}
|
|
|
|
using AK::RefCounted;
|