1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
* Copyright (C) 2004-2018 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#pragma once
#include "CollectionType.h"
#include "Node.h"
namespace WebCore {
class HTMLCollection;
class RadioNodeList;
class RenderElement;
class ContainerNode : public Node {
WTF_MAKE_TZONE_OR_ISO_ALLOCATED(ContainerNode);
WTF_OVERRIDE_DELETE_FOR_CHECKED_PTR(ContainerNode);
public:
virtual ~ContainerNode();
Node* firstChild() const { return m_firstChild.get(); }
RefPtr<Node> protectedFirstChild() const { return m_firstChild.get(); }
static constexpr ptrdiff_t firstChildMemoryOffset() { return OBJECT_OFFSETOF(ContainerNode, m_firstChild); }
Node* lastChild() const { return m_lastChild.get(); }
RefPtr<Node> protectedLastChild() const { return m_lastChild.get(); }
static constexpr ptrdiff_t lastChildMemoryOffset() { return OBJECT_OFFSETOF(ContainerNode, m_lastChild); }
bool hasChildNodes() const { return m_firstChild.get(); }
bool hasOneChild() const { return m_firstChild && m_firstChild == m_lastChild; }
bool directChildNeedsStyleRecalc() const { return hasStyleFlag(NodeStyleFlag::DirectChildNeedsStyleResolution); }
void setDirectChildNeedsStyleRecalc() { setStyleFlag(NodeStyleFlag::DirectChildNeedsStyleResolution); }
WEBCORE_EXPORT unsigned countChildNodes() const;
WEBCORE_EXPORT Node* traverseToChildAt(unsigned) const;
ExceptionOr<void> insertBefore(Node& newChild, RefPtr<Node>&& refChild);
ExceptionOr<void> replaceChild(Node& newChild, Node& oldChild);
WEBCORE_EXPORT ExceptionOr<void> removeChild(Node& child);
WEBCORE_EXPORT ExceptionOr<void> appendChild(Node& newChild);
void stringReplaceAll(String&&);
void replaceAll(Node*);
ContainerNode& rootNode() const;
Ref<ContainerNode> protectedRootNode() const { return rootNode(); }
ContainerNode& traverseToRootNode() const;
// These methods are only used during parsing.
// They don't send DOM mutation events or handle reparenting.
// However, arbitrary code may be run by beforeload handlers.
void parserAppendChild(Node&);
void parserAppendChildIntoIsolatedTree(Node&);
void parserNotifyChildrenChanged();
void parserRemoveChild(Node&);
void parserInsertBefore(Node& newChild, Node& refChild);
WEBCORE_EXPORT void removeChildren();
void takeAllChildrenFrom(ContainerNode*);
void cloneChildNodes(Document&, CustomElementRegistry*, ContainerNode& clone, size_t currentDepth = 0);
enum class CanDelayNodeDeletion : uint8_t { No, Yes, Unknown };
struct ChildChange {
enum class Type : uint8_t { ElementInserted, ElementRemoved, TextInserted, TextRemoved, TextChanged, AllChildrenRemoved, NonContentsChildRemoved, NonContentsChildInserted, AllChildrenReplaced };
enum class Source : uint8_t { Parser, API, Clone };
enum class AffectsElements : uint8_t { Unknown, No, Yes };
ChildChange::Type type;
// Making these raw pointers RefPtr leads to a Speedometer 3 regression.
SUPPRESS_UNCOUNTED_MEMBER Element* siblingChanged;
SUPPRESS_UNCOUNTED_MEMBER Element* previousSiblingElement;
SUPPRESS_UNCOUNTED_MEMBER Element* nextSiblingElement;
ChildChange::Source source;
AffectsElements affectsElements;
bool isInsertion() const
{
switch (type) {
case ChildChange::Type::ElementInserted:
case ChildChange::Type::TextInserted:
case ChildChange::Type::NonContentsChildInserted:
case ChildChange::Type::AllChildrenReplaced:
return true;
case ChildChange::Type::ElementRemoved:
case ChildChange::Type::TextRemoved:
case ChildChange::Type::TextChanged:
case ChildChange::Type::AllChildrenRemoved:
case ChildChange::Type::NonContentsChildRemoved:
return false;
}
ASSERT_NOT_REACHED();
return false;
}
};
virtual void childrenChanged(const ChildChange&);
ExceptionOr<void> appendChild(ChildChange::Source, Node& newChild);
void disconnectDescendantFrames();
inline RenderElement* renderer() const; // Defined in RenderElement.h.
inline CheckedPtr<RenderElement> checkedRenderer() const; // Defined in RenderElement.h.
// Return a bounding box in absolute coordinates enclosing this node and all its descendants.
// This gives the area within which events may get handled by a hander registered on this node.
virtual LayoutRect absoluteEventHandlerBounds(bool& /* includesFixedPositionElements */) { return LayoutRect(); }
WEBCORE_EXPORT ExceptionOr<Element*> querySelector(const String& selectors);
WEBCORE_EXPORT ExceptionOr<Ref<NodeList>> querySelectorAll(const String& selectors);
WEBCORE_EXPORT Ref<HTMLCollection> getElementsByTagName(const AtomString&);
WEBCORE_EXPORT Ref<HTMLCollection> getElementsByTagNameNS(const AtomString& namespaceURI, const AtomString& localName);
WEBCORE_EXPORT Ref<HTMLCollection> getElementsByClassName(const AtomString& classNames);
Ref<RadioNodeList> radioNodeList(const AtomString&);
// From the ParentNode interface - https://dom.spec.whatwg.org/#interface-parentnode
WEBCORE_EXPORT Ref<HTMLCollection> children();
WEBCORE_EXPORT Element* firstElementChild() const;
WEBCORE_EXPORT Element* lastElementChild() const;
WEBCORE_EXPORT unsigned childElementCount() const;
ExceptionOr<void> append(FixedVector<NodeOrString>&&);
ExceptionOr<void> prepend(FixedVector<NodeOrString>&&);
ExceptionOr<void> replaceChildren(FixedVector<NodeOrString>&&);
ExceptionOr<void> ensurePreInsertionValidity(Node& newChild, Node* refChild);
ExceptionOr<void> ensurePreInsertionValidityForPhantomDocumentFragment(NodeVector& newChildren, Node* refChild = nullptr);
ExceptionOr<void> insertChildrenBeforeWithoutPreInsertionValidityCheck(NodeVector&&, Node* nextChild = nullptr);
protected:
explicit ContainerNode(Document&, NodeType, OptionSet<TypeFlag> = { });
friend void removeDetachedChildrenInContainer(ContainerNode&);
void removeDetachedChildren();
void setFirstChild(Node* child) { m_firstChild = child; }
void setLastChild(Node* child) { m_lastChild = child; }
HTMLCollection* cachedHTMLCollection(CollectionType);
private:
void executePreparedChildrenRemoval();
enum class DeferChildrenChanged : bool { No, Yes };
enum class DidRemoveElements : bool { No, Yes };
struct RemoveAllChildrenResult {
unsigned subTreeSize;
DidRemoveElements didRemoveElements;
CanDelayNodeDeletion canBeDelayed;
};
RemoveAllChildrenResult removeAllChildrenWithScriptAssertionMaybeAsync(ChildChange::Source, NodeVector& children, DeferChildrenChanged = DeferChildrenChanged::No);
RemoveAllChildrenResult removeAllChildrenWithScriptAssertion(ChildChange::Source, NodeVector& children, DeferChildrenChanged = DeferChildrenChanged::No);
bool removeNodeWithScriptAssertion(Node&, ChildChange::Source);
ExceptionOr<void> removeSelfOrChildNodesForInsertion(Node&, NodeVector&);
void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);
ExceptionOr<void> appendChildWithoutPreInsertionValidityCheck(Node&);
void insertBeforeCommon(Node& nextChild, Node& oldChild);
void appendChildCommon(Node&);
void rebuildSVGExtensionsElementsIfNecessary();
bool isContainerNode() const = delete;
CheckedPtr<Node> m_firstChild;
CheckedPtr<Node> m_lastChild;
};
inline ContainerNode::ContainerNode(Document& document, NodeType type, OptionSet<TypeFlag> typeFlags)
: Node(document, type, typeFlags | TypeFlag::IsContainerNode)
{
ASSERT(!isTextNode());
}
inline unsigned Node::countChildNodes() const
{
auto* containerNode = dynamicDowncast<ContainerNode>(*this);
return containerNode ? containerNode->countChildNodes() : 0;
}
inline Node* Node::traverseToChildAt(unsigned index) const
{
auto* containerNode = dynamicDowncast<ContainerNode>(*this);
return containerNode ? containerNode->traverseToChildAt(index) : nullptr;
}
inline Node* Node::firstChild() const
{
auto* containerNode = dynamicDowncast<ContainerNode>(*this);
return containerNode ? containerNode->firstChild() : nullptr;
}
inline RefPtr<Node> Node::protectedFirstChild() const
{
return firstChild();
}
inline Node* Node::lastChild() const
{
auto* containerNode = dynamicDowncast<ContainerNode>(*this);
return containerNode ? containerNode->lastChild() : nullptr;
}
inline RefPtr<Node> Node::protectedLastChild() const
{
return lastChild();
}
inline bool Node::hasChildNodes() const
{
return firstChild();
}
inline ContainerNode& TreeScope::rootNode() const
{
return m_rootNode.get();
}
inline Node& Node::rootNode() const
{
if (isInTreeScope())
return treeScope().rootNode();
return traverseToRootNode();
}
inline ContainerNode& ContainerNode::rootNode() const
{
if (isInTreeScope())
return treeScope().rootNode();
return traverseToRootNode();
}
inline void collectChildNodes(Node& node, NodeVector& children)
{
for (SUPPRESS_UNCOUNTED_LOCAL Node* child = node.firstChild(); child; child = child->nextSibling())
children.append(*child);
}
inline void Node::setParentNode(ContainerNode* parent)
{
ASSERT(isMainThread());
m_parentNode = parent;
m_refCountAndParentBit = (m_refCountAndParentBit & s_refCountMask) | !!parent;
}
inline RefPtr<ContainerNode> Node::protectedParentNode() const
{
return parentNode();
}
} // namespace WebCore
SPECIALIZE_TYPE_TRAITS_BEGIN(WebCore::ContainerNode)
static bool isType(const WebCore::Node& node) { return node.isContainerNode(); }
SPECIALIZE_TYPE_TRAITS_END()
|