Oilpan: fix build after r201058.

Source/core/css/invalidation/StyleSheetInvalidationAnalysis.cpp

 /*
  * Copyright (C) 2012 Apple 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 21 matching lines @@
 #include "core/dom/ContainerNode.h"
 #include "core/dom/Document.h"
 #include "core/dom/ElementTraversal.h"
 #include "core/dom/TreeScope.h"
 #include "core/dom/shadow/ShadowRoot.h"
 #include "core/html/HTMLStyleElement.h"
 
 namespace blink {
 
 StyleSheetInvalidationAnalysis::StyleSheetInvalidationAnalysis(const TreeScope& treeScope, const WillBeHeapVector<RawPtrWillBeMember<StyleSheetContents>>& sheets)
-    : m_treeScope(treeScope)
+    : m_treeScope(&treeScope)
 {
     for (unsigned i = 0; i < sheets.size() && !m_dirtiesAllStyle; ++i)
         analyzeStyleSheet(sheets[i]);
 }
 
 static bool determineSelectorScopes(const CSSSelectorList& selectorList, HashSet<StringImpl*>& idScopes, HashSet<StringImpl*>& classScopes)
 {
     for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(*selector)) {
         const CSSSelector* scopeSelector = 0;
         // This picks the widest scope, not the narrowest, to minimize the number of found scopes.
@@ skipping 79 matching lines @@
     // Then test if we actually have any of those in the tree at the moment.
     const WillBeHeapVector<RefPtrWillBeMember<StyleRuleImport>>& importRules = styleSheetContents->importRules();
     for (unsigned i = 0; i < importRules.size(); ++i) {
         if (!importRules[i]->styleSheet())
             continue;
         analyzeStyleSheet(importRules[i]->styleSheet());
         if (m_dirtiesAllStyle)
             return;
     }
 
-    if (m_treeScope.rootNode().isShadowRoot()) {
+    if (m_treeScope->rootNode().isShadowRoot()) {
         if (hasDistributedRule(styleSheetContents))
             m_hasDistributedRules = true;
         return;
     }
 
     const WillBeHeapVector<RefPtrWillBeMember<StyleRuleBase>>& rules = styleSheetContents->childRules();
     for (unsigned i = 0; i < rules.size(); i++) {
         StyleRuleBase* rule = rules[i].get();
         if (!rule->isStyleRule()) {
             if (ruleAdditionMightRequireDocumentStyleRecalc(rule)) {
@@ skipping 29 matching lines @@
     ContainerNode* host = root.host();
     while (host->isInShadowTree())
         host = host->containingShadowRoot()->host();
     return host;
 }
 
 void StyleSheetInvalidationAnalysis::invalidateStyle()
 {
     ASSERT(!m_dirtiesAllStyle);
 
-    if (m_treeScope.rootNode().isShadowRoot()) {
-        ContainerNode* invalidationRoot = &m_treeScope.rootNode();
+    if (m_treeScope->rootNode().isShadowRoot()) {
+        ContainerNode* invalidationRoot = &m_treeScope->rootNode();
         if (m_hasDistributedRules)
             invalidationRoot = outermostShadowHost(*toShadowRoot(invalidationRoot));
         invalidationRoot->setNeedsStyleRecalc(SubtreeStyleChange, StyleChangeReasonForTracing::create(StyleChangeReason::StyleSheetChange));
         return;
     }
 
     if (m_idScopes.isEmpty() && m_classScopes.isEmpty())
         return;
-    Element* element = ElementTraversal::firstWithin(m_treeScope.document());
+    Element* element = ElementTraversal::firstWithin(m_treeScope->document());
     while (element) {
         if (elementMatchesSelectorScopes(element, m_idScopes, m_classScopes)) {
             element->setNeedsStyleRecalc(SubtreeStyleChange, StyleChangeReasonForTracing::create(StyleChangeReason::StyleSheetChange));
             // The whole subtree is now invalidated, we can skip to the next sibling.
             element = ElementTraversal::nextSkippingChildren(*element);
             continue;
         }
         element = ElementTraversal::next(*element);
     }
 }
 
 }