ladybird/Libraries/LibWeb/DOM/ShadowRoot.h
Sam Atkins 8d401f7a95 LibWeb/DOM: Give ShadowRoots a "part element map"
It maps part names to the elements (or pseudo-elements) that have them.
The spec warns about this concept being expensive to calculate, and it
is: you have to walk the entire subtree. To make that less painful, I'm
keeping it cached on the ShadowRoot and recalculating it if the DOM
tree version has changed since. This will invalidate it more often than
necessary, but it's also simple and shouldn't be able to miss any cases,
so it seems reasonable for now.
2025-12-15 14:12:39 +00:00

171 lines
6.6 KiB
C++
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/*
* Copyright (c) 2020, the SerenityOS developers.
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <LibWeb/Bindings/ShadowRootPrototype.h>
#include <LibWeb/CSS/StyleScope.h>
#include <LibWeb/DOM/DocumentFragment.h>
#include <LibWeb/DOM/ElementByIdMap.h>
#include <LibWeb/Export.h>
#include <LibWeb/WebIDL/ObservableArray.h>
namespace Web::DOM {
class WEB_API ShadowRoot final : public DocumentFragment {
WEB_PLATFORM_OBJECT(ShadowRoot, DocumentFragment);
GC_DECLARE_ALLOCATOR(ShadowRoot);
public:
Bindings::ShadowRootMode mode() const { return m_mode; }
Bindings::SlotAssignmentMode slot_assignment() const { return m_slot_assignment; }
void set_slot_assignment(Bindings::SlotAssignmentMode slot_assignment) { m_slot_assignment = slot_assignment; }
bool delegates_focus() const { return m_delegates_focus; }
void set_delegates_focus(bool delegates_focus) { m_delegates_focus = delegates_focus; }
[[nodiscard]] bool declarative() const { return m_declarative; }
void set_declarative(bool declarative) { m_declarative = declarative; }
[[nodiscard]] bool clonable() const { return m_clonable; }
void set_clonable(bool clonable) { m_clonable = clonable; }
[[nodiscard]] bool serializable() const { return m_serializable; }
void set_serializable(bool serializable) { m_serializable = serializable; }
void set_onslotchange(WebIDL::CallbackType*);
WebIDL::CallbackType* onslotchange();
bool available_to_element_internals() const { return m_available_to_element_internals; }
void set_available_to_element_internals(bool available_to_element_internals) { m_available_to_element_internals = available_to_element_internals; }
// ^EventTarget
virtual EventTarget* get_parent(Event const&) override;
WebIDL::ExceptionOr<TrustedTypes::TrustedHTMLOrString> inner_html() const;
WebIDL::ExceptionOr<void> set_inner_html(TrustedTypes::TrustedHTMLOrString const&);
WebIDL::ExceptionOr<void> set_html_unsafe(TrustedTypes::TrustedHTMLOrString const&);
WebIDL::ExceptionOr<String> get_html(GetHTMLOptions const&) const;
GC::Ptr<Element> active_element();
CSS::StyleSheetList& style_sheets();
CSS::StyleSheetList const& style_sheets() const;
CSS::StyleSheetList* style_sheets_for_bindings() { return &style_sheets(); }
GC::Ref<WebIDL::ObservableArray> adopted_style_sheets() const;
WebIDL::ExceptionOr<void> set_adopted_style_sheets(JS::Value);
void for_each_css_style_sheet(Function<void(CSS::CSSStyleSheet&)>&& callback) const;
void for_each_active_css_style_sheet(Function<void(CSS::CSSStyleSheet&)>&& callback) const;
WebIDL::ExceptionOr<Vector<GC::Ref<Animations::Animation>>> get_animations();
ElementByIdMap& element_by_id() const;
CSS::StyleScope const& style_scope() const { return m_style_scope; }
CSS::StyleScope& style_scope() { return m_style_scope; }
using PartElementMap = HashMap<FlyString, OrderedHashTable<AbstractElement>>;
PartElementMap const& part_element_map() const;
virtual void finalize() override;
protected:
virtual void visit_edges(Cell::Visitor&) override;
private:
ShadowRoot(Document&, Element& host, Bindings::ShadowRootMode);
virtual void initialize(JS::Realm&) override;
// ^Node
virtual FlyString node_name() const override { return "#shadow-root"_fly_string; }
virtual bool is_shadow_root() const final { return true; }
void calculate_part_element_map();
// NOTE: The specification doesn't seem to specify a default value for mode. Assuming closed for now.
Bindings::ShadowRootMode m_mode { Bindings::ShadowRootMode::Closed };
Bindings::SlotAssignmentMode m_slot_assignment { Bindings::SlotAssignmentMode::Named };
bool m_delegates_focus { false };
bool m_available_to_element_internals { false };
// https://dom.spec.whatwg.org/#shadowroot-declarative
bool m_declarative { false };
// https://dom.spec.whatwg.org/#shadowroot-clonable
bool m_clonable { false };
// https://dom.spec.whatwg.org/#shadowroot-serializable
bool m_serializable { false };
mutable OwnPtr<ElementByIdMap> m_element_by_id;
GC::Ptr<CSS::StyleSheetList> m_style_sheets;
mutable GC::Ptr<WebIDL::ObservableArray> m_adopted_style_sheets;
IntrusiveListNode<ShadowRoot> m_list_node;
CSS::StyleScope m_style_scope;
mutable PartElementMap m_part_element_map;
mutable u64 m_dom_tree_version_when_calculated_part_element_map { 0 };
public:
using DocumentShadowRootList = IntrusiveList<&ShadowRoot::m_list_node>;
};
template<>
inline bool Node::fast_is<ShadowRoot>() const { return node_type() == to_underlying(NodeType::DOCUMENT_FRAGMENT_NODE) && is_shadow_root(); }
// https://dom.spec.whatwg.org/#concept-shadow-including-tree-order
// In shadow-including tree order is shadow-including preorder, depth-first traversal of a node tree.
// Shadow-including preorder, depth-first traversal of a node tree tree is preorder, depth-first traversal
// of tree, with for each shadow host encountered in tree, shadow-including preorder, depth-first traversal
// of that elements shadow roots node tree just after it is encountered.
// https://dom.spec.whatwg.org/#concept-shadow-including-descendant
// An object A is a shadow-including descendant of an object B, if A is a descendant of B, or As root is a
// shadow root and As roots host is a shadow-including inclusive descendant of B.
// https://dom.spec.whatwg.org/#concept-shadow-including-inclusive-descendant
// A shadow-including inclusive descendant is an object or one of its shadow-including descendants.
template<typename Callback>
inline TraversalDecision Node::for_each_shadow_including_inclusive_descendant(Callback callback)
{
if (callback(*this) == TraversalDecision::Break)
return TraversalDecision::Break;
if (this->for_each_shadow_including_descendant(callback) == TraversalDecision::Break)
return TraversalDecision::Break;
return TraversalDecision::Continue;
}
template<typename Callback>
inline TraversalDecision Node::for_each_shadow_including_descendant(Callback callback)
{
if (is_element()) {
if (auto shadow_root = static_cast<Element*>(this)->shadow_root()) {
if (shadow_root->for_each_shadow_including_inclusive_descendant(callback) == TraversalDecision::Break)
return TraversalDecision::Break;
}
}
for (auto* child = first_child(); child; child = child->next_sibling()) {
if (child->for_each_shadow_including_inclusive_descendant(callback) == TraversalDecision::Break)
return TraversalDecision::Break;
}
return TraversalDecision::Continue;
}
}