| OLD | NEW | 
|---|
| 1 /* | 1 /* | 
| 2  * Copyright (C) 2013 Google Inc. All rights reserved. | 2  * Copyright (C) 2013 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 | 5  * modification, are permitted provided that the following conditions | 
| 6  * are met: | 6  * are met: | 
| 7  * | 7  * | 
| 8  * 1. Redistributions of source code must retain the above copyright | 8  * 1. 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  * 2. Redistributions in binary form must reproduce the above copyright | 10  * 2. Redistributions in binary form must reproduce the above copyright | 
| (...skipping 11 matching lines...) Expand all  Loading... | 
| 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 "config.h" | 
| 32 #include "core/dom/CustomElementCallbackScheduler.h" | 32 #include "core/dom/custom/CustomElementCallbackScheduler.h" | 
| 33 | 33 | 
| 34 #include "core/dom/CustomElementCallbackDispatcher.h" |  | 
| 35 #include "core/dom/CustomElementCallbackQueue.h" |  | 
| 36 #include "core/dom/CustomElementLifecycleCallbacks.h" |  | 
| 37 #include "core/dom/Element.h" | 34 #include "core/dom/Element.h" | 
|  | 35 #include "core/dom/custom/CustomElementCallbackDispatcher.h" | 
|  | 36 #include "core/dom/custom/CustomElementCallbackQueue.h" | 
|  | 37 #include "core/dom/custom/CustomElementLifecycleCallbacks.h" | 
| 38 | 38 | 
| 39 namespace WebCore { | 39 namespace WebCore { | 
| 40 | 40 | 
| 41 void CustomElementCallbackScheduler::scheduleAttributeChangedCallback(PassRefPtr
     <CustomElementLifecycleCallbacks> callbacks, PassRefPtr<Element> element, const 
     AtomicString& name, const AtomicString& oldValue, const AtomicString& newValue) | 41 void CustomElementCallbackScheduler::scheduleAttributeChangedCallback(PassRefPtr
     <CustomElementLifecycleCallbacks> callbacks, PassRefPtr<Element> element, const 
     AtomicString& name, const AtomicString& oldValue, const AtomicString& newValue) | 
| 42 { | 42 { | 
| 43     if (!callbacks->hasAttributeChangedCallback()) | 43     if (!callbacks->hasAttributeChangedCallback()) | 
| 44         return; | 44         return; | 
| 45 | 45 | 
| 46     CustomElementCallbackQueue* queue = instance().schedule(element); | 46     CustomElementCallbackQueue* queue = instance().schedule(element); | 
| 47     queue->append(CustomElementCallbackInvocation::createAttributeChangedInvocat
     ion(callbacks, name, oldValue, newValue)); | 47     queue->append(CustomElementCallbackInvocation::createAttributeChangedInvocat
     ion(callbacks, name, oldValue, newValue)); | 
| (...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 113 // stack. Because callback queues are processed exhaustively, this | 113 // stack. Because callback queues are processed exhaustively, this | 
| 114 // effectively moves the callback queue to the top of the stack. | 114 // effectively moves the callback queue to the top of the stack. | 
| 115 CustomElementCallbackQueue* CustomElementCallbackScheduler::scheduleInCurrentEle
     mentQueue(PassRefPtr<Element> element) | 115 CustomElementCallbackQueue* CustomElementCallbackScheduler::scheduleInCurrentEle
     mentQueue(PassRefPtr<Element> element) | 
| 116 { | 116 { | 
| 117     CustomElementCallbackQueue* callbackQueue = ensureCallbackQueue(element); | 117     CustomElementCallbackQueue* callbackQueue = ensureCallbackQueue(element); | 
| 118     CustomElementCallbackDispatcher::instance().enqueue(callbackQueue); | 118     CustomElementCallbackDispatcher::instance().enqueue(callbackQueue); | 
| 119     return callbackQueue; | 119     return callbackQueue; | 
| 120 } | 120 } | 
| 121 | 121 | 
| 122 } // namespace WebCore | 122 } // namespace WebCore | 
| OLD | NEW | 
|---|