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 "GCReachableRef.h" |
34 | #include "MutationObserver.h" |
35 | #include <wtf/HashSet.h> |
36 | #include <wtf/text/AtomicString.h> |
37 | #include <wtf/text/AtomicStringHash.h> |
38 | |
39 | namespace WebCore { |
40 | |
41 | class QualifiedName; |
42 | |
43 | class MutationObserverRegistration { |
44 | WTF_MAKE_FAST_ALLOCATED; |
45 | public: |
46 | MutationObserverRegistration(MutationObserver&, Node&, MutationObserverOptions, const HashSet<AtomicString>& attributeFilter); |
47 | ~MutationObserverRegistration(); |
48 | |
49 | void resetObservation(MutationObserverOptions, const HashSet<AtomicString>& attributeFilter); |
50 | void observedSubtreeNodeWillDetach(Node&); |
51 | std::unique_ptr<HashSet<GCReachableRef<Node>>> takeTransientRegistrations(); |
52 | bool hasTransientRegistrations() const { return m_transientRegistrationNodes && !m_transientRegistrationNodes->isEmpty(); } |
53 | |
54 | bool shouldReceiveMutationFrom(Node&, MutationObserver::MutationType, const QualifiedName* attributeName) const; |
55 | bool isSubtree() const { return m_options & MutationObserver::Subtree; } |
56 | |
57 | MutationObserver& observer() { return m_observer.get(); } |
58 | Node& node() { return m_node; } |
59 | MutationRecordDeliveryOptions deliveryOptions() const { return m_options & (MutationObserver::AttributeOldValue | MutationObserver::CharacterDataOldValue); } |
60 | MutationObserverOptions mutationTypes() const { return m_options & MutationObserver::AllMutationTypes; } |
61 | |
62 | void addRegistrationNodesToSet(HashSet<Node*>&) const; |
63 | |
64 | private: |
65 | Ref<MutationObserver> m_observer; |
66 | Node& m_node; |
67 | RefPtr<Node> m_nodeKeptAlive; |
68 | std::unique_ptr<HashSet<GCReachableRef<Node>>> m_transientRegistrationNodes; |
69 | MutationObserverOptions m_options; |
70 | HashSet<AtomicString> m_attributeFilter; |
71 | }; |
72 | |
73 | } // namespace WebCore |
74 | |