mirror of
https://github.com/RGBCube/serenity
synced 2025-05-20 12:05:07 +00:00
bfd354492e
With this change, we now have ~1200 CellAllocators across both LibJS and LibWeb in a normal WebContent instance. This gives us a minimum heap size of 4.7 MiB in the scenario where we only have one cell allocated per type. Of course, in practice there will be many more of each type, so the effective overhead is quite a bit smaller than that in practice. I left a few types unconverted to this mechanism because I got tired of doing this. :^)
68 lines
2.4 KiB
C++
68 lines
2.4 KiB
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <LibJS/Runtime/Array.h>
|
|
#include <LibJS/Runtime/Iterator.h>
|
|
#include <LibWeb/Bindings/Intrinsics.h>
|
|
#include <LibWeb/Bindings/URLSearchParamsIteratorPrototype.h>
|
|
#include <LibWeb/URL/URLSearchParamsIterator.h>
|
|
|
|
namespace Web::Bindings {
|
|
|
|
template<>
|
|
void Intrinsics::create_web_prototype_and_constructor<URLSearchParamsIteratorPrototype>(JS::Realm& realm)
|
|
{
|
|
auto prototype = heap().allocate<URLSearchParamsIteratorPrototype>(realm, realm);
|
|
m_prototypes.set("URLSearchParamsIterator"sv, prototype);
|
|
}
|
|
|
|
}
|
|
|
|
namespace Web::URL {
|
|
|
|
JS_DEFINE_ALLOCATOR(URLSearchParamsIterator);
|
|
|
|
WebIDL::ExceptionOr<JS::NonnullGCPtr<URLSearchParamsIterator>> URLSearchParamsIterator::create(URLSearchParams const& url_search_params, JS::Object::PropertyKind iteration_kind)
|
|
{
|
|
return url_search_params.heap().allocate<URLSearchParamsIterator>(url_search_params.realm(), url_search_params, iteration_kind);
|
|
}
|
|
|
|
URLSearchParamsIterator::URLSearchParamsIterator(URLSearchParams const& url_search_params, JS::Object::PropertyKind iteration_kind)
|
|
: PlatformObject(url_search_params.realm())
|
|
, m_url_search_params(url_search_params)
|
|
, m_iteration_kind(iteration_kind)
|
|
{
|
|
}
|
|
|
|
URLSearchParamsIterator::~URLSearchParamsIterator() = default;
|
|
|
|
void URLSearchParamsIterator::initialize(JS::Realm& realm)
|
|
{
|
|
Base::initialize(realm);
|
|
set_prototype(&Bindings::ensure_web_prototype<Bindings::URLSearchParamsIteratorPrototype>(realm, "URLSearchParamsIterator"));
|
|
}
|
|
|
|
void URLSearchParamsIterator::visit_edges(JS::Cell::Visitor& visitor)
|
|
{
|
|
Base::visit_edges(visitor);
|
|
visitor.visit(m_url_search_params);
|
|
}
|
|
|
|
JS::Object* URLSearchParamsIterator::next()
|
|
{
|
|
if (m_index >= m_url_search_params->m_list.size())
|
|
return create_iterator_result_object(vm(), JS::js_undefined(), true);
|
|
|
|
auto& entry = m_url_search_params->m_list[m_index++];
|
|
if (m_iteration_kind == JS::Object::PropertyKind::Key)
|
|
return create_iterator_result_object(vm(), JS::PrimitiveString::create(vm(), entry.name), false);
|
|
else if (m_iteration_kind == JS::Object::PropertyKind::Value)
|
|
return create_iterator_result_object(vm(), JS::PrimitiveString::create(vm(), entry.value), false);
|
|
|
|
return create_iterator_result_object(vm(), JS::Array::create_from(realm(), { JS::PrimitiveString::create(vm(), entry.name), JS::PrimitiveString::create(vm(), entry.value) }), false);
|
|
}
|
|
|
|
}
|