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
|
/*
* Copyright (C) 2023 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include "CachedHTMLCollection.h"
#include "CollectionIndexCacheInlines.h"
#include "CollectionTraversalInlines.h"
#include "HTMLCollectionInlines.h"
#include "TreeScopeInlines.h"
namespace WebCore {
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
CachedHTMLCollection<HTMLCollectionClass, traversalType>::~CachedHTMLCollection()
{
if (m_indexCache.hasValidCache())
document().unregisterCollection(*this);
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
unsigned CachedHTMLCollection<HTMLCollectionClass, traversalType>::length() const
{
return m_indexCache.nodeCount(collection());
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
Element* CachedHTMLCollection<HTMLCollectionClass, traversalType>::item(unsigned offset) const
{
return m_indexCache.nodeAt(collection(), offset);
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
size_t CachedHTMLCollection<HTMLCollectionClass, traversalType>::memoryCost() const
{
// memoryCost() may be invoked concurrently from a GC thread, and we need to be careful about what data we access here and how.
// Accessing m_indexCache.memoryCost() is safe because because it doesn't involve any pointer chasing.
// HTMLCollection::memoryCost() ensures its own thread safety.
return m_indexCache.memoryCost() + HTMLCollection::memoryCost();
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
void CachedHTMLCollection<HTMLCollectionClass, traversalType>::invalidateCacheForDocument(Document& document)
{
HTMLCollection::invalidateCacheForDocument(document);
if (m_indexCache.hasValidCache()) {
document.unregisterCollection(*this);
m_indexCache.invalidate();
}
}
static inline bool nameShouldBeVisibleInDocumentAll(HTMLElement& element)
{
// https://html.spec.whatwg.org/multipage/infrastructure.html#all-named-elements
return element.hasTagName(HTMLNames::aTag)
|| element.hasTagName(HTMLNames::buttonTag)
|| element.hasTagName(HTMLNames::embedTag)
|| element.hasTagName(HTMLNames::formTag)
|| element.hasTagName(HTMLNames::frameTag)
|| element.hasTagName(HTMLNames::framesetTag)
|| element.hasTagName(HTMLNames::iframeTag)
|| element.hasTagName(HTMLNames::imgTag)
|| element.hasTagName(HTMLNames::inputTag)
|| element.hasTagName(HTMLNames::mapTag)
|| element.hasTagName(HTMLNames::metaTag)
|| element.hasTagName(HTMLNames::objectTag)
|| element.hasTagName(HTMLNames::selectTag)
|| element.hasTagName(HTMLNames::textareaTag);
}
static inline bool nameShouldBeVisibleInDocumentAll(Element& element)
{
auto* htmlElement = dynamicDowncast<HTMLElement>(element);
return htmlElement && nameShouldBeVisibleInDocumentAll(*htmlElement);
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
Element* CachedHTMLCollection<HTMLCollectionClass, traversalType>::namedItem(const AtomString& name) const
{
// http://msdn.microsoft.com/workshop/author/dhtml/reference/methods/nameditem.asp
// This method first searches for an object with a matching id
// attribute. If a match is not found, the method then searches for an
// object with a matching name attribute, but only on those elements
// that are allowed a name attribute.
if (name.isEmpty())
return nullptr;
ContainerNode& root = rootNode();
if (traversalType != CollectionTraversalType::CustomForwardOnly && root.isInTreeScope()) {
RefPtr<Element> candidate;
TreeScope& treeScope = root.treeScope();
if (treeScope.hasElementWithId(name)) {
if (!treeScope.containsMultipleElementsWithId(name))
candidate = treeScope.getElementById(name);
} else if (treeScope.hasElementWithName(name)) {
if (!treeScope.containsMultipleElementsWithName(name)) {
if ((candidate = treeScope.getElementByName(name))) {
if (!is<HTMLElement>(*candidate))
candidate = nullptr;
else if (type() == CollectionType::DocAll && !nameShouldBeVisibleInDocumentAll(*candidate))
candidate = nullptr;
}
}
} else
return nullptr;
if (candidate && collection().elementMatches(*candidate)) {
if (traversalType == CollectionTraversalType::ChildrenOnly ? candidate->parentNode() == &root : candidate->isDescendantOf(root))
return candidate.get();
}
}
return namedItemSlow(name);
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
auto CachedHTMLCollection<HTMLCollectionClass, traversalType>::collectionBegin() const -> Iterator
{
return Traversal::begin(collection(), rootNode());
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
auto CachedHTMLCollection<HTMLCollectionClass, traversalType>::collectionLast() const -> Iterator
{
return Traversal::last(collection(), rootNode());
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
void CachedHTMLCollection<HTMLCollectionClass, traversalType>::collectionTraverseForward(Iterator& current, unsigned count, unsigned& traversedCount) const
{
Traversal::traverseForward(collection(), current, count, traversedCount);
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
void CachedHTMLCollection<HTMLCollectionClass, traversalType>::collectionTraverseBackward(Iterator& current, unsigned count) const
{
Traversal::traverseBackward(collection(), current, count);
}
template <typename HTMLCollectionClass, CollectionTraversalType traversalType>
bool CachedHTMLCollection<HTMLCollectionClass, traversalType>::collectionCanTraverseBackward() const
{
return traversalType != CollectionTraversalType::CustomForwardOnly;
}
}
|
