| /* |
| * Copyright (C) 2015 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/html/HTMLSlotElement.h" |
| |
| #include "bindings/core/v8/Microtask.h" |
| #include "core/HTMLNames.h" |
| #include "core/dom/NodeTraversal.h" |
| #include "core/dom/StyleChangeReason.h" |
| #include "core/dom/StyleEngine.h" |
| #include "core/dom/shadow/ElementShadow.h" |
| #include "core/dom/shadow/InsertionPoint.h" |
| #include "core/dom/shadow/SlotAssignment.h" |
| #include "core/events/Event.h" |
| #include "core/html/AssignedNodesOptions.h" |
| |
| namespace blink { |
| |
| using namespace HTMLNames; |
| |
| inline HTMLSlotElement::HTMLSlotElement(Document& document) |
| : HTMLElement(slotTag, document) |
| { |
| setHasCustomStyleCallbacks(); |
| } |
| |
| DEFINE_NODE_FACTORY(HTMLSlotElement); |
| |
| // static |
| AtomicString HTMLSlotElement::normalizeSlotName(const AtomicString& name) |
| { |
| return (name.isNull() || name.isEmpty()) ? emptyAtom : name; |
| } |
| |
| const HeapVector<Member<Node>>& HTMLSlotElement::assignedNodes() |
| { |
| DCHECK(!needsDistributionRecalc()); |
| DCHECK(isInShadowTree() || m_assignedNodes.isEmpty()); |
| return m_assignedNodes; |
| } |
| |
| const HeapVector<Member<Node>> HTMLSlotElement::assignedNodesForBinding(const AssignedNodesOptions& options) |
| { |
| updateDistribution(); |
| if (options.hasFlatten() && options.flatten()) |
| return getDistributedNodes(); |
| return m_assignedNodes; |
| } |
| |
| const HeapVector<Member<Node>>& HTMLSlotElement::getDistributedNodes() |
| { |
| DCHECK(!needsDistributionRecalc()); |
| if (isInShadowTree()) |
| return m_distributedNodes; |
| |
| // A slot is unlikely to be used outside of a shadow tree. |
| // We do not need to optimize this case in most cases. |
| // TODO(hayato): If this path causes a performance issue, we should move |
| // ShadowRoot::m_slotAssignment into TreeScopreRareData-ish and |
| // update the distribution code so it considers a document tree too. |
| clearDistribution(); |
| Node* child = NodeTraversal::firstChild(*this); |
| while (child) { |
| if (!child->isSlotable()) { |
| child = NodeTraversal::nextSkippingChildren(*child, this); |
| continue; |
| } |
| if (isHTMLSlotElement(child)) { |
| child = NodeTraversal::next(*child, this); |
| } else { |
| m_distributedNodes.append(child); |
| child = NodeTraversal::nextSkippingChildren(*child, this); |
| } |
| } |
| return m_distributedNodes; |
| } |
| |
| void HTMLSlotElement::appendAssignedNode(Node& hostChild) |
| { |
| DCHECK(hostChild.isSlotable()); |
| m_assignedNodes.append(&hostChild); |
| } |
| |
| void HTMLSlotElement::resolveDistributedNodes() |
| { |
| for (auto& node : m_assignedNodes) { |
| DCHECK(node->isSlotable()); |
| if (isHTMLSlotElement(*node)) |
| appendDistributedNodesFrom(toHTMLSlotElement(*node)); |
| else |
| appendDistributedNode(*node); |
| |
| if (isChildOfV1ShadowHost()) |
| parentElementShadow()->setNeedsDistributionRecalc(); |
| } |
| } |
| |
| void HTMLSlotElement::appendDistributedNode(Node& node) |
| { |
| size_t size = m_distributedNodes.size(); |
| m_distributedNodes.append(&node); |
| m_distributedIndices.set(&node, size); |
| } |
| |
| void HTMLSlotElement::appendDistributedNodesFrom(const HTMLSlotElement& other) |
| { |
| size_t index = m_distributedNodes.size(); |
| m_distributedNodes.appendVector(other.m_distributedNodes); |
| for (const auto& node : other.m_distributedNodes) |
| m_distributedIndices.set(node.get(), index++); |
| } |
| |
| void HTMLSlotElement::clearDistribution() |
| { |
| m_assignedNodes.clear(); |
| m_distributedNodes.clear(); |
| m_distributedIndices.clear(); |
| } |
| |
| void HTMLSlotElement::dispatchSlotChangeEvent() |
| { |
| m_slotchangeEventEnqueued = false; |
| Event* event = Event::create(EventTypeNames::slotchange); |
| event->setTarget(this); |
| dispatchScopedEvent(event); |
| } |
| |
| Node* HTMLSlotElement::distributedNodeNextTo(const Node& node) const |
| { |
| const auto& it = m_distributedIndices.find(&node); |
| if (it == m_distributedIndices.end()) |
| return nullptr; |
| size_t index = it->value; |
| if (index + 1 == m_distributedNodes.size()) |
| return nullptr; |
| return m_distributedNodes[index + 1].get(); |
| } |
| |
| Node* HTMLSlotElement::distributedNodePreviousTo(const Node& node) const |
| { |
| const auto& it = m_distributedIndices.find(&node); |
| if (it == m_distributedIndices.end()) |
| return nullptr; |
| size_t index = it->value; |
| if (index == 0) |
| return nullptr; |
| return m_distributedNodes[index - 1].get(); |
| } |
| |
| AtomicString HTMLSlotElement::name() const |
| { |
| return normalizeSlotName(fastGetAttribute(HTMLNames::nameAttr)); |
| } |
| |
| void HTMLSlotElement::attach(const AttachContext& context) |
| { |
| for (auto& node : m_distributedNodes) { |
| if (node->needsAttach()) |
| node->attach(context); |
| } |
| |
| HTMLElement::attach(context); |
| } |
| |
| void HTMLSlotElement::detach(const AttachContext& context) |
| { |
| for (auto& node : m_distributedNodes) |
| node->lazyReattachIfAttached(); |
| |
| HTMLElement::detach(context); |
| } |
| |
| void HTMLSlotElement::attributeChanged(const QualifiedName& name, const AtomicString& oldValue, const AtomicString& newValue, AttributeModificationReason reason) |
| { |
| if (name == nameAttr) { |
| if (ShadowRoot* root = containingShadowRoot()) { |
| if (root->isV1() && oldValue != newValue) |
| root->ensureSlotAssignment().slotRenamed(normalizeSlotName(oldValue), *this); |
| } |
| } |
| HTMLElement::attributeChanged(name, oldValue, newValue, reason); |
| } |
| |
| static bool wasInShadowTreeBeforeInserted(HTMLSlotElement& slot, ContainerNode& insertionPoint) |
| { |
| ShadowRoot* root1 = slot.containingShadowRoot(); |
| ShadowRoot* root2 = insertionPoint.containingShadowRoot(); |
| if (root1 && root2 && root1 == root2) |
| return false; |
| return root1; |
| } |
| |
| Node::InsertionNotificationRequest HTMLSlotElement::insertedInto(ContainerNode* insertionPoint) |
| { |
| HTMLElement::insertedInto(insertionPoint); |
| ShadowRoot* root = containingShadowRoot(); |
| if (root) { |
| DCHECK(root->owner()); |
| root->owner()->setNeedsDistributionRecalc(); |
| // Relevant DOM Standard: https://dom.spec.whatwg.org/#concept-node-insert |
| // - 6.4: Run assign slotables for a tree with node's tree and a set containing each inclusive descendant of node that is a slot. |
| if (!wasInShadowTreeBeforeInserted(*this, *insertionPoint)) |
| root->ensureSlotAssignment().slotAdded(*this); |
| } |
| |
| // We could have been distributed into in a detached subtree, make sure to |
| // clear the distribution when inserted again to avoid cycles. |
| clearDistribution(); |
| |
| return InsertionDone; |
| } |
| |
| static ShadowRoot* containingShadowRootBeforeRemoved(Node& removedDescendant, ContainerNode& insertionPoint) |
| { |
| if (ShadowRoot* root = removedDescendant.containingShadowRoot()) |
| return root; |
| return insertionPoint.containingShadowRoot(); |
| } |
| |
| void HTMLSlotElement::removedFrom(ContainerNode* insertionPoint) |
| { |
| // `removedFrom` is called after the node is removed from the tree. |
| // That means: |
| // 1. If this slot is still in a tree scope, it means the slot has been in a shadow tree. An inclusive shadow-including ancestor of the shadow host was originally removed from its parent. |
| // 2. Or (this slot is now not in a tree scope), this slot's inclusive ancestor was orginally removed from its parent (== insertion point). This slot and the originally removed node was in the same tree. |
| |
| ShadowRoot* root = containingShadowRootBeforeRemoved(*this, *insertionPoint); |
| if (root) { |
| if (ElementShadow* rootOwner = root->owner()) |
| rootOwner->setNeedsDistributionRecalc(); |
| } |
| |
| // Since this insertion point is no longer visible from the shadow subtree, it need to clean itself up. |
| clearDistribution(); |
| |
| if (root && root->isV1() && root == insertionPoint->treeScope().rootNode()) { |
| // This slot was in a shadow tree and got disconnected from the shadow root. |
| root->ensureSlotAssignment().slotRemoved(*this); |
| } |
| |
| HTMLElement::removedFrom(insertionPoint); |
| } |
| |
| void HTMLSlotElement::willRecalcStyle(StyleRecalcChange change) |
| { |
| if (change < Inherit && getStyleChangeType() < SubtreeStyleChange) |
| return; |
| |
| for (auto& node : m_distributedNodes) |
| node->setNeedsStyleRecalc(LocalStyleChange, StyleChangeReasonForTracing::create(StyleChangeReason::PropagateInheritChangeToDistributedNodes)); |
| } |
| |
| void HTMLSlotElement::updateDistributedNodesWithFallback() |
| { |
| if (!m_distributedNodes.isEmpty()) |
| return; |
| for (auto& child : NodeTraversal::childrenOf(*this)) { |
| if (!child.isSlotable()) |
| continue; |
| if (isHTMLSlotElement(child)) |
| appendDistributedNodesFrom(toHTMLSlotElement(child)); |
| else |
| appendDistributedNode(child); |
| } |
| } |
| |
| void HTMLSlotElement::enqueueSlotChangeEvent() |
| { |
| if (!m_slotchangeEventEnqueued) { |
| Microtask::enqueueMicrotask(WTF::bind(&HTMLSlotElement::dispatchSlotChangeEvent, Persistent<HTMLSlotElement>(this))); |
| m_slotchangeEventEnqueued = true; |
| } |
| |
| ShadowRoot* root = containingShadowRoot(); |
| DCHECK(root); |
| DCHECK(root->isV1()); |
| root->owner()->setNeedsDistributionRecalc(); |
| |
| if (ShadowRoot* parentShadowRoot = v1ShadowRootOfParent()) { |
| if (HTMLSlotElement* next = parentShadowRoot->ensureSlotAssignment().findSlot(*this)) |
| next->enqueueSlotChangeEvent(); |
| } |
| } |
| |
| bool HTMLSlotElement::hasAssignedNodesSlow() const |
| { |
| ShadowRoot* root = containingShadowRoot(); |
| DCHECK(root); |
| DCHECK(root->isV1()); |
| SlotAssignment& assignment = root->ensureSlotAssignment(); |
| if (assignment.findSlotByName(name()) != this) |
| return false; |
| return assignment.findHostChildBySlotName(name()); |
| } |
| |
| bool HTMLSlotElement::findHostChildWithSameSlotName() const |
| { |
| ShadowRoot* root = containingShadowRoot(); |
| DCHECK(root); |
| DCHECK(root->isV1()); |
| SlotAssignment& assignment = root->ensureSlotAssignment(); |
| return assignment.findHostChildBySlotName(name()); |
| } |
| |
| short HTMLSlotElement::tabIndex() const |
| { |
| return Element::tabIndex(); |
| } |
| |
| DEFINE_TRACE(HTMLSlotElement) |
| { |
| visitor->trace(m_assignedNodes); |
| visitor->trace(m_distributedNodes); |
| visitor->trace(m_distributedIndices); |
| HTMLElement::trace(visitor); |
| } |
| |
| } // namespace blink |