Oilpan: fix build after r192502.

Source/core/dom/shadow/ComposedTreeTraversalTest.cpp

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "config.h"
 #include "core/dom/shadow/ComposedTreeTraversal.h"
 
 #include "bindings/core/v8/ExceptionStatePlaceholder.h"
 #include "core/dom/Document.h"
 #include "core/dom/Element.h"
@@ skipping 164 matching lines @@
     RefPtrWillBeRawPtr<Element> m0 = body->querySelector("#m0", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m1 = body->querySelector("#m1", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m2 = body->querySelector("#m2", ASSERT_NO_EXCEPTION);
 
     RefPtrWillBeRawPtr<Element> m00 = body->querySelector("#m00", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m01 = body->querySelector("#m01", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m10 = body->querySelector("#m10", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m11 = body->querySelector("#m11", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m12 = body->querySelector("#m12", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> m20 = body->querySelector("#m20", ASSERT_NO_EXCEPTION);
-    RefPtrWillBeRawPtr<Element> m21 = body->querySelector("#m20", ASSERT_NO_EXCEPTION);
+    RefPtrWillBeRawPtr<Element> m21 = body->querySelector("#m21", ASSERT_NO_EXCEPTION);
 
     RefPtrWillBeRawPtr<ShadowRoot> shadowRoot = m1->shadowRoot();
     RefPtrWillBeRawPtr<Element> s10 = shadowRoot->querySelector("#s10", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> s11 = shadowRoot->querySelector("#s11", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> s12 = shadowRoot->querySelector("#s12", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> s13 = shadowRoot->querySelector("#s13", ASSERT_NO_EXCEPTION);
     RefPtrWillBeRawPtr<Element> s14 = shadowRoot->querySelector("#s14", ASSERT_NO_EXCEPTION);
 
     testCommonAncestor(body.get(), *m0, *m1);
     testCommonAncestor(body.get(), *m1, *m2);
     testCommonAncestor(body.get(), *m1, *m20);
     testCommonAncestor(body.get(), *s14, *m21);
 
     testCommonAncestor(m0.get(), *m0, *m0);
+    testCommonAncestor(m0.get(), *m00, *m01);
 
     testCommonAncestor(m1.get(), *m1.get(), *m1);
     testCommonAncestor(m1.get(), *s10, *s14);
     testCommonAncestor(m1.get(), *s10, *m12);
     testCommonAncestor(m1.get(), *s12, *m12);
     testCommonAncestor(m1.get(), *m10, *m12);
 
     testCommonAncestor(m01.get(), *m01, *m01);
     testCommonAncestor(s11.get(), *s11, *m12);
     testCommonAncestor(s13.get(), *m10, *m11);
@@ skipping 62 matching lines @@
 
     EXPECT_EQ(*m10, ComposedTreeTraversal::nextSkippingChildren(*s120));
     EXPECT_EQ(*s120, ComposedTreeTraversal::previousSkippingChildren(*m10));
 
     // Node in shadow tree to main tree
     EXPECT_EQ(*m2, ComposedTreeTraversal::nextSkippingChildren(*s12));
     EXPECT_EQ(*m1, ComposedTreeTraversal::previousSkippingChildren(*m2));
 }
 
 } // namespace