| 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 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 74 | 74 |
| 75 void addNodeEventContext(Node*); | 75 void addNodeEventContext(Node*); |
| 76 | 76 |
| 77 void calculatePath(); | 77 void calculatePath(); |
| 78 void calculateAdjustedTargets(); | 78 void calculateAdjustedTargets(); |
| 79 void calculateTreeScopePrePostOrderNumbers(); | 79 void calculateTreeScopePrePostOrderNumbers(); |
| 80 | 80 |
| 81 void shrink(size_t newSize) { m_nodeEventContexts.shrink(newSize); } | 81 void shrink(size_t newSize) { m_nodeEventContexts.shrink(newSize); } |
| 82 void shrinkIfNeeded(const Node* target, const EventTarget* relatedTarget); | 82 void shrinkIfNeeded(const Node* target, const EventTarget* relatedTarget); |
| 83 | 83 |
| 84 void adjustTouchList(const Node*, const TouchList*, WillBeHeapVector<RawPtrW
illBeMember<TouchList> > adjustedTouchList, const Vector<TreeScope*>& treeScopes
); | 84 void adjustTouchList(const Node*, const TouchList*, WillBeHeapVector<RawPtrW
illBeMember<TouchList> > adjustedTouchList, const WillBeHeapVector<RawPtrWillBeM
ember<TreeScope> >& treeScopes); |
| 85 | 85 |
| 86 typedef HashMap<TreeScope*, RefPtr<TreeScopeEventContext> > TreeScopeEventCo
ntextMap; | 86 typedef WillBeHeapHashMap<RawPtrWillBeMember<TreeScope>, RefPtrWillBeMember<
TreeScopeEventContext> > TreeScopeEventContextMap; |
| 87 TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget, Tree
Scope*, TreeScopeEventContextMap&); | 87 TreeScopeEventContext* ensureTreeScopeEventContext(Node* currentTarget, Tree
Scope*, TreeScopeEventContextMap&); |
| 88 | 88 |
| 89 typedef HashMap<TreeScope*, EventTarget*> RelatedTargetMap; | 89 typedef WillBeHeapHashMap<RawPtrWillBeMember<TreeScope>, RawPtrWillBeMember<
EventTarget> > RelatedTargetMap; |
| 90 | 90 |
| 91 static void buildRelatedNodeMap(const Node*, RelatedTargetMap&); | 91 static void buildRelatedNodeMap(const Node*, RelatedTargetMap&); |
| 92 static EventTarget* findRelatedNode(TreeScope*, RelatedTargetMap&); | 92 static EventTarget* findRelatedNode(TreeScope*, RelatedTargetMap&); |
| 93 | 93 |
| 94 #ifndef NDEBUG | 94 #ifndef NDEBUG |
| 95 static void checkReachability(TreeScope&, TouchList&); | 95 static void checkReachability(TreeScope&, TouchList&); |
| 96 #endif | 96 #endif |
| 97 | 97 |
| 98 WillBeHeapVector<NodeEventContext, 64> m_nodeEventContexts; | 98 WillBeHeapVector<NodeEventContext, 64> m_nodeEventContexts; |
| 99 Node* m_node; | 99 RawPtrWillBeMember<Node> m_node; |
| 100 RawPtrWillBeMember<Event> m_event; | 100 RawPtrWillBeMember<Event> m_event; |
| 101 Vector<RefPtr<TreeScopeEventContext> > m_treeScopeEventContexts; | 101 WillBeHeapVector<RefPtrWillBeMember<TreeScopeEventContext> > m_treeScopeEven
tContexts; |
| 102 }; | 102 }; |
| 103 | 103 |
| 104 } // namespace | 104 } // namespace |
| 105 | 105 |
| 106 #endif | 106 #endif |
| OLD | NEW |