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 CustomElementProcessingStack_h | 31 #ifndef V0CustomElementProcessingStack_h |
32 #define CustomElementProcessingStack_h | 32 #define V0CustomElementProcessingStack_h |
33 | 33 |
34 #include "core/CoreExport.h" | 34 #include "core/CoreExport.h" |
35 #include "core/dom/custom/CustomElementCallbackQueue.h" | 35 #include "core/dom/custom/V0CustomElementCallbackQueue.h" |
36 #include "wtf/Vector.h" | 36 #include "wtf/Vector.h" |
37 | 37 |
38 namespace blink { | 38 namespace blink { |
39 | 39 |
40 class CORE_EXPORT CustomElementProcessingStack : public GarbageCollectedFinalize
d<CustomElementProcessingStack> { | 40 class CORE_EXPORT V0CustomElementProcessingStack : public GarbageCollectedFinali
zed<V0CustomElementProcessingStack> { |
41 WTF_MAKE_NONCOPYABLE(CustomElementProcessingStack); | 41 WTF_MAKE_NONCOPYABLE(V0CustomElementProcessingStack); |
42 public: | 42 public: |
43 // This is stack allocated in many DOM callbacks. Make it cheap. | 43 // This is stack allocated in many DOM callbacks. Make it cheap. |
44 class CallbackDeliveryScope { | 44 class CallbackDeliveryScope { |
45 STACK_ALLOCATED(); | 45 STACK_ALLOCATED(); |
46 public: | 46 public: |
47 CallbackDeliveryScope() | 47 CallbackDeliveryScope() |
48 : m_savedElementQueueStart(s_elementQueueStart) | 48 : m_savedElementQueueStart(s_elementQueueStart) |
49 { | 49 { |
50 s_elementQueueStart = s_elementQueueEnd; | 50 s_elementQueueStart = s_elementQueueEnd; |
51 } | 51 } |
52 | 52 |
53 ~CallbackDeliveryScope() | 53 ~CallbackDeliveryScope() |
54 { | 54 { |
55 if (s_elementQueueStart != s_elementQueueEnd) | 55 if (s_elementQueueStart != s_elementQueueEnd) |
56 processElementQueueAndPop(); | 56 processElementQueueAndPop(); |
57 s_elementQueueStart = m_savedElementQueueStart; | 57 s_elementQueueStart = m_savedElementQueueStart; |
58 } | 58 } |
59 | 59 |
60 private: | 60 private: |
61 size_t m_savedElementQueueStart; | 61 size_t m_savedElementQueueStart; |
62 }; | 62 }; |
63 | 63 |
64 static bool inCallbackDeliveryScope() { return s_elementQueueStart; } | 64 static bool inCallbackDeliveryScope() { return s_elementQueueStart; } |
65 | 65 |
66 static CustomElementProcessingStack& instance(); | 66 static V0CustomElementProcessingStack& instance(); |
67 void enqueue(CustomElementCallbackQueue*); | 67 void enqueue(V0CustomElementCallbackQueue*); |
68 | 68 |
69 DECLARE_TRACE(); | 69 DECLARE_TRACE(); |
70 | 70 |
71 private: | 71 private: |
72 CustomElementProcessingStack() | 72 V0CustomElementProcessingStack() |
73 { | 73 { |
74 // 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 |
75 // identify elements queued when there is no | 75 // identify elements queued when there is no |
76 // CallbackDeliveryScope active. Also, if the processing stack | 76 // CallbackDeliveryScope active. Also, if the processing stack |
77 // is popped when empty, this sentinel will cause a null deref | 77 // is popped when empty, this sentinel will cause a null deref |
78 // crash. | 78 // crash. |
79 CustomElementCallbackQueue* sentinel = 0; | 79 V0CustomElementCallbackQueue* sentinel = 0; |
80 for (size_t i = 0; i < kNumSentinels; i++) | 80 for (size_t i = 0; i < kNumSentinels; i++) |
81 m_flattenedProcessingStack.append(sentinel); | 81 m_flattenedProcessingStack.append(sentinel); |
82 DCHECK_EQ(s_elementQueueEnd, m_flattenedProcessingStack.size()); | 82 DCHECK_EQ(s_elementQueueEnd, m_flattenedProcessingStack.size()); |
83 } | 83 } |
84 | 84 |
85 // The start of the element queue on the top of the processing | 85 // The start of the element queue on the top of the processing |
86 // stack. An offset into instance().m_flattenedProcessingStack. | 86 // stack. An offset into instance().m_flattenedProcessingStack. |
87 static size_t s_elementQueueStart; | 87 static size_t s_elementQueueStart; |
88 | 88 |
89 // The end of the element queue on the top of the processing | 89 // The end of the element queue on the top of the processing |
90 // stack. A cache of instance().m_flattenedProcessingStack.size(). | 90 // stack. A cache of instance().m_flattenedProcessingStack.size(). |
91 static size_t s_elementQueueEnd; | 91 static size_t s_elementQueueEnd; |
92 | 92 |
93 static CustomElementCallbackQueue::ElementQueueId currentElementQueue() { re
turn CustomElementCallbackQueue::ElementQueueId(s_elementQueueStart); } | 93 static V0CustomElementCallbackQueue::ElementQueueId currentElementQueue() {
return V0CustomElementCallbackQueue::ElementQueueId(s_elementQueueStart); } |
94 | 94 |
95 static void processElementQueueAndPop(); | 95 static void processElementQueueAndPop(); |
96 void processElementQueueAndPop(size_t start, size_t end); | 96 void processElementQueueAndPop(size_t start, size_t end); |
97 | 97 |
98 // The processing stack, flattened. Element queues lower in the | 98 // The processing stack, flattened. Element queues lower in the |
99 // stack appear toward the head of the vector. The first element | 99 // stack appear toward the head of the vector. The first element |
100 // is a null sentinel value. | 100 // is a null sentinel value. |
101 static const size_t kNumSentinels = 1; | 101 static const size_t kNumSentinels = 1; |
102 HeapVector<Member<CustomElementCallbackQueue>> m_flattenedProcessingStack; | 102 HeapVector<Member<V0CustomElementCallbackQueue>> m_flattenedProcessingStack; |
103 }; | 103 }; |
104 | 104 |
105 } // namespace blink | 105 } // namespace blink |
106 | 106 |
107 #endif // CustomElementProcessingStack_h | 107 #endif // V0CustomElementProcessingStack_h |
OLD | NEW |