michael@0: /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "mozilla/Preferences.h"
michael@0: #include "mozilla/dom/ShadowRoot.h"
michael@0: #include "mozilla/dom/ShadowRootBinding.h"
michael@0: #include "mozilla/dom/DocumentFragment.h"
michael@0: #include "ChildIterator.h"
michael@0: #include "nsContentUtils.h"
michael@0: #include "nsDOMClassInfoID.h"
michael@0: #include "nsIDOMHTMLElement.h"
michael@0: #include "nsIStyleSheetLinkingElement.h"
michael@0: #include "mozilla/dom/Element.h"
michael@0: #include "mozilla/dom/HTMLContentElement.h"
michael@0: #include "mozilla/dom/HTMLShadowElement.h"
michael@0: #include "nsXBLPrototypeBinding.h"
michael@0: 
michael@0: using namespace mozilla;
michael@0: using namespace mozilla::dom;
michael@0: 
michael@0: static PLDHashOperator
michael@0: IdentifierMapEntryTraverse(nsIdentifierMapEntry *aEntry, void *aArg)
michael@0: {
michael@0:   nsCycleCollectionTraversalCallback *cb =
michael@0:     static_cast<nsCycleCollectionTraversalCallback*>(aArg);
michael@0:   aEntry->Traverse(cb);
michael@0:   return PL_DHASH_NEXT;
michael@0: }
michael@0: 
michael@0: NS_IMPL_CYCLE_COLLECTION_CLASS(ShadowRoot)
michael@0: 
michael@0: NS_IMPL_CYCLE_COLLECTION_TRAVERSE_BEGIN_INHERITED(ShadowRoot,
michael@0:                                                   DocumentFragment)
michael@0:   NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mPoolHost)
michael@0:   NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mStyleSheetList)
michael@0:   NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mOlderShadow)
michael@0:   NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mYoungerShadow)
michael@0:   NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mAssociatedBinding)
michael@0:   tmp->mIdentifierMap.EnumerateEntries(IdentifierMapEntryTraverse, &cb);
michael@0: NS_IMPL_CYCLE_COLLECTION_TRAVERSE_END
michael@0: 
michael@0: NS_IMPL_CYCLE_COLLECTION_UNLINK_BEGIN_INHERITED(ShadowRoot,
michael@0:                                                 DocumentFragment)
michael@0:   if (tmp->mPoolHost) {
michael@0:     tmp->mPoolHost->RemoveMutationObserver(tmp);
michael@0:   }
michael@0:   NS_IMPL_CYCLE_COLLECTION_UNLINK(mPoolHost)
michael@0:   NS_IMPL_CYCLE_COLLECTION_UNLINK(mStyleSheetList)
michael@0:   NS_IMPL_CYCLE_COLLECTION_UNLINK(mOlderShadow)
michael@0:   NS_IMPL_CYCLE_COLLECTION_UNLINK(mYoungerShadow)
michael@0:   NS_IMPL_CYCLE_COLLECTION_UNLINK(mAssociatedBinding)
michael@0:   tmp->mIdentifierMap.Clear();
michael@0: NS_IMPL_CYCLE_COLLECTION_UNLINK_END
michael@0: 
michael@0: DOMCI_DATA(ShadowRoot, ShadowRoot)
michael@0: 
michael@0: NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION_INHERITED(ShadowRoot)
michael@0:   NS_INTERFACE_MAP_ENTRY_AMBIGUOUS(nsISupports, nsIContent)
michael@0:   NS_INTERFACE_MAP_ENTRY(nsIMutationObserver)
michael@0: NS_INTERFACE_MAP_END_INHERITING(DocumentFragment)
michael@0: 
michael@0: NS_IMPL_ADDREF_INHERITED(ShadowRoot, DocumentFragment)
michael@0: NS_IMPL_RELEASE_INHERITED(ShadowRoot, DocumentFragment)
michael@0: 
michael@0: ShadowRoot::ShadowRoot(nsIContent* aContent,
michael@0:                        already_AddRefed<nsINodeInfo>&& aNodeInfo,
michael@0:                        nsXBLPrototypeBinding* aProtoBinding)
michael@0:   : DocumentFragment(aNodeInfo), mPoolHost(aContent),
michael@0:     mProtoBinding(aProtoBinding), mShadowElement(nullptr),
michael@0:     mInsertionPointChanged(false)
michael@0: {
michael@0:   SetHost(aContent);
michael@0:   SetFlags(NODE_IS_IN_SHADOW_TREE);
michael@0:   // ShadowRoot isn't really in the document but it behaves like it is.
michael@0:   SetInDocument();
michael@0:   DOMSlots()->mBindingParent = aContent;
michael@0:   DOMSlots()->mContainingShadow = this;
michael@0: 
michael@0:   // Add the ShadowRoot as a mutation observer on the host to watch
michael@0:   // for mutations because the insertion points in this ShadowRoot
michael@0:   // may need to be updated when the host children are modified.
michael@0:   mPoolHost->AddMutationObserver(this);
michael@0: }
michael@0: 
michael@0: ShadowRoot::~ShadowRoot()
michael@0: {
michael@0:   if (mPoolHost) {
michael@0:     // mPoolHost may have been unlinked or a new ShadowRoot may have been
michael@0:     // creating, making this one obsolete.
michael@0:     mPoolHost->RemoveMutationObserver(this);
michael@0:   }
michael@0: 
michael@0:   ClearInDocument();
michael@0:   SetHost(nullptr);
michael@0: }
michael@0: 
michael@0: JSObject*
michael@0: ShadowRoot::WrapObject(JSContext* aCx)
michael@0: {
michael@0:   return mozilla::dom::ShadowRootBinding::Wrap(aCx, this);
michael@0: }
michael@0: 
michael@0: ShadowRoot*
michael@0: ShadowRoot::FromNode(nsINode* aNode)
michael@0: {
michael@0:   if (aNode->HasFlag(NODE_IS_IN_SHADOW_TREE) && !aNode->GetParentNode()) {
michael@0:     MOZ_ASSERT(aNode->NodeType() == nsIDOMNode::DOCUMENT_FRAGMENT_NODE,
michael@0:                "ShadowRoot is a document fragment.");
michael@0:     return static_cast<ShadowRoot*>(aNode);
michael@0:   }
michael@0: 
michael@0:   return nullptr;
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::Restyle()
michael@0: {
michael@0:   mProtoBinding->FlushSkinSheets();
michael@0: 
michael@0:   nsIPresShell* shell = OwnerDoc()->GetShell();
michael@0:   if (shell) {
michael@0:     OwnerDoc()->BeginUpdate(UPDATE_STYLE);
michael@0:     shell->RestyleShadowRoot(this);
michael@0:     OwnerDoc()->EndUpdate(UPDATE_STYLE);
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::InsertSheet(nsCSSStyleSheet* aSheet,
michael@0:                         nsIContent* aLinkingContent)
michael@0: {
michael@0:   nsCOMPtr<nsIStyleSheetLinkingElement>
michael@0:     linkingElement = do_QueryInterface(aLinkingContent);
michael@0:   MOZ_ASSERT(linkingElement, "The only styles in a ShadowRoot should come "
michael@0:                              "from <style>.");
michael@0: 
michael@0:   linkingElement->SetStyleSheet(aSheet); // This sets the ownerNode on the sheet
michael@0: 
michael@0:   nsTArray<nsRefPtr<nsCSSStyleSheet> >* sheets =
michael@0:     mProtoBinding->GetOrCreateStyleSheets();
michael@0:   MOZ_ASSERT(sheets, "Style sheets array should never be null.");
michael@0: 
michael@0:   // Find the correct position to insert into the style sheet list (must
michael@0:   // be in tree order).
michael@0:   for (uint32_t i = 0; i <= sheets->Length(); i++) {
michael@0:     if (i == sheets->Length()) {
michael@0:       sheets->AppendElement(aSheet);
michael@0:       break;
michael@0:     }
michael@0: 
michael@0:     nsINode* sheetOwnerNode = sheets->ElementAt(i)->GetOwnerNode();
michael@0:     if (nsContentUtils::PositionIsBefore(aLinkingContent, sheetOwnerNode)) {
michael@0:       sheets->InsertElementAt(i, aSheet);
michael@0:       break;
michael@0:     }
michael@0:   }
michael@0: 
michael@0:   Restyle();
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::RemoveSheet(nsCSSStyleSheet* aSheet)
michael@0: {
michael@0:   nsTArray<nsRefPtr<nsCSSStyleSheet> >* sheets =
michael@0:     mProtoBinding->GetOrCreateStyleSheets();
michael@0:   MOZ_ASSERT(sheets, "Style sheets array should never be null.");
michael@0: 
michael@0:   DebugOnly<bool> found = sheets->RemoveElement(aSheet);
michael@0:   MOZ_ASSERT(found, "Trying to remove a sheet from a ShadowRoot "
michael@0:                     "that does not exist.");
michael@0: 
michael@0:   Restyle();
michael@0: }
michael@0: 
michael@0: Element*
michael@0: ShadowRoot::GetElementById(const nsAString& aElementId)
michael@0: {
michael@0:   nsIdentifierMapEntry *entry = mIdentifierMap.GetEntry(aElementId);
michael@0:   return entry ? entry->GetIdElement() : nullptr;
michael@0: }
michael@0: 
michael@0: already_AddRefed<nsContentList>
michael@0: ShadowRoot::GetElementsByTagName(const nsAString& aTagName)
michael@0: {
michael@0:   return NS_GetContentList(this, kNameSpaceID_Unknown, aTagName);
michael@0: }
michael@0: 
michael@0: already_AddRefed<nsContentList>
michael@0: ShadowRoot::GetElementsByTagNameNS(const nsAString& aNamespaceURI,
michael@0:                                    const nsAString& aLocalName)
michael@0: {
michael@0:   int32_t nameSpaceId = kNameSpaceID_Wildcard;
michael@0: 
michael@0:   if (!aNamespaceURI.EqualsLiteral("*")) {
michael@0:     nsresult rv =
michael@0:       nsContentUtils::NameSpaceManager()->RegisterNameSpace(aNamespaceURI,
michael@0:                                                             nameSpaceId);
michael@0:     NS_ENSURE_SUCCESS(rv, nullptr);
michael@0:   }
michael@0: 
michael@0:   NS_ASSERTION(nameSpaceId != kNameSpaceID_Unknown, "Unexpected namespace ID!");
michael@0: 
michael@0:   return NS_GetContentList(this, nameSpaceId, aLocalName);
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::AddToIdTable(Element* aElement, nsIAtom* aId)
michael@0: {
michael@0:   nsIdentifierMapEntry *entry =
michael@0:     mIdentifierMap.PutEntry(nsDependentAtomString(aId));
michael@0:   if (entry) {
michael@0:     entry->AddIdElement(aElement);
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::RemoveFromIdTable(Element* aElement, nsIAtom* aId)
michael@0: {
michael@0:   nsIdentifierMapEntry *entry =
michael@0:     mIdentifierMap.GetEntry(nsDependentAtomString(aId));
michael@0:   if (entry) {
michael@0:     entry->RemoveIdElement(aElement);
michael@0:     if (entry->IsEmpty()) {
michael@0:       mIdentifierMap.RawRemoveEntry(entry);
michael@0:     }
michael@0:   }
michael@0: }
michael@0: 
michael@0: already_AddRefed<nsContentList>
michael@0: ShadowRoot::GetElementsByClassName(const nsAString& aClasses)
michael@0: {
michael@0:   return nsContentUtils::GetElementsByClassName(this, aClasses);
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::AddInsertionPoint(HTMLContentElement* aInsertionPoint)
michael@0: {
michael@0:   TreeOrderComparator comparator;
michael@0:   mInsertionPoints.InsertElementSorted(aInsertionPoint, comparator);
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::RemoveInsertionPoint(HTMLContentElement* aInsertionPoint)
michael@0: {
michael@0:   mInsertionPoints.RemoveElement(aInsertionPoint);
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::SetYoungerShadow(ShadowRoot* aYoungerShadow)
michael@0: {
michael@0:   mYoungerShadow = aYoungerShadow;
michael@0:   mYoungerShadow->mOlderShadow = this;
michael@0: 
michael@0:   ChangePoolHost(mYoungerShadow->GetShadowElement());
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::DistributeSingleNode(nsIContent* aContent)
michael@0: {
michael@0:   // Find the insertion point to which the content belongs.
michael@0:   HTMLContentElement* insertionPoint = nullptr;
michael@0:   for (uint32_t i = 0; i < mInsertionPoints.Length(); i++) {
michael@0:     if (mInsertionPoints[i]->Match(aContent)) {
michael@0:       if (mInsertionPoints[i]->MatchedNodes().Contains(aContent)) {
michael@0:         // Node is already matched into the insertion point. We are done.
michael@0:         return;
michael@0:       }
michael@0: 
michael@0:       // Matching may cause the insertion point to drop fallback content.
michael@0:       if (mInsertionPoints[i]->MatchedNodes().IsEmpty() &&
michael@0:           static_cast<nsINode*>(mInsertionPoints[i])->GetFirstChild()) {
michael@0:         // This match will cause the insertion point to drop all fallback
michael@0:         // content and used matched nodes instead. Give up on the optimization
michael@0:         // and just distribute all nodes.
michael@0:         DistributeAllNodes();
michael@0:         return;
michael@0:       }
michael@0:       insertionPoint = mInsertionPoints[i];
michael@0:       break;
michael@0:     }
michael@0:   }
michael@0: 
michael@0:   // Find the index into the insertion point.
michael@0:   if (insertionPoint) {
michael@0:     nsCOMArray<nsIContent>& matchedNodes = insertionPoint->MatchedNodes();
michael@0:     // Find the appropriate position in the matched node list for the
michael@0:     // newly distributed content.
michael@0:     bool isIndexFound = false;
michael@0:     MOZ_ASSERT(mPoolHost, "Where did the content come from if there is no pool host?");
michael@0:     ExplicitChildIterator childIterator(mPoolHost);
michael@0:     for (uint32_t i = 0; i < matchedNodes.Length(); i++) {
michael@0:       // Seek through the host's explicit children until the inserted content
michael@0:       // is found or when the current matched node is reached.
michael@0:       if (childIterator.Seek(aContent, matchedNodes[i])) {
michael@0:         // aContent was found before the current matched node.
michael@0:         matchedNodes.InsertElementAt(i, aContent);
michael@0:         isIndexFound = true;
michael@0:         break;
michael@0:       }
michael@0:     }
michael@0: 
michael@0:     if (!isIndexFound) {
michael@0:       // We have still not found an index in the insertion point,
michael@0:       // thus it must be at the end.
michael@0:       MOZ_ASSERT(childIterator.Seek(aContent),
michael@0:                  "Trying to match a node that is not a candidate to be matched");
michael@0:       matchedNodes.AppendElement(aContent);
michael@0:     }
michael@0: 
michael@0:     // Handle the case where the parent of the insertion point is a ShadowRoot
michael@0:     // that is projected into the younger ShadowRoot's shadow insertion point.
michael@0:     // The node distributed into the insertion point must be reprojected
michael@0:     // to the shadow insertion point.
michael@0:     if (insertionPoint->GetParent() == this &&
michael@0:         mYoungerShadow && mYoungerShadow->GetShadowElement()) {
michael@0:       mYoungerShadow->GetShadowElement()->DistributeSingleNode(aContent);
michael@0:     }
michael@0: 
michael@0:     // Handle the case where the parent of the insertion point has a ShadowRoot.
michael@0:     // The node distributed into the insertion point must be reprojected to the
michael@0:     // insertion points of the parent's ShadowRoot.
michael@0:     ShadowRoot* parentShadow = insertionPoint->GetParent()->GetShadowRoot();
michael@0:     if (parentShadow) {
michael@0:       parentShadow->DistributeSingleNode(aContent);
michael@0:     }
michael@0: 
michael@0:     // Handle the case where the parent of the insertion point is the <shadow>
michael@0:     // element. The node distributed into the insertion point must be reprojected
michael@0:     // into the older ShadowRoot's insertion points.
michael@0:     if (mShadowElement && mShadowElement == insertionPoint->GetParent()) {
michael@0:       ShadowRoot* olderShadow = mShadowElement->GetOlderShadowRoot();
michael@0:       if (olderShadow) {
michael@0:         olderShadow->DistributeSingleNode(aContent);
michael@0:       }
michael@0:     }
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::RemoveDistributedNode(nsIContent* aContent)
michael@0: {
michael@0:   // Find insertion point containing the content and remove the node.
michael@0:   for (uint32_t i = 0; i < mInsertionPoints.Length(); i++) {
michael@0:     if (mInsertionPoints[i]->MatchedNodes().Contains(aContent)) {
michael@0:       // Removing the matched node may cause the insertion point to use
michael@0:       // fallback content.
michael@0:       if (mInsertionPoints[i]->MatchedNodes().Length() == 1 &&
michael@0:           static_cast<nsINode*>(mInsertionPoints[i])->GetFirstChild()) {
michael@0:         // Removing the matched node will cause fallback content to be
michael@0:         // used instead. Give up optimization and distribute all nodes.
michael@0:         DistributeAllNodes();
michael@0:         return;
michael@0:       }
michael@0: 
michael@0:       mInsertionPoints[i]->MatchedNodes().RemoveElement(aContent);
michael@0: 
michael@0:       // Handle the case where the parent of the insertion point is a ShadowRoot
michael@0:       // that is projected into the younger ShadowRoot's shadow insertion point.
michael@0:       // The removed node needs to be removed from the shadow insertion point.
michael@0:       if (mInsertionPoints[i]->GetParent() == this) {
michael@0:         if (mYoungerShadow && mYoungerShadow->GetShadowElement()) {
michael@0:           mYoungerShadow->GetShadowElement()->RemoveDistributedNode(aContent);
michael@0:         }
michael@0:       }
michael@0: 
michael@0:       // Handle the case where the parent of the insertion point has a ShadowRoot.
michael@0:       // The removed node needs to be removed from the insertion points of the
michael@0:       // parent's ShadowRoot.
michael@0:       ShadowRoot* parentShadow = mInsertionPoints[i]->GetParent()->GetShadowRoot();
michael@0:       if (parentShadow) {
michael@0:         parentShadow->RemoveDistributedNode(aContent);
michael@0:       }
michael@0: 
michael@0:       // Handle the case where the parent of the insertion point is the <shadow>
michael@0:       // element. The removed node must be removed from the older ShadowRoot's
michael@0:       // insertion points.
michael@0:       if (mShadowElement && mShadowElement == mInsertionPoints[i]->GetParent()) {
michael@0:         ShadowRoot* olderShadow = mShadowElement->GetOlderShadowRoot();
michael@0:         if (olderShadow) {
michael@0:           olderShadow->RemoveDistributedNode(aContent);
michael@0:         }
michael@0:       }
michael@0: 
michael@0:       break;
michael@0:     }
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::DistributeAllNodes()
michael@0: {
michael@0:   // Create node pool.
michael@0:   nsTArray<nsIContent*> nodePool;
michael@0: 
michael@0:   // Make sure there is a pool host, an older shadow may not have
michael@0:   // one if the younger shadow does not have a <shadow> element.
michael@0:   if (mPoolHost) {
michael@0:     ExplicitChildIterator childIterator(mPoolHost);
michael@0:     for (nsIContent* content = childIterator.GetNextChild();
michael@0:          content;
michael@0:          content = childIterator.GetNextChild()) {
michael@0:       nodePool.AppendElement(content);
michael@0:     }
michael@0:   }
michael@0: 
michael@0:   nsTArray<ShadowRoot*> shadowsToUpdate;
michael@0: 
michael@0:   for (uint32_t i = 0; i < mInsertionPoints.Length(); i++) {
michael@0:     mInsertionPoints[i]->ClearMatchedNodes();
michael@0:     // Assign matching nodes from node pool.
michael@0:     for (uint32_t j = 0; j < nodePool.Length(); j++) {
michael@0:       if (mInsertionPoints[i]->Match(nodePool[j])) {
michael@0:         mInsertionPoints[i]->MatchedNodes().AppendElement(nodePool[j]);
michael@0:         nodePool[j]->SetXBLInsertionParent(mInsertionPoints[i]);
michael@0:         nodePool.RemoveElementAt(j--);
michael@0:       }
michael@0:     }
michael@0: 
michael@0:     // Keep track of instances where the content insertion point is distributed
michael@0:     // (parent of insertion point has a ShadowRoot).
michael@0:     nsIContent* insertionParent = mInsertionPoints[i]->GetParent();
michael@0:     MOZ_ASSERT(insertionParent, "The only way for an insertion point to be in the"
michael@0:                                 "mInsertionPoints array is to be a descendant of a"
michael@0:                                 "ShadowRoot, in which case, it should have a parent");
michael@0: 
michael@0:     // If the parent of the insertion point has as ShadowRoot, the nodes distributed
michael@0:     // to the insertion point must be reprojected to the insertion points of the
michael@0:     // parent's ShadowRoot.
michael@0:     ShadowRoot* parentShadow = insertionParent->GetShadowRoot();
michael@0:     if (parentShadow && !shadowsToUpdate.Contains(parentShadow)) {
michael@0:       shadowsToUpdate.AppendElement(parentShadow);
michael@0:     }
michael@0:   }
michael@0: 
michael@0:   // If there is a shadow insertion point in this ShadowRoot, the children
michael@0:   // of the shadow insertion point needs to be distributed into the insertion
michael@0:   // points of the older ShadowRoot.
michael@0:   if (mShadowElement && mOlderShadow) {
michael@0:     mOlderShadow->DistributeAllNodes();
michael@0:   }
michael@0: 
michael@0:   // If there is a younger ShadowRoot with a shadow insertion point,
michael@0:   // then the children of this ShadowRoot needs to be distributed to
michael@0:   // the younger ShadowRoot's shadow insertion point.
michael@0:   if (mYoungerShadow && mYoungerShadow->GetShadowElement()) {
michael@0:     mYoungerShadow->GetShadowElement()->DistributeAllNodes();
michael@0:   }
michael@0: 
michael@0:   for (uint32_t i = 0; i < shadowsToUpdate.Length(); i++) {
michael@0:     shadowsToUpdate[i]->DistributeAllNodes();
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::GetInnerHTML(nsAString& aInnerHTML)
michael@0: {
michael@0:   GetMarkup(false, aInnerHTML);
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::SetInnerHTML(const nsAString& aInnerHTML, ErrorResult& aError)
michael@0: {
michael@0:   SetInnerHTMLInternal(aInnerHTML, aError);
michael@0: }
michael@0: 
michael@0: bool
michael@0: ShadowRoot::ApplyAuthorStyles()
michael@0: {
michael@0:   return mProtoBinding->InheritsStyle();
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::SetApplyAuthorStyles(bool aApplyAuthorStyles)
michael@0: {
michael@0:   mProtoBinding->SetInheritsStyle(aApplyAuthorStyles);
michael@0: 
michael@0:   nsIPresShell* shell = OwnerDoc()->GetShell();
michael@0:   if (shell) {
michael@0:     OwnerDoc()->BeginUpdate(UPDATE_STYLE);
michael@0:     shell->RestyleShadowRoot(this);
michael@0:     OwnerDoc()->EndUpdate(UPDATE_STYLE);
michael@0:   }
michael@0: }
michael@0: 
michael@0: StyleSheetList*
michael@0: ShadowRoot::StyleSheets()
michael@0: {
michael@0:   if (!mStyleSheetList) {
michael@0:     mStyleSheetList = new ShadowRootStyleSheetList(this);
michael@0:   }
michael@0: 
michael@0:   return mStyleSheetList;
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::SetShadowElement(HTMLShadowElement* aShadowElement)
michael@0: {
michael@0:   // If there is already a shadow element point, remove
michael@0:   // the projected shadow because it is no longer an insertion
michael@0:   // point.
michael@0:   if (mShadowElement) {
michael@0:     mShadowElement->SetProjectedShadow(nullptr);
michael@0:   }
michael@0: 
michael@0:   if (mOlderShadow) {
michael@0:     // Nodes for distribution will come from the new shadow element.
michael@0:     mOlderShadow->ChangePoolHost(aShadowElement);
michael@0:   }
michael@0: 
michael@0:   // Set the new shadow element to project the older ShadowRoot because
michael@0:   // it is the current shadow insertion point.
michael@0:   mShadowElement = aShadowElement;
michael@0:   if (mShadowElement) {
michael@0:     mShadowElement->SetProjectedShadow(mOlderShadow);
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::ChangePoolHost(nsIContent* aNewHost)
michael@0: {
michael@0:   if (mPoolHost) {
michael@0:     mPoolHost->RemoveMutationObserver(this);
michael@0:   }
michael@0: 
michael@0:   // Clear the nodes matched to content insertion points
michael@0:   // because it is no longer relevant.
michael@0:   for (uint32_t i = 0; i < mInsertionPoints.Length(); i++) {
michael@0:     mInsertionPoints[i]->ClearMatchedNodes();
michael@0:   }
michael@0: 
michael@0:   mPoolHost = aNewHost;
michael@0:   if (mPoolHost) {
michael@0:     mPoolHost->AddMutationObserver(this);
michael@0:   }
michael@0: }
michael@0: 
michael@0: bool
michael@0: ShadowRoot::IsShadowInsertionPoint(nsIContent* aContent)
michael@0: {
michael@0:   if (aContent && aContent->IsHTML(nsGkAtoms::shadow)) {
michael@0:     HTMLShadowElement* shadowElem = static_cast<HTMLShadowElement*>(aContent);
michael@0:     return shadowElem->IsInsertionPoint();
michael@0:   }
michael@0:   return false;
michael@0: }
michael@0: 
michael@0: /**
michael@0:  * Returns whether the web components pool population algorithm
michael@0:  * on the host would contain |aContent|. This function ignores
michael@0:  * insertion points in the pool, thus should only be used to
michael@0:  * test nodes that have not yet been distributed.
michael@0:  */
michael@0: bool
michael@0: ShadowRoot::IsPooledNode(nsIContent* aContent, nsIContent* aContainer,
michael@0:                          nsIContent* aHost)
michael@0: {
michael@0:   if (nsContentUtils::IsContentInsertionPoint(aContent) ||
michael@0:       IsShadowInsertionPoint(aContent)) {
michael@0:     // Insertion points never end up in the pool.
michael@0:     return false;
michael@0:   }
michael@0: 
michael@0:   if (aContainer->IsHTML(nsGkAtoms::content)) {
michael@0:     // Fallback content will end up in pool if its parent is a child of the host.
michael@0:     HTMLContentElement* content = static_cast<HTMLContentElement*>(aContainer);
michael@0:     return content->IsInsertionPoint() && content->MatchedNodes().IsEmpty() &&
michael@0:            aContainer->GetParentNode() == aHost;
michael@0:   }
michael@0: 
michael@0:   if (aContainer == aHost) {
michael@0:     // Any other child nodes of the host will end up in the pool.
michael@0:     return true;
michael@0:   }
michael@0: 
michael@0:   return false;
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::AttributeChanged(nsIDocument* aDocument,
michael@0:                              Element* aElement,
michael@0:                              int32_t aNameSpaceID,
michael@0:                              nsIAtom* aAttribute,
michael@0:                              int32_t aModType)
michael@0: {
michael@0:   if (!IsPooledNode(aElement, aElement->GetParent(), mPoolHost)) {
michael@0:     return;
michael@0:   }
michael@0: 
michael@0:   // Attributes may change insertion point matching, find its new distribution.
michael@0:   RemoveDistributedNode(aElement);
michael@0:   DistributeSingleNode(aElement);
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::ContentAppended(nsIDocument* aDocument,
michael@0:                             nsIContent* aContainer,
michael@0:                             nsIContent* aFirstNewContent,
michael@0:                             int32_t aNewIndexInContainer)
michael@0: {
michael@0:   if (mInsertionPointChanged) {
michael@0:     DistributeAllNodes();
michael@0:     mInsertionPointChanged = false;
michael@0:     return;
michael@0:   }
michael@0: 
michael@0:   // Watch for new nodes added to the pool because the node
michael@0:   // may need to be added to an insertion point.
michael@0:   nsIContent* currentChild = aFirstNewContent;
michael@0:   while (currentChild) {
michael@0:     if (IsPooledNode(currentChild, aContainer, mPoolHost)) {
michael@0:       DistributeSingleNode(currentChild);
michael@0:     }
michael@0:     currentChild = currentChild->GetNextSibling();
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::ContentInserted(nsIDocument* aDocument,
michael@0:                             nsIContent* aContainer,
michael@0:                             nsIContent* aChild,
michael@0:                             int32_t aIndexInContainer)
michael@0: {
michael@0:   if (mInsertionPointChanged) {
michael@0:     DistributeAllNodes();
michael@0:     mInsertionPointChanged = false;
michael@0:     return;
michael@0:   }
michael@0: 
michael@0:   // Watch for new nodes added to the pool because the node
michael@0:   // may need to be added to an insertion point.
michael@0:   if (IsPooledNode(aChild, aContainer, mPoolHost)) {
michael@0:     DistributeSingleNode(aChild);
michael@0:   }
michael@0: }
michael@0: 
michael@0: void
michael@0: ShadowRoot::ContentRemoved(nsIDocument* aDocument,
michael@0:                            nsIContent* aContainer,
michael@0:                            nsIContent* aChild,
michael@0:                            int32_t aIndexInContainer,
michael@0:                            nsIContent* aPreviousSibling)
michael@0: {
michael@0:   if (mInsertionPointChanged) {
michael@0:     DistributeAllNodes();
michael@0:     mInsertionPointChanged = false;
michael@0:     return;
michael@0:   }
michael@0: 
michael@0:   // Watch for node that is removed from the pool because
michael@0:   // it may need to be removed from an insertion point.
michael@0:   if (IsPooledNode(aChild, aContainer, mPoolHost)) {
michael@0:     RemoveDistributedNode(aChild);
michael@0:   }
michael@0: }
michael@0: 
michael@0: NS_IMPL_CYCLE_COLLECTION_INHERITED(ShadowRootStyleSheetList, StyleSheetList,
michael@0:                                    mShadowRoot)
michael@0: 
michael@0: NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION_INHERITED(ShadowRootStyleSheetList)
michael@0: NS_INTERFACE_MAP_END_INHERITING(StyleSheetList)
michael@0: 
michael@0: NS_IMPL_ADDREF_INHERITED(ShadowRootStyleSheetList, StyleSheetList)
michael@0: NS_IMPL_RELEASE_INHERITED(ShadowRootStyleSheetList, StyleSheetList)
michael@0: 
michael@0: ShadowRootStyleSheetList::ShadowRootStyleSheetList(ShadowRoot* aShadowRoot)
michael@0:   : mShadowRoot(aShadowRoot)
michael@0: {
michael@0:   MOZ_COUNT_CTOR(ShadowRootStyleSheetList);
michael@0: }
michael@0: 
michael@0: ShadowRootStyleSheetList::~ShadowRootStyleSheetList()
michael@0: {
michael@0:   MOZ_COUNT_DTOR(ShadowRootStyleSheetList);
michael@0: }
michael@0: 
michael@0: nsCSSStyleSheet*
michael@0: ShadowRootStyleSheetList::IndexedGetter(uint32_t aIndex, bool& aFound)
michael@0: {
michael@0:   nsTArray<nsRefPtr<nsCSSStyleSheet>>* sheets =
michael@0:     mShadowRoot->mProtoBinding->GetStyleSheets();
michael@0: 
michael@0:   if (!sheets) {
michael@0:     aFound = false;
michael@0:     return nullptr;
michael@0:   }
michael@0: 
michael@0:   aFound = aIndex < sheets->Length();
michael@0:   return sheets->SafeElementAt(aIndex);
michael@0: }
michael@0: 
michael@0: uint32_t
michael@0: ShadowRootStyleSheetList::Length()
michael@0: {
michael@0:   nsTArray<nsRefPtr<nsCSSStyleSheet> >* sheets =
michael@0:     mShadowRoot->mProtoBinding->GetStyleSheets();
michael@0: 
michael@0:   if (!sheets) {
michael@0:     return 0;
michael@0:   }
michael@0: 
michael@0:   return sheets->Length();
michael@0: }
michael@0: