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 "ScopedEventQueue.h" |
33 | |
34 | #include "Event.h" |
35 | #include "Node.h" |
36 | #include <wtf/NeverDestroyed.h> |
37 | |
38 | namespace WebCore { |
39 | |
40 | ScopedEventQueue& ScopedEventQueue::singleton() |
41 | { |
42 | static NeverDestroyed<ScopedEventQueue> scopedEventQueue; |
43 | return scopedEventQueue; |
44 | } |
45 | |
46 | void ScopedEventQueue::enqueueEvent(Ref<Event>&& event) |
47 | { |
48 | ASSERT(is<Node>(event->target())); |
49 | if (m_scopingLevel) |
50 | m_queuedEvents.append(WTFMove(event)); |
51 | else |
52 | dispatchEvent(event); |
53 | } |
54 | |
55 | void ScopedEventQueue::dispatchEvent(Event& event) const |
56 | { |
57 | downcast<Node>(*event.target()).dispatchEvent(event); |
58 | } |
59 | |
60 | void ScopedEventQueue::dispatchAllEvents() |
61 | { |
62 | Vector<Ref<Event>> queuedEvents = WTFMove(m_queuedEvents); |
63 | for (auto& queuedEvent : queuedEvents) |
64 | dispatchEvent(queuedEvent); |
65 | } |
66 | |
67 | void ScopedEventQueue::incrementScopingLevel() |
68 | { |
69 | ++m_scopingLevel; |
70 | } |
71 | |
72 | void ScopedEventQueue::decrementScopingLevel() |
73 | { |
74 | ASSERT(m_scopingLevel); |
75 | --m_scopingLevel; |
76 | if (!m_scopingLevel) |
77 | dispatchAllEvents(); |
78 | } |
79 | |
80 | } |
81 | |