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
|
/*
* Copyright (C) 2013 Google 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
* OWNER OR 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.
*/
#include "core/dom/custom/V0CustomElementUpgradeCandidateMap.h"
#include "core/dom/Element.h"
namespace blink {
V0CustomElementUpgradeCandidateMap*
V0CustomElementUpgradeCandidateMap::create() {
return new V0CustomElementUpgradeCandidateMap();
}
V0CustomElementUpgradeCandidateMap::~V0CustomElementUpgradeCandidateMap() {}
void V0CustomElementUpgradeCandidateMap::add(
const V0CustomElementDescriptor& descriptor,
Element* element) {
observe(element);
UpgradeCandidateMap::AddResult result =
m_upgradeCandidates.add(element, descriptor);
DCHECK(result.isNewEntry);
UnresolvedDefinitionMap::iterator it =
m_unresolvedDefinitions.find(descriptor);
ElementSet* elements;
if (it == m_unresolvedDefinitions.end())
elements = m_unresolvedDefinitions.add(descriptor, new ElementSet())
.storedValue->value.get();
else
elements = it->value.get();
elements->add(element);
}
void V0CustomElementUpgradeCandidateMap::elementWasDestroyed(Element* element) {
V0CustomElementObserver::elementWasDestroyed(element);
UpgradeCandidateMap::iterator candidate = m_upgradeCandidates.find(element);
SECURITY_DCHECK(candidate != m_upgradeCandidates.end());
UnresolvedDefinitionMap::iterator elements =
m_unresolvedDefinitions.find(candidate->value);
SECURITY_DCHECK(elements != m_unresolvedDefinitions.end());
elements->value->remove(element);
m_upgradeCandidates.remove(candidate);
}
V0CustomElementUpgradeCandidateMap::ElementSet*
V0CustomElementUpgradeCandidateMap::takeUpgradeCandidatesFor(
const V0CustomElementDescriptor& descriptor) {
ElementSet* candidates = m_unresolvedDefinitions.take(descriptor);
if (!candidates)
return nullptr;
for (const auto& candidate : *candidates) {
unobserve(candidate);
m_upgradeCandidates.remove(candidate);
}
return candidates;
}
DEFINE_TRACE(V0CustomElementUpgradeCandidateMap) {
visitor->trace(m_upgradeCandidates);
visitor->trace(m_unresolvedDefinitions);
V0CustomElementObserver::trace(visitor);
}
} // namespace blink
|
