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 CustomElementCallbackQueue_h | 31 #ifndef V0CustomElementCallbackQueue_h |
32 #define CustomElementCallbackQueue_h | 32 #define V0CustomElementCallbackQueue_h |
33 | 33 |
34 #include "core/dom/Element.h" | 34 #include "core/dom/Element.h" |
35 #include "core/dom/custom/CustomElementProcessingStep.h" | 35 #include "core/dom/custom/V0CustomElementProcessingStep.h" |
36 #include "platform/heap/Handle.h" | 36 #include "platform/heap/Handle.h" |
37 #include "wtf/Vector.h" | 37 #include "wtf/Vector.h" |
38 | 38 |
39 namespace blink { | 39 namespace blink { |
40 | 40 |
41 // FIXME: Rename this because it contains resolution and upgrade as | 41 // FIXME: Rename this because it contains resolution and upgrade as |
42 // well as callbacks. | 42 // well as callbacks. |
43 class CustomElementCallbackQueue : public GarbageCollectedFinalized<CustomElemen
tCallbackQueue> { | 43 class V0CustomElementCallbackQueue : public GarbageCollectedFinalized<V0CustomEl
ementCallbackQueue> { |
44 WTF_MAKE_NONCOPYABLE(CustomElementCallbackQueue); | 44 WTF_MAKE_NONCOPYABLE(V0CustomElementCallbackQueue); |
45 public: | 45 public: |
46 static CustomElementCallbackQueue* create(Element*); | 46 static V0CustomElementCallbackQueue* create(Element*); |
47 | 47 |
48 typedef int ElementQueueId; | 48 typedef int ElementQueueId; |
49 ElementQueueId owner() const { return m_owner; } | 49 ElementQueueId owner() const { return m_owner; } |
50 | 50 |
51 void setOwner(ElementQueueId newOwner) | 51 void setOwner(ElementQueueId newOwner) |
52 { | 52 { |
53 // ElementCallbackQueues only migrate towards the top of the | 53 // ElementCallbackQueues only migrate towards the top of the |
54 // processing stack. | 54 // processing stack. |
55 DCHECK_GE(newOwner, m_owner); | 55 DCHECK_GE(newOwner, m_owner); |
56 m_owner = newOwner; | 56 m_owner = newOwner; |
57 } | 57 } |
58 | 58 |
59 bool processInElementQueue(ElementQueueId); | 59 bool processInElementQueue(ElementQueueId); |
60 | 60 |
61 void append(CustomElementProcessingStep* invocation) { m_queue.append(invoca
tion); } | 61 void append(V0CustomElementProcessingStep* invocation) { m_queue.append(invo
cation); } |
62 bool inCreatedCallback() const { return m_inCreatedCallback; } | 62 bool inCreatedCallback() const { return m_inCreatedCallback; } |
63 | 63 |
64 DECLARE_TRACE(); | 64 DECLARE_TRACE(); |
65 | 65 |
66 private: | 66 private: |
67 explicit CustomElementCallbackQueue(Element*); | 67 explicit V0CustomElementCallbackQueue(Element*); |
68 | 68 |
69 Member<Element> m_element; | 69 Member<Element> m_element; |
70 HeapVector<Member<CustomElementProcessingStep>> m_queue; | 70 HeapVector<Member<V0CustomElementProcessingStep>> m_queue; |
71 ElementQueueId m_owner; | 71 ElementQueueId m_owner; |
72 size_t m_index; | 72 size_t m_index; |
73 bool m_inCreatedCallback; | 73 bool m_inCreatedCallback; |
74 }; | 74 }; |
75 | 75 |
76 } // namespace blink | 76 } // namespace blink |
77 | 77 |
78 #endif // CustomElementCallbackQueue_h | 78 #endif // V0CustomElementCallbackQueue_h |
OLD | NEW |