1/* 2 * Copyright (C) 2011 Google Inc. All rights reserved. 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, are permitted provided that the following conditions are 6 * met: 7 * 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 13 * distribution. 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. 17 * 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. 29 */ 30 31#include "config.h" 32 33#include "MutationRecord.h" 34 35#include "Node.h" 36#include "NodeList.h" 37#include "QualifiedName.h" 38#include "StaticNodeList.h" 39#include <wtf/Assertions.h> 40#include <wtf/StdLibExtras.h> 41 42namespace WebCore { 43 44namespace { 45 46class ChildListRecord : public MutationRecord { 47public: 48 ChildListRecord(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling) 49 : m_target(target) 50 , m_addedNodes(added) 51 , m_removedNodes(removed) 52 , m_previousSibling(previousSibling) 53 , m_nextSibling(nextSibling) 54 { 55 } 56 57private: 58 virtual const AtomicString& type() OVERRIDE; 59 virtual Node* target() OVERRIDE { return m_target.get(); } 60 virtual NodeList* addedNodes() OVERRIDE { return m_addedNodes.get(); } 61 virtual NodeList* removedNodes() OVERRIDE { return m_removedNodes.get(); } 62 virtual Node* previousSibling() OVERRIDE { return m_previousSibling.get(); } 63 virtual Node* nextSibling() OVERRIDE { return m_nextSibling.get(); } 64 65 RefPtr<Node> m_target; 66 RefPtr<NodeList> m_addedNodes; 67 RefPtr<NodeList> m_removedNodes; 68 RefPtr<Node> m_previousSibling; 69 RefPtr<Node> m_nextSibling; 70}; 71 72class RecordWithEmptyNodeLists : public MutationRecord { 73public: 74 RecordWithEmptyNodeLists(PassRefPtr<Node> target, const String& oldValue) 75 : m_target(target) 76 , m_oldValue(oldValue) 77 { 78 } 79 80private: 81 virtual Node* target() OVERRIDE { return m_target.get(); } 82 virtual String oldValue() OVERRIDE { return m_oldValue; } 83 virtual NodeList* addedNodes() OVERRIDE { return lazilyInitializeEmptyNodeList(m_addedNodes); } 84 virtual NodeList* removedNodes() OVERRIDE { return lazilyInitializeEmptyNodeList(m_removedNodes); } 85 86 static NodeList* lazilyInitializeEmptyNodeList(RefPtr<NodeList>& nodeList) 87 { 88 if (!nodeList) 89 nodeList = StaticNodeList::createEmpty(); 90 return nodeList.get(); 91 } 92 93 RefPtr<Node> m_target; 94 String m_oldValue; 95 RefPtr<NodeList> m_addedNodes; 96 RefPtr<NodeList> m_removedNodes; 97}; 98 99class AttributesRecord : public RecordWithEmptyNodeLists { 100public: 101 AttributesRecord(PassRefPtr<Node> target, const QualifiedName& name, const AtomicString& oldValue) 102 : RecordWithEmptyNodeLists(target, oldValue) 103 , m_attributeName(name.localName()) 104 , m_attributeNamespace(name.namespaceURI()) 105 { 106 } 107 108private: 109 virtual const AtomicString& type() OVERRIDE; 110 virtual const AtomicString& attributeName() OVERRIDE { return m_attributeName; } 111 virtual const AtomicString& attributeNamespace() OVERRIDE { return m_attributeNamespace; } 112 113 AtomicString m_attributeName; 114 AtomicString m_attributeNamespace; 115}; 116 117class CharacterDataRecord : public RecordWithEmptyNodeLists { 118public: 119 CharacterDataRecord(PassRefPtr<Node> target, const String& oldValue) 120 : RecordWithEmptyNodeLists(target, oldValue) 121 { 122 } 123 124private: 125 virtual const AtomicString& type() OVERRIDE; 126}; 127 128class MutationRecordWithNullOldValue : public MutationRecord { 129public: 130 MutationRecordWithNullOldValue(PassRefPtr<MutationRecord> record) 131 : m_record(record) 132 { 133 } 134 135private: 136 virtual const AtomicString& type() OVERRIDE { return m_record->type(); } 137 virtual Node* target() OVERRIDE { return m_record->target(); } 138 virtual NodeList* addedNodes() OVERRIDE { return m_record->addedNodes(); } 139 virtual NodeList* removedNodes() OVERRIDE { return m_record->removedNodes(); } 140 virtual Node* previousSibling() OVERRIDE { return m_record->previousSibling(); } 141 virtual Node* nextSibling() OVERRIDE { return m_record->nextSibling(); } 142 virtual const AtomicString& attributeName() OVERRIDE { return m_record->attributeName(); } 143 virtual const AtomicString& attributeNamespace() OVERRIDE { return m_record->attributeNamespace(); } 144 145 virtual String oldValue() OVERRIDE { return String(); } 146 147 RefPtr<MutationRecord> m_record; 148}; 149 150const AtomicString& ChildListRecord::type() 151{ 152 DEFINE_STATIC_LOCAL(AtomicString, childList, ("childList", AtomicString::ConstructFromLiteral)); 153 return childList; 154} 155 156const AtomicString& AttributesRecord::type() 157{ 158 DEFINE_STATIC_LOCAL(AtomicString, attributes, ("attributes", AtomicString::ConstructFromLiteral)); 159 return attributes; 160} 161 162const AtomicString& CharacterDataRecord::type() 163{ 164 DEFINE_STATIC_LOCAL(AtomicString, characterData, ("characterData", AtomicString::ConstructFromLiteral)); 165 return characterData; 166} 167 168} // namespace 169 170PassRefPtr<MutationRecord> MutationRecord::createChildList(PassRefPtr<Node> target, PassRefPtr<NodeList> added, PassRefPtr<NodeList> removed, PassRefPtr<Node> previousSibling, PassRefPtr<Node> nextSibling) 171{ 172 return adoptRef(static_cast<MutationRecord*>(new ChildListRecord(target, added, removed, previousSibling, nextSibling))); 173} 174 175PassRefPtr<MutationRecord> MutationRecord::createAttributes(PassRefPtr<Node> target, const QualifiedName& name, const AtomicString& oldValue) 176{ 177 return adoptRef(static_cast<MutationRecord*>(new AttributesRecord(target, name, oldValue))); 178} 179 180PassRefPtr<MutationRecord> MutationRecord::createCharacterData(PassRefPtr<Node> target, const String& oldValue) 181{ 182 return adoptRef(static_cast<MutationRecord*>(new CharacterDataRecord(target, oldValue))); 183} 184 185PassRefPtr<MutationRecord> MutationRecord::createWithNullOldValue(PassRefPtr<MutationRecord> record) 186{ 187 return adoptRef(static_cast<MutationRecord*>(new MutationRecordWithNullOldValue(record))); 188} 189 190MutationRecord::~MutationRecord() 191{ 192} 193 194} // namespace WebCore 195