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/CustomElementCallbackQueue.h" | 31 #include "core/dom/custom/V0CustomElementCallbackQueue.h" |
32 | 32 |
33 #include "core/dom/shadow/ShadowRoot.h" | 33 #include "core/dom/shadow/ShadowRoot.h" |
34 | 34 |
35 namespace blink { | 35 namespace blink { |
36 | 36 |
37 CustomElementCallbackQueue* CustomElementCallbackQueue::create(Element* element) | 37 V0CustomElementCallbackQueue* V0CustomElementCallbackQueue::create(Element* elem
ent) |
38 { | 38 { |
39 return new CustomElementCallbackQueue(element); | 39 return new V0CustomElementCallbackQueue(element); |
40 } | 40 } |
41 | 41 |
42 CustomElementCallbackQueue::CustomElementCallbackQueue(Element* element) | 42 V0CustomElementCallbackQueue::V0CustomElementCallbackQueue(Element* element) |
43 : m_element(element) | 43 : m_element(element) |
44 , m_owner(-1) | 44 , m_owner(-1) |
45 , m_index(0) | 45 , m_index(0) |
46 , m_inCreatedCallback(false) | 46 , m_inCreatedCallback(false) |
47 { | 47 { |
48 } | 48 } |
49 | 49 |
50 bool CustomElementCallbackQueue::processInElementQueue(ElementQueueId caller) | 50 bool V0CustomElementCallbackQueue::processInElementQueue(ElementQueueId caller) |
51 { | 51 { |
52 DCHECK(!m_inCreatedCallback); | 52 DCHECK(!m_inCreatedCallback); |
53 bool didWork = false; | 53 bool didWork = false; |
54 | 54 |
55 // Never run custom element callbacks in UA shadow roots since that would | 55 // Never run custom element callbacks in UA shadow roots since that would |
56 // leak the UA root and it's elements into the page. | 56 // leak the UA root and it's elements into the page. |
57 ShadowRoot* shadowRoot = m_element->containingShadowRoot(); | 57 ShadowRoot* shadowRoot = m_element->containingShadowRoot(); |
58 if (!shadowRoot || shadowRoot->type() != ShadowRootType::UserAgent) { | 58 if (!shadowRoot || shadowRoot->type() != ShadowRootType::UserAgent) { |
59 while (m_index < m_queue.size() && owner() == caller) { | 59 while (m_index < m_queue.size() && owner() == caller) { |
60 m_inCreatedCallback = m_queue[m_index]->isCreatedCallback(); | 60 m_inCreatedCallback = m_queue[m_index]->isCreatedCallback(); |
(...skipping 10 matching lines...) Expand all Loading... |
71 if (owner() == caller && m_index == m_queue.size()) { | 71 if (owner() == caller && m_index == m_queue.size()) { |
72 // This processInQueue exhausted the queue; shrink it. | 72 // This processInQueue exhausted the queue; shrink it. |
73 m_index = 0; | 73 m_index = 0; |
74 m_queue.resize(0); | 74 m_queue.resize(0); |
75 m_owner = -1; | 75 m_owner = -1; |
76 } | 76 } |
77 | 77 |
78 return didWork; | 78 return didWork; |
79 } | 79 } |
80 | 80 |
81 DEFINE_TRACE(CustomElementCallbackQueue) | 81 DEFINE_TRACE(V0CustomElementCallbackQueue) |
82 { | 82 { |
83 visitor->trace(m_element); | 83 visitor->trace(m_element); |
84 visitor->trace(m_queue); | 84 visitor->trace(m_queue); |
85 } | 85 } |
86 | 86 |
87 } // namespace blink | 87 } // namespace blink |
OLD | NEW |