Files
ladybird/Libraries/LibWeb/DOM/ParentNode.h
Tim Ledbetter 6bb037aec7 LibWeb: Skip backward sibling invalidation when no child needs it
We now track when a parent has a child affected by a backward structural
pseudo-class. These are selectors whose match result for an element can
depend on siblings after that element, such as `:last-child`,
`:only-child`, `:last-of-type`, `:only-of-type`, `:nth-last-child`, and
`:nth-last-of-type`.

When inserting or removing a node, previous siblings only need style
invalidation if one of them was matched against such a selector. Use the
parent-level flag to skip the previous-sibling walk when no child under
that parent can be affected.

This saves a lot of invalidation work on sites that insert a lot of
nodes into the DOM via JS.
2026-04-26 16:14:43 +02:00

98 lines
2.9 KiB
C++

/*
* Copyright (c) 2018-2020, Andreas Kling <andreas@ladybird.org>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <LibWeb/DOM/Node.h>
#include <LibWeb/Export.h>
namespace Web::DOM {
class WEB_API ParentNode : public Node {
WEB_NON_IDL_PLATFORM_OBJECT(ParentNode, Node);
GC_DECLARE_ALLOCATOR(ParentNode);
public:
template<typename F>
void for_each_child(F) const;
template<typename F>
void for_each_child(F);
GC::Ptr<Element> first_element_child();
GC::Ptr<Element> last_element_child();
u32 child_element_count() const;
WebIDL::ExceptionOr<GC::Ptr<Element>> query_selector(StringView);
WebIDL::ExceptionOr<GC::Ref<NodeList>> query_selector_all(StringView);
GC::Ref<HTMLCollection> children();
GC::Ref<HTMLCollection> get_elements_by_tag_name(FlyString const&);
GC::Ref<HTMLCollection> get_elements_by_tag_name_ns(Optional<FlyString>, FlyString const&);
WebIDL::ExceptionOr<void> prepend(Vector<Variant<GC::Root<Node>, Utf16String>> const& nodes);
WebIDL::ExceptionOr<void> append(Vector<Variant<GC::Root<Node>, Utf16String>> const& nodes);
WebIDL::ExceptionOr<void> replace_children(Vector<Variant<GC::Root<Node>, Utf16String>> const& nodes);
WebIDL::ExceptionOr<void> move_before(GC::Ref<Node> node, GC::Ptr<Node> child);
GC::Ref<HTMLCollection> get_elements_by_class_name(StringView);
GC::Ptr<Element> get_element_by_id(FlyString const& id) const;
bool has_child_affected_by_backward_structural_changes() const { return m_has_child_affected_by_backward_structural_changes; }
void set_has_child_affected_by_backward_structural_changes(bool value) { m_has_child_affected_by_backward_structural_changes = value; }
protected:
ParentNode(JS::Realm& realm, Document& document, NodeType type)
: Node(realm, document, type)
{
}
ParentNode(Document& document, NodeType type)
: Node(document, type)
{
}
virtual void visit_edges(Cell::Visitor&) override;
private:
GC::Ptr<HTMLCollection> m_children;
bool m_has_child_affected_by_backward_structural_changes { false };
};
template<>
inline bool Node::fast_is<ParentNode>() const { return is_parent_node(); }
template<typename U>
inline U* Node::first_flat_tree_ancestor_of_type()
{
for (auto* ancestor = flat_tree_parent(); ancestor; ancestor = ancestor->flat_tree_parent()) {
if (is<U>(*ancestor))
return &as<U>(*ancestor);
}
return nullptr;
}
template<typename Callback>
inline void ParentNode::for_each_child(Callback callback) const
{
for (auto* node = first_child(); node; node = node->next_sibling()) {
if (callback(*node) == IterationDecision::Break)
return;
}
}
template<typename Callback>
inline void ParentNode::for_each_child(Callback callback)
{
for (auto* node = first_child(); node; node = node->next_sibling()) {
if (callback(*node) == IterationDecision::Break)
return;
}
}
}