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 "MutationObserverInterestGroup.h" |
34 | |
35 | #include "MutationObserverRegistration.h" |
36 | #include "MutationRecord.h" |
37 | |
38 | namespace WebCore { |
39 | |
40 | inline MutationObserverInterestGroup::MutationObserverInterestGroup(HashMap<Ref<MutationObserver>, MutationRecordDeliveryOptions>&& observers, MutationRecordDeliveryOptions oldValueFlag) |
41 | : m_observers(WTFMove(observers)) |
42 | , m_oldValueFlag(oldValueFlag) |
43 | { |
44 | ASSERT(!m_observers.isEmpty()); |
45 | } |
46 | |
47 | std::unique_ptr<MutationObserverInterestGroup> MutationObserverInterestGroup::createIfNeeded(Node& target, MutationObserver::MutationType type, MutationRecordDeliveryOptions oldValueFlag, const QualifiedName* attributeName) |
48 | { |
49 | ASSERT((type == MutationObserver::Attributes && attributeName) || !attributeName); |
50 | auto observers = target.registeredMutationObservers(type, attributeName); |
51 | if (observers.isEmpty()) |
52 | return nullptr; |
53 | |
54 | return std::make_unique<MutationObserverInterestGroup>(WTFMove(observers), oldValueFlag); |
55 | } |
56 | |
57 | bool MutationObserverInterestGroup::isOldValueRequested() const |
58 | { |
59 | for (auto options : m_observers.values()) { |
60 | if (hasOldValue(options)) |
61 | return true; |
62 | } |
63 | return false; |
64 | } |
65 | |
66 | void MutationObserverInterestGroup::enqueueMutationRecord(Ref<MutationRecord>&& mutation) |
67 | { |
68 | RefPtr<MutationRecord> mutationWithNullOldValue; |
69 | for (auto& observerOptionsPair : m_observers) { |
70 | auto& observer = observerOptionsPair.key.get(); |
71 | if (hasOldValue(observerOptionsPair.value)) { |
72 | observer.enqueueMutationRecord(mutation.copyRef()); |
73 | continue; |
74 | } |
75 | if (!mutationWithNullOldValue) { |
76 | if (mutation->oldValue().isNull()) |
77 | mutationWithNullOldValue = mutation.ptr(); |
78 | else |
79 | mutationWithNullOldValue = MutationRecord::createWithNullOldValue(mutation).ptr(); |
80 | } |
81 | observer.enqueueMutationRecord(*mutationWithNullOldValue); |
82 | } |
83 | } |
84 | |
85 | } // namespace WebCore |
86 | |