| 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 10 matching lines...) Expand all Loading... |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 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 "sky/engine/config.h" |
| 32 #include "core/dom/MutationObserver.h" | 32 #include "sky/engine/core/dom/MutationObserver.h" |
| 33 | 33 |
| 34 #include <algorithm> |
| 34 #include "base/bind.h" | 35 #include "base/bind.h" |
| 35 #include "bindings/core/v8/Dictionary.h" | 36 #include "sky/engine/bindings/core/v8/Dictionary.h" |
| 36 #include "bindings/core/v8/ExceptionState.h" | 37 #include "sky/engine/bindings/core/v8/ExceptionState.h" |
| 37 #include "core/dom/ExceptionCode.h" | 38 #include "sky/engine/core/dom/ExceptionCode.h" |
| 38 #include "core/dom/ExecutionContext.h" | 39 #include "sky/engine/core/dom/ExecutionContext.h" |
| 39 #include "core/dom/Microtask.h" | 40 #include "sky/engine/core/dom/Microtask.h" |
| 40 #include "core/dom/MutationCallback.h" | 41 #include "sky/engine/core/dom/MutationCallback.h" |
| 41 #include "core/dom/MutationObserverRegistration.h" | 42 #include "sky/engine/core/dom/MutationObserverRegistration.h" |
| 42 #include "core/dom/MutationRecord.h" | 43 #include "sky/engine/core/dom/MutationRecord.h" |
| 43 #include "core/dom/Node.h" | 44 #include "sky/engine/core/dom/Node.h" |
| 44 #include "wtf/MainThread.h" | 45 #include "sky/engine/wtf/MainThread.h" |
| 45 #include <algorithm> | |
| 46 | 46 |
| 47 namespace blink { | 47 namespace blink { |
| 48 | 48 |
| 49 static unsigned s_observerPriority = 0; | 49 static unsigned s_observerPriority = 0; |
| 50 | 50 |
| 51 struct MutationObserver::ObserverLessThan { | 51 struct MutationObserver::ObserverLessThan { |
| 52 bool operator()(const RefPtr<MutationObserver>& lhs, const RefPtr<MutationOb
server>& rhs) | 52 bool operator()(const RefPtr<MutationObserver>& lhs, const RefPtr<MutationOb
server>& rhs) |
| 53 { | 53 { |
| 54 return lhs->m_priority < rhs->m_priority; | 54 return lhs->m_priority < rhs->m_priority; |
| 55 } | 55 } |
| (...skipping 205 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 261 std::sort(observers.begin(), observers.end(), ObserverLessThan()); | 261 std::sort(observers.begin(), observers.end(), ObserverLessThan()); |
| 262 for (size_t i = 0; i < observers.size(); ++i) { | 262 for (size_t i = 0; i < observers.size(); ++i) { |
| 263 if (observers[i]->canDeliver()) | 263 if (observers[i]->canDeliver()) |
| 264 observers[i]->deliver(); | 264 observers[i]->deliver(); |
| 265 else | 265 else |
| 266 suspendedMutationObservers().add(observers[i]); | 266 suspendedMutationObservers().add(observers[i]); |
| 267 } | 267 } |
| 268 } | 268 } |
| 269 | 269 |
| 270 } // namespace blink | 270 } // namespace blink |
| OLD | NEW |