Remove OILPAN from core/dom/shadow/

third_party/WebKit/Source/core/dom/shadow/ElementShadow.h

 /*
  * Copyright (C) 2012 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 58 matching lines @@
     void didDistributeNode(const Node*, InsertionPoint*);
 
     bool isV1() const { return youngestShadowRoot().isV1(); };
     bool isOpenOrV0() const { return youngestShadowRoot().isOpenOrV0(); };
 
     DECLARE_TRACE();
 
 private:
     ElementShadow();
 
-#if !ENABLE(OILPAN)
-    void removeDetachedShadowRoots();
-#endif
-
     void distribute();
     void clearDistribution();
 
     void distributeV0();
     void distributeV1();
 
     void collectSelectFeatureSetFrom(ShadowRoot&);
     void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*);
 
     bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; }
     void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; }
 
-#if ENABLE(OILPAN)
-    // The cost of |new| in Oilpan is lower than non-Oilpan.  We should reduce
-    // the size of HashMap entry.
-    typedef HeapHashMap<Member<const Node>, Member<DestinationInsertionPoints>> NodeToDestinationInsertionPoints;
-#else
-    typedef HashMap<const Node*, DestinationInsertionPoints> NodeToDestinationInsertionPoints;
-#endif
+    using NodeToDestinationInsertionPoints = HeapHashMap<Member<const Node>, Member<DestinationInsertionPoints>>;
     NodeToDestinationInsertionPoints m_nodeToInsertionPoints;
 
     SelectRuleFeatureSet m_selectFeatures;
-    // FIXME: Oilpan: add a heap-based version of DoublyLinkedList<>.
+    // TODO(Oilpan): add a heap-based version of DoublyLinkedList<>.
     DoublyLinkedList<ShadowRoot> m_shadowRoots;
     bool m_needsDistributionRecalc;
     bool m_needsSelectFeatureSet;
 };
 
 inline Element* ElementShadow::host() const
 {
     DCHECK(!m_shadowRoots.isEmpty());
     return youngestShadowRoot().host();
 }
@@ skipping 22 matching lines @@
 inline void ElementShadow::distributeIfNeeded()
 {
     if (m_needsDistributionRecalc)
         distribute();
     m_needsDistributionRecalc = false;
 }
 
 } // namespace blink
 
 #endif