Make RenderedRectsForMarkers() to ignore disconnected nodes.

third_party/WebKit/Source/core/dom/Range.cpp

 /*
  * (C) 1999 Lars Knoll (knoll@kde.org)
  * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)
  * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All
  * rights reserved.
  * Copyright (C) 2011 Motorola Mobility. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
@@ skipping 1425 matching lines @@
 
 Node* Range::pastLastNode() const {
   if (m_end.container()->isCharacterDataNode())
     return NodeTraversal::nextSkippingChildren(*m_end.container());
   if (Node* child = NodeTraversal::childAt(*m_end.container(), m_end.offset()))
     return child;
   return NodeTraversal::nextSkippingChildren(*m_end.container());
 }
 
 IntRect Range::boundingBox() const {
-  IntRect result;
-  Vector<IntRect> rects;
-  textRects(rects);
-  for (const IntRect& rect : rects)
-    result.unite(rect);
-  return result;
-}
-
-void Range::textRects(Vector<IntRect>& rects, bool useSelectionHeight) const {
-  Node* startContainer = m_start.container();
-  DCHECK(startContainer);
-  Node* endContainer = m_end.container();
-  DCHECK(endContainer);
-
-  Node* stopNode = pastLastNode();
-  for (Node* node = firstNode(); node != stopNode;
-       node = NodeTraversal::next(*node)) {
-    LayoutObject* r = node->layoutObject();
-    if (!r || !r->isText())
-      continue;
-    LayoutText* layoutText = toLayoutText(r);
-    unsigned startOffset = node == startContainer ? m_start.offset() : 0;
-    unsigned endOffset = node == endContainer
-                             ? m_end.offset()
-                             : std::numeric_limits<unsigned>::max();
-    layoutText->absoluteRectsForRange(rects, startOffset, endOffset,
-                                      useSelectionHeight);
-  }
+  return computeBoundingBox(EphemeralRange(this));
 }
 
 void Range::textQuads(Vector<FloatQuad>& quads, bool useSelectionHeight) const {
   Node* startContainer = m_start.container();
   DCHECK(startContainer);
   Node* endContainer = m_end.container();
   DCHECK(endContainer);
 
   Node* stopNode = pastLastNode();
   for (Node* node = firstNode(); node != stopNode;
@@ skipping 328 matching lines @@
                      .data()
               << "start offset: " << range->startOffset()
               << ", end offset: " << range->endOffset();
   } else {
     LOG(INFO) << "Cannot show tree if range is null, or if boundary points are "
                  "invalid.";
   }
 }
 
 #endif