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.
68 lines
2.2 KiB
C++
68 lines
2.2 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
* Copyright (c) 2020-2022, Linus Groh <linusg@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Assertions.h>
|
|
#include <AK/Concepts.h>
|
|
#include <AK/Function.h>
|
|
#include <AK/Span.h>
|
|
#include <AK/Vector.h>
|
|
#include <LibJS/Runtime/Completion.h>
|
|
#include <LibJS/Runtime/GlobalObject.h>
|
|
#include <LibJS/Runtime/Object.h>
|
|
#include <LibJS/Runtime/VM.h>
|
|
|
|
namespace JS {
|
|
|
|
class Array : public Object {
|
|
JS_OBJECT(Array, Object);
|
|
JS_DECLARE_ALLOCATOR(Array);
|
|
|
|
public:
|
|
static ThrowCompletionOr<NonnullGCPtr<Array>> create(Realm&, u64 length, Object* prototype = nullptr);
|
|
static NonnullGCPtr<Array> create_from(Realm&, Vector<Value> const&);
|
|
|
|
// Non-standard but equivalent to CreateArrayFromList.
|
|
template<typename T>
|
|
static NonnullGCPtr<Array> create_from(Realm& realm, ReadonlySpan<T> elements, Function<Value(T const&)> map_fn)
|
|
{
|
|
auto values = MarkedVector<Value> { realm.heap() };
|
|
values.ensure_capacity(elements.size());
|
|
for (auto const& element : elements)
|
|
values.append(map_fn(element));
|
|
|
|
return Array::create_from(realm, values);
|
|
}
|
|
|
|
virtual ~Array() override = default;
|
|
|
|
virtual ThrowCompletionOr<Optional<PropertyDescriptor>> internal_get_own_property(PropertyKey const&) const override final;
|
|
virtual ThrowCompletionOr<bool> internal_define_own_property(PropertyKey const&, PropertyDescriptor const&) override final;
|
|
virtual ThrowCompletionOr<bool> internal_delete(PropertyKey const&) override final;
|
|
virtual ThrowCompletionOr<MarkedVector<Value>> internal_own_property_keys() const override final;
|
|
|
|
[[nodiscard]] bool length_is_writable() const { return m_length_writable; }
|
|
|
|
protected:
|
|
explicit Array(Object& prototype);
|
|
|
|
private:
|
|
ThrowCompletionOr<bool> set_length(PropertyDescriptor const&);
|
|
|
|
bool m_length_writable { true };
|
|
};
|
|
|
|
enum class Holes {
|
|
SkipHoles,
|
|
ReadThroughHoles,
|
|
};
|
|
|
|
ThrowCompletionOr<MarkedVector<Value>> sort_indexed_properties(VM&, Object const&, size_t length, Function<ThrowCompletionOr<double>(Value, Value)> const& sort_compare, Holes holes);
|
|
ThrowCompletionOr<double> compare_array_elements(VM&, Value x, Value y, FunctionObject* comparefn);
|
|
|
|
}
|