Drop slower Node::hasTagName(QualifiedName) overload

Source/core/css/SiblingTraversalStrategies.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com)
  * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com)
  * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org>
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  * Copyright (c) 2011, Code Aurora Forum. All rights reserved.
  * Copyright (C) Research In Motion Limited 2011. All rights reserved.
@@ skipping 150 matching lines @@
     }
 
     return true;
 }
 
 inline bool ShadowDOMSiblingTraversalStrategy::isFirstOfType(Element& element, const QualifiedName& type) const
 {
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     for (int i = m_nth - 1; i >= 0; --i) {
-        if (m_siblings[i]->hasTagName(type))
+        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
             return false;
     }
 
     return true;
 }
 
 inline bool ShadowDOMSiblingTraversalStrategy::isLastOfType(Element& element, const QualifiedName& type) const
 {
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
-        if (m_siblings[i]->hasTagName(type))
+        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
             return false;
     }
 
     return true;
 }
 
 inline int ShadowDOMSiblingTraversalStrategy::countElementsBefore(Element& element) const
 {
     ASSERT(element == toElement(m_siblings[m_nth]));
 
@@ skipping 18 matching lines @@
 
     return count;
 }
 
 inline int ShadowDOMSiblingTraversalStrategy::countElementsOfTypeBefore(Element& element, const QualifiedName& type) const
 {
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     int count = 0;
     for (int i = m_nth - 1; i >= 0; --i) {
-        if (m_siblings[i]->hasTagName(type))
+        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
             ++count;
     }
 
     return count;
 }
 
 inline int ShadowDOMSiblingTraversalStrategy::countElementsOfTypeAfter(Element& element, const QualifiedName& type) const
 {
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     int count = 0;
     for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
-        if (m_siblings[i]->hasTagName(type))
+        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
             return ++count;
     }
 
     return count;
 }
 
 }
 
 #endif