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
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* Copyright (C) 2003-2017 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 "CollectionIndexCache.h"
#include "Element.h"
#include "HTMLNames.h"
#include "LiveNodeList.h"
#include <wtf/HashMap.h>
namespace WebCore {
class CollectionNamedElementCache {
WTF_MAKE_FAST_ALLOCATED;
public:
inline const Vector<Element*>* findElementsWithId(const AtomString& id) const;
inline const Vector<Element*>* findElementsWithName(const AtomString& name) const;
const Vector<AtomString>& propertyNames() const { return m_propertyNames; }
inline void appendToIdCache(const AtomString& id, Element&);
inline void appendToNameCache(const AtomString& name, Element&);
inline void didPopulate();
inline size_t memoryCost() const;
private:
typedef HashMap<AtomStringImpl*, Vector<Element*>> StringToElementsMap;
inline const Vector<Element*>* find(const StringToElementsMap&, const AtomString& key) const;
inline void append(StringToElementsMap&, const AtomString& key, Element&);
StringToElementsMap m_idMap;
StringToElementsMap m_nameMap;
Vector<AtomString> m_propertyNames;
#if ASSERT_ENABLED
bool m_didPopulate { false };
#endif
};
// HTMLCollection subclasses NodeList to maintain legacy ObjC API compatibility.
class HTMLCollection : public NodeList {
WTF_MAKE_ISO_ALLOCATED_EXPORT(HTMLCollection, WEBCORE_EXPORT);
public:
WEBCORE_EXPORT virtual ~HTMLCollection();
// DOM API
Element* item(unsigned index) const override = 0; // Tighten return type from NodeList::item().
virtual Element* namedItem(const AtomString& name) const = 0;
const Vector<AtomString>& supportedPropertyNames();
bool isSupportedPropertyName(const AtomString& name);
// Non-DOM API
Vector<Ref<Element>> namedItems(const AtomString& name) const;
size_t memoryCost() const override;
inline bool isRootedAtTreeScope() const;
inline NodeListInvalidationType invalidationType() const;
inline CollectionType type() const;
inline ContainerNode& ownerNode() const;
inline ContainerNode& rootNode() const;
inline void invalidateCacheForAttribute(const QualifiedName& attributeName);
WEBCORE_EXPORT virtual void invalidateCacheForDocument(Document&);
inline void invalidateCache();
inline bool hasNamedElementCache() const;
protected:
HTMLCollection(ContainerNode& base, CollectionType);
WEBCORE_EXPORT virtual void updateNamedElementCache() const;
WEBCORE_EXPORT Element* namedItemSlow(const AtomString& name) const;
inline void setNamedItemCache(std::unique_ptr<CollectionNamedElementCache>) const;
inline const CollectionNamedElementCache& namedItemCaches() const;
inline Document& document() const;
void invalidateNamedElementCache(Document&) const;
enum RootType { IsRootedAtNode, IsRootedAtTreeScope };
static RootType rootTypeFromCollectionType(CollectionType);
mutable Lock m_namedElementCacheAssignmentLock;
const unsigned m_collectionType : 5; // CollectionType
const unsigned m_invalidationType : 4; // NodeListInvalidationType
const unsigned m_rootType : 1; // RootType
Ref<ContainerNode> m_ownerNode;
mutable std::unique_ptr<CollectionNamedElementCache> m_namedElementCache;
};
inline size_t CollectionNamedElementCache::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.
// It is safe to access m_idMap.size(), m_nameMap.size(), and m_propertyNames.size() because they don't chase pointers.
return (m_idMap.size() + m_nameMap.size()) * sizeof(Element*) + m_propertyNames.size() * sizeof(AtomString);
}
inline ContainerNode& HTMLCollection::ownerNode() const
{
return m_ownerNode;
}
} // namespace WebCore
#define SPECIALIZE_TYPE_TRAITS_HTMLCOLLECTION(ClassName, Type) \
SPECIALIZE_TYPE_TRAITS_BEGIN(WebCore::ClassName) \
static bool isType(const WebCore::HTMLCollection& collection) { return collection.type() == WebCore::Type; } \
SPECIALIZE_TYPE_TRAITS_END()
|
