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 MutationObserverInterestGroup_h
32 #define MutationObserverInterestGroup_h
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 "platform/heap/Handle.h"
39 #include "wtf/HashMap.h"
40 #include "wtf/PassOwnPtr.h"
44 class MutationObserverInterestGroup final : public NoBaseWillBeGarbageCollectedFinalized<MutationObserverInterestGroup> {
46 static PassOwnPtrWillBeRawPtr<MutationObserverInterestGroup> createForChildListMutation(Node& target)
48 if (!target.document().hasMutationObserversOfType(MutationObserver::ChildList))
51 MutationRecordDeliveryOptions oldValueFlag = 0;
52 return createIfNeeded(target, MutationObserver::ChildList, oldValueFlag);
55 static PassOwnPtrWillBeRawPtr<MutationObserverInterestGroup> createForCharacterDataMutation(Node& target)
57 if (!target.document().hasMutationObserversOfType(MutationObserver::CharacterData))
60 return createIfNeeded(target, MutationObserver::CharacterData, MutationObserver::CharacterDataOldValue);
63 static PassOwnPtrWillBeRawPtr<MutationObserverInterestGroup> createForAttributesMutation(Node& target, const QualifiedName& attributeName)
65 if (!target.document().hasMutationObserversOfType(MutationObserver::Attributes))
68 return createIfNeeded(target, MutationObserver::Attributes, MutationObserver::AttributeOldValue, &attributeName);
71 bool isOldValueRequested();
72 void enqueueMutationRecord(PassRefPtrWillBeRawPtr<MutationRecord>);
77 static PassOwnPtrWillBeRawPtr<MutationObserverInterestGroup> createIfNeeded(Node& target, MutationObserver::MutationType, MutationRecordDeliveryOptions oldValueFlag, const QualifiedName* attributeName = 0);
78 MutationObserverInterestGroup(WillBeHeapHashMap<RawPtrWillBeMember<MutationObserver>, MutationRecordDeliveryOptions>& observers, MutationRecordDeliveryOptions oldValueFlag);
80 bool hasOldValue(MutationRecordDeliveryOptions options) { return options & m_oldValueFlag; }
82 WillBeHeapHashMap<RawPtrWillBeMember<MutationObserver>, MutationRecordDeliveryOptions> m_observers;
83 MutationRecordDeliveryOptions m_oldValueFlag;
88 #endif // MutationObserverInterestGroup_h