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
|
/*
* 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:
*
* 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.
* 3. 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 "config.h"
#include "core/dom/custom/CustomElement.h"
#include "core/HTMLNames.h"
#include "core/MathMLNames.h"
#include "core/SVGNames.h"
#include "core/dom/Document.h"
#include "core/dom/Element.h"
#include "core/dom/custom/CustomElementMicrotaskRunQueue.h"
#include "core/dom/custom/CustomElementObserver.h"
#include "core/dom/custom/CustomElementScheduler.h"
namespace blink {
CustomElementMicrotaskImportStep* CustomElement::didCreateImport(HTMLImportChild* import)
{
return CustomElementScheduler::scheduleImport(import);
}
void CustomElement::didFinishLoadingImport(Document& master)
{
master.customElementMicrotaskRunQueue()->requestDispatchIfNeeded();
}
Vector<AtomicString>& CustomElement::embedderCustomElementNames()
{
DEFINE_STATIC_LOCAL(Vector<AtomicString>, names, ());
return names;
}
void CustomElement::addEmbedderCustomElementName(const AtomicString& name)
{
AtomicString lower = name.lower();
if (isValidName(lower, EmbedderNames))
return;
embedderCustomElementNames().append(lower);
}
static inline bool isValidNCName(const AtomicString& name)
{
if (kNotFound != name.find(':'))
return false;
if (!name.string().is8Bit()) {
const UChar32 c = name.characters16()[0];
// These characters comes under CombiningChar in NCName and according to
// NCName only BaseChar and Ideodgraphic can come as first chars.
// Also these characters come under Letter_Other in UnicodeData, thats
// why they pass as valid document name.
if (c == 0x0B83 || c == 0x0F88 || c == 0x0F89 || c == 0x0F8A || c == 0x0F8B)
return false;
}
return Document::isValidName(name.string());
}
bool CustomElement::isValidName(const AtomicString& name, NameSet validNames)
{
if ((validNames & EmbedderNames) && kNotFound != embedderCustomElementNames().find(name))
return Document::isValidName(name);
if ((validNames & StandardNames) && kNotFound != name.find('-')) {
DEFINE_STATIC_LOCAL(Vector<AtomicString>, reservedNames, ());
if (reservedNames.isEmpty()) {
// FIXME(crbug.com/426605): We should be able to remove this.
reservedNames.append(MathMLNames::annotation_xmlTag.localName());
}
if (kNotFound == reservedNames.find(name))
return isValidNCName(name);
}
return false;
}
void CustomElement::define(Element* element, PassRefPtrWillBeRawPtr<CustomElementDefinition> passDefinition)
{
RefPtrWillBeRawPtr<CustomElementDefinition> definition(passDefinition);
switch (element->customElementState()) {
case Element::NotCustomElement:
case Element::Upgraded:
ASSERT_NOT_REACHED();
break;
case Element::WaitingForUpgrade:
element->setCustomElementDefinition(definition);
CustomElementScheduler::scheduleCallback(definition->callbacks(), element, CustomElementLifecycleCallbacks::CreatedCallback);
break;
}
}
void CustomElement::attributeDidChange(Element* element, const AtomicString& name, const AtomicString& oldValue, const AtomicString& newValue)
{
ASSERT(element->customElementState() == Element::Upgraded);
CustomElementScheduler::scheduleAttributeChangedCallback(element->customElementDefinition()->callbacks(), element, name, oldValue, newValue);
}
void CustomElement::didAttach(Element* element, const Document& document)
{
ASSERT(element->customElementState() == Element::Upgraded);
if (!document.domWindow())
return;
CustomElementScheduler::scheduleCallback(element->customElementDefinition()->callbacks(), element, CustomElementLifecycleCallbacks::AttachedCallback);
}
void CustomElement::didDetach(Element* element, const Document& document)
{
ASSERT(element->customElementState() == Element::Upgraded);
if (!document.domWindow())
return;
CustomElementScheduler::scheduleCallback(element->customElementDefinition()->callbacks(), element, CustomElementLifecycleCallbacks::DetachedCallback);
}
void CustomElement::wasDestroyed(Element* element)
{
switch (element->customElementState()) {
case Element::NotCustomElement:
ASSERT_NOT_REACHED();
break;
case Element::WaitingForUpgrade:
case Element::Upgraded:
CustomElementObserver::notifyElementWasDestroyed(element);
break;
}
}
} // namespace blink
|
