2 * Copyright (C) 2013 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Neither the name of Google Inc. nor the names of its
11 * contributors may be used to endorse or promote products derived from
12 * this software without specific prior written permission.
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #include "core/events/NodeEventContext.h"
31 #include "core/events/TreeScopeEventContext.h"
32 #include "platform/heap/Handle.h"
33 #include "wtf/HashMap.h"
34 #include "wtf/Vector.h"
45 class EventPath final : public NoBaseWillBeGarbageCollected<EventPath> {
47 explicit EventPath(Event*);
48 explicit EventPath(Node*);
49 void resetWith(Node*);
51 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[index]; }
52 const NodeEventContext& operator[](size_t index) const { return m_nodeEventContexts[index]; }
53 NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; }
55 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); }
56 size_t size() const { return m_nodeEventContexts.size(); }
58 void adjustForRelatedTarget(Node*, EventTarget* relatedTarget);
59 void adjustForTouchEvent(Node*, TouchEvent&);
61 static EventTarget* eventTargetRespectingTargetRules(Node*);
68 NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; }
70 void addNodeEventContext(Node*);
73 void calculateAdjustedTargets();
74 void calculateTreeScopePrePostOrderNumbers();
76 void shrink(size_t newSize) { m_nodeEventContexts.shrink(newSize); }
77 void shrinkIfNeeded(const Node* target, const EventTarget* relatedTarget);
79 void adjustTouchList(const Node*, const TouchList*, WillBeHeapVector<RawPtrWillBeMember<TouchList>> adjustedTouchList, const WillBeHeapVector<RawPtrWillBeMember<TreeScope>>& treeScopes);
81 typedef WillBeHeapHashMap<RawPtrWillBeMember<TreeScope>, RefPtrWillBeMember<TreeScopeEventContext>> TreeScopeEventContextMap;
82 TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget, TreeScope*, TreeScopeEventContextMap&);
84 typedef WillBeHeapHashMap<RawPtrWillBeMember<TreeScope>, RawPtrWillBeMember<EventTarget>> RelatedTargetMap;
86 static void buildRelatedNodeMap(const Node*, RelatedTargetMap&);
87 static EventTarget* findRelatedNode(TreeScope*, RelatedTargetMap&);
90 static void checkReachability(TreeScope&, TouchList&);
93 WillBeHeapVector<NodeEventContext, 64> m_nodeEventContexts;
94 RawPtrWillBeMember<Node> m_node;
95 RawPtrWillBeMember<Event> m_event;
96 WillBeHeapVector<RefPtrWillBeMember<TreeScopeEventContext>> m_treeScopeEventContexts;