2 * Copyright (C) 2014 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
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 #include "core/events/TreeScopeEventContext.h"
30 #include "core/dom/StaticNodeList.h"
31 #include "core/dom/shadow/ShadowRoot.h"
32 #include "core/events/EventPath.h"
33 #include "core/events/TouchEventContext.h"
37 PassRefPtrWillBeRawPtr<StaticNodeList> TreeScopeEventContext::ensureEventPath(EventPath& path)
42 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes;
43 nodes.reserveInitialCapacity(path.size());
44 for (size_t i = 0; i < path.size(); ++i) {
45 TreeScope& treeScope = path[i].treeScopeEventContext().treeScope();
46 if (treeScope.rootNode().isShadowRoot() && toShadowRoot(treeScope).type() == ShadowRoot::AuthorShadowRoot)
47 nodes.append(path[i].node());
48 else if (path[i].treeScopeEventContext().isInclusiveAncestorOf(*this))
49 nodes.append(path[i].node());
51 m_eventPath = StaticNodeList::adopt(nodes);
55 TouchEventContext* TreeScopeEventContext::ensureTouchEventContext()
57 if (!m_touchEventContext)
58 m_touchEventContext = TouchEventContext::create();
59 return m_touchEventContext.get();
62 PassRefPtrWillBeRawPtr<TreeScopeEventContext> TreeScopeEventContext::create(TreeScope& treeScope)
64 return adoptRefWillBeNoop(new TreeScopeEventContext(treeScope));
67 TreeScopeEventContext::TreeScopeEventContext(TreeScope& treeScope)
68 : m_treeScope(treeScope)
74 DEFINE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(TreeScopeEventContext)
76 void TreeScopeEventContext::trace(Visitor* visitor)
78 visitor->trace(m_treeScope);
79 visitor->trace(m_target);
80 visitor->trace(m_relatedTarget);
81 visitor->trace(m_eventPath);
82 visitor->trace(m_touchEventContext);
84 visitor->trace(m_children);
88 int TreeScopeEventContext::calculatePrePostOrderNumber(int orderNumber)
90 m_preOrder = orderNumber;
91 for (size_t i = 0; i < m_children.size(); ++i)
92 orderNumber = m_children[i]->calculatePrePostOrderNumber(orderNumber + 1);
93 m_postOrder = orderNumber + 1;
94 return orderNumber + 1;