2 * Copyright (C) 2013 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * 3. Neither the name of Google Inc. nor the names of its contributors
15 * may be used to endorse or promote products derived from this
16 * software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
31 #ifndef CustomElementProcessingStack_h
32 #define CustomElementProcessingStack_h
34 #include "core/dom/custom/CustomElementCallbackQueue.h"
35 #include "wtf/Vector.h"
39 class CustomElementProcessingStack {
40 WTF_MAKE_NONCOPYABLE(CustomElementProcessingStack);
42 // This is stack allocated in many DOM callbacks. Make it cheap.
43 class CallbackDeliveryScope {
45 CallbackDeliveryScope()
46 : m_savedElementQueueStart(s_elementQueueStart)
48 s_elementQueueStart = s_elementQueueEnd;
51 ~CallbackDeliveryScope()
53 if (s_elementQueueStart != s_elementQueueEnd)
54 processElementQueueAndPop();
55 s_elementQueueStart = m_savedElementQueueStart;
59 size_t m_savedElementQueueStart;
62 static bool inCallbackDeliveryScope() { return s_elementQueueStart; }
64 static CustomElementProcessingStack& instance();
65 void enqueue(CustomElementCallbackQueue*);
68 CustomElementProcessingStack()
70 // Add a null element as a sentinel. This makes it possible to
71 // identify elements queued when there is no
72 // CallbackDeliveryScope active. Also, if the processing stack
73 // is popped when empty, this sentinel will cause a null deref
75 CustomElementCallbackQueue* sentinel = 0;
76 for (size_t i = 0; i < kNumSentinels; i++)
77 m_flattenedProcessingStack.append(sentinel);
78 ASSERT(s_elementQueueEnd == m_flattenedProcessingStack.size());
81 // The start of the element queue on the top of the processing
82 // stack. An offset into instance().m_flattenedProcessingStack.
83 static size_t s_elementQueueStart;
85 // The end of the element queue on the top of the processing
86 // stack. A cache of instance().m_flattenedProcessingStack.size().
87 static size_t s_elementQueueEnd;
89 static CustomElementCallbackQueue::ElementQueueId currentElementQueue() { return CustomElementCallbackQueue::ElementQueueId(s_elementQueueStart); }
91 static void processElementQueueAndPop();
92 void processElementQueueAndPop(size_t start, size_t end);
94 // The processing stack, flattened. Element queues lower in the
95 // stack appear toward the head of the vector. The first element
96 // is a null sentinel value.
97 static const size_t kNumSentinels = 1;
98 Vector<CustomElementCallbackQueue*> m_flattenedProcessingStack;
103 #endif // CustomElementProcessingStack_h