| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 14 matching lines...) Expand all Loading... |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "config.h" | 31 #include "config.h" |
| 32 | 32 |
| 33 #include "core/dom/MutationObserverInterestGroup.h" | 33 #include "core/dom/MutationObserverInterestGroup.h" |
| 34 | 34 |
| 35 #include "core/dom/MutationObserverRegistration.h" | |
| 36 #include "core/dom/MutationRecord.h" | 35 #include "core/dom/MutationRecord.h" |
| 37 #include "core/dom/Node.h" | 36 #include "core/dom/Node.h" |
| 38 #include "core/dom/QualifiedName.h" | |
| 39 | 37 |
| 40 namespace WebCore { | 38 namespace WebCore { |
| 41 | 39 |
| 42 PassOwnPtr<MutationObserverInterestGroup> MutationObserverInterestGroup::createI
fNeeded(Node* target, MutationObserver::MutationType type, MutationRecordDeliver
yOptions oldValueFlag, const QualifiedName* attributeName) | 40 PassOwnPtr<MutationObserverInterestGroup> MutationObserverInterestGroup::createI
fNeeded(Node* target, MutationObserver::MutationType type, MutationRecordDeliver
yOptions oldValueFlag, const QualifiedName* attributeName) |
| 43 { | 41 { |
| 44 ASSERT((type == MutationObserver::Attributes && attributeName) || !attribute
Name); | 42 ASSERT((type == MutationObserver::Attributes && attributeName) || !attribute
Name); |
| 45 HashMap<MutationObserver*, MutationRecordDeliveryOptions> observers; | 43 HashMap<MutationObserver*, MutationRecordDeliveryOptions> observers; |
| 46 target->getRegisteredMutationObserversOfType(observers, type, attributeName)
; | 44 target->getRegisteredMutationObserversOfType(observers, type, attributeName)
; |
| 47 if (observers.isEmpty()) | 45 if (observers.isEmpty()) |
| 48 return nullptr; | 46 return nullptr; |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 80 if (mutation->oldValue().isNull()) | 78 if (mutation->oldValue().isNull()) |
| 81 mutationWithNullOldValue = mutation; | 79 mutationWithNullOldValue = mutation; |
| 82 else | 80 else |
| 83 mutationWithNullOldValue = MutationRecord::createWithNullOldValu
e(mutation).get(); | 81 mutationWithNullOldValue = MutationRecord::createWithNullOldValu
e(mutation).get(); |
| 84 } | 82 } |
| 85 observer->enqueueMutationRecord(mutationWithNullOldValue); | 83 observer->enqueueMutationRecord(mutationWithNullOldValue); |
| 86 } | 84 } |
| 87 } | 85 } |
| 88 | 86 |
| 89 } // namespace WebCore | 87 } // namespace WebCore |
| OLD | NEW |