Have HTMLElements / SVGElements constructors take a Document reference in argument

Source/core/html/shadow/HTMLContentElement.cpp

 /*
  * Copyright (C) 2011 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 22 matching lines @@
 #include "core/css/SelectorChecker.h"
 #include "core/css/SiblingTraversalStrategies.h"
 #include "core/dom/QualifiedName.h"
 #include "core/dom/shadow/ElementShadow.h"
 #include "core/dom/shadow/ShadowRoot.h"
 
 namespace WebCore {
 
 using namespace HTMLNames;
 
-PassRefPtr<HTMLContentElement> HTMLContentElement::create(Document* document)
+PassRefPtr<HTMLContentElement> HTMLContentElement::create(Document& document)
 {
     return adoptRef(new HTMLContentElement(contentTag, document));
 }
 
-PassRefPtr<HTMLContentElement> HTMLContentElement::create(const QualifiedName& tagName, Document* document)
+PassRefPtr<HTMLContentElement> HTMLContentElement::create(const QualifiedName& tagName, Document& document)
 {
     return adoptRef(new HTMLContentElement(tagName, document));
 }
 
-HTMLContentElement::HTMLContentElement(const QualifiedName& name, Document* document)
+HTMLContentElement::HTMLContentElement(const QualifiedName& name, Document& document)
     : InsertionPoint(name, document)
     , m_shouldParseSelect(false)
     , m_isValidSelector(true)
 {
     ASSERT(hasTagName(contentTag));
     ScriptWrappable::init(this);
 }
 
 HTMLContentElement::~HTMLContentElement()
 {
@@ skipping 55 matching lines @@
 bool HTMLContentElement::matchSelector(const Vector<Node*>& siblings, int nth) const
 {
     for (const CSSSelector* selector = selectorList().first(); selector; selector = CSSSelectorList::next(selector)) {
         if (checkOneSelector(selector, siblings, nth))
             return true;
     }
     return false;
 }
 
 }