ladybird/Libraries/LibWeb/CSS/CustomPropertyData.cpp
Andreas Kling 9e8e568b43 LibWeb: Use structural sharing for CSS custom properties
Replace per-element OrderedHashMap storage for custom properties with
a RefCounted chain (CustomPropertyData) that enables structural
sharing. Each chain node stores only the properties declared directly
on its element, with a parent pointer to the inherited chain.

Elements that don't override any custom properties share the parent's
data directly (just a RefPtr copy). During cascade, only entries that
actually differ from the parent are stored in own_values - the rest
are inherited through the chain. During var() resolution, resolved
values are compared against the parent's and matching entries are
dropped, enabling further sharing.

The chain uses a depth limit (max 32) with flattening, plus
absorption of small parent nodes (threshold 8) to keep lookups fast.

This reduces custom property memory from ~79 MB to ~5.7 MB on
cloudflare.com.
2026-02-13 14:57:15 +01:00

76 lines
2.6 KiB
C++

/*
* Copyright (c) 2026, Andreas Kling <andreas@ladybird.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <LibWeb/CSS/CustomPropertyData.h>
#include <LibWeb/CSS/StyleValues/StyleValue.h>
namespace Web::CSS {
static constexpr u8 max_ancestor_count = 32;
static constexpr size_t absorb_threshold = 8;
CustomPropertyData::CustomPropertyData(OrderedHashMap<FlyString, StyleProperty> own_values, RefPtr<CustomPropertyData const> parent, u8 ancestor_count)
: m_own_values(move(own_values))
, m_parent(move(parent))
, m_ancestor_count(ancestor_count)
{
}
NonnullRefPtr<CustomPropertyData> CustomPropertyData::create(
OrderedHashMap<FlyString, StyleProperty> own_values,
RefPtr<CustomPropertyData const> parent)
{
if (!parent)
return adopt_ref(*new CustomPropertyData(move(own_values), nullptr, 0));
// If parent chain is too deep, flatten by copying all ancestor values into own.
if (parent->m_ancestor_count >= max_ancestor_count - 1) {
parent->for_each_property([&](FlyString const& name, StyleProperty const& property) {
own_values.ensure(name, [&] { return property; });
});
return adopt_ref(*new CustomPropertyData(move(own_values), nullptr, 0));
}
// If parent has few own values, absorb them to shorten the chain.
if (parent->m_own_values.size() <= absorb_threshold) {
for (auto const& [name, property] : parent->m_own_values)
own_values.ensure(name, [&] { return property; });
auto grandparent = parent->m_parent;
u8 ancestor_count = grandparent ? grandparent->m_ancestor_count + 1 : 0;
return adopt_ref(*new CustomPropertyData(move(own_values), move(grandparent), ancestor_count));
}
u8 ancestor_count = parent->m_ancestor_count + 1;
return adopt_ref(*new CustomPropertyData(move(own_values), move(parent), ancestor_count));
}
StyleProperty const* CustomPropertyData::get(FlyString const& name) const
{
if (auto it = m_own_values.find(name); it != m_own_values.end())
return &it->value;
if (m_parent)
return m_parent->get(name);
return nullptr;
}
void CustomPropertyData::for_each_property(Function<void(FlyString const&, StyleProperty const&)> callback) const
{
HashTable<FlyString> seen;
for (auto const* node = this; node; node = node->m_parent.ptr()) {
for (auto const& [name, property] : node->m_own_values) {
if (seen.set(name) == HashSetResult::KeptExistingEntry)
continue;
callback(name, property);
}
}
}
bool CustomPropertyData::is_empty() const
{
return m_own_values.is_empty() && (!m_parent || m_parent->is_empty());
}
}