1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
/*
* 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 "DocumentInlines.h"
#include "MutationObserver.h"
#include <memory>
#include <wtf/Noncopyable.h>
#include <wtf/RefCounted.h>
#include <wtf/WeakPtr.h>
namespace WebCore {
class MutationObserverInterestGroup;
// ChildListMutationAccumulator is not meant to be used directly; ChildListMutationScope is the public interface.
class ChildListMutationAccumulator : public RefCounted<ChildListMutationAccumulator>, public CanMakeSingleThreadWeakPtr<ChildListMutationAccumulator> {
public:
static Ref<ChildListMutationAccumulator> getOrCreate(ContainerNode&);
~ChildListMutationAccumulator();
void childAdded(Node&);
void willRemoveChild(Node&);
bool hasObservers() const { return !!m_observers; }
private:
ChildListMutationAccumulator(ContainerNode&, std::unique_ptr<MutationObserverInterestGroup>);
void enqueueMutationRecord();
bool isEmpty();
bool isAddedNodeInOrder(Node&);
bool isRemovedNodeInOrder(Node&);
Ref<ContainerNode> protectedTarget() const;
Ref<ContainerNode> m_target;
Vector<Ref<Node>> m_removedNodes;
Vector<Ref<Node>> m_addedNodes;
RefPtr<Node> m_previousSibling;
RefPtr<Node> m_nextSibling;
WeakPtr<Node, WeakPtrImplWithEventTargetData> m_lastAdded;
std::unique_ptr<MutationObserverInterestGroup> m_observers;
};
class ChildListMutationScope {
WTF_MAKE_NONCOPYABLE(ChildListMutationScope);
public:
explicit ChildListMutationScope(ContainerNode& target)
{
if (target.document().hasMutationObserversOfType(MutationObserverOptionType::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<ChildListMutationAccumulator> m_accumulator;
};
} // namespace WebCore
|
