/* * Copyright (C) 2011 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. */ #pragma once #include "ContainerNode.h" #include "Document.h" #include "MutationObserver.h" #include #include #include namespace WebCore { class MutationObserverInterestGroup; // ChildListMutationAccumulator is not meant to be used directly; ChildListMutationScope is the public interface. class ChildListMutationAccumulator : public RefCounted { public: static Ref getOrCreate(ContainerNode&); ~ChildListMutationAccumulator(); void childAdded(Node&); void willRemoveChild(Node&); bool hasObservers() const { return !!m_observers; } private: ChildListMutationAccumulator(ContainerNode&, std::unique_ptr); void enqueueMutationRecord(); bool isEmpty(); bool isAddedNodeInOrder(Node&); bool isRemovedNodeInOrder(Node&); Ref m_target; Vector> m_removedNodes; Vector> m_addedNodes; RefPtr m_previousSibling; RefPtr m_nextSibling; Node* m_lastAdded; std::unique_ptr m_observers; }; class ChildListMutationScope { WTF_MAKE_NONCOPYABLE(ChildListMutationScope); public: explicit ChildListMutationScope(ContainerNode& target) { if (target.document().hasMutationObserversOfType(MutationObserver::ChildList)) m_accumulator = ChildListMutationAccumulator::getOrCreate(target); } bool canObserve() const { return m_accumulator; } void childAdded(Node& child) { if (m_accumulator && m_accumulator->hasObservers()) m_accumulator->childAdded(child); } void willRemoveChild(Node& child) { if (m_accumulator && m_accumulator->hasObservers()) m_accumulator->willRemoveChild(child); } private: RefPtr m_accumulator; }; } // namespace WebCore