Make toPositionInFlatTree() to handle a position anchored by shadow root

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

 /*
  * Copyright (C) 2004, 2005, 2006, 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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 495 matching lines @@
     }
 
     fprintf(stderr, "Position [%s]: %s [%p] %s at %d\n", msg, anchorNode()->nodeName().utf8().data(), anchorNode(), anchorType, m_offset);
 }
 
 PositionInFlatTree toPositionInFlatTree(const Position& pos)
 {
     if (pos.isNull())
         return PositionInFlatTree();
 
+    Node* const anchor = pos.anchorNode();
     if (pos.isOffsetInAnchor()) {
-        Node* anchor = pos.anchorNode();
         if (anchor->isCharacterDataNode())
             return PositionInFlatTree(anchor, pos.computeOffsetInContainerNode());
         DCHECK(!anchor->isSlotOrActiveInsertionPoint());
         int offset = pos.computeOffsetInContainerNode();
         Node* child = NodeTraversal::childAt(*anchor, offset);
         if (!child) {
             if (anchor->isShadowRoot())
                 return PositionInFlatTree(anchor->shadowHost(), PositionAnchorType::AfterChildren);
             return PositionInFlatTree(anchor, PositionAnchorType::AfterChildren);
         }
         child->updateDistribution();
         if (child->isSlotOrActiveInsertionPoint()) {
             if (anchor->isShadowRoot())
                 return PositionInFlatTree(anchor->shadowHost(), offset);
             return PositionInFlatTree(anchor, offset);
         }
         if (Node* parent = FlatTreeTraversal::parent(*child))
             return PositionInFlatTree(parent, FlatTreeTraversal::index(*child));
         // When |pos| isn't appeared in flat tree, we map |pos| to after
         // children of shadow host.
         // e.g. "foo",0 in <progress>foo</progress>
         if (anchor->isShadowRoot())
             return PositionInFlatTree(anchor->shadowHost(), PositionAnchorType::AfterChildren);
         return PositionInFlatTree(anchor, PositionAnchorType::AfterChildren);
     }
 
-    return PositionInFlatTree(pos.anchorNode(), pos.anchorType());
+    if (anchor->isShadowRoot())
+        return PositionInFlatTree(anchor->shadowHost(), pos.anchorType());
+    // TODO(yosin): Once we have a test case for SLOT or active insertion point,
+    // this function should handle it.
+    return PositionInFlatTree(anchor, pos.anchorType());
 }
 
 Position toPositionInDOMTree(const Position& position)
 {
     return position;
 }
 
 Position toPositionInDOMTree(const PositionInFlatTree& position)
 {
     if (position.isNull())
@@ skipping 148 matching lines @@
 
 void showTree(const blink::Position* pos)
 {
     if (pos)
         pos->showTreeForThis();
     else
         fprintf(stderr, "Cannot showTree for (nil)\n");
 }
 
 #endif