ladybird/Userland/Libraries/LibJS/Runtime/Set.h
Andreas Kling 3c74dc9f4d LibJS: Segregate GC-allocated objects by type
This patch adds two macros to declare per-type allocators:

- JS_DECLARE_ALLOCATOR(TypeName)
- JS_DEFINE_ALLOCATOR(TypeName)

When used, they add a type-specific CellAllocator that the Heap will
delegate allocation requests to.

The result of this is that GC objects of the same type always end up
within the same HeapBlock, drastically reducing the ability to perform
type confusion attacks.

It also improves HeapBlock utilization, since each block now has cells
sized exactly to the type used within that block. (Previously we only
had a handful of block sizes available, and most GC allocations ended
up with a large amount of slack in their tails.)

There is a small performance hit from this, but I'm sure we can make
up for it elsewhere.

Note that the old size-based allocators still exist, and we fall back
to them for any type that doesn't have its own CellAllocator.
2023-11-19 12:10:31 +01:00

50 lines
1.4 KiB
C++

/*
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <LibJS/Runtime/GlobalObject.h>
#include <LibJS/Runtime/Map.h>
#include <LibJS/Runtime/Object.h>
#include <LibJS/Runtime/Value.h>
namespace JS {
class Set : public Object {
JS_OBJECT(Set, Object);
JS_DECLARE_ALLOCATOR(Set);
public:
static NonnullGCPtr<Set> create(Realm&);
virtual void initialize(Realm&) override;
virtual ~Set() override = default;
// NOTE: Unlike what the spec says, we implement Sets using an underlying map,
// so all the functions below do not directly implement the operations as
// defined by the specification.
void set_clear() { m_values->map_clear(); }
bool set_remove(Value const& value) { return m_values->map_remove(value); }
bool set_has(Value const& key) const { return m_values->map_has(key); }
void set_add(Value const& key) { m_values->map_set(key, js_undefined()); }
size_t set_size() const { return m_values->map_size(); }
auto begin() const { return const_cast<Map const&>(*m_values).begin(); }
auto begin() { return m_values->begin(); }
auto end() const { return m_values->end(); }
NonnullGCPtr<Set> copy() const;
private:
explicit Set(Object& prototype);
virtual void visit_edges(Visitor& visitor) override;
GCPtr<Map> m_values;
};
}