Make sure the rootNode of a LiveNodeListBase is always a ContainerNode

Source/core/html/HTMLCollection.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
@@ skipping 15 matching lines @@
 #include "core/dom/LiveNodeList.h"
 #include "core/html/CollectionType.h"
 #include "wtf/Forward.h"
 #include "wtf/HashMap.h"
 #include "wtf/Vector.h"
 
 namespace WebCore {
 
 class HTMLCollection : public ScriptWrappable, public RefCounted<HTMLCollection>, public LiveNodeListBase {
 public:
-    static PassRefPtr<HTMLCollection> create(Node* base, CollectionType);
+    static PassRefPtr<HTMLCollection> create(ContainerNode* base, CollectionType);
     virtual ~HTMLCollection();
     virtual void invalidateCache() const OVERRIDE;
 
     // DOM API
     virtual Node* namedItem(const AtomicString& name) const;
 
     // Non-DOM API
     void namedItems(const AtomicString& name, Vector<RefPtr<Node> >&) const;
     bool isEmpty() const
     {
         if (isLengthCacheValid())
             return !cachedLength();
         if (isItemCacheValid())
             return !cachedItem();
         return !item(0);
     }
     bool hasExactlyOneItem() const
     {
         if (isLengthCacheValid())
             return cachedLength() == 1;
         if (isItemCacheValid())
             return cachedItem() && !cachedItemOffset() && !item(1);
         return item(0) && !item(1);
     }
 
     virtual Element* virtualItemAfter(Element*) const;
 
     Element* traverseToFirstElement(ContainerNode& root) const;
-    Element* traverseForwardToOffset(unsigned offset, Element& currentElement, unsigned& currentOffset, ContainerNode* root) const;
+    Element* traverseForwardToOffset(unsigned offset, Element& currentElement, unsigned& currentOffset, ContainerNode& root) const;
 
 protected:
-    HTMLCollection(Node* base, CollectionType, ItemAfterOverrideType);
+    HTMLCollection(ContainerNode* base, CollectionType, ItemAfterOverrideType);
 
     virtual void updateNameCache() const;
     bool hasNameCache() const { return m_isNameCacheValid; }
     void setHasNameCache() const { m_isNameCacheValid = true; }
 
     typedef HashMap<StringImpl*, OwnPtr<Vector<Element*> > > NodeCacheMap;
     Vector<Element*>* idCache(const AtomicString& name) const { return m_idCache.get(name.impl()); }
     Vector<Element*>* nameCache(const AtomicString& name) const { return m_nameCache.get(name.impl()); }
     void appendIdCache(const AtomicString& name, Element* element) const { append(m_idCache, name, element); }
     void appendNameCache(const AtomicString& name, Element* element) const { append(m_nameCache, name, element); }
 
 private:
     bool checkForNameMatch(Element*, bool checkName, const AtomicString& name) const;
-    Element* traverseNextElement(Element& previous, ContainerNode* root) const;
+    Element* traverseNextElement(Element& previous, ContainerNode& root) const;
 
     static void append(NodeCacheMap&, const AtomicString&, Element*);
     void invalidateIdNameCacheMaps() const
     {
         m_idCache.clear();
         m_nameCache.clear();
         m_isNameCacheValid = false;
     }
 
     mutable unsigned m_isNameCacheValid : 1;
     mutable NodeCacheMap m_idCache;
     mutable NodeCacheMap m_nameCache;
 
     friend class LiveNodeListBase;
 };
 
 } // namespace
 
 #endif