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
|
/*
* Copyright (C) 2008, 2010 Apple Inc. All rights reserved.
* Copyright (C) 2008 David Smith <catfish.man@gmail.com>
*
* 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.
*
*/
#ifndef THIRD_PARTY_BLINK_RENDERER_CORE_DOM_NODE_LISTS_NODE_DATA_H_
#define THIRD_PARTY_BLINK_RENDERER_CORE_DOM_NODE_LISTS_NODE_DATA_H_
#include "base/macros.h"
#include "third_party/blink/renderer/core/dom/child_node_list.h"
#include "third_party/blink/renderer/core/dom/empty_node_list.h"
#include "third_party/blink/renderer/core/dom/qualified_name.h"
#include "third_party/blink/renderer/core/dom/tag_collection.h"
#include "third_party/blink/renderer/core/html/collection_type.h"
#include "third_party/blink/renderer/platform/heap/handle.h"
#include "third_party/blink/renderer/platform/heap/heap.h"
#include "third_party/blink/renderer/platform/wtf/text/atomic_string.h"
#include "third_party/blink/renderer/platform/wtf/text/string_hash.h"
namespace blink {
class NodeListsNodeData final : public GarbageCollected<NodeListsNodeData> {
public:
ChildNodeList* GetChildNodeList(ContainerNode& node) {
DCHECK(!child_node_list_ || node == child_node_list_->VirtualOwnerNode());
return To<ChildNodeList>(child_node_list_.Get());
}
ChildNodeList* EnsureChildNodeList(ContainerNode& node) {
if (child_node_list_)
return To<ChildNodeList>(child_node_list_.Get());
auto* list = MakeGarbageCollected<ChildNodeList>(node);
child_node_list_ = list;
return list;
}
EmptyNodeList* EnsureEmptyChildNodeList(Node& node) {
if (child_node_list_)
return To<EmptyNodeList>(child_node_list_.Get());
auto* list = MakeGarbageCollected<EmptyNodeList>(node);
child_node_list_ = list;
return list;
}
using NamedNodeListKey = std::pair<CollectionType, AtomicString>;
struct NodeListAtomicCacheMapEntryHash {
STATIC_ONLY(NodeListAtomicCacheMapEntryHash);
static unsigned GetHash(const NamedNodeListKey& entry) {
return DefaultHash<AtomicString>::Hash::GetHash(
entry.second == CSSSelector::UniversalSelectorAtom()
? g_star_atom
: entry.second) +
entry.first;
}
static bool Equal(const NamedNodeListKey& a, const NamedNodeListKey& b) {
return a == b;
}
static const bool safe_to_compare_to_empty_or_deleted =
DefaultHash<AtomicString>::Hash::safe_to_compare_to_empty_or_deleted;
};
typedef HeapHashMap<NamedNodeListKey,
Member<LiveNodeListBase>,
NodeListAtomicCacheMapEntryHash>
NodeListAtomicNameCacheMap;
typedef HeapHashMap<QualifiedName, Member<TagCollectionNS>>
TagCollectionNSCache;
template <typename T>
T* AddCache(ContainerNode& node,
CollectionType collection_type,
const AtomicString& name) {
NodeListAtomicNameCacheMap::AddResult result = atomic_name_caches_.insert(
std::make_pair(collection_type, name), nullptr);
if (!result.is_new_entry) {
return static_cast<T*>(result.stored_value->value.Get());
}
auto* list = MakeGarbageCollected<T>(node, collection_type, name);
result.stored_value->value = list;
return list;
}
template <typename T>
T* AddCache(ContainerNode& node, CollectionType collection_type) {
NodeListAtomicNameCacheMap::AddResult result = atomic_name_caches_.insert(
NamedNodeListKey(collection_type, CSSSelector::UniversalSelectorAtom()),
nullptr);
if (!result.is_new_entry) {
return static_cast<T*>(result.stored_value->value.Get());
}
auto* list = MakeGarbageCollected<T>(node, collection_type);
result.stored_value->value = list;
return list;
}
template <typename T>
T* Cached(CollectionType collection_type) {
return static_cast<T*>(atomic_name_caches_.at(NamedNodeListKey(
collection_type, CSSSelector::UniversalSelectorAtom())));
}
TagCollectionNS* AddCache(ContainerNode& node,
const AtomicString& namespace_uri,
const AtomicString& local_name) {
QualifiedName name(g_null_atom, local_name, namespace_uri);
TagCollectionNSCache::AddResult result =
tag_collection_ns_caches_.insert(name, nullptr);
if (!result.is_new_entry)
return result.stored_value->value;
auto* list = MakeGarbageCollected<TagCollectionNS>(
node, kTagCollectionNSType, namespace_uri, local_name);
result.stored_value->value = list;
return list;
}
NodeListsNodeData() : child_node_list_(nullptr) {}
void InvalidateCaches(const QualifiedName* attr_name = nullptr);
bool IsEmpty() const {
return !child_node_list_ && atomic_name_caches_.IsEmpty() &&
tag_collection_ns_caches_.IsEmpty();
}
void AdoptTreeScope() { InvalidateCaches(); }
void AdoptDocument(Document& old_document, Document& new_document) {
DCHECK_NE(old_document, new_document);
NodeListAtomicNameCacheMap::const_iterator atomic_name_cache_end =
atomic_name_caches_.end();
for (NodeListAtomicNameCacheMap::const_iterator it =
atomic_name_caches_.begin();
it != atomic_name_cache_end; ++it) {
LiveNodeListBase* list = it->value;
list->DidMoveToDocument(old_document, new_document);
}
TagCollectionNSCache::const_iterator tag_end =
tag_collection_ns_caches_.end();
for (TagCollectionNSCache::const_iterator it =
tag_collection_ns_caches_.begin();
it != tag_end; ++it) {
LiveNodeListBase* list = it->value;
DCHECK(!list->IsRootedAtTreeScope());
list->DidMoveToDocument(old_document, new_document);
}
}
void Trace(Visitor*);
private:
// Can be a ChildNodeList or an EmptyNodeList.
Member<NodeList> child_node_list_;
NodeListAtomicNameCacheMap atomic_name_caches_;
TagCollectionNSCache tag_collection_ns_caches_;
DISALLOW_COPY_AND_ASSIGN(NodeListsNodeData);
};
template <typename Collection>
inline Collection* ContainerNode::EnsureCachedCollection(CollectionType type) {
return EnsureNodeLists().AddCache<Collection>(*this, type);
}
template <typename Collection>
inline Collection* ContainerNode::EnsureCachedCollection(
CollectionType type,
const AtomicString& name) {
return EnsureNodeLists().AddCache<Collection>(*this, type, name);
}
template <typename Collection>
inline Collection* ContainerNode::EnsureCachedCollection(
CollectionType type,
const AtomicString& namespace_uri,
const AtomicString& local_name) {
DCHECK_EQ(type, kTagCollectionNSType);
return EnsureNodeLists().AddCache(*this, namespace_uri, local_name);
}
template <typename Collection>
inline Collection* ContainerNode::CachedCollection(CollectionType type) {
NodeListsNodeData* node_lists = NodeLists();
return node_lists ? node_lists->Cached<Collection>(type) : nullptr;
}
} // namespace blink
#endif // THIRD_PARTY_BLINK_RENDERER_CORE_DOM_NODE_LISTS_NODE_DATA_H_
|
