1/* 2 * Copyright (C) 2010 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 are 6 * met: 7 * 8 * * Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * * Redistributions in binary form must reproduce the above 11 * copyright notice, this list of conditions and the following disclaimer 12 * in the documentation and/or other materials provided with the 13 * distribution. 14 * * Neither the name of Google Inc. nor the names of its 15 * contributors may be used to endorse or promote products derived from 16 * this 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/events/ScopedEventQueue.h" 33 34#include "core/events/Event.h" 35#include "core/events/EventDispatchMediator.h" 36#include "core/events/EventDispatcher.h" 37#include "core/events/EventTarget.h" 38#include "wtf/OwnPtr.h" 39 40namespace blink { 41 42ScopedEventQueue* ScopedEventQueue::s_instance = 0; 43 44ScopedEventQueue::ScopedEventQueue() 45 : m_scopingLevel(0) 46{ 47} 48 49ScopedEventQueue::~ScopedEventQueue() 50{ 51 ASSERT(!m_scopingLevel); 52 ASSERT(!m_queuedEventDispatchMediators.size()); 53} 54 55void ScopedEventQueue::initialize() 56{ 57 ASSERT(!s_instance); 58 OwnPtr<ScopedEventQueue> instance = adoptPtr(new ScopedEventQueue); 59 s_instance = instance.leakPtr(); 60} 61 62void ScopedEventQueue::enqueueEventDispatchMediator(PassRefPtrWillBeRawPtr<EventDispatchMediator> mediator) 63{ 64 if (m_scopingLevel) 65 m_queuedEventDispatchMediators.append(mediator); 66 else 67 dispatchEvent(mediator); 68} 69 70void ScopedEventQueue::dispatchAllEvents() 71{ 72 WillBeHeapVector<RefPtrWillBeMember<EventDispatchMediator> > queuedEventDispatchMediators; 73 queuedEventDispatchMediators.swap(m_queuedEventDispatchMediators); 74 75 for (size_t i = 0; i < queuedEventDispatchMediators.size(); i++) 76 dispatchEvent(queuedEventDispatchMediators[i].release()); 77} 78 79void ScopedEventQueue::dispatchEvent(PassRefPtrWillBeRawPtr<EventDispatchMediator> mediator) const 80{ 81 ASSERT(mediator->event()->target()); 82 Node* node = mediator->event()->target()->toNode(); 83 EventDispatcher::dispatchEvent(node, mediator); 84} 85 86ScopedEventQueue* ScopedEventQueue::instance() 87{ 88 if (!s_instance) 89 initialize(); 90 91 return s_instance; 92} 93 94void ScopedEventQueue::incrementScopingLevel() 95{ 96 m_scopingLevel++; 97} 98 99void ScopedEventQueue::decrementScopingLevel() 100{ 101 ASSERT(m_scopingLevel); 102 m_scopingLevel--; 103 if (!m_scopingLevel) 104 dispatchAllEvents(); 105} 106 107} 108