blob: 7169bb25bab55378ec32040330b62d9f5a412937 [file] [log] [blame]
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +01001/*
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 "core/dom/MutationObserverInterestGroup.h"
34
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010035#include "core/dom/MutationRecord.h"
36#include "core/dom/Node.h"
37#include "core/dom/QualifiedName.h"
38
39namespace WebCore {
40
41PassOwnPtr<MutationObserverInterestGroup> MutationObserverInterestGroup::createIfNeeded(Node* target, MutationObserver::MutationType type, MutationRecordDeliveryOptions oldValueFlag, const QualifiedName* attributeName)
42{
43 ASSERT((type == MutationObserver::Attributes && attributeName) || !attributeName);
44 HashMap<MutationObserver*, MutationRecordDeliveryOptions> observers;
45 target->getRegisteredMutationObserversOfType(observers, type, attributeName);
46 if (observers.isEmpty())
47 return nullptr;
48
49 return adoptPtr(new MutationObserverInterestGroup(observers, oldValueFlag));
50}
51
52MutationObserverInterestGroup::MutationObserverInterestGroup(HashMap<MutationObserver*, MutationRecordDeliveryOptions>& observers, MutationRecordDeliveryOptions oldValueFlag)
53 : m_oldValueFlag(oldValueFlag)
54{
55 ASSERT(!observers.isEmpty());
56 m_observers.swap(observers);
57}
58
59bool MutationObserverInterestGroup::isOldValueRequested()
60{
61 for (HashMap<MutationObserver*, MutationRecordDeliveryOptions>::iterator iter = m_observers.begin(); iter != m_observers.end(); ++iter) {
62 if (hasOldValue(iter->value))
63 return true;
64 }
65 return false;
66}
67
68void MutationObserverInterestGroup::enqueueMutationRecord(PassRefPtr<MutationRecord> prpMutation)
69{
70 RefPtr<MutationRecord> mutation = prpMutation;
71 RefPtr<MutationRecord> mutationWithNullOldValue;
72 for (HashMap<MutationObserver*, MutationRecordDeliveryOptions>::iterator iter = m_observers.begin(); iter != m_observers.end(); ++iter) {
73 MutationObserver* observer = iter->key;
74 if (hasOldValue(iter->value)) {
75 observer->enqueueMutationRecord(mutation);
76 continue;
77 }
78 if (!mutationWithNullOldValue) {
79 if (mutation->oldValue().isNull())
80 mutationWithNullOldValue = mutation;
81 else
82 mutationWithNullOldValue = MutationRecord::createWithNullOldValue(mutation).get();
83 }
84 observer->enqueueMutationRecord(mutationWithNullOldValue);
85 }
86}
87
88} // namespace WebCore