| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | |
| 3 * | |
| 4 * Redistribution and use in source and binary forms, with or without | |
| 5 * modification, are permitted provided that the following conditions | |
| 6 * are met: | |
| 7 * | |
| 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 | |
| 13 * distribution. | |
| 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. | |
| 17 * | |
| 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. | |
| 29 */ | |
| 30 | |
| 31 #include "core/dom/custom/CustomElementCallbackQueue.h" | |
| 32 | |
| 33 #include "core/dom/shadow/ShadowRoot.h" | |
| 34 | |
| 35 namespace blink { | |
| 36 | |
| 37 CustomElementCallbackQueue* CustomElementCallbackQueue::create(Element* element) | |
| 38 { | |
| 39 return new CustomElementCallbackQueue(element); | |
| 40 } | |
| 41 | |
| 42 CustomElementCallbackQueue::CustomElementCallbackQueue(Element* element) | |
| 43 : m_element(element) | |
| 44 , m_owner(-1) | |
| 45 , m_index(0) | |
| 46 , m_inCreatedCallback(false) | |
| 47 { | |
| 48 } | |
| 49 | |
| 50 bool CustomElementCallbackQueue::processInElementQueue(ElementQueueId caller) | |
| 51 { | |
| 52 DCHECK(!m_inCreatedCallback); | |
| 53 bool didWork = false; | |
| 54 | |
| 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. | |
| 57 ShadowRoot* shadowRoot = m_element->containingShadowRoot(); | |
| 58 if (!shadowRoot || shadowRoot->type() != ShadowRootType::UserAgent) { | |
| 59 while (m_index < m_queue.size() && owner() == caller) { | |
| 60 m_inCreatedCallback = m_queue[m_index]->isCreatedCallback(); | |
| 61 | |
| 62 // dispatch() may cause recursion which steals this callback | |
| 63 // queue and reenters processInQueue. owner() == caller | |
| 64 // detects this recursion and cedes processing. | |
| 65 m_queue[m_index++]->dispatch(m_element.get()); | |
| 66 m_inCreatedCallback = false; | |
| 67 didWork = true; | |
| 68 } | |
| 69 } | |
| 70 | |
| 71 if (owner() == caller && m_index == m_queue.size()) { | |
| 72 // This processInQueue exhausted the queue; shrink it. | |
| 73 m_index = 0; | |
| 74 m_queue.resize(0); | |
| 75 m_owner = -1; | |
| 76 } | |
| 77 | |
| 78 return didWork; | |
| 79 } | |
| 80 | |
| 81 DEFINE_TRACE(CustomElementCallbackQueue) | |
| 82 { | |
| 83 visitor->trace(m_element); | |
| 84 visitor->trace(m_queue); | |
| 85 } | |
| 86 | |
| 87 } // namespace blink | |
| OLD | NEW |