| 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 55 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 66 return *m_windowEventContext; | 66 return *m_windowEventContext; |
| 67 } | 67 } |
| 68 void ensureWindowEventContext(); | 68 void ensureWindowEventContext(); |
| 69 | 69 |
| 70 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); } | 70 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); } |
| 71 size_t size() const { return m_nodeEventContexts.size(); } | 71 size_t size() const { return m_nodeEventContexts.size(); } |
| 72 | 72 |
| 73 void adjustForRelatedTarget(Node&, EventTarget* relatedTarget); | 73 void adjustForRelatedTarget(Node&, EventTarget* relatedTarget); |
| 74 void adjustForTouchEvent(TouchEvent&); | 74 void adjustForTouchEvent(TouchEvent&); |
| 75 | 75 |
| 76 NodeEventContext& topNodeEventContext(); |
| 77 |
| 76 static EventTarget* eventTargetRespectingTargetRules(Node&); | 78 static EventTarget* eventTargetRespectingTargetRules(Node&); |
| 77 | 79 |
| 78 DECLARE_TRACE(); | 80 DECLARE_TRACE(); |
| 79 void clear() { | 81 void clear() { |
| 80 m_nodeEventContexts.clear(); | 82 m_nodeEventContexts.clear(); |
| 81 m_treeScopeEventContexts.clear(); | 83 m_treeScopeEventContexts.clear(); |
| 82 } | 84 } |
| 83 | 85 |
| 84 private: | 86 private: |
| 85 EventPath(); | 87 EventPath(); |
| (...skipping 24 matching lines...) Expand all Loading... |
| 110 | 112 |
| 111 using RelatedTargetMap = HeapHashMap<Member<TreeScope>, Member<EventTarget>>; | 113 using RelatedTargetMap = HeapHashMap<Member<TreeScope>, Member<EventTarget>>; |
| 112 | 114 |
| 113 static void buildRelatedNodeMap(const Node&, RelatedTargetMap&); | 115 static void buildRelatedNodeMap(const Node&, RelatedTargetMap&); |
| 114 static EventTarget* findRelatedNode(TreeScope&, RelatedTargetMap&); | 116 static EventTarget* findRelatedNode(TreeScope&, RelatedTargetMap&); |
| 115 | 117 |
| 116 #if DCHECK_IS_ON() | 118 #if DCHECK_IS_ON() |
| 117 static void checkReachability(TreeScope&, TouchList&); | 119 static void checkReachability(TreeScope&, TouchList&); |
| 118 #endif | 120 #endif |
| 119 | 121 |
| 120 const NodeEventContext& topNodeEventContext(); | |
| 121 | |
| 122 HeapVector<NodeEventContext> m_nodeEventContexts; | 122 HeapVector<NodeEventContext> m_nodeEventContexts; |
| 123 Member<Node> m_node; | 123 Member<Node> m_node; |
| 124 Member<Event> m_event; | 124 Member<Event> m_event; |
| 125 HeapVector<Member<TreeScopeEventContext>> m_treeScopeEventContexts; | 125 HeapVector<Member<TreeScopeEventContext>> m_treeScopeEventContexts; |
| 126 Member<WindowEventContext> m_windowEventContext; | 126 Member<WindowEventContext> m_windowEventContext; |
| 127 }; | 127 }; |
| 128 | 128 |
| 129 } // namespace blink | 129 } // namespace blink |
| 130 | 130 |
| 131 #endif | 131 #endif |
| OLD | NEW |