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 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
* Copyright (C) 2015 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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 "ShadowRoot.h"
#include "CSSStyleSheet.h"
#include "ChildListMutationScope.h"
#include "ElementInlines.h"
#include "ElementTraversal.h"
#include "HTMLSlotElement.h"
#if ENABLE(PICTURE_IN_PICTURE_API)
#include "NotImplemented.h"
#endif
#include "RenderElement.h"
#include "SlotAssignment.h"
#include "StyleResolver.h"
#include "StyleScope.h"
#include "StyleSheetList.h"
#include "WebAnimation.h"
#include "markup.h"
#include <wtf/IsoMallocInlines.h>
namespace WebCore {
WTF_MAKE_ISO_ALLOCATED_IMPL(ShadowRoot);
struct SameSizeAsShadowRoot : public DocumentFragment, public TreeScope {
uint8_t flagsAndModes[3];
WeakPtr<Element, WeakPtrImplWithEventTargetData> host;
void* styleSheetList;
void* styleScope;
void* slotAssignment;
std::optional<HashMap<AtomString, AtomString>> partMappings;
};
#if !defined(__m68k__)
static_assert(sizeof(ShadowRoot) == sizeof(SameSizeAsShadowRoot), "shadowroot should stay small");
#if !ASSERT_ENABLED
static_assert(sizeof(WeakPtr<Element, WeakPtrImplWithEventTargetData>) == sizeof(void*), "WeakPtr should be same size as raw pointer");
#endif
#endif
ShadowRoot::ShadowRoot(Document& document, ShadowRootMode mode, SlotAssignmentMode assignmentMode, DelegatesFocus delegatesFocus, Cloneable cloneable, AvailableToElementInternals availableToElementInternals)
: DocumentFragment(document, CreateShadowRoot)
, TreeScope(*this, document)
, m_delegatesFocus(delegatesFocus == DelegatesFocus::Yes)
, m_isCloneable(cloneable == Cloneable::Yes)
, m_availableToElementInternals(availableToElementInternals == AvailableToElementInternals::Yes)
, m_mode(mode)
, m_slotAssignmentMode(assignmentMode)
, m_styleScope(makeUnique<Style::Scope>(*this))
{
if (m_mode == ShadowRootMode::UserAgent)
setNodeFlag(NodeFlag::HasBeenInUserAgentShadowTree);
}
ShadowRoot::ShadowRoot(Document& document, std::unique_ptr<SlotAssignment>&& slotAssignment)
: DocumentFragment(document, CreateShadowRoot)
, TreeScope(*this, document)
, m_mode(ShadowRootMode::UserAgent)
, m_styleScope(makeUnique<Style::Scope>(*this))
, m_slotAssignment(WTFMove(slotAssignment))
{
setNodeFlag(NodeFlag::HasBeenInUserAgentShadowTree);
}
ShadowRoot::~ShadowRoot()
{
if (isConnected())
document().didRemoveInDocumentShadowRoot(*this);
if (m_styleSheetList)
m_styleSheetList->detach();
// We cannot let ContainerNode destructor call willBeDeletedFrom()
// for this ShadowRoot instance because TreeScope destructor
// clears Node::m_treeScope thus ContainerNode is no longer able
// to access it Document reference after that.
willBeDeletedFrom(document());
ASSERT(!m_hasBegunDeletingDetachedChildren);
m_hasBegunDeletingDetachedChildren = true;
// We must remove all of our children first before the TreeScope destructor
// runs so we don't go through Node::setTreeScopeRecursively for each child with a
// destructed tree scope in each descendant.
removeDetachedChildren();
}
Node::InsertedIntoAncestorResult ShadowRoot::insertedIntoAncestor(InsertionType insertionType, ContainerNode& parentOfInsertedTree)
{
DocumentFragment::insertedIntoAncestor(insertionType, parentOfInsertedTree);
if (insertionType.connectedToDocument)
document().didInsertInDocumentShadowRoot(*this);
if (!adoptedStyleSheets().empty() && document().frame())
styleScope().didChangeActiveStyleSheetCandidates();
return InsertedIntoAncestorResult::Done;
}
void ShadowRoot::removedFromAncestor(RemovalType removalType, ContainerNode& oldParentOfRemovedTree)
{
DocumentFragment::removedFromAncestor(removalType, oldParentOfRemovedTree);
if (removalType.disconnectedFromDocument)
document().didRemoveInDocumentShadowRoot(*this);
}
void ShadowRoot::childrenChanged(const ChildChange& childChange)
{
DocumentFragment::childrenChanged(childChange);
if (!m_host || m_mode == ShadowRootMode::UserAgent)
return; // Don't support first-child, nth-of-type, etc... in UA shadow roots as an optimization.
// FIXME: Avoid always invalidating style just for first-child, etc... as done in Element::childrenChanged.
switch (childChange.type) {
case ChildChange::Type::ElementInserted:
case ChildChange::Type::ElementRemoved:
m_host->invalidateStyleForSubtreeInternal();
break;
case ChildChange::Type::TextInserted:
case ChildChange::Type::TextRemoved:
case ChildChange::Type::TextChanged:
case ChildChange::Type::AllChildrenRemoved:
case ChildChange::Type::NonContentsChildRemoved:
case ChildChange::Type::NonContentsChildInserted:
case ChildChange::Type::AllChildrenReplaced:
break;
}
}
void ShadowRoot::moveShadowRootToNewParentScope(TreeScope& newScope, Document& newDocument)
{
auto& oldDocument = documentScope();
setParentTreeScope(newScope);
moveShadowRootToNewDocument(oldDocument, newDocument);
}
void ShadowRoot::moveShadowRootToNewDocument(Document& oldDocument, Document& newDocument)
{
if (oldDocument.templateDocumentHost() != &newDocument && newDocument.templateDocumentHost() != &oldDocument)
setAdoptedStyleSheets({ });
setDocumentScope(newDocument);
RELEASE_ASSERT_WITH_SECURITY_IMPLICATION(!parentTreeScope() || &parentTreeScope()->documentScope() == &newDocument);
// Style scopes are document specific.
m_styleScope = makeUnique<Style::Scope>(*this);
RELEASE_ASSERT_WITH_SECURITY_IMPLICATION(&m_styleScope->document() == &newDocument);
}
Style::Scope& ShadowRoot::styleScope()
{
return *m_styleScope;
}
StyleSheetList& ShadowRoot::styleSheets()
{
if (!m_styleSheetList)
m_styleSheetList = StyleSheetList::create(*this);
return *m_styleSheetList;
}
String ShadowRoot::innerHTML() const
{
return serializeFragment(*this, SerializedNodes::SubtreesOfChildren, nullptr, ResolveURLs::NoExcludingURLsForPrivacy);
}
ExceptionOr<void> ShadowRoot::setInnerHTML(const String& markup)
{
if (markup.isEmpty()) {
ChildListMutationScope mutation(*this);
removeChildren();
return { };
}
auto fragment = createFragmentForInnerOuterHTML(*host(), markup, { ParserContentPolicy::AllowScriptingContent, ParserContentPolicy::AllowPluginContent });
if (fragment.hasException())
return fragment.releaseException();
return replaceChildrenWithFragment(*this, fragment.releaseReturnValue());
}
bool ShadowRoot::childTypeAllowed(NodeType type) const
{
switch (type) {
case ELEMENT_NODE:
case PROCESSING_INSTRUCTION_NODE:
case COMMENT_NODE:
case TEXT_NODE:
case CDATA_SECTION_NODE:
return true;
default:
return false;
}
}
void ShadowRoot::setResetStyleInheritance(bool value)
{
// If this was ever changed after initialization, child styles would need to be invalidated here.
m_resetStyleInheritance = value;
}
Ref<Node> ShadowRoot::cloneNodeInternal(Document& targetDocument, CloningOperation type)
{
RELEASE_ASSERT(m_mode != ShadowRootMode::UserAgent);
switch (type) {
case CloningOperation::SelfWithTemplateContent:
return create(targetDocument, m_mode, m_slotAssignmentMode, m_delegatesFocus ? DelegatesFocus::Yes : DelegatesFocus::No,
m_isCloneable ? Cloneable::Yes : Cloneable::No, m_availableToElementInternals ? AvailableToElementInternals::Yes : AvailableToElementInternals::No);
case CloningOperation::OnlySelf:
case CloningOperation::Everything:
break;
}
RELEASE_ASSERT_NOT_REACHED(); // ShadowRoot is never cloned directly on its own.
return *this;
}
void ShadowRoot::removeAllEventListeners()
{
DocumentFragment::removeAllEventListeners();
for (Node* node = firstChild(); node; node = NodeTraversal::next(*node))
node->removeAllEventListeners();
}
HTMLSlotElement* ShadowRoot::findAssignedSlot(const Node& node)
{
ASSERT(node.parentNode() == host());
if (!m_slotAssignment)
return nullptr;
return m_slotAssignment->findAssignedSlot(node);
}
void ShadowRoot::renameSlotElement(HTMLSlotElement& slot, const AtomString& oldName, const AtomString& newName)
{
ASSERT(m_slotAssignment);
return m_slotAssignment->renameSlotElement(slot, oldName, newName, *this);
}
void ShadowRoot::addSlotElementByName(const AtomString& name, HTMLSlotElement& slot)
{
ASSERT(&slot.rootNode() == this);
if (!m_slotAssignment) {
if (m_slotAssignmentMode == SlotAssignmentMode::Named)
m_slotAssignment = makeUnique<NamedSlotAssignment>();
else
m_slotAssignment = makeUnique<ManualSlotAssignment>();
}
return m_slotAssignment->addSlotElementByName(name, slot, *this);
}
void ShadowRoot::removeSlotElementByName(const AtomString& name, HTMLSlotElement& slot, ContainerNode& oldParentOfRemovedTree)
{
ASSERT(m_slotAssignment);
return m_slotAssignment->removeSlotElementByName(name, slot, &oldParentOfRemovedTree, *this);
}
void ShadowRoot::slotManualAssignmentDidChange(HTMLSlotElement& slot, Vector<WeakPtr<Node, WeakPtrImplWithEventTargetData>>& previous, Vector<WeakPtr<Node, WeakPtrImplWithEventTargetData>>& current)
{
ASSERT(m_slotAssignment);
m_slotAssignment->slotManualAssignmentDidChange(slot, previous, current, *this);
}
void ShadowRoot::didRemoveManuallyAssignedNode(HTMLSlotElement& slot, const Node& node)
{
ASSERT(m_slotAssignment);
m_slotAssignment->didRemoveManuallyAssignedNode(slot, node, *this);
}
void ShadowRoot::slotFallbackDidChange(HTMLSlotElement& slot)
{
ASSERT(&slot.rootNode() == this);
return m_slotAssignment->slotFallbackDidChange(slot, *this);
}
const Vector<WeakPtr<Node, WeakPtrImplWithEventTargetData>>* ShadowRoot::assignedNodesForSlot(const HTMLSlotElement& slot)
{
if (!m_slotAssignment)
return nullptr;
return m_slotAssignment->assignedNodesForSlot(slot, *this);
}
static std::optional<std::pair<AtomString, AtomString>> parsePartMapping(StringView mappingString)
{
const auto end = mappingString.length();
auto skipWhitespace = [&](auto position) {
while (position < end && isASCIIWhitespace(mappingString[position]))
++position;
return position;
};
auto collectValue = [&](auto position) {
while (position < end && (!isASCIIWhitespace(mappingString[position]) && mappingString[position] != ':'))
++position;
return position;
};
size_t begin = 0;
begin = skipWhitespace(begin);
auto firstPartEnd = collectValue(begin);
if (firstPartEnd == begin)
return { };
auto firstPart = mappingString.substring(begin, firstPartEnd - begin).toAtomString();
begin = skipWhitespace(firstPartEnd);
if (begin == end)
return std::make_pair(firstPart, firstPart);
if (mappingString[begin] != ':')
return { };
begin = skipWhitespace(begin + 1);
auto secondPartEnd = collectValue(begin);
if (secondPartEnd == begin)
return { };
auto secondPart = mappingString.substring(begin, secondPartEnd - begin).toAtomString();
begin = skipWhitespace(secondPartEnd);
if (begin != end)
return { };
return std::make_pair(firstPart, secondPart);
}
static ShadowRoot::PartMappings parsePartMappingsList(StringView mappingsListString)
{
ShadowRoot::PartMappings mappings;
const auto end = mappingsListString.length();
size_t begin = 0;
while (begin < end) {
size_t mappingEnd = begin;
while (mappingEnd < end && mappingsListString[mappingEnd] != ',')
++mappingEnd;
auto result = parsePartMapping(mappingsListString.substring(begin, mappingEnd - begin));
if (result)
mappings.add(result->first, Vector<AtomString, 1>()).iterator->value.append(result->second);
if (mappingEnd == end)
break;
begin = mappingEnd + 1;
}
return mappings;
}
const ShadowRoot::PartMappings& ShadowRoot::partMappings() const
{
if (!m_partMappings) {
auto exportpartsValue = host()->attributeWithoutSynchronization(HTMLNames::exportpartsAttr);
m_partMappings = parsePartMappingsList(exportpartsValue);
}
return *m_partMappings;
}
void ShadowRoot::invalidatePartMappings()
{
m_partMappings = { };
}
Vector<ShadowRoot*> assignedShadowRootsIfSlotted(const Node& node)
{
Vector<ShadowRoot*> result;
for (auto* slot = node.assignedSlot(); slot; slot = slot->assignedSlot()) {
ASSERT(slot->containingShadowRoot());
result.append(slot->containingShadowRoot());
}
return result;
}
#if ENABLE(PICTURE_IN_PICTURE_API)
HTMLVideoElement* ShadowRoot::pictureInPictureElement() const
{
notImplemented();
return nullptr;
}
#endif
Vector<RefPtr<WebAnimation>> ShadowRoot::getAnimations()
{
return document().matchingAnimations([&] (Element& target) -> bool {
return target.containingShadowRoot() == this;
});
}
}
|