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.
38 lines
924 B
C++
38 lines
924 B
C++
/*
|
|
* Copyright (c) 2020, Matthew Olsson <mattco@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <LibJS/Runtime/Object.h>
|
|
|
|
namespace JS {
|
|
|
|
class ArrayIterator final : public Object {
|
|
JS_OBJECT(ArrayIterator, Object);
|
|
JS_DECLARE_ALLOCATOR(ArrayIterator);
|
|
|
|
public:
|
|
static NonnullGCPtr<ArrayIterator> create(Realm&, Value array, Object::PropertyKind iteration_kind);
|
|
|
|
virtual ~ArrayIterator() override = default;
|
|
|
|
Value array() const { return m_array; }
|
|
Object::PropertyKind iteration_kind() const { return m_iteration_kind; }
|
|
size_t index() const { return m_index; }
|
|
|
|
private:
|
|
friend class ArrayIteratorPrototype;
|
|
|
|
ArrayIterator(Value array, Object::PropertyKind iteration_kind, Object& prototype);
|
|
|
|
virtual void visit_edges(Cell::Visitor&) override;
|
|
|
|
Value m_array;
|
|
Object::PropertyKind m_iteration_kind;
|
|
size_t m_index { 0 };
|
|
};
|
|
|
|
}
|