Implement a Hit Test Cache.

Source/core/layout/HitTestResult.cpp

 /*
  * Copyright (C) 2006, 2008, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 90 matching lines @@
 {
     m_hitTestLocation = other.m_hitTestLocation;
     m_hitTestRequest = other.m_hitTestRequest;
     m_innerNode = other.innerNode();
     m_innerPossiblyPseudoNode = other.innerPossiblyPseudoNode();
     m_pointInInnerNodeFrame = other.m_pointInInnerNodeFrame;
     m_localPoint = other.localPoint();
     m_innerURLElement = other.URLElement();
     m_scrollbar = other.scrollbar();
     m_isOverWidget = other.isOverWidget();
+    m_validityRect = other.m_validityRect;
 
     // Only copy the NodeSet in case of list hit test.
     m_listBasedTestResult = adoptPtrWillBeNoop(other.m_listBasedTestResult ? new NodeSet(*other.m_listBasedTestResult) : 0);
 
     return *this;
 }
 
+bool HitTestResult::equalForCacheability(const HitTestResult& other) const
+{
+    bool res = m_hitTestRequest.equalForCacheability(other.m_hitTestRequest)
+        && m_innerNode == other.innerNode()
+        && m_innerPossiblyPseudoNode == other.innerPossiblyPseudoNode()
+        //      && m_pointInInnerNodeFrame == other.m_pointInInnerNodeFrame
+        //      && m_localPoint == other.localPoint()
+        && m_innerURLElement == other.URLElement()
+        && m_scrollbar == other.scrollbar()
+        && m_isOverWidget == other.isOverWidget();
+    // && m_listBasedTestResult == other.m_listBasedTestResult;
+
+    if (!res) {
+        WTF_LOG_ERROR("%d %d %d %d %d %d %d %d", m_hitTestRequest.equalForCacheability(other.m_hitTestRequest),
+            m_innerNode == other.m_innerNode,
+            m_innerPossiblyPseudoNode == other.m_innerPossiblyPseudoNode,
+            m_pointInInnerNodeFrame == other.m_pointInInnerNodeFrame,
+            m_localPoint == other.m_localPoint,
+            m_innerURLElement == other.m_innerURLElement,
+            m_scrollbar == other.m_scrollbar,
+            m_isOverWidget == other.m_isOverWidget);
+    }
+    return res;
+}
+
 DEFINE_TRACE(HitTestResult)
 {
     visitor->trace(m_innerNode);
+
     visitor->trace(m_innerPossiblyPseudoNode);
     visitor->trace(m_innerURLElement);
     visitor->trace(m_scrollbar);
 #if ENABLE(OILPAN)
     visitor->trace(m_listBasedTestResult);
 #endif
 }
 
 PositionWithAffinity HitTestResult::position() const
 {
@@ skipping 81 matching lines @@
 bool HitTestResult::isSelected() const
 {
     if (!m_innerNode)
         return false;
 
     if (LocalFrame* frame = m_innerNode->document().frame())
         return frame->selection().contains(m_hitTestLocation.point());
     return false;
 }
 
+void HitTestResult::setValidityRect(const LayoutRect& rect)
+{
+    ASSERT(!rect.isEmpty());
+    if (!rect.isEmpty())
+        m_validityRect = rect;
+}
+
+void HitTestResult::shrinkValidityRect(const LayoutRect& rect)
+{
+    LayoutRect tempValidityRect = m_validityRect;
+    if (rect.maxY() <= m_hitTestLocation.point().y() && rect.maxY() > tempValidityRect.y()) {
+        tempValidityRect.shiftYEdgeTo(rect.maxY());
+    }
+    if (rect.y() > m_hitTestLocation.point().y() && rect.y() < tempValidityRect.maxY()) {
+        tempValidityRect.shiftMaxYEdgeTo(rect.y());
+    }
+    if (rect.maxX() <= m_hitTestLocation.point().x() && rect.maxX() > tempValidityRect.x()) {
+        tempValidityRect.shiftXEdgeTo(rect.maxX());
+    }
+    if (rect.x() > m_hitTestLocation.point().x() && rect.x() < tempValidityRect.maxX()) {
+        tempValidityRect.shiftMaxXEdgeTo(rect.x());
+    }
+
+    if (!tempValidityRect.contains(m_hitTestLocation.point())) {
+        tempValidityRect.show(false);
+        rect.show(false);
+        WTF_LOG_ERROR("Layout point %lf %lf", m_hitTestLocation.point().x().toDouble(), m_hitTestLocation.point().y().toDouble());
+
+        //    ASSERT(false);
+        return;
+    }
+    m_validityRect = tempValidityRect;
+}
+
+void HitTestResult::intersectValidityRect(const LayoutRect& rect)
+{
+    LayoutRect tempValidityRect = m_validityRect;
+    tempValidityRect.intersect(rect);
+    if (!tempValidityRect.contains(m_hitTestLocation.point())) {
+        tempValidityRect.show(false);
+        m_validityRect.show(false);
+        WTF_LOG_ERROR("Layout point %lf %lf", m_hitTestLocation.point().x().toDouble(), m_hitTestLocation.point().y().toDouble());
+
+        //    ASSERT(false);
+        return;
+    }
+    m_validityRect = tempValidityRect;
+}
+
 String HitTestResult::spellingToolTip(TextDirection& dir) const
 {
     dir = LTR;
     // Return the tool tip string associated with this point, if any. Only markers associated with bad grammar
     // currently supply strings, but maybe someday markers associated with misspelled words will also.
     if (!m_innerNode)
         return String();
 
     DocumentMarker* marker = m_innerNode->document().markers().markerContainingPoint(m_hitTestLocation.point(), DocumentMarker::Grammar);
     if (!marker)
@@ skipping 245 matching lines @@
     ASSERT(m_hitTestLocation.containsPoint(FloatPoint(resolvedPointInMainFrame)));
     m_hitTestLocation = HitTestLocation(resolvedPointInMainFrame);
     m_pointInInnerNodeFrame = resolvedPointInMainFrame;
     m_innerNode = nullptr;
     m_innerPossiblyPseudoNode = nullptr;
     m_listBasedTestResult = nullptr;
 
     // Update the HitTestResult as if the supplied node had been hit in normal point-based hit-test.
     // Note that we don't know the local point after a rect-based hit-test, but we never use
     // it so shouldn't bother with the cost of computing it.
-    resolvedInnerNode->layoutObject()->updateHitTestResult(*this, LayoutPoint());
+    resolvedInnerNode->layoutObject()->updateHitTestResult(*this, LayoutPoint(), m_validityRect);
     ASSERT(!isRectBasedTest());
 }
 
 Element* HitTestResult::innerElement() const
 {
     for (Node* node = m_innerNode.get(); node; node = ComposedTreeTraversal::parent(*node)) {
         if (node->isElementNode())
             return toElement(node);
     }
 
@@ skipping 11 matching lines @@
     else if (isHTMLMapElement(m_innerNode))
         imageMapImageElement = toHTMLMapElement(m_innerNode)->imageElement();
 
     if (!imageMapImageElement)
         return m_innerNode.get();
 
     return imageMapImageElement;
 }
 
 } // namespace blink