mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 12:42:45 +00:00
746b310061
This allows us to remove a HashTable from heap and cuts down on some of the malloc traffic when creating handles.
71 lines
1.4 KiB
C++
71 lines
1.4 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Badge.h>
|
|
#include <AK/IntrusiveList.h>
|
|
#include <AK/Noncopyable.h>
|
|
#include <AK/RefCounted.h>
|
|
#include <AK/RefPtr.h>
|
|
#include <LibJS/Forward.h>
|
|
|
|
namespace JS {
|
|
|
|
class HandleImpl : public RefCounted<HandleImpl> {
|
|
AK_MAKE_NONCOPYABLE(HandleImpl);
|
|
AK_MAKE_NONMOVABLE(HandleImpl);
|
|
|
|
public:
|
|
~HandleImpl();
|
|
|
|
Cell* cell() { return m_cell; }
|
|
const Cell* cell() const { return m_cell; }
|
|
|
|
private:
|
|
template<class T>
|
|
friend class Handle;
|
|
|
|
explicit HandleImpl(Cell*);
|
|
Cell* m_cell { nullptr };
|
|
|
|
IntrusiveListNode<HandleImpl> m_list_node;
|
|
|
|
public:
|
|
using List = IntrusiveList<HandleImpl, RawPtr<HandleImpl>, &HandleImpl::m_list_node>;
|
|
};
|
|
|
|
template<class T>
|
|
class Handle {
|
|
public:
|
|
Handle() { }
|
|
|
|
static Handle create(T* cell)
|
|
{
|
|
return Handle(adopt_ref(*new HandleImpl(cell)));
|
|
}
|
|
|
|
T* cell() { return static_cast<T*>(m_impl->cell()); }
|
|
const T* cell() const { return static_cast<const T*>(m_impl->cell()); }
|
|
|
|
bool is_null() const { return m_impl.is_null(); }
|
|
|
|
private:
|
|
explicit Handle(NonnullRefPtr<HandleImpl> impl)
|
|
: m_impl(move(impl))
|
|
{
|
|
}
|
|
|
|
RefPtr<HandleImpl> m_impl;
|
|
};
|
|
|
|
template<class T>
|
|
inline Handle<T> make_handle(T* cell)
|
|
{
|
|
return Handle<T>::create(cell);
|
|
}
|
|
|
|
}
|