Make appendChild/insertBefore faster with active ranges

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
  * modify it under the terms of the GNU Library General Public
@@ skipping 1321 matching lines @@
 {
     if (a == b)
         return true;
     if (!a || !b)
         return false;
     return a->startPosition() == b->startPosition() && a->endPosition() == b->endPosition();
 }
 
 static inline void boundaryNodeChildrenChanged(RangeBoundaryPoint& boundary, ContainerNode* container)
 {
+    boundary.markValid();
     if (!boundary.childBefore())
         return;
     if (boundary.container() != container)
         return;
     boundary.invalidateOffset();
 }
 
 void Range::nodeChildrenChanged(ContainerNode* container)
 {
     DCHECK(container);
@@ skipping 49 matching lines @@
     // FIXME: Once DOMNodeRemovedFromDocument mutation event removed, we
     // should change following if-statement to DCHECK(!node->parentNode).
     if (!node.parentNode())
         return;
     boundaryNodeWillBeRemoved(m_start, node);
     boundaryNodeWillBeRemoved(m_end, node);
 }
 
 static inline void boundaryTextInserted(RangeBoundaryPoint& boundary, Node* text, unsigned offset, unsigned length)
 {
+    boundary.markValid();
     if (boundary.container() != text)
         return;
     unsigned boundaryOffset = boundary.offset();
     if (offset >= boundaryOffset)
         return;
     boundary.setOffset(boundaryOffset + length);
 }
 
 void Range::didInsertText(Node* text, unsigned offset, unsigned length)
 {
     DCHECK(text);
     DCHECK_EQ(text->document(), m_ownerDocument);
     boundaryTextInserted(m_start, text, offset, length);
     boundaryTextInserted(m_end, text, offset, length);
 }
 
 static inline void boundaryTextRemoved(RangeBoundaryPoint& boundary, Node* text, unsigned offset, unsigned length)
 {
+    boundary.markValid();
     if (boundary.container() != text)
         return;
     unsigned boundaryOffset = boundary.offset();
     if (offset >= boundaryOffset)
         return;
     if (offset + length >= boundaryOffset)
         boundary.setOffset(offset);
     else
         boundary.setOffset(boundaryOffset - length);
 }
@@ skipping 168 matching lines @@
 {
     if (range && range->boundaryPointsValid()) {
         range->startContainer()->showTreeAndMark(range->startContainer(), "S", range->endContainer(), "E");
         fprintf(stderr, "start offset: %d, end offset: %d\n", range->startOffset(), range->endOffset());
     } else {
         fprintf(stderr, "Cannot show tree if range is null, or if boundary points are invalid.\n");
     }
 }
 
 #endif