Fix for calculation of event.path for closed mode shadow root

Source/core/events/TreeScopeEventContext.h

 /*
  * Copyright (C) 2014 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 47 matching lines @@
     void setTarget(PassRefPtrWillBeRawPtr<EventTarget>);
 
     EventTarget* relatedTarget() const { return m_relatedTarget.get(); }
     void setRelatedTarget(PassRefPtrWillBeRawPtr<EventTarget>);
 
     TouchEventContext* touchEventContext() const { return m_touchEventContext.get(); }
     TouchEventContext* ensureTouchEventContext();
 
     WillBeHeapVector<RefPtrWillBeMember<EventTarget>>& ensureEventPath(EventPath&);
 
-    bool isInclusiveAncestorOf(const TreeScopeEventContext&);
+    bool isInclusiveAncestorOf(const TreeScopeEventContext&) const;
+    bool isDescendantOf(const TreeScopeEventContext&) const;
+#if ENABLE(ASSERT)
+    bool isExclusivePartOf(const TreeScopeEventContext&) const;
+#endif
     void addChild(TreeScopeEventContext& child) { m_children.append(&child); }
 
-    // For ancestor-descendant relationship check in Q(1).
+    // For ancestor-descendant relationship check in O(1).
     // Preprocessing takes O(N).
-    int calculatePrePostOrderNumber(int orderNumber);
+    int calculateTreeOrderAndSetNearestAncestorClosedTree(int orderNumber, TreeScopeEventContext* nearestAncestorClosedTreeScopeEventContext);
+
+    TreeScopeEventContext* containingClosedShadowTree() const { return m_containingClosedShadowTree.get(); }
 
 private:
     TreeScopeEventContext(TreeScope&);
 
 #if ENABLE(ASSERT)
     bool isUnreachableNode(EventTarget&);
 #endif
 
+    bool isUnclosedTreeOf(const TreeScopeEventContext& other);
+
     RawPtrWillBeMember<TreeScope> m_treeScope;
     RefPtrWillBeMember<Node> m_rootNode; // Prevents TreeScope from being freed. TreeScope itself isn't RefCounted.
     RefPtrWillBeMember<EventTarget> m_target;
     RefPtrWillBeMember<EventTarget> m_relatedTarget;
     OwnPtrWillBeMember<WillBeHeapVector<RefPtrWillBeMember<EventTarget>>> m_eventPath;
     RefPtrWillBeMember<TouchEventContext> m_touchEventContext;
+    RawPtrWillBeMember<TreeScopeEventContext> m_containingClosedShadowTree;
 
     WillBeHeapVector<RawPtrWillBeMember<TreeScopeEventContext>> m_children;
     int m_preOrder;
     int m_postOrder;
 };
 
 #if ENABLE(ASSERT)
 inline bool TreeScopeEventContext::isUnreachableNode(EventTarget& target)
 {
     // FIXME: Checks also for SVG elements.
     return target.toNode() && !target.toNode()->isSVGElement() && !target.toNode()->treeScope().isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(treeScope());
 }
 #endif
 
 inline void TreeScopeEventContext::setTarget(PassRefPtrWillBeRawPtr<EventTarget> target)
 {
     ASSERT(target);
     ASSERT(!isUnreachableNode(*target));
     m_target = target;
 }
 
 inline void TreeScopeEventContext::setRelatedTarget(PassRefPtrWillBeRawPtr<EventTarget> relatedTarget)
 {
     ASSERT(relatedTarget);
     ASSERT(!isUnreachableNode(*relatedTarget));
     m_relatedTarget = relatedTarget;
 }
 
-inline bool TreeScopeEventContext::isInclusiveAncestorOf(const TreeScopeEventContext& other)
+inline bool TreeScopeEventContext::isInclusiveAncestorOf(const TreeScopeEventContext& other) const
 {
     ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && other.m_postOrder != -1);
     return m_preOrder <= other.m_preOrder && other.m_postOrder <= m_postOrder;
 }
 
+inline bool TreeScopeEventContext::isDescendantOf(const TreeScopeEventContext& other) const
+{
+    ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && other.m_postOrder != -1);
+    return other.m_preOrder < m_preOrder && m_postOrder < other.m_postOrder;
+}
+
+#if ENABLE(ASSERT)
+inline bool TreeScopeEventContext::isExclusivePartOf(const TreeScopeEventContext& other) const
+{
+    ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && other.m_postOrder != -1);
+    return (m_preOrder < other.m_preOrder && m_postOrder < other.m_preOrder)
+        || (m_preOrder > other.m_preOrder && m_preOrder > other.m_postOrder);
+}
+#endif
+
 }
 
 #endif // TreeScopeEventContext_h