Drop InvalidationSetMode.

Source/core/css/invalidation/DescendantInvalidationSet.cpp

 /*
  * Copyright (C) 2014 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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 22 matching lines @@
 
 #include "core/css/resolver/StyleResolver.h"
 #include "core/dom/Element.h"
 
 namespace blink {
 
 DescendantInvalidationSet::DescendantInvalidationSet()
     : m_allDescendantsMightBeInvalid(false)
     , m_customPseudoInvalid(false)
     , m_treeBoundaryCrossing(false)
+    , m_insertionPointCrossing(false)
 {
 }
 
 bool DescendantInvalidationSet::invalidatesElement(Element& element) const
 {
     if (m_allDescendantsMightBeInvalid)
         return true;
 
     if (m_tagNames && m_tagNames->contains(element.tagQName().localName()))
         return true;
@@ skipping 29 matching lines @@
         setWholeSubtreeInvalid();
         return;
     }
 
     if (other.customPseudoInvalid())
         setCustomPseudoInvalid();
 
     if (other.treeBoundaryCrossing())
         setTreeBoundaryCrossing();
 
+    if (other.insertionPointCrossing())
+        setInsertionPointCrossing();
+
     if (other.m_classes) {
         WillBeHeapHashSet<AtomicString>::const_iterator end = other.m_classes->end();
         for (WillBeHeapHashSet<AtomicString>::const_iterator it = other.m_classes->begin(); it != end; ++it)
             addClass(*it);
     }
 
     if (other.m_ids) {
         WillBeHeapHashSet<AtomicString>::const_iterator end = other.m_ids->end();
         for (WillBeHeapHashSet<AtomicString>::const_iterator it = other.m_ids->begin(); it != end; ++it)
             addId(*it);
@@ skipping 68 matching lines @@
     ensureAttributeSet().add(attribute);
 }
 
 void DescendantInvalidationSet::setWholeSubtreeInvalid()
 {
     if (m_allDescendantsMightBeInvalid)
         return;
 
     m_allDescendantsMightBeInvalid = true;
     m_treeBoundaryCrossing = false;
+    m_insertionPointCrossing = false;
     m_classes = nullptr;
     m_ids = nullptr;
     m_tagNames = nullptr;
     m_attributes = nullptr;
 }
 
 void DescendantInvalidationSet::trace(Visitor* visitor)
 {
 #if ENABLE(OILPAN)
     visitor->trace(m_classes);
     visitor->trace(m_ids);
     visitor->trace(m_tagNames);
     visitor->trace(m_attributes);
 #endif
 }
 
 #ifndef NDEBUG
 void DescendantInvalidationSet::show() const
 {
     fprintf(stderr, "DescendantInvalidationSet { ");
     if (m_allDescendantsMightBeInvalid)
         fprintf(stderr, "* ");
     if (m_customPseudoInvalid)
         fprintf(stderr, "::custom ");
     if (m_treeBoundaryCrossing)
         fprintf(stderr, "::shadow/deep/ ");
+    if (m_insertionPointCrossing)
+        fprintf(stderr, "::content/:host-context ");
     if (m_ids) {
         for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_ids->begin(); it != m_ids->end(); ++it)
             fprintf(stderr, "#%s ", (*it).ascii().data());
     }
     if (m_classes) {
         for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_classes->begin(); it != m_classes->end(); ++it)
             fprintf(stderr, ".%s ", (*it).ascii().data());
     }
     if (m_tagNames) {
         for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_tagNames->begin(); it != m_tagNames->end(); ++it)
             fprintf(stderr, "<%s> ", (*it).ascii().data());
     }
     if (m_attributes) {
         for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_attributes->begin(); it != m_attributes->end(); ++it)
             fprintf(stderr, "[%s] ", (*it).ascii().data());
     }
     fprintf(stderr, "}\n");
 }
 #endif // NDEBUG
 
 } // namespace blink