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