mirror of
https://github.com/fergalmoran/ladybird.git
synced 2026-01-02 22:55:23 +00:00
cf27eef583
While this is used in the implementation of Runtime objects itself, Heap seems like a more appropriate home. This will also help in factoring out the GC implementation into it's own library as the heap explicitly has knowledge of WeakContainer.
35 lines
579 B
C++
35 lines
579 B
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/IntrusiveList.h>
|
|
#include <LibJS/Forward.h>
|
|
|
|
namespace JS {
|
|
|
|
class WeakContainer {
|
|
public:
|
|
explicit WeakContainer(Heap&);
|
|
virtual ~WeakContainer();
|
|
|
|
virtual void remove_dead_cells(Badge<Heap>) = 0;
|
|
|
|
protected:
|
|
void deregister();
|
|
|
|
private:
|
|
bool m_registered { true };
|
|
Heap& m_heap;
|
|
|
|
IntrusiveListNode<WeakContainer> m_list_node;
|
|
|
|
public:
|
|
using List = IntrusiveList<&WeakContainer::m_list_node>;
|
|
};
|
|
|
|
}
|