| 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 "config.h" |  | 
| 32 #include "core/dom/CustomElementCallbackQueue.h" |  | 
| 33 |  | 
| 34 namespace WebCore { |  | 
| 35 |  | 
| 36 PassOwnPtr<CustomElementCallbackQueue> CustomElementCallbackQueue::create(PassRe
    fPtr<Element> element) |  | 
| 37 { |  | 
| 38     return adoptPtr(new CustomElementCallbackQueue(element)); |  | 
| 39 } |  | 
| 40 |  | 
| 41 CustomElementCallbackQueue::CustomElementCallbackQueue(PassRefPtr<Element> eleme
    nt) |  | 
| 42     : m_element(element) |  | 
| 43     , m_owner(-1) |  | 
| 44     , m_index(0) |  | 
| 45     , m_inCreatedCallback(false) |  | 
| 46 { |  | 
| 47 } |  | 
| 48 |  | 
| 49 void CustomElementCallbackQueue::processInElementQueue(ElementQueue caller) |  | 
| 50 { |  | 
| 51     ASSERT(!m_inCreatedCallback); |  | 
| 52 |  | 
| 53     while (m_index < m_queue.size() && owner() == caller) { |  | 
| 54         m_inCreatedCallback = m_queue[m_index]->isCreated(); |  | 
| 55 |  | 
| 56         // dispatch() may cause recursion which steals this callback |  | 
| 57         // queue and reenters processInQueue. owner() == caller |  | 
| 58         // detects this recursion and cedes processing. |  | 
| 59         m_queue[m_index++]->dispatch(m_element.get()); |  | 
| 60         m_inCreatedCallback = false; |  | 
| 61     } |  | 
| 62 |  | 
| 63     if (owner() == caller && m_index == m_queue.size()) { |  | 
| 64         // This processInQueue exhausted the queue; shrink it. |  | 
| 65         m_index = 0; |  | 
| 66         m_queue.resize(0); |  | 
| 67         m_owner = -1; |  | 
| 68     } |  | 
| 69 } |  | 
| 70 |  | 
| 71 } // namespace WebCore |  | 
| OLD | NEW | 
|---|