1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141
|
/*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef EventPath_h
#define EventPath_h
#include "core/CoreExport.h"
#include "core/events/NodeEventContext.h"
#include "core/events/TreeScopeEventContext.h"
#include "core/events/WindowEventContext.h"
#include "platform/heap/Handle.h"
#include "wtf/HashMap.h"
#include "wtf/Vector.h"
namespace blink {
class Event;
class EventTarget;
class Node;
class TouchEvent;
class TouchList;
class TreeScope;
class CORE_EXPORT EventPath final : public GarbageCollected<EventPath> {
WTF_MAKE_NONCOPYABLE(EventPath);
public:
explicit EventPath(Node&, Event* = nullptr);
void initializeWith(Node&, Event*);
const HeapVector<NodeEventContext>& nodeEventContexts() const {
return m_nodeEventContexts;
}
HeapVector<NodeEventContext>& nodeEventContexts() {
return m_nodeEventContexts;
}
NodeEventContext& operator[](size_t index) {
return m_nodeEventContexts[index];
}
const NodeEventContext& operator[](size_t index) const {
return m_nodeEventContexts[index];
}
NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; }
NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; }
WindowEventContext& windowEventContext() {
DCHECK(m_windowEventContext);
return *m_windowEventContext;
}
void ensureWindowEventContext();
bool isEmpty() const { return m_nodeEventContexts.isEmpty(); }
size_t size() const { return m_nodeEventContexts.size(); }
void adjustForRelatedTarget(Node&, EventTarget* relatedTarget);
void adjustForTouchEvent(TouchEvent&);
NodeEventContext& topNodeEventContext();
static EventTarget* eventTargetRespectingTargetRules(Node&);
DECLARE_TRACE();
void clear() {
m_nodeEventContexts.clear();
m_treeScopeEventContexts.clear();
}
private:
EventPath();
void initialize();
void calculatePath();
void calculateAdjustedTargets();
void calculateTreeOrderAndSetNearestAncestorClosedTree();
bool shouldStopEventPath(EventTarget& currentTarget,
EventTarget& currentRelatedTarget,
const Node& target);
void shrink(size_t newSize) {
DCHECK(!m_windowEventContext);
m_nodeEventContexts.shrink(newSize);
}
void retargetRelatedTarget(const Node& relatedTargetNode);
void shrinkForRelatedTarget(const Node& target);
void adjustTouchList(const TouchList*,
HeapVector<Member<TouchList>> adjustedTouchList,
const HeapVector<Member<TreeScope>>& treeScopes);
using TreeScopeEventContextMap =
HeapHashMap<Member<TreeScope>, Member<TreeScopeEventContext>>;
TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget,
TreeScope*,
TreeScopeEventContextMap&);
using RelatedTargetMap = HeapHashMap<Member<TreeScope>, Member<EventTarget>>;
static void buildRelatedNodeMap(const Node&, RelatedTargetMap&);
static EventTarget* findRelatedNode(TreeScope&, RelatedTargetMap&);
#if DCHECK_IS_ON()
static void checkReachability(TreeScope&, TouchList&);
#endif
HeapVector<NodeEventContext> m_nodeEventContexts;
Member<Node> m_node;
Member<Event> m_event;
HeapVector<Member<TreeScopeEventContext>> m_treeScopeEventContexts;
Member<WindowEventContext> m_windowEventContext;
};
} // namespace blink
#endif
|