/* * 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: * 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. * * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS 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. */ #ifndef CachedHTMLCollection_h #define CachedHTMLCollection_h #include "CollectionTraversal.h" #include "HTMLCollection.h" #include "HTMLElement.h" namespace WebCore { template class CachedHTMLCollection : public HTMLCollection { public: CachedHTMLCollection(ContainerNode& base, CollectionType); virtual ~CachedHTMLCollection(); virtual unsigned length() const override final { return m_indexCache.nodeCount(collection()); } virtual Element* item(unsigned offset) const override { return m_indexCache.nodeAt(collection(), offset); } virtual Element* namedItem(const AtomicString& name) const override; virtual size_t memoryCost() const override final { return m_indexCache.memoryCost() + HTMLCollection::memoryCost(); } // For CollectionIndexCache; do not use elsewhere. using CollectionTraversalIterator = typename CollectionTraversal::Iterator; CollectionTraversalIterator collectionBegin() const { return CollectionTraversal::begin(collection(), rootNode()); } CollectionTraversalIterator collectionLast() const { return CollectionTraversal::last(collection(), rootNode()); } CollectionTraversalIterator collectionEnd() const { return CollectionTraversal::end(rootNode()); } void collectionTraverseForward(CollectionTraversalIterator& current, unsigned count, unsigned& traversedCount) const { CollectionTraversal::traverseForward(collection(), current, count, traversedCount); } void collectionTraverseBackward(CollectionTraversalIterator& current, unsigned count) const { CollectionTraversal::traverseBackward(collection(), current, count); } bool collectionCanTraverseBackward() const { return traversalType != CollectionTraversalType::CustomForwardOnly; } void willValidateIndexCache() const { document().registerCollection(const_cast&>(*this)); } virtual void invalidateCache(Document&) override; bool elementMatches(Element&) const; private: HTMLCollectionClass& collection() { return static_cast(*this); } const HTMLCollectionClass& collection() const { return static_cast(*this); } mutable CollectionIndexCache m_indexCache; }; template CachedHTMLCollection::CachedHTMLCollection(ContainerNode& base, CollectionType collectionType) : HTMLCollection(base, collectionType) , m_indexCache(collection()) { } template CachedHTMLCollection::~CachedHTMLCollection() { if (m_indexCache.hasValidCache(collection())) document().unregisterCollection(*this); } template void CachedHTMLCollection::invalidateCache(Document& document) { HTMLCollection::invalidateCache(document); if (m_indexCache.hasValidCache(collection())) { document.unregisterCollection(*this); m_indexCache.invalidate(collection()); } } template bool CachedHTMLCollection::elementMatches(Element&) const { // We call the elementMatches() method directly on the subclass instead for performance. ASSERT_NOT_REACHED(); return false; } static inline bool nameShouldBeVisibleInDocumentAll(HTMLElement& element) { // The document.all collection returns only certain types of elements by name, // although it returns any type of element by id. return element.hasTagName(HTMLNames::appletTag) || element.hasTagName(HTMLNames::embedTag) || element.hasTagName(HTMLNames::formTag) || element.hasTagName(HTMLNames::imgTag) || element.hasTagName(HTMLNames::inputTag) || element.hasTagName(HTMLNames::objectTag) || element.hasTagName(HTMLNames::selectTag); } static inline bool nameShouldBeVisibleInDocumentAll(Element& element) { return is(element) && nameShouldBeVisibleInDocumentAll(downcast(element)); } template Element* CachedHTMLCollection::namedItem(const AtomicString& name) const { // http://msdn.microsoft.com/workshop/author/dhtml/reference/methods/nameditem.asp // This method first searches for an object with a matching id // attribute. If a match is not found, the method then searches for an // object with a matching name attribute, but only on those elements // that are allowed a name attribute. if (name.isEmpty()) return nullptr; ContainerNode& root = rootNode(); if (traversalType != CollectionTraversalType::CustomForwardOnly && root.isInTreeScope()) { Element* candidate = nullptr; TreeScope& treeScope = root.treeScope(); if (treeScope.hasElementWithId(*name.impl())) { if (!treeScope.containsMultipleElementsWithId(name)) candidate = treeScope.getElementById(name); } else if (treeScope.hasElementWithName(*name.impl())) { if (!treeScope.containsMultipleElementsWithName(name)) { candidate = treeScope.getElementByName(name); if (candidate && type() == DocAll && !nameShouldBeVisibleInDocumentAll(*candidate)) candidate = nullptr; } } else return nullptr; if (candidate && collection().elementMatches(*candidate)) { if (traversalType == CollectionTraversalType::ChildrenOnly ? candidate->parentNode() == &root : candidate->isDescendantOf(&root)) return candidate; } } return namedItemSlow(name); } } // namespace WebCore #endif // CachedHTMLCollection_h