83bd675477
Instead of iterating *all* swept cells when pruning weak containers, only iterate the cells actually *in* the container. Also, instead of compiling a list of all swept cells, we can simply check the Cell::state() flag to know if something should be pruned.
43 lines
940 B
C++
43 lines
940 B
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/HashTable.h>
|
|
#include <LibJS/Runtime/GlobalObject.h>
|
|
#include <LibJS/Runtime/Object.h>
|
|
#include <LibJS/Runtime/WeakContainer.h>
|
|
|
|
namespace JS {
|
|
|
|
class WeakSet final
|
|
: public Object
|
|
, public WeakContainer {
|
|
JS_OBJECT(WeakSet, Object);
|
|
|
|
public:
|
|
static WeakSet* create(GlobalObject&);
|
|
|
|
explicit WeakSet(Object& prototype);
|
|
virtual ~WeakSet() override;
|
|
|
|
HashTable<Cell*> const& values() const { return m_values; };
|
|
HashTable<Cell*>& values() { return m_values; };
|
|
|
|
virtual void remove_dead_cells(Badge<Heap>) override;
|
|
|
|
private:
|
|
#ifdef JS_TRACK_ZOMBIE_CELLS
|
|
virtual void did_become_zombie() override
|
|
{
|
|
deregister();
|
|
}
|
|
#endif
|
|
|
|
HashTable<Cell*> m_values; // This stores Cell pointers instead of Object pointers to aide with sweeping
|
|
};
|
|
|
|
}
|