OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
(...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
76 | 76 |
77 private: | 77 private: |
78 EventPath(); | 78 EventPath(); |
79 | 79 |
80 void initialize(); | 80 void initialize(); |
81 void calculatePath(); | 81 void calculatePath(); |
82 void calculateAdjustedTargets(); | 82 void calculateAdjustedTargets(); |
83 void calculateTreeOrderAndSetNearestAncestorClosedTree(); | 83 void calculateTreeOrderAndSetNearestAncestorClosedTree(); |
84 | 84 |
85 void shrink(size_t newSize) { ASSERT(!m_windowEventContext); m_nodeEventCont
exts.shrink(newSize); } | 85 void shrink(size_t newSize) { ASSERT(!m_windowEventContext); m_nodeEventCont
exts.shrink(newSize); } |
86 void shrinkIfNeeded(const Node& target, const EventTarget& relatedTarget); | 86 |
| 87 void retargetRelatedTarget(const Node& relatedTargetNode); |
| 88 |
| 89 void shrinkForRelatedTarget(const Node& target, const Node& relatedTarget); |
87 | 90 |
88 void adjustTouchList(const TouchList*, HeapVector<Member<TouchList>> adjuste
dTouchList, const HeapVector<Member<TreeScope>>& treeScopes); | 91 void adjustTouchList(const TouchList*, HeapVector<Member<TouchList>> adjuste
dTouchList, const HeapVector<Member<TreeScope>>& treeScopes); |
89 | 92 |
90 using TreeScopeEventContextMap = HeapHashMap<Member<TreeScope>, Member<TreeS
copeEventContext>>; | 93 using TreeScopeEventContextMap = HeapHashMap<Member<TreeScope>, Member<TreeS
copeEventContext>>; |
91 TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget, Tree
Scope*, TreeScopeEventContextMap&); | 94 TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget, Tree
Scope*, TreeScopeEventContextMap&); |
92 | 95 |
93 using RelatedTargetMap = HeapHashMap<Member<TreeScope>, Member<EventTarget>>
; | 96 using RelatedTargetMap = HeapHashMap<Member<TreeScope>, Member<EventTarget>>
; |
94 | 97 |
95 static void buildRelatedNodeMap(const Node&, RelatedTargetMap&); | 98 static void buildRelatedNodeMap(const Node&, RelatedTargetMap&); |
96 static EventTarget* findRelatedNode(TreeScope&, RelatedTargetMap&); | 99 static EventTarget* findRelatedNode(TreeScope&, RelatedTargetMap&); |
97 | 100 |
98 #if ENABLE(ASSERT) | 101 #if ENABLE(ASSERT) |
99 static void checkReachability(TreeScope&, TouchList&); | 102 static void checkReachability(TreeScope&, TouchList&); |
100 #endif | 103 #endif |
101 | 104 |
102 const NodeEventContext& topNodeEventContext(); | 105 const NodeEventContext& topNodeEventContext(); |
103 | 106 |
104 HeapVector<NodeEventContext> m_nodeEventContexts; | 107 HeapVector<NodeEventContext> m_nodeEventContexts; |
105 Member<Node> m_node; | 108 Member<Node> m_node; |
106 Member<Event> m_event; | 109 Member<Event> m_event; |
107 HeapVector<Member<TreeScopeEventContext>> m_treeScopeEventContexts; | 110 HeapVector<Member<TreeScopeEventContext>> m_treeScopeEventContexts; |
108 Member<WindowEventContext> m_windowEventContext; | 111 Member<WindowEventContext> m_windowEventContext; |
109 }; | 112 }; |
110 | 113 |
111 } // namespace blink | 114 } // namespace blink |
112 | 115 |
113 #endif | 116 #endif |
OLD | NEW |