Oilpan: add transition types to shadow DOM supporting objects.

Source/core/dom/shadow/ContentDistribution.h

 /*
  * Copyright (C) 2013 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 20 matching lines @@
 #ifndef ContentDistribution_h
 #define ContentDistribution_h
 
 #include "core/dom/Node.h"
 #include "wtf/Forward.h"
 #include "wtf/HashMap.h"
 #include "wtf/Vector.h"
 
 namespace WebCore {
 
-class ContentDistribution {
+class ContentDistribution FINAL {
+    ALLOW_ONLY_INLINE_ALLOCATION();

[haraken, 2014/05/12 12:21:38]

This should be DISALLOW_ALLOCATION, since ContentDistribution is a part of
InsertionPoint.

[sof, 2014/05/12 12:37:49]

Yes, got my DISALLOW_ALLOCATION() vs ALLOW_ONLY_INLINE_ALLOCATION() mixed up
here also.

 public:
     ContentDistribution() { m_nodes.reserveInitialCapacity(32); }
 
-    PassRefPtr<Node> first() const { return m_nodes.first(); }
-    PassRefPtr<Node> last() const { return m_nodes.last(); }
-    PassRefPtr<Node> at(size_t index) const { return m_nodes.at(index); }
+    PassRefPtrWillBeRawPtr<Node> first() const { return m_nodes.first(); }
+    PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); }
+    PassRefPtrWillBeRawPtr<Node> at(size_t index) const { return m_nodes.at(index); }
 
     size_t size() const { return m_nodes.size(); }
     bool isEmpty() const { return m_nodes.isEmpty(); }
 
-    void append(PassRefPtr<Node>);
+    void append(PassRefPtrWillBeRawPtr<Node>);
     void clear() { m_nodes.clear(); m_indices.clear(); }
     void shrinkToFit() { m_nodes.shrinkToFit(); }
 
-    bool contains(const Node* node) const { return m_indices.contains(node); }
+    bool contains(const Node* node) const { return m_indices.contains(const_cast<Node*>(node)); }
     size_t find(const Node*) const;
     Node* nextTo(const Node*) const;
     Node* previousTo(const Node*) const;
 
     void swap(ContentDistribution& other);
 
-    const Vector<RefPtr<Node> >& nodes() const { return m_nodes; }
+    const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_nodes; }
+
+    void traceAfterDispatch(Visitor*);

[haraken, 2014/05/12 12:21:38]

Then you can simply use trace().

 
 private:
-    Vector<RefPtr<Node> > m_nodes;
-    HashMap<const Node*, size_t> m_indices;
+    WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes;
+    WillBeHeapHashMap<RawPtrWillBeMember<Node>, size_t> m_indices;
 };
 
 }
 
 #endif