Make ElementShadow::youngestShadowRoot() return a reference

third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.cpp

 /*
  * Copyright (C) 2012 Google 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 23 matching lines @@
 namespace blink {
 
 static inline ElementShadow* shadowFor(const Node& node)
 {
     return node.isElementNode() ? toElement(node).shadow() : 0;
 }
 
 Node* ComposedTreeTraversal::traverseChild(const Node& node, TraversalDirection direction)
 {
     ElementShadow* shadow = shadowFor(node);
-    return shadow ? traverseLightChildren(*shadow->youngestShadowRoot(), direction)
+    return shadow ? traverseLightChildren(shadow->youngestShadowRoot(), direction)
         : traverseLightChildren(node, direction);
 }
 
 Node* ComposedTreeTraversal::traverseLightChildren(const Node& node, TraversalDirection direction)
 {
     return traverseSiblings(direction == TraversalDirectionForward ? node.firstChild() : node.lastChild(), direction);
 }
 
 Node* ComposedTreeTraversal::traverseSiblings(const Node* node, TraversalDirection direction)
 {
@@ skipping 245 matching lines @@
 Node& ComposedTreeTraversal::lastWithinOrSelf(const Node& node)
 {
     assertPrecondition(node);
     Node* lastDescendant = lastWithin(node);
     Node& result = lastDescendant ? *lastDescendant : const_cast<Node&>(node);
     assertPostcondition(&result);
     return result;
 }
 
 } // namespace