Do not traverse nodes not having a layout object while searching editable visible position.

Source/core/editing/htmlediting.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007 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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 337 matching lines @@
     return nextCandidateAlgorithm<EditingStrategy>(position);
 }
 
 PositionInComposedTree nextCandidate(const PositionInComposedTree& position)
 {
     return nextCandidateAlgorithm<EditingInComposedTreeStrategy>(position);
 }
 
 Position nextVisuallyDistinctCandidate(const Position& position)
 {
+    // TODO(changseok): Use PositionIterator instead.
     Position p = position;
     Position downstreamStart = p.downstream();
     while (!p.atEndOfTree()) {
         p = p.next(Character);
         if (p.isCandidate() && p.downstream() != downstreamStart)
             return p;
+        if (auto* node = p.containerNode()) {
+            if (!node->layoutObject())
+                p = lastPositionInOrAfterNode(node);
+        }
     }
     return Position();
 }
 
 template <typename Strategy>
 typename Strategy::PositionType previousCandidateAlgorithm(const typename Strategy::PositionType& position)
 {
     using PositionType = typename Strategy::PositionType;
     PositionIteratorAlgorithm<Strategy> p(position);
     while (!p.atStart()) {
@@ skipping 10 matching lines @@
 }
 
 PositionInComposedTree previousCandidate(const PositionInComposedTree& position)
 {
     return previousCandidateAlgorithm<EditingInComposedTreeStrategy>(position);
 }
 
 template <typename PositionType>
 PositionType previousVisuallyDistinctCandidateAlgorithm(const PositionType& position)
 {
+    // TODO(changseok): Use PositionIterator instead.
     PositionType p = position;
     PositionType downstreamStart = p.downstream();
     while (!p.atStartOfTree()) {
         p = p.previous(Character);
         if (p.isCandidate() && p.downstream() != downstreamStart)
             return p;
+        if (auto* node = p.containerNode()) {
+            if (!node->layoutObject())
+                p = PositionType::firstPositionInOrBeforeNode(node);
+        }
     }
     return PositionType();
 }
 
 Position previousVisuallyDistinctCandidate(const Position& position)
 {
     return previousVisuallyDistinctCandidateAlgorithm<Position>(position);
 }
 
 PositionInComposedTree previousVisuallyDistinctCandidate(const PositionInComposedTree& position)
@@ skipping 938 matching lines @@
     // if the selection starts just before a paragraph break, skip over it
     if (isEndOfParagraph(visiblePosition))
         return visiblePosition.next().deepEquivalent().downstream();
 
     // otherwise, make sure to be at the start of the first selected node,
     // instead of possibly at the end of the last node before the selection
     return visiblePosition.deepEquivalent().downstream();
 }
 
 } // namespace blink