| 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 #ifndef CustomElementCallbackDispatcher_h | 31 #ifndef CustomElementProcessingStack_h |
| 32 #define CustomElementCallbackDispatcher_h | 32 #define CustomElementProcessingStack_h |
| 33 | 33 |
| 34 #include "core/dom/custom/CustomElementCallbackQueue.h" | 34 #include "core/dom/custom/CustomElementCallbackQueue.h" |
| 35 #include "wtf/Vector.h" | 35 #include "wtf/Vector.h" |
| 36 | 36 |
| 37 namespace blink { | 37 namespace blink { |
| 38 | 38 |
| 39 class CustomElementScheduler; | 39 class CustomElementScheduler; |
| 40 | 40 |
| 41 // FIXME: Rename this CustomElementProcessingStack. It only handles | 41 class CustomElementProcessingStack { |
| 42 // the processing stack. | 42 WTF_MAKE_NONCOPYABLE(CustomElementProcessingStack); |
| 43 class CustomElementCallbackDispatcher { | |
| 44 WTF_MAKE_NONCOPYABLE(CustomElementCallbackDispatcher); | |
| 45 public: | 43 public: |
| 46 // This is stack allocated in many DOM callbacks. Make it cheap. | 44 // This is stack allocated in many DOM callbacks. Make it cheap. |
| 47 class CallbackDeliveryScope { | 45 class CallbackDeliveryScope { |
| 48 public: | 46 public: |
| 49 CallbackDeliveryScope() | 47 CallbackDeliveryScope() |
| 50 : m_savedElementQueueStart(s_elementQueueStart) | 48 : m_savedElementQueueStart(s_elementQueueStart) |
| 51 { | 49 { |
| 52 s_elementQueueStart = s_elementQueueEnd; | 50 s_elementQueueStart = s_elementQueueEnd; |
| 53 } | 51 } |
| 54 | 52 |
| 55 ~CallbackDeliveryScope() | 53 ~CallbackDeliveryScope() |
| 56 { | 54 { |
| 57 if (s_elementQueueStart != s_elementQueueEnd) | 55 if (s_elementQueueStart != s_elementQueueEnd) |
| 58 processElementQueueAndPop(); | 56 processElementQueueAndPop(); |
| 59 s_elementQueueStart = m_savedElementQueueStart; | 57 s_elementQueueStart = m_savedElementQueueStart; |
| 60 } | 58 } |
| 61 | 59 |
| 62 private: | 60 private: |
| 63 size_t m_savedElementQueueStart; | 61 size_t m_savedElementQueueStart; |
| 64 }; | 62 }; |
| 65 | 63 |
| 66 static bool inCallbackDeliveryScope() { return s_elementQueueStart; } | 64 static bool inCallbackDeliveryScope() { return s_elementQueueStart; } |
| 67 | 65 |
| 68 protected: | 66 protected: |
| 69 friend class CustomElementScheduler; | 67 friend class CustomElementScheduler; |
| 70 static CustomElementCallbackDispatcher& instance(); | 68 static CustomElementProcessingStack& instance(); |
| 71 void enqueue(CustomElementCallbackQueue*); | 69 void enqueue(CustomElementCallbackQueue*); |
| 72 | 70 |
| 73 private: | 71 private: |
| 74 CustomElementCallbackDispatcher() | 72 CustomElementProcessingStack() |
| 75 { | 73 { |
| 76 // Add a null element as a sentinel. This makes it possible to | 74 // Add a null element as a sentinel. This makes it possible to |
| 77 // identify elements queued when there is no | 75 // identify elements queued when there is no |
| 78 // CallbackDeliveryScope active. Also, if the processing stack | 76 // CallbackDeliveryScope active. Also, if the processing stack |
| 79 // is popped when empty, this sentinel will cause a null deref | 77 // is popped when empty, this sentinel will cause a null deref |
| 80 // crash. | 78 // crash. |
| 81 CustomElementCallbackQueue* sentinel = 0; | 79 CustomElementCallbackQueue* sentinel = 0; |
| 82 for (size_t i = 0; i < kNumSentinels; i++) | 80 for (size_t i = 0; i < kNumSentinels; i++) |
| 83 m_flattenedProcessingStack.append(sentinel); | 81 m_flattenedProcessingStack.append(sentinel); |
| 84 ASSERT(s_elementQueueEnd == m_flattenedProcessingStack.size()); | 82 ASSERT(s_elementQueueEnd == m_flattenedProcessingStack.size()); |
| (...skipping 14 matching lines...) Expand all Loading... |
| 99 | 97 |
| 100 // The processing stack, flattened. Element queues lower in the | 98 // The processing stack, flattened. Element queues lower in the |
| 101 // stack appear toward the head of the vector. The first element | 99 // stack appear toward the head of the vector. The first element |
| 102 // is a null sentinel value. | 100 // is a null sentinel value. |
| 103 static const size_t kNumSentinels = 1; | 101 static const size_t kNumSentinels = 1; |
| 104 Vector<CustomElementCallbackQueue*> m_flattenedProcessingStack; | 102 Vector<CustomElementCallbackQueue*> m_flattenedProcessingStack; |
| 105 }; | 103 }; |
| 106 | 104 |
| 107 } | 105 } |
| 108 | 106 |
| 109 #endif // CustomElementCallbackDispatcher_h | 107 #endif // CustomElementProcessingStack_h |
| OLD | NEW |