| 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/custom/CustomElementCallbackDispatcher.h" | 32 #include "core/dom/custom/CustomElementProcessingStack.h" |
| 33 | 33 |
| 34 #include "core/dom/custom/CustomElementCallbackQueue.h" | 34 #include "core/dom/custom/CustomElementCallbackQueue.h" |
| 35 #include "core/dom/custom/CustomElementScheduler.h" | 35 #include "core/dom/custom/CustomElementScheduler.h" |
| 36 #include "wtf/MainThread.h" | 36 #include "wtf/MainThread.h" |
| 37 | 37 |
| 38 namespace blink { | 38 namespace blink { |
| 39 | 39 |
| 40 size_t CustomElementCallbackDispatcher::s_elementQueueStart = 0; | 40 size_t CustomElementProcessingStack::s_elementQueueStart = 0; |
| 41 | 41 |
| 42 // The base of the stack has a null sentinel value. | 42 // The base of the stack has a null sentinel value. |
| 43 size_t CustomElementCallbackDispatcher::s_elementQueueEnd = kNumSentinels; | 43 size_t CustomElementProcessingStack::s_elementQueueEnd = kNumSentinels; |
| 44 | 44 |
| 45 CustomElementCallbackDispatcher& CustomElementCallbackDispatcher::instance() | 45 CustomElementProcessingStack& CustomElementProcessingStack::instance() |
| 46 { | 46 { |
| 47 DEFINE_STATIC_LOCAL(CustomElementCallbackDispatcher, instance, ()); | 47 DEFINE_STATIC_LOCAL(CustomElementProcessingStack, instance, ()); |
| 48 return instance; | 48 return instance; |
| 49 } | 49 } |
| 50 | 50 |
| 51 // Dispatches callbacks when popping the processing stack. | 51 // Dispatches callbacks when popping the processing stack. |
| 52 void CustomElementCallbackDispatcher::processElementQueueAndPop() | 52 void CustomElementProcessingStack::processElementQueueAndPop() |
| 53 { | 53 { |
| 54 instance().processElementQueueAndPop(s_elementQueueStart, s_elementQueueEnd)
; | 54 instance().processElementQueueAndPop(s_elementQueueStart, s_elementQueueEnd)
; |
| 55 } | 55 } |
| 56 | 56 |
| 57 void CustomElementCallbackDispatcher::processElementQueueAndPop(size_t start, si
ze_t end) | 57 void CustomElementProcessingStack::processElementQueueAndPop(size_t start, size_
t end) |
| 58 { | 58 { |
| 59 ASSERT(isMainThread()); | 59 ASSERT(isMainThread()); |
| 60 CustomElementCallbackQueue::ElementQueueId thisQueue = currentElementQueue()
; | 60 CustomElementCallbackQueue::ElementQueueId thisQueue = currentElementQueue()
; |
| 61 | 61 |
| 62 for (size_t i = start; i < end; i++) { | 62 for (size_t i = start; i < end; ++i) { |
| 63 { | 63 { |
| 64 // The created callback may schedule entered document | 64 // The created callback may schedule entered document |
| 65 // callbacks. | 65 // callbacks. |
| 66 CallbackDeliveryScope deliveryScope; | 66 CallbackDeliveryScope deliveryScope; |
| 67 m_flattenedProcessingStack[i]->processInElementQueue(thisQueue); | 67 m_flattenedProcessingStack[i]->processInElementQueue(thisQueue); |
| 68 } | 68 } |
| 69 | 69 |
| 70 ASSERT(start == s_elementQueueStart); | 70 ASSERT(start == s_elementQueueStart); |
| 71 ASSERT(end == s_elementQueueEnd); | 71 ASSERT(end == s_elementQueueEnd); |
| 72 } | 72 } |
| 73 | 73 |
| 74 // Pop the element queue from the processing stack | 74 // Pop the element queue from the processing stack |
| 75 m_flattenedProcessingStack.resize(start); | 75 m_flattenedProcessingStack.resize(start); |
| 76 s_elementQueueEnd = start; | 76 s_elementQueueEnd = start; |
| 77 | 77 |
| 78 if (s_elementQueueStart == kNumSentinels) | 78 if (s_elementQueueStart == kNumSentinels) |
| 79 CustomElementScheduler::callbackDispatcherDidFinish(); | 79 CustomElementScheduler::callbackDispatcherDidFinish(); |
| 80 } | 80 } |
| 81 | 81 |
| 82 void CustomElementCallbackDispatcher::enqueue(CustomElementCallbackQueue* callba
ckQueue) | 82 void CustomElementProcessingStack::enqueue(CustomElementCallbackQueue* callbackQ
ueue) |
| 83 { | 83 { |
| 84 ASSERT(inCallbackDeliveryScope()); | 84 ASSERT(inCallbackDeliveryScope()); |
| 85 | 85 |
| 86 if (callbackQueue->owner() == currentElementQueue()) | 86 if (callbackQueue->owner() == currentElementQueue()) |
| 87 return; | 87 return; |
| 88 | 88 |
| 89 callbackQueue->setOwner(currentElementQueue()); | 89 callbackQueue->setOwner(currentElementQueue()); |
| 90 | 90 |
| 91 m_flattenedProcessingStack.append(callbackQueue); | 91 m_flattenedProcessingStack.append(callbackQueue); |
| 92 ++s_elementQueueEnd; | 92 ++s_elementQueueEnd; |
| 93 } | 93 } |
| 94 | 94 |
| 95 } // namespace blink | 95 } // namespace blink |
| OLD | NEW |