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 #ifndef MutationObserverInterestGroup_h 32 #define MutationObserverInterestGroup_h 33 34 #include "core/dom/Document.h" 35 #include "core/dom/MutationObserver.h" 36 #include "core/dom/Node.h" 37 #include "core/dom/QualifiedName.h" 38 #include "wtf/HashMap.h" 39 #include "wtf/PassOwnPtr.h" 40 41 namespace WebCore { 42 43 class MutationObserverInterestGroup { 44 public: createForChildListMutation(Node & target)45 static PassOwnPtr<MutationObserverInterestGroup> createForChildListMutation(Node& target) 46 { 47 if (!target.document().hasMutationObserversOfType(MutationObserver::ChildList)) 48 return nullptr; 49 50 MutationRecordDeliveryOptions oldValueFlag = 0; 51 return createIfNeeded(target, MutationObserver::ChildList, oldValueFlag); 52 } 53 createForCharacterDataMutation(Node & target)54 static PassOwnPtr<MutationObserverInterestGroup> createForCharacterDataMutation(Node& target) 55 { 56 if (!target.document().hasMutationObserversOfType(MutationObserver::CharacterData)) 57 return nullptr; 58 59 return createIfNeeded(target, MutationObserver::CharacterData, MutationObserver::CharacterDataOldValue); 60 } 61 createForAttributesMutation(Node & target,const QualifiedName & attributeName)62 static PassOwnPtr<MutationObserverInterestGroup> createForAttributesMutation(Node& target, const QualifiedName& attributeName) 63 { 64 if (!target.document().hasMutationObserversOfType(MutationObserver::Attributes)) 65 return nullptr; 66 67 return createIfNeeded(target, MutationObserver::Attributes, MutationObserver::AttributeOldValue, &attributeName); 68 } 69 70 bool isOldValueRequested(); 71 void enqueueMutationRecord(PassRefPtr<MutationRecord>); 72 73 private: 74 static PassOwnPtr<MutationObserverInterestGroup> createIfNeeded(Node& target, MutationObserver::MutationType, MutationRecordDeliveryOptions oldValueFlag, const QualifiedName* attributeName = 0); 75 MutationObserverInterestGroup(HashMap<MutationObserver*, MutationRecordDeliveryOptions>& observers, MutationRecordDeliveryOptions oldValueFlag); 76 hasOldValue(MutationRecordDeliveryOptions options)77 bool hasOldValue(MutationRecordDeliveryOptions options) { return options & m_oldValueFlag; } 78 79 HashMap<MutationObserver*, MutationRecordDeliveryOptions> m_observers; 80 MutationRecordDeliveryOptions m_oldValueFlag; 81 }; 82 83 } 84 85 #endif // MutationObserverInterestGroup_h 86