[Experiment] DCHECK clean layout tree in mostForward/BackwardCaretPosition

third_party/WebKit/Source/core/editing/VisibleUnits.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple 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
@@ skipping 2803 matching lines @@
 template <typename Strategy>
 static PositionTemplate<Strategy> mostBackwardCaretPosition(
     const PositionTemplate<Strategy>& position,
     EditingBoundaryCrossingRule rule) {
   TRACE_EVENT0("input", "VisibleUnits::mostBackwardCaretPosition");
 
   Node* startNode = position.anchorNode();
   if (!startNode)
     return PositionTemplate<Strategy>();
 
+  if (!startNode->document().frame()->selection().inUpdateSelectionIfNeeded())
+    DCHECK(!startNode->document().needsLayoutTreeUpdate());
   // iterate backward from there, looking for a qualified position
   Node* boundary = enclosingVisualBoundary<Strategy>(startNode);
   // FIXME: PositionIterator should respect Before and After positions.
   PositionIteratorAlgorithm<Strategy> lastVisible(
       position.isAfterAnchor()
           ? PositionTemplate<Strategy>::editingPositionOf(
                 position.anchorNode(),
                 Strategy::caretMaxOffset(*position.anchorNode()))
           : position);
   PositionIteratorAlgorithm<Strategy> currentPos = lastVisible;
@@ skipping 154 matching lines @@
 template <typename Strategy>
 PositionTemplate<Strategy> mostForwardCaretPosition(
     const PositionTemplate<Strategy>& position,
     EditingBoundaryCrossingRule rule) {
   TRACE_EVENT0("input", "VisibleUnits::mostForwardCaretPosition");
 
   Node* startNode = position.anchorNode();
   if (!startNode)
     return PositionTemplate<Strategy>();
 
+  if (!startNode->document().frame()->selection().inUpdateSelectionIfNeeded())
+    DCHECK(!startNode->document().needsLayoutTreeUpdate());
   // iterate forward from there, looking for a qualified position
   Node* boundary = enclosingVisualBoundary<Strategy>(startNode);
   // FIXME: PositionIterator should respect Before and After positions.
   PositionIteratorAlgorithm<Strategy> lastVisible(
       position.isAfterAnchor()
           ? PositionTemplate<Strategy>::editingPositionOf(
                 position.anchorNode(),
                 Strategy::caretMaxOffset(*position.anchorNode()))
           : position);
   PositionIteratorAlgorithm<Strategy> currentPos = lastVisible;
@@ skipping 893 matching lines @@
 
 VisiblePositionInFlatTree previousPositionOf(
     const VisiblePositionInFlatTree& visiblePosition,
     EditingBoundaryCrossingRule rule) {
   DCHECK(visiblePosition.isValid()) << visiblePosition;
   return previousPositionOfAlgorithm<EditingInFlatTreeStrategy>(
       visiblePosition.deepEquivalent(), rule);
 }
 
 }  // namespace blink