2 * Copyright (C) 2011 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef ChildListMutationScope_h
32 #define ChildListMutationScope_h
34 #include "core/dom/Document.h"
35 #include "core/dom/MutationObserver.h"
36 #include "core/dom/Node.h"
37 #include "platform/heap/Handle.h"
38 #include "wtf/Noncopyable.h"
39 #include "wtf/OwnPtr.h"
40 #include "wtf/RefCounted.h"
44 class MutationObserverInterestGroup;
46 // ChildListMutationAccumulator is not meant to be used directly; ChildListMutationScope is the public interface.
47 class ChildListMutationAccumulator FINAL : public RefCounted<ChildListMutationAccumulator> {
49 static PassRefPtr<ChildListMutationAccumulator> getOrCreate(Node&);
50 ~ChildListMutationAccumulator();
52 void childAdded(PassRefPtr<Node>);
53 void willRemoveChild(PassRefPtr<Node>);
55 bool hasObservers() const { return m_observers; }
58 ChildListMutationAccumulator(PassRefPtr<Node>, PassOwnPtrWillBeRawPtr<MutationObserverInterestGroup>);
60 void enqueueMutationRecord();
62 bool isAddedNodeInOrder(Node*);
63 bool isRemovedNodeInOrder(Node*);
65 RefPtr<Node> m_target;
67 Vector<RefPtr<Node> > m_removedNodes;
68 Vector<RefPtr<Node> > m_addedNodes;
69 RefPtr<Node> m_previousSibling;
70 RefPtr<Node> m_nextSibling;
73 OwnPtrWillBePersistent<MutationObserverInterestGroup> m_observers;
76 class ChildListMutationScope FINAL {
77 WTF_MAKE_NONCOPYABLE(ChildListMutationScope);
80 explicit ChildListMutationScope(Node& target)
82 if (target.document().hasMutationObserversOfType(MutationObserver::ChildList))
83 m_accumulator = ChildListMutationAccumulator::getOrCreate(target);
86 void childAdded(Node& child)
88 if (m_accumulator && m_accumulator->hasObservers())
89 m_accumulator->childAdded(PassRefPtr<Node>(child));
92 void willRemoveChild(Node& child)
94 if (m_accumulator && m_accumulator->hasObservers())
95 m_accumulator->willRemoveChild(PassRefPtr<Node>(child));
99 RefPtr<ChildListMutationAccumulator> m_accumulator;
102 } // namespace WebCore
104 #endif // ChildListMutationScope_h