3c74dc9f4d
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.
41 lines
1,013 B
C++
41 lines
1,013 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/Object.h>
|
|
#include <LibJS/Runtime/Set.h>
|
|
|
|
namespace JS {
|
|
|
|
class SetIterator final : public Object {
|
|
JS_OBJECT(SetIterator, Object);
|
|
JS_DECLARE_ALLOCATOR(SetIterator);
|
|
|
|
public:
|
|
static NonnullGCPtr<SetIterator> create(Realm&, Set& set, Object::PropertyKind iteration_kind);
|
|
|
|
virtual ~SetIterator() override = default;
|
|
|
|
Set& set() const { return m_set; }
|
|
bool done() const { return m_done; }
|
|
Object::PropertyKind iteration_kind() const { return m_iteration_kind; }
|
|
|
|
private:
|
|
friend class SetIteratorPrototype;
|
|
|
|
explicit SetIterator(Set& set, Object::PropertyKind iteration_kind, Object& prototype);
|
|
|
|
virtual void visit_edges(Cell::Visitor&) override;
|
|
|
|
NonnullGCPtr<Set> m_set;
|
|
bool m_done { false };
|
|
Object::PropertyKind m_iteration_kind;
|
|
Map::ConstIterator m_iterator;
|
|
};
|
|
|
|
}
|