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