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.
33 #include "core/dom/MutationRecord.h"
35 #include "core/dom/Node.h"
36 #include "core/dom/NodeList.h"
37 #include "core/dom/QualifiedName.h"
38 #include "core/dom/StaticNodeList.h"
39 #include "wtf/StdLibExtras.h"
45 class ChildListRecord : public MutationRecord {
47 ChildListRecord(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling)
50 , m_removedNodes(removed)
51 , m_previousSibling(previousSibling)
52 , m_nextSibling(nextSibling)
56 virtual void trace(Visitor* visitor) override
58 visitor->trace(m_target);
59 visitor->trace(m_addedNodes);
60 visitor->trace(m_removedNodes);
61 visitor->trace(m_previousSibling);
62 visitor->trace(m_nextSibling);
63 MutationRecord::trace(visitor);
67 virtual const AtomicString& type() override;
68 virtual Node* target() override { return m_target.get(); }
69 virtual StaticNodeList* addedNodes() override { return m_addedNodes.get(); }
70 virtual StaticNodeList* removedNodes() override { return m_removedNodes.get(); }
71 virtual Node* previousSibling() override { return m_previousSibling.get(); }
72 virtual Node* nextSibling() override { return m_nextSibling.get(); }
74 RefPtrWillBeMember<Node> m_target;
75 RefPtrWillBeMember<StaticNodeList> m_addedNodes;
76 RefPtrWillBeMember<StaticNodeList> m_removedNodes;
77 RefPtrWillBeMember<Node> m_previousSibling;
78 RefPtrWillBeMember<Node> m_nextSibling;
81 class RecordWithEmptyNodeLists : public MutationRecord {
83 RecordWithEmptyNodeLists(PassRefPtrWillBeRawPtr<Node> target, const String& oldValue)
85 , m_oldValue(oldValue)
89 virtual void trace(Visitor* visitor) override
91 visitor->trace(m_target);
92 visitor->trace(m_addedNodes);
93 visitor->trace(m_removedNodes);
94 MutationRecord::trace(visitor);
98 virtual Node* target() override { return m_target.get(); }
99 virtual String oldValue() override { return m_oldValue; }
100 virtual StaticNodeList* addedNodes() override { return lazilyInitializeEmptyNodeList(m_addedNodes); }
101 virtual StaticNodeList* removedNodes() override { return lazilyInitializeEmptyNodeList(m_removedNodes); }
103 static StaticNodeList* lazilyInitializeEmptyNodeList(RefPtrWillBeMember<StaticNodeList>& nodeList)
106 nodeList = StaticNodeList::createEmpty();
107 return nodeList.get();
110 RefPtrWillBeMember<Node> m_target;
112 RefPtrWillBeMember<StaticNodeList> m_addedNodes;
113 RefPtrWillBeMember<StaticNodeList> m_removedNodes;
116 class AttributesRecord : public RecordWithEmptyNodeLists {
118 AttributesRecord(PassRefPtrWillBeRawPtr<Node> target, const QualifiedName& name, const AtomicString& oldValue)
119 : RecordWithEmptyNodeLists(target, oldValue)
120 , m_attributeName(name.localName())
121 , m_attributeNamespace(name.namespaceURI())
126 virtual const AtomicString& type() override;
127 virtual const AtomicString& attributeName() override { return m_attributeName; }
128 virtual const AtomicString& attributeNamespace() override { return m_attributeNamespace; }
130 AtomicString m_attributeName;
131 AtomicString m_attributeNamespace;
134 class CharacterDataRecord : public RecordWithEmptyNodeLists {
136 CharacterDataRecord(PassRefPtrWillBeRawPtr<Node> target, const String& oldValue)
137 : RecordWithEmptyNodeLists(target, oldValue)
142 virtual const AtomicString& type() override;
145 class MutationRecordWithNullOldValue : public MutationRecord {
147 MutationRecordWithNullOldValue(PassRefPtrWillBeRawPtr<MutationRecord> record)
152 virtual void trace(Visitor* visitor) override
154 visitor->trace(m_record);
155 MutationRecord::trace(visitor);
159 virtual const AtomicString& type() override { return m_record->type(); }
160 virtual Node* target() override { return m_record->target(); }
161 virtual StaticNodeList* addedNodes() override { return m_record->addedNodes(); }
162 virtual StaticNodeList* removedNodes() override { return m_record->removedNodes(); }
163 virtual Node* previousSibling() override { return m_record->previousSibling(); }
164 virtual Node* nextSibling() override { return m_record->nextSibling(); }
165 virtual const AtomicString& attributeName() override { return m_record->attributeName(); }
166 virtual const AtomicString& attributeNamespace() override { return m_record->attributeNamespace(); }
168 virtual String oldValue() override { return String(); }
170 RefPtrWillBeMember<MutationRecord> m_record;
173 const AtomicString& ChildListRecord::type()
175 DEFINE_STATIC_LOCAL(AtomicString, childList, ("childList", AtomicString::ConstructFromLiteral));
179 const AtomicString& AttributesRecord::type()
181 DEFINE_STATIC_LOCAL(AtomicString, attributes, ("attributes", AtomicString::ConstructFromLiteral));
185 const AtomicString& CharacterDataRecord::type()
187 DEFINE_STATIC_LOCAL(AtomicString, characterData, ("characterData", AtomicString::ConstructFromLiteral));
188 return characterData;
193 PassRefPtrWillBeRawPtr<MutationRecord> MutationRecord::createChildList(PassRefPtrWillBeRawPtr<Node> target, PassRefPtrWillBeRawPtr<StaticNodeList> added, PassRefPtrWillBeRawPtr<StaticNodeList> removed, PassRefPtrWillBeRawPtr<Node> previousSibling, PassRefPtrWillBeRawPtr<Node> nextSibling)
195 return adoptRefWillBeNoop(new ChildListRecord(target, added, removed, previousSibling, nextSibling));
198 PassRefPtrWillBeRawPtr<MutationRecord> MutationRecord::createAttributes(PassRefPtrWillBeRawPtr<Node> target, const QualifiedName& name, const AtomicString& oldValue)
200 return adoptRefWillBeNoop(new AttributesRecord(target, name, oldValue));
203 PassRefPtrWillBeRawPtr<MutationRecord> MutationRecord::createCharacterData(PassRefPtrWillBeRawPtr<Node> target, const String& oldValue)
205 return adoptRefWillBeNoop(new CharacterDataRecord(target, oldValue));
208 PassRefPtrWillBeRawPtr<MutationRecord> MutationRecord::createWithNullOldValue(PassRefPtrWillBeRawPtr<MutationRecord> record)
210 return adoptRefWillBeNoop(new MutationRecordWithNullOldValue(record));
213 MutationRecord::~MutationRecord()